1. 457.42 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  2. 457.42 s [Cabal-syntax] - Distribution.Types.AbiDependency.Rep_AbiDependency
  3. 457.42 s [Cabal-syntax] Warning: Distribution.License: could not find link destinations for:
  4. 457.42 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  5. 457.42 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  6. 457.42 s [Cabal-syntax] - Distribution.License.Rep_License
  7. 457.43 s [Cabal-syntax] Warning: Distribution.Types.InstalledPackageInfo: could not find link destinations for:
  8. 457.43 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  9. 457.43 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  10. 457.44 s [Cabal-syntax] - Distribution.Types.ExposedModule.Rep_ExposedModule
  11. 457.44 s [Cabal-syntax] - Distribution.Types.AbiDependency.Rep_AbiDependency
  12. 457.44 s [Cabal-syntax] - Distribution.Types.InstalledPackageInfo.D:R:KeyInstalledPackageInfo
  13. 457.44 s [Cabal-syntax] - Distribution.Types.InstalledPackageInfo.Rep_InstalledPackageInfo
  14. 457.45 s [Cabal-syntax] Warning: Distribution.Types.InstalledPackageInfo.Lens: could not find link destinations for:
  15. 457.45 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  16. 457.45 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  17. 457.45 s [Cabal-syntax] - Distribution.Types.InstalledPackageInfo.D:R:KeyInstalledPackageInfo
  18. 457.45 s [Cabal-syntax] - Distribution.Types.InstalledPackageInfo.Rep_InstalledPackageInfo
  19. 457.48 s [Cabal-syntax] Warning: Distribution.Fields: could not find link destinations for:
  20. 457.48 s [Cabal-syntax] - Distribution.Parsec.Warning.Rep_PWarning
  21. 457.48 s [Cabal-syntax] - Distribution.Parsec.Warning.Rep_PWarnType
  22. 457.48 s [Cabal-syntax] - Distribution.Parsec.Error.Rep_PError
  23. 457.51 s [Cabal-syntax] Warning: Language.Haskell.Extension: could not find link destinations for:
  24. 457.51 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  25. 457.51 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  26. 457.51 s [Cabal-syntax] - Language.Haskell.Extension.Rep_Extension
  27. 457.51 s [Cabal-syntax] - Language.Haskell.Extension.Rep_KnownExtension
  28. 457.51 s [Cabal-syntax] - Language.Haskell.Extension.Rep_Language
  29. 457.53 s [Cabal-syntax] Warning: Distribution.Compiler: could not find link destinations for:
  30. 457.53 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  31. 457.53 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  32. 457.53 s [Cabal-syntax] - Distribution.Compiler.Rep_CompilerInfo
  33. 457.53 s [Cabal-syntax] - Distribution.Compiler.Rep_AbiTag
  34. 457.53 s [Cabal-syntax] - Distribution.Compiler.Rep_CompilerId
  35. 457.53 s [Cabal-syntax] - Distribution.Compiler.Rep_PerCompilerFlavor
  36. 457.53 s [Cabal-syntax] - Distribution.Compiler.Rep_CompilerFlavor
  37. 457.53 s [Cabal-syntax] Warning: Distribution.Types.ConfVar: could not find link destinations for:
  38. 457.53 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  39. 457.53 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  40. 457.53 s [Cabal-syntax] - Distribution.Types.ConfVar.Rep_ConfVar
  41. 457.54 s [Cabal-syntax] Warning: Distribution.Types.BuildInfo: could not find link destinations for:
  42. 457.54 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  43. 457.54 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  44. 457.54 s [Cabal-syntax] - Distribution.Types.BuildInfo.Rep_BuildInfo
  45. 457.56 s [Cabal-syntax] Warning: Distribution.Types.BuildInfo.Lens: could not find link destinations for:
  46. 457.56 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  47. 457.56 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  48. 457.56 s [Cabal-syntax] - Distribution.Types.BuildInfo.Rep_BuildInfo
  49. 457.57 s [Cabal-syntax] Warning: Distribution.Types.TestSuite: could not find link destinations for:
  50. 457.57 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  51. 457.57 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  52. 457.57 s [Cabal-syntax] - Distribution.Types.TestSuite.Rep_TestSuite
  53. 457.57 s [Cabal-syntax] Warning: Distribution.Types.TestSuite.Lens: could not find link destinations for:
  54. 457.57 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  55. 457.57 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  56. 457.57 s [Cabal-syntax] - Distribution.Types.TestSuite.Rep_TestSuite
  57. 457.58 s [Cabal-syntax] Warning: Distribution.Types.Library: could not find link destinations for:
  58. 457.58 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  59. 457.58 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  60. 457.58 s [Cabal-syntax] - Distribution.Types.Library.Rep_Library
  61. 457.59 s [Cabal-syntax] Warning: Distribution.Types.Library.Lens: could not find link destinations for:
  62. 457.59 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  63. 457.59 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  64. 457.59 s [Cabal-syntax] - Distribution.Types.Library.Rep_Library
  65. 457.59 s [Cabal-syntax] Warning: Distribution.Types.ForeignLib: could not find link destinations for:
  66. 457.59 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  67. 457.59 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  68. 457.59 s [Cabal-syntax] - Distribution.Types.ForeignLib.Rep_ForeignLib
  69. 457.59 s [Cabal-syntax] - Distribution.Types.ForeignLib.Rep_LibVersionInfo
  70. 457.60 s [Cabal-syntax] Warning: Distribution.Types.ForeignLib.Lens: could not find link destinations for:
  71. 457.60 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  72. 457.60 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  73. 457.60 s [Cabal-syntax] - Distribution.Types.ForeignLib.Rep_ForeignLib
  74. 457.61 s [Cabal-syntax] Warning: Distribution.Types.Executable: could not find link destinations for:
  75. 457.61 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  76. 457.61 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  77. 457.61 s [Cabal-syntax] - Distribution.Types.Executable.Rep_Executable
  78. 457.61 s [Cabal-syntax] Warning: Distribution.Types.Executable.Lens: could not find link destinations for:
  79. 457.61 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  80. 457.61 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  81. 457.61 s [Cabal-syntax] - Distribution.Types.Executable.Rep_Executable
  82. 457.61 s [Cabal-syntax] Warning: Distribution.Types.Benchmark: could not find link destinations for:
  83. 457.61 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  84. 457.61 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  85. 457.61 s [Cabal-syntax] - Distribution.Types.Benchmark.Rep_Benchmark
  86. 457.62 s [Cabal-syntax] Warning: Distribution.Types.Component: could not find link destinations for:
  87. 457.62 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  88. 457.62 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  89. 457.62 s [Cabal-syntax] - Distribution.Types.Component.Rep_Component
  90. 457.62 s [Cabal-syntax] Warning: Distribution.Types.ComponentRequestedSpec: could not find link destinations for:
  91. 457.62 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  92. 457.62 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  93. 457.62 s [Cabal-syntax] - Distribution.Types.ComponentRequestedSpec.Rep_ComponentRequestedSpec
  94. 457.64 s [Cabal-syntax] Warning: Distribution.Types.PackageDescription: could not find link destinations for:
  95. 457.64 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  96. 457.64 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  97. 457.64 s [Cabal-syntax] - Distribution.Types.PackageDescription.Rep_PackageDescription
  98. 457.65 s [Cabal-syntax] Warning: Distribution.Types.GenericPackageDescription: could not find link destinations for:
  99. 457.65 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  100. 457.65 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  101. 457.65 s [Cabal-syntax] - Distribution.Types.GenericPackageDescription.Rep_GenericPackageDescription
  102. 457.65 s [Cabal-syntax] Warning: Distribution.Types.GenericPackageDescription.Lens: could not find link destinations for:
  103. 457.65 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  104. 457.65 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  105. 457.65 s [Cabal-syntax] - Distribution.Types.Flag.Rep_PackageFlag
  106. 457.65 s [Cabal-syntax] - Distribution.Types.Flag.Rep_FlagName
  107. 457.65 s [Cabal-syntax] - Distribution.Types.ConfVar.Rep_ConfVar
  108. 457.65 s [Cabal-syntax] - Distribution.Types.GenericPackageDescription.Rep_GenericPackageDescription
  109. 457.66 s [Cabal-syntax] Warning: Distribution.Types.Benchmark.Lens: could not find link destinations for:
  110. 457.66 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  111. 457.66 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  112. 457.66 s [Cabal-syntax] - Distribution.Types.Benchmark.Rep_Benchmark
  113. 457.67 s [Cabal-syntax] Warning: Distribution.Types.PackageDescription.Lens: could not find link destinations for:
  114. 457.67 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  115. 457.67 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  116. 457.67 s [Cabal-syntax] - Distribution.Types.PackageDescription.Rep_PackageDescription
  117. 457.75 s [Cabal-syntax] Warning: Distribution.Types.InstalledPackageInfo.FieldGrammar: could not find link destinations for:
  118. 457.75 s [Cabal-syntax] - Distribution.Types.InstalledPackageInfo.FieldGrammar.Basic
  119. 457.75 s [Cabal-syntax] - Distribution.Types.InstalledPackageInfo.FieldGrammar.SpecLicenseLenient
  120. 457.75 s [Cabal-syntax] - Distribution.Types.InstalledPackageInfo.FieldGrammar.InstWith
  121. 457.75 s [Cabal-syntax] - Distribution.Types.InstalledPackageInfo.FieldGrammar.CompatPackageKey
  122. 457.75 s [Cabal-syntax] - Distribution.Types.InstalledPackageInfo.FieldGrammar.ExposedModules
  123. 457.77 s [Cabal-syntax] Warning: Distribution.InstalledPackageInfo: could not find link destinations for:
  124. 457.77 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  125. 457.77 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  126. 457.77 s [Cabal-syntax] - Distribution.Types.ExposedModule.Rep_ExposedModule
  127. 457.77 s [Cabal-syntax] - Distribution.Types.AbiDependency.Rep_AbiDependency
  128. 457.77 s [Cabal-syntax] - Distribution.Types.InstalledPackageInfo.D:R:KeyInstalledPackageInfo
  129. 457.77 s [Cabal-syntax] - Distribution.Types.InstalledPackageInfo.Rep_InstalledPackageInfo
  130. 490.86 s [Cabal-syntax] Documentation created: dist/doc/html/Cabal-syntax/,
  131. 490.86 s [Cabal-syntax] dist/doc/html/Cabal-syntax/Cabal-syntax.txt
  132. 490.98 s [Cabal-syntax] haddockPhase completed in 1 minutes 20 seconds
  133. 491.02 s [Cabal-syntax] Phase: installPhase
  134. 491.26 s [Cabal-syntax] Installing library in /nix/store/rhfkd4j7g7kf3gr8kyfxwbw7rq872ci5-Cabal-syntax-3.12.1.0/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A
  135. 499.48 s [Cabal-syntax] Phase: fixupPhase
  136. 499.65 s [Cabal-syntax] shrinking RPATHs of ELF executables and libraries in /nix/store/rhfkd4j7g7kf3gr8kyfxwbw7rq872ci5-Cabal-syntax-3.12.1.0
  137. 499.69 s [Cabal-syntax] shrinking /nix/store/rhfkd4j7g7kf3gr8kyfxwbw7rq872ci5-Cabal-syntax-3.12.1.0/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/libHSCabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A-ghc9.8.4.so
  138. 500.38 s [Cabal-syntax] checking for references to /build/ in /nix/store/rhfkd4j7g7kf3gr8kyfxwbw7rq872ci5-Cabal-syntax-3.12.1.0...
  139. 500.54 s [Cabal-syntax] patching script interpreter paths in /nix/store/rhfkd4j7g7kf3gr8kyfxwbw7rq872ci5-Cabal-syntax-3.12.1.0
  140. 500.56 s [Cabal-syntax] stripping (with command strip and flags -S -p) in /nix/store/rhfkd4j7g7kf3gr8kyfxwbw7rq872ci5-Cabal-syntax-3.12.1.0/lib
  141. 506.41 s [Cabal-syntax] shrinking RPATHs of ELF executables and libraries in /nix/store/ycgy50glqdxs9djv0x34qcr412szw7mc-Cabal-syntax-3.12.1.0-doc
  142. 506.51 s [Cabal-syntax] checking for references to /build/ in /nix/store/ycgy50glqdxs9djv0x34qcr412szw7mc-Cabal-syntax-3.12.1.0-doc...
  143. 506.63 s [Cabal-syntax] patching script interpreter paths in /nix/store/ycgy50glqdxs9djv0x34qcr412szw7mc-Cabal-syntax-3.12.1.0-doc
  144. 507.97 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/rhfkd4j7g7kf3gr8kyfxwbw7rq872ci5-Cabal-syntax-3.12.1.0 /nix/store/ycgy50glqdxs9djv0x34qcr412szw7mc-Cabal-syntax-3.12.1.0-doc
  145. 509.09 s [post-build-hook] Nothing to push - all store paths are already on Cachix.
  146. 509.29 s [post-build-hook] Uploading to the NixCI cache: /nix/store/rhfkd4j7g7kf3gr8kyfxwbw7rq872ci5-Cabal-syntax-3.12.1.0 /nix/store/ycgy50glqdxs9djv0x34qcr412szw7mc-Cabal-syntax-3.12.1.0-doc
  147. 509.73 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  148. 509.96 s [post-build-hook] copying 1 paths...
  149. 509.96 s [post-build-hook] copying path '/nix/store/rhfkd4j7g7kf3gr8kyfxwbw7rq872ci5-Cabal-syntax-3.12.1.0' to 'https://cache.nix-ci.com'...
  150. 584.84 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  151. 585.02 s [post-build-hook] copying 0 paths...
  152. 585.05 s Progress: 1 of 22 built, 160 of 160 downloaded from cache
  153. 585.11 s Building Cabal
  154. 585.20 s [Cabal] Phase: setupCompilerEnvironmentPhase
  155. 585.21 s [Cabal] Build with /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4.
  156. 585.45 s [Cabal] Phase: unpackPhase
  157. 585.46 s [Cabal] unpacking source archive /nix/store/i3lr7fx8fqyzvck858q213704kxk29dd-Cabal-3.12.1.0.tar.gz
  158. 585.47 s [Cabal] source root is Cabal-3.12.1.0
  159. 585.48 s [Cabal] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "Cabal-3.12.1.0/src/Distribution/ZinzaPrelude.hs"
  160. 585.49 s [Cabal] Phase: patchPhase
  161. 585.50 s [Cabal] Phase: compileBuildDriverPhase
  162. 585.51 s [Cabal] setupCompileFlags: -package-db=/build/tmp.xqBF7BBWMo/setup-package.conf.d -threaded
  163. 585.56 s [Cabal] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.xqBF7BBWMo/Main.o )
  164. 585.68 s [Cabal] [2 of 2] Linking Setup
  165. 587.38 s [Cabal] Phase: updateAutotoolsGnuConfigScriptsPhase
  166. 587.39 s [Cabal] Phase: configurePhase
  167. 587.40 s [Cabal] configureFlags: --verbose --prefix=/nix/store/c4ql4nnhdk6f139cj7xfmhq1llfn97wl-Cabal-3.12.1.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/mzkgy976bxg36d98mai8pw75w3wrbb99-Cabal-3.12.1.0-doc/share/doc/Cabal-3.12.1.0 --with-gcc=gcc --package-db=/build/tmp.xqBF7BBWMo/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --disable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/xp8g8298vbm4k9ipj14xf1r4rh899hr4-ncurses-6.5/lib --extra-lib-dirs=/nix/store/wxm6pczq28ppr7ffwclsl6njbzzr48zf-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/3f0hp921ncxr249f5lmspc8silkqr8f7-elfutils-0.194/lib --extra-lib-dirs=/nix/store/km81slwkcc82dbwywl10gpffjb78g6ni-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/fvsl0b39y6ns2z66gfvc2raca3b5wr18-numactl-2.0.18/lib
  168. 587.41 s [Cabal] Using Parsec parser
  169. 587.41 s [Cabal] Configuring Cabal-3.12.1.0...
  170. 587.80 s [Cabal] Dependency Cabal-syntax >=3.12.1.0 && <3.13: using Cabal-syntax-3.12.1.0
  171. 587.80 s [Cabal] Dependency array >=0.4.0.1 && <0.6: using array-0.5.8.0
  172. 587.80 s [Cabal] Dependency base >=4.11 && <5: using base-4.19.2.0
  173. 587.80 s [Cabal] Dependency bytestring >=0.10.0.0 && <0.13: using bytestring-0.12.1.0
  174. 587.80 s [Cabal] Dependency containers >=0.5.0.0 && <0.8: using containers-0.6.8
  175. 587.80 s [Cabal] Dependency deepseq >=1.3.0.1 && <1.6: using deepseq-1.5.1.0
  176. 587.80 s [Cabal] Dependency directory >=1.2 && <1.4: using directory-1.3.8.5
  177. 587.80 s [Cabal] Dependency filepath >=1.3.0.1 && <1.6: using filepath-1.4.301.0
  178. 587.80 s [Cabal] Dependency mtl >=2.1 && <2.4: using mtl-2.3.1
  179. 587.80 s [Cabal] Dependency parsec >=3.1.13.0 && <3.2: using parsec-3.1.17.0
  180. 587.80 s [Cabal] Dependency pretty >=1.1.1 && <1.2: using pretty-1.1.3.6
  181. 587.80 s [Cabal] Dependency process >=1.2.1.0 && <1.7: using process-1.6.25.0
  182. 587.80 s [Cabal] Dependency time >=1.4.0.1 && <1.15: using time-1.12.2
  183. 587.80 s [Cabal] Dependency transformers >=0.3 && <0.4 || >=0.4.1.0 && <0.7: using
  184. 587.80 s [Cabal] transformers-0.6.1.0
  185. 587.80 s [Cabal] Dependency unix >=2.6.0.0 && <2.9: using unix-2.8.6.0
  186. 588.10 s [Cabal] Source component graph: component lib
  187. 588.10 s [Cabal] Configured component graph:
  188. 588.10 s [Cabal] component Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky
  189. 588.10 s [Cabal] include Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A
  190. 588.10 s [Cabal] include array-0.5.8.0-34d4
  191. 588.10 s [Cabal] include base-4.19.2.0-a4d2
  192. 588.10 s [Cabal] include bytestring-0.12.1.0-2e42
  193. 588.10 s [Cabal] include containers-0.6.8-1373
  194. 588.10 s [Cabal] include deepseq-1.5.1.0-2184
  195. 588.10 s [Cabal] include directory-1.3.8.5-fa66
  196. 588.10 s [Cabal] include filepath-1.4.301.0-5f33
  197. 588.10 s [Cabal] include mtl-2.3.1-bdac
  198. 588.10 s [Cabal] include parsec-3.1.17.0-ff02
  199. 588.10 s [Cabal] include pretty-1.1.3.6-7a53
  200. 588.10 s [Cabal] include process-1.6.25.0-8170
  201. 588.10 s [Cabal] include time-1.12.2-84c3
  202. 588.10 s [Cabal] include transformers-0.6.1.0-8f1d
  203. 588.10 s [Cabal] include unix-2.8.6.0-c2f8
  204. 588.10 s [Cabal] Linked component graph:
  205. 588.10 s [Cabal] unit Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky
  206. 588.10 s [Cabal] include Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A
  207. 588.10 s [Cabal] include array-0.5.8.0-34d4
  208. 588.10 s [Cabal] include base-4.19.2.0-a4d2
  209. 588.10 s [Cabal] include bytestring-0.12.1.0-2e42
  210. 588.10 s [Cabal] include containers-0.6.8-1373
  211. 588.10 s [Cabal] include deepseq-1.5.1.0-2184
  212. 588.10 s [Cabal] include directory-1.3.8.5-fa66
  213. 588.10 s [Cabal] include filepath-1.4.301.0-5f33
  214. 588.10 s [Cabal] include mtl-2.3.1-bdac
  215. 588.10 s [Cabal] include parsec-3.1.17.0-ff02
  216. 588.10 s [Cabal] include pretty-1.1.3.6-7a53
  217. 588.10 s [Cabal] include process-1.6.25.0-8170
  218. 588.10 s [Cabal] include time-1.12.2-84c3
  219. 588.10 s [Cabal] include transformers-0.6.1.0-8f1d
  220. 588.10 s [Cabal] include unix-2.8.6.0-c2f8
  221. 588.11 s [Cabal] Distribution.Backpack=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Backpack,Distribution.Backpack.ComponentsGraph=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Backpack.ComponentsGraph,Distribution.Backpack.Configure=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Backpack.Configure,Distribution.Backpack.ConfiguredComponent=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Backpack.ConfiguredComponent,Distribution.Backpack.DescribeUnitId=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Backpack.DescribeUnitId,Distribution.Backpack.FullUnitId=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Backpack.FullUnitId,Distribution.Backpack.LinkedComponent=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Backpack.LinkedComponent,Distribution.Backpack.ModSubst=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Backpack.ModSubst,Distribution.Backpack.ModuleShape=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Backpack.ModuleShape,Distribution.Backpack.PreModuleShape=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Backpack.PreModuleShape,Distribution.CabalSpecVersion=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.CabalSpecVersion,Distribution.Compat.Binary=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Compat.Binary,Distribution.Compat.CharParsing=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Compat.CharParsing,Distribution.Compat.CreatePipe=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Compat.CreatePipe,Distribution.Compat.DList=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Compat.DList,Distribution.Compat.Directory=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Compat.Directory,Distribution.Compat.Environment=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Compat.Environment,Distribution.Compat.Exception=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Compat.Exception,Distribution.Compat.FilePath=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Compat.FilePath,Distribution.Compat.Graph=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Compat.Graph,Distribution.Compat.Internal.TempFile=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Compat.Internal.TempFile,Distribution.Compat.Lens=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Compat.Lens,Distribution.Compat.MonadFail=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Compat.MonadFail,Distribution.Compat.Newtype=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Compat.Newtype,Distribution.Compat.NonEmptySet=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Compat.NonEmptySet,Distribution.Compat.Parsing=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Compat.Parsing,Distribution.Compat.Prelude=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Compat.Prelude,Distribution.Compat.Prelude.Internal=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Compat.Prelude.Internal,Distribution.Compat.Process=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Compat.Process,Distribution.Compat.ResponseFile=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Compat.ResponseFile,Distribution.Compat.Semigroup=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Compat.Semigroup,Distribution.Compat.Stack=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Compat.Stack,Distribution.Compat.Time=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Compat.Time,Distribution.Compat.Typeable=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Compat.Typeable,Distribution.Compiler=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Compiler,Distribution.FieldGrammar=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.FieldGrammar,Distribution.FieldGrammar.Class=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.FieldGrammar.Class,Distribution.FieldGrammar.FieldDescrs=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.FieldGrammar.FieldDescrs,Distribution.FieldGrammar.Newtypes=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.FieldGrammar.Newtypes,Distribution.FieldGrammar.Parsec=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.FieldGrammar.Parsec,Distribution.FieldGrammar.Pretty=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.FieldGrammar.Pretty,Distribution.Fields=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Fields,Distribution.Fields.ConfVar=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Fields.ConfVar,Distribution.Fields.Field=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Fields.Field,Distribution.Fields.Lexer=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Fields.Lexer,Distribution.Fields.LexerMonad=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Fields.LexerMonad,Distribution.Fields.ParseResult=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Fields.ParseResult,Distribution.Fields.Parser=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Fields.Parser,Distribution.Fields.Pretty=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Fields.Pretty,Distribution.InstalledPackageInfo=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.InstalledPackageInfo,Distribution.License=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.License,Distribution.Make=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Make,Distribution.ModuleName=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.ModuleName,Distribution.Package=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Package,Distribution.PackageDescription=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.PackageDescription,Distribution.PackageDescription.Check=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.PackageDescription.Check,Distribution.PackageDescription.Configuration=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.PackageDescription.Configuration,Distribution.PackageDescription.FieldGrammar=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.PackageDescription.FieldGrammar,Distribution.PackageDescription.Parsec=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.PackageDescription.Parsec,Distribution.PackageDescription.PrettyPrint=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.PackageDescription.PrettyPrint,Distribution.PackageDescription.Quirks=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.PackageDescription.Quirks,Distribution.PackageDescription.Utils=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.PackageDescription.Utils,Distribution.Parsec=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Parsec,Distribution.Parsec.Error=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Parsec.Error,Distribution.Parsec.FieldLineStream=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Parsec.FieldLineStream,Distribution.Parsec.Position=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Parsec.Position,Distribution.Parsec.Warning=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Parsec.Warning,Distribution.Pretty=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Pretty,Distribution.ReadE=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.ReadE,Distribution.SPDX=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.SPDX,Distribution.SPDX.License=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.SPDX.License,Distribution.SPDX.LicenseExceptionId=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.SPDX.LicenseExceptionId,Distribution.SPDX.LicenseExpression=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.SPDX.LicenseExpression,Distribution.SPDX.LicenseId=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.SPDX.LicenseId,Distribution.SPDX.LicenseListVersion=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.SPDX.LicenseListVersion,Distribution.SPDX.LicenseReference=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.SPDX.LicenseReference,Distribution.Simple=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Simple,Distribution.Simple.Bench=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Simple.Bench,Distribution.Simple.Build=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Simple.Build,Distribution.Simple.Build.Inputs=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Simple.Build.Inputs,Distribution.Simple.Build.Macros=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Simple.Build.Macros,Distribution.Simple.Build.PackageInfoModule=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Simple.Build.PackageInfoModule,Distribution.Simple.Build.PathsModule=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Simple.Build.PathsModule,Distribution.Simple.BuildPaths=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Simple.BuildPaths,Distribution.Simple.BuildTarget=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Simple.BuildTarget,Distribution.Simple.BuildToolDepends=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Simple.BuildToolDepends,Distribution.Simple.CCompiler=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Simple.CCompiler,Distribution.Simple.Command=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Simple.Command,Distribution.Simple.Compiler=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Simple.Compiler,Distribution.Simple.Configure=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Simple.Configure,Distribution.Simple.Errors=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Simple.Errors,Distribution.Simple.Flag=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Simple.Flag,Distribution.Simple.GHC=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Simple.GHC,Distribution.Simple.GHCJS=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Simple.GHCJS,Distribution.Simple.Glob=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Simple.Glob,Distribution.Simple.Glob.Internal=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Simple.Glob.Internal,Distribution.Simple.Haddock=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Simple.Haddock,Distribution.Simple.HaskellSuite=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Simple.HaskellSuite,Distribution.Simple.Hpc=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Simple.Hpc,Distribution.Simple.Install=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Simple.Install,Distribution.Simple.InstallDirs=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Simple.InstallDirs,Distribution.Simple.InstallDirs.Internal=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Simple.InstallDirs.Internal,Distribution.Simple.LocalBuildInfo=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Simple.LocalBuildInfo,Distribution.Simple.PackageDescription=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Simple.PackageDescription,Distribution.Simple.PackageIndex=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Simple.PackageIndex,Distribution.Simple.PreProcess=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Simple.PreProcess,Distribution.Simple.PreProcess.Types=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Simple.PreProcess.Types,Distribution.Simple.PreProcess.Unlit=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Simple.PreProcess.Unlit,Distribution.Simple.Program=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Simple.Program,Distribution.Simple.Program.Ar=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Simple.Program.Ar,Distribution.Simple.Program.Builtin=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Simple.Program.Builtin,Distribution.Simple.Program.Db=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Simple.Program.Db,Distribution.Simple.Program.Find=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Simple.Program.Find,Distribution.Simple.Program.GHC=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Simple.Program.GHC,Distribution.Simple.Program.HcPkg=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Simple.Program.HcPkg,Distribution.Simple.Program.Hpc=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Simple.Program.Hpc,Distribution.Simple.Program.Internal=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Simple.Program.Internal,Distribution.Simple.Program.Ld=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Simple.Program.Ld,Distribution.Simple.Program.ResponseFile=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Simple.Program.ResponseFile,Distribution.Simple.Program.Run=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Simple.Program.Run,Distribution.Simple.Program.Script=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Simple.Program.Script,Distribution.Simple.Program.Strip=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Simple.Program.Strip,Distribution.Simple.Program.Types=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Simple.Program.Types,Distribution.Simple.Register=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Simple.Register,Distribution.Simple.Setup=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Simple.Setup,Distribution.Simple.ShowBuildInfo=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Simple.ShowBuildInfo,Distribution.Simple.SrcDist=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Simple.SrcDist,Distribution.Simple.Test=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Simple.Test,Distribution.Simple.Test.ExeV10=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Simple.Test.ExeV10,Distribution.Simple.Test.LibV09=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Simple.Test.LibV09,Distribution.Simple.Test.Log=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Simple.Test.Log,Distribution.Simple.UHC=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Simple.UHC,Distribution.Simple.UserHooks=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Simple.UserHooks,Distribution.Simple.Utils=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Simple.Utils,Distribution.System=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.System,Distribution.TestSuite=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.TestSuite,Distribution.Text=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Text,Distribution.Types.AbiDependency=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Types.AbiDependency,Distribution.Types.AbiHash=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Types.AbiHash,Distribution.Types.AnnotatedId=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Types.AnnotatedId,Distribution.Types.Benchmark=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Types.Benchmark,Distribution.Types.Benchmark.Lens=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Types.Benchmark.Lens,Distribution.Types.BenchmarkInterface=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Types.BenchmarkInterface,Distribution.Types.BenchmarkType=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Types.BenchmarkType,Distribution.Types.BuildInfo=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Types.BuildInfo,Distribution.Types.BuildInfo.Lens=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Types.BuildInfo.Lens,Distribution.Types.BuildType=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Types.BuildType,Distribution.Types.Component=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Types.Component,Distribution.Types.ComponentId=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Types.ComponentId,Distribution.Types.ComponentInclude=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Types.ComponentInclude,Distribution.Types.ComponentLocalBuildInfo=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Types.ComponentLocalBuildInfo,Distribution.Types.ComponentName=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Types.ComponentName,Distribution.Types.ComponentRequestedSpec=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Types.ComponentRequestedSpec,Distribution.Types.CondTree=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Types.CondTree,Distribution.Types.Condition=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Types.Condition,Distribution.Types.ConfVar=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Types.ConfVar,Distribution.Types.Dependency=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Types.Dependency,Distribution.Types.DependencyMap=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Types.DependencyMap,Distribution.Types.DumpBuildInfo=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Types.DumpBuildInfo,Distribution.Types.ExeDependency=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Types.ExeDependency,Distribution.Types.Executable=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Types.Executable,Distribution.Types.Executable.Lens=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Types.Executable.Lens,Distribution.Types.ExecutableScope=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Types.ExecutableScope,Distribution.Types.ExposedModule=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Types.ExposedModule,Distribution.Types.Flag=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Types.Flag,Distribution.Types.ForeignLib=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Types.ForeignLib,Distribution.Types.ForeignLib.Lens=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Types.ForeignLib.Lens,Distribution.Types.ForeignLibOption=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Types.ForeignLibOption,Distribution.Types.ForeignLibType=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Types.ForeignLibType,Distribution.Types.GenericPackageDescription=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Types.GenericPackageDescription,Distribution.Types.GenericPackageDescription.Lens=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Types.GenericPackageDescription.Lens,Distribution.Types.GivenComponent=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Types.GivenComponent,Distribution.Types.HookedBuildInfo=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Types.HookedBuildInfo,Distribution.Types.IncludeRenaming=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Types.IncludeRenaming,Distribution.Types.InstalledPackageInfo=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Types.InstalledPackageInfo,Distribution.Types.InstalledPackageInfo.FieldGrammar=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Types.InstalledPackageInfo.FieldGrammar,Distribution.Types.InstalledPackageInfo.Lens=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Types.InstalledPackageInfo.Lens,Distribution.Types.LegacyExeDependency=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Types.LegacyExeDependency,Distribution.Types.Lens=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Types.Lens,Distribution.Types.Library=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Types.Library,Distribution.Types.Library.Lens=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Types.Library.Lens,Distribution.Types.LibraryName=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Types.LibraryName,Distribution.Types.LibraryVisibility=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Types.LibraryVisibility,Distribution.Types.LocalBuildConfig=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Types.LocalBuildConfig,Distribution.Types.LocalBuildInfo=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Types.LocalBuildInfo,Distribution.Types.Mixin=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Types.Mixin,Distribution.Types.Module=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Types.Module,Distribution.Types.ModuleReexport=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Types.ModuleReexport,Distribution.Types.ModuleRenaming=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Types.ModuleRenaming,Distribution.Types.MungedPackageId=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Types.MungedPackageId,Distribution.Types.MungedPackageName=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Types.MungedPackageName,Distribution.Types.PackageDescription=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Types.PackageDescription,Distribution.Types.PackageDescription.Lens=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Types.PackageDescription.Lens,Distribution.Types.PackageId=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Types.PackageId,Distribution.Types.PackageId.Lens=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Types.PackageId.Lens,Distribution.Types.PackageName=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Types.PackageName,Distribution.Types.PackageName.Magic=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Types.PackageName.Magic,Distribution.Types.PackageVersionConstraint=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Types.PackageVersionConstraint,Distribution.Types.ParStrat=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Types.ParStrat,Distribution.Types.PkgconfigDependency=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Types.PkgconfigDependency,Distribution.Types.PkgconfigName=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Types.PkgconfigName,Distribution.Types.PkgconfigVersion=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Types.PkgconfigVersion,Distribution.Types.PkgconfigVersionRange=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Types.PkgconfigVersionRange,Distribution.Types.SetupBuildInfo=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Types.SetupBuildInfo,Distribution.Types.SetupBuildInfo.Lens=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Types.SetupBuildInfo.Lens,Distribution.Types.SourceRepo=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Types.SourceRepo,Distribution.Types.SourceRepo.Lens=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Types.SourceRepo.Lens,Distribution.Types.TargetInfo=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Types.TargetInfo,Distribution.Types.TestSuite=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Types.TestSuite,Distribution.Types.TestSuite.Lens=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Types.TestSuite.Lens,Distribution.Types.TestSuiteInterface=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Types.TestSuiteInterface,Distribution.Types.TestType=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Types.TestType,Distribution.Types.UnitId=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Types.UnitId,Distribution.Types.UnqualComponentName=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Types.UnqualComponentName,Distribution.Types.Version=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Types.Version,Distribution.Types.VersionInterval=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Types.VersionInterval,Distribution.Types.VersionInterval.Legacy=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Types.VersionInterval.Legacy,Distribution.Types.VersionRange=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Types.VersionRange,Distribution.Types.VersionRange.Internal=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Types.VersionRange.Internal,Distribution.Utils.Base62=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Utils.Base62,Distribution.Utils.Generic=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Utils.Generic,Distribution.Utils.IOData=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Utils.IOData,Distribution.Utils.Json=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Utils.Json,Distribution.Utils.LogProgress=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Utils.LogProgress,Distribution.Utils.MD5=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Utils.MD5,Distribution.Utils.MapAccum=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Utils.MapAccum,Distribution.Utils.NubList=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Utils.NubList,Distribution.Utils.Path=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Utils.Path,Distribution.Utils.Progress=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Utils.Progress,Distribution.Utils.ShortText=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Utils.ShortText,Distribution.Utils.String=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Utils.String,Distribution.Utils.Structured=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Utils.Structured,Distribution.Verbosity=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Verbosity,Distribution.Verbosity.Internal=Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky:Distribution.Verbosity.Internal,Distribution.Version=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Distribution.Version,Language.Haskell.Extension=Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A:Language.Haskell.Extension
  222. 588.11 s [Cabal] Ready component graph:
  223. 588.11 s [Cabal] definite Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky
  224. 588.11 s [Cabal] depends Cabal-syntax-3.12.1.0-910iP3PmMyNB0zaFhhnh3A
  225. 588.11 s [Cabal] depends array-0.5.8.0-34d4
  226. 588.11 s [Cabal] depends base-4.19.2.0-a4d2
  227. 588.11 s [Cabal] depends bytestring-0.12.1.0-2e42
  228. 588.11 s [Cabal] depends containers-0.6.8-1373
  229. 588.11 s [Cabal] depends deepseq-1.5.1.0-2184
  230. 588.11 s [Cabal] depends directory-1.3.8.5-fa66
  231. 588.11 s [Cabal] depends filepath-1.4.301.0-5f33
  232. 588.11 s [Cabal] depends mtl-2.3.1-bdac
  233. 588.11 s [Cabal] depends parsec-3.1.17.0-ff02
  234. 588.11 s [Cabal] depends pretty-1.1.3.6-7a53
  235. 588.11 s [Cabal] depends process-1.6.25.0-8170
  236. 588.11 s [Cabal] depends time-1.12.2-84c3
  237. 588.11 s [Cabal] depends transformers-0.6.1.0-8f1d
  238. 588.11 s [Cabal] depends unix-2.8.6.0-c2f8
  239. 588.11 s [Cabal] Using Cabal-3.10.3.0 compiled by ghc-9.8
  240. 588.11 s [Cabal] Using compiler: ghc-9.8.4
  241. 588.11 s [Cabal] Using install prefix:
  242. 588.11 s [Cabal] /nix/store/c4ql4nnhdk6f139cj7xfmhq1llfn97wl-Cabal-3.12.1.0
  243. 588.11 s [Cabal] Executables installed in:
  244. 588.11 s [Cabal] /nix/store/c4ql4nnhdk6f139cj7xfmhq1llfn97wl-Cabal-3.12.1.0/bin
  245. 588.11 s [Cabal] Libraries installed in:
  246. 588.11 s [Cabal] /nix/store/c4ql4nnhdk6f139cj7xfmhq1llfn97wl-Cabal-3.12.1.0/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky
  247. 588.11 s [Cabal] Dynamic Libraries installed in:
  248. 588.11 s [Cabal] /nix/store/c4ql4nnhdk6f139cj7xfmhq1llfn97wl-Cabal-3.12.1.0/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4
  249. 588.11 s [Cabal] Private executables installed in:
  250. 588.11 s [Cabal] /nix/store/c4ql4nnhdk6f139cj7xfmhq1llfn97wl-Cabal-3.12.1.0/libexec/x86_64-linux-ghc-9.8.4/Cabal-3.12.1.0
  251. 588.11 s [Cabal] Data files installed in:
  252. 588.11 s [Cabal] /nix/store/c4ql4nnhdk6f139cj7xfmhq1llfn97wl-Cabal-3.12.1.0/share/x86_64-linux-ghc-9.8.4/Cabal-3.12.1.0
  253. 588.11 s [Cabal] Documentation installed in:
  254. 588.11 s [Cabal] /nix/store/mzkgy976bxg36d98mai8pw75w3wrbb99-Cabal-3.12.1.0-doc/share/doc/Cabal-3.12.1.0
  255. 588.11 s [Cabal] Configuration files installed in:
  256. 588.11 s [Cabal] /nix/store/c4ql4nnhdk6f139cj7xfmhq1llfn97wl-Cabal-3.12.1.0/etc
  257. 588.11 s [Cabal] No alex found
  258. 588.11 s [Cabal] Using ar found on system at:
  259. 588.11 s [Cabal] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
  260. 588.11 s [Cabal] No c2hs found
  261. 588.11 s [Cabal] No cpphs found
  262. 588.11 s [Cabal] No doctest found
  263. 588.11 s [Cabal] Using gcc version 14.3.0 given by user at:
  264. 588.11 s [Cabal] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
  265. 588.11 s [Cabal] Using ghc version 9.8.4 found on system at:
  266. 588.11 s [Cabal] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/ghc
  267. 588.11 s [Cabal] Using ghc-pkg version 9.8.4 found on system at:
  268. 588.11 s [Cabal] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/ghc-pkg-9.8.4
  269. 588.11 s [Cabal] No ghcjs found
  270. 588.11 s [Cabal] No ghcjs-pkg found
  271. 588.11 s [Cabal] No greencard found
  272. 588.11 s [Cabal] Using haddock version 2.30.0 found on system at:
  273. 588.11 s [Cabal] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/haddock-ghc-9.8.4
  274. 588.11 s [Cabal] No happy found
  275. 588.11 s [Cabal] Using haskell-suite found on system at: haskell-suite-dummy-location
  276. 588.11 s [Cabal] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  277. 588.11 s [Cabal] No hmake found
  278. 588.11 s [Cabal] Using hpc version 0.69 found on system at:
  279. 588.11 s [Cabal] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/hpc-ghc-9.8.4
  280. 588.11 s [Cabal] Using hsc2hs version 0.68.10 found on system at:
  281. 588.11 s [Cabal] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/hsc2hs-ghc-9.8.4
  282. 588.11 s [Cabal] Using hscolour version 1.25 found on system at:
  283. 588.11 s [Cabal] /nix/store/vl14mqkz7z183r6sq9qz932j3pix6v5c-hscolour-1.25/bin/HsColour
  284. 588.11 s [Cabal] No jhc found
  285. 588.11 s [Cabal] Using ld found on system at:
  286. 588.11 s [Cabal] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ld.gold
  287. 588.11 s [Cabal] No pkg-config found
  288. 588.11 s [Cabal] Using runghc version 9.8.4 found on system at:
  289. 588.11 s [Cabal] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/runghc-9.8.4
  290. 588.11 s [Cabal] Using strip version 2.44 found on system at:
  291. 588.11 s [Cabal] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
  292. 588.11 s [Cabal] Using tar found on system at:
  293. 588.11 s [Cabal] /nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
  294. 588.11 s [Cabal] No uhc found
  295. 588.27 s [Cabal] Phase: buildPhase
  296. 588.33 s [Cabal] Preprocessing library for Cabal-3.12.1.0..
  297. 588.35 s [Cabal] Building library for Cabal-3.12.1.0..
  298. 589.77 s [Cabal] [ 1 of 146] Compiling Distribution.Backpack.FullUnitId ( src/Distribution/Backpack/FullUnitId.hs, dist/build/Distribution/Backpack/FullUnitId.o, dist/build/Distribution/Backpack/FullUnitId.dyn_o )
  299. 590.76 s [Cabal] [ 2 of 146] Compiling Distribution.Backpack.ModSubst ( src/Distribution/Backpack/ModSubst.hs, dist/build/Distribution/Backpack/ModSubst.o, dist/build/Distribution/Backpack/ModSubst.dyn_o )
  300. 590.87 s [Cabal] [ 3 of 146] Compiling Distribution.Backpack.ModuleScope ( src/Distribution/Backpack/ModuleScope.hs, dist/build/Distribution/Backpack/ModuleScope.o, dist/build/Distribution/Backpack/ModuleScope.dyn_o )
  301. 591.16 s [Cabal] [ 4 of 146] Compiling Distribution.Backpack.ModuleShape ( src/Distribution/Backpack/ModuleShape.hs, dist/build/Distribution/Backpack/ModuleShape.o, dist/build/Distribution/Backpack/ModuleShape.dyn_o )
  302. 591.54 s [Cabal] [ 5 of 146] Compiling Distribution.Backpack.PreModuleShape ( src/Distribution/Backpack/PreModuleShape.hs, dist/build/Distribution/Backpack/PreModuleShape.o, dist/build/Distribution/Backpack/PreModuleShape.dyn_o )
  303. 591.97 s [Cabal] [ 6 of 146] Compiling Distribution.Compat.Async ( src/Distribution/Compat/Async.hs, dist/build/Distribution/Compat/Async.o, dist/build/Distribution/Compat/Async.dyn_o )
  304. 591.97 s [Cabal] [ 7 of 146] Compiling Distribution.Compat.CreatePipe ( src/Distribution/Compat/CreatePipe.hs, dist/build/Distribution/Compat/CreatePipe.o, dist/build/Distribution/Compat/CreatePipe.dyn_o )
  305. 591.97 s [Cabal] [ 8 of 146] Compiling Distribution.Compat.Directory ( src/Distribution/Compat/Directory.hs, dist/build/Distribution/Compat/Directory.o, dist/build/Distribution/Compat/Directory.dyn_o )
  306. 591.97 s [Cabal] [ 9 of 146] Compiling Distribution.Compat.FilePath ( src/Distribution/Compat/FilePath.hs, dist/build/Distribution/Compat/FilePath.o, dist/build/Distribution/Compat/FilePath.dyn_o )
  307. 591.97 s [Cabal] [ 10 of 146] Compiling Distribution.Compat.GetShortPathName ( src/Distribution/Compat/GetShortPathName.hs, dist/build/Distribution/Compat/GetShortPathName.o, dist/build/Distribution/Compat/GetShortPathName.dyn_o )
  308. 591.97 s [Cabal] [ 11 of 146] Compiling Distribution.Compat.Internal.TempFile ( src/Distribution/Compat/Internal/TempFile.hs, dist/build/Distribution/Compat/Internal/TempFile.o, dist/build/Distribution/Compat/Internal/TempFile.dyn_o )
  309. 591.97 s [Cabal] [ 12 of 146] Compiling Distribution.Compat.CopyFile ( src/Distribution/Compat/CopyFile.hs, dist/build/Distribution/Compat/CopyFile.o, dist/build/Distribution/Compat/CopyFile.dyn_o )
  310. 591.97 s [Cabal] [ 13 of 146] Compiling Distribution.Compat.Prelude.Internal ( src/Distribution/Compat/Prelude/Internal.hs, dist/build/Distribution/Compat/Prelude/Internal.o, dist/build/Distribution/Compat/Prelude/Internal.dyn_o )
  311. 591.97 s [Cabal] [ 14 of 146] Compiling Distribution.Compat.Process ( src/Distribution/Compat/Process.hs, dist/build/Distribution/Compat/Process.o, dist/build/Distribution/Compat/Process.dyn_o )
  312. 591.97 s [Cabal] [ 15 of 146] Compiling Distribution.Compat.ResponseFile ( src/Distribution/Compat/ResponseFile.hs, dist/build/Distribution/Compat/ResponseFile.o, dist/build/Distribution/Compat/ResponseFile.dyn_o )
  313. 591.97 s [Cabal] [ 16 of 146] Compiling Distribution.Compat.SnocList ( src/Distribution/Compat/SnocList.hs, dist/build/Distribution/Compat/SnocList.o, dist/build/Distribution/Compat/SnocList.dyn_o )
  314. 591.97 s [Cabal] [ 17 of 146] Compiling Distribution.Compat.Stack ( src/Distribution/Compat/Stack.hs, dist/build/Distribution/Compat/Stack.o, dist/build/Distribution/Compat/Stack.dyn_o )
  315. 591.97 s [Cabal] [ 18 of 146] Compiling Distribution.Compat.Environment ( src/Distribution/Compat/Environment.hs, dist/build/Distribution/Compat/Environment.o, dist/build/Distribution/Compat/Environment.dyn_o )
  316. 591.97 s [Cabal] [ 19 of 146] Compiling Distribution.GetOpt ( src/Distribution/GetOpt.hs, dist/build/Distribution/GetOpt.o, dist/build/Distribution/GetOpt.dyn_o )
  317. 591.97 s [Cabal] [ 20 of 146] Compiling Distribution.Lex ( src/Distribution/Lex.hs, dist/build/Distribution/Lex.o, dist/build/Distribution/Lex.dyn_o )
  318. 591.97 s [Cabal] [ 21 of 146] Compiling Distribution.PackageDescription.Check.Warning ( src/Distribution/PackageDescription/Check/Warning.hs, dist/build/Distribution/PackageDescription/Check/Warning.o, dist/build/Distribution/PackageDescription/Check/Warning.dyn_o )
  319. 596.02 s [Cabal] [ 22 of 146] Compiling Distribution.ReadE ( src/Distribution/ReadE.hs, dist/build/Distribution/ReadE.o, dist/build/Distribution/ReadE.dyn_o )
  320. 596.05 s [Cabal] [ 23 of 146] Compiling Distribution.Simple.BuildToolDepends ( src/Distribution/Simple/BuildToolDepends.hs, dist/build/Distribution/Simple/BuildToolDepends.o, dist/build/Distribution/Simple/BuildToolDepends.dyn_o )
  321. 596.06 s [Cabal] [ 24 of 146] Compiling Distribution.Simple.CCompiler ( src/Distribution/Simple/CCompiler.hs, dist/build/Distribution/Simple/CCompiler.o, dist/build/Distribution/Simple/CCompiler.dyn_o )
  322. 596.06 s [Cabal] [ 25 of 146] Compiling Distribution.Simple.Flag ( src/Distribution/Simple/Flag.hs, dist/build/Distribution/Simple/Flag.o, dist/build/Distribution/Simple/Flag.dyn_o )
  323. 596.06 s [Cabal] [ 26 of 146] Compiling Distribution.Simple.InstallDirs.Internal ( src/Distribution/Simple/InstallDirs/Internal.hs, dist/build/Distribution/Simple/InstallDirs/Internal.o, dist/build/Distribution/Simple/InstallDirs/Internal.dyn_o )
  324. 596.06 s [Cabal] [ 27 of 146] Compiling Distribution.Simple.InstallDirs ( src/Distribution/Simple/InstallDirs.hs, dist/build/Distribution/Simple/InstallDirs.o, dist/build/Distribution/Simple/InstallDirs.dyn_o )
  325. 596.06 s [Cabal] [ 28 of 146] Compiling Distribution.Simple.Program.Internal ( src/Distribution/Simple/Program/Internal.hs, dist/build/Distribution/Simple/Program/Internal.o, dist/build/Distribution/Simple/Program/Internal.dyn_o )
  326. 596.06 s [Cabal] [ 29 of 146] Compiling Distribution.TestSuite ( src/Distribution/TestSuite.hs, dist/build/Distribution/TestSuite.o, dist/build/Distribution/TestSuite.dyn_o )
  327. 596.06 s [Cabal] [ 30 of 146] Compiling Distribution.Types.AnnotatedId ( src/Distribution/Types/AnnotatedId.hs, dist/build/Distribution/Types/AnnotatedId.o, dist/build/Distribution/Types/AnnotatedId.dyn_o )
  328. 596.06 s [Cabal] [ 31 of 146] Compiling Distribution.Backpack.PreExistingComponent ( src/Distribution/Backpack/PreExistingComponent.hs, dist/build/Distribution/Backpack/PreExistingComponent.o, dist/build/Distribution/Backpack/PreExistingComponent.dyn_o )
  329. 596.06 s [Cabal] [ 32 of 146] Compiling Distribution.Types.ComponentInclude ( src/Distribution/Types/ComponentInclude.hs, dist/build/Distribution/Types/ComponentInclude.o, dist/build/Distribution/Types/ComponentInclude.dyn_o )
  330. 596.06 s [Cabal] [ 33 of 146] Compiling Distribution.Types.ComponentLocalBuildInfo ( src/Distribution/Types/ComponentLocalBuildInfo.hs, dist/build/Distribution/Types/ComponentLocalBuildInfo.o, dist/build/Distribution/Types/ComponentLocalBuildInfo.dyn_o )
  331. 596.06 s [Cabal] [ 34 of 146] Compiling Distribution.Types.DumpBuildInfo ( src/Distribution/Types/DumpBuildInfo.hs, dist/build/Distribution/Types/DumpBuildInfo.o, dist/build/Distribution/Types/DumpBuildInfo.dyn_o )
  332. 596.06 s [Cabal] [ 35 of 146] Compiling Distribution.Types.GivenComponent ( src/Distribution/Types/GivenComponent.hs, dist/build/Distribution/Types/GivenComponent.o, dist/build/Distribution/Types/GivenComponent.dyn_o )
  333. 596.06 s [Cabal] [ 36 of 146] Compiling Distribution.Types.PackageName.Magic ( src/Distribution/Types/PackageName/Magic.hs, dist/build/Distribution/Types/PackageName/Magic.o, dist/build/Distribution/Types/PackageName/Magic.dyn_o )
  334. 596.06 s [Cabal] [ 37 of 146] Compiling Distribution.Types.ParStrat ( src/Distribution/Types/ParStrat.hs, dist/build/Distribution/Types/ParStrat.o, dist/build/Distribution/Types/ParStrat.dyn_o )
  335. 596.06 s [Cabal] [ 38 of 146] Compiling Distribution.Types.TargetInfo ( src/Distribution/Types/TargetInfo.hs, dist/build/Distribution/Types/TargetInfo.o, dist/build/Distribution/Types/TargetInfo.dyn_o )
  336. 596.06 s [Cabal] [ 39 of 146] Compiling Distribution.Utils.IOData ( src/Distribution/Utils/IOData.hs, dist/build/Distribution/Utils/IOData.o, dist/build/Distribution/Utils/IOData.dyn_o )
  337. 596.06 s [Cabal] [ 40 of 146] Compiling Distribution.Utils.Json ( src/Distribution/Utils/Json.hs, dist/build/Distribution/Utils/Json.o, dist/build/Distribution/Utils/Json.dyn_o )
  338. 596.06 s [Cabal] [ 41 of 146] Compiling Distribution.Utils.MapAccum ( src/Distribution/Utils/MapAccum.hs, dist/build/Distribution/Utils/MapAccum.o, dist/build/Distribution/Utils/MapAccum.dyn_o )
  339. 596.06 s [Cabal] [ 42 of 146] Compiling Distribution.Utils.Progress ( src/Distribution/Utils/Progress.hs, dist/build/Distribution/Utils/Progress.o, dist/build/Distribution/Utils/Progress.dyn_o )
  340. 596.06 s [Cabal] [ 43 of 146] Compiling Distribution.Utils.UnionFind ( src/Distribution/Utils/UnionFind.hs, dist/build/Distribution/Utils/UnionFind.o, dist/build/Distribution/Utils/UnionFind.dyn_o )
  341. 596.06 s [Cabal] [ 44 of 146] Compiling Distribution.Verbosity.Internal ( src/Distribution/Verbosity/Internal.hs, dist/build/Distribution/Verbosity/Internal.o, dist/build/Distribution/Verbosity/Internal.dyn_o )
  342. 596.06 s [Cabal] [ 45 of 146] Compiling Distribution.Verbosity ( src/Distribution/Verbosity.hs, dist/build/Distribution/Verbosity.o, dist/build/Distribution/Verbosity.dyn_o )
  343. 596.06 s [Cabal] [ 46 of 146] Compiling Distribution.Simple.Program.Types ( src/Distribution/Simple/Program/Types.hs, dist/build/Distribution/Simple/Program/Types.o, dist/build/Distribution/Simple/Program/Types.dyn_o )
  344. 596.06 s [Cabal] [ 47 of 146] Compiling Distribution.Simple.PreProcess.Types ( src/Distribution/Simple/PreProcess/Types.hs, dist/build/Distribution/Simple/PreProcess/Types.o, dist/build/Distribution/Simple/PreProcess/Types.dyn_o )
  345. 596.06 s [Cabal] [ 48 of 146] Compiling Distribution.Simple.Errors ( src/Distribution/Simple/Errors.hs, dist/build/Distribution/Simple/Errors.o, dist/build/Distribution/Simple/Errors.dyn_o )
  346. 597.17 s [Cabal] [ 49 of 146] Compiling Distribution.Simple.PreProcess.Unlit ( src/Distribution/Simple/PreProcess/Unlit.hs, dist/build/Distribution/Simple/PreProcess/Unlit.o, dist/build/Distribution/Simple/PreProcess/Unlit.dyn_o )
  347. 597.38 s [Cabal] [ 50 of 146] Compiling Distribution.Backpack.UnifyM ( src/Distribution/Backpack/UnifyM.hs, dist/build/Distribution/Backpack/UnifyM.o, dist/build/Distribution/Backpack/UnifyM.dyn_o )
  348. 597.38 s [Cabal] [ 51 of 146] Compiling Distribution.Backpack.MixLink ( src/Distribution/Backpack/MixLink.hs, dist/build/Distribution/Backpack/MixLink.o, dist/build/Distribution/Backpack/MixLink.dyn_o )
  349. 597.38 s [Cabal] [ 52 of 146] Compiling Distribution.ZinzaPrelude ( src/Distribution/ZinzaPrelude.hs, dist/build/Distribution/ZinzaPrelude.o, dist/build/Distribution/ZinzaPrelude.dyn_o )
  350. 597.38 s [Cabal] [ 53 of 146] Compiling Distribution.Simple.Build.PathsModule.Z ( src/Distribution/Simple/Build/PathsModule/Z.hs, dist/build/Distribution/Simple/Build/PathsModule/Z.o, dist/build/Distribution/Simple/Build/PathsModule/Z.dyn_o )
  351. 597.38 s [Cabal] [ 54 of 146] Compiling Distribution.Simple.Build.PackageInfoModule.Z ( src/Distribution/Simple/Build/PackageInfoModule/Z.hs, dist/build/Distribution/Simple/Build/PackageInfoModule/Z.o, dist/build/Distribution/Simple/Build/PackageInfoModule/Z.dyn_o )
  352. 597.38 s [Cabal] [ 55 of 146] Compiling Distribution.Simple.Build.Macros.Z ( src/Distribution/Simple/Build/Macros/Z.hs, dist/build/Distribution/Simple/Build/Macros/Z.o, dist/build/Distribution/Simple/Build/Macros/Z.dyn_o )
  353. 597.39 s [Cabal] [ 56 of 146] Compiling Paths_Cabal ( dist/build/autogen/Paths_Cabal.hs, dist/build/Paths_Cabal.o, dist/build/Paths_Cabal.dyn_o )
  354. 597.39 s [Cabal] [ 57 of 146] Compiling Distribution.Simple.Utils ( src/Distribution/Simple/Utils.hs, dist/build/Distribution/Simple/Utils.o, dist/build/Distribution/Simple/Utils.dyn_o )
  355. 600.12 s [Cabal] [ 58 of 146] Compiling Distribution.Utils.NubList ( src/Distribution/Utils/NubList.hs, dist/build/Distribution/Utils/NubList.o, dist/build/Distribution/Utils/NubList.dyn_o )
  356. 600.76 s [Cabal] [ 59 of 146] Compiling Distribution.Utils.LogProgress ( src/Distribution/Utils/LogProgress.hs, dist/build/Distribution/Utils/LogProgress.o, dist/build/Distribution/Utils/LogProgress.dyn_o )
  357. 600.76 s [Cabal] [ 60 of 146] Compiling Distribution.Simple.Program.Run ( src/Distribution/Simple/Program/Run.hs, dist/build/Distribution/Simple/Program/Run.o, dist/build/Distribution/Simple/Program/Run.dyn_o )
  358. 600.85 s [Cabal] [ 61 of 146] Compiling Distribution.Simple.Program.Script ( src/Distribution/Simple/Program/Script.hs, dist/build/Distribution/Simple/Program/Script.o, dist/build/Distribution/Simple/Program/Script.dyn_o )
  359. 601.11 s [Cabal] [ 62 of 146] Compiling Distribution.Simple.Program.ResponseFile ( src/Distribution/Simple/Program/ResponseFile.hs, dist/build/Distribution/Simple/Program/ResponseFile.o, dist/build/Distribution/Simple/Program/ResponseFile.dyn_o )
  360. 601.15 s [Cabal] [ 63 of 146] Compiling Distribution.Simple.Program.Hpc ( src/Distribution/Simple/Program/Hpc.hs, dist/build/Distribution/Simple/Program/Hpc.o, dist/build/Distribution/Simple/Program/Hpc.dyn_o )
  361. 601.15 s [Cabal] [ 64 of 146] Compiling Distribution.Simple.Program.Find ( src/Distribution/Simple/Program/Find.hs, dist/build/Distribution/Simple/Program/Find.o, dist/build/Distribution/Simple/Program/Find.dyn_o )
  362. 601.15 s [Cabal] [ 65 of 146] Compiling Distribution.Simple.PackageIndex ( src/Distribution/Simple/PackageIndex.hs, dist/build/Distribution/Simple/PackageIndex.o, dist/build/Distribution/Simple/PackageIndex.dyn_o )
  363. 604.57 s [Cabal] [ 66 of 146] Compiling Distribution.Simple.PackageDescription ( src/Distribution/Simple/PackageDescription.hs, dist/build/Distribution/Simple/PackageDescription.o, dist/build/Distribution/Simple/PackageDescription.dyn_o )
  364. 604.57 s [Cabal] [ 67 of 146] Compiling Distribution.Simple.Glob.Internal ( src/Distribution/Simple/Glob/Internal.hs, dist/build/Distribution/Simple/Glob/Internal.o, dist/build/Distribution/Simple/Glob/Internal.dyn_o )
  365. 604.57 s [Cabal] [ 68 of 146] Compiling Distribution.Simple.Glob ( src/Distribution/Simple/Glob.hs, dist/build/Distribution/Simple/Glob.o, dist/build/Distribution/Simple/Glob.dyn_o )
  366. 604.57 s [Cabal] [ 69 of 146] Compiling Distribution.PackageDescription.Check.Monad ( src/Distribution/PackageDescription/Check/Monad.hs, dist/build/Distribution/PackageDescription/Check/Monad.o, dist/build/Distribution/PackageDescription/Check/Monad.dyn_o )
  367. 604.57 s [Cabal] [ 70 of 146] Compiling Distribution.PackageDescription.Check.Conditional ( src/Distribution/PackageDescription/Check/Conditional.hs, dist/build/Distribution/PackageDescription/Check/Conditional.o, dist/build/Distribution/PackageDescription/Check/Conditional.dyn_o )
  368. 604.57 s [Cabal] [ 71 of 146] Compiling Distribution.PackageDescription.Check.Common ( src/Distribution/PackageDescription/Check/Common.hs, dist/build/Distribution/PackageDescription/Check/Common.o, dist/build/Distribution/PackageDescription/Check/Common.dyn_o )
  369. 604.57 s [Cabal] [ 72 of 146] Compiling Distribution.Simple.Compiler ( src/Distribution/Simple/Compiler.hs, dist/build/Distribution/Simple/Compiler.o, dist/build/Distribution/Simple/Compiler.dyn_o )
  370. 604.57 s [Cabal] [ 73 of 146] Compiling Distribution.Simple.Program.HcPkg ( src/Distribution/Simple/Program/HcPkg.hs, dist/build/Distribution/Simple/Program/HcPkg.o, dist/build/Distribution/Simple/Program/HcPkg.dyn_o )
  371. 604.96 s [Cabal] [ 74 of 146] Compiling Distribution.Simple.GHC.ImplInfo ( src/Distribution/Simple/GHC/ImplInfo.hs, dist/build/Distribution/Simple/GHC/ImplInfo.o, dist/build/Distribution/Simple/GHC/ImplInfo.dyn_o )
  372. 604.96 s [Cabal] [ 75 of 146] Compiling Distribution.Simple.Program.GHC ( src/Distribution/Simple/Program/GHC.hs, dist/build/Distribution/Simple/Program/GHC.o, dist/build/Distribution/Simple/Program/GHC.dyn_o )
  373. 609.17 s [Cabal] [ 76 of 146] Compiling Distribution.Simple.Program.Builtin ( src/Distribution/Simple/Program/Builtin.hs, dist/build/Distribution/Simple/Program/Builtin.o, dist/build/Distribution/Simple/Program/Builtin.dyn_o )
  374. 609.53 s [Cabal] [ 77 of 146] Compiling Distribution.Simple.Program.Db ( src/Distribution/Simple/Program/Db.hs, dist/build/Distribution/Simple/Program/Db.o, dist/build/Distribution/Simple/Program/Db.dyn_o )
  375. 610.42 s [Cabal] [ 78 of 146] Compiling Distribution.Simple.Program ( src/Distribution/Simple/Program.hs, dist/build/Distribution/Simple/Program.o, dist/build/Distribution/Simple/Program.dyn_o )
  376. 610.51 s [Cabal] [ 79 of 146] Compiling Distribution.Simple.Program.Strip ( src/Distribution/Simple/Program/Strip.hs, dist/build/Distribution/Simple/Program/Strip.o, dist/build/Distribution/Simple/Program/Strip.dyn_o )
  377. 610.66 s [Cabal] [ 80 of 146] Compiling Distribution.Simple.Command ( src/Distribution/Simple/Command.hs, dist/build/Distribution/Simple/Command.o, dist/build/Distribution/Simple/Command.dyn_o )
  378. 610.66 s [Cabal] [ 81 of 146] Compiling Distribution.Simple.Setup.Common ( src/Distribution/Simple/Setup/Common.hs, dist/build/Distribution/Simple/Setup/Common.o, dist/build/Distribution/Simple/Setup/Common.dyn_o )
  379. 610.96 s [Cabal] [ 82 of 146] Compiling Distribution.Simple.Setup.Test ( src/Distribution/Simple/Setup/Test.hs, dist/build/Distribution/Simple/Setup/Test.o, dist/build/Distribution/Simple/Setup/Test.dyn_o )
  380. 613.13 s [Cabal] [ 83 of 146] Compiling Distribution.Simple.Setup.SDist ( src/Distribution/Simple/Setup/SDist.hs, dist/build/Distribution/Simple/Setup/SDist.o, dist/build/Distribution/Simple/Setup/SDist.dyn_o )
  381. 613.13 s [Cabal] [ 84 of 146] Compiling Distribution.Simple.Setup.Repl ( src/Distribution/Simple/Setup/Repl.hs, dist/build/Distribution/Simple/Setup/Repl.o, dist/build/Distribution/Simple/Setup/Repl.dyn_o )
  382. 613.13 s [Cabal] [ 85 of 146] Compiling Distribution.Simple.Setup.Register ( src/Distribution/Simple/Setup/Register.hs, dist/build/Distribution/Simple/Setup/Register.o, dist/build/Distribution/Simple/Setup/Register.dyn_o )
  383. 613.13 s [Cabal] [ 86 of 146] Compiling Distribution.Simple.Setup.Install ( src/Distribution/Simple/Setup/Install.hs, dist/build/Distribution/Simple/Setup/Install.o, dist/build/Distribution/Simple/Setup/Install.dyn_o )
  384. 613.13 s [Cabal] [ 87 of 146] Compiling Distribution.Simple.Setup.Hscolour ( src/Distribution/Simple/Setup/Hscolour.hs, dist/build/Distribution/Simple/Setup/Hscolour.o, dist/build/Distribution/Simple/Setup/Hscolour.dyn_o )
  385. 613.13 s [Cabal] [ 88 of 146] Compiling Distribution.Simple.Setup.Haddock ( src/Distribution/Simple/Setup/Haddock.hs, dist/build/Distribution/Simple/Setup/Haddock.o, dist/build/Distribution/Simple/Setup/Haddock.dyn_o )
  386. 614.95 s [Cabal] [ 89 of 146] Compiling Distribution.Simple.Setup.Global ( src/Distribution/Simple/Setup/Global.hs, dist/build/Distribution/Simple/Setup/Global.o, dist/build/Distribution/Simple/Setup/Global.dyn_o )
  387. 614.99 s [Cabal] [ 90 of 146] Compiling Distribution.Simple.Setup.Copy ( src/Distribution/Simple/Setup/Copy.hs, dist/build/Distribution/Simple/Setup/Copy.o, dist/build/Distribution/Simple/Setup/Copy.dyn_o )
  388. 614.99 s [Cabal] [ 91 of 146] Compiling Distribution.Simple.Setup.Config ( src/Distribution/Simple/Setup/Config.hs, dist/build/Distribution/Simple/Setup/Config.o, dist/build/Distribution/Simple/Setup/Config.dyn_o )
  389. 621.67 s [Cabal] [ 92 of 146] Compiling Distribution.Types.LocalBuildConfig ( src/Distribution/Types/LocalBuildConfig.hs, dist/build/Distribution/Types/LocalBuildConfig.o, dist/build/Distribution/Types/LocalBuildConfig.dyn_o )
  390. 624.56 s [Cabal] [ 93 of 146] Compiling Distribution.Types.LocalBuildInfo ( src/Distribution/Types/LocalBuildInfo.hs, dist/build/Distribution/Types/LocalBuildInfo.o, dist/build/Distribution/Types/LocalBuildInfo.dyn_o )
  391. 625.49 s [Cabal] [ 94 of 146] Compiling Distribution.Simple.LocalBuildInfo ( src/Distribution/Simple/LocalBuildInfo.hs, dist/build/Distribution/Simple/LocalBuildInfo.o, dist/build/Distribution/Simple/LocalBuildInfo.dyn_o )
  392. 626.09 s [Cabal] [ 95 of 146] Compiling Distribution.Simple.Test.Log ( src/Distribution/Simple/Test/Log.hs, dist/build/Distribution/Simple/Test/Log.o, dist/build/Distribution/Simple/Test/Log.dyn_o )
  393. 627.38 s [Cabal] [ 96 of 146] Compiling Distribution.Simple.Hpc ( src/Distribution/Simple/Hpc.hs, dist/build/Distribution/Simple/Hpc.o, dist/build/Distribution/Simple/Hpc.dyn_o )
  394. 627.42 s [Cabal] [ 97 of 146] Compiling Distribution.Simple.Build.PackageInfoModule ( src/Distribution/Simple/Build/PackageInfoModule.hs, dist/build/Distribution/Simple/Build/PackageInfoModule.o, dist/build/Distribution/Simple/Build/PackageInfoModule.dyn_o )
  395. 627.42 s [Cabal] [ 98 of 146] Compiling Distribution.Simple.Build.Macros ( src/Distribution/Simple/Build/Macros.hs, dist/build/Distribution/Simple/Build/Macros.o, dist/build/Distribution/Simple/Build/Macros.dyn_o )
  396. 627.42 s [Cabal] [ 99 of 146] Compiling Distribution.Backpack.Id ( src/Distribution/Backpack/Id.hs, dist/build/Distribution/Backpack/Id.o, dist/build/Distribution/Backpack/Id.dyn_o )
  397. 627.42 s [Cabal] [100 of 146] Compiling Distribution.Backpack.ConfiguredComponent ( src/Distribution/Backpack/ConfiguredComponent.hs, dist/build/Distribution/Backpack/ConfiguredComponent.o, dist/build/Distribution/Backpack/ConfiguredComponent.dyn_o )
  398. 628.16 s [Cabal] [101 of 146] Compiling Distribution.Backpack.LinkedComponent ( src/Distribution/Backpack/LinkedComponent.hs, dist/build/Distribution/Backpack/LinkedComponent.o, dist/build/Distribution/Backpack/LinkedComponent.dyn_o )
  399. 629.39 s [Cabal] [102 of 146] Compiling Distribution.Backpack.ComponentsGraph ( src/Distribution/Backpack/ComponentsGraph.hs, dist/build/Distribution/Backpack/ComponentsGraph.o, dist/build/Distribution/Backpack/ComponentsGraph.dyn_o )
  400. 629.39 s [Cabal] [103 of 146] Compiling Distribution.Simple.Program.Ld ( src/Distribution/Simple/Program/Ld.hs, dist/build/Distribution/Simple/Program/Ld.o, dist/build/Distribution/Simple/Program/Ld.dyn_o )
  401. 629.39 s [Cabal] [104 of 146] Compiling Distribution.Simple.Program.Ar ( src/Distribution/Simple/Program/Ar.hs, dist/build/Distribution/Simple/Program/Ar.o, dist/build/Distribution/Simple/Program/Ar.dyn_o )
  402. 629.39 s [Cabal] [105 of 146] Compiling Distribution.Simple.ConfigureScript ( src/Distribution/Simple/ConfigureScript.hs, dist/build/Distribution/Simple/ConfigureScript.o, dist/build/Distribution/Simple/ConfigureScript.dyn_o )
  403. 629.39 s [Cabal] [106 of 146] Compiling Distribution.Simple.Setup.Clean ( src/Distribution/Simple/Setup/Clean.hs, dist/build/Distribution/Simple/Setup/Clean.o, dist/build/Distribution/Simple/Setup/Clean.dyn_o )
  404. 629.39 s [Cabal] [107 of 146] Compiling Distribution.Simple.Setup.Build ( src/Distribution/Simple/Setup/Build.hs, dist/build/Distribution/Simple/Setup/Build.o, dist/build/Distribution/Simple/Setup/Build.dyn_o )
  405. 629.39 s [Cabal] [108 of 146] Compiling Distribution.Simple.Setup.Benchmark ( src/Distribution/Simple/Setup/Benchmark.hs, dist/build/Distribution/Simple/Setup/Benchmark.o, dist/build/Distribution/Simple/Setup/Benchmark.dyn_o )
  406. 629.39 s [Cabal] [109 of 146] Compiling Distribution.Simple.Setup ( src/Distribution/Simple/Setup.hs, dist/build/Distribution/Simple/Setup.o, dist/build/Distribution/Simple/Setup.dyn_o )
  407. 629.39 s [Cabal] [110 of 146] Compiling Distribution.Simple.Build.Inputs ( src/Distribution/Simple/Build/Inputs.hs, dist/build/Distribution/Simple/Build/Inputs.o, dist/build/Distribution/Simple/Build/Inputs.dyn_o )
  408. 629.39 s [Cabal] [111 of 146] Compiling Distribution.Simple.BuildTarget ( src/Distribution/Simple/BuildTarget.hs, dist/build/Distribution/Simple/BuildTarget.o, dist/build/Distribution/Simple/BuildTarget.dyn_o )
  409. 629.72 s [Cabal] [112 of 146] Compiling Distribution.Simple.BuildPaths ( src/Distribution/Simple/BuildPaths.hs, dist/build/Distribution/Simple/BuildPaths.o, dist/build/Distribution/Simple/BuildPaths.dyn_o )
  410. 629.72 s [Cabal] [113 of 146] Compiling Distribution.Simple.UHC ( src/Distribution/Simple/UHC.hs, dist/build/Distribution/Simple/UHC.o, dist/build/Distribution/Simple/UHC.dyn_o )
  411. 629.72 s [Cabal] [114 of 146] Compiling Distribution.Simple.HaskellSuite ( src/Distribution/Simple/HaskellSuite.hs, dist/build/Distribution/Simple/HaskellSuite.o, dist/build/Distribution/Simple/HaskellSuite.dyn_o )
  412. 629.72 s [Cabal] [115 of 146] Compiling Distribution.Simple.GHC.Internal ( src/Distribution/Simple/GHC/Internal.hs, dist/build/Distribution/Simple/GHC/Internal.o, dist/build/Distribution/Simple/GHC/Internal.dyn_o )
  413. 629.72 s [Cabal] [116 of 146] Compiling Distribution.Simple.GHC.EnvironmentParser ( src/Distribution/Simple/GHC/EnvironmentParser.hs, dist/build/Distribution/Simple/GHC/EnvironmentParser.o, dist/build/Distribution/Simple/GHC/EnvironmentParser.dyn_o )
  414. 629.72 s [Cabal] [117 of 146] Compiling Distribution.Simple.GHCJS ( src/Distribution/Simple/GHCJS.hs, dist/build/Distribution/Simple/GHCJS.o, dist/build/Distribution/Simple/GHCJS.dyn_o )
  415. 633.09 s [Cabal] [118 of 146] Compiling Distribution.Simple.GHC.Build.Utils ( src/Distribution/Simple/GHC/Build/Utils.hs, dist/build/Distribution/Simple/GHC/Build/Utils.o, dist/build/Distribution/Simple/GHC/Build/Utils.dyn_o )
  416. 633.12 s [Cabal] [119 of 146] Compiling Distribution.Simple.GHC.Build.Modules ( src/Distribution/Simple/GHC/Build/Modules.hs, dist/build/Distribution/Simple/GHC/Build/Modules.o, dist/build/Distribution/Simple/GHC/Build/Modules.dyn_o )
  417. 633.12 s [Cabal] [120 of 146] Compiling Distribution.Simple.GHC.Build.ExtraSources ( src/Distribution/Simple/GHC/Build/ExtraSources.hs, dist/build/Distribution/Simple/GHC/Build/ExtraSources.o, dist/build/Distribution/Simple/GHC/Build/ExtraSources.dyn_o )
  418. 633.12 s [Cabal] [121 of 146] Compiling Distribution.Simple.GHC.Build.Link ( src/Distribution/Simple/GHC/Build/Link.hs, dist/build/Distribution/Simple/GHC/Build/Link.o, dist/build/Distribution/Simple/GHC/Build/Link.dyn_o )
  419. 633.12 s [Cabal] [122 of 146] Compiling Distribution.Simple.GHC.Build ( src/Distribution/Simple/GHC/Build.hs, dist/build/Distribution/Simple/GHC/Build.o, dist/build/Distribution/Simple/GHC/Build.dyn_o )
  420. 633.12 s [Cabal] [123 of 146] Compiling Distribution.Simple.GHC ( src/Distribution/Simple/GHC.hs, dist/build/Distribution/Simple/GHC.o, dist/build/Distribution/Simple/GHC.dyn_o )
  421. 633.45 s [Cabal] [124 of 146] Compiling Distribution.Simple.ShowBuildInfo ( src/Distribution/Simple/ShowBuildInfo.hs, dist/build/Distribution/Simple/ShowBuildInfo.o, dist/build/Distribution/Simple/ShowBuildInfo.dyn_o )
  422. 633.73 s [Cabal] [125 of 146] Compiling Distribution.Simple.Install ( src/Distribution/Simple/Install.hs, dist/build/Distribution/Simple/Install.o, dist/build/Distribution/Simple/Install.dyn_o )
  423. 634.16 s [Cabal] [126 of 146] Compiling Distribution.Simple.Build.PathsModule ( src/Distribution/Simple/Build/PathsModule.hs, dist/build/Distribution/Simple/Build/PathsModule.o, dist/build/Distribution/Simple/Build/PathsModule.dyn_o )
  424. 634.16 s [Cabal] [127 of 146] Compiling Distribution.Simple.Test.LibV09 ( src/Distribution/Simple/Test/LibV09.hs, dist/build/Distribution/Simple/Test/LibV09.o, dist/build/Distribution/Simple/Test/LibV09.dyn_o )
  425. 634.16 s [Cabal] [128 of 146] Compiling Distribution.Simple.Test.ExeV10 ( src/Distribution/Simple/Test/ExeV10.hs, dist/build/Distribution/Simple/Test/ExeV10.o, dist/build/Distribution/Simple/Test/ExeV10.dyn_o )
  426. 634.16 s [Cabal] [129 of 146] Compiling Distribution.PackageDescription.Check.Paths ( src/Distribution/PackageDescription/Check/Paths.hs, dist/build/Distribution/PackageDescription/Check/Paths.o, dist/build/Distribution/PackageDescription/Check/Paths.dyn_o )
  427. 634.16 s [Cabal] [130 of 146] Compiling Distribution.PackageDescription.Check.Target ( src/Distribution/PackageDescription/Check/Target.hs, dist/build/Distribution/PackageDescription/Check/Target.o, dist/build/Distribution/PackageDescription/Check/Target.dyn_o )
  428. 634.16 s [Cabal] [131 of 146] Compiling Distribution.PackageDescription.Check ( src/Distribution/PackageDescription/Check.hs, dist/build/Distribution/PackageDescription/Check.o, dist/build/Distribution/PackageDescription/Check.dyn_o )
  429. 635.03 s [Cabal] [132 of 146] Compiling Distribution.Make ( src/Distribution/Make.hs, dist/build/Distribution/Make.o, dist/build/Distribution/Make.dyn_o )
  430. 635.03 s [Cabal] [133 of 146] Compiling Distribution.Compat.Time ( src/Distribution/Compat/Time.hs, dist/build/Distribution/Compat/Time.o, dist/build/Distribution/Compat/Time.dyn_o )
  431. 635.03 s [Cabal] [134 of 146] Compiling Distribution.Backpack.ReadyComponent ( src/Distribution/Backpack/ReadyComponent.hs, dist/build/Distribution/Backpack/ReadyComponent.o, dist/build/Distribution/Backpack/ReadyComponent.dyn_o )
  432. 635.03 s [Cabal] [135 of 146] Compiling Distribution.Backpack.Configure ( src/Distribution/Backpack/Configure.hs, dist/build/Distribution/Backpack/Configure.o, dist/build/Distribution/Backpack/Configure.dyn_o )
  433. 635.03 s [Cabal] [136 of 146] Compiling Distribution.Backpack.DescribeUnitId ( src/Distribution/Backpack/DescribeUnitId.hs, dist/build/Distribution/Backpack/DescribeUnitId.o, dist/build/Distribution/Backpack/DescribeUnitId.dyn_o )
  434. 635.03 s [Cabal] [137 of 146] Compiling Distribution.Simple.Register ( src/Distribution/Simple/Register.hs, dist/build/Distribution/Simple/Register.o, dist/build/Distribution/Simple/Register.dyn_o )
  435. 635.03 s [Cabal] [138 of 146] Compiling Distribution.Simple.PreProcess ( src/Distribution/Simple/PreProcess.hs, dist/build/Distribution/Simple/PreProcess.o, dist/build/Distribution/Simple/PreProcess.dyn_o )
  436. 635.04 s [Cabal] [139 of 146] Compiling Distribution.Simple.UserHooks ( src/Distribution/Simple/UserHooks.hs, dist/build/Distribution/Simple/UserHooks.o, dist/build/Distribution/Simple/UserHooks.dyn_o )
  437. 635.04 s [Cabal] [140 of 146] Compiling Distribution.Simple.Bench ( src/Distribution/Simple/Bench.hs, dist/build/Distribution/Simple/Bench.o, dist/build/Distribution/Simple/Bench.dyn_o )
  438. 635.04 s [Cabal] [141 of 146] Compiling Distribution.Simple.Configure ( src/Distribution/Simple/Configure.hs, dist/build/Distribution/Simple/Configure.o, dist/build/Distribution/Simple/Configure.dyn_o )
  439. 641.55 s [Cabal] [142 of 146] Compiling Distribution.Simple.Test ( src/Distribution/Simple/Test.hs, dist/build/Distribution/Simple/Test.o, dist/build/Distribution/Simple/Test.dyn_o )
  440. 642.22 s [Cabal] [143 of 146] Compiling Distribution.Simple.SrcDist ( src/Distribution/Simple/SrcDist.hs, dist/build/Distribution/Simple/SrcDist.o, dist/build/Distribution/Simple/SrcDist.dyn_o )
  441. 642.78 s [Cabal] [144 of 146] Compiling Distribution.Simple.Build ( src/Distribution/Simple/Build.hs, dist/build/Distribution/Simple/Build.o, dist/build/Distribution/Simple/Build.dyn_o )
  442. 644.07 s [Cabal] [145 of 146] Compiling Distribution.Simple.Haddock ( src/Distribution/Simple/Haddock.hs, dist/build/Distribution/Simple/Haddock.o, dist/build/Distribution/Simple/Haddock.dyn_o )
  443. 647.05 s [Cabal] [146 of 146] Compiling Distribution.Simple ( src/Distribution/Simple.hs, dist/build/Distribution/Simple.o, dist/build/Distribution/Simple.dyn_o )
  444. 649.79 s [Cabal] [ 1 of 146] Compiling Distribution.Backpack.FullUnitId ( src/Distribution/Backpack/FullUnitId.hs, dist/build/Distribution/Backpack/FullUnitId.p_o )
  445. 650.80 s [Cabal] [ 2 of 146] Compiling Distribution.Backpack.ModSubst ( src/Distribution/Backpack/ModSubst.hs, dist/build/Distribution/Backpack/ModSubst.p_o )
  446. 650.97 s [Cabal] [ 3 of 146] Compiling Distribution.Backpack.ModuleScope ( src/Distribution/Backpack/ModuleScope.hs, dist/build/Distribution/Backpack/ModuleScope.p_o )
  447. 651.46 s [Cabal] [ 4 of 146] Compiling Distribution.Backpack.ModuleShape ( src/Distribution/Backpack/ModuleShape.hs, dist/build/Distribution/Backpack/ModuleShape.p_o )
  448. 651.59 s [Cabal] [ 5 of 146] Compiling Distribution.Backpack.PreModuleShape ( src/Distribution/Backpack/PreModuleShape.hs, dist/build/Distribution/Backpack/PreModuleShape.p_o )
  449. 652.04 s [Cabal] [ 6 of 146] Compiling Distribution.Compat.Async ( src/Distribution/Compat/Async.hs, dist/build/Distribution/Compat/Async.p_o )
  450. 652.04 s [Cabal] [ 7 of 146] Compiling Distribution.Compat.CreatePipe ( src/Distribution/Compat/CreatePipe.hs, dist/build/Distribution/Compat/CreatePipe.p_o )
  451. 652.04 s [Cabal] [ 8 of 146] Compiling Distribution.Compat.Directory ( src/Distribution/Compat/Directory.hs, dist/build/Distribution/Compat/Directory.p_o )
  452. 652.04 s [Cabal] [ 9 of 146] Compiling Distribution.Compat.FilePath ( src/Distribution/Compat/FilePath.hs, dist/build/Distribution/Compat/FilePath.p_o )
  453. 652.04 s [Cabal] [ 10 of 146] Compiling Distribution.Compat.GetShortPathName ( src/Distribution/Compat/GetShortPathName.hs, dist/build/Distribution/Compat/GetShortPathName.p_o )
  454. 652.04 s [Cabal] [ 11 of 146] Compiling Distribution.Compat.Internal.TempFile ( src/Distribution/Compat/Internal/TempFile.hs, dist/build/Distribution/Compat/Internal/TempFile.p_o )
  455. 652.04 s [Cabal] [ 12 of 146] Compiling Distribution.Compat.CopyFile ( src/Distribution/Compat/CopyFile.hs, dist/build/Distribution/Compat/CopyFile.p_o )
  456. 652.04 s [Cabal] [ 13 of 146] Compiling Distribution.Compat.Prelude.Internal ( src/Distribution/Compat/Prelude/Internal.hs, dist/build/Distribution/Compat/Prelude/Internal.p_o )
  457. 652.04 s [Cabal] [ 14 of 146] Compiling Distribution.Compat.Process ( src/Distribution/Compat/Process.hs, dist/build/Distribution/Compat/Process.p_o )
  458. 652.04 s [Cabal] [ 15 of 146] Compiling Distribution.Compat.ResponseFile ( src/Distribution/Compat/ResponseFile.hs, dist/build/Distribution/Compat/ResponseFile.p_o )
  459. 652.04 s [Cabal] [ 16 of 146] Compiling Distribution.Compat.SnocList ( src/Distribution/Compat/SnocList.hs, dist/build/Distribution/Compat/SnocList.p_o )
  460. 652.04 s [Cabal] [ 17 of 146] Compiling Distribution.Compat.Stack ( src/Distribution/Compat/Stack.hs, dist/build/Distribution/Compat/Stack.p_o )
  461. 652.04 s [Cabal] [ 18 of 146] Compiling Distribution.Compat.Environment ( src/Distribution/Compat/Environment.hs, dist/build/Distribution/Compat/Environment.p_o )
  462. 652.04 s [Cabal] [ 19 of 146] Compiling Distribution.GetOpt ( src/Distribution/GetOpt.hs, dist/build/Distribution/GetOpt.p_o )
  463. 652.04 s [Cabal] [ 20 of 146] Compiling Distribution.Lex ( src/Distribution/Lex.hs, dist/build/Distribution/Lex.p_o )
  464. 652.04 s [Cabal] [ 21 of 146] Compiling Distribution.PackageDescription.Check.Warning ( src/Distribution/PackageDescription/Check/Warning.hs, dist/build/Distribution/PackageDescription/Check/Warning.p_o )
  465. 654.51 s [Cabal] [ 22 of 146] Compiling Distribution.ReadE ( src/Distribution/ReadE.hs, dist/build/Distribution/ReadE.p_o )
  466. 654.51 s [Cabal] [ 23 of 146] Compiling Distribution.Simple.BuildToolDepends ( src/Distribution/Simple/BuildToolDepends.hs, dist/build/Distribution/Simple/BuildToolDepends.p_o )
  467. 654.55 s [Cabal] [ 24 of 146] Compiling Distribution.Simple.CCompiler ( src/Distribution/Simple/CCompiler.hs, dist/build/Distribution/Simple/CCompiler.p_o )
  468. 654.55 s [Cabal] [ 25 of 146] Compiling Distribution.Simple.Flag ( src/Distribution/Simple/Flag.hs, dist/build/Distribution/Simple/Flag.p_o )
  469. 654.55 s [Cabal] [ 26 of 146] Compiling Distribution.Simple.InstallDirs.Internal ( src/Distribution/Simple/InstallDirs/Internal.hs, dist/build/Distribution/Simple/InstallDirs/Internal.p_o )
  470. 654.55 s [Cabal] [ 27 of 146] Compiling Distribution.Simple.InstallDirs ( src/Distribution/Simple/InstallDirs.hs, dist/build/Distribution/Simple/InstallDirs.p_o )
  471. 654.55 s [Cabal] [ 28 of 146] Compiling Distribution.Simple.Program.Internal ( src/Distribution/Simple/Program/Internal.hs, dist/build/Distribution/Simple/Program/Internal.p_o )
  472. 654.55 s [Cabal] [ 29 of 146] Compiling Distribution.TestSuite ( src/Distribution/TestSuite.hs, dist/build/Distribution/TestSuite.p_o )
  473. 654.55 s [Cabal] [ 30 of 146] Compiling Distribution.Types.AnnotatedId ( src/Distribution/Types/AnnotatedId.hs, dist/build/Distribution/Types/AnnotatedId.p_o )
  474. 654.55 s [Cabal] [ 31 of 146] Compiling Distribution.Backpack.PreExistingComponent ( src/Distribution/Backpack/PreExistingComponent.hs, dist/build/Distribution/Backpack/PreExistingComponent.p_o )
  475. 654.55 s [Cabal] [ 32 of 146] Compiling Distribution.Types.ComponentInclude ( src/Distribution/Types/ComponentInclude.hs, dist/build/Distribution/Types/ComponentInclude.p_o )
  476. 654.55 s [Cabal] [ 33 of 146] Compiling Distribution.Types.ComponentLocalBuildInfo ( src/Distribution/Types/ComponentLocalBuildInfo.hs, dist/build/Distribution/Types/ComponentLocalBuildInfo.p_o )
  477. 654.55 s [Cabal] [ 34 of 146] Compiling Distribution.Types.DumpBuildInfo ( src/Distribution/Types/DumpBuildInfo.hs, dist/build/Distribution/Types/DumpBuildInfo.p_o )
  478. 654.55 s [Cabal] [ 35 of 146] Compiling Distribution.Types.GivenComponent ( src/Distribution/Types/GivenComponent.hs, dist/build/Distribution/Types/GivenComponent.p_o )
  479. 654.55 s [Cabal] [ 36 of 146] Compiling Distribution.Types.PackageName.Magic ( src/Distribution/Types/PackageName/Magic.hs, dist/build/Distribution/Types/PackageName/Magic.p_o )
  480. 654.55 s [Cabal] [ 37 of 146] Compiling Distribution.Types.ParStrat ( src/Distribution/Types/ParStrat.hs, dist/build/Distribution/Types/ParStrat.p_o )
  481. 654.55 s [Cabal] [ 38 of 146] Compiling Distribution.Types.TargetInfo ( src/Distribution/Types/TargetInfo.hs, dist/build/Distribution/Types/TargetInfo.p_o )
  482. 654.55 s [Cabal] [ 39 of 146] Compiling Distribution.Utils.IOData ( src/Distribution/Utils/IOData.hs, dist/build/Distribution/Utils/IOData.p_o )
  483. 654.55 s [Cabal] [ 40 of 146] Compiling Distribution.Utils.Json ( src/Distribution/Utils/Json.hs, dist/build/Distribution/Utils/Json.p_o )
  484. 654.55 s [Cabal] [ 41 of 146] Compiling Distribution.Utils.MapAccum ( src/Distribution/Utils/MapAccum.hs, dist/build/Distribution/Utils/MapAccum.p_o )
  485. 654.55 s [Cabal] [ 42 of 146] Compiling Distribution.Utils.Progress ( src/Distribution/Utils/Progress.hs, dist/build/Distribution/Utils/Progress.p_o )
  486. 654.55 s [Cabal] [ 43 of 146] Compiling Distribution.Utils.UnionFind ( src/Distribution/Utils/UnionFind.hs, dist/build/Distribution/Utils/UnionFind.p_o )
  487. 654.55 s [Cabal] [ 44 of 146] Compiling Distribution.Verbosity.Internal ( src/Distribution/Verbosity/Internal.hs, dist/build/Distribution/Verbosity/Internal.p_o )
  488. 654.55 s [Cabal] [ 45 of 146] Compiling Distribution.Verbosity ( src/Distribution/Verbosity.hs, dist/build/Distribution/Verbosity.p_o )
  489. 654.55 s [Cabal] [ 46 of 146] Compiling Distribution.Simple.Program.Types ( src/Distribution/Simple/Program/Types.hs, dist/build/Distribution/Simple/Program/Types.p_o )
  490. 654.55 s [Cabal] [ 47 of 146] Compiling Distribution.Simple.PreProcess.Types ( src/Distribution/Simple/PreProcess/Types.hs, dist/build/Distribution/Simple/PreProcess/Types.p_o )
  491. 654.55 s [Cabal] [ 48 of 146] Compiling Distribution.Simple.Errors ( src/Distribution/Simple/Errors.hs, dist/build/Distribution/Simple/Errors.p_o )
  492. 655.73 s [Cabal] [ 49 of 146] Compiling Distribution.Simple.PreProcess.Unlit ( src/Distribution/Simple/PreProcess/Unlit.hs, dist/build/Distribution/Simple/PreProcess/Unlit.p_o )
  493. 656.02 s [Cabal] [ 50 of 146] Compiling Distribution.Backpack.UnifyM ( src/Distribution/Backpack/UnifyM.hs, dist/build/Distribution/Backpack/UnifyM.p_o )
  494. 656.02 s [Cabal] [ 51 of 146] Compiling Distribution.Backpack.MixLink ( src/Distribution/Backpack/MixLink.hs, dist/build/Distribution/Backpack/MixLink.p_o )
  495. 656.02 s [Cabal] [ 52 of 146] Compiling Distribution.ZinzaPrelude ( src/Distribution/ZinzaPrelude.hs, dist/build/Distribution/ZinzaPrelude.p_o )
  496. 656.02 s [Cabal] [ 53 of 146] Compiling Distribution.Simple.Build.PathsModule.Z ( src/Distribution/Simple/Build/PathsModule/Z.hs, dist/build/Distribution/Simple/Build/PathsModule/Z.p_o )
  497. 656.02 s [Cabal] [ 54 of 146] Compiling Distribution.Simple.Build.PackageInfoModule.Z ( src/Distribution/Simple/Build/PackageInfoModule/Z.hs, dist/build/Distribution/Simple/Build/PackageInfoModule/Z.p_o )
  498. 656.02 s [Cabal] [ 55 of 146] Compiling Distribution.Simple.Build.Macros.Z ( src/Distribution/Simple/Build/Macros/Z.hs, dist/build/Distribution/Simple/Build/Macros/Z.p_o )
  499. 656.02 s [Cabal] [ 56 of 146] Compiling Paths_Cabal ( dist/build/autogen/Paths_Cabal.hs, dist/build/Paths_Cabal.p_o )
  500. 656.02 s [Cabal] [ 57 of 146] Compiling Distribution.Simple.Utils ( src/Distribution/Simple/Utils.hs, dist/build/Distribution/Simple/Utils.p_o )
  501. 657.17 s [Cabal] [ 58 of 146] Compiling Distribution.Utils.NubList ( src/Distribution/Utils/NubList.hs, dist/build/Distribution/Utils/NubList.p_o )
  502. 657.66 s [Cabal] [ 59 of 146] Compiling Distribution.Utils.LogProgress ( src/Distribution/Utils/LogProgress.hs, dist/build/Distribution/Utils/LogProgress.p_o )
  503. 657.66 s [Cabal] [ 60 of 146] Compiling Distribution.Simple.Program.Run ( src/Distribution/Simple/Program/Run.hs, dist/build/Distribution/Simple/Program/Run.p_o )
  504. 657.79 s [Cabal] [ 61 of 146] Compiling Distribution.Simple.Program.Script ( src/Distribution/Simple/Program/Script.hs, dist/build/Distribution/Simple/Program/Script.p_o )
  505. 658.08 s [Cabal] [ 62 of 146] Compiling Distribution.Simple.Program.ResponseFile ( src/Distribution/Simple/Program/ResponseFile.hs, dist/build/Distribution/Simple/Program/ResponseFile.p_o )
  506. 658.08 s [Cabal] [ 63 of 146] Compiling Distribution.Simple.Program.Hpc ( src/Distribution/Simple/Program/Hpc.hs, dist/build/Distribution/Simple/Program/Hpc.p_o )
  507. 658.08 s [Cabal] [ 64 of 146] Compiling Distribution.Simple.Program.Find ( src/Distribution/Simple/Program/Find.hs, dist/build/Distribution/Simple/Program/Find.p_o )
  508. 658.08 s [Cabal] [ 65 of 146] Compiling Distribution.Simple.PackageIndex ( src/Distribution/Simple/PackageIndex.hs, dist/build/Distribution/Simple/PackageIndex.p_o )
  509. 660.21 s [Cabal] [ 66 of 146] Compiling Distribution.Simple.PackageDescription ( src/Distribution/Simple/PackageDescription.hs, dist/build/Distribution/Simple/PackageDescription.p_o )
  510. 660.25 s [Cabal] [ 67 of 146] Compiling Distribution.Simple.Glob.Internal ( src/Distribution/Simple/Glob/Internal.hs, dist/build/Distribution/Simple/Glob/Internal.p_o )
  511. 660.25 s [Cabal] [ 68 of 146] Compiling Distribution.Simple.Glob ( src/Distribution/Simple/Glob.hs, dist/build/Distribution/Simple/Glob.p_o )
  512. 660.25 s [Cabal] [ 69 of 146] Compiling Distribution.PackageDescription.Check.Monad ( src/Distribution/PackageDescription/Check/Monad.hs, dist/build/Distribution/PackageDescription/Check/Monad.p_o )
  513. 660.25 s [Cabal] [ 70 of 146] Compiling Distribution.PackageDescription.Check.Conditional ( src/Distribution/PackageDescription/Check/Conditional.hs, dist/build/Distribution/PackageDescription/Check/Conditional.p_o )
  514. 660.25 s [Cabal] [ 71 of 146] Compiling Distribution.PackageDescription.Check.Common ( src/Distribution/PackageDescription/Check/Common.hs, dist/build/Distribution/PackageDescription/Check/Common.p_o )
  515. 660.25 s [Cabal] [ 72 of 146] Compiling Distribution.Simple.Compiler ( src/Distribution/Simple/Compiler.hs, dist/build/Distribution/Simple/Compiler.p_o )
  516. 660.25 s [Cabal] [ 73 of 146] Compiling Distribution.Simple.Program.HcPkg ( src/Distribution/Simple/Program/HcPkg.hs, dist/build/Distribution/Simple/Program/HcPkg.p_o )
  517. 660.64 s [Cabal] [ 74 of 146] Compiling Distribution.Simple.GHC.ImplInfo ( src/Distribution/Simple/GHC/ImplInfo.hs, dist/build/Distribution/Simple/GHC/ImplInfo.p_o )
  518. 660.65 s [Cabal] [ 75 of 146] Compiling Distribution.Simple.Program.GHC ( src/Distribution/Simple/Program/GHC.hs, dist/build/Distribution/Simple/Program/GHC.p_o )
  519. 664.03 s [Cabal] [ 76 of 146] Compiling Distribution.Simple.Program.Builtin ( src/Distribution/Simple/Program/Builtin.hs, dist/build/Distribution/Simple/Program/Builtin.p_o )
  520. 664.55 s [Cabal] [ 77 of 146] Compiling Distribution.Simple.Program.Db ( src/Distribution/Simple/Program/Db.hs, dist/build/Distribution/Simple/Program/Db.p_o )
  521. 665.16 s [Cabal] [ 78 of 146] Compiling Distribution.Simple.Program ( src/Distribution/Simple/Program.hs, dist/build/Distribution/Simple/Program.p_o )
  522. 665.31 s [Cabal] [ 79 of 146] Compiling Distribution.Simple.Program.Strip ( src/Distribution/Simple/Program/Strip.hs, dist/build/Distribution/Simple/Program/Strip.p_o )
  523. 665.46 s [Cabal] [ 80 of 146] Compiling Distribution.Simple.Command ( src/Distribution/Simple/Command.hs, dist/build/Distribution/Simple/Command.p_o )
  524. 665.46 s [Cabal] [ 81 of 146] Compiling Distribution.Simple.Setup.Common ( src/Distribution/Simple/Setup/Common.hs, dist/build/Distribution/Simple/Setup/Common.p_o )
  525. 665.75 s [Cabal] [ 82 of 146] Compiling Distribution.Simple.Setup.Test ( src/Distribution/Simple/Setup/Test.hs, dist/build/Distribution/Simple/Setup/Test.p_o )
  526. 667.10 s [Cabal] [ 83 of 146] Compiling Distribution.Simple.Setup.SDist ( src/Distribution/Simple/Setup/SDist.hs, dist/build/Distribution/Simple/Setup/SDist.p_o )
  527. 667.10 s [Cabal] [ 84 of 146] Compiling Distribution.Simple.Setup.Repl ( src/Distribution/Simple/Setup/Repl.hs, dist/build/Distribution/Simple/Setup/Repl.p_o )
  528. 667.10 s [Cabal] [ 85 of 146] Compiling Distribution.Simple.Setup.Register ( src/Distribution/Simple/Setup/Register.hs, dist/build/Distribution/Simple/Setup/Register.p_o )
  529. 667.10 s [Cabal] [ 86 of 146] Compiling Distribution.Simple.Setup.Install ( src/Distribution/Simple/Setup/Install.hs, dist/build/Distribution/Simple/Setup/Install.p_o )
  530. 667.11 s [Cabal] [ 87 of 146] Compiling Distribution.Simple.Setup.Hscolour ( src/Distribution/Simple/Setup/Hscolour.hs, dist/build/Distribution/Simple/Setup/Hscolour.p_o )
  531. 667.11 s [Cabal] [ 88 of 146] Compiling Distribution.Simple.Setup.Haddock ( src/Distribution/Simple/Setup/Haddock.hs, dist/build/Distribution/Simple/Setup/Haddock.p_o )
  532. 667.80 s [Cabal] [ 89 of 146] Compiling Distribution.Simple.Setup.Global ( src/Distribution/Simple/Setup/Global.hs, dist/build/Distribution/Simple/Setup/Global.p_o )
  533. 667.80 s [Cabal] [ 90 of 146] Compiling Distribution.Simple.Setup.Copy ( src/Distribution/Simple/Setup/Copy.hs, dist/build/Distribution/Simple/Setup/Copy.p_o )
  534. 667.80 s [Cabal] [ 91 of 146] Compiling Distribution.Simple.Setup.Config ( src/Distribution/Simple/Setup/Config.hs, dist/build/Distribution/Simple/Setup/Config.p_o )
  535. 671.00 s [Cabal] [ 92 of 146] Compiling Distribution.Types.LocalBuildConfig ( src/Distribution/Types/LocalBuildConfig.hs, dist/build/Distribution/Types/LocalBuildConfig.p_o )
  536. 672.53 s [Cabal] [ 93 of 146] Compiling Distribution.Types.LocalBuildInfo ( src/Distribution/Types/LocalBuildInfo.hs, dist/build/Distribution/Types/LocalBuildInfo.p_o )
  537. 673.10 s [Cabal] [ 94 of 146] Compiling Distribution.Simple.LocalBuildInfo ( src/Distribution/Simple/LocalBuildInfo.hs, dist/build/Distribution/Simple/LocalBuildInfo.p_o )
  538. 673.43 s [Cabal] [ 95 of 146] Compiling Distribution.Simple.Test.Log ( src/Distribution/Simple/Test/Log.hs, dist/build/Distribution/Simple/Test/Log.p_o )
  539. 674.09 s [Cabal] [ 96 of 146] Compiling Distribution.Simple.Hpc ( src/Distribution/Simple/Hpc.hs, dist/build/Distribution/Simple/Hpc.p_o )
  540. 674.09 s [Cabal] [ 97 of 146] Compiling Distribution.Simple.Build.PackageInfoModule ( src/Distribution/Simple/Build/PackageInfoModule.hs, dist/build/Distribution/Simple/Build/PackageInfoModule.p_o )
  541. 674.09 s [Cabal] [ 98 of 146] Compiling Distribution.Simple.Build.Macros ( src/Distribution/Simple/Build/Macros.hs, dist/build/Distribution/Simple/Build/Macros.p_o )
  542. 674.09 s [Cabal] [ 99 of 146] Compiling Distribution.Backpack.Id ( src/Distribution/Backpack/Id.hs, dist/build/Distribution/Backpack/Id.p_o )
  543. 674.09 s [Cabal] [100 of 146] Compiling Distribution.Backpack.ConfiguredComponent ( src/Distribution/Backpack/ConfiguredComponent.hs, dist/build/Distribution/Backpack/ConfiguredComponent.p_o )
  544. 674.80 s [Cabal] [101 of 146] Compiling Distribution.Backpack.LinkedComponent ( src/Distribution/Backpack/LinkedComponent.hs, dist/build/Distribution/Backpack/LinkedComponent.p_o )
  545. 676.18 s [Cabal] [102 of 146] Compiling Distribution.Backpack.ComponentsGraph ( src/Distribution/Backpack/ComponentsGraph.hs, dist/build/Distribution/Backpack/ComponentsGraph.p_o )
  546. 676.22 s [Cabal] [103 of 146] Compiling Distribution.Simple.Program.Ld ( src/Distribution/Simple/Program/Ld.hs, dist/build/Distribution/Simple/Program/Ld.p_o )
  547. 676.22 s [Cabal] [104 of 146] Compiling Distribution.Simple.Program.Ar ( src/Distribution/Simple/Program/Ar.hs, dist/build/Distribution/Simple/Program/Ar.p_o )
  548. 676.22 s [Cabal] [105 of 146] Compiling Distribution.Simple.ConfigureScript ( src/Distribution/Simple/ConfigureScript.hs, dist/build/Distribution/Simple/ConfigureScript.p_o )
  549. 676.22 s [Cabal] [106 of 146] Compiling Distribution.Simple.Setup.Clean ( src/Distribution/Simple/Setup/Clean.hs, dist/build/Distribution/Simple/Setup/Clean.p_o )
  550. 676.22 s [Cabal] [107 of 146] Compiling Distribution.Simple.Setup.Build ( src/Distribution/Simple/Setup/Build.hs, dist/build/Distribution/Simple/Setup/Build.p_o )
  551. 676.22 s [Cabal] [108 of 146] Compiling Distribution.Simple.Setup.Benchmark ( src/Distribution/Simple/Setup/Benchmark.hs, dist/build/Distribution/Simple/Setup/Benchmark.p_o )
  552. 676.22 s [Cabal] [109 of 146] Compiling Distribution.Simple.Setup ( src/Distribution/Simple/Setup.hs, dist/build/Distribution/Simple/Setup.p_o )
  553. 676.22 s [Cabal] [110 of 146] Compiling Distribution.Simple.Build.Inputs ( src/Distribution/Simple/Build/Inputs.hs, dist/build/Distribution/Simple/Build/Inputs.p_o )
  554. 676.22 s [Cabal] [111 of 146] Compiling Distribution.Simple.BuildTarget ( src/Distribution/Simple/BuildTarget.hs, dist/build/Distribution/Simple/BuildTarget.p_o )
  555. 676.22 s [Cabal] [112 of 146] Compiling Distribution.Simple.BuildPaths ( src/Distribution/Simple/BuildPaths.hs, dist/build/Distribution/Simple/BuildPaths.p_o )
  556. 676.22 s [Cabal] [113 of 146] Compiling Distribution.Simple.UHC ( src/Distribution/Simple/UHC.hs, dist/build/Distribution/Simple/UHC.p_o )
  557. 676.22 s [Cabal] [114 of 146] Compiling Distribution.Simple.HaskellSuite ( src/Distribution/Simple/HaskellSuite.hs, dist/build/Distribution/Simple/HaskellSuite.p_o )
  558. 676.22 s [Cabal] [115 of 146] Compiling Distribution.Simple.GHC.Internal ( src/Distribution/Simple/GHC/Internal.hs, dist/build/Distribution/Simple/GHC/Internal.p_o )
  559. 676.22 s [Cabal] [116 of 146] Compiling Distribution.Simple.GHC.EnvironmentParser ( src/Distribution/Simple/GHC/EnvironmentParser.hs, dist/build/Distribution/Simple/GHC/EnvironmentParser.p_o )
  560. 676.22 s [Cabal] [117 of 146] Compiling Distribution.Simple.GHCJS ( src/Distribution/Simple/GHCJS.hs, dist/build/Distribution/Simple/GHCJS.p_o )
  561. 679.13 s [Cabal] [118 of 146] Compiling Distribution.Simple.GHC.Build.Utils ( src/Distribution/Simple/GHC/Build/Utils.hs, dist/build/Distribution/Simple/GHC/Build/Utils.p_o )
  562. 679.13 s [Cabal] [119 of 146] Compiling Distribution.Simple.GHC.Build.Modules ( src/Distribution/Simple/GHC/Build/Modules.hs, dist/build/Distribution/Simple/GHC/Build/Modules.p_o )
  563. 679.13 s [Cabal] [120 of 146] Compiling Distribution.Simple.GHC.Build.ExtraSources ( src/Distribution/Simple/GHC/Build/ExtraSources.hs, dist/build/Distribution/Simple/GHC/Build/ExtraSources.p_o )
  564. 679.14 s [Cabal] [121 of 146] Compiling Distribution.Simple.GHC.Build.Link ( src/Distribution/Simple/GHC/Build/Link.hs, dist/build/Distribution/Simple/GHC/Build/Link.p_o )
  565. 679.14 s [Cabal] [122 of 146] Compiling Distribution.Simple.GHC.Build ( src/Distribution/Simple/GHC/Build.hs, dist/build/Distribution/Simple/GHC/Build.p_o )
  566. 679.14 s [Cabal] [123 of 146] Compiling Distribution.Simple.GHC ( src/Distribution/Simple/GHC.hs, dist/build/Distribution/Simple/GHC.p_o )
  567. 679.14 s [Cabal] [124 of 146] Compiling Distribution.Simple.ShowBuildInfo ( src/Distribution/Simple/ShowBuildInfo.hs, dist/build/Distribution/Simple/ShowBuildInfo.p_o )
  568. 679.43 s [Cabal] [125 of 146] Compiling Distribution.Simple.Install ( src/Distribution/Simple/Install.hs, dist/build/Distribution/Simple/Install.p_o )
  569. 679.83 s [Cabal] [126 of 146] Compiling Distribution.Simple.Build.PathsModule ( src/Distribution/Simple/Build/PathsModule.hs, dist/build/Distribution/Simple/Build/PathsModule.p_o )
  570. 679.83 s [Cabal] [127 of 146] Compiling Distribution.Simple.Test.LibV09 ( src/Distribution/Simple/Test/LibV09.hs, dist/build/Distribution/Simple/Test/LibV09.p_o )
  571. 679.83 s [Cabal] [128 of 146] Compiling Distribution.Simple.Test.ExeV10 ( src/Distribution/Simple/Test/ExeV10.hs, dist/build/Distribution/Simple/Test/ExeV10.p_o )
  572. 679.83 s [Cabal] [129 of 146] Compiling Distribution.PackageDescription.Check.Paths ( src/Distribution/PackageDescription/Check/Paths.hs, dist/build/Distribution/PackageDescription/Check/Paths.p_o )
  573. 679.83 s [Cabal] [130 of 146] Compiling Distribution.PackageDescription.Check.Target ( src/Distribution/PackageDescription/Check/Target.hs, dist/build/Distribution/PackageDescription/Check/Target.p_o )
  574. 679.83 s [Cabal] [131 of 146] Compiling Distribution.PackageDescription.Check ( src/Distribution/PackageDescription/Check.hs, dist/build/Distribution/PackageDescription/Check.p_o )
  575. 679.83 s [Cabal] [132 of 146] Compiling Distribution.Make ( src/Distribution/Make.hs, dist/build/Distribution/Make.p_o )
  576. 679.83 s [Cabal] [133 of 146] Compiling Distribution.Compat.Time ( src/Distribution/Compat/Time.hs, dist/build/Distribution/Compat/Time.p_o )
  577. 679.83 s [Cabal] [134 of 146] Compiling Distribution.Backpack.ReadyComponent ( src/Distribution/Backpack/ReadyComponent.hs, dist/build/Distribution/Backpack/ReadyComponent.p_o )
  578. 679.83 s [Cabal] [135 of 146] Compiling Distribution.Backpack.Configure ( src/Distribution/Backpack/Configure.hs, dist/build/Distribution/Backpack/Configure.p_o )
  579. 679.83 s [Cabal] [136 of 146] Compiling Distribution.Backpack.DescribeUnitId ( src/Distribution/Backpack/DescribeUnitId.hs, dist/build/Distribution/Backpack/DescribeUnitId.p_o )
  580. 679.83 s [Cabal] [137 of 146] Compiling Distribution.Simple.Register ( src/Distribution/Simple/Register.hs, dist/build/Distribution/Simple/Register.p_o )
  581. 680.26 s [Cabal] [138 of 146] Compiling Distribution.Simple.PreProcess ( src/Distribution/Simple/PreProcess.hs, dist/build/Distribution/Simple/PreProcess.p_o )
  582. 680.26 s [Cabal] [139 of 146] Compiling Distribution.Simple.UserHooks ( src/Distribution/Simple/UserHooks.hs, dist/build/Distribution/Simple/UserHooks.p_o )
  583. 680.26 s [Cabal] [140 of 146] Compiling Distribution.Simple.Bench ( src/Distribution/Simple/Bench.hs, dist/build/Distribution/Simple/Bench.p_o )
  584. 680.26 s [Cabal] [141 of 146] Compiling Distribution.Simple.Configure ( src/Distribution/Simple/Configure.hs, dist/build/Distribution/Simple/Configure.p_o )
  585. 683.26 s [Cabal] [142 of 146] Compiling Distribution.Simple.Test ( src/Distribution/Simple/Test.hs, dist/build/Distribution/Simple/Test.p_o )
  586. 683.76 s [Cabal] [143 of 146] Compiling Distribution.Simple.SrcDist ( src/Distribution/Simple/SrcDist.hs, dist/build/Distribution/Simple/SrcDist.p_o )
  587. 684.09 s [Cabal] [144 of 146] Compiling Distribution.Simple.Build ( src/Distribution/Simple/Build.hs, dist/build/Distribution/Simple/Build.p_o )
  588. 684.65 s [Cabal] [145 of 146] Compiling Distribution.Simple.Haddock ( src/Distribution/Simple/Haddock.hs, dist/build/Distribution/Simple/Haddock.p_o )
  589. 686.75 s [Cabal] [146 of 146] Compiling Distribution.Simple ( src/Distribution/Simple.hs, dist/build/Distribution/Simple.p_o )
  590. 690.52 s [Cabal] buildPhase completed in 1 minutes 43 seconds
  591. 690.57 s [Cabal] Phase: haddockPhase
  592. 690.66 s [Cabal] Preprocessing library for Cabal-3.12.1.0..
  593. 690.68 s [Cabal] Running Haddock on library for Cabal-3.12.1.0..
  594. 690.75 s [Cabal] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
  595. 691.90 s [Cabal] [ 1 of 146] Compiling Distribution.Backpack.FullUnitId ( src/Distribution/Backpack/FullUnitId.hs, nothing )
  596. 692.18 s [Cabal] [ 2 of 146] Compiling Distribution.Backpack.ModSubst ( src/Distribution/Backpack/ModSubst.hs, nothing )
  597. 692.20 s [Cabal] [ 3 of 146] Compiling Distribution.Backpack.ModuleScope ( src/Distribution/Backpack/ModuleScope.hs, nothing )
  598. 692.24 s [Cabal] [ 4 of 146] Compiling Distribution.Backpack.ModuleShape ( src/Distribution/Backpack/ModuleShape.hs, nothing )
  599. 692.33 s [Cabal] [ 5 of 146] Compiling Distribution.Backpack.PreModuleShape ( src/Distribution/Backpack/PreModuleShape.hs, nothing )
  600. 692.44 s [Cabal] [ 6 of 146] Compiling Distribution.Compat.Async ( src/Distribution/Compat/Async.hs, nothing )
  601. 692.47 s [Cabal] [ 7 of 146] Compiling Distribution.Compat.CreatePipe ( src/Distribution/Compat/CreatePipe.hs, nothing )
  602. 692.47 s [Cabal] [ 8 of 146] Compiling Distribution.Compat.Directory ( src/Distribution/Compat/Directory.hs, nothing )
  603. 692.47 s [Cabal] [ 9 of 146] Compiling Distribution.Compat.FilePath ( src/Distribution/Compat/FilePath.hs, nothing )
  604. 692.47 s [Cabal] [ 10 of 146] Compiling Distribution.Compat.GetShortPathName ( src/Distribution/Compat/GetShortPathName.hs, nothing )
  605. 692.48 s [Cabal] [ 11 of 146] Compiling Distribution.Compat.Internal.TempFile ( src/Distribution/Compat/Internal/TempFile.hs, nothing )
  606. 692.52 s [Cabal] [ 12 of 146] Compiling Distribution.Compat.CopyFile ( src/Distribution/Compat/CopyFile.hs, nothing )
  607. 692.54 s [Cabal] [ 13 of 146] Compiling Distribution.Compat.Prelude.Internal ( src/Distribution/Compat/Prelude/Internal.hs, nothing )
  608. 692.57 s [Cabal] [ 14 of 146] Compiling Distribution.Compat.Process ( src/Distribution/Compat/Process.hs, nothing )
  609. 692.57 s [Cabal] [ 15 of 146] Compiling Distribution.Compat.ResponseFile ( src/Distribution/Compat/ResponseFile.hs, nothing )
  610. 692.58 s [Cabal] [ 16 of 146] Compiling Distribution.Compat.SnocList ( src/Distribution/Compat/SnocList.hs, nothing )
  611. 692.58 s [Cabal] [ 17 of 146] Compiling Distribution.Compat.Stack ( src/Distribution/Compat/Stack.hs, nothing )
  612. 692.59 s [Cabal] [ 18 of 146] Compiling Distribution.Compat.Environment ( src/Distribution/Compat/Environment.hs, nothing )
  613. 692.60 s [Cabal] [ 19 of 146] Compiling Distribution.GetOpt ( src/Distribution/GetOpt.hs, nothing )
  614. 692.65 s [Cabal] [ 20 of 146] Compiling Distribution.Lex ( src/Distribution/Lex.hs, nothing )
  615. 692.66 s [Cabal] [ 21 of 146] Compiling Distribution.PackageDescription.Check.Warning ( src/Distribution/PackageDescription/Check/Warning.hs, nothing )
  616. 693.12 s [Cabal] [ 22 of 146] Compiling Distribution.ReadE ( src/Distribution/ReadE.hs, nothing )
  617. 693.14 s [Cabal] [ 23 of 146] Compiling Distribution.Simple.BuildToolDepends ( src/Distribution/Simple/BuildToolDepends.hs, nothing )
  618. 693.15 s [Cabal] [ 24 of 146] Compiling Distribution.Simple.CCompiler ( src/Distribution/Simple/CCompiler.hs, nothing )
  619. 693.16 s [Cabal] [ 25 of 146] Compiling Distribution.Simple.Flag ( src/Distribution/Simple/Flag.hs, nothing )
  620. 693.19 s [Cabal] [ 26 of 146] Compiling Distribution.Simple.InstallDirs.Internal ( src/Distribution/Simple/InstallDirs/Internal.hs, nothing )
  621. 693.23 s [Cabal] [ 27 of 146] Compiling Distribution.Simple.InstallDirs ( src/Distribution/Simple/InstallDirs.hs, nothing )
  622. 693.34 s [Cabal] [ 28 of 146] Compiling Distribution.Simple.Program.Internal ( src/Distribution/Simple/Program/Internal.hs, nothing )
  623. 693.34 s [Cabal] [ 29 of 146] Compiling Distribution.TestSuite ( src/Distribution/TestSuite.hs, nothing )
  624. 693.36 s [Cabal] [ 30 of 146] Compiling Distribution.Types.AnnotatedId ( src/Distribution/Types/AnnotatedId.hs, nothing )
  625. 693.37 s [Cabal] [ 31 of 146] Compiling Distribution.Backpack.PreExistingComponent ( src/Distribution/Backpack/PreExistingComponent.hs, nothing )
  626. 693.38 s [Cabal] [ 32 of 146] Compiling Distribution.Types.ComponentInclude ( src/Distribution/Types/ComponentInclude.hs, nothing )
  627. 693.38 s [Cabal] [ 33 of 146] Compiling Distribution.Types.ComponentLocalBuildInfo ( src/Distribution/Types/ComponentLocalBuildInfo.hs, nothing )
  628. 693.43 s [Cabal] [ 34 of 146] Compiling Distribution.Types.DumpBuildInfo ( src/Distribution/Types/DumpBuildInfo.hs, nothing )
  629. 693.44 s [Cabal] [ 35 of 146] Compiling Distribution.Types.GivenComponent ( src/Distribution/Types/GivenComponent.hs, nothing )
  630. 693.45 s [Cabal] [ 36 of 146] Compiling Distribution.Types.PackageName.Magic ( src/Distribution/Types/PackageName/Magic.hs, nothing )
  631. 693.45 s [Cabal] [ 37 of 146] Compiling Distribution.Types.ParStrat ( src/Distribution/Types/ParStrat.hs, nothing )
  632. 693.45 s [Cabal] [ 38 of 146] Compiling Distribution.Types.TargetInfo ( src/Distribution/Types/TargetInfo.hs, nothing )
  633. 693.48 s [Cabal] [ 39 of 146] Compiling Distribution.Utils.IOData ( src/Distribution/Utils/IOData.hs, nothing )
  634. 693.49 s [Cabal] [ 40 of 146] Compiling Distribution.Utils.Json ( src/Distribution/Utils/Json.hs, nothing )
  635. 693.51 s [Cabal] [ 41 of 146] Compiling Distribution.Utils.MapAccum ( src/Distribution/Utils/MapAccum.hs, nothing )
  636. 693.52 s [Cabal] [ 42 of 146] Compiling Distribution.Utils.Progress ( src/Distribution/Utils/Progress.hs, nothing )
  637. 693.53 s [Cabal] [ 43 of 146] Compiling Distribution.Utils.UnionFind ( src/Distribution/Utils/UnionFind.hs, nothing )
  638. 693.54 s [Cabal] [ 44 of 146] Compiling Distribution.Verbosity.Internal ( src/Distribution/Verbosity/Internal.hs, nothing )
  639. 693.57 s [Cabal] [ 45 of 146] Compiling Distribution.Verbosity ( src/Distribution/Verbosity.hs, nothing )
  640. 693.62 s [Cabal] [ 46 of 146] Compiling Distribution.Simple.Program.Types ( src/Distribution/Simple/Program/Types.hs, nothing )
  641. 693.80 s [Cabal] [ 47 of 146] Compiling Distribution.Simple.PreProcess.Types ( src/Distribution/Simple/PreProcess/Types.hs, nothing )
  642. 693.81 s [Cabal] [ 48 of 146] Compiling Distribution.Simple.Errors ( src/Distribution/Simple/Errors.hs, nothing )
  643. 693.91 s [Cabal] [ 49 of 146] Compiling Distribution.Simple.PreProcess.Unlit ( src/Distribution/Simple/PreProcess/Unlit.hs, nothing )
  644. 693.93 s [Cabal] [ 50 of 146] Compiling Distribution.Backpack.UnifyM ( src/Distribution/Backpack/UnifyM.hs, nothing )
  645. 694.02 s [Cabal] [ 51 of 146] Compiling Distribution.Backpack.MixLink ( src/Distribution/Backpack/MixLink.hs, nothing )
  646. 694.05 s [Cabal] [ 52 of 146] Compiling Distribution.ZinzaPrelude ( src/Distribution/ZinzaPrelude.hs, nothing )
  647. 694.06 s [Cabal] [ 53 of 146] Compiling Distribution.Simple.Build.PathsModule.Z ( src/Distribution/Simple/Build/PathsModule/Z.hs, nothing )
  648. 694.08 s [Cabal] [ 54 of 146] Compiling Distribution.Simple.Build.PackageInfoModule.Z ( src/Distribution/Simple/Build/PackageInfoModule/Z.hs, nothing )
  649. 694.09 s [Cabal] [ 55 of 146] Compiling Distribution.Simple.Build.Macros.Z ( src/Distribution/Simple/Build/Macros/Z.hs, nothing )
  650. 694.11 s [Cabal] [ 56 of 146] Compiling Paths_Cabal ( dist/build/autogen/Paths_Cabal.hs, nothing )
  651. 694.12 s [Cabal] [ 57 of 146] Compiling Distribution.Simple.Utils ( src/Distribution/Simple/Utils.hs, nothing )
  652. 694.35 s [Cabal] [ 58 of 146] Compiling Distribution.Utils.NubList ( src/Distribution/Utils/NubList.hs, nothing )
  653. 694.37 s [Cabal] [ 59 of 146] Compiling Distribution.Utils.LogProgress ( src/Distribution/Utils/LogProgress.hs, nothing )
  654. 694.38 s [Cabal] [ 60 of 146] Compiling Distribution.Simple.Program.Run ( src/Distribution/Simple/Program/Run.hs, nothing )
  655. 694.54 s [Cabal] [ 61 of 146] Compiling Distribution.Simple.Program.Script ( src/Distribution/Simple/Program/Script.hs, nothing )
  656. 694.56 s [Cabal] [ 62 of 146] Compiling Distribution.Simple.Program.ResponseFile ( src/Distribution/Simple/Program/ResponseFile.hs, nothing )
  657. 694.56 s [Cabal] [ 63 of 146] Compiling Distribution.Simple.Program.Hpc ( src/Distribution/Simple/Program/Hpc.hs, nothing )
  658. 694.57 s [Cabal] [ 64 of 146] Compiling Distribution.Simple.Program.Find ( src/Distribution/Simple/Program/Find.hs, nothing )
  659. 694.59 s [Cabal] [ 65 of 146] Compiling Distribution.Simple.PackageIndex ( src/Distribution/Simple/PackageIndex.hs, nothing )
  660. 694.71 s [Cabal] [ 66 of 146] Compiling Distribution.Simple.PackageDescription ( src/Distribution/Simple/PackageDescription.hs, nothing )
  661. 694.73 s [Cabal] [ 67 of 146] Compiling Distribution.Simple.Glob.Internal ( src/Distribution/Simple/Glob/Internal.hs, nothing )
  662. 694.81 s [Cabal] [ 68 of 146] Compiling Distribution.Simple.Glob ( src/Distribution/Simple/Glob.hs, nothing )
  663. 694.82 s [Cabal] [ 69 of 146] Compiling Distribution.PackageDescription.Check.Monad ( src/Distribution/PackageDescription/Check/Monad.hs, nothing )
  664. 694.88 s [Cabal] [ 70 of 146] Compiling Distribution.PackageDescription.Check.Conditional ( src/Distribution/PackageDescription/Check/Conditional.hs, nothing )
  665. 694.93 s [Cabal] [ 71 of 146] Compiling Distribution.PackageDescription.Check.Common ( src/Distribution/PackageDescription/Check/Common.hs, nothing )
  666. 694.95 s [Cabal] [ 72 of 146] Compiling Distribution.Simple.Compiler ( src/Distribution/Simple/Compiler.hs, nothing )
  667. 695.05 s [Cabal] [ 73 of 146] Compiling Distribution.Simple.Program.HcPkg ( src/Distribution/Simple/Program/HcPkg.hs, nothing )
  668. 695.11 s [Cabal] [ 74 of 146] Compiling Distribution.Simple.GHC.ImplInfo ( src/Distribution/Simple/GHC/ImplInfo.hs, nothing )
  669. 695.12 s [Cabal] [ 75 of 146] Compiling Distribution.Simple.Program.GHC ( src/Distribution/Simple/Program/GHC.hs, nothing )
  670. 695.40 s [Cabal] [ 76 of 146] Compiling Distribution.Simple.Program.Builtin ( src/Distribution/Simple/Program/Builtin.hs, nothing )
  671. 695.44 s [Cabal] [ 77 of 146] Compiling Distribution.Simple.Program.Db ( src/Distribution/Simple/Program/Db.hs, nothing )
  672. 695.50 s [Cabal] [ 78 of 146] Compiling Distribution.Simple.Program ( src/Distribution/Simple/Program.hs, nothing )
  673. 695.51 s [Cabal] [ 79 of 146] Compiling Distribution.Simple.Program.Strip ( src/Distribution/Simple/Program/Strip.hs, nothing )
  674. 695.52 s [Cabal] [ 80 of 146] Compiling Distribution.Simple.Command ( src/Distribution/Simple/Command.hs, nothing )
  675. 695.64 s [Cabal] [ 81 of 146] Compiling Distribution.Simple.Setup.Common ( src/Distribution/Simple/Setup/Common.hs, nothing )
  676. 695.68 s [Cabal] [ 82 of 146] Compiling Distribution.Simple.Setup.Test ( src/Distribution/Simple/Setup/Test.hs, nothing )
  677. 695.76 s [Cabal] [ 83 of 146] Compiling Distribution.Simple.Setup.SDist ( src/Distribution/Simple/Setup/SDist.hs, nothing )
  678. 695.76 s [Cabal] [ 84 of 146] Compiling Distribution.Simple.Setup.Repl ( src/Distribution/Simple/Setup/Repl.hs, nothing )
  679. 695.80 s [Cabal] [ 85 of 146] Compiling Distribution.Simple.Setup.Register ( src/Distribution/Simple/Setup/Register.hs, nothing )
  680. 695.82 s [Cabal] [ 86 of 146] Compiling Distribution.Simple.Setup.Install ( src/Distribution/Simple/Setup/Install.hs, nothing )
  681. 695.84 s [Cabal] [ 87 of 146] Compiling Distribution.Simple.Setup.Hscolour ( src/Distribution/Simple/Setup/Hscolour.hs, nothing )
  682. 695.87 s [Cabal] [ 88 of 146] Compiling Distribution.Simple.Setup.Haddock ( src/Distribution/Simple/Setup/Haddock.hs, nothing )
  683. 696.14 s [Cabal] [ 89 of 146] Compiling Distribution.Simple.Setup.Global ( src/Distribution/Simple/Setup/Global.hs, nothing )
  684. 696.20 s [Cabal] [ 90 of 146] Compiling Distribution.Simple.Setup.Copy ( src/Distribution/Simple/Setup/Copy.hs, nothing )
  685. 696.24 s [Cabal] [ 91 of 146] Compiling Distribution.Simple.Setup.Config ( src/Distribution/Simple/Setup/Config.hs, nothing )
  686. 696.51 s [Cabal] [ 92 of 146] Compiling Distribution.Types.LocalBuildConfig ( src/Distribution/Types/LocalBuildConfig.hs, nothing )
  687. 696.58 s [Cabal] [ 93 of 146] Compiling Distribution.Types.LocalBuildInfo ( src/Distribution/Types/LocalBuildInfo.hs, nothing )
  688. 696.62 s [Cabal] [ 94 of 146] Compiling Distribution.Simple.LocalBuildInfo ( src/Distribution/Simple/LocalBuildInfo.hs, nothing )
  689. 696.65 s [Cabal] [ 95 of 146] Compiling Distribution.Simple.Test.Log ( src/Distribution/Simple/Test/Log.hs, nothing )
  690. 696.67 s [Cabal] [ 96 of 146] Compiling Distribution.Simple.Hpc ( src/Distribution/Simple/Hpc.hs, nothing )
  691. 696.69 s [Cabal] [ 97 of 146] Compiling Distribution.Simple.Build.PackageInfoModule ( src/Distribution/Simple/Build/PackageInfoModule.hs, nothing )
  692. 696.70 s [Cabal] [ 98 of 146] Compiling Distribution.Simple.Build.Macros ( src/Distribution/Simple/Build/Macros.hs, nothing )
  693. 696.71 s [Cabal] [ 99 of 146] Compiling Distribution.Backpack.Id ( src/Distribution/Backpack/Id.hs, nothing )
  694. 696.72 s [Cabal] [100 of 146] Compiling Distribution.Backpack.ConfiguredComponent ( src/Distribution/Backpack/ConfiguredComponent.hs, nothing )
  695. 696.76 s [Cabal] [101 of 146] Compiling Distribution.Backpack.LinkedComponent ( src/Distribution/Backpack/LinkedComponent.hs, nothing )
  696. 696.96 s [Cabal] [102 of 146] Compiling Distribution.Backpack.ComponentsGraph ( src/Distribution/Backpack/ComponentsGraph.hs, nothing )
  697. 696.98 s [Cabal] [103 of 146] Compiling Distribution.Simple.Program.Ld ( src/Distribution/Simple/Program/Ld.hs, nothing )
  698. 696.99 s [Cabal] [104 of 146] Compiling Distribution.Simple.Program.Ar ( src/Distribution/Simple/Program/Ar.hs, nothing )
  699. 697.03 s [Cabal] [105 of 146] Compiling Distribution.Simple.ConfigureScript ( src/Distribution/Simple/ConfigureScript.hs, nothing )
  700. 697.05 s [Cabal] [106 of 146] Compiling Distribution.Simple.Setup.Clean ( src/Distribution/Simple/Setup/Clean.hs, nothing )
  701. 697.19 s [Cabal] [107 of 146] Compiling Distribution.Simple.Setup.Build ( src/Distribution/Simple/Setup/Build.hs, nothing )
  702. 697.26 s [Cabal] [108 of 146] Compiling Distribution.Simple.Setup.Benchmark ( src/Distribution/Simple/Setup/Benchmark.hs, nothing )
  703. 697.28 s [Cabal] [109 of 146] Compiling Distribution.Simple.Setup ( src/Distribution/Simple/Setup.hs, nothing )
  704. 697.35 s [Cabal] [110 of 146] Compiling Distribution.Simple.Build.Inputs ( src/Distribution/Simple/Build/Inputs.hs, nothing )
  705. 697.36 s [Cabal] [111 of 146] Compiling Distribution.Simple.BuildTarget ( src/Distribution/Simple/BuildTarget.hs, nothing )
  706. 697.51 s [Cabal] [112 of 146] Compiling Distribution.Simple.BuildPaths ( src/Distribution/Simple/BuildPaths.hs, nothing )
  707. 697.53 s [Cabal] [113 of 146] Compiling Distribution.Simple.UHC ( src/Distribution/Simple/UHC.hs, nothing )
  708. 697.56 s [Cabal] [114 of 146] Compiling Distribution.Simple.HaskellSuite ( src/Distribution/Simple/HaskellSuite.hs, nothing )
  709. 697.58 s [Cabal] [115 of 146] Compiling Distribution.Simple.GHC.Internal ( src/Distribution/Simple/GHC/Internal.hs, nothing )
  710. 697.66 s [Cabal] [116 of 146] Compiling Distribution.Simple.GHC.EnvironmentParser ( src/Distribution/Simple/GHC/EnvironmentParser.hs, nothing )
  711. 697.68 s [Cabal] [117 of 146] Compiling Distribution.Simple.GHCJS ( src/Distribution/Simple/GHCJS.hs, nothing )
  712. 698.04 s [Cabal] [118 of 146] Compiling Distribution.Simple.GHC.Build.Utils ( src/Distribution/Simple/GHC/Build/Utils.hs, nothing )
  713. 698.06 s [Cabal] [119 of 146] Compiling Distribution.Simple.GHC.Build.Modules ( src/Distribution/Simple/GHC/Build/Modules.hs, nothing )
  714. 698.10 s [Cabal] [120 of 146] Compiling Distribution.Simple.GHC.Build.ExtraSources ( src/Distribution/Simple/GHC/Build/ExtraSources.hs, nothing )
  715. 698.12 s [Cabal] [121 of 146] Compiling Distribution.Simple.GHC.Build.Link ( src/Distribution/Simple/GHC/Build/Link.hs, nothing )
  716. 698.20 s [Cabal] [122 of 146] Compiling Distribution.Simple.GHC.Build ( src/Distribution/Simple/GHC/Build.hs, nothing )
  717. 698.22 s [Cabal] [123 of 146] Compiling Distribution.Simple.GHC ( src/Distribution/Simple/GHC.hs, nothing )
  718. 698.33 s [Cabal] [124 of 146] Compiling Distribution.Simple.ShowBuildInfo ( src/Distribution/Simple/ShowBuildInfo.hs, nothing )
  719. 698.35 s [Cabal] [125 of 146] Compiling Distribution.Simple.Install ( src/Distribution/Simple/Install.hs, nothing )
  720. 698.38 s [Cabal] [126 of 146] Compiling Distribution.Simple.Build.PathsModule ( src/Distribution/Simple/Build/PathsModule.hs, nothing )
  721. 698.41 s [Cabal] [127 of 146] Compiling Distribution.Simple.Test.LibV09 ( src/Distribution/Simple/Test/LibV09.hs, nothing )
  722. 698.45 s [Cabal] [128 of 146] Compiling Distribution.Simple.Test.ExeV10 ( src/Distribution/Simple/Test/ExeV10.hs, nothing )
  723. 698.47 s [Cabal] [129 of 146] Compiling Distribution.PackageDescription.Check.Paths ( src/Distribution/PackageDescription/Check/Paths.hs, nothing )
  724. 698.49 s [Cabal] [130 of 146] Compiling Distribution.PackageDescription.Check.Target ( src/Distribution/PackageDescription/Check/Target.hs, nothing )
  725. 698.72 s [Cabal] [131 of 146] Compiling Distribution.PackageDescription.Check ( src/Distribution/PackageDescription/Check.hs, nothing )
  726. 698.84 s [Cabal] [132 of 146] Compiling Distribution.Make ( src/Distribution/Make.hs, nothing )
  727. 698.85 s [Cabal] [133 of 146] Compiling Distribution.Compat.Time ( src/Distribution/Compat/Time.hs, nothing )
  728. 698.87 s [Cabal] [134 of 146] Compiling Distribution.Backpack.ReadyComponent ( src/Distribution/Backpack/ReadyComponent.hs, nothing )
  729. 698.91 s [Cabal] [135 of 146] Compiling Distribution.Backpack.Configure ( src/Distribution/Backpack/Configure.hs, nothing )
  730. 698.96 s [Cabal] [136 of 146] Compiling Distribution.Backpack.DescribeUnitId ( src/Distribution/Backpack/DescribeUnitId.hs, nothing )
  731. 698.97 s [Cabal] [137 of 146] Compiling Distribution.Simple.Register ( src/Distribution/Simple/Register.hs, nothing )
  732. 699.03 s [Cabal] [138 of 146] Compiling Distribution.Simple.PreProcess ( src/Distribution/Simple/PreProcess.hs, nothing )
  733. 699.26 s [Cabal] [139 of 146] Compiling Distribution.Simple.UserHooks ( src/Distribution/Simple/UserHooks.hs, nothing )
  734. 699.28 s [Cabal] [140 of 146] Compiling Distribution.Simple.Bench ( src/Distribution/Simple/Bench.hs, nothing )
  735. 699.29 s [Cabal] [141 of 146] Compiling Distribution.Simple.Configure ( src/Distribution/Simple/Configure.hs, nothing )
  736. 699.55 s [Cabal] [142 of 146] Compiling Distribution.Simple.Test ( src/Distribution/Simple/Test.hs, nothing )
  737. 699.57 s [Cabal] [143 of 146] Compiling Distribution.Simple.SrcDist ( src/Distribution/Simple/SrcDist.hs, nothing )
  738. 699.64 s [Cabal] [144 of 146] Compiling Distribution.Simple.Build ( src/Distribution/Simple/Build.hs, nothing )
  739. 699.79 s [Cabal] [145 of 146] Compiling Distribution.Simple.Haddock ( src/Distribution/Simple/Haddock.hs, nothing )
  740. 700.10 s [Cabal] [146 of 146] Compiling Distribution.Simple ( src/Distribution/Simple.hs, nothing )
  741. 700.25 s [Cabal] Haddock coverage:
  742. 700.25 s [Cabal] 0% ( 0 / 5) in 'Distribution.Backpack.FullUnitId'
  743. 700.25 s [Cabal] Missing documentation for:
  744. 700.25 s [Cabal] Module header
  745. 700.25 s [Cabal] FullUnitId (src/Distribution/Backpack/FullUnitId.hs:15)
  746. 700.25 s [Cabal] FullDb (src/Distribution/Backpack/FullUnitId.hs:18)
  747. 700.25 s [Cabal] expandOpenUnitId (src/Distribution/Backpack/FullUnitId.hs:21)
  748. 700.25 s [Cabal] expandUnitId (src/Distribution/Backpack/FullUnitId.hs:27)
  749. 700.25 s [Cabal] Warning: 'ModuleSubst' is out of scope.
  750. 700.25 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  751. 700.25 s [Cabal] 100% ( 2 / 2) in 'Distribution.Backpack.ModSubst'
  752. 700.25 s [Cabal] Warning: 'OpenModule' is ambiguous. It is defined
  753. 700.25 s [Cabal] * in ‘Distribution.Backpack’
  754. 700.25 s [Cabal] * in ‘Distribution.Backpack’
  755. 700.25 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  756. 700.25 s [Cabal] by specifying the type/value namespace explicitly.
  757. 700.25 s [Cabal] Defaulting to the one defined in ‘Distribution.Backpack’
  758. 700.25 s [Cabal] Warning: 'Module' is out of scope.
  759. 700.25 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  760. 700.25 s [Cabal] Warning: 'ModuleScope' is ambiguous. It is defined
  761. 700.25 s [Cabal] * at src/Distribution/Backpack/ModuleScope.hs:69:20
  762. 700.25 s [Cabal] * at src/Distribution/Backpack/ModuleScope.hs:69:1
  763. 700.25 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  764. 700.25 s [Cabal] by specifying the type/value namespace explicitly.
  765. 700.25 s [Cabal] Defaulting to the one defined at src/Distribution/Backpack/ModuleScope.hs:69:1
  766. 700.25 s [Cabal] Warning: 'ModuleShape' is out of scope.
  767. 700.25 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  768. 700.25 s [Cabal] Warning: 'ModuleShape' is ambiguous. It is defined
  769. 700.25 s [Cabal] * at src/Distribution/Backpack/ModuleShape.hs:30:20
  770. 700.25 s [Cabal] * at src/Distribution/Backpack/ModuleShape.hs:30:1
  771. 700.25 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  772. 700.25 s [Cabal] by specifying the type/value namespace explicitly.
  773. 700.25 s [Cabal] Defaulting to the one defined at src/Distribution/Backpack/ModuleShape.hs:30:1
  774. 700.25 s [Cabal] Warning: 'InstalledPackageInfo' is ambiguous. It is defined
  775. 700.25 s [Cabal] * in ‘Distribution.Types.InstalledPackageInfo’
  776. 700.25 s [Cabal] * in ‘Distribution.Types.InstalledPackageInfo’
  777. 700.25 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  778. 700.25 s [Cabal] by specifying the type/value namespace explicitly.
  779. 700.25 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.InstalledPackageInfo’
  780. 700.25 s [Cabal] 80% ( 4 / 5) in 'Distribution.Backpack.ModuleShape'
  781. 700.25 s [Cabal] Missing documentation for:
  782. 700.25 s [Cabal] shapeInstalledPackage (src/Distribution/Backpack/ModuleShape.hs:77)
  783. 700.25 s [Cabal] 0% ( 0 / 5) in 'Distribution.Backpack.PreModuleShape'
  784. 700.25 s [Cabal] Missing documentation for:
  785. 700.25 s [Cabal] Module header
  786. 700.25 s [Cabal] PreModuleShape (src/Distribution/Backpack/PreModuleShape.hs:22)
  787. 700.25 s [Cabal] toPreModuleShape (src/Distribution/Backpack/PreModuleShape.hs:29)
  788. 700.25 s [Cabal] renamePreModuleShape (src/Distribution/Backpack/PreModuleShape.hs:32)
  789. 700.25 s [Cabal] mixLinkPreModuleShape (src/Distribution/Backpack/PreModuleShape.hs:41)
  790. 700.25 s [Cabal] Warning: 'async' is out of scope.
  791. 700.25 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  792. 700.25 s [Cabal] 50% ( 1 / 2) in 'Distribution.Compat.CreatePipe'
  793. 700.25 s [Cabal] Missing documentation for:
  794. 700.25 s [Cabal] Module header
  795. 700.25 s [Cabal] 75% ( 3 / 4) in 'Distribution.Compat.Directory'
  796. 700.25 s [Cabal] Missing documentation for:
  797. 700.25 s [Cabal] Module header
  798. 700.25 s [Cabal] 66% ( 2 / 3) in 'Distribution.Compat.FilePath'
  799. 700.25 s [Cabal] Missing documentation for:
  800. 700.25 s [Cabal] Module header
  801. 700.25 s [Cabal] Warning: 'GetShortPathName' is out of scope.
  802. 700.25 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  803. 700.26 s [Cabal] 100% ( 2 / 2) in 'Distribution.Compat.Prelude.Internal'
  804. 700.26 s [Cabal] Warning: 'delegate_ctlc' is out of scope.
  805. 700.26 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  806. 700.26 s [Cabal] 80% ( 4 / 5) in 'Distribution.Compat.Process'
  807. 700.26 s [Cabal] Missing documentation for:
  808. 700.26 s [Cabal] Module header
  809. 700.26 s [Cabal] 66% ( 2 / 3) in 'Distribution.Compat.ResponseFile'
  810. 700.26 s [Cabal] Missing documentation for:
  811. 700.26 s [Cabal] Module header
  812. 700.26 s [Cabal] Warning: 'Verbosity' is out of scope.
  813. 700.26 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  814. 700.26 s [Cabal] 66% ( 6 / 9) in 'Distribution.Compat.Stack'
  815. 700.26 s [Cabal] Missing documentation for:
  816. 700.26 s [Cabal] Module header
  817. 700.26 s [Cabal] WithCallStack (src/Distribution/Compat/Stack.hs:31)
  818. 700.26 s [Cabal] withLexicalCallStack (src/Distribution/Compat/Stack.hs:74)
  819. 700.26 s [Cabal] Warning: 'ReturnInOrder' is out of scope.
  820. 700.26 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  821. 700.26 s [Cabal] Warning: 'PackageCheck' is out of scope.
  822. 700.26 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  823. 700.27 s [Cabal] 50% ( 5 / 10) in 'Distribution.ReadE'
  824. 700.27 s [Cabal] Missing documentation for:
  825. 700.27 s [Cabal] succeedReadE (src/Distribution/ReadE.hs:47)
  826. 700.27 s [Cabal] failReadE (src/Distribution/ReadE.hs:50)
  827. 700.27 s [Cabal] parsecToReadE (src/Distribution/ReadE.hs:57)
  828. 700.27 s [Cabal] parsecToReadEErr (src/Distribution/ReadE.hs:61)
  829. 700.27 s [Cabal] unexpectMsgString (src/Distribution/ReadE.hs:67)
  830. 700.27 s [Cabal] Warning: 'PackageDescription' is ambiguous. It is defined
  831. 700.27 s [Cabal] * in ‘Distribution.Types.PackageDescription’
  832. 700.27 s [Cabal] * in ‘Distribution.Types.PackageDescription’
  833. 700.27 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  834. 700.27 s [Cabal] by specifying the type/value namespace explicitly.
  835. 700.27 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.PackageDescription’
  836. 700.27 s [Cabal] Warning: 'BuildInfo' is ambiguous. It is defined
  837. 700.27 s [Cabal] * in ‘Distribution.Types.BuildInfo’
  838. 700.27 s [Cabal] * in ‘Distribution.Types.BuildInfo’
  839. 700.27 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  840. 700.27 s [Cabal] by specifying the type/value namespace explicitly.
  841. 700.27 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.BuildInfo’
  842. 700.27 s [Cabal] 100% ( 6 / 6) in 'Distribution.Simple.BuildToolDepends'
  843. 700.27 s [Cabal] Warning: 'a' is out of scope.
  844. 700.27 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  845. 700.27 s [Cabal] Warning: 'b' is out of scope.
  846. 700.27 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  847. 700.27 s [Cabal] 100% ( 5 / 5) in 'Distribution.Simple.CCompiler'
  848. 700.27 s [Cabal] Warning: 'Flag' is ambiguous. It is defined
  849. 700.27 s [Cabal] * at src/Distribution/Simple/Flag.hs:65:15
  850. 700.27 s [Cabal] * at src/Distribution/Simple/Flag.hs:65:1
  851. 700.27 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  852. 700.27 s [Cabal] by specifying the type/value namespace explicitly.
  853. 700.27 s [Cabal] Defaulting to the one defined at src/Distribution/Simple/Flag.hs:65:1
  854. 700.27 s [Cabal] 100% ( 12 / 12) in 'Distribution.Simple.Flag'
  855. 700.27 s [Cabal] 0% ( 0 / 3) in 'Distribution.Simple.InstallDirs.Internal'
  856. 700.27 s [Cabal] Missing documentation for:
  857. 700.27 s [Cabal] Module header
  858. 700.27 s [Cabal] PathComponent (src/Distribution/Simple/InstallDirs/Internal.hs:12)
  859. 700.27 s [Cabal] PathTemplateVariable (src/Distribution/Simple/InstallDirs/Internal.hs:20)
  860. 700.27 s [Cabal] Warning: 'InstallDirs' is ambiguous. It is defined
  861. 700.27 s [Cabal] * at src/Distribution/Simple/InstallDirs.hs:85:24
  862. 700.27 s [Cabal] * at src/Distribution/Simple/InstallDirs.hs:85:1
  863. 700.27 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  864. 700.27 s [Cabal] by specifying the type/value namespace explicitly.
  865. 700.27 s [Cabal] Defaulting to the one defined at src/Distribution/Simple/InstallDirs.hs:85:1
  866. 700.27 s [Cabal] Warning: 'PathTemplate' is ambiguous. It is defined
  867. 700.27 s [Cabal] * at src/Distribution/Simple/InstallDirs.hs:389:24
  868. 700.27 s [Cabal] * at src/Distribution/Simple/InstallDirs.hs:389:1
  869. 700.27 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  870. 700.27 s [Cabal] by specifying the type/value namespace explicitly.
  871. 700.27 s [Cabal] Defaulting to the one defined at src/Distribution/Simple/InstallDirs.hs:389:1
  872. 700.28 s [Cabal] 47% ( 11 / 23) in 'Distribution.Simple.InstallDirs'
  873. 700.28 s [Cabal] Missing documentation for:
  874. 700.28 s [Cabal] defaultInstallDirs (src/Distribution/Simple/InstallDirs.hs:179)
  875. 700.28 s [Cabal] defaultInstallDirs' (src/Distribution/Simple/InstallDirs.hs:187)
  876. 700.28 s [Cabal] combineInstallDirs (src/Distribution/Simple/InstallDirs.hs:121)
  877. 700.28 s [Cabal] PathTemplateVariable (src/Distribution/Simple/InstallDirs/Internal.hs:20)
  878. 700.28 s [Cabal] PathTemplateEnv (src/Distribution/Simple/InstallDirs.hs:395)
  879. 700.28 s [Cabal] combinePathTemplate (src/Distribution/Simple/InstallDirs.hs:410)
  880. 700.28 s [Cabal] substPathTemplate (src/Distribution/Simple/InstallDirs.hs:414)
  881. 700.28 s [Cabal] platformTemplateEnv (src/Distribution/Simple/InstallDirs.hs:452)
  882. 700.28 s [Cabal] compilerTemplateEnv (src/Distribution/Simple/InstallDirs.hs:447)
  883. 700.28 s [Cabal] packageTemplateEnv (src/Distribution/Simple/InstallDirs.hs:437)
  884. 700.28 s [Cabal] abiTemplateEnv (src/Distribution/Simple/InstallDirs.hs:458)
  885. 700.28 s [Cabal] installDirsTemplateEnv (src/Distribution/Simple/InstallDirs.hs:477)
  886. 700.28 s [Cabal] Warning: 'strip' is out of scope.
  887. 700.28 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  888. 700.28 s [Cabal] 100% ( 2 / 2) in 'Distribution.Simple.Program.Internal'
  889. 700.28 s [Cabal] Warning: 'TestInstance' is ambiguous. It is defined
  890. 700.28 s [Cabal] * at src/Distribution/TestSuite.hs:30:21
  891. 700.28 s [Cabal] * at src/Distribution/TestSuite.hs:30:1
  892. 700.28 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  893. 700.28 s [Cabal] by specifying the type/value namespace explicitly.
  894. 700.28 s [Cabal] Defaulting to the one defined at src/Distribution/TestSuite.hs:30:1
  895. 700.28 s [Cabal] 22% ( 2 / 9) in 'Distribution.TestSuite'
  896. 700.28 s [Cabal] Missing documentation for:
  897. 700.28 s [Cabal] TestInstance (src/Distribution/TestSuite.hs:30)
  898. 700.28 s [Cabal] OptionDescr (src/Distribution/TestSuite.hs:49)
  899. 700.28 s [Cabal] OptionType (src/Distribution/TestSuite.hs:59)
  900. 700.28 s [Cabal] Test (src/Distribution/TestSuite.hs:78)
  901. 700.28 s [Cabal] Options (src/Distribution/TestSuite.hs:94)
  902. 700.28 s [Cabal] Progress (src/Distribution/TestSuite.hs:96)
  903. 700.28 s [Cabal] Result (src/Distribution/TestSuite.hs:100)
  904. 700.28 s [Cabal] Warning: 'AnnotatedId' is ambiguous. It is defined
  905. 700.28 s [Cabal] * at src/Distribution/Types/AnnotatedId.hs:19:23
  906. 700.28 s [Cabal] * at src/Distribution/Types/AnnotatedId.hs:19:1
  907. 700.28 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  908. 700.28 s [Cabal] by specifying the type/value namespace explicitly.
  909. 700.28 s [Cabal] Defaulting to the one defined at src/Distribution/Types/AnnotatedId.hs:19:1
  910. 700.28 s [Cabal] 50% ( 1 / 2) in 'Distribution.Types.AnnotatedId'
  911. 700.28 s [Cabal] Missing documentation for:
  912. 700.28 s [Cabal] Module header
  913. 700.28 s [Cabal] Warning: 'LinkedComponent' is out of scope.
  914. 700.28 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  915. 700.28 s [Cabal] Warning: 'pc_pkgid' is out of scope.
  916. 700.28 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  917. 700.28 s [Cabal] Warning: 'PreExistingComponent' is ambiguous. It is defined
  918. 700.28 s [Cabal] * at src/Distribution/Backpack/PreExistingComponent.hs:37:29
  919. 700.28 s [Cabal] * at src/Distribution/Backpack/PreExistingComponent.hs:37:1
  920. 700.28 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  921. 700.28 s [Cabal] by specifying the type/value namespace explicitly.
  922. 700.28 s [Cabal] Defaulting to the one defined at src/Distribution/Backpack/PreExistingComponent.hs:37:1
  923. 700.28 s [Cabal] Warning: 'CSubLibName' is out of scope.
  924. 700.28 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  925. 700.28 s [Cabal] 20% ( 1 / 5) in 'Distribution.Types.ComponentInclude'
  926. 700.28 s [Cabal] Missing documentation for:
  927. 700.28 s [Cabal] Module header
  928. 700.28 s [Cabal] ComponentInclude (src/Distribution/Types/ComponentInclude.hs:16)
  929. 700.28 s [Cabal] ci_id (src/Distribution/Types/ComponentInclude.hs:25)
  930. 700.28 s [Cabal] ci_pkgid (src/Distribution/Types/ComponentInclude.hs:28)
  931. 700.28 s [Cabal] Warning: 'ModuleRenaming' is ambiguous. It is defined
  932. 700.28 s [Cabal] * in ‘Distribution.Types.ModuleRenaming’
  933. 700.28 s [Cabal] * in ‘Distribution.Types.ModuleRenaming’
  934. 700.28 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  935. 700.28 s [Cabal] by specifying the type/value namespace explicitly.
  936. 700.28 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.ModuleRenaming’
  937. 700.28 s [Cabal] Warning: 'BuildInfo' is out of scope.
  938. 700.28 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  939. 700.28 s [Cabal] 25% ( 1 / 4) in 'Distribution.Types.ComponentLocalBuildInfo'
  940. 700.28 s [Cabal] Missing documentation for:
  941. 700.28 s [Cabal] Module header
  942. 700.28 s [Cabal] componentIsIndefinite (src/Distribution/Types/ComponentLocalBuildInfo.hs:122)
  943. 700.28 s [Cabal] maybeComponentInstantiatedWith (src/Distribution/Types/ComponentLocalBuildInfo.hs:126)
  944. 700.28 s [Cabal] 0% ( 0 / 2) in 'Distribution.Types.DumpBuildInfo'
  945. 700.28 s [Cabal] Missing documentation for:
  946. 700.28 s [Cabal] Module header
  947. 700.28 s [Cabal] DumpBuildInfo (src/Distribution/Types/DumpBuildInfo.hs:10)
  948. 700.28 s [Cabal] Warning: 'GivenComponent' is ambiguous. It is defined
  949. 700.28 s [Cabal] * at src/Distribution/Types/GivenComponent.hs:20:23
  950. 700.28 s [Cabal] * at src/Distribution/Types/GivenComponent.hs:20:1
  951. 700.28 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  952. 700.28 s [Cabal] by specifying the type/value namespace explicitly.
  953. 700.28 s [Cabal] Defaulting to the one defined at src/Distribution/Types/GivenComponent.hs:20:1
  954. 700.28 s [Cabal] 50% ( 1 / 2) in 'Distribution.Types.GivenComponent'
  955. 700.28 s [Cabal] Missing documentation for:
  956. 700.28 s [Cabal] Module header
  957. 700.28 s [Cabal] 100% ( 5 / 5) in 'Distribution.Types.PackageName.Magic'
  958. 700.28 s [Cabal] 80% ( 4 / 5) in 'Distribution.Types.ParStrat'
  959. 700.28 s [Cabal] Missing documentation for:
  960. 700.28 s [Cabal] Module header
  961. 700.29 s [Cabal] Warning: 'TargetInfo' is ambiguous. It is defined
  962. 700.29 s [Cabal] * at src/Distribution/Types/TargetInfo.hs:22:19
  963. 700.29 s [Cabal] * at src/Distribution/Types/TargetInfo.hs:22:1
  964. 700.29 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  965. 700.29 s [Cabal] by specifying the type/value namespace explicitly.
  966. 700.29 s [Cabal] Defaulting to the one defined at src/Distribution/Types/TargetInfo.hs:22:1
  967. 700.29 s [Cabal] Warning: 'LocalBuildInfo' is out of scope.
  968. 700.29 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  969. 700.29 s [Cabal] 50% ( 1 / 2) in 'Distribution.Types.TargetInfo'
  970. 700.29 s [Cabal] Missing documentation for:
  971. 700.29 s [Cabal] Module header
  972. 700.29 s [Cabal] 100% ( 8 / 8) in 'Distribution.Utils.IOData'
  973. 700.29 s [Cabal] Warning: 'ByteString' is out of scope.
  974. 700.29 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  975. 700.29 s [Cabal] 75% ( 3 / 4) in 'Distribution.Utils.Json'
  976. 700.29 s [Cabal] Missing documentation for:
  977. 700.29 s [Cabal] Json (src/Distribution/Utils/Json.hs:20)
  978. 700.29 s [Cabal] Warning: 'mapAccumL' is out of scope.
  979. 700.29 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  980. 700.29 s [Cabal] 50% ( 1 / 2) in 'Distribution.Utils.MapAccum'
  981. 700.29 s [Cabal] Missing documentation for:
  982. 700.29 s [Cabal] Module header
  983. 700.29 s [Cabal] 100% ( 5 / 5) in 'Distribution.Utils.Progress'
  984. 700.29 s [Cabal] Warning: 'Point' is ambiguous. It is defined
  985. 700.29 s [Cabal] * at src/Distribution/Utils/UnionFind.hs:23:21
  986. 700.29 s [Cabal] * at src/Distribution/Utils/UnionFind.hs:23:1
  987. 700.29 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  988. 700.29 s [Cabal] by specifying the type/value namespace explicitly.
  989. 700.29 s [Cabal] Defaulting to the one defined at src/Distribution/Utils/UnionFind.hs:23:1
  990. 700.29 s [Cabal] 0% ( 0 / 3) in 'Distribution.Verbosity.Internal'
  991. 700.29 s [Cabal] Missing documentation for:
  992. 700.29 s [Cabal] Module header
  993. 700.29 s [Cabal] VerbosityLevel (src/Distribution/Verbosity/Internal.hs:12)
  994. 700.29 s [Cabal] VerbosityFlag (src/Distribution/Verbosity/Internal.hs:18)
  995. 700.29 s [Cabal] Warning: 'Verbosity' is ambiguous. It is defined
  996. 700.29 s [Cabal] * at src/Distribution/Verbosity.hs:90:18
  997. 700.29 s [Cabal] * at src/Distribution/Verbosity.hs:90:1
  998. 700.29 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  999. 700.29 s [Cabal] by specifying the type/value namespace explicitly.
  1000. 700.29 s [Cabal] Defaulting to the one defined at src/Distribution/Verbosity.hs:90:1
  1001. 700.29 s [Cabal] Warning: 'stderr' is out of scope.
  1002. 700.29 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1003. 700.29 s [Cabal] Warning: 'stdout' is out of scope.
  1004. 700.29 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1005. 700.29 s [Cabal] 87% ( 35 / 40) in 'Distribution.Verbosity'
  1006. 700.29 s [Cabal] Missing documentation for:
  1007. 700.29 s [Cabal] Verbosity (src/Distribution/Verbosity.hs:90)
  1008. 700.29 s [Cabal] flagToVerbosity (src/Distribution/Verbosity.hs:241)
  1009. 700.29 s [Cabal] showForCabal (src/Distribution/Verbosity.hs:244)
  1010. 700.29 s [Cabal] showForGHC (src/Distribution/Verbosity.hs:267)
  1011. 700.29 s [Cabal] verboseHasFlags (src/Distribution/Verbosity.hs:335)
  1012. 700.29 s [Cabal] Warning: 'Program' is ambiguous. It is defined
  1013. 700.29 s [Cabal] * at src/Distribution/Simple/Program/Types.hs:50:16
  1014. 700.29 s [Cabal] * at src/Distribution/Simple/Program/Types.hs:50:1
  1015. 700.29 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1016. 700.29 s [Cabal] by specifying the type/value namespace explicitly.
  1017. 700.29 s [Cabal] Defaulting to the one defined at src/Distribution/Simple/Program/Types.hs:50:1
  1018. 700.29 s [Cabal] Warning: 'ConfiguredProgram' is ambiguous. It is defined
  1019. 700.29 s [Cabal] * at src/Distribution/Simple/Program/Types.hs:120:26
  1020. 700.29 s [Cabal] * at src/Distribution/Simple/Program/Types.hs:120:1
  1021. 700.29 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1022. 700.29 s [Cabal] by specifying the type/value namespace explicitly.
  1023. 700.29 s [Cabal] Defaulting to the one defined at src/Distribution/Simple/Program/Types.hs:120:1
  1024. 700.29 s [Cabal] Warning: 'findExecutable' is out of scope.
  1025. 700.29 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1026. 700.29 s [Cabal] Warning: 'simpleProgram' is out of scope.
  1027. 700.29 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1028. 700.29 s [Cabal] Warning: 'findProgramOnSearchPath' is out of scope.
  1029. 700.29 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1030. 700.30 s [Cabal] 83% ( 10 / 12) in 'Distribution.Simple.Program.Types'
  1031. 700.30 s [Cabal] Missing documentation for:
  1032. 700.30 s [Cabal] ProgramSearchPathEntry (src/Distribution/Simple/Program/Types.hs:105)
  1033. 700.30 s [Cabal] ProgArg (src/Distribution/Simple/Program/Types.hs:83)
  1034. 700.30 s [Cabal] Warning: 'PreProcessor' is ambiguous. It is defined
  1035. 700.30 s [Cabal] * at src/Distribution/Simple/PreProcess/Types.hs:69:21
  1036. 700.30 s [Cabal] * at src/Distribution/Simple/PreProcess/Types.hs:69:1
  1037. 700.30 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1038. 700.30 s [Cabal] by specifying the type/value namespace explicitly.
  1039. 700.30 s [Cabal] Defaulting to the one defined at src/Distribution/Simple/PreProcess/Types.hs:69:1
  1040. 700.30 s [Cabal] 60% ( 3 / 5) in 'Distribution.Simple.PreProcess.Types'
  1041. 700.30 s [Cabal] Missing documentation for:
  1042. 700.30 s [Cabal] builtinHaskellSuffixes (src/Distribution/Simple/PreProcess/Types.hs:111)
  1043. 700.30 s [Cabal] builtinHaskellBootSuffixes (src/Distribution/Simple/PreProcess/Types.hs:114)
  1044. 700.30 s [Cabal] 0% ( 0 / 5) in 'Distribution.Simple.Errors'
  1045. 700.30 s [Cabal] Missing documentation for:
  1046. 700.30 s [Cabal] Module header
  1047. 700.30 s [Cabal] CabalException (src/Distribution/Simple/Errors.hs:46)
  1048. 700.30 s [Cabal] FailedDependency (src/Distribution/Simple/Errors.hs:39)
  1049. 700.30 s [Cabal] exceptionCode (src/Distribution/Simple/Errors.hs:179)
  1050. 700.30 s [Cabal] exceptionMessage (src/Distribution/Simple/Errors.hs:315)
  1051. 700.30 s [Cabal] 100% ( 3 / 3) in 'Distribution.Simple.PreProcess.Unlit'
  1052. 700.30 s [Cabal] Warning: 'ModuleScope' is ambiguous. It is defined
  1053. 700.30 s [Cabal] * at src/Distribution/Backpack/ModuleScope.hs:69:20
  1054. 700.30 s [Cabal] * at src/Distribution/Backpack/ModuleScope.hs:69:1
  1055. 700.30 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1056. 700.30 s [Cabal] by specifying the type/value namespace explicitly.
  1057. 700.30 s [Cabal] Defaulting to the one defined at src/Distribution/Backpack/ModuleScope.hs:69:1
  1058. 700.30 s [Cabal] Warning: 'ModuleSubst' is out of scope.
  1059. 700.30 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1060. 700.30 s [Cabal] Warning: 'UnitIdU' is ambiguous. It is defined
  1061. 700.30 s [Cabal] * at src/Distribution/Backpack/UnifyM.hs:261:5
  1062. 700.30 s [Cabal] * at src/Distribution/Backpack/UnifyM.hs:268:1
  1063. 700.30 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1064. 700.30 s [Cabal] by specifying the type/value namespace explicitly.
  1065. 700.30 s [Cabal] Defaulting to the one defined at src/Distribution/Backpack/UnifyM.hs:268:1
  1066. 700.30 s [Cabal] Warning: 'Module' is ambiguous. It is defined
  1067. 700.30 s [Cabal] * in ‘Distribution.Types.Module’
  1068. 700.30 s [Cabal] * in ‘Distribution.Types.Module’
  1069. 700.30 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1070. 700.30 s [Cabal] by specifying the type/value namespace explicitly.
  1071. 700.30 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.Module’
  1072. 700.30 s [Cabal] Warning: 'ModuleU' is ambiguous. It is defined
  1073. 700.30 s [Cabal] * at src/Distribution/Backpack/UnifyM.hs:256:5
  1074. 700.30 s [Cabal] * at src/Distribution/Backpack/UnifyM.hs:265:1
  1075. 700.30 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1076. 700.30 s [Cabal] by specifying the type/value namespace explicitly.
  1077. 700.30 s [Cabal] Defaulting to the one defined at src/Distribution/Backpack/UnifyM.hs:265:1
  1078. 700.30 s [Cabal] Warning: 'UnifyM' is ambiguous. It is defined
  1079. 700.30 s [Cabal] * at src/Distribution/Backpack/UnifyM.hs:83:22
  1080. 700.30 s [Cabal] * at src/Distribution/Backpack/UnifyM.hs:83:1
  1081. 700.30 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1082. 700.30 s [Cabal] by specifying the type/value namespace explicitly.
  1083. 700.30 s [Cabal] Defaulting to the one defined at src/Distribution/Backpack/UnifyM.hs:83:1
  1084. 700.30 s [Cabal] Warning: 'ModuleShape' is ambiguous. It is defined
  1085. 700.30 s [Cabal] * at src/Distribution/Backpack/ModuleShape.hs:30:20
  1086. 700.30 s [Cabal] * at src/Distribution/Backpack/ModuleShape.hs:30:1
  1087. 700.30 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1088. 700.30 s [Cabal] by specifying the type/value namespace explicitly.
  1089. 700.30 s [Cabal] Defaulting to the one defined at src/Distribution/Backpack/ModuleShape.hs:30:1
  1090. 700.30 s [Cabal] Warning: 'die' is out of scope.
  1091. 700.30 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1092. 700.31 s [Cabal] Warning: 'rawSystem' is out of scope.
  1093. 700.31 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1094. 700.31 s [Cabal] Warning: 'action' is out of scope.
  1095. 700.31 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1096. 700.31 s [Cabal] Warning: 'CreatePipe' is out of scope.
  1097. 700.31 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1098. 700.31 s [Cabal] Warning: 'findModuleFile' is out of scope.
  1099. 700.31 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1100. 700.31 s [Cabal] Warning: 'createDirectoryIfMissing' is out of scope.
  1101. 700.31 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1102. 700.31 s [Cabal] Warning: 'TempFileOptions' is ambiguous. It is defined
  1103. 700.31 s [Cabal] * at src/Distribution/Simple/Utils.hs:1632:24
  1104. 700.31 s [Cabal] * at src/Distribution/Simple/Utils.hs:1632:1
  1105. 700.31 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1106. 700.31 s [Cabal] by specifying the type/value namespace explicitly.
  1107. 700.31 s [Cabal] Defaulting to the one defined at src/Distribution/Simple/Utils.hs:1632:1
  1108. 700.31 s [Cabal] Warning: 'ByteString' is out of scope.
  1109. 700.31 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1110. 700.31 s [Cabal] Warning: 'waitForProcess' is out of scope.
  1111. 700.31 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1112. 700.32 s [Cabal] 85% (122 /142) in 'Distribution.Simple.Utils'
  1113. 700.32 s [Cabal] Missing documentation for:
  1114. 700.32 s [Cabal] cabalVersion (src/Distribution/Simple/Utils.hs:285)
  1115. 700.32 s [Cabal] dieNoVerbosity (src/Distribution/Simple/Utils.hs:346)
  1116. 700.32 s [Cabal] die' (src/Distribution/Simple/Utils.hs:376)
  1117. 700.32 s [Cabal] dieWithException (src/Distribution/Simple/Utils.hs:389)
  1118. 700.32 s [Cabal] dieWithLocation' (src/Distribution/Simple/Utils.hs:365)
  1119. 700.32 s [Cabal] dieNoWrap (src/Distribution/Simple/Utils.hs:408)
  1120. 700.32 s [Cabal] topHandler (src/Distribution/Simple/Utils.hs:515)
  1121. 700.32 s [Cabal] topHandlerWith (src/Distribution/Simple/Utils.hs:464)
  1122. 700.32 s [Cabal] infoNoWrap (src/Distribution/Simple/Utils.hs:603)
  1123. 700.32 s [Cabal] VerboseException (src/Distribution/Simple/Utils.hs:384)
  1124. 700.32 s [Cabal] setFileOrdinary (src/Distribution/Compat/CopyFile.hs:77)
  1125. 700.32 s [Cabal] setFileExecutable (src/Distribution/Compat/CopyFile.hs:78)
  1126. 700.32 s [Cabal] shortRelativePath (src/Distribution/Simple/Utils.hs:1747)
  1127. 700.32 s [Cabal] findFirstFile (src/Distribution/Simple/Utils.hs:1301)
  1128. 700.32 s [Cabal] findAllFilesWithExtension (src/Distribution/Simple/Utils.hs:1277)
  1129. 700.32 s [Cabal] addLibraryPath (src/Distribution/Simple/Utils.hs:1397)
  1130. 700.32 s [Cabal] defaultTempFileOptions (src/Distribution/Simple/Utils.hs:1638)
  1131. 700.32 s [Cabal] createTempDirectory (src/Distribution/Compat/Internal/TempFile.hs:124)
  1132. 700.32 s [Cabal] equating
  1133. 700.32 s [Cabal] unintersperse
  1134. 700.32 s [Cabal] Warning: 'NubList' is ambiguous. It is defined
  1135. 700.32 s [Cabal] * at src/Distribution/Utils/NubList.hs:24:21
  1136. 700.32 s [Cabal] * at src/Distribution/Utils/NubList.hs:24:1
  1137. 700.32 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1138. 700.32 s [Cabal] by specifying the type/value namespace explicitly.
  1139. 700.32 s [Cabal] Defaulting to the one defined at src/Distribution/Utils/NubList.hs:24:1
  1140. 700.32 s [Cabal] 66% ( 6 / 9) in 'Distribution.Utils.NubList'
  1141. 700.32 s [Cabal] Missing documentation for:
  1142. 700.32 s [Cabal] Module header
  1143. 700.32 s [Cabal] fromNubList
  1144. 700.32 s [Cabal] fromNubListR
  1145. 700.32 s [Cabal] Warning: 'LogProgress' is ambiguous. It is defined
  1146. 700.32 s [Cabal] * at src/Distribution/Utils/LogProgress.hs:33:25
  1147. 700.32 s [Cabal] * at src/Distribution/Utils/LogProgress.hs:33:1
  1148. 700.32 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1149. 700.32 s [Cabal] by specifying the type/value namespace explicitly.
  1150. 700.32 s [Cabal] Defaulting to the one defined at src/Distribution/Utils/LogProgress.hs:33:1
  1151. 700.32 s [Cabal] Warning: 'die' is out of scope.
  1152. 700.32 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1153. 700.32 s [Cabal] 85% ( 6 / 7) in 'Distribution.Utils.LogProgress'
  1154. 700.32 s [Cabal] Missing documentation for:
  1155. 700.32 s [Cabal] Module header
  1156. 700.32 s [Cabal] 30% ( 4 / 13) in 'Distribution.Simple.Program.Run'
  1157. 700.32 s [Cabal] Missing documentation for:
  1158. 700.32 s [Cabal] IOEncoding (src/Distribution/Simple/Program/Run.hs:61)
  1159. 700.32 s [Cabal] emptyProgramInvocation (src/Distribution/Simple/Program/Run.hs:71)
  1160. 700.32 s [Cabal] simpleProgramInvocation (src/Distribution/Simple/Program/Run.hs:83)
  1161. 700.32 s [Cabal] programInvocation (src/Distribution/Simple/Program/Run.hs:90)
  1162. 700.32 s [Cabal] runProgramInvocation (src/Distribution/Simple/Program/Run.hs:101)
  1163. 700.32 s [Cabal] getProgramInvocationOutput (src/Distribution/Simple/Program/Run.hs:158)
  1164. 700.32 s [Cabal] getProgramInvocationLBS (src/Distribution/Simple/Program/Run.hs:166)
  1165. 700.32 s [Cabal] getProgramInvocationOutputAndErrors (src/Distribution/Simple/Program/Run.hs:177)
  1166. 700.32 s [Cabal] getProgramInvocationLBSAndErrors (src/Distribution/Simple/Program/Run.hs:189)
  1167. 700.32 s [Cabal] 100% ( 4 / 4) in 'Distribution.Simple.Program.Script'
  1168. 700.32 s [Cabal] 50% ( 1 / 2) in 'Distribution.Simple.Program.ResponseFile'
  1169. 700.32 s [Cabal] Missing documentation for:
  1170. 700.32 s [Cabal] withResponseFile (src/Distribution/Simple/Program/ResponseFile.hs:37)
  1171. 700.32 s [Cabal] 66% ( 2 / 3) in 'Distribution.Simple.Program.Hpc'
  1172. 700.32 s [Cabal] Missing documentation for:
  1173. 700.32 s [Cabal] union (src/Distribution/Simple/Program/Hpc.hs:115)
  1174. 700.32 s [Cabal] 63% ( 7 / 11) in 'Distribution.Simple.Program.Find'
  1175. 700.32 s [Cabal] Missing documentation for:
  1176. 700.32 s [Cabal] ProgramSearchPathEntry (src/Distribution/Simple/Program/Types.hs:105)
  1177. 700.32 s [Cabal] defaultProgramSearchPath (src/Distribution/Simple/Program/Find.hs:66)
  1178. 700.32 s [Cabal] findProgramOnSearchPath (src/Distribution/Simple/Program/Find.hs:82)
  1179. 700.32 s [Cabal] logExtraProgramSearchPath (src/Distribution/Simple/Program/Find.hs:72)
  1180. 700.32 s [Cabal] Warning: 'UnitIndex' is out of scope.
  1181. 700.32 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1182. 700.32 s [Cabal] Warning: 'PackageIndex' is ambiguous. It is defined
  1183. 700.32 s [Cabal] * at src/Distribution/Simple/PackageIndex.hs:127:23
  1184. 700.32 s [Cabal] * at src/Distribution/Simple/PackageIndex.hs:127:1
  1185. 700.32 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1186. 700.32 s [Cabal] by specifying the type/value namespace explicitly.
  1187. 700.32 s [Cabal] Defaulting to the one defined at src/Distribution/Simple/PackageIndex.hs:127:1
  1188. 700.32 s [Cabal] Warning: 'InstalledPackageInfo' is out of scope.
  1189. 700.32 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1190. 700.32 s [Cabal] Warning: 'Cabal' is out of scope.
  1191. 700.32 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1192. 700.32 s [Cabal] Warning: 'PackageDB' is out of scope.
  1193. 700.32 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1194. 700.33 s [Cabal] 92% ( 38 / 41) in 'Distribution.Simple.PackageIndex'
  1195. 700.33 s [Cabal] Missing documentation for:
  1196. 700.33 s [Cabal] SearchResult (src/Distribution/Simple/PackageIndex.hs:559)
  1197. 700.33 s [Cabal] topologicalOrder (src/Distribution/Simple/PackageIndex.hs:667)
  1198. 700.33 s [Cabal] reverseTopologicalOrder (src/Distribution/Simple/PackageIndex.hs:675)
  1199. 700.33 s [Cabal] 50% ( 3 / 6) in 'Distribution.Simple.PackageDescription'
  1200. 700.33 s [Cabal] Missing documentation for:
  1201. 700.33 s [Cabal] readGenericPackageDescription (src/Distribution/Simple/PackageDescription.hs:45)
  1202. 700.33 s [Cabal] readHookedBuildInfo (src/Distribution/Simple/PackageDescription.hs:48)
  1203. 700.33 s [Cabal] parseString (src/Distribution/Simple/PackageDescription.hs:81)
  1204. 700.33 s [Cabal] Warning: 'matchDirFileGlob' is out of scope.
  1205. 700.33 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1206. 700.33 s [Cabal] Warning: 'Version' is out of scope.
  1207. 700.33 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1208. 700.33 s [Cabal] 68% ( 15 / 22) in 'Distribution.Simple.Glob.Internal'
  1209. 700.33 s [Cabal] Missing documentation for:
  1210. 700.33 s [Cabal] parseFileGlob (src/Distribution/Simple/Glob/Internal.hs:138)
  1211. 700.33 s [Cabal] enableMultidot (src/Distribution/Simple/Glob/Internal.hs:178)
  1212. 700.33 s [Cabal] dispGlobPieces (src/Distribution/Simple/Glob/Internal.hs:234)
  1213. 700.33 s [Cabal] isGlobEscapedChar (src/Distribution/Simple/Glob/Internal.hs:252)
  1214. 700.33 s [Cabal] GlobSyntaxError (src/Distribution/Simple/Glob/Internal.hs:260)
  1215. 700.33 s [Cabal] explainGlobSyntaxError (src/Distribution/Simple/Glob/Internal.hs:272)
  1216. 700.33 s [Cabal] GlobResult (src/Distribution/Simple/Glob/Internal.hs:318)
  1217. 700.33 s [Cabal] Warning: 'die'' is out of scope.
  1218. 700.33 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1219. 700.33 s [Cabal] Warning: 'Version' is out of scope.
  1220. 700.33 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1221. 700.33 s [Cabal] Warning: 'die' is out of scope.
  1222. 700.33 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1223. 700.33 s [Cabal] 75% ( 12 / 16) in 'Distribution.Simple.Glob'
  1224. 700.33 s [Cabal] Missing documentation for:
  1225. 700.33 s [Cabal] GlobResult (src/Distribution/Simple/Glob/Internal.hs:318)
  1226. 700.33 s [Cabal] parseFileGlob (src/Distribution/Simple/Glob/Internal.hs:138)
  1227. 700.33 s [Cabal] GlobSyntaxError (src/Distribution/Simple/Glob/Internal.hs:260)
  1228. 700.33 s [Cabal] explainGlobSyntaxError (src/Distribution/Simple/Glob/Internal.hs:272)
  1229. 700.33 s [Cabal] Warning: 'm' is out of scope.
  1230. 700.33 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1231. 700.33 s [Cabal] Warning: 'TargetAnnotation' is ambiguous. It is defined
  1232. 700.33 s [Cabal] * at src/Distribution/PackageDescription/Check/Monad.hs:160:27
  1233. 700.33 s [Cabal] * at src/Distribution/PackageDescription/Check/Monad.hs:160:1
  1234. 700.33 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1235. 700.33 s [Cabal] by specifying the type/value namespace explicitly.
  1236. 700.33 s [Cabal] Defaulting to the one defined at src/Distribution/PackageDescription/Check/Monad.hs:160:1
  1237. 700.33 s [Cabal] Warning: 'CheckPackageContentOps' is ambiguous. It is defined
  1238. 700.33 s [Cabal] * at src/Distribution/PackageDescription/Check/Monad.hs:92:33
  1239. 700.33 s [Cabal] * at src/Distribution/PackageDescription/Check/Monad.hs:92:1
  1240. 700.33 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1241. 700.33 s [Cabal] by specifying the type/value namespace explicitly.
  1242. 700.33 s [Cabal] Defaulting to the one defined at src/Distribution/PackageDescription/Check/Monad.hs:92:1
  1243. 700.33 s [Cabal] Warning: 'CheckCtx' is ambiguous. It is defined
  1244. 700.33 s [Cabal] * at src/Distribution/PackageDescription/Check/Monad.hs:109:19
  1245. 700.33 s [Cabal] * at src/Distribution/PackageDescription/Check/Monad.hs:109:1
  1246. 700.33 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1247. 700.33 s [Cabal] by specifying the type/value namespace explicitly.
  1248. 700.33 s [Cabal] Defaulting to the one defined at src/Distribution/PackageDescription/Check/Monad.hs:109:1
  1249. 700.34 s [Cabal] Warning: 'local' is out of scope.
  1250. 700.34 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1251. 700.34 s [Cabal] Warning: 'ask' is out of scope.
  1252. 700.34 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1253. 700.34 s [Cabal] Warning: 'TaraAnn' is out of scope.
  1254. 700.34 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1255. 700.34 s [Cabal] Warning: 'LocalBuildInfo' is out of scope.
  1256. 700.34 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1257. 700.34 s [Cabal] 68% ( 33 / 48) in 'Distribution.Simple.Compiler'
  1258. 700.34 s [Cabal] Missing documentation for:
  1259. 700.34 s [Cabal] Compiler (src/Distribution/Simple/Compiler.hs:91)
  1260. 700.34 s [Cabal] showCompilerId (src/Distribution/Simple/Compiler.hs:113)
  1261. 700.34 s [Cabal] showCompilerIdWithAbi (src/Distribution/Simple/Compiler.hs:116)
  1262. 700.34 s [Cabal] compilerFlavor (src/Distribution/Simple/Compiler.hs:123)
  1263. 700.34 s [Cabal] compilerVersion (src/Distribution/Simple/Compiler.hs:126)
  1264. 700.34 s [Cabal] compilerInfo (src/Distribution/Simple/Compiler.hs:155)
  1265. 700.34 s [Cabal] absolutePackageDBPath (src/Distribution/Simple/Compiler.hs:213)
  1266. 700.34 s [Cabal] flagToOptimisationLevel (src/Distribution/Simple/Compiler.hs:237)
  1267. 700.34 s [Cabal] flagToDebugInfoLevel (src/Distribution/Simple/Compiler.hs:270)
  1268. 700.34 s [Cabal] CompilerFlag (src/Distribution/Simple/Compiler.hs:310)
  1269. 700.34 s [Cabal] languageToFlags (src/Distribution/Simple/Compiler.hs:295)
  1270. 700.34 s [Cabal] unsupportedLanguages (src/Distribution/Simple/Compiler.hs:290)
  1271. 700.34 s [Cabal] knownProfDetailLevels (src/Distribution/Simple/Compiler.hs:476)
  1272. 700.34 s [Cabal] flagToProfDetailLevel (src/Distribution/Simple/Compiler.hs:464)
  1273. 700.34 s [Cabal] showProfDetailLevel (src/Distribution/Simple/Compiler.hs:486)
  1274. 700.34 s [Cabal] 65% ( 17 / 26) in 'Distribution.Simple.Program.HcPkg'
  1275. 700.34 s [Cabal] Missing documentation for:
  1276. 700.34 s [Cabal] initInvocation (src/Distribution/Simple/Program/HcPkg.hs:387)
  1277. 700.34 s [Cabal] registerInvocation (src/Distribution/Simple/Program/HcPkg.hs:401)
  1278. 700.34 s [Cabal] unregisterInvocation (src/Distribution/Simple/Program/HcPkg.hs:429)
  1279. 700.34 s [Cabal] recacheInvocation (src/Distribution/Simple/Program/HcPkg.hs:439)
  1280. 700.34 s [Cabal] exposeInvocation (src/Distribution/Simple/Program/HcPkg.hs:450)
  1281. 700.34 s [Cabal] hideInvocation (src/Distribution/Simple/Program/HcPkg.hs:473)
  1282. 700.34 s [Cabal] dumpInvocation (src/Distribution/Simple/Program/HcPkg.hs:479)
  1283. 700.34 s [Cabal] describeInvocation (src/Distribution/Simple/Program/HcPkg.hs:461)
  1284. 700.34 s [Cabal] listInvocation (src/Distribution/Simple/Program/HcPkg.hs:492)
  1285. 700.35 s [Cabal] Warning: 'OpenModule' is ambiguous. It is defined
  1286. 700.35 s [Cabal] * in ‘Distribution.Backpack’
  1287. 700.35 s [Cabal] * in ‘Distribution.Backpack’
  1288. 700.35 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1289. 700.35 s [Cabal] by specifying the type/value namespace explicitly.
  1290. 700.35 s [Cabal] Defaulting to the one defined in ‘Distribution.Backpack’
  1291. 700.35 s [Cabal] 18% ( 2 / 11) in 'Distribution.Simple.Program.GHC'
  1292. 700.35 s [Cabal] Missing documentation for:
  1293. 700.35 s [Cabal] Module header
  1294. 700.35 s [Cabal] GhcMode (src/Distribution/Simple/Program/GHC.hs:585)
  1295. 700.35 s [Cabal] GhcOptimisation (src/Distribution/Simple/Program/GHC.hs:600)
  1296. 700.35 s [Cabal] GhcDynLinkMode (src/Distribution/Simple/Program/GHC.hs:611)
  1297. 700.35 s [Cabal] GhcProfAuto (src/Distribution/Simple/Program/GHC.hs:620)
  1298. 700.35 s [Cabal] ghcInvocation (src/Distribution/Simple/Program/GHC.hs:648)
  1299. 700.35 s [Cabal] renderGhcOptions (src/Distribution/Simple/Program/GHC.hs:659)
  1300. 700.35 s [Cabal] runGHC (src/Distribution/Simple/Program/GHC.hs:638)
  1301. 700.35 s [Cabal] normaliseGhcArgs (src/Distribution/Simple/Program/GHC.hs:49)
  1302. 700.35 s [Cabal] Warning: 'Program' is ambiguous. It is defined
  1303. 700.35 s [Cabal] * at src/Distribution/Simple/Program/Types.hs:50:16
  1304. 700.35 s [Cabal] * at src/Distribution/Simple/Program/Types.hs:50:1
  1305. 700.35 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1306. 700.35 s [Cabal] by specifying the type/value namespace explicitly.
  1307. 700.35 s [Cabal] Defaulting to the one defined at src/Distribution/Simple/Program/Types.hs:50:1
  1308. 700.35 s [Cabal] 12% ( 4 / 31) in 'Distribution.Simple.Program.Builtin'
  1309. 700.35 s [Cabal] Missing documentation for:
  1310. 700.35 s [Cabal] ghcProgram (src/Distribution/Simple/Program/Builtin.hs:104)
  1311. 700.35 s [Cabal] ghcPkgProgram (src/Distribution/Simple/Program/Builtin.hs:145)
  1312. 700.35 s [Cabal] runghcProgram (src/Distribution/Simple/Program/Builtin.hs:135)
  1313. 700.35 s [Cabal] ghcjsProgram (src/Distribution/Simple/Program/Builtin.hs:156)
  1314. 700.35 s [Cabal] ghcjsPkgProgram (src/Distribution/Simple/Program/Builtin.hs:163)
  1315. 700.35 s [Cabal] hmakeProgram (src/Distribution/Simple/Program/Builtin.hs:174)
  1316. 700.35 s [Cabal] jhcProgram (src/Distribution/Simple/Program/Builtin.hs:185)
  1317. 700.35 s [Cabal] haskellSuiteProgram (src/Distribution/Simple/Program/Builtin.hs:228)
  1318. 700.35 s [Cabal] haskellSuitePkgProgram (src/Distribution/Simple/Program/Builtin.hs:239)
  1319. 700.35 s [Cabal] uhcProgram (src/Distribution/Simple/Program/Builtin.hs:197)
  1320. 700.35 s [Cabal] gccProgram (src/Distribution/Simple/Program/Builtin.hs:268)
  1321. 700.35 s [Cabal] arProgram (src/Distribution/Simple/Program/Builtin.hs:274)
  1322. 700.35 s [Cabal] stripProgram (src/Distribution/Simple/Program/Builtin.hs:277)
  1323. 700.35 s [Cabal] happyProgram (src/Distribution/Simple/Program/Builtin.hs:246)
  1324. 700.35 s [Cabal] alexProgram (src/Distribution/Simple/Program/Builtin.hs:257)
  1325. 700.35 s [Cabal] hsc2hsProgram (src/Distribution/Simple/Program/Builtin.hs:284)
  1326. 700.35 s [Cabal] c2hsProgram (src/Distribution/Simple/Program/Builtin.hs:295)
  1327. 700.35 s [Cabal] cpphsProgram (src/Distribution/Simple/Program/Builtin.hs:301)
  1328. 700.35 s [Cabal] hscolourProgram (src/Distribution/Simple/Program/Builtin.hs:311)
  1329. 700.35 s [Cabal] doctestProgram (src/Distribution/Simple/Program/Builtin.hs:324)
  1330. 700.35 s [Cabal] haddockProgram (src/Distribution/Simple/Program/Builtin.hs:335)
  1331. 700.35 s [Cabal] greencardProgram (src/Distribution/Simple/Program/Builtin.hs:347)
  1332. 700.35 s [Cabal] ldProgram (src/Distribution/Simple/Program/Builtin.hs:350)
  1333. 700.35 s [Cabal] tarProgram (src/Distribution/Simple/Program/Builtin.hs:391)
  1334. 700.35 s [Cabal] cppProgram (src/Distribution/Simple/Program/Builtin.hs:409)
  1335. 700.35 s [Cabal] pkgConfigProgram (src/Distribution/Simple/Program/Builtin.hs:412)
  1336. 700.35 s [Cabal] hpcProgram (src/Distribution/Simple/Program/Builtin.hs:203)
  1337. 700.35 s [Cabal] Warning: 'ProgramDb' is ambiguous. It is defined
  1338. 700.35 s [Cabal] * at src/Distribution/Simple/Program/Db.hs:95:18
  1339. 700.35 s [Cabal] * at src/Distribution/Simple/Program/Db.hs:95:1
  1340. 700.35 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1341. 700.35 s [Cabal] by specifying the type/value namespace explicitly.
  1342. 700.35 s [Cabal] Defaulting to the one defined at src/Distribution/Simple/Program/Db.hs:95:1
  1343. 700.35 s [Cabal] Warning: 'Program' is ambiguous. It is defined
  1344. 700.35 s [Cabal] * at src/Distribution/Simple/Program/Types.hs:50:16
  1345. 700.35 s [Cabal] * at src/Distribution/Simple/Program/Types.hs:50:1
  1346. 700.35 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1347. 700.35 s [Cabal] by specifying the type/value namespace explicitly.
  1348. 700.35 s [Cabal] Defaulting to the one defined at src/Distribution/Simple/Program/Types.hs:50:1
  1349. 700.35 s [Cabal] Warning: 'Programs' is out of scope.
  1350. 700.35 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1351. 700.35 s [Cabal] Warning: 'AnyVersion' is out of scope.
  1352. 700.35 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1353. 700.36 s [Cabal] 82% ( 28 / 34) in 'Distribution.Simple.Program.Db'
  1354. 700.36 s [Cabal] Missing documentation for:
  1355. 700.36 s [Cabal] emptyProgramDb (src/Distribution/Simple/Program/Db.hs:107)
  1356. 700.36 s [Cabal] defaultProgramDb (src/Distribution/Simple/Program/Db.hs:110)
  1357. 700.36 s [Cabal] addKnownPrograms (src/Distribution/Simple/Program/Db.hs:190)
  1358. 700.36 s [Cabal] lookupKnownProgram (src/Distribution/Simple/Program/Db.hs:193)
  1359. 700.36 s [Cabal] knownPrograms (src/Distribution/Simple/Program/Db.hs:197)
  1360. 700.36 s [Cabal] userMaybeSpecifyPath (src/Distribution/Simple/Program/Db.hs:259)
  1361. 700.36 s [Cabal] Warning: 'Program' is ambiguous. It is defined
  1362. 700.36 s [Cabal] * at src/Distribution/Simple/Program/Types.hs:50:16
  1363. 700.36 s [Cabal] * at src/Distribution/Simple/Program/Types.hs:50:1
  1364. 700.36 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1365. 700.36 s [Cabal] by specifying the type/value namespace explicitly.
  1366. 700.36 s [Cabal] Defaulting to the one defined at src/Distribution/Simple/Program/Types.hs:50:1
  1367. 700.36 s [Cabal] Warning: 'ConfiguredProgram' is ambiguous. It is defined
  1368. 700.36 s [Cabal] * at src/Distribution/Simple/Program/Types.hs:120:26
  1369. 700.36 s [Cabal] * at src/Distribution/Simple/Program/Types.hs:120:1
  1370. 700.36 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1371. 700.36 s [Cabal] by specifying the type/value namespace explicitly.
  1372. 700.36 s [Cabal] Defaulting to the one defined at src/Distribution/Simple/Program/Types.hs:120:1
  1373. 700.36 s [Cabal] 50% ( 40 / 80) in 'Distribution.Simple.Program'
  1374. 700.36 s [Cabal] Missing documentation for:
  1375. 700.36 s [Cabal] ProgramSearchPathEntry (src/Distribution/Simple/Program/Types.hs:105)
  1376. 700.36 s [Cabal] findProgramOnSearchPath (src/Distribution/Simple/Program/Find.hs:82)
  1377. 700.36 s [Cabal] defaultProgramSearchPath (src/Distribution/Simple/Program/Find.hs:66)
  1378. 700.36 s [Cabal] ProgArg (src/Distribution/Simple/Program/Types.hs:83)
  1379. 700.36 s [Cabal] emptyProgramInvocation (src/Distribution/Simple/Program/Run.hs:71)
  1380. 700.36 s [Cabal] simpleProgramInvocation (src/Distribution/Simple/Program/Run.hs:83)
  1381. 700.36 s [Cabal] programInvocation (src/Distribution/Simple/Program/Run.hs:90)
  1382. 700.36 s [Cabal] runProgramInvocation (src/Distribution/Simple/Program/Run.hs:101)
  1383. 700.36 s [Cabal] getProgramInvocationOutput (src/Distribution/Simple/Program/Run.hs:158)
  1384. 700.36 s [Cabal] getProgramInvocationLBS (src/Distribution/Simple/Program/Run.hs:166)
  1385. 700.36 s [Cabal] defaultProgramDb (src/Distribution/Simple/Program/Db.hs:110)
  1386. 700.36 s [Cabal] emptyProgramDb (src/Distribution/Simple/Program/Db.hs:107)
  1387. 700.36 s [Cabal] addKnownPrograms (src/Distribution/Simple/Program/Db.hs:190)
  1388. 700.36 s [Cabal] lookupKnownProgram (src/Distribution/Simple/Program/Db.hs:193)
  1389. 700.36 s [Cabal] knownPrograms (src/Distribution/Simple/Program/Db.hs:197)
  1390. 700.36 s [Cabal] userMaybeSpecifyPath (src/Distribution/Simple/Program/Db.hs:259)
  1391. 700.36 s [Cabal] ghcProgram (src/Distribution/Simple/Program/Builtin.hs:104)
  1392. 700.36 s [Cabal] ghcPkgProgram (src/Distribution/Simple/Program/Builtin.hs:145)
  1393. 700.36 s [Cabal] ghcjsProgram (src/Distribution/Simple/Program/Builtin.hs:156)
  1394. 700.36 s [Cabal] ghcjsPkgProgram (src/Distribution/Simple/Program/Builtin.hs:163)
  1395. 700.36 s [Cabal] hmakeProgram (src/Distribution/Simple/Program/Builtin.hs:174)
  1396. 700.36 s [Cabal] jhcProgram (src/Distribution/Simple/Program/Builtin.hs:185)
  1397. 700.36 s [Cabal] uhcProgram (src/Distribution/Simple/Program/Builtin.hs:197)
  1398. 700.36 s [Cabal] gccProgram (src/Distribution/Simple/Program/Builtin.hs:268)
  1399. 700.36 s [Cabal] arProgram (src/Distribution/Simple/Program/Builtin.hs:274)
  1400. 700.36 s [Cabal] stripProgram (src/Distribution/Simple/Program/Builtin.hs:277)
  1401. 700.36 s [Cabal] happyProgram (src/Distribution/Simple/Program/Builtin.hs:246)
  1402. 700.36 s [Cabal] alexProgram (src/Distribution/Simple/Program/Builtin.hs:257)
  1403. 700.36 s [Cabal] hsc2hsProgram (src/Distribution/Simple/Program/Builtin.hs:284)
  1404. 700.36 s [Cabal] c2hsProgram (src/Distribution/Simple/Program/Builtin.hs:295)
  1405. 700.36 s [Cabal] cpphsProgram (src/Distribution/Simple/Program/Builtin.hs:301)
  1406. 700.36 s [Cabal] hscolourProgram (src/Distribution/Simple/Program/Builtin.hs:311)
  1407. 700.36 s [Cabal] doctestProgram (src/Distribution/Simple/Program/Builtin.hs:324)
  1408. 700.36 s [Cabal] haddockProgram (src/Distribution/Simple/Program/Builtin.hs:335)
  1409. 700.36 s [Cabal] greencardProgram (src/Distribution/Simple/Program/Builtin.hs:347)
  1410. 700.36 s [Cabal] ldProgram (src/Distribution/Simple/Program/Builtin.hs:350)
  1411. 700.36 s [Cabal] tarProgram (src/Distribution/Simple/Program/Builtin.hs:391)
  1412. 700.36 s [Cabal] cppProgram (src/Distribution/Simple/Program/Builtin.hs:409)
  1413. 700.36 s [Cabal] pkgConfigProgram (src/Distribution/Simple/Program/Builtin.hs:412)
  1414. 700.36 s [Cabal] hpcProgram (src/Distribution/Simple/Program/Builtin.hs:203)
  1415. 700.36 s [Cabal] 33% ( 1 / 3) in 'Distribution.Simple.Program.Strip'
  1416. 700.36 s [Cabal] Missing documentation for:
  1417. 700.36 s [Cabal] stripLib (src/Distribution/Simple/Program/Strip.hs:52)
  1418. 700.36 s [Cabal] stripExe (src/Distribution/Simple/Program/Strip.hs:41)
  1419. 700.36 s [Cabal] Warning: 'CommandUI' is ambiguous. It is defined
  1420. 700.36 s [Cabal] * at src/Distribution/Simple/Command.hs:97:24
  1421. 700.36 s [Cabal] * at src/Distribution/Simple/Command.hs:97:1
  1422. 700.36 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1423. 700.36 s [Cabal] by specifying the type/value namespace explicitly.
  1424. 700.36 s [Cabal] Defaulting to the one defined at src/Distribution/Simple/Command.hs:97:1
  1425. 700.36 s [Cabal] Warning: 'GetOpt' is out of scope.
  1426. 700.36 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1427. 700.36 s [Cabal] Warning: 'smart' is out of scope.
  1428. 700.36 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1429. 700.36 s [Cabal] 61% ( 33 / 54) in 'Distribution.Simple.Command'
  1430. 700.36 s [Cabal] Missing documentation for:
  1431. 700.36 s [Cabal] CommandUI (src/Distribution/Simple/Command.hs:97)
  1432. 700.36 s [Cabal] CommandParse (src/Distribution/Simple/Command.hs:596)
  1433. 700.36 s [Cabal] helpCommandUI (src/Distribution/Simple/Command.hs:764)
  1434. 700.36 s [Cabal] ShowOrParseArgs (src/Distribution/Simple/Command.hs:116)
  1435. 700.36 s [Cabal] Command (src/Distribution/Simple/Command.hs:608)
  1436. 700.36 s [Cabal] commandAddAction (src/Distribution/Simple/Command.hs:621)
  1437. 700.36 s [Cabal] CommandType (src/Distribution/Simple/Command.hs:607)
  1438. 700.36 s [Cabal] commandFromSpec (src/Distribution/Simple/Command.hs:788)
  1439. 700.36 s [Cabal] commandsRun (src/Distribution/Simple/Command.hs:659)
  1440. 700.36 s [Cabal] commandsRunWithFallback (src/Distribution/Simple/Command.hs:675)
  1441. 700.36 s [Cabal] defaultCommandFallback (src/Distribution/Simple/Command.hs:667)
  1442. 700.36 s [Cabal] Name (src/Distribution/Simple/Command.hs:117)
  1443. 700.36 s [Cabal] liftOption (src/Distribution/Simple/Command.hs:374)
  1444. 700.36 s [Cabal] Description (src/Distribution/Simple/Command.hs:118)
  1445. 700.36 s [Cabal] OptFlags (src/Distribution/Simple/Command.hs:160)
  1446. 700.36 s [Cabal] ArgPlaceHolder (src/Distribution/Simple/Command.hs:161)
  1447. 700.36 s [Cabal] MkOptDescr (src/Distribution/Simple/Command.hs:200)
  1448. 700.36 s [Cabal] optArgDef' (src/Distribution/Simple/Command.hs:275)
  1449. 700.36 s [Cabal] noArg (src/Distribution/Simple/Command.hs:279)
  1450. 700.36 s [Cabal] boolOpt (src/Distribution/Simple/Command.hs:287)
  1451. 700.36 s [Cabal] boolOpt' (src/Distribution/Simple/Command.hs:299)
  1452. 700.36 s [Cabal] Warning: 'progDb' is out of scope.
  1453. 700.36 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1454. 700.36 s [Cabal] Warning: 'OptionField' is ambiguous. It is defined
  1455. 700.36 s [Cabal] * at src/Distribution/Simple/Command.hs:125:22
  1456. 700.36 s [Cabal] * at src/Distribution/Simple/Command.hs:125:1
  1457. 700.36 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1458. 700.36 s [Cabal] by specifying the type/value namespace explicitly.
  1459. 700.36 s [Cabal] Defaulting to the one defined at src/Distribution/Simple/Command.hs:125:1
  1460. 700.36 s [Cabal] Warning: 'haddocksInterfaces' is out of scope.
  1461. 700.36 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1462. 700.36 s [Cabal] Warning: 'haddocksAction' is out of scope.
  1463. 700.36 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1464. 700.37 s [Cabal] Warning: 'BuildOptions' is ambiguous. It is defined
  1465. 700.37 s [Cabal] * at src/Distribution/Types/LocalBuildConfig.hs:148:21
  1466. 700.37 s [Cabal] * at src/Distribution/Types/LocalBuildConfig.hs:148:1
  1467. 700.37 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1468. 700.37 s [Cabal] by specifying the type/value namespace explicitly.
  1469. 700.37 s [Cabal] Defaulting to the one defined at src/Distribution/Types/LocalBuildConfig.hs:148:1
  1470. 700.37 s [Cabal] Warning: 'LocalBuildConfig' is ambiguous. It is defined
  1471. 700.37 s [Cabal] * at src/Distribution/Types/LocalBuildConfig.hs:134:25
  1472. 700.37 s [Cabal] * at src/Distribution/Types/LocalBuildConfig.hs:134:1
  1473. 700.37 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1474. 700.37 s [Cabal] by specifying the type/value namespace explicitly.
  1475. 700.37 s [Cabal] Defaulting to the one defined at src/Distribution/Types/LocalBuildConfig.hs:134:1
  1476. 700.37 s [Cabal] Warning: 'InstalledPackageInfo' is out of scope.
  1477. 700.37 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1478. 700.37 s [Cabal] Warning: 'PackageBuildDescr' is ambiguous. It is defined
  1479. 700.37 s [Cabal] * at src/Distribution/Types/LocalBuildConfig.hs:48:26
  1480. 700.37 s [Cabal] * at src/Distribution/Types/LocalBuildConfig.hs:48:1
  1481. 700.37 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1482. 700.37 s [Cabal] by specifying the type/value namespace explicitly.
  1483. 700.37 s [Cabal] Defaulting to the one defined at src/Distribution/Types/LocalBuildConfig.hs:48:1
  1484. 700.37 s [Cabal] 77% ( 7 / 9) in 'Distribution.Types.LocalBuildConfig'
  1485. 700.37 s [Cabal] Missing documentation for:
  1486. 700.37 s [Cabal] Module header
  1487. 700.37 s [Cabal] buildOptionsConfigFlags (src/Distribution/Types/LocalBuildConfig.hs:202)
  1488. 700.37 s [Cabal] Warning: 'LocalBuildInfo' is ambiguous. It is defined
  1489. 700.37 s [Cabal] * at src/Distribution/Types/LocalBuildInfo.hs:180:1
  1490. 700.37 s [Cabal] * at src/Distribution/Types/LocalBuildInfo.hs:129:1
  1491. 700.37 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1492. 700.37 s [Cabal] by specifying the type/value namespace explicitly.
  1493. 700.37 s [Cabal] Defaulting to the one defined at src/Distribution/Types/LocalBuildInfo.hs:129:1
  1494. 700.37 s [Cabal] Warning: 'LocalBuildDescr' is out of scope.
  1495. 700.37 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1496. 700.37 s [Cabal] Warning: 'LocalBuildConfig' is out of scope.
  1497. 700.37 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1498. 700.37 s [Cabal] Warning: 'PackageIdentifier' is ambiguous. It is defined
  1499. 700.37 s [Cabal] * in ‘Distribution.Types.PackageId’
  1500. 700.37 s [Cabal] * in ‘Distribution.Types.PackageId’
  1501. 700.37 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1502. 700.37 s [Cabal] by specifying the type/value namespace explicitly.
  1503. 700.37 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.PackageId’
  1504. 700.38 s [Cabal] Warning: 'TargetInfo' is ambiguous. It is defined
  1505. 700.38 s [Cabal] * at src/Distribution/Types/TargetInfo.hs:22:19
  1506. 700.38 s [Cabal] * at src/Distribution/Types/TargetInfo.hs:22:1
  1507. 700.38 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1508. 700.38 s [Cabal] by specifying the type/value namespace explicitly.
  1509. 700.38 s [Cabal] Defaulting to the one defined at src/Distribution/Types/TargetInfo.hs:22:1
  1510. 700.38 s [Cabal] Warning: 'PackageDescription' is ambiguous. It is defined
  1511. 700.38 s [Cabal] * in ‘Distribution.Types.PackageDescription’
  1512. 700.38 s [Cabal] * in ‘Distribution.Types.PackageDescription’
  1513. 700.38 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1514. 700.38 s [Cabal] by specifying the type/value namespace explicitly.
  1515. 700.38 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.PackageDescription’
  1516. 700.38 s [Cabal] Warning: 'Component' is out of scope.
  1517. 700.38 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1518. 700.38 s [Cabal] 53% ( 16 / 30) in 'Distribution.Types.LocalBuildInfo'
  1519. 700.38 s [Cabal] Missing documentation for:
  1520. 700.38 s [Cabal] Module header
  1521. 700.38 s [Cabal] buildDir (src/Distribution/Types/LocalBuildInfo.hs:277)
  1522. 700.38 s [Cabal] buildDirPBD (src/Distribution/Types/LocalBuildInfo.hs:281)
  1523. 700.38 s [Cabal] configFlagsBuildDir (src/Distribution/Types/LocalBuildInfo.hs:285)
  1524. 700.38 s [Cabal] cabalFilePath (src/Distribution/Types/LocalBuildInfo.hs:288)
  1525. 700.38 s [Cabal] progPrefix (src/Distribution/Types/LocalBuildInfo.hs:292)
  1526. 700.38 s [Cabal] progSuffix (src/Distribution/Types/LocalBuildInfo.hs:294)
  1527. 700.38 s [Cabal] unitIdTarget' (src/Distribution/Types/LocalBuildInfo.hs:360)
  1528. 700.38 s [Cabal] componentNameTargets (src/Distribution/Types/LocalBuildInfo.hs:420)
  1529. 700.38 s [Cabal] unitIdTarget (src/Distribution/Types/LocalBuildInfo.hs:423)
  1530. 700.38 s [Cabal] allTargetsInBuildOrder (src/Distribution/Types/LocalBuildInfo.hs:426)
  1531. 700.38 s [Cabal] withAllTargetsInBuildOrder (src/Distribution/Types/LocalBuildInfo.hs:429)
  1532. 700.38 s [Cabal] neededTargetsInBuildOrder (src/Distribution/Types/LocalBuildInfo.hs:432)
  1533. 700.38 s [Cabal] withNeededTargetsInBuildOrder (src/Distribution/Types/LocalBuildInfo.hs:435)
  1534. 700.38 s [Cabal] Warning: 'LocalBuildInfo' is ambiguous. It is defined
  1535. 700.38 s [Cabal] * at src/Distribution/Types/LocalBuildInfo.hs:180:1
  1536. 700.38 s [Cabal] * at src/Distribution/Types/LocalBuildInfo.hs:129:1
  1537. 700.38 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1538. 700.38 s [Cabal] by specifying the type/value namespace explicitly.
  1539. 700.38 s [Cabal] Defaulting to the one defined at src/Distribution/Types/LocalBuildInfo.hs:129:1
  1540. 700.38 s [Cabal] Warning: 'Executable' is ambiguous. It is defined
  1541. 700.38 s [Cabal] * in ‘Distribution.Types.Executable’
  1542. 700.38 s [Cabal] * in ‘Distribution.Types.Executable’
  1543. 700.38 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1544. 700.38 s [Cabal] by specifying the type/value namespace explicitly.
  1545. 700.38 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.Executable’
  1546. 700.38 s [Cabal] Warning: 'Benchmark' is ambiguous. It is defined
  1547. 700.38 s [Cabal] * in ‘Distribution.Types.Benchmark’
  1548. 700.38 s [Cabal] * in ‘Distribution.Types.Benchmark’
  1549. 700.38 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1550. 700.38 s [Cabal] by specifying the type/value namespace explicitly.
  1551. 700.38 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.Benchmark’
  1552. 700.38 s [Cabal] Warning: 'Library' is ambiguous. It is defined
  1553. 700.38 s [Cabal] * in ‘Distribution.Types.Library’
  1554. 700.38 s [Cabal] * in ‘Distribution.Types.Library’
  1555. 700.38 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1556. 700.38 s [Cabal] by specifying the type/value namespace explicitly.
  1557. 700.38 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.Library’
  1558. 700.38 s [Cabal] Warning: 'compBuildOrder' is out of scope.
  1559. 700.38 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1560. 700.38 s [Cabal] 49% ( 31 / 63) in 'Distribution.Simple.LocalBuildInfo'
  1561. 700.38 s [Cabal] Missing documentation for:
  1562. 700.38 s [Cabal] buildDir (src/Distribution/Types/LocalBuildInfo.hs:277)
  1563. 700.38 s [Cabal] cabalFilePath (src/Distribution/Types/LocalBuildInfo.hs:288)
  1564. 700.38 s [Cabal] progPrefix (src/Distribution/Types/LocalBuildInfo.hs:292)
  1565. 700.38 s [Cabal] progSuffix (src/Distribution/Types/LocalBuildInfo.hs:294)
  1566. 700.38 s [Cabal] Component
  1567. 700.38 s [Cabal] ComponentName
  1568. 700.38 s [Cabal] LibraryName
  1569. 700.38 s [Cabal] defaultLibName
  1570. 700.38 s [Cabal] showComponentName
  1571. 700.38 s [Cabal] componentBuildDir (src/Distribution/Simple/LocalBuildInfo.hs:115)
  1572. 700.38 s [Cabal] foldComponent
  1573. 700.38 s [Cabal] componentName
  1574. 700.38 s [Cabal] componentBuildInfo
  1575. 700.38 s [Cabal] lookupComponent
  1576. 700.38 s [Cabal] getComponent
  1577. 700.38 s [Cabal] allComponentsInBuildOrder (src/Distribution/Simple/LocalBuildInfo.hs:211)
  1578. 700.38 s [Cabal] withTestLBI (src/Distribution/Simple/LocalBuildInfo.hs:173)
  1579. 700.38 s [Cabal] enabledTestLBIs (src/Distribution/Simple/LocalBuildInfo.hs:180)
  1580. 700.38 s [Cabal] enabledBenchLBIs (src/Distribution/Simple/LocalBuildInfo.hs:190)
  1581. 700.38 s [Cabal] defaultInstallDirs (src/Distribution/Simple/InstallDirs.hs:179)
  1582. 700.38 s [Cabal] defaultInstallDirs' (src/Distribution/Simple/InstallDirs.hs:187)
  1583. 700.38 s [Cabal] combineInstallDirs (src/Distribution/Simple/InstallDirs.hs:121)
  1584. 700.38 s [Cabal] PathTemplateVariable (src/Distribution/Simple/InstallDirs/Internal.hs:20)
  1585. 700.38 s [Cabal] PathTemplateEnv (src/Distribution/Simple/InstallDirs.hs:395)
  1586. 700.38 s [Cabal] combinePathTemplate (src/Distribution/Simple/InstallDirs.hs:410)
  1587. 700.38 s [Cabal] platformTemplateEnv (src/Distribution/Simple/InstallDirs.hs:452)
  1588. 700.38 s [Cabal] compilerTemplateEnv (src/Distribution/Simple/InstallDirs.hs:447)
  1589. 700.38 s [Cabal] packageTemplateEnv (src/Distribution/Simple/InstallDirs.hs:437)
  1590. 700.38 s [Cabal] abiTemplateEnv (src/Distribution/Simple/InstallDirs.hs:458)
  1591. 700.38 s [Cabal] installDirsTemplateEnv (src/Distribution/Simple/InstallDirs.hs:477)
  1592. 700.38 s [Cabal] absoluteInstallCommandDirs (src/Distribution/Simple/LocalBuildInfo.hs:378)
  1593. 700.38 s [Cabal] substPathTemplate (src/Distribution/Simple/LocalBuildInfo.hs:436)
  1594. 700.38 s [Cabal] Warning: 'PackageLog' is ambiguous. It is defined
  1595. 700.38 s [Cabal] * at src/Distribution/Simple/Test/Log.hs:40:19
  1596. 700.38 s [Cabal] * at src/Distribution/Simple/Test/Log.hs:40:1
  1597. 700.38 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1598. 700.38 s [Cabal] by specifying the type/value namespace explicitly.
  1599. 700.38 s [Cabal] Defaulting to the one defined at src/Distribution/Simple/Test/Log.hs:40:1
  1600. 700.38 s [Cabal] Warning: 'TestSuiteLog' is ambiguous. It is defined
  1601. 700.38 s [Cabal] * at src/Distribution/Simple/Test/Log.hs:59:21
  1602. 700.38 s [Cabal] * at src/Distribution/Simple/Test/Log.hs:59:1
  1603. 700.38 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1604. 700.38 s [Cabal] by specifying the type/value namespace explicitly.
  1605. 700.38 s [Cabal] Defaulting to the one defined at src/Distribution/Simple/Test/Log.hs:59:1
  1606. 700.38 s [Cabal] 71% ( 10 / 14) in 'Distribution.Simple.Test.Log'
  1607. 700.38 s [Cabal] Missing documentation for:
  1608. 700.38 s [Cabal] Module header
  1609. 700.38 s [Cabal] TestLogs (src/Distribution/Simple/Test/Log.hs:66)
  1610. 700.38 s [Cabal] summarizeSuiteStart (src/Distribution/Simple/Test/Log.hs:193)
  1611. 700.38 s [Cabal] testSuiteLogPath (src/Distribution/Simple/Test/Log.hs:127)
  1612. 700.38 s [Cabal] 55% ( 5 / 9) in 'Distribution.Simple.Hpc'
  1613. 700.38 s [Cabal] Missing documentation for:
  1614. 700.38 s [Cabal] Way (src/Distribution/Simple/Hpc.hs:55)
  1615. 700.38 s [Cabal] htmlDir (src/Distribution/Simple/Hpc.hs:104)
  1616. 700.38 s [Cabal] mixDir (src/Distribution/Simple/Hpc.hs:77)
  1617. 700.38 s [Cabal] tixDir (src/Distribution/Simple/Hpc.hs:85)
  1618. 700.38 s [Cabal] 50% ( 1 / 2) in 'Distribution.Simple.Build.PackageInfoModule'
  1619. 700.38 s [Cabal] Missing documentation for:
  1620. 700.38 s [Cabal] generatePackageInfoModule (src/Distribution/Simple/Build/PackageInfoModule.hs:37)
  1621. 700.38 s [Cabal] 100% ( 3 / 3) in 'Distribution.Simple.Build.Macros'
  1622. 700.39 s [Cabal] Warning: 'computeCompatPackageName' is out of scope.
  1623. 700.39 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1624. 700.39 s [Cabal] Warning: 'ConfiguredComponent' is ambiguous. It is defined
  1625. 700.39 s [Cabal] * at src/Distribution/Backpack/ConfiguredComponent.hs:45:28
  1626. 700.39 s [Cabal] * at src/Distribution/Backpack/ConfiguredComponent.hs:45:1
  1627. 700.39 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1628. 700.39 s [Cabal] by specifying the type/value namespace explicitly.
  1629. 700.39 s [Cabal] Defaulting to the one defined at src/Distribution/Backpack/ConfiguredComponent.hs:45:1
  1630. 700.39 s [Cabal] 54% ( 6 / 11) in 'Distribution.Backpack.ConfiguredComponent'
  1631. 700.39 s [Cabal] Missing documentation for:
  1632. 700.39 s [Cabal] toConfiguredComponent (src/Distribution/Backpack/ConfiguredComponent.hs:179)
  1633. 700.39 s [Cabal] toConfiguredComponents (src/Distribution/Backpack/ConfiguredComponent.hs:317)
  1634. 700.39 s [Cabal] ConfiguredComponentMap (src/Distribution/Backpack/ConfiguredComponent.hs:169)
  1635. 700.39 s [Cabal] extendConfiguredComponentMap (src/Distribution/Backpack/ConfiguredComponent.hs:292)
  1636. 700.39 s [Cabal] newPackageDepsBehaviour (src/Distribution/Backpack/ConfiguredComponent.hs:350)
  1637. 700.39 s [Cabal] Warning: 'ConfiguredComponent' is ambiguous. It is defined
  1638. 700.39 s [Cabal] * at src/Distribution/Backpack/ConfiguredComponent.hs:45:28
  1639. 700.39 s [Cabal] * at src/Distribution/Backpack/ConfiguredComponent.hs:45:1
  1640. 700.39 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1641. 700.39 s [Cabal] by specifying the type/value namespace explicitly.
  1642. 700.39 s [Cabal] Defaulting to the one defined at src/Distribution/Backpack/ConfiguredComponent.hs:45:1
  1643. 700.39 s [Cabal] Warning: 'LinkedComponent' is ambiguous. It is defined
  1644. 700.39 s [Cabal] * at src/Distribution/Backpack/LinkedComponent.hs:50:24
  1645. 700.39 s [Cabal] * at src/Distribution/Backpack/LinkedComponent.hs:50:1
  1646. 700.39 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1647. 700.39 s [Cabal] by specifying the type/value namespace explicitly.
  1648. 700.39 s [Cabal] Defaulting to the one defined at src/Distribution/Backpack/LinkedComponent.hs:50:1
  1649. 700.39 s [Cabal] Warning: 'ReadyComponent' is out of scope.
  1650. 700.39 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1651. 700.39 s [Cabal] Warning: 'ModuleRenaming' is ambiguous. It is defined
  1652. 700.39 s [Cabal] * in ‘Distribution.Types.ModuleRenaming’
  1653. 700.39 s [Cabal] * in ‘Distribution.Types.ModuleRenaming’
  1654. 700.39 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1655. 700.39 s [Cabal] by specifying the type/value namespace explicitly.
  1656. 700.39 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.ModuleRenaming’
  1657. 700.39 s [Cabal] Warning: 'IncludeRenaming' is ambiguous. It is defined
  1658. 700.39 s [Cabal] * in ‘Distribution.Types.IncludeRenaming’
  1659. 700.39 s [Cabal] * in ‘Distribution.Types.IncludeRenaming’
  1660. 700.39 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1661. 700.39 s [Cabal] by specifying the type/value namespace explicitly.
  1662. 700.39 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.IncludeRenaming’
  1663. 700.39 s [Cabal] Warning: 'ModSubst' is out of scope.
  1664. 700.39 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1665. 700.39 s [Cabal] 54% ( 6 / 11) in 'Distribution.Backpack.LinkedComponent'
  1666. 700.39 s [Cabal] Missing documentation for:
  1667. 700.39 s [Cabal] toLinkedComponent (src/Distribution/Backpack/LinkedComponent.hs:123)
  1668. 700.39 s [Cabal] toLinkedComponents (src/Distribution/Backpack/LinkedComponent.hs:417)
  1669. 700.39 s [Cabal] dispLinkedComponent (src/Distribution/Backpack/LinkedComponent.hs:99)
  1670. 700.39 s [Cabal] LinkedComponentMap (src/Distribution/Backpack/LinkedComponent.hs:430)
  1671. 700.39 s [Cabal] extendLinkedComponentMap (src/Distribution/Backpack/LinkedComponent.hs:436)
  1672. 700.39 s [Cabal] Warning: 'PackageDescription' is ambiguous. It is defined
  1673. 700.39 s [Cabal] * in ‘Distribution.Types.PackageDescription’
  1674. 700.39 s [Cabal] * in ‘Distribution.Types.PackageDescription’
  1675. 700.39 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1676. 700.39 s [Cabal] by specifying the type/value namespace explicitly.
  1677. 700.39 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.PackageDescription’
  1678. 700.39 s [Cabal] 100% ( 7 / 7) in 'Distribution.Backpack.ComponentsGraph'
  1679. 700.39 s [Cabal] 100% ( 2 / 2) in 'Distribution.Simple.Program.Ld'
  1680. 700.39 s [Cabal] 100% ( 3 / 3) in 'Distribution.Simple.Program.Ar'
  1681. 700.39 s [Cabal] Warning: 'CommandUI' is out of scope.
  1682. 700.39 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1683. 700.39 s [Cabal] Warning: 'Monoid' is out of scope.
  1684. 700.39 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1685. 700.39 s [Cabal] 25% ( 26 /102) in 'Distribution.Simple.Setup'
  1686. 700.39 s [Cabal] Missing documentation for:
  1687. 700.39 s [Cabal] emptyGlobalFlags (src/Distribution/Simple/Setup/Global.hs:115)
  1688. 700.39 s [Cabal] defaultGlobalFlags (src/Distribution/Simple/Setup/Global.hs:54)
  1689. 700.39 s [Cabal] globalCommand (src/Distribution/Simple/Setup/Global.hs:61)
  1690. 700.39 s [Cabal] emptyConfigFlags (src/Distribution/Simple/Setup/Config.hs:1024)
  1691. 700.39 s [Cabal] defaultConfigFlags (src/Distribution/Simple/Setup/Config.hs:310)
  1692. 700.39 s [Cabal] configureCommand (src/Distribution/Simple/Setup/Config.hs:356)
  1693. 700.39 s [Cabal] configAbsolutePaths (src/Distribution/Simple/Setup/Config.hs:302)
  1694. 700.39 s [Cabal] readPackageDbList (src/Distribution/Simple/Setup/Config.hs:869)
  1695. 700.39 s [Cabal] showPackageDbList (src/Distribution/Simple/Setup/Config.hs:881)
  1696. 700.39 s [Cabal] emptyCopyFlags (src/Distribution/Simple/Setup/Copy.hs:146)
  1697. 700.39 s [Cabal] defaultCopyFlags (src/Distribution/Simple/Setup/Copy.hs:62)
  1698. 700.39 s [Cabal] copyCommand (src/Distribution/Simple/Setup/Copy.hs:72)
  1699. 700.39 s [Cabal] emptyInstallFlags (src/Distribution/Simple/Setup/Install.hs:151)
  1700. 700.39 s [Cabal] defaultInstallFlags (src/Distribution/Simple/Setup/Install.hs:61)
  1701. 700.39 s [Cabal] installCommand (src/Distribution/Simple/Setup/Install.hs:73)
  1702. 700.39 s [Cabal] HaddockFlags (src/Distribution/Simple/Setup/Haddock.hs:83)
  1703. 700.39 s [Cabal] emptyHaddockFlags (src/Distribution/Simple/Setup/Haddock.hs:357)
  1704. 700.39 s [Cabal] defaultHaddockFlags (src/Distribution/Simple/Setup/Haddock.hs:116)
  1705. 700.39 s [Cabal] haddockCommand (src/Distribution/Simple/Setup/Haddock.hs:146)
  1706. 700.39 s [Cabal] HaddockProjectFlags (src/Distribution/Simple/Setup/Haddock.hs:379)
  1707. 700.39 s [Cabal] emptyHaddockProjectFlags (src/Distribution/Simple/Setup/Haddock.hs:599)
  1708. 700.39 s [Cabal] defaultHaddockProjectFlags (src/Distribution/Simple/Setup/Haddock.hs:422)
  1709. 700.39 s [Cabal] haddockProjectCommand (src/Distribution/Simple/Setup/Haddock.hs:446)
  1710. 700.39 s [Cabal] HscolourFlags (src/Distribution/Simple/Setup/Hscolour.hs:42)
  1711. 700.39 s [Cabal] emptyHscolourFlags (src/Distribution/Simple/Setup/Hscolour.hs:58)
  1712. 700.39 s [Cabal] defaultHscolourFlags (src/Distribution/Simple/Setup/Hscolour.hs:61)
  1713. 700.39 s [Cabal] hscolourCommand (src/Distribution/Simple/Setup/Hscolour.hs:81)
  1714. 700.39 s [Cabal] BuildFlags (src/Distribution/Simple/Setup/Build.hs:47)
  1715. 700.39 s [Cabal] emptyBuildFlags (src/Distribution/Simple/Setup/Build.hs:158)
  1716. 700.39 s [Cabal] defaultBuildFlags (src/Distribution/Simple/Setup/Build.hs:65)
  1717. 700.39 s [Cabal] buildCommand (src/Distribution/Simple/Setup/Build.hs:78)
  1718. 700.39 s [Cabal] DumpBuildInfo (src/Distribution/Types/DumpBuildInfo.hs:10)
  1719. 700.39 s [Cabal] ReplFlags (src/Distribution/Simple/Setup/Repl.hs:63)
  1720. 700.39 s [Cabal] defaultReplFlags (src/Distribution/Simple/Setup/Repl.hs:77)
  1721. 700.39 s [Cabal] replCommand (src/Distribution/Simple/Setup/Repl.hs:95)
  1722. 700.39 s [Cabal] ReplOptions (src/Distribution/Simple/Setup/Repl.hs:46)
  1723. 700.39 s [Cabal] CleanFlags (src/Distribution/Simple/Setup/Clean.hs:42)
  1724. 700.39 s [Cabal] emptyCleanFlags (src/Distribution/Simple/Setup/Clean.hs:90)
  1725. 700.39 s [Cabal] defaultCleanFlags (src/Distribution/Simple/Setup/Clean.hs:54)
  1726. 700.39 s [Cabal] cleanCommand (src/Distribution/Simple/Setup/Clean.hs:63)
  1727. 700.39 s [Cabal] emptyRegisterFlags (src/Distribution/Simple/Setup/Register.hs:188)
  1728. 700.39 s [Cabal] defaultRegisterFlags (src/Distribution/Simple/Setup/Register.hs:61)
  1729. 700.39 s [Cabal] registerCommand (src/Distribution/Simple/Setup/Register.hs:75)
  1730. 700.39 s [Cabal] unregisterCommand (src/Distribution/Simple/Setup/Register.hs:142)
  1731. 700.39 s [Cabal] emptySDistFlags (src/Distribution/Simple/Setup/SDist.hs:106)
  1732. 700.39 s [Cabal] defaultSDistFlags (src/Distribution/Simple/Setup/SDist.hs:53)
  1733. 700.39 s [Cabal] sdistCommand (src/Distribution/Simple/Setup/SDist.hs:63)
  1734. 700.39 s [Cabal] TestFlags (src/Distribution/Simple/Setup/Test.hs:82)
  1735. 700.39 s [Cabal] emptyTestFlags (src/Distribution/Simple/Setup/Test.hs:247)
  1736. 700.40 s [Cabal] defaultTestFlags (src/Distribution/Simple/Setup/Test.hs:100)
  1737. 700.40 s [Cabal] testCommand (src/Distribution/Simple/Setup/Test.hs:114)
  1738. 700.40 s [Cabal] TestShowDetails (src/Distribution/Simple/Setup/Test.hs:51)
  1739. 700.40 s [Cabal] BenchmarkFlags (src/Distribution/Simple/Setup/Benchmark.hs:45)
  1740. 700.40 s [Cabal] emptyBenchmarkFlags (src/Distribution/Simple/Setup/Benchmark.hs:124)
  1741. 700.40 s [Cabal] defaultBenchmarkFlags (src/Distribution/Simple/Setup/Benchmark.hs:56)
  1742. 700.40 s [Cabal] benchmarkCommand (src/Distribution/Simple/Setup/Benchmark.hs:64)
  1743. 700.40 s [Cabal] configureOptions (src/Distribution/Simple/Setup/Config.hs:403)
  1744. 700.40 s [Cabal] configureCCompiler (src/Distribution/Simple/Setup/Common.hs:327)
  1745. 700.40 s [Cabal] configureLinker (src/Distribution/Simple/Setup/Common.hs:330)
  1746. 700.40 s [Cabal] buildOptions (src/Distribution/Simple/Setup/Build.hs:129)
  1747. 700.40 s [Cabal] haddockOptions (src/Distribution/Simple/Setup/Haddock.hs:184)
  1748. 700.40 s [Cabal] haddockProjectOptions (src/Distribution/Simple/Setup/Haddock.hs:484)
  1749. 700.40 s [Cabal] installDirsOptions (src/Distribution/Simple/Setup/Config.hs:920)
  1750. 700.40 s [Cabal] testOptions' (src/Distribution/Simple/Setup/Test.hs:134)
  1751. 700.40 s [Cabal] benchmarkOptions' (src/Distribution/Simple/Setup/Benchmark.hs:84)
  1752. 700.40 s [Cabal] programFlagsDescription (src/Distribution/Simple/Setup/Common.hs:105)
  1753. 700.40 s [Cabal] replOptions (src/Distribution/Simple/Setup/Repl.hs:183)
  1754. 700.40 s [Cabal] defaultDistPref (src/Distribution/Simple/Setup/Common.hs:65)
  1755. 700.40 s [Cabal] optionDistPref (src/Distribution/Simple/Setup/Common.hs:255)
  1756. 700.40 s [Cabal] boolOpt (src/Distribution/Simple/Setup/Common.hs:228)
  1757. 700.40 s [Cabal] boolOpt' (src/Distribution/Simple/Setup/Common.hs:234)
  1758. 700.40 s [Cabal] trueArg (src/Distribution/Simple/Setup/Common.hs:237)
  1759. 700.40 s [Cabal] falseArg (src/Distribution/Simple/Setup/Common.hs:238)
  1760. 700.40 s [Cabal] optionVerbosity (src/Distribution/Simple/Setup/Common.hs:275)
  1761. 700.40 s [Cabal] buildingWhatVerbosity (src/Distribution/Simple/Setup.hs:180)
  1762. 700.40 s [Cabal] buildingWhatDistPref (src/Distribution/Simple/Setup.hs:187)
  1763. 700.40 s [Cabal] Warning: 'Library' is out of scope.
  1764. 700.40 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1765. 700.40 s [Cabal] Warning: 'BuildInfo' is ambiguous. It is defined
  1766. 700.40 s [Cabal] * in ‘Distribution.Types.BuildInfo’
  1767. 700.40 s [Cabal] * in ‘Distribution.Types.BuildInfo’
  1768. 700.40 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1769. 700.40 s [Cabal] by specifying the type/value namespace explicitly.
  1770. 700.40 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.BuildInfo’
  1771. 700.40 s [Cabal] Warning: 'Compiler' is ambiguous. It is defined
  1772. 700.40 s [Cabal] * at src/Distribution/Simple/Compiler.hs:91:17
  1773. 700.40 s [Cabal] * at src/Distribution/Simple/Compiler.hs:91:1
  1774. 700.40 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1775. 700.40 s [Cabal] by specifying the type/value namespace explicitly.
  1776. 700.40 s [Cabal] Defaulting to the one defined at src/Distribution/Simple/Compiler.hs:91:1
  1777. 700.40 s [Cabal] 81% ( 13 / 16) in 'Distribution.Simple.Build.Inputs'
  1778. 700.40 s [Cabal] Missing documentation for:
  1779. 700.40 s [Cabal] Module header
  1780. 700.40 s [Cabal] buildingWhatVerbosity (src/Distribution/Simple/Setup.hs:180)
  1781. 700.40 s [Cabal] buildingWhatDistPref (src/Distribution/Simple/Setup.hs:187)
  1782. 700.40 s [Cabal] Warning: 'matchExactly' is out of scope.
  1783. 700.40 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1784. 700.40 s [Cabal] Warning: 'ambiguousWith' is out of scope.
  1785. 700.40 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1786. 700.40 s [Cabal] Warning: 'shadows' is out of scope.
  1787. 700.40 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1788. 700.40 s [Cabal] Warning: 'TargetInfo' is ambiguous. It is defined
  1789. 700.40 s [Cabal] * at src/Distribution/Types/TargetInfo.hs:22:19
  1790. 700.40 s [Cabal] * at src/Distribution/Types/TargetInfo.hs:22:1
  1791. 700.40 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1792. 700.40 s [Cabal] by specifying the type/value namespace explicitly.
  1793. 700.40 s [Cabal] Defaulting to the one defined at src/Distribution/Types/TargetInfo.hs:22:1
  1794. 700.40 s [Cabal] Warning: 'PackageDescription' is ambiguous. It is defined
  1795. 700.40 s [Cabal] * in ‘Distribution.Types.PackageDescription’
  1796. 700.40 s [Cabal] * in ‘Distribution.Types.PackageDescription’
  1797. 700.40 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1798. 700.40 s [Cabal] by specifying the type/value namespace explicitly.
  1799. 700.40 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.PackageDescription’
  1800. 700.40 s [Cabal] 57% ( 11 / 19) in 'Distribution.Simple.BuildTarget'
  1801. 700.40 s [Cabal] Missing documentation for:
  1802. 700.40 s [Cabal] QualLevel (src/Distribution/Simple/BuildTarget.hs:371)
  1803. 700.40 s [Cabal] buildTargetComponentName (src/Distribution/Simple/BuildTarget.hs:136)
  1804. 700.40 s [Cabal] readUserBuildTargets (src/Distribution/Simple/BuildTarget.hs:183)
  1805. 700.40 s [Cabal] showUserBuildTarget (src/Distribution/Simple/BuildTarget.hs:255)
  1806. 700.40 s [Cabal] UserBuildTargetProblem (src/Distribution/Simple/BuildTarget.hs:242)
  1807. 700.40 s [Cabal] reportUserBuildTargetProblems (src/Distribution/Simple/BuildTarget.hs:247)
  1808. 700.40 s [Cabal] BuildTargetProblem (src/Distribution/Simple/BuildTarget.hs:334)
  1809. 700.40 s [Cabal] reportBuildTargetProblems (src/Distribution/Simple/BuildTarget.hs:397)
  1810. 700.40 s [Cabal] Warning: 'lib' is out of scope.
  1811. 700.40 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1812. 700.40 s [Cabal] Warning: 'C' is out of scope.
  1813. 700.40 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1814. 700.40 s [Cabal] 58% ( 18 / 31) in 'Distribution.Simple.BuildPaths'
  1815. 700.40 s [Cabal] Missing documentation for:
  1816. 700.40 s [Cabal] defaultDistPref (src/Distribution/Simple/Setup/Common.hs:65)
  1817. 700.40 s [Cabal] srcPref (src/Distribution/Simple/BuildPaths.hs:74)
  1818. 700.40 s [Cabal] hscolourPref (src/Distribution/Simple/BuildPaths.hs:77)
  1819. 700.40 s [Cabal] cppHeaderName (src/Distribution/Simple/BuildPaths.hs:108)
  1820. 700.40 s [Cabal] haddockName (src/Distribution/Simple/BuildPaths.hs:129)
  1821. 700.40 s [Cabal] mkLibName (src/Distribution/Simple/BuildPaths.hs:220)
  1822. 700.40 s [Cabal] mkProfLibName (src/Distribution/Simple/BuildPaths.hs:223)
  1823. 700.40 s [Cabal] mkSharedLibName (src/Distribution/Simple/BuildPaths.hs:238)
  1824. 700.40 s [Cabal] mkStaticLibName (src/Distribution/Simple/BuildPaths.hs:244)
  1825. 700.40 s [Cabal] getSourceFiles (src/Distribution/Simple/BuildPaths.hs:191)
  1826. 700.40 s [Cabal] getLibSourceFiles (src/Distribution/Simple/BuildPaths.hs:140)
  1827. 700.40 s [Cabal] getExeSourceFiles (src/Distribution/Simple/BuildPaths.hs:157)
  1828. 700.40 s [Cabal] getFLibSourceFiles (src/Distribution/Simple/BuildPaths.hs:176)
  1829. 700.40 s [Cabal] 12% ( 1 / 8) in 'Distribution.Simple.UHC'
  1830. 700.40 s [Cabal] Missing documentation for:
  1831. 700.40 s [Cabal] configure (src/Distribution/Simple/UHC.hs:64)
  1832. 700.40 s [Cabal] getInstalledPackages (src/Distribution/Simple/UHC.hs:118)
  1833. 700.40 s [Cabal] buildLib (src/Distribution/Simple/UHC.hs:208)
  1834. 700.40 s [Cabal] buildExe (src/Distribution/Simple/UHC.hs:242)
  1835. 700.40 s [Cabal] installLib (src/Distribution/Simple/UHC.hs:324)
  1836. 700.40 s [Cabal] registerPackage (src/Distribution/Simple/UHC.hs:350)
  1837. 700.40 s [Cabal] inplacePackageDbPath (src/Distribution/Simple/UHC.hs:365)
  1838. 700.40 s [Cabal] 0% ( 0 / 13) in 'Distribution.Simple.HaskellSuite'
  1839. 700.40 s [Cabal] Missing documentation for:
  1840. 700.40 s [Cabal] Module header
  1841. 700.40 s [Cabal] configure (src/Distribution/Simple/HaskellSuite.hs:36)
  1842. 700.40 s [Cabal] hstoolVersion (src/Distribution/Simple/HaskellSuite.hs:93)
  1843. 700.40 s [Cabal] numericVersion (src/Distribution/Simple/HaskellSuite.hs:96)
  1844. 700.40 s [Cabal] getCompilerVersion (src/Distribution/Simple/HaskellSuite.hs:99)
  1845. 700.40 s [Cabal] getExtensions (src/Distribution/Simple/HaskellSuite.hs:113)
  1846. 700.40 s [Cabal] getLanguages (src/Distribution/Simple/HaskellSuite.hs:121)
  1847. 700.40 s [Cabal] getInstalledPackages (src/Distribution/Simple/HaskellSuite.hs:135)
  1848. 700.40 s [Cabal] buildLib (src/Distribution/Simple/HaskellSuite.hs:173)
  1849. 700.40 s [Cabal] installLib (src/Distribution/Simple/HaskellSuite.hs:224)
  1850. 700.40 s [Cabal] registerPackage (src/Distribution/Simple/HaskellSuite.hs:245)
  1851. 700.40 s [Cabal] initPackageDB (src/Distribution/Simple/HaskellSuite.hs:257)
  1852. 700.40 s [Cabal] packageDbOpt (src/Distribution/Simple/HaskellSuite.hs:265)
  1853. 700.40 s [Cabal] Warning: 'Arch' is ambiguous. It is defined
  1854. 700.40 s [Cabal] * in ‘Distribution.System’
  1855. 700.40 s [Cabal] * in ‘Distribution.Types.ConfVar’
  1856. 700.40 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1857. 700.40 s [Cabal] by specifying the type/value namespace explicitly.
  1858. 700.40 s [Cabal] Defaulting to the one defined in ‘Distribution.System’
  1859. 700.40 s [Cabal] Warning: 'OS' is ambiguous. It is defined
  1860. 700.40 s [Cabal] * in ‘Distribution.System’
  1861. 700.40 s [Cabal] * in ‘Distribution.Types.ConfVar’
  1862. 700.40 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1863. 700.40 s [Cabal] by specifying the type/value namespace explicitly.
  1864. 700.40 s [Cabal] Defaulting to the one defined in ‘Distribution.System’
  1865. 700.40 s [Cabal] Warning: 'Platform' is ambiguous. It is defined
  1866. 700.40 s [Cabal] * in ‘Distribution.System’
  1867. 700.40 s [Cabal] * in ‘Distribution.System’
  1868. 700.40 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1869. 700.40 s [Cabal] by specifying the type/value namespace explicitly.
  1870. 700.40 s [Cabal] Defaulting to the one defined in ‘Distribution.System’
  1871. 700.41 s [Cabal] Warning: 'BuildSources' is ambiguous. It is defined
  1872. 700.41 s [Cabal] * at src/Distribution/Simple/GHCJS.hs:1105:21
  1873. 700.41 s [Cabal] * at src/Distribution/Simple/GHCJS.hs:1105:1
  1874. 700.41 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1875. 700.41 s [Cabal] by specifying the type/value namespace explicitly.
  1876. 700.41 s [Cabal] Defaulting to the one defined at src/Distribution/Simple/GHCJS.hs:1105:1
  1877. 700.41 s [Cabal] Warning: 'hsLibraries' is out of scope.
  1878. 700.41 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1879. 700.41 s [Cabal] Warning: 'BuildInfo' is ambiguous. It is defined
  1880. 700.41 s [Cabal] * in ‘Distribution.Types.BuildInfo’
  1881. 700.41 s [Cabal] * in ‘Distribution.Types.BuildInfo’
  1882. 700.41 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1883. 700.41 s [Cabal] by specifying the type/value namespace explicitly.
  1884. 700.41 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.BuildInfo’
  1885. 700.41 s [Cabal] 52% ( 20 / 38) in 'Distribution.Simple.GHCJS'
  1886. 700.41 s [Cabal] Missing documentation for:
  1887. 700.41 s [Cabal] Module header
  1888. 700.41 s [Cabal] getGhcInfo (src/Distribution/Simple/GHCJS.hs:308)
  1889. 700.41 s [Cabal] configure (src/Distribution/Simple/GHCJS.hs:117)
  1890. 700.41 s [Cabal] buildLib (src/Distribution/Simple/GHCJS.hs:463)
  1891. 700.41 s [Cabal] replLib (src/Distribution/Simple/GHCJS.hs:474)
  1892. 700.41 s [Cabal] replFLib (src/Distribution/Simple/GHCJS.hs:891)
  1893. 700.41 s [Cabal] replExe (src/Distribution/Simple/GHCJS.hs:914)
  1894. 700.41 s [Cabal] hcPkgInfo (src/Distribution/Simple/GHCJS.hs:1968)
  1895. 700.41 s [Cabal] registerPackage (src/Distribution/Simple/GHCJS.hs:1992)
  1896. 700.41 s [Cabal] componentGhcOptions (src/Distribution/Simple/GHCJS.hs:1780)
  1897. 700.41 s [Cabal] componentCcGhcOptions (src/Distribution/Simple/GHC/Internal.hs:349)
  1898. 700.41 s [Cabal] getLibDir (src/Distribution/Simple/GHCJS.hs:355)
  1899. 700.41 s [Cabal] isDynamic (src/Distribution/Simple/GHCJS.hs:1948)
  1900. 700.41 s [Cabal] pkgRoot (src/Distribution/Simple/GHCJS.hs:2001)
  1901. 700.41 s [Cabal] readGhcEnvironmentFile (src/Distribution/Simple/GHC/EnvironmentParser.hs:57)
  1902. 700.41 s [Cabal] parseGhcEnvironmentFile (src/Distribution/Simple/GHC/EnvironmentParser.hs:54)
  1903. 700.41 s [Cabal] ParseErrorExc (src/Distribution/Simple/GHC/EnvironmentParser.hs:48)
  1904. 700.41 s [Cabal] getImplInfo (src/Distribution/Simple/GHC/ImplInfo.hs:70)
  1905. 700.41 s [Cabal] Warning: 'Executable' is ambiguous. It is defined
  1906. 700.41 s [Cabal] * in ‘Distribution.Types.Executable’
  1907. 700.41 s [Cabal] * in ‘Distribution.Types.Executable’
  1908. 700.41 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1909. 700.41 s [Cabal] by specifying the type/value namespace explicitly.
  1910. 700.41 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.Executable’
  1911. 700.41 s [Cabal] Warning: 'TestSuite' is ambiguous. It is defined
  1912. 700.41 s [Cabal] * in ‘Distribution.Types.TestSuite’
  1913. 700.41 s [Cabal] * in ‘Distribution.Types.TestSuite’
  1914. 700.41 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1915. 700.41 s [Cabal] by specifying the type/value namespace explicitly.
  1916. 700.41 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.TestSuite’
  1917. 700.41 s [Cabal] Warning: 'Benchmark' is ambiguous. It is defined
  1918. 700.41 s [Cabal] * in ‘Distribution.Types.Benchmark’
  1919. 700.41 s [Cabal] * in ‘Distribution.Types.Benchmark’
  1920. 700.41 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1921. 700.41 s [Cabal] by specifying the type/value namespace explicitly.
  1922. 700.41 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.Benchmark’
  1923. 700.41 s [Cabal] Warning: 'BuildInfo' is ambiguous. It is defined
  1924. 700.41 s [Cabal] * in ‘Distribution.Types.BuildInfo’
  1925. 700.41 s [Cabal] * in ‘Distribution.Types.BuildInfo’
  1926. 700.41 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1927. 700.41 s [Cabal] by specifying the type/value namespace explicitly.
  1928. 700.41 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.BuildInfo’
  1929. 700.41 s [Cabal] Warning: 'GhcOptions' is ambiguous. It is defined
  1930. 700.41 s [Cabal] * at src/Distribution/Simple/Program/GHC.hs:410:19
  1931. 700.41 s [Cabal] * at src/Distribution/Simple/Program/GHC.hs:410:1
  1932. 700.41 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1933. 700.41 s [Cabal] by specifying the type/value namespace explicitly.
  1934. 700.41 s [Cabal] Defaulting to the one defined at src/Distribution/Simple/Program/GHC.hs:410:1
  1935. 700.41 s [Cabal] Warning: 'PreBuildComponentRules' is out of scope.
  1936. 700.41 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1937. 700.41 s [Cabal] Warning: 'GhcOptions' is ambiguous. It is defined
  1938. 700.41 s [Cabal] * at src/Distribution/Simple/Program/GHC.hs:410:19
  1939. 700.41 s [Cabal] * at src/Distribution/Simple/Program/GHC.hs:410:1
  1940. 700.41 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1941. 700.41 s [Cabal] by specifying the type/value namespace explicitly.
  1942. 700.41 s [Cabal] Defaulting to the one defined at src/Distribution/Simple/Program/GHC.hs:410:1
  1943. 700.41 s [Cabal] Warning: 'Executable' is ambiguous. It is defined
  1944. 700.41 s [Cabal] * in ‘Distribution.Types.Executable’
  1945. 700.41 s [Cabal] * in ‘Distribution.Types.Executable’
  1946. 700.41 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1947. 700.41 s [Cabal] by specifying the type/value namespace explicitly.
  1948. 700.41 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.Executable’
  1949. 700.41 s [Cabal] Warning: 'hsLibraries' is out of scope.
  1950. 700.41 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1951. 700.41 s [Cabal] Warning: 'BuildInfo' is ambiguous. It is defined
  1952. 700.42 s [Cabal] * in ‘Distribution.Types.BuildInfo’
  1953. 700.42 s [Cabal] * in ‘Distribution.Types.BuildInfo’
  1954. 700.42 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1955. 700.42 s [Cabal] by specifying the type/value namespace explicitly.
  1956. 700.42 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.BuildInfo’
  1957. 700.42 s [Cabal] Warning: 'Compiler' is ambiguous. It is defined
  1958. 700.42 s [Cabal] * at src/Distribution/Simple/Compiler.hs:91:17
  1959. 700.42 s [Cabal] * at src/Distribution/Simple/Compiler.hs:91:1
  1960. 700.42 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1961. 700.42 s [Cabal] by specifying the type/value namespace explicitly.
  1962. 700.42 s [Cabal] Defaulting to the one defined at src/Distribution/Simple/Compiler.hs:91:1
  1963. 700.42 s [Cabal] 55% ( 21 / 38) in 'Distribution.Simple.GHC'
  1964. 700.42 s [Cabal] Missing documentation for:
  1965. 700.42 s [Cabal] getGhcInfo (src/Distribution/Simple/GHC.hs:387)
  1966. 700.42 s [Cabal] configure (src/Distribution/Simple/GHC.hs:155)
  1967. 700.42 s [Cabal] getInstalledPackagesMonitorFiles (src/Distribution/Simple/GHC.hs:545)
  1968. 700.42 s [Cabal] buildLib (src/Distribution/Simple/GHC.hs:578)
  1969. 700.42 s [Cabal] replLib (src/Distribution/Simple/GHC.hs:590)
  1970. 700.42 s [Cabal] replFLib (src/Distribution/Simple/GHC.hs:636)
  1971. 700.42 s [Cabal] replExe (src/Distribution/Simple/GHC.hs:661)
  1972. 700.42 s [Cabal] hcPkgInfo (src/Distribution/Simple/GHC.hs:960)
  1973. 700.42 s [Cabal] registerPackage (src/Distribution/Simple/GHC.hs:984)
  1974. 700.42 s [Cabal] componentGhcOptions (src/Distribution/Simple/GHC/Internal.hs:522)
  1975. 700.42 s [Cabal] componentCcGhcOptions (src/Distribution/Simple/GHC/Internal.hs:349)
  1976. 700.42 s [Cabal] getLibDir (src/Distribution/Simple/GHC.hs:451)
  1977. 700.42 s [Cabal] pkgRoot (src/Distribution/Simple/GHC.hs:993)
  1978. 700.42 s [Cabal] readGhcEnvironmentFile (src/Distribution/Simple/GHC/EnvironmentParser.hs:57)
  1979. 700.42 s [Cabal] parseGhcEnvironmentFile (src/Distribution/Simple/GHC/EnvironmentParser.hs:54)
  1980. 700.42 s [Cabal] ParseErrorExc (src/Distribution/Simple/GHC/EnvironmentParser.hs:48)
  1981. 700.42 s [Cabal] getImplInfo (src/Distribution/Simple/GHC/ImplInfo.hs:70)
  1982. 700.42 s [Cabal] 60% ( 3 / 5) in 'Distribution.Simple.ShowBuildInfo'
  1983. 700.42 s [Cabal] Missing documentation for:
  1984. 700.42 s [Cabal] mkCompilerInfo (src/Distribution/Simple/ShowBuildInfo.hs:134)
  1985. 700.42 s [Cabal] mkComponentInfo (src/Distribution/Simple/ShowBuildInfo.hs:142)
  1986. 700.42 s [Cabal] Warning: 'register' is out of scope.
  1987. 700.42 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1988. 700.42 s [Cabal] 100% ( 2 / 2) in 'Distribution.Simple.Install'
  1989. 700.42 s [Cabal] 66% ( 2 / 3) in 'Distribution.Simple.Build.PathsModule'
  1990. 700.42 s [Cabal] Missing documentation for:
  1991. 700.42 s [Cabal] generatePathsModule (src/Distribution/Simple/Build/PathsModule.hs:42)
  1992. 700.42 s [Cabal] Warning: 'TestSuite' is out of scope.
  1993. 700.42 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1994. 700.42 s [Cabal] Warning: 'Test' is ambiguous. It is defined
  1995. 700.42 s [Cabal] * at src/Distribution/TestSuite.hs:79:5
  1996. 700.43 s [Cabal] * at src/Distribution/TestSuite.hs:78:1
  1997. 700.43 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1998. 700.43 s [Cabal] by specifying the type/value namespace explicitly.
  1999. 700.43 s [Cabal] Defaulting to the one defined at src/Distribution/TestSuite.hs:78:1
  2000. 700.43 s [Cabal] Warning: 'TestSuiteLog' is ambiguous. It is defined
  2001. 700.43 s [Cabal] * at src/Distribution/Simple/Test/Log.hs:59:21
  2002. 700.43 s [Cabal] * at src/Distribution/Simple/Test/Log.hs:59:1
  2003. 700.43 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  2004. 700.43 s [Cabal] by specifying the type/value namespace explicitly.
  2005. 700.43 s [Cabal] Defaulting to the one defined at src/Distribution/Simple/Test/Log.hs:59:1
  2006. 700.43 s [Cabal] 75% ( 6 / 8) in 'Distribution.Simple.Test.LibV09'
  2007. 700.43 s [Cabal] Missing documentation for:
  2008. 700.43 s [Cabal] Module header
  2009. 700.43 s [Cabal] runTest (src/Distribution/Simple/Test/LibV09.hs:65)
  2010. 700.43 s [Cabal] 0% ( 0 / 2) in 'Distribution.Simple.Test.ExeV10'
  2011. 700.43 s [Cabal] Missing documentation for:
  2012. 700.43 s [Cabal] Module header
  2013. 700.43 s [Cabal] runTest (src/Distribution/Simple/Test/ExeV10.hs:59)
  2014. 700.43 s [Cabal] Warning: 'dist' is out of scope.
  2015. 700.43 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2016. 700.43 s [Cabal] Warning: 'PackageDescription' is ambiguous. It is defined
  2017. 700.43 s [Cabal] * in ‘Distribution.Types.PackageDescription’
  2018. 700.43 s [Cabal] * in ‘Distribution.Types.PackageDescription’
  2019. 700.43 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  2020. 700.43 s [Cabal] by specifying the type/value namespace explicitly.
  2021. 700.43 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.PackageDescription’
  2022. 700.43 s [Cabal] Warning: 'CheckPackageContentOps' is ambiguous. It is defined
  2023. 700.43 s [Cabal] * at src/Distribution/PackageDescription/Check/Monad.hs:92:33
  2024. 700.43 s [Cabal] * at src/Distribution/PackageDescription/Check/Monad.hs:92:1
  2025. 700.43 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  2026. 700.43 s [Cabal] by specifying the type/value namespace explicitly.
  2027. 700.43 s [Cabal] Defaulting to the one defined at src/Distribution/PackageDescription/Check/Monad.hs:92:1
  2028. 700.43 s [Cabal] Warning: 'GenericPackageDescription' is ambiguous. It is defined
  2029. 700.43 s [Cabal] * in ‘Distribution.Types.GenericPackageDescription’
  2030. 700.43 s [Cabal] * in ‘Distribution.Types.GenericPackageDescription’
  2031. 700.43 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  2032. 700.43 s [Cabal] by specifying the type/value namespace explicitly.
  2033. 700.43 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.GenericPackageDescription’
  2034. 700.43 s [Cabal] 89% ( 17 / 19) in 'Distribution.PackageDescription.Check'
  2035. 700.43 s [Cabal] Missing documentation for:
  2036. 700.43 s [Cabal] CheckExplanationIDString (src/Distribution/PackageDescription/Check/Warning.hs:590)
  2037. 700.43 s [Cabal] ppCheckExplanationId (src/Distribution/PackageDescription/Check/Warning.hs:597)
  2038. 700.43 s [Cabal] 66% ( 4 / 6) in 'Distribution.Make'
  2039. 700.43 s [Cabal] Missing documentation for:
  2040. 700.43 s [Cabal] defaultMain (src/Distribution/Make.hs:85)
  2041. 700.43 s [Cabal] defaultMainArgs (src/Distribution/Make.hs:88)
  2042. 700.43 s [Cabal] Warning: 'ModTime' is ambiguous. It is defined
  2043. 700.43 s [Cabal] * at src/Distribution/Compat/Time.hs:60:19
  2044. 700.43 s [Cabal] * at src/Distribution/Compat/Time.hs:60:1
  2045. 700.43 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  2046. 700.43 s [Cabal] by specifying the type/value namespace explicitly.
  2047. 700.43 s [Cabal] Defaulting to the one defined at src/Distribution/Compat/Time.hs:60:1
  2048. 700.43 s [Cabal] Warning: 'sleepFileTimeCalibrate' is out of scope.
  2049. 700.43 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2050. 700.43 s [Cabal] 85% ( 6 / 7) in 'Distribution.Compat.Time'
  2051. 700.43 s [Cabal] Missing documentation for:
  2052. 700.43 s [Cabal] Module header
  2053. 700.44 s [Cabal] Warning: 'InstM' is ambiguous. It is defined
  2054. 700.44 s [Cabal] * at src/Distribution/Backpack/ReadyComponent.hs:205:19
  2055. 700.44 s [Cabal] * at src/Distribution/Backpack/ReadyComponent.hs:205:1
  2056. 700.44 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  2057. 700.44 s [Cabal] by specifying the type/value namespace explicitly.
  2058. 700.44 s [Cabal] Defaulting to the one defined at src/Distribution/Backpack/ReadyComponent.hs:205:1
  2059. 700.44 s [Cabal] Warning: 'IndefiniteComponent' is ambiguous. It is defined
  2060. 700.44 s [Cabal] * at src/Distribution/Backpack/ReadyComponent.hs:110:28
  2061. 700.44 s [Cabal] * at src/Distribution/Backpack/ReadyComponent.hs:110:1
  2062. 700.44 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  2063. 700.44 s [Cabal] by specifying the type/value namespace explicitly.
  2064. 700.44 s [Cabal] Defaulting to the one defined at src/Distribution/Backpack/ReadyComponent.hs:110:1
  2065. 700.44 s [Cabal] Warning: 'InstantiatedComponent' is ambiguous. It is defined
  2066. 700.44 s [Cabal] * at src/Distribution/Backpack/ReadyComponent.hs:93:30
  2067. 700.44 s [Cabal] * at src/Distribution/Backpack/ReadyComponent.hs:93:1
  2068. 700.44 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  2069. 700.44 s [Cabal] by specifying the type/value namespace explicitly.
  2070. 700.44 s [Cabal] Defaulting to the one defined at src/Distribution/Backpack/ReadyComponent.hs:93:1
  2071. 700.44 s [Cabal] Warning: 'componentPackageDeps' is out of scope.
  2072. 700.44 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2073. 700.44 s [Cabal] Warning: 'ReadyComponent' is ambiguous. It is defined
  2074. 700.44 s [Cabal] * at src/Distribution/Backpack/ReadyComponent.hs:55:23
  2075. 700.44 s [Cabal] * at src/Distribution/Backpack/ReadyComponent.hs:55:1
  2076. 700.44 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  2077. 700.44 s [Cabal] by specifying the type/value namespace explicitly.
  2078. 700.44 s [Cabal] Defaulting to the one defined at src/Distribution/Backpack/ReadyComponent.hs:55:1
  2079. 700.44 s [Cabal] Warning: 'OpenModule' is ambiguous. It is defined
  2080. 700.44 s [Cabal] * in ‘Distribution.Backpack’
  2081. 700.44 s [Cabal] * in ‘Distribution.Backpack’
  2082. 700.44 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  2083. 700.44 s [Cabal] by specifying the type/value namespace explicitly.
  2084. 700.44 s [Cabal] Defaulting to the one defined in ‘Distribution.Backpack’
  2085. 700.44 s [Cabal] Warning: 'InstalledPackageInfo' is out of scope.
  2086. 700.44 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2087. 700.44 s [Cabal] Warning: 'MungedPackageId' is ambiguous. It is defined
  2088. 700.44 s [Cabal] * in ‘Distribution.Types.MungedPackageId’
  2089. 700.44 s [Cabal] * in ‘Distribution.Types.MungedPackageId’
  2090. 700.44 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  2091. 700.44 s [Cabal] by specifying the type/value namespace explicitly.
  2092. 700.44 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.MungedPackageId’
  2093. 700.44 s [Cabal] Warning: 'LinkedComponent' is ambiguous. It is defined
  2094. 700.44 s [Cabal] * at src/Distribution/Backpack/LinkedComponent.hs:50:24
  2095. 700.44 s [Cabal] * at src/Distribution/Backpack/LinkedComponent.hs:50:1
  2096. 700.44 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  2097. 700.44 s [Cabal] by specifying the type/value namespace explicitly.
  2098. 700.44 s [Cabal] Defaulting to the one defined at src/Distribution/Backpack/LinkedComponent.hs:50:1
  2099. 700.44 s [Cabal] Warning: 'improveUnitId' is out of scope.
  2100. 700.44 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2101. 700.44 s [Cabal] Warning: 'HashedUnitId' is out of scope.
  2102. 700.44 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2103. 700.44 s [Cabal] 50% ( 1 / 2) in 'Distribution.Backpack.Configure'
  2104. 700.44 s [Cabal] Missing documentation for:
  2105. 700.44 s [Cabal] configureComponentLocalBuildInfos (src/Distribution/Backpack/Configure.hs:79)
  2106. 700.44 s [Cabal] Warning: 'OpenModule' is out of scope.
  2107. 700.44 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2108. 700.44 s [Cabal] Warning: 'Module' is out of scope.
  2109. 700.44 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2110. 700.44 s [Cabal] 50% ( 1 / 2) in 'Distribution.Backpack.DescribeUnitId'
  2111. 700.44 s [Cabal] Missing documentation for:
  2112. 700.44 s [Cabal] Module header
  2113. 700.44 s [Cabal] 52% ( 9 / 17) in 'Distribution.Simple.Register'
  2114. 700.44 s [Cabal] Missing documentation for:
  2115. 700.44 s [Cabal] register (src/Distribution/Simple/Register.hs:99)
  2116. 700.44 s [Cabal] unregister (src/Distribution/Simple/Register.hs:703)
  2117. 700.44 s [Cabal] internalPackageDBPath (src/Distribution/Simple/Register.hs:738)
  2118. 700.44 s [Cabal] initPackageDB (src/Distribution/Simple/Register.hs:355)
  2119. 700.44 s [Cabal] doesPackageDBExist (src/Distribution/Simple/Register.hs:375)
  2120. 700.44 s [Cabal] deletePackageDB (src/Distribution/Simple/Register.hs:383)
  2121. 700.44 s [Cabal] registerPackage (src/Distribution/Simple/Register.hs:430)
  2122. 700.44 s [Cabal] generateRegistrationInfo (src/Distribution/Simple/Register.hs:261)
  2123. 700.44 s [Cabal] Warning: 'PreProcessor' is ambiguous. It is defined
  2124. 700.44 s [Cabal] * at src/Distribution/Simple/PreProcess/Types.hs:69:21
  2125. 700.44 s [Cabal] * at src/Distribution/Simple/PreProcess/Types.hs:69:1
  2126. 700.44 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  2127. 700.44 s [Cabal] by specifying the type/value namespace explicitly.
  2128. 700.44 s [Cabal] Defaulting to the one defined at src/Distribution/Simple/PreProcess/Types.hs:69:1
  2129. 700.44 s [Cabal] Warning: 'Suffix' is ambiguous. It is defined
  2130. 700.44 s [Cabal] * at src/Distribution/Simple/PreProcess/Types.hs:101:18
  2131. 700.44 s [Cabal] * at src/Distribution/Simple/PreProcess/Types.hs:101:1
  2132. 700.44 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  2133. 700.44 s [Cabal] by specifying the type/value namespace explicitly.
  2134. 700.44 s [Cabal] Defaulting to the one defined at src/Distribution/Simple/PreProcess/Types.hs:101:1
  2135. 700.44 s [Cabal] 40% ( 9 / 22) in 'Distribution.Simple.PreProcess'
  2136. 700.44 s [Cabal] Missing documentation for:
  2137. 700.44 s [Cabal] builtinHaskellSuffixes (src/Distribution/Simple/PreProcess/Types.hs:111)
  2138. 700.44 s [Cabal] builtinHaskellBootSuffixes (src/Distribution/Simple/PreProcess/Types.hs:114)
  2139. 700.44 s [Cabal] mkSimplePreProcessor (src/Distribution/Simple/PreProcess.hs:109)
  2140. 700.44 s [Cabal] runSimplePreProcessor (src/Distribution/Simple/PreProcess.hs:124)
  2141. 700.44 s [Cabal] ppCpp (src/Distribution/Simple/PreProcess.hs:407)
  2142. 700.44 s [Cabal] ppCpp' (src/Distribution/Simple/PreProcess.hs:410)
  2143. 700.44 s [Cabal] ppGreenCard (src/Distribution/Simple/PreProcess.hs:382)
  2144. 700.44 s [Cabal] ppC2hs (src/Distribution/Simple/PreProcess.hs:651)
  2145. 700.44 s [Cabal] ppHsc2hs (src/Distribution/Simple/PreProcess.hs:476)
  2146. 700.44 s [Cabal] ppHappy (src/Distribution/Simple/PreProcess.hs:813)
  2147. 700.44 s [Cabal] ppAlex (src/Distribution/Simple/PreProcess.hs:822)
  2148. 700.44 s [Cabal] ppUnlit (src/Distribution/Simple/PreProcess.hs:397)
  2149. 700.44 s [Cabal] platformDefines (src/Distribution/Simple/PreProcess.hs:720)
  2150. 700.44 s [Cabal] Warning: 'UserHooks' is ambiguous. It is defined
  2151. 700.44 s [Cabal] * at src/Distribution/Simple/UserHooks.hs:53:18
  2152. 700.44 s [Cabal] * at src/Distribution/Simple/UserHooks.hs:53:1
  2153. 700.45 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  2154. 700.45 s [Cabal] by specifying the type/value namespace explicitly.
  2155. 700.45 s [Cabal] Defaulting to the one defined at src/Distribution/Simple/UserHooks.hs:53:1
  2156. 700.45 s [Cabal] 75% ( 3 / 4) in 'Distribution.Simple.UserHooks'
  2157. 700.45 s [Cabal] Missing documentation for:
  2158. 700.45 s [Cabal] Args (src/Distribution/Simple/UserHooks.hs:45)
  2159. 700.45 s [Cabal] 100% ( 2 / 2) in 'Distribution.Simple.Bench'
  2160. 700.45 s [Cabal] Warning: 'BuildInfo' is ambiguous. It is defined
  2161. 700.45 s [Cabal] * in ‘Distribution.Types.BuildInfo’
  2162. 700.45 s [Cabal] * in ‘Distribution.Types.BuildInfo’
  2163. 700.45 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  2164. 700.45 s [Cabal] by specifying the type/value namespace explicitly.
  2165. 700.45 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.BuildInfo’
  2166. 700.45 s [Cabal] Warning: 'LocalBuildInfo' is ambiguous. It is defined
  2167. 700.45 s [Cabal] * at src/Distribution/Types/LocalBuildInfo.hs:180:1
  2168. 700.45 s [Cabal] * at src/Distribution/Types/LocalBuildInfo.hs:129:1
  2169. 700.45 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  2170. 700.45 s [Cabal] by specifying the type/value namespace explicitly.
  2171. 700.45 s [Cabal] Defaulting to the one defined at src/Distribution/Types/LocalBuildInfo.hs:129:1
  2172. 700.45 s [Cabal] Warning: 'UserHooks' is out of scope.
  2173. 700.45 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2174. 700.45 s [Cabal] Warning: 'ConfigFlags' is ambiguous. It is defined
  2175. 700.45 s [Cabal] * at src/Distribution/Simple/Setup/Config.hs:78:20
  2176. 700.45 s [Cabal] * at src/Distribution/Simple/Setup/Config.hs:78:1
  2177. 700.45 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  2178. 700.45 s [Cabal] by specifying the type/value namespace explicitly.
  2179. 700.45 s [Cabal] Defaulting to the one defined at src/Distribution/Simple/Setup/Config.hs:78:1
  2180. 700.45 s [Cabal] Warning: 'Compiler' is ambiguous. It is defined
  2181. 700.45 s [Cabal] * at src/Distribution/Simple/Compiler.hs:91:17
  2182. 700.45 s [Cabal] * at src/Distribution/Simple/Compiler.hs:91:1
  2183. 700.45 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  2184. 700.45 s [Cabal] by specifying the type/value namespace explicitly.
  2185. 700.45 s [Cabal] Defaulting to the one defined at src/Distribution/Simple/Compiler.hs:91:1
  2186. 700.46 s [Cabal] 85% ( 23 / 27) in 'Distribution.Simple.Configure'
  2187. 700.46 s [Cabal] Missing documentation for:
  2188. 700.46 s [Cabal] configCompilerEx (src/Distribution/Simple/Configure.hs:2274)
  2189. 700.46 s [Cabal] configCompilerAuxEx (src/Distribution/Simple/Configure.hs:2258)
  2190. 700.46 s [Cabal] checkForeignDeps (src/Distribution/Simple/Configure.hs:2293)
  2191. 700.46 s [Cabal] platformDefines (src/Distribution/Simple/PreProcess.hs:720)
  2192. 700.46 s [Cabal] 100% ( 2 / 2) in 'Distribution.Simple.Test'
  2193. 700.46 s [Cabal] Warning: 'die' is out of scope.
  2194. 700.46 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2195. 700.46 s [Cabal] Warning: 'PackageDescription' is ambiguous. It is defined
  2196. 700.46 s [Cabal] * in ‘Distribution.Types.PackageDescription’
  2197. 700.46 s [Cabal] * in ‘Distribution.Types.PackageDescription’
  2198. 700.46 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  2199. 700.46 s [Cabal] by specifying the type/value namespace explicitly.
  2200. 700.46 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.PackageDescription’
  2201. 700.46 s [Cabal] Warning: 'errorPrefix' is out of scope.
  2202. 700.46 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2203. 700.46 s [Cabal] 100% ( 15 / 15) in 'Distribution.Simple.SrcDist'
  2204. 700.46 s [Cabal] Warning: 'LocalBuildInfo' is ambiguous. It is defined
  2205. 700.46 s [Cabal] * at src/Distribution/Types/LocalBuildInfo.hs:180:1
  2206. 700.46 s [Cabal] * at src/Distribution/Types/LocalBuildInfo.hs:129:1
  2207. 700.46 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  2208. 700.46 s [Cabal] by specifying the type/value namespace explicitly.
  2209. 700.46 s [Cabal] Defaulting to the one defined at src/Distribution/Types/LocalBuildInfo.hs:129:1
  2210. 700.46 s [Cabal] Warning: 'TestSuite' is ambiguous. It is defined
  2211. 700.46 s [Cabal] * in ‘Distribution.Types.TestSuite’
  2212. 700.46 s [Cabal] * in ‘Distribution.Types.TestSuite’
  2213. 700.46 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  2214. 700.46 s [Cabal] by specifying the type/value namespace explicitly.
  2215. 700.46 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.TestSuite’
  2216. 700.46 s [Cabal] Warning: 'Benchmark' is ambiguous. It is defined
  2217. 700.46 s [Cabal] * in ‘Distribution.Types.Benchmark’
  2218. 700.46 s [Cabal] * in ‘Distribution.Types.Benchmark’
  2219. 700.46 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  2220. 700.46 s [Cabal] by specifying the type/value namespace explicitly.
  2221. 700.46 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.Benchmark’
  2222. 700.46 s [Cabal] Warning: 'autogenComponentsModuleDir' is out of scope.
  2223. 700.46 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2224. 700.46 s [Cabal] 88% ( 15 / 17) in 'Distribution.Simple.Build'
  2225. 700.46 s [Cabal] Missing documentation for:
  2226. 700.46 s [Cabal] repl (src/Distribution/Simple/Build.hs:278)
  2227. 700.46 s [Cabal] AutogenFile (src/Distribution/Simple/Build.hs:1078)
  2228. 700.46 s [Cabal] Warning: 'haddocks' is out of scope.
  2229. 700.46 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2230. 700.47 s [Cabal] Warning: 'Haddock' is out of scope.
  2231. 700.47 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2232. 700.47 s [Cabal] Warning: 'HaddocksFlags' is out of scope.
  2233. 700.47 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2234. 700.47 s [Cabal] 66% ( 4 / 6) in 'Distribution.Simple.Haddock'
  2235. 700.47 s [Cabal] Missing documentation for:
  2236. 700.47 s [Cabal] haddock (src/Distribution/Simple/Haddock.hs:213)
  2237. 700.47 s [Cabal] hscolour (src/Distribution/Simple/Haddock.hs:1125)
  2238. 700.47 s [Cabal] Warning: 'UserHooks' is ambiguous. It is defined
  2239. 700.47 s [Cabal] * at src/Distribution/Simple/UserHooks.hs:53:18
  2240. 700.47 s [Cabal] * at src/Distribution/Simple/UserHooks.hs:53:1
  2241. 700.47 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  2242. 700.47 s [Cabal] by specifying the type/value namespace explicitly.
  2243. 700.47 s [Cabal] Defaulting to the one defined at src/Distribution/Simple/UserHooks.hs:53:1
  2244. 700.47 s [Cabal] 95% ( 20 / 21) in 'Distribution.Simple'
  2245. 700.47 s [Cabal] Missing documentation for:
  2246. 700.47 s [Cabal] Args (src/Distribution/Simple/UserHooks.hs:45)
  2247. 700.71 s [Cabal] Warning: Distribution.Backpack.FullUnitId: could not find link destinations for:
  2248. 700.94 s [Cabal] - Distribution.Backpack.FullUnitId.Rep_FullUnitId
  2249. 700.94 s [Cabal] Warning: Distribution.Backpack.ModuleShape: could not find link destinations for:
  2250. 700.94 s [Cabal] - Distribution.Utils.Structured.Tagged
  2251. 700.94 s [Cabal] - Distribution.Utils.Structured.structureHash'
  2252. 700.94 s [Cabal] - Distribution.Backpack.ModuleShape.Rep_ModuleShape
  2253. 700.94 s [Cabal] Warning: Distribution.Backpack.PreModuleShape: could not find link destinations for:
  2254. 700.94 s [Cabal] - Distribution.Backpack.PreModuleShape.Rep_PreModuleShape
  2255. 700.94 s [Cabal] Warning: Distribution.Compat.Stack: could not find link destinations for:
  2256. 700.94 s [Cabal] - GHC.IsList.D:R:ItemCallStack
  2257. 700.94 s [Cabal] Warning: Distribution.ReadE: could not find link destinations for:
  2258. 700.94 s [Cabal] - Distribution.ReadE.ErrorMsg
  2259. 700.94 s [Cabal] Warning: Distribution.Simple.Flag: could not find link destinations for:
  2260. 700.94 s [Cabal] - Distribution.Utils.Structured.Tagged
  2261. 700.94 s [Cabal] - Distribution.Utils.Structured.structureHash'
  2262. 700.94 s [Cabal] - Distribution.Simple.Flag.Rep_Flag
  2263. 700.94 s [Cabal] Warning: Distribution.Simple.InstallDirs.Internal: could not find link destinations for:
  2264. 700.94 s [Cabal] - Distribution.Utils.Structured.Tagged
  2265. 700.94 s [Cabal] - Distribution.Utils.Structured.structureHash'
  2266. 700.94 s [Cabal] - Distribution.Simple.InstallDirs.Internal.Rep_PathComponent
  2267. 700.95 s [Cabal] - Distribution.Simple.InstallDirs.Internal.Rep_PathTemplateVariable
  2268. 700.95 s [Cabal] Warning: Distribution.Simple.InstallDirs: could not find link destinations for:
  2269. 700.95 s [Cabal] - Distribution.Utils.Structured.Tagged
  2270. 700.95 s [Cabal] - Distribution.Utils.Structured.structureHash'
  2271. 700.95 s [Cabal] - Distribution.Simple.InstallDirs.Internal.Rep_PathTemplateVariable
  2272. 700.95 s [Cabal] - Distribution.Simple.InstallDirs.Rep_PathTemplate
  2273. 700.95 s [Cabal] - Distribution.Simple.InstallDirs.Rep_CopyDest
  2274. 700.95 s [Cabal] - Distribution.Simple.InstallDirs.Rep_InstallDirs
  2275. 700.95 s [Cabal] Warning: Distribution.Types.ComponentLocalBuildInfo: could not find link destinations for:
  2276. 700.95 s [Cabal] - Distribution.Utils.Structured.Tagged
  2277. 700.95 s [Cabal] - Distribution.Utils.Structured.structureHash'
  2278. 700.95 s [Cabal] - Distribution.Types.ComponentLocalBuildInfo.D:R:KeyComponentLocalBuildInfo
  2279. 700.95 s [Cabal] - Distribution.Types.ComponentLocalBuildInfo.Rep_ComponentLocalBuildInfo
  2280. 700.95 s [Cabal] Warning: Distribution.Types.DumpBuildInfo: could not find link destinations for:
  2281. 700.95 s [Cabal] - Distribution.Utils.Structured.Tagged
  2282. 700.95 s [Cabal] - Distribution.Utils.Structured.structureHash'
  2283. 700.95 s [Cabal] - Distribution.Types.DumpBuildInfo.Rep_DumpBuildInfo
  2284. 700.95 s [Cabal] Warning: Distribution.Types.GivenComponent: could not find link destinations for:
  2285. 700.95 s [Cabal] - Distribution.Utils.Structured.Tagged
  2286. 700.95 s [Cabal] - Distribution.Utils.Structured.structureHash'
  2287. 700.95 s [Cabal] - Distribution.Types.GivenComponent.Rep_GivenComponent
  2288. 700.95 s [Cabal] Warning: Distribution.Types.TargetInfo: could not find link destinations for:
  2289. 700.95 s [Cabal] - Distribution.Utils.Structured.Tagged
  2290. 700.95 s [Cabal] - Distribution.Utils.Structured.structureHash'
  2291. 700.95 s [Cabal] - Distribution.Types.TargetInfo.D:R:KeyTargetInfo
  2292. 700.95 s [Cabal] - Distribution.Types.TargetInfo.Rep_TargetInfo
  2293. 700.95 s [Cabal] Warning: Distribution.Verbosity.Internal: could not find link destinations for:
  2294. 700.95 s [Cabal] - Distribution.Utils.Structured.Tagged
  2295. 700.95 s [Cabal] - Distribution.Utils.Structured.structureHash'
  2296. 700.95 s [Cabal] - Distribution.Verbosity.Internal.Rep_VerbosityFlag
  2297. 700.95 s [Cabal] - Distribution.Verbosity.Internal.Rep_VerbosityLevel
  2298. 700.95 s [Cabal] Warning: Distribution.Verbosity: could not find link destinations for:
  2299. 700.95 s [Cabal] - Distribution.Utils.Structured.Tagged
  2300. 700.95 s [Cabal] - Distribution.Utils.Structured.structureHash'
  2301. 700.95 s [Cabal] - Distribution.Verbosity.Rep_Verbosity
  2302. 700.95 s [Cabal] Warning: Distribution.Simple.Program.Types: could not find link destinations for:
  2303. 700.95 s [Cabal] - Distribution.Utils.Structured.Tagged
  2304. 700.95 s [Cabal] - Distribution.Utils.Structured.structureHash'
  2305. 700.95 s [Cabal] - Distribution.Simple.Program.Types.Rep_ConfiguredProgram
  2306. 700.95 s [Cabal] - Distribution.Simple.Program.Types.Rep_ProgramLocation
  2307. 700.95 s [Cabal] - Distribution.Simple.Program.Types.Rep_ProgramSearchPathEntry
  2308. 700.95 s [Cabal] Warning: Distribution.Simple.PreProcess.Types: could not find link destinations for:
  2309. 700.95 s [Cabal] - Distribution.Utils.Structured.Tagged
  2310. 700.95 s [Cabal] - Distribution.Utils.Structured.structureHash'
  2311. 700.95 s [Cabal] - Distribution.Simple.PreProcess.Types.Rep_Suffix
  2312. 701.01 s [Cabal] Warning: Distribution.Simple.Utils: could not find link destinations for:
  2313. 701.01 s [Cabal] - Distribution.Simple.Utils.withMetadata
  2314. 701.01 s [Cabal] Warning: Distribution.Utils.NubList: could not find link destinations for:
  2315. 701.01 s [Cabal] - Distribution.Utils.Structured.Tagged
  2316. 701.01 s [Cabal] - Distribution.Utils.Structured.structureHash'
  2317. 701.01 s [Cabal] - Distribution.Utils.NubList.Rep_NubList
  2318. 701.01 s [Cabal] Warning: Distribution.Utils.LogProgress: could not find link destinations for:
  2319. 701.01 s [Cabal] - Distribution.Utils.LogProgress.CtxMsg
  2320. 701.01 s [Cabal] Warning: Distribution.Simple.Program.Find: could not find link destinations for:
  2321. 701.01 s [Cabal] - Distribution.Utils.Structured.Tagged
  2322. 701.01 s [Cabal] - Distribution.Utils.Structured.structureHash'
  2323. 701.01 s [Cabal] - Distribution.Simple.Program.Types.Rep_ProgramSearchPathEntry
  2324. 701.01 s [Cabal] - Distribution.Simple.Program.Find.findExecutable
  2325. 701.01 s [Cabal] Warning: Distribution.Simple.PackageIndex: could not find link destinations for:
  2326. 701.01 s [Cabal] - Distribution.Utils.Structured.Tagged
  2327. 701.01 s [Cabal] - Distribution.Utils.Structured.structureHash'
  2328. 701.01 s [Cabal] - Distribution.Simple.PackageIndex.DepUniqueKey
  2329. 701.01 s [Cabal] - Distribution.Simple.PackageIndex.Rep_PackageIndex
  2330. 701.01 s [Cabal] Warning: Distribution.Simple.Glob.Internal: could not find link destinations for:
  2331. 701.01 s [Cabal] - Distribution.Utils.Structured.Tagged
  2332. 701.01 s [Cabal] - Distribution.Utils.Structured.structureHash'
  2333. 701.01 s [Cabal] - Distribution.Simple.Glob.Internal.Rep_Glob
  2334. 701.01 s [Cabal] - Distribution.Simple.Glob.Internal.Rep_GlobPiece
  2335. 701.01 s [Cabal] Warning: Distribution.Simple.Glob: could not find link destinations for:
  2336. 701.01 s [Cabal] - Distribution.Utils.Structured.Tagged
  2337. 701.01 s [Cabal] - Distribution.Utils.Structured.structureHash'
  2338. 701.01 s [Cabal] - Distribution.Simple.Glob.Internal.Rep_Glob
  2339. 701.01 s [Cabal] Warning: Distribution.Simple.Compiler: could not find link destinations for:
  2340. 701.01 s [Cabal] - Distribution.Utils.Structured.Tagged
  2341. 701.01 s [Cabal] - Distribution.Utils.Structured.structureHash'
  2342. 701.01 s [Cabal] - Distribution.Simple.Compiler.Rep_ProfDetailLevel
  2343. 701.01 s [Cabal] - Distribution.Simple.Compiler.Rep_Compiler
  2344. 701.01 s [Cabal] - Distribution.Simple.Compiler.Rep_DebugInfoLevel
  2345. 701.01 s [Cabal] - Distribution.Simple.Compiler.Rep_OptimisationLevel
  2346. 701.02 s [Cabal] - Distribution.Simple.Compiler.Rep_PackageDB
  2347. 701.02 s [Cabal] Warning: Distribution.Simple.Program.GHC: could not find link destinations for:
  2348. 701.02 s [Cabal] - Distribution.Simple.Program.GHC.Rep_GhcOptions
  2349. 701.02 s [Cabal] Warning: Distribution.Simple.Program.Db: could not find link destinations for:
  2350. 701.02 s [Cabal] - Distribution.Utils.Structured.Tagged
  2351. 701.02 s [Cabal] - Distribution.Utils.Structured.structureHash'
  2352. 701.02 s [Cabal] Warning: Distribution.Simple.Program: could not find link destinations for:
  2353. 701.02 s [Cabal] - Distribution.Utils.Structured.Tagged
  2354. 701.02 s [Cabal] - Distribution.Utils.Structured.structureHash'
  2355. 701.02 s [Cabal] - Distribution.Simple.Program.Types.Rep_ConfiguredProgram
  2356. 701.02 s [Cabal] - Distribution.Simple.Program.Types.Rep_ProgramLocation
  2357. 701.02 s [Cabal] - Distribution.Simple.Program.Types.Rep_ProgramSearchPathEntry
  2358. 701.03 s [Cabal] Warning: Distribution.Types.LocalBuildConfig: could not find link destinations for:
  2359. 701.03 s [Cabal] - Distribution.Utils.Structured.Tagged
  2360. 701.03 s [Cabal] - Distribution.Utils.Structured.structureHash'
  2361. 701.03 s [Cabal] - Distribution.Types.LocalBuildConfig.Rep_LocalBuildConfig
  2362. 701.03 s [Cabal] - Distribution.Types.LocalBuildConfig.Rep_BuildOptions
  2363. 701.03 s [Cabal] - Distribution.Types.LocalBuildConfig.Rep_LocalBuildDescr
  2364. 701.03 s [Cabal] - Distribution.Types.LocalBuildConfig.Rep_ComponentBuildDescr
  2365. 701.03 s [Cabal] - Distribution.Types.LocalBuildConfig.Rep_PackageBuildDescr
  2366. 701.03 s [Cabal] Warning: Distribution.Types.LocalBuildInfo: could not find link destinations for:
  2367. 701.03 s [Cabal] - Distribution.Utils.Structured.Tagged
  2368. 701.03 s [Cabal] - Distribution.Utils.Structured.structureHash'
  2369. 701.03 s [Cabal] - Distribution.Types.LocalBuildInfo.Rep_LocalBuildInfo
  2370. 701.04 s [Cabal] Warning: Distribution.Simple.LocalBuildInfo: could not find link destinations for:
  2371. 701.04 s [Cabal] - Distribution.Utils.Structured.Tagged
  2372. 701.04 s [Cabal] - Distribution.Utils.Structured.structureHash'
  2373. 701.04 s [Cabal] - Distribution.Types.LibraryName.Rep_LibraryName
  2374. 701.04 s [Cabal] - Distribution.Types.ComponentName.NotLibComponentName
  2375. 701.04 s [Cabal] - Distribution.Types.ComponentName.Rep_ComponentName
  2376. 701.04 s [Cabal] - Distribution.Simple.InstallDirs.Internal.Rep_PathTemplateVariable
  2377. 701.04 s [Cabal] - Distribution.Simple.InstallDirs.Rep_PathTemplate
  2378. 701.04 s [Cabal] - Distribution.Simple.InstallDirs.Rep_CopyDest
  2379. 701.04 s [Cabal] - Distribution.Simple.InstallDirs.Rep_InstallDirs
  2380. 701.04 s [Cabal] - Distribution.Types.ComponentLocalBuildInfo.D:R:KeyComponentLocalBuildInfo
  2381. 701.04 s [Cabal] - Distribution.Types.ComponentLocalBuildInfo.Rep_ComponentLocalBuildInfo
  2382. 701.04 s [Cabal] - Distribution.Types.Component.Rep_Component
  2383. 701.04 s [Cabal] - Distribution.Types.LocalBuildInfo.Rep_LocalBuildInfo
  2384. 701.06 s [Cabal] Warning: Distribution.Simple.Setup: could not find link destinations for:
  2385. 701.06 s [Cabal] - Distribution.Utils.Structured.Tagged
  2386. 701.06 s [Cabal] - Distribution.Utils.Structured.structureHash'
  2387. 701.06 s [Cabal] - Distribution.Simple.Flag.Rep_Flag
  2388. 701.06 s [Cabal] - Distribution.Simple.InstallDirs.Rep_CopyDest
  2389. 701.06 s [Cabal] - Distribution.Types.DumpBuildInfo.Rep_DumpBuildInfo
  2390. 701.06 s [Cabal] - Distribution.Simple.Setup.Common.programDbPaths
  2391. 701.06 s [Cabal] - Distribution.Simple.Setup.Test.Rep_TestFlags
  2392. 701.06 s [Cabal] - Distribution.Simple.Setup.Test.Rep_TestShowDetails
  2393. 701.06 s [Cabal] - Distribution.Simple.Setup.SDist.Rep_SDistFlags
  2394. 701.06 s [Cabal] - Distribution.Simple.Setup.Repl.Rep_ReplFlags
  2395. 701.06 s [Cabal] - Distribution.Simple.Setup.Repl.Rep_ReplOptions
  2396. 701.06 s [Cabal] - Distribution.Simple.Setup.Register.Rep_RegisterFlags
  2397. 701.06 s [Cabal] - Distribution.Simple.Setup.Install.Rep_InstallFlags
  2398. 701.06 s [Cabal] - Distribution.Simple.Setup.Hscolour.Rep_HscolourFlags
  2399. 701.06 s [Cabal] - Distribution.Simple.Setup.Haddock.Rep_HaddockProjectFlags
  2400. 701.06 s [Cabal] - Distribution.Simple.Setup.Haddock.Rep_HaddockFlags
  2401. 701.06 s [Cabal] - Distribution.Simple.Setup.Haddock.Rep_HaddockTarget
  2402. 701.06 s [Cabal] - Distribution.Simple.Setup.Global.Rep_GlobalFlags
  2403. 701.06 s [Cabal] - Distribution.Simple.Setup.Copy.Rep_CopyFlags
  2404. 701.06 s [Cabal] - Distribution.Simple.Setup.Config.Rep_ConfigFlags
  2405. 701.06 s [Cabal] - Distribution.Simple.Setup.Clean.Rep_CleanFlags
  2406. 701.06 s [Cabal] - Distribution.Simple.Setup.Build.Rep_BuildFlags
  2407. 701.06 s [Cabal] - Distribution.Simple.Setup.Benchmark.Rep_BenchmarkFlags
  2408. 701.06 s [Cabal] - Distribution.Simple.Setup.Rep_BuildingWhat
  2409. 701.06 s [Cabal] Warning: Distribution.Simple.Build.Inputs: could not find link destinations for:
  2410. 701.06 s [Cabal] - Distribution.Utils.Structured.Tagged
  2411. 701.06 s [Cabal] - Distribution.Utils.Structured.structureHash'
  2412. 701.06 s [Cabal] - Distribution.Types.TargetInfo.D:R:KeyTargetInfo
  2413. 701.06 s [Cabal] - Distribution.Types.TargetInfo.Rep_TargetInfo
  2414. 701.06 s [Cabal] - Distribution.Types.LocalBuildInfo.Rep_LocalBuildInfo
  2415. 701.06 s [Cabal] - Distribution.Simple.Setup.Rep_BuildingWhat
  2416. 701.06 s [Cabal] Warning: Distribution.Simple.BuildTarget: could not find link destinations for:
  2417. 701.06 s [Cabal] - Distribution.Simple.BuildTarget.Rep_BuildTarget
  2418. 701.07 s [Cabal] Warning: Distribution.PackageDescription.Check: could not find link destinations for:
  2419. 701.07 s [Cabal] - Distribution.PackageDescription.Check.Warning.WarnLang
  2420. 701.07 s [Cabal] - Distribution.PackageDescription.Check.Warning.CEType
  2421. 701.07 s [Cabal] Warning: Distribution.Make: could not find link destinations for:
  2422. 701.07 s [Cabal] - Distribution.Types.InstalledPackageInfo.FieldGrammar.SpecLicenseLenient
  2423. 701.07 s [Cabal] - Distribution.Types.Version.Rep_Version
  2424. 701.07 s [Cabal] - Distribution.Utils.Structured.Tagged
  2425. 701.07 s [Cabal] - Distribution.Utils.Structured.structureHash'
  2426. 701.07 s [Cabal] - Distribution.License.Rep_License
  2427. 701.07 s [Cabal] Warning: Distribution.Compat.Time: could not find link destinations for:
  2428. 701.07 s [Cabal] - Distribution.Utils.Structured.Tagged
  2429. 701.07 s [Cabal] - Distribution.Utils.Structured.structureHash'
  2430. 701.07 s [Cabal] - Distribution.Compat.Time.Rep_ModTime
  2431. 701.07 s [Cabal] Warning: Distribution.Backpack.Configure: could not find link destinations for:
  2432. 701.07 s [Cabal] - Distribution.Backpack.PreExistingComponent.PreExistingComponent
  2433. 701.07 s [Cabal] - Distribution.Backpack.PreExistingComponent.PromisedComponent
  2434. 701.07 s [Cabal] Warning: Distribution.Simple.PreProcess: could not find link destinations for:
  2435. 701.07 s [Cabal] - Distribution.Utils.Structured.Tagged
  2436. 701.07 s [Cabal] - Distribution.Utils.Structured.structureHash'
  2437. 701.07 s [Cabal] - Distribution.Simple.PreProcess.Types.Rep_Suffix
  2438. 708.58 s [Cabal] Documentation created: dist/doc/html/Cabal/, dist/doc/html/Cabal/Cabal.txt
  2439. 708.65 s [Cabal] Phase: installPhase
  2440. 708.76 s [Cabal] Installing library in /nix/store/c4ql4nnhdk6f139cj7xfmhq1llfn97wl-Cabal-3.12.1.0/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky
  2441. 711.76 s [Cabal] Phase: fixupPhase
  2442. 711.79 s [Cabal] shrinking RPATHs of ELF executables and libraries in /nix/store/c4ql4nnhdk6f139cj7xfmhq1llfn97wl-Cabal-3.12.1.0
  2443. 711.79 s [Cabal] shrinking /nix/store/c4ql4nnhdk6f139cj7xfmhq1llfn97wl-Cabal-3.12.1.0/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/libHSCabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky-ghc9.8.4.so
  2444. 711.92 s [Cabal] checking for references to /build/ in /nix/store/c4ql4nnhdk6f139cj7xfmhq1llfn97wl-Cabal-3.12.1.0...
  2445. 712.06 s [Cabal] patching script interpreter paths in /nix/store/c4ql4nnhdk6f139cj7xfmhq1llfn97wl-Cabal-3.12.1.0
  2446. 712.07 s [Cabal] stripping (with command strip and flags -S -p) in /nix/store/c4ql4nnhdk6f139cj7xfmhq1llfn97wl-Cabal-3.12.1.0/lib
  2447. 713.62 s [Cabal] shrinking RPATHs of ELF executables and libraries in /nix/store/mzkgy976bxg36d98mai8pw75w3wrbb99-Cabal-3.12.1.0-doc
  2448. 713.68 s [Cabal] checking for references to /build/ in /nix/store/mzkgy976bxg36d98mai8pw75w3wrbb99-Cabal-3.12.1.0-doc...
  2449. 713.78 s [Cabal] patching script interpreter paths in /nix/store/mzkgy976bxg36d98mai8pw75w3wrbb99-Cabal-3.12.1.0-doc
  2450. 714.19 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/c4ql4nnhdk6f139cj7xfmhq1llfn97wl-Cabal-3.12.1.0 /nix/store/mzkgy976bxg36d98mai8pw75w3wrbb99-Cabal-3.12.1.0-doc
  2451. 714.63 s [post-build-hook] Nothing to push - all store paths are already on Cachix.
  2452. 714.65 s [post-build-hook] Uploading to the NixCI cache: /nix/store/c4ql4nnhdk6f139cj7xfmhq1llfn97wl-Cabal-3.12.1.0 /nix/store/mzkgy976bxg36d98mai8pw75w3wrbb99-Cabal-3.12.1.0-doc
  2453. 714.69 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2454. 714.83 s [post-build-hook] copying 1 paths...
  2455. 714.83 s [post-build-hook] copying path '/nix/store/c4ql4nnhdk6f139cj7xfmhq1llfn97wl-Cabal-3.12.1.0' to 'https://cache.nix-ci.com'...
  2456. 768.92 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2457. 769.12 s [post-build-hook] copying 0 paths...
  2458. 769.26 s Progress: 2 of 22 built, 160 of 160 downloaded from cache
  2459. 769.43 s Building cabal-doctest
  2460. 769.53 s Building ghc-paths
  2461. 769.57 s [cabal-doctest] Phase: setupCompilerEnvironmentPhase
  2462. 769.57 s [cabal-doctest] Build with /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4.
  2463. 769.67 s [ghc-paths] Phase: setupCompilerEnvironmentPhase
  2464. 769.68 s [ghc-paths] Build with /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4.
  2465. 770.11 s [ghc-paths] Phase: unpackPhase
  2466. 770.12 s [ghc-paths] unpacking source archive /nix/store/jbdk3r2ic959xyc0394gn6n61wgjf6n0-ghc-paths-0.1.0.12.tar.gz
  2467. 770.14 s [ghc-paths] source root is ghc-paths-0.1.0.12
  2468. 770.15 s [cabal-doctest] Phase: unpackPhase
  2469. 770.16 s [cabal-doctest] unpacking source archive /nix/store/ckph819l8a613hapx2pwbjv3yzi8gm3k-cabal-doctest-1.0.12.tar.gz
  2470. 770.16 s [ghc-paths] setting SOURCE_DATE_EPOCH to timestamp 1566388706 of file "ghc-paths-0.1.0.12/Setup.hs"
  2471. 770.17 s [ghc-paths] Phase: patchPhase
  2472. 770.17 s [cabal-doctest] source root is cabal-doctest-1.0.12
  2473. 770.18 s [ghc-paths] Replace Cabal file with edited version from mirror://hackage/ghc-paths-0.1.0.12/revision/8.cabal.
  2474. 770.19 s [ghc-paths] applying patch /nix/store/57w4xa43g7ilkdjd7mplrn8l3pvmyklf-ghc-paths-nix.patch
  2475. 770.19 s [cabal-doctest] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "cabal-doctest-1.0.12/src/Distribution/Extra/Doctest.hs"
  2476. 770.19 s [ghc-paths] patching file GHC/Paths.hs
  2477. 770.20 s [ghc-paths] Phase: compileBuildDriverPhase
  2478. 770.21 s [ghc-paths] setupCompileFlags: -package-db=/build/tmp.82Drs7N5Dw/setup-package.conf.d -threaded
  2479. 770.23 s [cabal-doctest] Phase: patchPhase
  2480. 770.30 s [cabal-doctest] Phase: compileBuildDriverPhase
  2481. 770.32 s [cabal-doctest] setupCompileFlags: -package-db=/build/tmp.pYw9NIBTMK/setup-package.conf.d -threaded
  2482. 770.47 s [cabal-doctest] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.pYw9NIBTMK/Main.o )
  2483. 770.48 s [ghc-paths] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.82Drs7N5Dw/Main.o )
  2484. 770.69 s [cabal-doctest] [2 of 2] Linking Setup
  2485. 771.32 s [ghc-paths] [2 of 2] Linking Setup
  2486. 774.05 s [cabal-doctest] Phase: updateAutotoolsGnuConfigScriptsPhase
  2487. 774.09 s [cabal-doctest] Phase: configurePhase
  2488. 774.09 s [cabal-doctest] configureFlags: --verbose --prefix=/nix/store/cqcznxgaasil9l8ih22jn7s2p210cc1p-cabal-doctest-1.0.12 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/w5m81x33rz9wr4qg240synd80yyk58y1-cabal-doctest-1.0.12-doc/share/doc/cabal-doctest-1.0.12 --with-gcc=gcc --package-db=/build/tmp.pYw9NIBTMK/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/xp8g8298vbm4k9ipj14xf1r4rh899hr4-ncurses-6.5/lib --extra-lib-dirs=/nix/store/wxm6pczq28ppr7ffwclsl6njbzzr48zf-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/3f0hp921ncxr249f5lmspc8silkqr8f7-elfutils-0.194/lib --extra-lib-dirs=/nix/store/km81slwkcc82dbwywl10gpffjb78g6ni-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/fvsl0b39y6ns2z66gfvc2raca3b5wr18-numactl-2.0.18/lib
  2489. 774.10 s [cabal-doctest] Using Parsec parser
  2490. 774.10 s [cabal-doctest] Configuring cabal-doctest-1.0.12...
  2491. 774.86 s [ghc-paths] Phase: updateAutotoolsGnuConfigScriptsPhase
  2492. 774.88 s [ghc-paths] Phase: configurePhase
  2493. 774.90 s [ghc-paths] configureFlags: --verbose --prefix=/nix/store/hr7rbnndc89z32b2rkzjjnnwc7z4xwh6-ghc-paths-0.1.0.12 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/v6sj829649hpz2lpp15yrl615qx9sr39-ghc-paths-0.1.0.12-doc/share/doc/ghc-paths-0.1.0.12 --with-gcc=gcc --package-db=/build/tmp.82Drs7N5Dw/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/xp8g8298vbm4k9ipj14xf1r4rh899hr4-ncurses-6.5/lib --extra-lib-dirs=/nix/store/wxm6pczq28ppr7ffwclsl6njbzzr48zf-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/3f0hp921ncxr249f5lmspc8silkqr8f7-elfutils-0.194/lib --extra-lib-dirs=/nix/store/km81slwkcc82dbwywl10gpffjb78g6ni-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/fvsl0b39y6ns2z66gfvc2raca3b5wr18-numactl-2.0.18/lib
  2494. 774.91 s [ghc-paths] Using Parsec parser
  2495. 774.91 s [ghc-paths] Configuring ghc-paths-0.1.0.12...
  2496. 775.20 s [cabal-doctest] Dependency Cabal >=1.24 && <3.16: using Cabal-3.12.1.0
  2497. 775.20 s [cabal-doctest] Dependency base >=4.9 && <5: using base-4.19.2.0
  2498. 775.20 s [cabal-doctest] Dependency directory >=1.3 && <2: using directory-1.3.8.5
  2499. 775.20 s [cabal-doctest] Dependency filepath >=1.4 && <2: using filepath-1.4.301.0
  2500. 775.89 s [cabal-doctest] Source component graph: component lib
  2501. 775.89 s [cabal-doctest] Configured component graph:
  2502. 775.89 s [cabal-doctest] component cabal-doctest-1.0.12-6eNFXUHk9Gq3ra8KFUi2H2
  2503. 775.89 s [cabal-doctest] include Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky
  2504. 775.89 s [cabal-doctest] include base-4.19.2.0-a4d2
  2505. 775.89 s [cabal-doctest] include directory-1.3.8.5-fa66
  2506. 775.89 s [cabal-doctest] include filepath-1.4.301.0-5f33
  2507. 775.89 s [cabal-doctest] Linked component graph:
  2508. 775.89 s [cabal-doctest] unit cabal-doctest-1.0.12-6eNFXUHk9Gq3ra8KFUi2H2
  2509. 775.89 s [cabal-doctest] include Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky
  2510. 775.89 s [cabal-doctest] include base-4.19.2.0-a4d2
  2511. 775.89 s [cabal-doctest] include directory-1.3.8.5-fa66
  2512. 775.89 s [cabal-doctest] include filepath-1.4.301.0-5f33
  2513. 775.89 s [cabal-doctest] Distribution.Extra.Doctest=cabal-doctest-1.0.12-6eNFXUHk9Gq3ra8KFUi2H2:Distribution.Extra.Doctest
  2514. 775.89 s [cabal-doctest] Ready component graph:
  2515. 775.89 s [cabal-doctest] definite cabal-doctest-1.0.12-6eNFXUHk9Gq3ra8KFUi2H2
  2516. 775.89 s [cabal-doctest] depends Cabal-3.12.1.0-6oN9GsocgImKdHqGNOE5Ky
  2517. 775.89 s [cabal-doctest] depends base-4.19.2.0-a4d2
  2518. 775.89 s [cabal-doctest] depends directory-1.3.8.5-fa66
  2519. 775.89 s [cabal-doctest] depends filepath-1.4.301.0-5f33
  2520. 775.89 s [cabal-doctest] Using Cabal-3.10.3.0 compiled by ghc-9.8
  2521. 775.90 s [cabal-doctest] Using compiler: ghc-9.8.4
  2522. 775.90 s [cabal-doctest] Using install prefix:
  2523. 775.90 s [cabal-doctest] /nix/store/cqcznxgaasil9l8ih22jn7s2p210cc1p-cabal-doctest-1.0.12
  2524. 775.90 s [cabal-doctest] Executables installed in:
  2525. 775.90 s [cabal-doctest] /nix/store/cqcznxgaasil9l8ih22jn7s2p210cc1p-cabal-doctest-1.0.12/bin
  2526. 775.90 s [cabal-doctest] Libraries installed in:
  2527. 775.90 s [cabal-doctest] /nix/store/cqcznxgaasil9l8ih22jn7s2p210cc1p-cabal-doctest-1.0.12/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/cabal-doctest-1.0.12-6eNFXUHk9Gq3ra8KFUi2H2
  2528. 775.90 s [cabal-doctest] Dynamic Libraries installed in:
  2529. 775.90 s [cabal-doctest] /nix/store/cqcznxgaasil9l8ih22jn7s2p210cc1p-cabal-doctest-1.0.12/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4
  2530. 775.90 s [cabal-doctest] Private executables installed in:
  2531. 775.90 s [cabal-doctest] /nix/store/cqcznxgaasil9l8ih22jn7s2p210cc1p-cabal-doctest-1.0.12/libexec/x86_64-linux-ghc-9.8.4/cabal-doctest-1.0.12
  2532. 775.90 s [cabal-doctest] Data files installed in:
  2533. 775.90 s [cabal-doctest] /nix/store/cqcznxgaasil9l8ih22jn7s2p210cc1p-cabal-doctest-1.0.12/share/x86_64-linux-ghc-9.8.4/cabal-doctest-1.0.12
  2534. 775.90 s [cabal-doctest] Documentation installed in:
  2535. 775.90 s [cabal-doctest] /nix/store/w5m81x33rz9wr4qg240synd80yyk58y1-cabal-doctest-1.0.12-doc/share/doc/cabal-doctest-1.0.12
  2536. 775.90 s [cabal-doctest] Configuration files installed in:
  2537. 775.90 s [cabal-doctest] /nix/store/cqcznxgaasil9l8ih22jn7s2p210cc1p-cabal-doctest-1.0.12/etc
  2538. 775.90 s [cabal-doctest] No alex found
  2539. 775.90 s [cabal-doctest] Using ar found on system at:
  2540. 775.90 s [cabal-doctest] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
  2541. 775.90 s [cabal-doctest] No c2hs found
  2542. 775.90 s [cabal-doctest] No cpphs found
  2543. 775.90 s [cabal-doctest] No doctest found
  2544. 775.90 s [cabal-doctest] Using gcc version 14.3.0 given by user at:
  2545. 775.90 s [cabal-doctest] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
  2546. 775.90 s [cabal-doctest] Using ghc version 9.8.4 found on system at:
  2547. 775.90 s [cabal-doctest] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/ghc
  2548. 775.90 s [cabal-doctest] Using ghc-pkg version 9.8.4 found on system at:
  2549. 775.90 s [cabal-doctest] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/ghc-pkg-9.8.4
  2550. 775.90 s [cabal-doctest] No ghcjs found
  2551. 775.90 s [cabal-doctest] No ghcjs-pkg found
  2552. 775.90 s [cabal-doctest] No greencard found
  2553. 775.90 s [cabal-doctest] Using haddock version 2.30.0 found on system at:
  2554. 775.90 s [cabal-doctest] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/haddock-ghc-9.8.4
  2555. 775.90 s [cabal-doctest] No happy found
  2556. 775.90 s [cabal-doctest] Using haskell-suite found on system at: haskell-suite-dummy-location
  2557. 775.90 s [cabal-doctest] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  2558. 775.90 s [cabal-doctest] No hmake found
  2559. 775.90 s [cabal-doctest] Using hpc version 0.69 found on system at:
  2560. 775.90 s [cabal-doctest] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/hpc-ghc-9.8.4
  2561. 775.90 s [cabal-doctest] Using hsc2hs version 0.68.10 found on system at:
  2562. 775.90 s [cabal-doctest] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/hsc2hs-ghc-9.8.4
  2563. 775.90 s [cabal-doctest] Using hscolour version 1.25 found on system at:
  2564. 775.90 s [cabal-doctest] /nix/store/vl14mqkz7z183r6sq9qz932j3pix6v5c-hscolour-1.25/bin/HsColour
  2565. 775.90 s [cabal-doctest] No jhc found
  2566. 775.90 s [cabal-doctest] Using ld found on system at:
  2567. 775.90 s [cabal-doctest] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ld.gold
  2568. 775.90 s [cabal-doctest] No pkg-config found
  2569. 775.90 s [cabal-doctest] Using runghc version 9.8.4 found on system at:
  2570. 775.90 s [cabal-doctest] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/runghc-9.8.4
  2571. 775.90 s [cabal-doctest] Using strip version 2.44 found on system at:
  2572. 775.90 s [cabal-doctest] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
  2573. 775.90 s [cabal-doctest] Using tar found on system at:
  2574. 775.90 s [cabal-doctest] /nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
  2575. 775.90 s [cabal-doctest] No uhc found
  2576. 776.17 s [cabal-doctest] Phase: buildPhase
  2577. 776.36 s [cabal-doctest] Preprocessing library for cabal-doctest-1.0.12..
  2578. 776.36 s [cabal-doctest] Building library for cabal-doctest-1.0.12..
  2579. 776.49 s [ghc-paths] Dependency base >=3 && <5: using base-4.19.2.0
  2580. 776.49 s [ghc-paths] Source component graph: component lib
  2581. 776.50 s [ghc-paths] Configured component graph:
  2582. 776.50 s [ghc-paths] component ghc-paths-0.1.0.12-iNVHrgbdxn7UiYjGl8ti5
  2583. 776.50 s [ghc-paths] include base-4.19.2.0-a4d2
  2584. 776.50 s [ghc-paths] Linked component graph:
  2585. 776.50 s [ghc-paths] unit ghc-paths-0.1.0.12-iNVHrgbdxn7UiYjGl8ti5
  2586. 776.50 s [ghc-paths] include base-4.19.2.0-a4d2
  2587. 776.50 s [ghc-paths] GHC.Paths=ghc-paths-0.1.0.12-iNVHrgbdxn7UiYjGl8ti5:GHC.Paths
  2588. 776.50 s [ghc-paths] Ready component graph:
  2589. 776.50 s [ghc-paths] definite ghc-paths-0.1.0.12-iNVHrgbdxn7UiYjGl8ti5
  2590. 776.50 s [ghc-paths] depends base-4.19.2.0-a4d2
  2591. 776.50 s [ghc-paths] Using Cabal-3.12.1.0 compiled by ghc-9.8
  2592. 776.50 s [ghc-paths] Using compiler: ghc-9.8.4
  2593. 776.50 s [ghc-paths] Using install prefix:
  2594. 776.50 s [ghc-paths] /nix/store/hr7rbnndc89z32b2rkzjjnnwc7z4xwh6-ghc-paths-0.1.0.12
  2595. 776.50 s [ghc-paths] Executables installed in:
  2596. 776.50 s [ghc-paths] /nix/store/hr7rbnndc89z32b2rkzjjnnwc7z4xwh6-ghc-paths-0.1.0.12/bin
  2597. 776.50 s [ghc-paths] Libraries installed in:
  2598. 776.50 s [ghc-paths] /nix/store/hr7rbnndc89z32b2rkzjjnnwc7z4xwh6-ghc-paths-0.1.0.12/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4-952d/ghc-paths-0.1.0.12-iNVHrgbdxn7UiYjGl8ti5
  2599. 776.50 s [ghc-paths] Dynamic Libraries installed in:
  2600. 776.50 s [ghc-paths] /nix/store/hr7rbnndc89z32b2rkzjjnnwc7z4xwh6-ghc-paths-0.1.0.12/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4-952d
  2601. 776.50 s [ghc-paths] Private executables installed in:
  2602. 776.50 s [ghc-paths] /nix/store/hr7rbnndc89z32b2rkzjjnnwc7z4xwh6-ghc-paths-0.1.0.12/libexec/x86_64-linux-ghc-9.8.4-952d/ghc-paths-0.1.0.12
  2603. 776.50 s [ghc-paths] Data files installed in:
  2604. 776.50 s [ghc-paths] /nix/store/hr7rbnndc89z32b2rkzjjnnwc7z4xwh6-ghc-paths-0.1.0.12/share/x86_64-linux-ghc-9.8.4-952d/ghc-paths-0.1.0.12
  2605. 776.50 s [ghc-paths] Documentation installed in:
  2606. 776.50 s [ghc-paths] /nix/store/v6sj829649hpz2lpp15yrl615qx9sr39-ghc-paths-0.1.0.12-doc/share/doc/ghc-paths-0.1.0.12
  2607. 776.50 s [ghc-paths] Configuration files installed in:
  2608. 776.50 s [ghc-paths] /nix/store/hr7rbnndc89z32b2rkzjjnnwc7z4xwh6-ghc-paths-0.1.0.12/etc
  2609. 776.50 s [ghc-paths] No alex found
  2610. 776.50 s [ghc-paths] Using ar found on system at:
  2611. 776.50 s [ghc-paths] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
  2612. 776.50 s [ghc-paths] No c2hs found
  2613. 776.50 s [ghc-paths] No cpphs found
  2614. 776.50 s [ghc-paths] No doctest found
  2615. 776.50 s [ghc-paths] Using gcc version 14.3.0 given by user at:
  2616. 776.50 s [ghc-paths] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
  2617. 776.50 s [ghc-paths] Using ghc version 9.8.4 found on system at:
  2618. 776.50 s [ghc-paths] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/ghc
  2619. 776.50 s [ghc-paths] Using ghc-pkg version 9.8.4 found on system at:
  2620. 776.50 s [ghc-paths] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/ghc-pkg-9.8.4
  2621. 776.50 s [ghc-paths] No ghcjs found
  2622. 776.50 s [ghc-paths] No ghcjs-pkg found
  2623. 776.50 s [ghc-paths] No greencard found
  2624. 776.50 s [ghc-paths] Using haddock version 2.30.0 found on system at:
  2625. 776.50 s [ghc-paths] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/haddock-ghc-9.8.4
  2626. 776.50 s [ghc-paths] No happy found
  2627. 776.50 s [ghc-paths] Using haskell-suite found on system at: haskell-suite-dummy-location
  2628. 776.50 s [ghc-paths] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  2629. 776.50 s [ghc-paths] No hmake found
  2630. 776.50 s [ghc-paths] Using hpc version 0.69 found on system at:
  2631. 776.50 s [ghc-paths] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/hpc-ghc-9.8.4
  2632. 776.50 s [ghc-paths] Using hsc2hs version 0.68.10 found on system at:
  2633. 776.50 s [ghc-paths] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/hsc2hs-ghc-9.8.4
  2634. 776.50 s [ghc-paths] Using hscolour version 1.25 found on system at:
  2635. 776.50 s [ghc-paths] /nix/store/vl14mqkz7z183r6sq9qz932j3pix6v5c-hscolour-1.25/bin/HsColour
  2636. 776.50 s [ghc-paths] No jhc found
  2637. 776.50 s [ghc-paths] Using ld found on system at:
  2638. 776.50 s [ghc-paths] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ld.gold
  2639. 776.50 s [ghc-paths] No pkg-config found
  2640. 776.50 s [ghc-paths] Using runghc version 9.8.4 found on system at:
  2641. 776.50 s [ghc-paths] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/runghc-9.8.4
  2642. 776.50 s [ghc-paths] Using strip version 2.44 found on system at:
  2643. 776.50 s [ghc-paths] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
  2644. 776.50 s [ghc-paths] Using tar found on system at:
  2645. 776.50 s [ghc-paths] /nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
  2646. 776.50 s [ghc-paths] No uhc found
  2647. 776.50 s [ghc-paths] Running: /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/ghc --print-libdir -j16 '+RTS' -A64M -RTS -haddock
  2648. 776.63 s [cabal-doctest] [1 of 1] Compiling Distribution.Extra.Doctest ( src/Distribution/Extra/Doctest.hs, dist/build/Distribution/Extra/Doctest.o, dist/build/Distribution/Extra/Doctest.dyn_o )
  2649. 776.65 s [ghc-paths] Phase: buildPhase
  2650. 776.78 s [ghc-paths] Preprocessing library for ghc-paths-0.1.0.12...
  2651. 776.78 s [ghc-paths] Building library for ghc-paths-0.1.0.12...
  2652. 777.04 s [ghc-paths] [1 of 1] Compiling GHC.Paths ( GHC/Paths.hs, dist/build/GHC/Paths.o, dist/build/GHC/Paths.dyn_o )
  2653. 777.63 s [ghc-paths] [1 of 1] Compiling GHC.Paths ( GHC/Paths.hs, dist/build/GHC/Paths.p_o )
  2654. 779.77 s [ghc-paths] Phase: checkPhase
  2655. 779.82 s [ghc-paths] Package has no test suites.
  2656. 779.83 s [ghc-paths] Phase: haddockPhase
  2657. 780.00 s [cabal-doctest] [1 of 1] Compiling Distribution.Extra.Doctest ( src/Distribution/Extra/Doctest.hs, dist/build/Distribution/Extra/Doctest.p_o )
  2658. 780.15 s [ghc-paths] Preprocessing library for ghc-paths-0.1.0.12...
  2659. 780.15 s [ghc-paths] Running Haddock on library for ghc-paths-0.1.0.12...
  2660. 780.53 s [ghc-paths] [1 of 1] Compiling GHC.Paths ( GHC/Paths.hs, nothing )
  2661. 780.66 s [ghc-paths] Haddock coverage:
  2662. 780.66 s [ghc-paths] 0% ( 0 / 5) in 'GHC.Paths'
  2663. 780.66 s [ghc-paths] Missing documentation for:
  2664. 780.66 s [ghc-paths] Module header
  2665. 780.66 s [ghc-paths] ghc (GHC/Paths.hs:34)
  2666. 780.66 s [ghc-paths] ghc_pkg (GHC/Paths.hs:35)
  2667. 780.66 s [ghc-paths] libdir (GHC/Paths.hs:31)
  2668. 780.66 s [ghc-paths] docdir (GHC/Paths.hs:32)
  2669. 785.11 s [ghc-paths] Documentation created: dist/doc/html/ghc-paths/,
  2670. 785.11 s [ghc-paths] dist/doc/html/ghc-paths/ghc-paths.txt
  2671. 785.28 s [ghc-paths] Phase: installPhase
  2672. 785.37 s [ghc-paths] Installing library in /nix/store/hr7rbnndc89z32b2rkzjjnnwc7z4xwh6-ghc-paths-0.1.0.12/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4-952d/ghc-paths-0.1.0.12-iNVHrgbdxn7UiYjGl8ti5
  2673. 785.67 s [ghc-paths] Phase: fixupPhase
  2674. 785.70 s [ghc-paths] shrinking RPATHs of ELF executables and libraries in /nix/store/hr7rbnndc89z32b2rkzjjnnwc7z4xwh6-ghc-paths-0.1.0.12
  2675. 785.70 s [ghc-paths] shrinking /nix/store/hr7rbnndc89z32b2rkzjjnnwc7z4xwh6-ghc-paths-0.1.0.12/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4-952d/libHSghc-paths-0.1.0.12-iNVHrgbdxn7UiYjGl8ti5-ghc9.8.4.so
  2676. 785.71 s [ghc-paths] checking for references to /build/ in /nix/store/hr7rbnndc89z32b2rkzjjnnwc7z4xwh6-ghc-paths-0.1.0.12...
  2677. 785.74 s [ghc-paths] patching script interpreter paths in /nix/store/hr7rbnndc89z32b2rkzjjnnwc7z4xwh6-ghc-paths-0.1.0.12
  2678. 785.75 s [ghc-paths] stripping (with command strip and flags -S -p) in /nix/store/hr7rbnndc89z32b2rkzjjnnwc7z4xwh6-ghc-paths-0.1.0.12/lib
  2679. 785.80 s [ghc-paths] shrinking RPATHs of ELF executables and libraries in /nix/store/v6sj829649hpz2lpp15yrl615qx9sr39-ghc-paths-0.1.0.12-doc
  2680. 785.81 s [ghc-paths] checking for references to /build/ in /nix/store/v6sj829649hpz2lpp15yrl615qx9sr39-ghc-paths-0.1.0.12-doc...
  2681. 785.84 s [ghc-paths] patching script interpreter paths in /nix/store/v6sj829649hpz2lpp15yrl615qx9sr39-ghc-paths-0.1.0.12-doc
  2682. 785.98 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/hr7rbnndc89z32b2rkzjjnnwc7z4xwh6-ghc-paths-0.1.0.12 /nix/store/v6sj829649hpz2lpp15yrl615qx9sr39-ghc-paths-0.1.0.12-doc
  2683. 786.63 s [post-build-hook] Nothing to push - all store paths are already on Cachix.
  2684. 786.67 s [post-build-hook] Uploading to the NixCI cache: /nix/store/hr7rbnndc89z32b2rkzjjnnwc7z4xwh6-ghc-paths-0.1.0.12 /nix/store/v6sj829649hpz2lpp15yrl615qx9sr39-ghc-paths-0.1.0.12-doc
  2685. 786.74 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2686. 786.89 s [post-build-hook] copying 1 paths...
  2687. 786.89 s [post-build-hook] copying path '/nix/store/hr7rbnndc89z32b2rkzjjnnwc7z4xwh6-ghc-paths-0.1.0.12' to 'https://cache.nix-ci.com'...
  2688. 787.11 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2689. 787.28 s [post-build-hook] copying 0 paths...
  2690. 787.34 s Progress: 3 of 22 built (1 building), 160 of 160 downloaded from cache
  2691. 787.44 s Building doctest
  2692. 787.44 s [cabal-doctest] Phase: checkPhase
  2693. 787.44 s [cabal-doctest] Package has no test suites.
  2694. 787.44 s [cabal-doctest] Phase: haddockPhase
  2695. 787.44 s [cabal-doctest] Preprocessing library for cabal-doctest-1.0.12..
  2696. 787.44 s [cabal-doctest] Running Haddock on library for cabal-doctest-1.0.12..
  2697. 787.44 s [cabal-doctest] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
  2698. 787.50 s [cabal-doctest] [1 of 1] Compiling Distribution.Extra.Doctest ( src/Distribution/Extra/Doctest.hs, nothing )
  2699. 787.66 s [doctest] Phase: setupCompilerEnvironmentPhase
  2700. 787.67 s [doctest] Build with /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4.
  2701. 788.20 s [doctest] Phase: unpackPhase
  2702. 788.21 s [doctest] unpacking source archive /nix/store/bhl15ifbap4vkm5qbpgwa3svq4yanr2l-doctest-0.24.2.tar.gz
  2703. 788.23 s [doctest] source root is doctest-0.24.2
  2704. 788.24 s [doctest] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "doctest-0.24.2/test/UtilSpec.hs"
  2705. 788.25 s [doctest] Phase: patchPhase
  2706. 788.27 s [doctest] Phase: compileBuildDriverPhase
  2707. 788.27 s [doctest] setupCompileFlags: -package-db=/build/tmp.eWipGrDX8n/setup-package.conf.d -threaded
  2708. 788.43 s [doctest] [1 of 2] Compiling Main ( Setup.lhs, /build/tmp.eWipGrDX8n/Main.o )
  2709. 788.66 s [doctest] [2 of 2] Linking Setup
  2710. 788.77 s [cabal-doctest] Haddock coverage:
  2711. 788.79 s [cabal-doctest] Warning: 'UserHooks' is ambiguous. It is defined
  2712. 788.79 s [cabal-doctest] * in ‘Distribution.Simple.UserHooks’
  2713. 788.79 s [cabal-doctest] * in ‘Distribution.Simple.UserHooks’
  2714. 788.79 s [cabal-doctest] You may be able to disambiguate the identifier by qualifying it or
  2715. 788.79 s [cabal-doctest] by specifying the type/value namespace explicitly.
  2716. 788.79 s [cabal-doctest] Defaulting to the one defined in ‘Distribution.Simple.UserHooks’
  2717. 788.79 s [cabal-doctest] 100% ( 7 / 7) in 'Distribution.Extra.Doctest'
  2718. 792.38 s [doctest] Phase: updateAutotoolsGnuConfigScriptsPhase
  2719. 792.41 s [doctest] Phase: configurePhase
  2720. 792.42 s [doctest] configureFlags: --verbose --prefix=/nix/store/njpw8hiwdi4abvh8g8yavys2ykkm6gmp-doctest-0.24.2 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/30gpaxfdfbdvwpv8zr2br46ywwbywz3k-doctest-0.24.2-doc/share/doc/doctest-0.24.2 --with-gcc=gcc --package-db=/build/tmp.eWipGrDX8n/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/xp8g8298vbm4k9ipj14xf1r4rh899hr4-ncurses-6.5/lib --extra-lib-dirs=/nix/store/wxm6pczq28ppr7ffwclsl6njbzzr48zf-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/3f0hp921ncxr249f5lmspc8silkqr8f7-elfutils-0.194/lib --extra-lib-dirs=/nix/store/km81slwkcc82dbwywl10gpffjb78g6ni-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/fvsl0b39y6ns2z66gfvc2raca3b5wr18-numactl-2.0.18/lib --extra-lib-dirs=/nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/lib
  2721. 792.47 s [doctest] Using Parsec parser
  2722. 792.47 s [doctest] Configuring doctest-0.24.2...
  2723. 793.77 s [doctest] Flags chosen: cabal-doctest=False
  2724. 793.77 s [doctest] Dependency base >=4.12 && <5: using base-4.19.2.0
  2725. 793.77 s [doctest] Dependency code-page >=0.1: using code-page-0.2.1
  2726. 793.77 s [doctest] Dependency containers: using containers-0.6.8
  2727. 793.77 s [doctest] Dependency deepseq: using deepseq-1.5.1.0
  2728. 793.77 s [doctest] Dependency directory: using directory-1.3.8.5
  2729. 793.77 s [doctest] Dependency exceptions: using exceptions-0.10.7
  2730. 793.77 s [doctest] Dependency filepath: using filepath-1.4.301.0
  2731. 793.77 s [doctest] Dependency ghc >=8.6 && <9.14: using ghc-9.8.4
  2732. 793.77 s [doctest] Dependency ghc-paths >=0.1.0.9: using ghc-paths-0.1.0.12
  2733. 793.77 s [doctest] Dependency process: using process-1.6.25.0
  2734. 793.77 s [doctest] Dependency syb >=0.3: using syb-0.7.2.4
  2735. 793.77 s [doctest] Dependency temporary: using temporary-1.3
  2736. 793.77 s [doctest] Dependency transformers: using transformers-0.6.1.0
  2737. 793.77 s [doctest] Dependency base >=4.12 && <5: using base-4.19.2.0
  2738. 793.77 s [doctest] Dependency doctest: using doctest-0.24.2
  2739. 793.77 s [doctest] Dependency HUnit: using HUnit-1.6.2.0
  2740. 793.77 s [doctest] Dependency QuickCheck >=2.13.1: using QuickCheck-2.15.0.1
  2741. 793.77 s [doctest] Dependency base >=4.12 && <5: using base-4.19.2.0
  2742. 793.77 s [doctest] Dependency code-page >=0.1: using code-page-0.2.1
  2743. 793.77 s [doctest] Dependency containers: using containers-0.6.8
  2744. 793.77 s [doctest] Dependency deepseq: using deepseq-1.5.1.0
  2745. 793.77 s [doctest] Dependency directory: using directory-1.3.8.5
  2746. 793.77 s [doctest] Dependency exceptions: using exceptions-0.10.7
  2747. 793.77 s [doctest] Dependency filepath: using filepath-1.4.301.0
  2748. 793.77 s [doctest] Dependency ghc >=8.6 && <9.14: using ghc-9.8.4
  2749. 793.77 s [doctest] Dependency ghc-paths >=0.1.0.9: using ghc-paths-0.1.0.12
  2750. 793.77 s [doctest] Dependency hspec >=2.3.0: using hspec-2.11.14
  2751. 793.77 s [doctest] Dependency hspec-core >=2.3.0: using hspec-core-2.11.14
  2752. 793.77 s [doctest] Dependency mockery: using mockery-0.3.5
  2753. 793.77 s [doctest] Dependency process: using process-1.6.25.0
  2754. 793.77 s [doctest] Dependency silently >=1.2.4: using silently-1.2.5.4
  2755. 793.77 s [doctest] Dependency stringbuilder >=0.4: using stringbuilder-0.5.1
  2756. 793.77 s [doctest] Dependency syb >=0.3: using syb-0.7.2.4
  2757. 793.77 s [doctest] Dependency temporary: using temporary-1.3
  2758. 793.77 s [doctest] Dependency transformers: using transformers-0.6.1.0
  2759. 794.51 s [doctest] Source component graph:
  2760. 794.51 s [doctest] component test:spec
  2761. 794.51 s [doctest] component lib
  2762. 794.51 s [doctest] component exe:doctest dependency lib
  2763. 794.51 s [doctest] Configured component graph:
  2764. 794.52 s [doctest] component doctest-0.24.2-jz5xcL6uki142d9onjsiu-spec
  2765. 794.52 s [doctest] include HUnit-1.6.2.0-3JXxihbFbfoB9MlN5UzWLe
  2766. 794.52 s [doctest] include QuickCheck-2.15.0.1-2BdQuHKQVeZ1bFh8DuLq55
  2767. 794.52 s [doctest] include base-4.19.2.0-a4d2
  2768. 794.52 s [doctest] include code-page-0.2.1-13RL6o1jguXBzTSMzfN1Z5
  2769. 794.52 s [doctest] include containers-0.6.8-1373
  2770. 794.52 s [doctest] include deepseq-1.5.1.0-2184
  2771. 794.52 s [doctest] include directory-1.3.8.5-fa66
  2772. 794.52 s [doctest] include exceptions-0.10.7-03d9
  2773. 794.52 s [doctest] include filepath-1.4.301.0-5f33
  2774. 794.52 s [doctest] include ghc-9.8.4-952d
  2775. 794.52 s [doctest] include ghc-paths-0.1.0.12-iNVHrgbdxn7UiYjGl8ti5
  2776. 794.52 s [doctest] include hspec-2.11.14-948gjw5SxBE4Bc77gzUbtV
  2777. 794.53 s [doctest] include hspec-core-2.11.14-8e59M6toWOaGsU0uvv13Y6
  2778. 794.53 s [doctest] include mockery-0.3.5-LZ8PGyntEPdAm7Ul3jJPqX
  2779. 794.53 s [doctest] include process-1.6.25.0-8170
  2780. 794.53 s [doctest] include silently-1.2.5.4-IAxY4vQhywU73qW3FuDmB
  2781. 794.53 s [doctest] include stringbuilder-0.5.1-HYQU97lUphUIOYppTYpotp
  2782. 794.53 s [doctest] include syb-0.7.2.4-1gZQtmTmFEY8WzlKKhFG1d
  2783. 794.53 s [doctest] include temporary-1.3-7lN8dLhPIBAArzYr3KnKF5
  2784. 794.53 s [doctest] include transformers-0.6.1.0-8f1d
  2785. 794.53 s [doctest] component doctest-0.24.2-7CW3VAqweMx6JNSdbfXAyp
  2786. 794.53 s [doctest] include base-4.19.2.0-a4d2
  2787. 794.53 s [doctest] include code-page-0.2.1-13RL6o1jguXBzTSMzfN1Z5
  2788. 794.53 s [doctest] include containers-0.6.8-1373
  2789. 794.53 s [doctest] include deepseq-1.5.1.0-2184
  2790. 794.53 s [doctest] include directory-1.3.8.5-fa66
  2791. 794.53 s [doctest] include exceptions-0.10.7-03d9
  2792. 794.53 s [doctest] include filepath-1.4.301.0-5f33
  2793. 794.53 s [doctest] include ghc-9.8.4-952d
  2794. 794.53 s [doctest] include ghc-paths-0.1.0.12-iNVHrgbdxn7UiYjGl8ti5
  2795. 794.53 s [doctest] include process-1.6.25.0-8170
  2796. 794.53 s [doctest] include syb-0.7.2.4-1gZQtmTmFEY8WzlKKhFG1d
  2797. 794.53 s [doctest] include temporary-1.3-7lN8dLhPIBAArzYr3KnKF5
  2798. 794.53 s [doctest] include transformers-0.6.1.0-8f1d
  2799. 794.53 s [doctest] component doctest-0.24.2-Lh7eSmq1iQuJyAt0k8mZuL-doctest
  2800. 794.53 s [doctest] include base-4.19.2.0-a4d2
  2801. 794.53 s [doctest] include doctest-0.24.2-7CW3VAqweMx6JNSdbfXAyp
  2802. 794.53 s [doctest] Linked component graph:
  2803. 794.54 s [doctest] unit doctest-0.24.2-jz5xcL6uki142d9onjsiu-spec
  2804. 794.54 s [doctest] include HUnit-1.6.2.0-3JXxihbFbfoB9MlN5UzWLe
  2805. 794.54 s [doctest] include QuickCheck-2.15.0.1-2BdQuHKQVeZ1bFh8DuLq55
  2806. 794.54 s [doctest] include base-4.19.2.0-a4d2
  2807. 794.54 s [doctest] include code-page-0.2.1-13RL6o1jguXBzTSMzfN1Z5
  2808. 794.54 s [doctest] include containers-0.6.8-1373
  2809. 794.54 s [doctest] include deepseq-1.5.1.0-2184
  2810. 794.54 s [doctest] include directory-1.3.8.5-fa66
  2811. 794.54 s [doctest] include exceptions-0.10.7-03d9
  2812. 794.54 s [doctest] include filepath-1.4.301.0-5f33
  2813. 794.54 s [doctest] include ghc-9.8.4-952d
  2814. 794.54 s [doctest] include ghc-paths-0.1.0.12-iNVHrgbdxn7UiYjGl8ti5
  2815. 794.54 s [doctest] include hspec-2.11.14-948gjw5SxBE4Bc77gzUbtV
  2816. 794.54 s [doctest] include hspec-core-2.11.14-8e59M6toWOaGsU0uvv13Y6
  2817. 794.54 s [doctest] include mockery-0.3.5-LZ8PGyntEPdAm7Ul3jJPqX
  2818. 794.54 s [doctest] include process-1.6.25.0-8170
  2819. 794.54 s [doctest] include silently-1.2.5.4-IAxY4vQhywU73qW3FuDmB
  2820. 794.54 s [doctest] include stringbuilder-0.5.1-HYQU97lUphUIOYppTYpotp
  2821. 794.54 s [doctest] include syb-0.7.2.4-1gZQtmTmFEY8WzlKKhFG1d
  2822. 794.54 s [doctest] include temporary-1.3-7lN8dLhPIBAArzYr3KnKF5
  2823. 794.54 s [doctest] include transformers-0.6.1.0-8f1d
  2824. 794.54 s [doctest] unit doctest-0.24.2-7CW3VAqweMx6JNSdbfXAyp
  2825. 794.54 s [doctest] include base-4.19.2.0-a4d2
  2826. 794.54 s [doctest] include code-page-0.2.1-13RL6o1jguXBzTSMzfN1Z5
  2827. 794.54 s [doctest] include containers-0.6.8-1373
  2828. 794.54 s [doctest] include deepseq-1.5.1.0-2184
  2829. 794.54 s [doctest] include directory-1.3.8.5-fa66
  2830. 794.54 s [doctest] include exceptions-0.10.7-03d9
  2831. 794.54 s [doctest] include filepath-1.4.301.0-5f33
  2832. 794.54 s [doctest] include ghc-9.8.4-952d
  2833. 794.54 s [doctest] include ghc-paths-0.1.0.12-iNVHrgbdxn7UiYjGl8ti5
  2834. 794.54 s [doctest] include process-1.6.25.0-8170
  2835. 794.54 s [doctest] include syb-0.7.2.4-1gZQtmTmFEY8WzlKKhFG1d
  2836. 794.54 s [doctest] include temporary-1.3-7lN8dLhPIBAArzYr3KnKF5
  2837. 794.54 s [doctest] include transformers-0.6.1.0-8f1d
  2838. 794.54 s [doctest] Test.DocTest=doctest-0.24.2-7CW3VAqweMx6JNSdbfXAyp:Test.DocTest,Test.DocTest.Internal.Cabal=doctest-0.24.2-7CW3VAqweMx6JNSdbfXAyp:Test.DocTest.Internal.Cabal,Test.DocTest.Internal.Extract=doctest-0.24.2-7CW3VAqweMx6JNSdbfXAyp:Test.DocTest.Internal.Extract,Test.DocTest.Internal.Location=doctest-0.24.2-7CW3VAqweMx6JNSdbfXAyp:Test.DocTest.Internal.Location,Test.DocTest.Internal.Parse=doctest-0.24.2-7CW3VAqweMx6JNSdbfXAyp:Test.DocTest.Internal.Parse,Test.DocTest.Internal.Run=doctest-0.24.2-7CW3VAqweMx6JNSdbfXAyp:Test.DocTest.Internal.Run
  2839. 794.54 s [doctest] unit doctest-0.24.2-Lh7eSmq1iQuJyAt0k8mZuL-doctest
  2840. 794.54 s [doctest] include base-4.19.2.0-a4d2
  2841. 794.54 s [doctest] include doctest-0.24.2-7CW3VAqweMx6JNSdbfXAyp
  2842. 794.54 s [doctest] Ready component graph:
  2843. 794.54 s [doctest] definite doctest-0.24.2-jz5xcL6uki142d9onjsiu-spec
  2844. 794.54 s [doctest] depends HUnit-1.6.2.0-3JXxihbFbfoB9MlN5UzWLe
  2845. 794.54 s [doctest] depends QuickCheck-2.15.0.1-2BdQuHKQVeZ1bFh8DuLq55
  2846. 794.54 s [doctest] depends base-4.19.2.0-a4d2
  2847. 794.54 s [doctest] depends code-page-0.2.1-13RL6o1jguXBzTSMzfN1Z5
  2848. 794.54 s [doctest] depends containers-0.6.8-1373
  2849. 794.54 s [doctest] depends deepseq-1.5.1.0-2184
  2850. 794.54 s [doctest] depends directory-1.3.8.5-fa66
  2851. 794.54 s [doctest] depends exceptions-0.10.7-03d9
  2852. 794.54 s [doctest] depends filepath-1.4.301.0-5f33
  2853. 794.54 s [doctest] depends ghc-9.8.4-952d
  2854. 794.54 s [doctest] depends ghc-paths-0.1.0.12-iNVHrgbdxn7UiYjGl8ti5
  2855. 794.54 s [doctest] depends hspec-2.11.14-948gjw5SxBE4Bc77gzUbtV
  2856. 794.54 s [doctest] depends hspec-core-2.11.14-8e59M6toWOaGsU0uvv13Y6
  2857. 794.54 s [doctest] depends mockery-0.3.5-LZ8PGyntEPdAm7Ul3jJPqX
  2858. 794.54 s [doctest] depends process-1.6.25.0-8170
  2859. 794.54 s [doctest] depends silently-1.2.5.4-IAxY4vQhywU73qW3FuDmB
  2860. 794.54 s [doctest] depends stringbuilder-0.5.1-HYQU97lUphUIOYppTYpotp
  2861. 794.54 s [doctest] depends syb-0.7.2.4-1gZQtmTmFEY8WzlKKhFG1d
  2862. 794.54 s [doctest] depends temporary-1.3-7lN8dLhPIBAArzYr3KnKF5
  2863. 794.54 s [doctest] depends transformers-0.6.1.0-8f1d
  2864. 794.54 s [doctest] definite doctest-0.24.2-7CW3VAqweMx6JNSdbfXAyp
  2865. 794.54 s [doctest] depends base-4.19.2.0-a4d2
  2866. 794.54 s [doctest] depends code-page-0.2.1-13RL6o1jguXBzTSMzfN1Z5
  2867. 794.54 s [doctest] depends containers-0.6.8-1373
  2868. 794.54 s [doctest] depends deepseq-1.5.1.0-2184
  2869. 794.54 s [doctest] depends directory-1.3.8.5-fa66
  2870. 794.54 s [doctest] depends exceptions-0.10.7-03d9
  2871. 794.54 s [doctest] depends filepath-1.4.301.0-5f33
  2872. 794.54 s [doctest] depends ghc-9.8.4-952d
  2873. 794.54 s [doctest] depends ghc-paths-0.1.0.12-iNVHrgbdxn7UiYjGl8ti5
  2874. 794.54 s [doctest] depends process-1.6.25.0-8170
  2875. 794.54 s [doctest] depends syb-0.7.2.4-1gZQtmTmFEY8WzlKKhFG1d
  2876. 794.54 s [doctest] depends temporary-1.3-7lN8dLhPIBAArzYr3KnKF5
  2877. 794.54 s [doctest] depends transformers-0.6.1.0-8f1d
  2878. 794.54 s [doctest] definite doctest-0.24.2-Lh7eSmq1iQuJyAt0k8mZuL-doctest
  2879. 794.54 s [doctest] depends base-4.19.2.0-a4d2
  2880. 794.54 s [doctest] depends doctest-0.24.2-7CW3VAqweMx6JNSdbfXAyp
  2881. 794.54 s [doctest] Using Cabal-3.10.3.0 compiled by ghc-9.8
  2882. 794.54 s [doctest] Using compiler: ghc-9.8.4
  2883. 794.54 s [doctest] Using install prefix:
  2884. 794.54 s [doctest] /nix/store/njpw8hiwdi4abvh8g8yavys2ykkm6gmp-doctest-0.24.2
  2885. 794.54 s [doctest] Executables installed in:
  2886. 794.54 s [doctest] /nix/store/njpw8hiwdi4abvh8g8yavys2ykkm6gmp-doctest-0.24.2/bin
  2887. 794.54 s [doctest] Libraries installed in:
  2888. 794.54 s [doctest] /nix/store/njpw8hiwdi4abvh8g8yavys2ykkm6gmp-doctest-0.24.2/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/doctest-0.24.2-7CW3VAqweMx6JNSdbfXAyp
  2889. 794.54 s [doctest] Dynamic Libraries installed in:
  2890. 794.54 s [doctest] /nix/store/njpw8hiwdi4abvh8g8yavys2ykkm6gmp-doctest-0.24.2/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4
  2891. 794.54 s [doctest] Private executables installed in:
  2892. 794.54 s [doctest] /nix/store/njpw8hiwdi4abvh8g8yavys2ykkm6gmp-doctest-0.24.2/libexec/x86_64-linux-ghc-9.8.4/doctest-0.24.2
  2893. 794.54 s [doctest] Data files installed in:
  2894. 794.55 s [doctest] /nix/store/njpw8hiwdi4abvh8g8yavys2ykkm6gmp-doctest-0.24.2/share/x86_64-linux-ghc-9.8.4/doctest-0.24.2
  2895. 794.55 s [doctest] Documentation installed in:
  2896. 794.55 s [doctest] /nix/store/30gpaxfdfbdvwpv8zr2br46ywwbywz3k-doctest-0.24.2-doc/share/doc/doctest-0.24.2
  2897. 794.55 s [doctest] Configuration files installed in:
  2898. 794.55 s [doctest] /nix/store/njpw8hiwdi4abvh8g8yavys2ykkm6gmp-doctest-0.24.2/etc
  2899. 794.55 s [doctest] No alex found
  2900. 794.55 s [doctest] Using ar found on system at:
  2901. 794.55 s [doctest] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
  2902. 794.55 s [doctest] No c2hs found
  2903. 794.55 s [doctest] No cpphs found
  2904. 794.55 s [doctest] No doctest found
  2905. 794.55 s [doctest] Using gcc version 14.3.0 given by user at:
  2906. 794.55 s [doctest] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
  2907. 794.55 s [doctest] Using ghc version 9.8.4 found on system at:
  2908. 794.55 s [doctest] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/ghc
  2909. 794.55 s [doctest] Using ghc-pkg version 9.8.4 found on system at:
  2910. 794.55 s [doctest] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/ghc-pkg-9.8.4
  2911. 794.55 s [doctest] No ghcjs found
  2912. 794.55 s [doctest] No ghcjs-pkg found
  2913. 794.55 s [doctest] No greencard found
  2914. 794.55 s [doctest] Using haddock version 2.30.0 found on system at:
  2915. 794.55 s [doctest] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/haddock-ghc-9.8.4
  2916. 794.55 s [doctest] No happy found
  2917. 794.55 s [doctest] Using haskell-suite found on system at: haskell-suite-dummy-location
  2918. 794.55 s [doctest] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  2919. 794.55 s [doctest] No hmake found
  2920. 794.55 s [doctest] Using hpc version 0.69 found on system at:
  2921. 794.55 s [doctest] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/hpc-ghc-9.8.4
  2922. 794.55 s [doctest] Using hsc2hs version 0.68.10 found on system at:
  2923. 794.55 s [doctest] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/hsc2hs-ghc-9.8.4
  2924. 794.55 s [doctest] Using hscolour version 1.25 found on system at:
  2925. 794.61 s [doctest] /nix/store/vl14mqkz7z183r6sq9qz932j3pix6v5c-hscolour-1.25/bin/HsColour
  2926. 794.61 s [doctest] No jhc found
  2927. 794.61 s [doctest] Using ld found on system at:
  2928. 794.61 s [doctest] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ld.gold
  2929. 794.61 s [doctest] No pkg-config found
  2930. 794.61 s [doctest] Using runghc version 9.8.4 found on system at:
  2931. 794.61 s [doctest] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/runghc-9.8.4
  2932. 794.61 s [doctest] Using strip version 2.44 found on system at:
  2933. 794.61 s [doctest] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
  2934. 794.61 s [doctest] Using tar found on system at:
  2935. 794.61 s [doctest] /nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
  2936. 794.61 s [doctest] No uhc found
  2937. 794.99 s [doctest] Phase: buildPhase
  2938. 795.25 s [doctest] Preprocessing test suite 'spec' for doctest-0.24.2..
  2939. 795.28 s [doctest] Building test suite 'spec' for doctest-0.24.2..
  2940. 796.70 s [doctest] [ 1 of 44] Compiling Imports ( src/Imports.hs, dist/build/spec/spec-tmp/Imports.o )
  2941. 796.92 s [doctest] [ 2 of 44] Compiling GhcUtil ( src/GhcUtil.hs, dist/build/spec/spec-tmp/GhcUtil.o )
  2942. 799.34 s [doctest] [ 3 of 44] Compiling Cabal.ReplOptions ( src/Cabal/ReplOptions.hs, dist/build/spec/spec-tmp/Cabal/ReplOptions.o )
  2943. 799.34 s [doctest] [ 4 of 44] Compiling Cabal.ReplOptionsSpec ( test/Cabal/ReplOptionsSpec.hs, dist/build/spec/spec-tmp/Cabal/ReplOptionsSpec.o )
  2944. 799.43 s [doctest] [ 5 of 44] Compiling Cabal.Paths ( src/Cabal/Paths.hs, dist/build/spec/spec-tmp/Cabal/Paths.o )
  2945. 799.43 s [doctest] [ 6 of 44] Compiling Cabal.Options ( src/Cabal/Options.hs, dist/build/spec/spec-tmp/Cabal/Options.o )
  2946. 799.43 s [doctest] [ 7 of 44] Compiling Cabal.OptionsSpec ( test/Cabal/OptionsSpec.hs, dist/build/spec/spec-tmp/Cabal/OptionsSpec.o )
  2947. 799.91 s [doctest] [ 8 of 44] Compiling Language.Haskell.GhciWrapper ( src/Language/Haskell/GhciWrapper.hs, dist/build/spec/spec-tmp/Language/Haskell/GhciWrapper.o )
  2948. 799.91 s [doctest] [ 9 of 44] Compiling Interpreter ( src/Interpreter.hs, dist/build/spec/spec-tmp/Interpreter.o )
  2949. 799.91 s [doctest] [10 of 44] Compiling InterpreterSpec ( test/InterpreterSpec.hs, dist/build/spec/spec-tmp/InterpreterSpec.o )
  2950. 799.91 s [doctest] [11 of 44] Compiling Info ( src/Info.hs, dist/build/spec/spec-tmp/Info.o )
  2951. 799.91 s [doctest] [12 of 44] Compiling InfoSpec ( test/InfoSpec.hs, dist/build/spec/spec-tmp/InfoSpec.o )
  2952. 799.91 s [doctest] [13 of 44] Compiling Cabal ( src/Cabal.hs, dist/build/spec/spec-tmp/Cabal.o )
  2953. 799.91 s [doctest] [14 of 44] Compiling Cabal.PathsSpec ( test/Cabal/PathsSpec.hs, dist/build/spec/spec-tmp/Cabal/PathsSpec.o )
  2954. 799.91 s [doctest] [15 of 44] Compiling Language.Haskell.GhciWrapperSpec ( test/Language/Haskell/GhciWrapperSpec.hs, dist/build/spec/spec-tmp/Language/Haskell/GhciWrapperSpec.o )
  2955. 799.91 s [doctest] [16 of 44] Compiling Location ( src/Location.hs, dist/build/spec/spec-tmp/Location.o )
  2956. 799.91 s [doctest] [17 of 44] Compiling LocationSpec ( test/LocationSpec.hs, dist/build/spec/spec-tmp/LocationSpec.o )
  2957. 799.91 s [doctest] [18 of 44] Compiling Options ( src/Options.hs, dist/build/spec/spec-tmp/Options.o )
  2958. 799.91 s [doctest] [19 of 44] Compiling OptionsSpec ( test/OptionsSpec.hs, dist/build/spec/spec-tmp/OptionsSpec.o )
  2959. 800.11 s [doctest] [20 of 44] Compiling PackageDBs ( src/PackageDBs.hs, dist/build/spec/spec-tmp/PackageDBs.o )
  2960. 800.11 s [doctest] [21 of 44] Compiling PackageDBsSpec ( test/PackageDBsSpec.hs, dist/build/spec/spec-tmp/PackageDBsSpec.o )
  2961. 800.11 s [doctest] [22 of 44] Compiling Paths_doctest ( dist/build/spec/autogen/Paths_doctest.hs, dist/build/spec/spec-tmp/Paths_doctest.o )
  2962. 800.11 s [doctest] [23 of 44] Compiling Test.DocTest.Internal.Cabal ( src/Test/DocTest/Internal/Cabal.hs, dist/build/spec/spec-tmp/Test/DocTest/Internal/Cabal.o )
  2963. 800.11 s [doctest] [24 of 44] Compiling Test.DocTest.Internal.Location ( src/Test/DocTest/Internal/Location.hs, dist/build/spec/spec-tmp/Test/DocTest/Internal/Location.o )
  2964. 800.11 s [doctest] [25 of 44] Compiling Util ( src/Util.hs, dist/build/spec/spec-tmp/Util.o )
  2965. 800.11 s [doctest] [26 of 44] Compiling Extract ( src/Extract.hs, dist/build/spec/spec-tmp/Extract.o )
  2966. 800.52 s [doctest] [27 of 44] Compiling Test.DocTest.Internal.Extract ( src/Test/DocTest/Internal/Extract.hs, dist/build/spec/spec-tmp/Test/DocTest/Internal/Extract.o )
  2967. 800.54 s [doctest] [28 of 44] Compiling Parse ( src/Parse.hs, dist/build/spec/spec-tmp/Parse.o )
  2968. 801.09 s [doctest] [29 of 44] Compiling Test.DocTest.Internal.Parse ( src/Test/DocTest/Internal/Parse.hs, dist/build/spec/spec-tmp/Test/DocTest/Internal/Parse.o )
  2969. 801.11 s [doctest] [30 of 44] Compiling Runner.Example ( src/Runner/Example.hs, dist/build/spec/spec-tmp/Runner/Example.o )
  2970. 801.76 s [doctest] [31 of 44] Compiling Runner.ExampleSpec ( test/Runner/ExampleSpec.hs, dist/build/spec/spec-tmp/Runner/ExampleSpec.o )
  2971. 802.85 s [doctest] [32 of 44] Compiling Property ( src/Property.hs, dist/build/spec/spec-tmp/Property.o )
  2972. 802.85 s [doctest] [33 of 44] Compiling Runner ( src/Runner.hs, dist/build/spec/spec-tmp/Runner.o )
  2973. 802.85 s [doctest] [34 of 44] Compiling RunnerSpec ( test/RunnerSpec.hs, dist/build/spec/spec-tmp/RunnerSpec.o )
  2974. 802.94 s [doctest] [35 of 44] Compiling Run ( src/Run.hs, dist/build/spec/spec-tmp/Run.o )
  2975. 803.03 s [doctest] [36 of 44] Compiling Test.DocTest.Internal.Run ( src/Test/DocTest/Internal/Run.hs, dist/build/spec/spec-tmp/Test/DocTest/Internal/Run.o )
  2976. 803.06 s [doctest] [37 of 44] Compiling Test.DocTest ( src/Test/DocTest.hs, dist/build/spec/spec-tmp/Test/DocTest.o )
  2977. 803.07 s [doctest] [38 of 44] Compiling RunSpec ( test/RunSpec.hs, dist/build/spec/spec-tmp/RunSpec.o )
  2978. 803.92 s [doctest] [39 of 44] Compiling MainSpec ( test/MainSpec.hs, dist/build/spec/spec-tmp/MainSpec.o )
  2979. 804.20 s [doctest] [40 of 44] Compiling PropertySpec ( test/PropertySpec.hs, dist/build/spec/spec-tmp/PropertySpec.o )
  2980. 804.20 s [doctest] [41 of 44] Compiling ParseSpec ( test/ParseSpec.hs, dist/build/spec/spec-tmp/ParseSpec.o )
  2981. 804.20 s [doctest] [42 of 44] Compiling ExtractSpec ( test/ExtractSpec.hs, dist/build/spec/spec-tmp/ExtractSpec.o )
  2982. 804.20 s [doctest] [43 of 44] Compiling UtilSpec ( test/UtilSpec.hs, dist/build/spec/spec-tmp/UtilSpec.o )
  2983. 804.20 s [doctest] [44 of 44] Compiling Main ( test/Spec.hs, dist/build/spec/spec-tmp/Main.o )
  2984. 806.83 s [cabal-doctest] Documentation created: dist/doc/html/cabal-doctest/,
  2985. 806.83 s [cabal-doctest] dist/doc/html/cabal-doctest/cabal-doctest.txt
  2986. 807.11 s [cabal-doctest] Phase: installPhase
  2987. 807.28 s [cabal-doctest] Installing library in /nix/store/cqcznxgaasil9l8ih22jn7s2p210cc1p-cabal-doctest-1.0.12/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/cabal-doctest-1.0.12-6eNFXUHk9Gq3ra8KFUi2H2
  2988. 807.76 s [doctest] [45 of 45] Linking dist/build/spec/spec
  2989. 807.92 s [cabal-doctest] Phase: fixupPhase
  2990. 807.99 s [cabal-doctest] shrinking RPATHs of ELF executables and libraries in /nix/store/cqcznxgaasil9l8ih22jn7s2p210cc1p-cabal-doctest-1.0.12
  2991. 808.00 s [cabal-doctest] shrinking /nix/store/cqcznxgaasil9l8ih22jn7s2p210cc1p-cabal-doctest-1.0.12/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/libHScabal-doctest-1.0.12-6eNFXUHk9Gq3ra8KFUi2H2-ghc9.8.4.so
  2992. 808.02 s [cabal-doctest] checking for references to /build/ in /nix/store/cqcznxgaasil9l8ih22jn7s2p210cc1p-cabal-doctest-1.0.12...
  2993. 808.06 s [cabal-doctest] patching script interpreter paths in /nix/store/cqcznxgaasil9l8ih22jn7s2p210cc1p-cabal-doctest-1.0.12
  2994. 808.07 s [cabal-doctest] stripping (with command strip and flags -S -p) in /nix/store/cqcznxgaasil9l8ih22jn7s2p210cc1p-cabal-doctest-1.0.12/lib
  2995. 808.24 s [cabal-doctest] shrinking RPATHs of ELF executables and libraries in /nix/store/w5m81x33rz9wr4qg240synd80yyk58y1-cabal-doctest-1.0.12-doc
  2996. 808.25 s [cabal-doctest] checking for references to /build/ in /nix/store/w5m81x33rz9wr4qg240synd80yyk58y1-cabal-doctest-1.0.12-doc...
  2997. 808.29 s [cabal-doctest] patching script interpreter paths in /nix/store/w5m81x33rz9wr4qg240synd80yyk58y1-cabal-doctest-1.0.12-doc
  2998. 808.58 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/cqcznxgaasil9l8ih22jn7s2p210cc1p-cabal-doctest-1.0.12 /nix/store/w5m81x33rz9wr4qg240synd80yyk58y1-cabal-doctest-1.0.12-doc
  2999. 810.03 s [post-build-hook] Nothing to push - all store paths are already on Cachix.
  3000. 810.16 s [post-build-hook] Uploading to the NixCI cache: /nix/store/cqcznxgaasil9l8ih22jn7s2p210cc1p-cabal-doctest-1.0.12 /nix/store/w5m81x33rz9wr4qg240synd80yyk58y1-cabal-doctest-1.0.12-doc
  3001. 810.66 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  3002. 810.86 s [post-build-hook] copying 1 paths...
  3003. 810.86 s [post-build-hook] copying path '/nix/store/cqcznxgaasil9l8ih22jn7s2p210cc1p-cabal-doctest-1.0.12' to 'https://cache.nix-ci.com'...
  3004. 811.99 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  3005. 812.53 s [post-build-hook] copying 0 paths...
  3006. 812.71 s Progress: 4 of 22 built (1 building), 160 of 160 downloaded from cache
  3007. 823.23 s [doctest] Preprocessing library for doctest-0.24.2..
  3008. 823.27 s [doctest] Building library for doctest-0.24.2..
  3009. 824.53 s [doctest] [ 1 of 26] Compiling Imports ( src/Imports.hs, dist/build/Imports.o, dist/build/Imports.dyn_o )
  3010. 825.18 s [doctest] [ 2 of 26] Compiling GhcUtil ( src/GhcUtil.hs, dist/build/GhcUtil.o, dist/build/GhcUtil.dyn_o )
  3011. 830.45 s [doctest] [ 3 of 26] Compiling Cabal.ReplOptions ( src/Cabal/ReplOptions.hs, dist/build/Cabal/ReplOptions.o, dist/build/Cabal/ReplOptions.dyn_o )
  3012. 830.49 s [doctest] [ 4 of 26] Compiling Cabal.Paths ( src/Cabal/Paths.hs, dist/build/Cabal/Paths.o, dist/build/Cabal/Paths.dyn_o )
  3013. 830.49 s [doctest] [ 5 of 26] Compiling Cabal.Options ( src/Cabal/Options.hs, dist/build/Cabal/Options.o, dist/build/Cabal/Options.dyn_o )
  3014. 830.49 s [doctest] [ 6 of 26] Compiling Language.Haskell.GhciWrapper ( src/Language/Haskell/GhciWrapper.hs, dist/build/Language/Haskell/GhciWrapper.o, dist/build/Language/Haskell/GhciWrapper.dyn_o )
  3015. 830.49 s [doctest] [ 7 of 26] Compiling Interpreter ( src/Interpreter.hs, dist/build/Interpreter.o, dist/build/Interpreter.dyn_o )
  3016. 830.49 s [doctest] [ 8 of 26] Compiling Location ( src/Location.hs, dist/build/Location.o, dist/build/Location.dyn_o )
  3017. 830.49 s [doctest] [ 9 of 26] Compiling PackageDBs ( src/PackageDBs.hs, dist/build/PackageDBs.o, dist/build/PackageDBs.dyn_o )
  3018. 830.49 s [doctest] [10 of 26] Compiling Paths_doctest ( dist/build/autogen/Paths_doctest.hs, dist/build/Paths_doctest.o, dist/build/Paths_doctest.dyn_o )
  3019. 830.49 s [doctest] [11 of 26] Compiling Info ( src/Info.hs, dist/build/Info.o, dist/build/Info.dyn_o )
  3020. 830.49 s [doctest] [12 of 26] Compiling Options ( src/Options.hs, dist/build/Options.o, dist/build/Options.dyn_o )
  3021. 830.49 s [doctest] [13 of 26] Compiling Cabal ( src/Cabal.hs, dist/build/Cabal.o, dist/build/Cabal.dyn_o )
  3022. 830.49 s [doctest] [14 of 26] Compiling Test.DocTest.Internal.Cabal ( src/Test/DocTest/Internal/Cabal.hs, dist/build/Test/DocTest/Internal/Cabal.o, dist/build/Test/DocTest/Internal/Cabal.dyn_o )
  3023. 830.49 s [doctest] [15 of 26] Compiling Test.DocTest.Internal.Location ( src/Test/DocTest/Internal/Location.hs, dist/build/Test/DocTest/Internal/Location.o, dist/build/Test/DocTest/Internal/Location.dyn_o )
  3024. 830.49 s [doctest] [16 of 26] Compiling Util ( src/Util.hs, dist/build/Util.o, dist/build/Util.dyn_o )
  3025. 830.49 s [doctest] [17 of 26] Compiling Extract ( src/Extract.hs, dist/build/Extract.o, dist/build/Extract.dyn_o )
  3026. 832.69 s [doctest] [18 of 26] Compiling Test.DocTest.Internal.Extract ( src/Test/DocTest/Internal/Extract.hs, dist/build/Test/DocTest/Internal/Extract.o, dist/build/Test/DocTest/Internal/Extract.dyn_o )
  3027. 832.76 s [doctest] [19 of 26] Compiling Parse ( src/Parse.hs, dist/build/Parse.o, dist/build/Parse.dyn_o )
  3028. 833.63 s [doctest] [20 of 26] Compiling Test.DocTest.Internal.Parse ( src/Test/DocTest/Internal/Parse.hs, dist/build/Test/DocTest/Internal/Parse.o, dist/build/Test/DocTest/Internal/Parse.dyn_o )
  3029. 833.71 s [doctest] [21 of 26] Compiling Runner.Example ( src/Runner/Example.hs, dist/build/Runner/Example.o, dist/build/Runner/Example.dyn_o )
  3030. 834.92 s [doctest] [22 of 26] Compiling Property ( src/Property.hs, dist/build/Property.o, dist/build/Property.dyn_o )
  3031. 834.92 s [doctest] [23 of 26] Compiling Runner ( src/Runner.hs, dist/build/Runner.o, dist/build/Runner.dyn_o )
  3032. 836.58 s [doctest] [24 of 26] Compiling Run ( src/Run.hs, dist/build/Run.o, dist/build/Run.dyn_o )
  3033. 837.07 s [doctest] [25 of 26] Compiling Test.DocTest.Internal.Run ( src/Test/DocTest/Internal/Run.hs, dist/build/Test/DocTest/Internal/Run.o, dist/build/Test/DocTest/Internal/Run.dyn_o )
  3034. 837.12 s [doctest] [26 of 26] Compiling Test.DocTest ( src/Test/DocTest.hs, dist/build/Test/DocTest.o, dist/build/Test/DocTest.dyn_o )
  3035. 839.05 s [doctest] [ 1 of 26] Compiling Imports ( src/Imports.hs, dist/build/Imports.p_o )
  3036. 839.76 s [doctest] [ 2 of 26] Compiling GhcUtil ( src/GhcUtil.hs, dist/build/GhcUtil.p_o )
  3037. 845.04 s [doctest] [ 3 of 26] Compiling Cabal.ReplOptions ( src/Cabal/ReplOptions.hs, dist/build/Cabal/ReplOptions.p_o )
  3038. 845.08 s [doctest] [ 4 of 26] Compiling Cabal.Paths ( src/Cabal/Paths.hs, dist/build/Cabal/Paths.p_o )
  3039. 845.08 s [doctest] [ 5 of 26] Compiling Cabal.Options ( src/Cabal/Options.hs, dist/build/Cabal/Options.p_o )
  3040. 845.08 s [doctest] [ 6 of 26] Compiling Language.Haskell.GhciWrapper ( src/Language/Haskell/GhciWrapper.hs, dist/build/Language/Haskell/GhciWrapper.p_o )
  3041. 845.08 s [doctest] [ 7 of 26] Compiling Interpreter ( src/Interpreter.hs, dist/build/Interpreter.p_o )
  3042. 845.08 s [doctest] [ 8 of 26] Compiling Location ( src/Location.hs, dist/build/Location.p_o )
  3043. 845.08 s [doctest] [ 9 of 26] Compiling PackageDBs ( src/PackageDBs.hs, dist/build/PackageDBs.p_o )
  3044. 845.08 s [doctest] [10 of 26] Compiling Paths_doctest ( dist/build/autogen/Paths_doctest.hs, dist/build/Paths_doctest.p_o )
  3045. 845.08 s [doctest] [11 of 26] Compiling Info ( src/Info.hs, dist/build/Info.p_o )
  3046. 845.08 s [doctest] [12 of 26] Compiling Options ( src/Options.hs, dist/build/Options.p_o )
  3047. 845.53 s [doctest] [13 of 26] Compiling Cabal ( src/Cabal.hs, dist/build/Cabal.p_o )
  3048. 845.53 s [doctest] [14 of 26] Compiling Test.DocTest.Internal.Cabal ( src/Test/DocTest/Internal/Cabal.hs, dist/build/Test/DocTest/Internal/Cabal.p_o )
  3049. 845.83 s [doctest] [15 of 26] Compiling Test.DocTest.Internal.Location ( src/Test/DocTest/Internal/Location.hs, dist/build/Test/DocTest/Internal/Location.p_o )
  3050. 845.83 s [doctest] [16 of 26] Compiling Util ( src/Util.hs, dist/build/Util.p_o )
  3051. 845.83 s [doctest] [17 of 26] Compiling Extract ( src/Extract.hs, dist/build/Extract.p_o )
  3052. 846.96 s [doctest] [18 of 26] Compiling Test.DocTest.Internal.Extract ( src/Test/DocTest/Internal/Extract.hs, dist/build/Test/DocTest/Internal/Extract.p_o )
  3053. 847.33 s [doctest] [19 of 26] Compiling Parse ( src/Parse.hs, dist/build/Parse.p_o )
  3054. 848.09 s [doctest] [20 of 26] Compiling Test.DocTest.Internal.Parse ( src/Test/DocTest/Internal/Parse.hs, dist/build/Test/DocTest/Internal/Parse.p_o )
  3055. 848.40 s [doctest] [21 of 26] Compiling Runner.Example ( src/Runner/Example.hs, dist/build/Runner/Example.p_o )
  3056. 849.30 s [doctest] [22 of 26] Compiling Property ( src/Property.hs, dist/build/Property.p_o )
  3057. 849.30 s [doctest] [23 of 26] Compiling Runner ( src/Runner.hs, dist/build/Runner.p_o )
  3058. 850.56 s [doctest] [24 of 26] Compiling Run ( src/Run.hs, dist/build/Run.p_o )
  3059. 851.04 s [doctest] [25 of 26] Compiling Test.DocTest.Internal.Run ( src/Test/DocTest/Internal/Run.hs, dist/build/Test/DocTest/Internal/Run.p_o )
  3060. 851.28 s [doctest] [26 of 26] Compiling Test.DocTest ( src/Test/DocTest.hs, dist/build/Test/DocTest.p_o )
  3061. 862.26 s [doctest] Preprocessing executable 'doctest' for doctest-0.24.2..
  3062. 862.26 s [doctest] Building executable 'doctest' for doctest-0.24.2..
  3063. 862.52 s [doctest] [1 of 2] Compiling Main ( driver/doctest.hs, dist/build/doctest/doctest-tmp/Main.o )
  3064. 863.08 s [doctest] [2 of 2] Compiling Paths_doctest ( dist/build/doctest/autogen/Paths_doctest.hs, dist/build/doctest/doctest-tmp/Paths_doctest.o )
  3065. 863.70 s [doctest] [3 of 3] Linking dist/build/doctest/doctest
  3066. 871.66 s [doctest] buildPhase completed in 1 minutes 17 seconds
  3067. 871.66 s [doctest] Phase: checkPhase
  3068. 871.87 s [doctest] Running 1 test suites...
  3069. 871.87 s [doctest] Test suite spec: RUNNING...
  3070. 871.93 s [doctest]
  3071. 871.93 s [doctest] Extract
  3072. 871.93 s [doctest] extract
  3073. 872.05 s [doctest] extracts documentation for a top-level declaration [✔]
  3074. 872.11 s [doctest] extracts documentation from argument list [✔]
  3075. 872.19 s [doctest] extracts documentation for a type class function [✔]
  3076. 872.28 s [doctest] extracts documentation from the argument list of a type class function [✔]
  3077. 872.34 s [doctest] extracts documentation from the module header [✔]
  3078. 872.44 s [doctest] extracts documentation from imported modules [✔]
  3079. 872.53 s [doctest] extracts documentation from export list [✔]
  3080. 872.62 s [doctest] extracts documentation from named chunks [✔]
  3081. 872.69 s [doctest] returns docstrings in the same order they appear in the source [✔]
  3082. 872.78 s [doctest] extracts $setup code [✔]
  3083. 872.85 s [doctest] fails on invalid flags [✔]
  3084. 872.85 s [doctest] extract (regression tests)
  3085. 872.97 s [doctest] works with infix operators [✔]
  3086. 873.05 s [doctest] works with parallel list comprehensions [✔]
  3087. 873.13 s [doctest] works with list comprehensions in instance definitions [✔]
  3088. 873.19 s [doctest] works with foreign imports [✔]
  3089. 873.25 s [doctest] works for rewrite rules [✔]
  3090. 873.32 s [doctest] works for rewrite rules with type signatures [✔]
  3091. 873.39 s [doctest] strips CR from dos line endings [✔]
  3092. 873.47 s [doctest] works with a module that splices in an expression from an other module [✔]
  3093. 873.54 s [doctest] works for type families and GHC 7.6.1 [✔]
  3094. 873.54 s [doctest] Info
  3095. 873.54 s [doctest] formatInfo
  3096. 873.65 s [doctest] formats --info output [✔]
  3097. 873.65 s [doctest] Interpreter
  3098. 873.65 s [doctest] interpreterSupported
  3099. 873.74 s [doctest] indicates whether GHCi is supported on current platform [✔]
  3100. 873.74 s [doctest] ghcInfo
  3101. 873.87 s [doctest] includes "Have interpreter" [✔]
  3102. 873.88 s [doctest] safeEval
  3103. 874.39 s [doctest] evaluates an expression [✔]
  3104. 874.98 s [doctest] returns Left on unterminated multiline command [✔]
  3105. 874.98 s [doctest] filterExpression
  3106. 874.98 s [doctest] removes :set -XTemplateHaskell [✔]
  3107. 874.98 s [doctest] filters -XTemplateHaskell [✔]
  3108. 874.98 s [doctest] leaves :set-statement that do not set -XTemplateHaskell alone [✔]
  3109. 874.98 s [doctest] Language.Haskell.GhciWrapper
  3110. 874.98 s [doctest] evalEcho
  3111. 875.56 s [doctest] prints result to stdout [✔]
  3112. 875.56 s [doctest] evalWith
  3113. 875.56 s [doctest] with PreserveIt
  3114. 876.13 s [doctest] preserves it [✔]
  3115. 876.13 s [doctest] eval
  3116. 876.63 s [doctest] shows literals [✔]
  3117. 877.32 s [doctest] shows string literals containing Unicode [✔]
  3118. 878.00 s [doctest] evaluates simple expressions [✔]
  3119. 878.62 s [doctest] supports let bindings [✔]
  3120. 879.26 s [doctest] allows import statements [✔]
  3121. 879.83 s [doctest] captures stdout [✔]
  3122. 880.41 s [doctest] captures stdout (Unicode) [✔]
  3123. 880.98 s [doctest] captures stdout (empty line) [✔]
  3124. 881.39 s [doctest] captures stdout (multiple lines) [✔]
  3125. 881.94 s [doctest] captures stderr [✔]
  3126. 882.42 s [doctest] captures stderr (Unicode) [✔]
  3127. 882.94 s [doctest] shows exceptions [✔]
  3128. 883.62 s [doctest] shows exceptions (ExitCode) [✔]
  3129. 884.21 s [doctest] gives an error message for identifiers that are not in scope [✔]
  3130. 884.25 s [doctest] when configVerbose is True
  3131. 884.67 s [doctest] prints prompt [✔]
  3132. 884.67 s [doctest] with -XOverloadedStrings, -Wall and -Werror
  3133. 885.21 s [doctest] does not fail on marker expression (bug fix) [✔]
  3134. 885.21 s [doctest] with NoImplicitPrelude
  3135. 885.78 s [doctest] works [✔]
  3136. 885.78 s [doctest] with a strange String type
  3137. 886.41 s [doctest] works [✔]
  3138. 886.41 s [doctest] Location
  3139. 886.41 s [doctest] toLocation
  3140. 886.41 s [doctest] works for a regular SrcSpan [✔]
  3141. 886.41 s [doctest] works for a single-line SrcSpan [✔]
  3142. 886.41 s [doctest] works for a SrcSpan that corresponds to single point [✔]
  3143. 886.41 s [doctest] works for a bad SrcSpan [✔]
  3144. 886.41 s [doctest] works for a SrcLoc with bad locations [✔]
  3145. 886.41 s [doctest] enumerate
  3146. 886.41 s [doctest] replicates UnhelpfulLocation [✔]
  3147. 886.41 s [doctest] enumerates Location [✔]
  3148. 886.41 s [doctest] Main
  3149. 886.41 s [doctest] doctest
  3150. 887.05 s [doctest] testSimple [✔]
  3151. 887.87 s [doctest] it-variable [✔]
  3152. 888.74 s [doctest] it-variable in $setup [✔]
  3153. 889.26 s [doctest] failing [✔]
  3154. 889.78 s [doctest] skips subsequent examples from the same group if an example fails [✔]
  3155. 889.78 s [doctest] without --fail-fast
  3156. 890.53 s [doctest] continuous even if some tests fail [✔]
  3157. 890.53 s [doctest] with --fail-fast
  3158. 891.19 s [doctest] stops after the first failure [✔]
  3159. 892.02 s [doctest] stops after failures in $setup [✔]
  3160. 893.43 s [doctest] testImport [✔]
  3161. 894.29 s [doctest] testCommentLocation [✔]
  3162. 895.01 s [doctest] testPutStr [✔]
  3163. 895.61 s [doctest] fails on multi-line expressions, introduced with :{ [✔]
  3164. 896.32 s [doctest] testBlankline [✔]
  3165. 897.14 s [doctest] examples from the same Haddock comment share the same scope [✔]
  3166. 897.88 s [doctest] testDocumentationForArguments [✔]
  3167. 898.62 s [doctest] template-haskell [✔]
  3168. 899.26 s [doctest] handles source files with CRLF line endings [✔]
  3169. 899.93 s [doctest] runs $setup before each test group [✔]
  3170. 900.71 s [doctest] skips subsequent tests from a module, if $setup fails [✔]
  3171. 901.47 s [doctest] ignores trailing whitespace when matching test output [✔]
  3172. 901.51 s [doctest] doctest as a runner for QuickCheck properties
  3173. 902.39 s [doctest] runs a boolean property [✔]
  3174. 903.18 s [doctest] runs an explicitly quantified property [✔]
  3175. 904.03 s [doctest] runs an implicitly quantified property [✔]
  3176. 904.82 s [doctest] reports a failing property [✔]
  3177. 905.67 s [doctest] runs a boolean property with an explicit type signature [✔]
  3178. 906.58 s [doctest] runs $setup before each property [✔]
  3179. 906.58 s [doctest] doctest (regression tests)
  3180. 907.75 s [doctest] bugfixWorkingDirectory [✔]
  3181. 908.40 s [doctest] bugfixOutputToStdErr [✔]
  3182. 909.09 s [doctest] bugfixImportHierarchical [✔]
  3183. 909.55 s [doctest] bugfixMultipleModules [✔]
  3184. 910.93 s [doctest] testCPP [✔]
  3185. 911.88 s [doctest] template-haskell-bugfix [✔]
  3186. 912.34 s [doctest] doesn't clash with user bindings of stdout/stderr [✔]
  3187. 912.98 s [doctest] doesn't get confused by doctests using System.IO imports [✔]
  3188. 913.02 s [doctest] Options
  3189. 913.03 s [doctest] parseOptions
  3190. 913.03 s [doctest] strips --optghc [✔]
  3191. 913.03 s [doctest] strips --optghc= [✔]
  3192. 913.03 s [doctest] with ghc options that are not valid with --interactive
  3193. 913.06 s [doctest] returns ProxyToGhc [✔]
  3194. 913.06 s [doctest] +++ OK, passed 100 tests.
  3195. 913.06 s [doctest] with --interactive
  3196. 913.06 s [doctest] disables magic mode [✔]
  3197. 913.06 s [doctest] filters out --interactive [✔]
  3198. 913.06 s [doctest] accepts --fast [✔]
  3199. 913.06 s [doctest] --no-magic
  3200. 913.06 s [doctest] without --no-magic
  3201. 913.06 s [doctest] enables magic mode [✔]
  3202. 913.06 s [doctest] with --no-magic
  3203. 913.06 s [doctest] disables magic mode [✔]
  3204. 913.06 s [doctest] --fast
  3205. 913.06 s [doctest] without --fast
  3206. 913.06 s [doctest] disables fast mode [✔]
  3207. 913.06 s [doctest] with --fast
  3208. 913.06 s [doctest] enables fast mode [✔]
  3209. 913.06 s [doctest] --preserve-it
  3210. 913.06 s [doctest] without --preserve-it
  3211. 913.06 s [doctest] does not preserve the `it` variable [✔]
  3212. 913.06 s [doctest] with --preserve-it
  3213. 913.06 s [doctest] preserves the `it` variable [✔]
  3214. 913.06 s [doctest] --fail-fast
  3215. 913.06 s [doctest] without --fail-fast
  3216. 913.06 s [doctest] disables fail-fast mode [✔]
  3217. 913.06 s [doctest] with --fail-fast
  3218. 913.06 s [doctest] enables fail-fast mode [✔]
  3219. 913.06 s [doctest] with --help
  3220. 913.06 s [doctest] outputs usage information [✔]
  3221. 913.06 s [doctest] with --version
  3222. 913.06 s [doctest] outputs version information [✔]
  3223. 913.06 s [doctest] with --info
  3224. 913.16 s [doctest] outputs machine readable version information [✔]
  3225. 913.16 s [doctest] --verbose
  3226. 913.16 s [doctest] without --verbose
  3227. 913.16 s [doctest] is not verbose by default [✔]
  3228. 913.16 s [doctest] with --verbose
  3229. 913.16 s [doctest] parses verbose option [✔]
  3230. 913.16 s [doctest] PackageDBs
  3231. 913.16 s [doctest] getPackageDBsFromEnv
  3232. 913.16 s [doctest] uses global and user when no env used [✔]
  3233. 913.16 s [doctest] respects GHC_PACKAGE_PATH [✔]
  3234. 913.16 s [doctest] Parse
  3235. 913.16 s [doctest] extractDocTests
  3236. 913.21 s [doctest] extracts properties from a module [✔]
  3237. 913.28 s [doctest] extracts examples from a module [✔]
  3238. 913.35 s [doctest] extracts examples from documentation for non-exported names [✔]
  3239. 913.41 s [doctest] extracts multiple examples from a module [✔]
  3240. 913.47 s [doctest] returns an empty list, if documentation contains no examples [✔]
  3241. 913.53 s [doctest] sets setup code to Nothing, if it does not contain any tests [✔]
  3242. 913.57 s [doctest] keeps modules that only contain setup code [✔]
  3243. 913.57 s [doctest] parseInteractions (an internal function)
  3244. 913.57 s [doctest] parses an interaction [✔]
  3245. 913.57 s [doctest] drops whitespace as appropriate [✔]
  3246. 913.57 s [doctest] parses an interaction without a result [✔]
  3247. 913.57 s [doctest] works with a complex example [✔]
  3248. 913.57 s [doctest] attaches location information to parsed interactions [✔]
  3249. 913.57 s [doctest] basic multiline [✔]
  3250. 913.57 s [doctest] multiline align output [✔]
  3251. 913.57 s [doctest] multiline align output with >>> [✔]
  3252. 913.57 s [doctest] parses wild cards lines [✔]
  3253. 913.57 s [doctest] parses wild card chunks [✔]
  3254. 913.57 s [doctest] parseProperties (an internal function)
  3255. 913.57 s [doctest] parses a property [✔]
  3256. 913.57 s [doctest] mkLineChunks (an internal function)
  3257. 913.57 s [doctest] replaces ellipsis with WildCardChunks [✔]
  3258. 913.57 s [doctest] doesn't replace fewer than 3 consecutive dots [✔]
  3259. 913.57 s [doctest] handles leading and trailing dots [✔]
  3260. 913.57 s [doctest] handles leading and trailing ellipsis [✔]
  3261. 913.57 s [doctest] Property
  3262. 913.57 s [doctest] runProperty
  3263. 914.16 s [doctest] reports a failing property [✔]
  3264. 914.68 s [doctest] runs a Bool property [✔]
  3265. 915.26 s [doctest] runs a Bool property with an explicit type signature [✔]
  3266. 915.92 s [doctest] runs an implicitly quantified property [✔]
  3267. 916.57 s [doctest] runs an implicitly quantified property even with GHC 7.4 [✔]
  3268. 917.11 s [doctest] runs an explicitly quantified property [✔]
  3269. 917.72 s [doctest] allows to mix implicit and explicit quantification [✔]
  3270. 918.29 s [doctest] reports the value for which a property fails [✔]
  3271. 919.01 s [doctest] reports the values for which a property that takes multiple arguments fails [✔]
  3272. 919.64 s [doctest] defaults ambiguous type variables to Integer [✔]
  3273. 919.64 s [doctest] freeVariables
  3274. 920.04 s [doctest] finds a free variables in a term [✔]
  3275. 920.46 s [doctest] ignores duplicates [✔]
  3276. 920.92 s [doctest] works for terms with multiple names [✔]
  3277. 921.38 s [doctest] works for names that contain a prime [✔]
  3278. 921.86 s [doctest] works for names that are similar to other names that are in scope [✔]
  3279. 921.86 s [doctest] parseNotInScope
  3280. 921.86 s [doctest] when error message was produced by GHC 7.4.1
  3281. 921.86 s [doctest] extracts a variable name of variable that is not in scope from an error message [✔]
  3282. 921.86 s [doctest] ignores duplicates [✔]
  3283. 921.86 s [doctest] works for variable names that contain a prime [✔]
  3284. 921.86 s [doctest] works for error messages with suggestions [✔]
  3285. 921.86 s [doctest] when error message was produced by GHC 8.0.1
  3286. 921.86 s [doctest] extracts a variable name of variable that is not in scope from an error message [✔]
  3287. 921.86 s [doctest] ignores duplicates [✔]
  3288. 921.86 s [doctest] works for variable names that contain a prime [✔]
  3289. 921.86 s [doctest] works for error messages with suggestions [✔]
  3290. 921.86 s [doctest] Run
  3291. 921.86 s [doctest] doctest
  3292. 922.46 s [doctest] exits with ExitFailure if at least one test case fails [✔]
  3293. 922.46 s [doctest] prints help on --help [✔]
  3294. 922.46 s [doctest] prints version on --version [✔]
  3295. 923.20 s [doctest] accepts arbitrary GHC options [✔]
  3296. 923.79 s [doctest] accepts GHC options with --optghc [✔]
  3297. 924.49 s [doctest] prints a deprecation message for --optghc [✔]
  3298. 924.60 s [doctest] prints error message on invalid option [✔]
  3299. 925.19 s [doctest] interprets GHC response files [✔]
  3300. 925.72 s [doctest] prints verbose description of a specification [✔]
  3301. 926.36 s [doctest] prints verbose description of a property [✔]
  3302. 926.75 s [doctest] prints verbose error [✔]
  3303. 927.31 s [doctest] can deal with potentially problematic GHC options [✔]
  3304. 927.31 s [doctest] doctestWithResult
  3305. 927.31 s [doctest] on parse error
  3306. 927.36 s [doctest] aborts with (ExitFailure 1) [✔]
  3307. 927.40 s [doctest] prints a useful error message [✔]
  3308. 927.40 s [doctest] expandDirs
  3309. 927.40 s [doctest] expands a directory [✔]
  3310. 927.40 s [doctest] ignores files [✔]
  3311. 927.40 s [doctest] ignores random things [✔]
  3312. 927.40 s [doctest] Runner
  3313. 927.40 s [doctest] report
  3314. 927.40 s [doctest] when mode is interactive
  3315. 927.40 s [doctest] writes to stderr [✔]
  3316. 927.40 s [doctest] when mode is non-interactive
  3317. 927.40 s [doctest] writes to stderr [✔]
  3318. 927.40 s [doctest] report_
  3319. 927.40 s [doctest] when mode is interactive
  3320. 927.40 s [doctest] writes transient output to stderr [✔]
  3321. 927.40 s [doctest] when mode is non-interactive
  3322. 927.40 s [doctest] is ignored [✔]
  3323. 927.40 s [doctest] Runner.Example
  3324. 927.40 s [doctest] mkResult
  3325. 927.45 s [doctest] returns Equal when output matches [✔]
  3326. 927.45 s [doctest] +++ OK, passed 100 tests.
  3327. 927.45 s [doctest] ignores trailing whitespace [✔]
  3328. 927.45 s [doctest] with WildCardLine
  3329. 927.45 s [doctest] matches zero lines [✔]
  3330. 927.45 s [doctest] matches first zero line [✔]
  3331. 927.45 s [doctest] matches final zero line [✔]
  3332. 927.45 s [doctest] matches an arbitrary number of lines [✔]
  3333. 927.45 s [doctest] matches an arbitrary number of lines (quickcheck) [✔]
  3334. 927.45 s [doctest] +++ OK, passed 100 tests.
  3335. 927.45 s [doctest] with WildCardChunk
  3336. 927.45 s [doctest] matches an arbitrary line chunk [✔]
  3337. 927.45 s [doctest] matches an arbitrary line chunk at end [✔]
  3338. 927.45 s [doctest] does not match at end [✔]
  3339. 927.45 s [doctest] does not match at start [✔]
  3340. 927.45 s [doctest] when output does not match
  3341. 927.45 s [doctest] constructs failure message [✔]
  3342. 927.45 s [doctest] constructs failure message for multi-line output [✔]
  3343. 927.45 s [doctest] when any output line contains "unsafe" characters
  3344. 927.45 s [doctest] uses show to format output lines [✔]
  3345. 927.45 s [doctest] insert caret after last matching character on different lengths [✔]
  3346. 927.45 s [doctest] insert caret after mismatching line for multi-line output [✔]
  3347. 927.45 s [doctest] insert caret after mismatching line with the longest match for multi-line wildcard pattern [✔]
  3348. 927.46 s [doctest] insert caret after longest match for wildcard [✔]
  3349. 927.46 s [doctest] show expanded pattern for long matches [✔]
  3350. 927.46 s [doctest] Util
  3351. 927.46 s [doctest] convertDosLineEndings
  3352. 927.46 s [doctest] converts CRLF to LF [✔]
  3353. 927.46 s [doctest] strips a trailing CR [✔]
  3354. 927.46 s [doctest] takeWhileEnd
  3355. 927.46 s [doctest] returns the longest suffix of elements that satisfy a given predicate [✔]
  3356. 927.46 s [doctest]
  3357. 927.46 s [doctest] Finished in 55.5415 seconds
  3358. 927.46 s [doctest] 198 examples, 0 failures
  3359. 927.49 s [doctest] Test suite spec: PASS
  3360. 927.49 s [doctest] Test suite logged to: dist/test/doctest-0.24.2-spec.log
  3361. 927.49 s [doctest] 1 of 1 test suites (1 of 1 test cases) passed.
  3362. 927.50 s [doctest] checkPhase completed in 55 seconds
  3363. 927.50 s [doctest] Phase: haddockPhase
  3364. 927.76 s [doctest] Preprocessing test suite 'spec' for doctest-0.24.2..
  3365. 927.77 s [doctest] Preprocessing library for doctest-0.24.2..
  3366. 927.78 s [doctest] Running Haddock on library for doctest-0.24.2..
  3367. 927.88 s [doctest] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
  3368. 928.62 s [doctest] [ 1 of 26] Compiling Imports ( src/Imports.hs, nothing )
  3369. 928.72 s [doctest] [ 2 of 26] Compiling GhcUtil ( src/GhcUtil.hs, nothing )
  3370. 929.35 s [doctest] [ 3 of 26] Compiling Cabal.ReplOptions ( src/Cabal/ReplOptions.hs, nothing )
  3371. 929.43 s [doctest] [ 4 of 26] Compiling Cabal.Paths ( src/Cabal/Paths.hs, nothing )
  3372. 929.47 s [doctest] [ 5 of 26] Compiling Cabal.Options ( src/Cabal/Options.hs, nothing )
  3373. 929.50 s [doctest] [ 6 of 26] Compiling Language.Haskell.GhciWrapper ( src/Language/Haskell/GhciWrapper.hs, nothing )
  3374. 929.55 s [doctest] [ 7 of 26] Compiling Interpreter ( src/Interpreter.hs, nothing )
  3375. 929.58 s [doctest] [ 8 of 26] Compiling Location ( src/Location.hs, nothing )
  3376. 929.62 s [doctest] [ 9 of 26] Compiling PackageDBs ( src/PackageDBs.hs, nothing )
  3377. 929.81 s [doctest] [10 of 26] Compiling Paths_doctest ( dist/build/autogen/Paths_doctest.hs, nothing )
  3378. 929.83 s [doctest] [11 of 26] Compiling Info ( src/Info.hs, nothing )
  3379. 929.84 s [doctest] [12 of 26] Compiling Options ( src/Options.hs, nothing )
  3380. 929.88 s [doctest] [13 of 26] Compiling Cabal ( src/Cabal.hs, nothing )
  3381. 929.95 s [doctest] [14 of 26] Compiling Test.DocTest.Internal.Cabal ( src/Test/DocTest/Internal/Cabal.hs, nothing )
  3382. 929.95 s [doctest] [15 of 26] Compiling Test.DocTest.Internal.Location ( src/Test/DocTest/Internal/Location.hs, nothing )
  3383. 929.95 s [doctest] [16 of 26] Compiling Util ( src/Util.hs, nothing )
  3384. 929.96 s [doctest] [17 of 26] Compiling Extract ( src/Extract.hs, nothing )
  3385. 930.07 s [doctest] [18 of 26] Compiling Test.DocTest.Internal.Extract ( src/Test/DocTest/Internal/Extract.hs, nothing )
  3386. 930.08 s [doctest] [19 of 26] Compiling Parse ( src/Parse.hs, nothing )
  3387. 930.12 s [doctest] [20 of 26] Compiling Test.DocTest.Internal.Parse ( src/Test/DocTest/Internal/Parse.hs, nothing )
  3388. 930.12 s [doctest] [21 of 26] Compiling Runner.Example ( src/Runner/Example.hs, nothing )
  3389. 930.16 s [doctest] [22 of 26] Compiling Property ( src/Property.hs, nothing )
  3390. 930.18 s [doctest] [23 of 26] Compiling Runner ( src/Runner.hs, nothing )
  3391. 930.28 s [doctest] [24 of 26] Compiling Run ( src/Run.hs, nothing )
  3392. 930.31 s [doctest] [25 of 26] Compiling Test.DocTest.Internal.Run ( src/Test/DocTest/Internal/Run.hs, nothing )
  3393. 930.39 s [doctest] [26 of 26] Compiling Test.DocTest ( src/Test/DocTest.hs, nothing )
  3394. 930.39 s [doctest] Haddock coverage:
  3395. 930.39 s [doctest] Warning: Imports: Could not find documentation for exported module: Imports
  3396. 930.39 s [doctest] 0% ( 0 / 2) in 'Test.DocTest.Internal.Cabal'
  3397. 930.39 s [doctest] Missing documentation for:
  3398. 930.39 s [doctest] Module header
  3399. 930.39 s [doctest] doctest (src/Test/DocTest/Internal/Cabal.hs:10)
  3400. 930.39 s [doctest] 88% ( 8 / 9) in 'Test.DocTest.Internal.Location'
  3401. 930.39 s [doctest] Missing documentation for:
  3402. 930.39 s [doctest] Module header
  3403. 930.39 s [doctest] Warning: 'SomeException' is ambiguous. It is defined
  3404. 930.39 s [doctest] * in ‘GHC.Exception.Type’
  3405. 930.39 s [doctest] * in ‘GHC.Exception.Type’
  3406. 930.39 s [doctest] You may be able to disambiguate the identifier by qualifying it or
  3407. 930.39 s [doctest] by specifying the type/value namespace explicitly.
  3408. 930.39 s [doctest] Defaulting to the one defined in ‘GHC.Exception.Type’
  3409. 930.39 s [doctest] 66% ( 2 / 3) in 'Test.DocTest.Internal.Extract'
  3410. 930.39 s [doctest] Missing documentation for:
  3411. 930.39 s [doctest] Module header
  3412. 930.39 s [doctest] 22% ( 2 / 9) in 'Test.DocTest.Internal.Parse'
  3413. 930.39 s [doctest] Missing documentation for:
  3414. 930.39 s [doctest] Module header
  3415. 930.39 s [doctest] DocTest (src/Parse.hs:29)
  3416. 930.39 s [doctest] Expression (src/Parse.hs:44)
  3417. 930.39 s [doctest] ExpectedResult (src/Parse.hs:45)
  3418. 930.39 s [doctest] ExpectedLine (src/Parse.hs:38)
  3419. 930.39 s [doctest] LineChunk (src/Parse.hs:32)
  3420. 930.39 s [doctest] parseModules (src/Parse.hs:60)
  3421. 930.39 s [doctest] Warning: 'report_' is out of scope.
  3422. 930.39 s [doctest] If you qualify the identifier, haddock can try to link it anyway.
  3423. 930.39 s [doctest] 15% ( 2 / 13) in 'Test.DocTest.Internal.Run'
  3424. 930.39 s [doctest] Missing documentation for:
  3425. 930.39 s [doctest] Module header
  3426. 930.39 s [doctest] Result (src/Run.hs:139)
  3427. 930.39 s [doctest] Config (src/Options.hs:58)
  3428. 930.39 s [doctest] isSuccess (src/Runner.hs:55)
  3429. 930.39 s [doctest] defaultConfig (src/Options.hs:68)
  3430. 930.39 s [doctest] doctestWithRepl (src/Run.hs:67)
  3431. 930.39 s [doctest] doctestWith (src/Run.hs:137)
  3432. 930.39 s [doctest] formatSummary (src/Runner.hs:58)
  3433. 930.39 s [doctest] evaluateResult (src/Run.hs:142)
  3434. 930.39 s [doctest] doctestWithResult (src/Run.hs:145)
  3435. 930.39 s [doctest] runDocTests (src/Run.hs:155)
  3436. 930.39 s [doctest] 50% ( 1 / 2) in 'Test.DocTest'
  3437. 930.39 s [doctest] Missing documentation for:
  3438. 930.39 s [doctest] Module header
  3439. 945.47 s [doctest] Documentation created: dist/doc/html/doctest/,
  3440. 945.47 s [doctest] dist/doc/html/doctest/doctest.txt
  3441. 945.59 s [doctest] Preprocessing executable 'doctest' for doctest-0.24.2..
  3442. 945.60 s [doctest] Phase: installPhase
  3443. 945.74 s [doctest] Installing library in /nix/store/njpw8hiwdi4abvh8g8yavys2ykkm6gmp-doctest-0.24.2/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/doctest-0.24.2-7CW3VAqweMx6JNSdbfXAyp
  3444. 945.91 s [doctest] Installing executable doctest in /nix/store/njpw8hiwdi4abvh8g8yavys2ykkm6gmp-doctest-0.24.2/bin
  3445. 945.91 s [doctest] Warning: The directory
  3446. 945.91 s [doctest] /nix/store/njpw8hiwdi4abvh8g8yavys2ykkm6gmp-doctest-0.24.2/bin is not in the
  3447. 945.91 s [doctest] system search path.
  3448. 946.83 s [doctest] Phase: fixupPhase
  3449. 946.86 s [doctest] shrinking RPATHs of ELF executables and libraries in /nix/store/njpw8hiwdi4abvh8g8yavys2ykkm6gmp-doctest-0.24.2
  3450. 946.86 s [doctest] shrinking /nix/store/njpw8hiwdi4abvh8g8yavys2ykkm6gmp-doctest-0.24.2/bin/doctest
  3451. 947.02 s [doctest] shrinking /nix/store/njpw8hiwdi4abvh8g8yavys2ykkm6gmp-doctest-0.24.2/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/libHSdoctest-0.24.2-7CW3VAqweMx6JNSdbfXAyp-ghc9.8.4.so
  3452. 947.03 s [doctest] checking for references to /build/ in /nix/store/njpw8hiwdi4abvh8g8yavys2ykkm6gmp-doctest-0.24.2...
  3453. 947.12 s [doctest] patching script interpreter paths in /nix/store/njpw8hiwdi4abvh8g8yavys2ykkm6gmp-doctest-0.24.2
  3454. 947.13 s [doctest] stripping (with command strip and flags -S -p) in /nix/store/njpw8hiwdi4abvh8g8yavys2ykkm6gmp-doctest-0.24.2/lib /nix/store/njpw8hiwdi4abvh8g8yavys2ykkm6gmp-doctest-0.24.2/bin
  3455. 947.45 s [doctest] shrinking RPATHs of ELF executables and libraries in /nix/store/30gpaxfdfbdvwpv8zr2br46ywwbywz3k-doctest-0.24.2-doc
  3456. 947.46 s [doctest] checking for references to /build/ in /nix/store/30gpaxfdfbdvwpv8zr2br46ywwbywz3k-doctest-0.24.2-doc...
  3457. 947.48 s [doctest] patching script interpreter paths in /nix/store/30gpaxfdfbdvwpv8zr2br46ywwbywz3k-doctest-0.24.2-doc
  3458. 947.81 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/30gpaxfdfbdvwpv8zr2br46ywwbywz3k-doctest-0.24.2-doc /nix/store/njpw8hiwdi4abvh8g8yavys2ykkm6gmp-doctest-0.24.2
  3459. 948.87 s [post-build-hook] Nothing to push - all store paths are already on Cachix.
  3460. 948.89 s [post-build-hook] Uploading to the NixCI cache: /nix/store/30gpaxfdfbdvwpv8zr2br46ywwbywz3k-doctest-0.24.2-doc /nix/store/njpw8hiwdi4abvh8g8yavys2ykkm6gmp-doctest-0.24.2
  3461. 948.94 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  3462. 949.07 s [post-build-hook] copying 1 paths...
  3463. 949.07 s [post-build-hook] copying path '/nix/store/njpw8hiwdi4abvh8g8yavys2ykkm6gmp-doctest-0.24.2' to 'https://cache.nix-ci.com'...
  3464. 985.67 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  3465. 985.89 s [post-build-hook] copying 0 paths...
  3466. 985.93 s Progress: 5 of 22 built, 160 of 160 downloaded from cache
  3467. 986.01 s Building duoids
  3468. 986.11 s Building vector
  3469. 986.14 s [duoids] Phase: setupCompilerEnvironmentPhase
  3470. 986.14 s [duoids] Build with /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4.
  3471. 986.26 s [vector] Phase: setupCompilerEnvironmentPhase
  3472. 986.26 s [vector] Build with /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4.
  3473. 986.47 s [duoids] Phase: unpackPhase
  3474. 986.47 s [duoids] unpacking source archive /nix/store/hwhxlh4aq4w3fvrlk65js3cdkm3in22k-5y8mzl3igbd7qyrpb010fqiak50k5q01-source/./core
  3475. 986.48 s [duoids] source root is core
  3476. 986.50 s [duoids] Phase: patchPhase
  3477. 986.52 s [duoids] Phase: compileBuildDriverPhase
  3478. 986.53 s [duoids] setupCompileFlags: -package-db=/build/tmp.X19NFIrsFm/setup-package.conf.d -threaded
  3479. 986.58 s [vector] Phase: unpackPhase
  3480. 986.59 s [vector] unpacking source archive /nix/store/ysi2m95adzhn3nmggwppnxvmps3a93x3-vector-0.13.2.0.tar.gz
  3481. 986.60 s [vector] source root is vector-0.13.2.0
  3482. 986.61 s [vector] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "vector-0.13.2.0/vector.cabal"
  3483. 986.62 s [vector] Phase: patchPhase
  3484. 986.63 s [vector] Replace Cabal file with edited version from mirror://hackage/vector-0.13.2.0/revision/2.cabal.
  3485. 986.64 s [vector] Run jailbreak-cabal to lift version restrictions on build inputs.
  3486. 986.67 s [duoids] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.X19NFIrsFm/Main.o )
  3487. 986.68 s [vector] Phase: compileBuildDriverPhase
  3488. 986.69 s [vector] setupCompileFlags: -package-db=/build/tmp.Oab64Rj1qj/setup-package.conf.d -threaded
  3489. 986.75 s [vector] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.Oab64Rj1qj/Main.o )
  3490. 986.77 s [duoids] [2 of 2] Linking Setup
  3491. 986.90 s [vector] [2 of 2] Linking Setup
  3492. 988.91 s [duoids] Phase: updateAutotoolsGnuConfigScriptsPhase
  3493. 988.92 s [vector] Phase: updateAutotoolsGnuConfigScriptsPhase
  3494. 988.92 s [duoids] Phase: configurePhase
  3495. 988.93 s [duoids] configureFlags: --verbose --prefix=/nix/store/m49xks76j1h3wsvdilf50skd80j6wchy-duoids-0.0.1.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/29cf6cypyr5ny7p5v05ikgb3kbdw1r6h-duoids-0.0.1.0-doc/share/doc/duoids-0.0.1.0 --with-gcc=gcc --package-db=/build/tmp.X19NFIrsFm/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --ghc-options=-Werror --extra-lib-dirs=/nix/store/xp8g8298vbm4k9ipj14xf1r4rh899hr4-ncurses-6.5/lib --extra-lib-dirs=/nix/store/wxm6pczq28ppr7ffwclsl6njbzzr48zf-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/3f0hp921ncxr249f5lmspc8silkqr8f7-elfutils-0.194/lib --extra-lib-dirs=/nix/store/km81slwkcc82dbwywl10gpffjb78g6ni-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/fvsl0b39y6ns2z66gfvc2raca3b5wr18-numactl-2.0.18/lib --extra-lib-dirs=/nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/lib
  3496. 988.94 s [vector] Phase: configurePhase
  3497. 988.95 s [duoids] Using Parsec parser
  3498. 988.95 s [duoids] Configuring duoids-0.0.1.0...
  3499. 988.95 s [vector] configureFlags: --verbose --prefix=/nix/store/2kc95v941mryycild8hhab0q3kwgdry6-vector-0.13.2.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --with-gcc=gcc --package-db=/build/tmp.Oab64Rj1qj/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --extra-lib-dirs=/nix/store/xp8g8298vbm4k9ipj14xf1r4rh899hr4-ncurses-6.5/lib --extra-lib-dirs=/nix/store/wxm6pczq28ppr7ffwclsl6njbzzr48zf-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/3f0hp921ncxr249f5lmspc8silkqr8f7-elfutils-0.194/lib --extra-lib-dirs=/nix/store/km81slwkcc82dbwywl10gpffjb78g6ni-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/fvsl0b39y6ns2z66gfvc2raca3b5wr18-numactl-2.0.18/lib --extra-lib-dirs=/nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/lib
  3500. 988.97 s [vector] Using Parsec parser
  3501. 988.97 s [vector] Configuring vector-0.13.2.0...
  3502. 989.49 s [duoids] Flags chosen: lint=False, noisy-deprecations=True
  3503. 989.49 s [vector] Flags chosen: boundschecks=True, internalchecks=False, unsafechecks=False,
  3504. 989.49 s [vector] wall=False
  3505. 989.49 s [vector] Dependency base: using base-4.19.2.0
  3506. 989.49 s [vector] Dependency deepseq: using deepseq-1.5.1.0
  3507. 989.49 s [vector] Dependency primitive: using primitive-0.9.1.0
  3508. 989.49 s [vector] Dependency vector-stream: using vector-stream-0.1.0.1
  3509. 989.49 s [vector] Dependency base: using base-4.19.2.0
  3510. 989.49 s [vector] Dependency random: using random-1.2.1.3
  3511. 989.49 s [vector] Dependency tasty: using tasty-1.5.3
  3512. 989.49 s [vector] Dependency vector: using vector-0.13.2.0
  3513. 989.49 s [vector] Dependency QuickCheck: using QuickCheck-2.15.0.1
  3514. 989.49 s [vector] Dependency base: using base-4.19.2.0
  3515. 989.49 s [vector] Dependency base-orphans: using base-orphans-0.9.3
  3516. 989.49 s [vector] Dependency primitive: using primitive-0.9.1.0
  3517. 989.49 s [vector] Dependency random: using random-1.2.1.3
  3518. 989.49 s [vector] Dependency tasty: using tasty-1.5.3
  3519. 989.49 s [vector] Dependency tasty-hunit: using tasty-hunit-0.10.2
  3520. 989.49 s [vector] Dependency tasty-quickcheck: using tasty-quickcheck-0.11.1
  3521. 989.49 s [vector] Dependency template-haskell: using template-haskell-2.21.0.0
  3522. 989.49 s [vector] Dependency transformers: using transformers-0.6.1.0
  3523. 989.49 s [vector] Dependency vector: using vector-0.13.2.0
  3524. 989.49 s [vector] Dependency QuickCheck: using QuickCheck-2.15.0.1
  3525. 989.49 s [vector] Dependency base: using base-4.19.2.0
  3526. 989.49 s [vector] Dependency base-orphans: using base-orphans-0.9.3
  3527. 989.49 s [vector] Dependency primitive: using primitive-0.9.1.0
  3528. 989.49 s [vector] Dependency random: using random-1.2.1.3
  3529. 989.49 s [vector] Dependency tasty: using tasty-1.5.3
  3530. 989.49 s [vector] Dependency tasty-hunit: using tasty-hunit-0.10.2
  3531. 989.49 s [vector] Dependency tasty-quickcheck: using tasty-quickcheck-0.11.1
  3532. 989.49 s [vector] Dependency template-haskell: using template-haskell-2.21.0.0
  3533. 989.49 s [vector] Dependency transformers: using transformers-0.6.1.0
  3534. 989.49 s [vector] Dependency vector: using vector-0.13.2.0
  3535. 989.49 s [vector] Dependency base: using base-4.19.2.0
  3536. 989.49 s [vector] Dependency doctest: using doctest-0.24.2
  3537. 989.49 s [vector] Dependency primitive: using primitive-0.9.1.0
  3538. 989.49 s [vector] Dependency vector: using vector-0.13.2.0
  3539. 989.49 s [vector] Dependency base: using base-4.19.2.0
  3540. 989.49 s [vector] Dependency primitive: using primitive-0.9.1.0
  3541. 989.49 s [vector] Dependency tasty: using tasty-1.5.3
  3542. 989.49 s [vector] Dependency tasty-inspection-testing: using tasty-inspection-testing-0.2.1
  3543. 989.49 s [vector] Dependency vector: using vector-0.13.2.0
  3544. 989.83 s [vector] Source component graph:
  3545. 989.83 s [vector] component lib
  3546. 989.83 s [vector] component lib:benchmarks-O2 dependency lib
  3547. 989.83 s [vector] component test:vector-doctest dependency lib
  3548. 989.83 s [vector] component test:vector-inspection dependency lib
  3549. 989.83 s [vector] component test:vector-tests-O0 dependency lib
  3550. 989.83 s [vector] component test:vector-tests-O2 dependency lib
  3551. 989.83 s [vector] Configured component graph:
  3552. 989.83 s [vector] component vector-0.13.2.0-91VeWMtvsgACG7wykjdBs
  3553. 989.83 s [vector] include base-4.19.2.0-a4d2
  3554. 989.83 s [vector] include deepseq-1.5.1.0-2184
  3555. 989.83 s [vector] include primitive-0.9.1.0-1Z9etogBUXA7BaLw7HCIll
  3556. 989.83 s [vector] include vector-stream-0.1.0.1-61lSYpAMWRGB9P7oHIIrow
  3557. 989.83 s [vector] component vector-0.13.2.0-7azfzKLqBdS38T2hfwD3o4-benchmarks-O2
  3558. 989.83 s [vector] include base-4.19.2.0-a4d2
  3559. 989.83 s [vector] include random-1.2.1.3-jboRdLLnYgxZ05UNY3Mp
  3560. 989.83 s [vector] include tasty-1.5.3-KEgV0Lf2f7EJ3jK2Y7VIf6
  3561. 989.83 s [vector] include vector-0.13.2.0-91VeWMtvsgACG7wykjdBs
  3562. 989.83 s [vector] component vector-0.13.2.0-KacDOridDhtEM8CGyou7YL-vector-doctest
  3563. 989.83 s [vector] include base-4.19.2.0-a4d2
  3564. 989.83 s [vector] include doctest-0.24.2-7CW3VAqweMx6JNSdbfXAyp
  3565. 989.83 s [vector] include primitive-0.9.1.0-1Z9etogBUXA7BaLw7HCIll
  3566. 989.83 s [vector] include vector-0.13.2.0-91VeWMtvsgACG7wykjdBs
  3567. 989.83 s [vector] component vector-0.13.2.0-1pMDqWq8buBtxqSZra7bT-vector-inspection
  3568. 989.83 s [vector] include base-4.19.2.0-a4d2
  3569. 989.83 s [vector] include primitive-0.9.1.0-1Z9etogBUXA7BaLw7HCIll
  3570. 989.83 s [vector] include tasty-1.5.3-KEgV0Lf2f7EJ3jK2Y7VIf6
  3571. 989.83 s [vector] include tasty-inspection-testing-0.2.1-IzQkojs7Fg6G5SvPQDqXwF
  3572. 989.83 s [vector] include vector-0.13.2.0-91VeWMtvsgACG7wykjdBs
  3573. 989.83 s [vector] component vector-0.13.2.0-9D8CIyGWHaHJ2iFE8ESCwz-vector-tests-O0
  3574. 989.83 s [vector] include QuickCheck-2.15.0.1-2BdQuHKQVeZ1bFh8DuLq55
  3575. 989.83 s [vector] include base-4.19.2.0-a4d2
  3576. 989.83 s [vector] include base-orphans-0.9.3-9yjqMPRAzm43qWwTewpEcl
  3577. 989.83 s [vector] include primitive-0.9.1.0-1Z9etogBUXA7BaLw7HCIll
  3578. 989.83 s [vector] include random-1.2.1.3-jboRdLLnYgxZ05UNY3Mp
  3579. 989.83 s [vector] include tasty-1.5.3-KEgV0Lf2f7EJ3jK2Y7VIf6
  3580. 989.83 s [vector] include tasty-hunit-0.10.2-JS3cbCHWyhEKpg2zmj91qe
  3581. 989.83 s [vector] include tasty-quickcheck-0.11.1-DHhHz1LjT4W7Z49DpnNAd3
  3582. 989.83 s [vector] include template-haskell-2.21.0.0-cf26
  3583. 989.83 s [vector] include transformers-0.6.1.0-8f1d
  3584. 989.83 s [vector] include vector-0.13.2.0-91VeWMtvsgACG7wykjdBs
  3585. 989.83 s [vector] component vector-0.13.2.0-8tuFZUblRiW6FLnF384hLy-vector-tests-O2
  3586. 989.83 s [vector] include QuickCheck-2.15.0.1-2BdQuHKQVeZ1bFh8DuLq55
  3587. 989.83 s [vector] include base-4.19.2.0-a4d2
  3588. 989.83 s [vector] include base-orphans-0.9.3-9yjqMPRAzm43qWwTewpEcl
  3589. 989.83 s [vector] include primitive-0.9.1.0-1Z9etogBUXA7BaLw7HCIll
  3590. 989.83 s [vector] include random-1.2.1.3-jboRdLLnYgxZ05UNY3Mp
  3591. 989.83 s [vector] include tasty-1.5.3-KEgV0Lf2f7EJ3jK2Y7VIf6
  3592. 989.83 s [vector] include tasty-hunit-0.10.2-JS3cbCHWyhEKpg2zmj91qe
  3593. 989.83 s [vector] include tasty-quickcheck-0.11.1-DHhHz1LjT4W7Z49DpnNAd3
  3594. 989.83 s [vector] include template-haskell-2.21.0.0-cf26
  3595. 989.83 s [vector] include transformers-0.6.1.0-8f1d
  3596. 989.83 s [vector] include vector-0.13.2.0-91VeWMtvsgACG7wykjdBs
  3597. 989.84 s [vector] Linked component graph:
  3598. 989.84 s [vector] unit vector-0.13.2.0-91VeWMtvsgACG7wykjdBs
  3599. 989.84 s [vector] include base-4.19.2.0-a4d2
  3600. 989.84 s [vector] include deepseq-1.5.1.0-2184
  3601. 989.84 s [vector] include primitive-0.9.1.0-1Z9etogBUXA7BaLw7HCIll
  3602. 989.84 s [vector] include vector-stream-0.1.0.1-61lSYpAMWRGB9P7oHIIrow
  3603. 989.84 s [vector] Data.Vector=vector-0.13.2.0-91VeWMtvsgACG7wykjdBs:Data.Vector,Data.Vector.Fusion.Bundle=vector-0.13.2.0-91VeWMtvsgACG7wykjdBs:Data.Vector.Fusion.Bundle,Data.Vector.Fusion.Bundle.Monadic=vector-0.13.2.0-91VeWMtvsgACG7wykjdBs:Data.Vector.Fusion.Bundle.Monadic,Data.Vector.Fusion.Bundle.Size=vector-0.13.2.0-91VeWMtvsgACG7wykjdBs:Data.Vector.Fusion.Bundle.Size,Data.Vector.Fusion.Stream.Monadic=vector-0.13.2.0-91VeWMtvsgACG7wykjdBs:Data.Vector.Fusion.Stream.Monadic,Data.Vector.Fusion.Util=vector-0.13.2.0-91VeWMtvsgACG7wykjdBs:Data.Vector.Fusion.Util,Data.Vector.Generic=vector-0.13.2.0-91VeWMtvsgACG7wykjdBs:Data.Vector.Generic,Data.Vector.Generic.Base=vector-0.13.2.0-91VeWMtvsgACG7wykjdBs:Data.Vector.Generic.Base,Data.Vector.Generic.Mutable=vector-0.13.2.0-91VeWMtvsgACG7wykjdBs:Data.Vector.Generic.Mutable,Data.Vector.Generic.Mutable.Base=vector-0.13.2.0-91VeWMtvsgACG7wykjdBs:Data.Vector.Generic.Mutable.Base,Data.Vector.Generic.New=vector-0.13.2.0-91VeWMtvsgACG7wykjdBs:Data.Vector.Generic.New,Data.Vector.Internal.Check=vector-0.13.2.0-91VeWMtvsgACG7wykjdBs:Data.Vector.Internal.Check,Data.Vector.Mutable=vector-0.13.2.0-91VeWMtvsgACG7wykjdBs:Data.Vector.Mutable,Data.Vector.Primitive=vector-0.13.2.0-91VeWMtvsgACG7wykjdBs:Data.Vector.Primitive,Data.Vector.Primitive.Mutable=vector-0.13.2.0-91VeWMtvsgACG7wykjdBs:Data.Vector.Primitive.Mutable,Data.Vector.Storable=vector-0.13.2.0-91VeWMtvsgACG7wykjdBs:Data.Vector.Storable,Data.Vector.Storable.Internal=vector-0.13.2.0-91VeWMtvsgACG7wykjdBs:Data.Vector.Storable.Internal,Data.Vector.Storable.Mutable=vector-0.13.2.0-91VeWMtvsgACG7wykjdBs:Data.Vector.Storable.Mutable,Data.Vector.Strict=vector-0.13.2.0-91VeWMtvsgACG7wykjdBs:Data.Vector.Strict,Data.Vector.Strict.Mutable=vector-0.13.2.0-91VeWMtvsgACG7wykjdBs:Data.Vector.Strict.Mutable,Data.Vector.Unboxed=vector-0.13.2.0-91VeWMtvsgACG7wykjdBs:Data.Vector.Unboxed,Data.Vector.Unboxed.Base=vector-0.13.2.0-91VeWMtvsgACG7wykjdBs:Data.Vector.Unboxed.Base,Data.Vector.Unboxed.Mutable=vector-0.13.2.0-91VeWMtvsgACG7wykjdBs:Data.Vector.Unboxed.Mutable
  3604. 989.84 s [vector] unit vector-0.13.2.0-7azfzKLqBdS38T2hfwD3o4-benchmarks-O2
  3605. 989.84 s [vector] include base-4.19.2.0-a4d2
  3606. 989.84 s [vector] include random-1.2.1.3-jboRdLLnYgxZ05UNY3Mp
  3607. 989.84 s [vector] include tasty-1.5.3-KEgV0Lf2f7EJ3jK2Y7VIf6
  3608. 989.84 s [vector] include vector-0.13.2.0-91VeWMtvsgACG7wykjdBs
  3609. 989.84 s [vector] Bench.Vector.Algo.AwShCC=vector-0.13.2.0-7azfzKLqBdS38T2hfwD3o4-benchmarks-O2:Bench.Vector.Algo.AwShCC,Bench.Vector.Algo.FindIndexR=vector-0.13.2.0-7azfzKLqBdS38T2hfwD3o4-benchmarks-O2:Bench.Vector.Algo.FindIndexR,Bench.Vector.Algo.HybCC=vector-0.13.2.0-7azfzKLqBdS38T2hfwD3o4-benchmarks-O2:Bench.Vector.Algo.HybCC,Bench.Vector.Algo.Leaffix=vector-0.13.2.0-7azfzKLqBdS38T2hfwD3o4-benchmarks-O2:Bench.Vector.Algo.Leaffix,Bench.Vector.Algo.ListRank=vector-0.13.2.0-7azfzKLqBdS38T2hfwD3o4-benchmarks-O2:Bench.Vector.Algo.ListRank,Bench.Vector.Algo.MutableSet=vector-0.13.2.0-7azfzKLqBdS38T2hfwD3o4-benchmarks-O2:Bench.Vector.Algo.MutableSet,Bench.Vector.Algo.NextPermutation=vector-0.13.2.0-7azfzKLqBdS38T2hfwD3o4-benchmarks-O2:Bench.Vector.Algo.NextPermutation,Bench.Vector.Algo.Quickhull=vector-0.13.2.0-7azfzKLqBdS38T2hfwD3o4-benchmarks-O2:Bench.Vector.Algo.Quickhull,Bench.Vector.Algo.Rootfix=vector-0.13.2.0-7azfzKLqBdS38T2hfwD3o4-benchmarks-O2:Bench.Vector.Algo.Rootfix,Bench.Vector.Algo.Spectral=vector-0.13.2.0-7azfzKLqBdS38T2hfwD3o4-benchmarks-O2:Bench.Vector.Algo.Spectral,Bench.Vector.Algo.Tridiag=vector-0.13.2.0-7azfzKLqBdS38T2hfwD3o4-benchmarks-O2:Bench.Vector.Algo.Tridiag,Bench.Vector.Tasty=vector-0.13.2.0-7azfzKLqBdS38T2hfwD3o4-benchmarks-O2:Bench.Vector.Tasty,Bench.Vector.TestData.Graph=vector-0.13.2.0-7azfzKLqBdS38T2hfwD3o4-benchmarks-O2:Bench.Vector.TestData.Graph,Bench.Vector.TestData.ParenTree=vector-0.13.2.0-7azfzKLqBdS38T2hfwD3o4-benchmarks-O2:Bench.Vector.TestData.ParenTree
  3610. 989.84 s [vector] unit vector-0.13.2.0-KacDOridDhtEM8CGyou7YL-vector-doctest
  3611. 989.84 s [vector] include base-4.19.2.0-a4d2
  3612. 989.84 s [vector] include doctest-0.24.2-7CW3VAqweMx6JNSdbfXAyp
  3613. 989.84 s [vector] include primitive-0.9.1.0-1Z9etogBUXA7BaLw7HCIll
  3614. 989.84 s [vector] include vector-0.13.2.0-91VeWMtvsgACG7wykjdBs
  3615. 989.84 s [vector] unit vector-0.13.2.0-1pMDqWq8buBtxqSZra7bT-vector-inspection
  3616. 989.84 s [vector] include base-4.19.2.0-a4d2
  3617. 989.84 s [vector] include primitive-0.9.1.0-1Z9etogBUXA7BaLw7HCIll
  3618. 989.84 s [vector] include tasty-1.5.3-KEgV0Lf2f7EJ3jK2Y7VIf6
  3619. 989.84 s [vector] include tasty-inspection-testing-0.2.1-IzQkojs7Fg6G5SvPQDqXwF
  3620. 989.84 s [vector] include vector-0.13.2.0-91VeWMtvsgACG7wykjdBs
  3621. 989.84 s [vector] unit vector-0.13.2.0-9D8CIyGWHaHJ2iFE8ESCwz-vector-tests-O0
  3622. 989.84 s [vector] include QuickCheck-2.15.0.1-2BdQuHKQVeZ1bFh8DuLq55
  3623. 989.84 s [vector] include base-4.19.2.0-a4d2
  3624. 989.84 s [vector] include base-orphans-0.9.3-9yjqMPRAzm43qWwTewpEcl
  3625. 989.84 s [vector] include primitive-0.9.1.0-1Z9etogBUXA7BaLw7HCIll
  3626. 989.84 s [vector] include random-1.2.1.3-jboRdLLnYgxZ05UNY3Mp
  3627. 989.84 s [vector] include tasty-1.5.3-KEgV0Lf2f7EJ3jK2Y7VIf6
  3628. 989.84 s [vector] include tasty-hunit-0.10.2-JS3cbCHWyhEKpg2zmj91qe
  3629. 989.84 s [vector] include tasty-quickcheck-0.11.1-DHhHz1LjT4W7Z49DpnNAd3
  3630. 989.84 s [vector] include template-haskell-2.21.0.0-cf26
  3631. 989.84 s [vector] include transformers-0.6.1.0-8f1d
  3632. 989.84 s [vector] include vector-0.13.2.0-91VeWMtvsgACG7wykjdBs
  3633. 989.84 s [vector] unit vector-0.13.2.0-8tuFZUblRiW6FLnF384hLy-vector-tests-O2
  3634. 989.84 s [vector] include QuickCheck-2.15.0.1-2BdQuHKQVeZ1bFh8DuLq55
  3635. 989.84 s [vector] include base-4.19.2.0-a4d2
  3636. 989.89 s [vector] include base-orphans-0.9.3-9yjqMPRAzm43qWwTewpEcl
  3637. 989.89 s [vector] include primitive-0.9.1.0-1Z9etogBUXA7BaLw7HCIll
  3638. 989.89 s [vector] include random-1.2.1.3-jboRdLLnYgxZ05UNY3Mp
  3639. 989.89 s [vector] include tasty-1.5.3-KEgV0Lf2f7EJ3jK2Y7VIf6
  3640. 989.89 s [vector] include tasty-hunit-0.10.2-JS3cbCHWyhEKpg2zmj91qe
  3641. 989.89 s [vector] include tasty-quickcheck-0.11.1-DHhHz1LjT4W7Z49DpnNAd3
  3642. 989.89 s [vector] include template-haskell-2.21.0.0-cf26
  3643. 989.89 s [vector] include transformers-0.6.1.0-8f1d
  3644. 989.89 s [vector] include vector-0.13.2.0-91VeWMtvsgACG7wykjdBs
  3645. 989.89 s [vector] Ready component graph:
  3646. 989.89 s [vector] definite vector-0.13.2.0-91VeWMtvsgACG7wykjdBs
  3647. 989.89 s [vector] depends base-4.19.2.0-a4d2
  3648. 989.89 s [vector] depends deepseq-1.5.1.0-2184
  3649. 989.89 s [vector] depends primitive-0.9.1.0-1Z9etogBUXA7BaLw7HCIll
  3650. 989.89 s [vector] depends vector-stream-0.1.0.1-61lSYpAMWRGB9P7oHIIrow
  3651. 989.89 s [vector] definite vector-0.13.2.0-9D8CIyGWHaHJ2iFE8ESCwz-vector-tests-O0
  3652. 989.89 s [vector] depends QuickCheck-2.15.0.1-2BdQuHKQVeZ1bFh8DuLq55
  3653. 989.89 s [vector] depends base-4.19.2.0-a4d2
  3654. 989.89 s [vector] depends base-orphans-0.9.3-9yjqMPRAzm43qWwTewpEcl
  3655. 989.89 s [vector] depends primitive-0.9.1.0-1Z9etogBUXA7BaLw7HCIll
  3656. 989.89 s [vector] depends random-1.2.1.3-jboRdLLnYgxZ05UNY3Mp
  3657. 989.89 s [vector] depends tasty-1.5.3-KEgV0Lf2f7EJ3jK2Y7VIf6
  3658. 989.89 s [vector] depends tasty-hunit-0.10.2-JS3cbCHWyhEKpg2zmj91qe
  3659. 989.89 s [vector] depends tasty-quickcheck-0.11.1-DHhHz1LjT4W7Z49DpnNAd3
  3660. 989.89 s [vector] depends template-haskell-2.21.0.0-cf26
  3661. 989.89 s [vector] depends transformers-0.6.1.0-8f1d
  3662. 989.89 s [vector] depends vector-0.13.2.0-91VeWMtvsgACG7wykjdBs
  3663. 989.89 s [vector] definite vector-0.13.2.0-KacDOridDhtEM8CGyou7YL-vector-doctest
  3664. 989.89 s [vector] depends base-4.19.2.0-a4d2
  3665. 989.89 s [vector] depends doctest-0.24.2-7CW3VAqweMx6JNSdbfXAyp
  3666. 989.89 s [vector] depends primitive-0.9.1.0-1Z9etogBUXA7BaLw7HCIll
  3667. 989.89 s [vector] depends vector-0.13.2.0-91VeWMtvsgACG7wykjdBs
  3668. 989.89 s [vector] definite vector-0.13.2.0-8tuFZUblRiW6FLnF384hLy-vector-tests-O2
  3669. 989.89 s [vector] depends QuickCheck-2.15.0.1-2BdQuHKQVeZ1bFh8DuLq55
  3670. 989.89 s [vector] depends base-4.19.2.0-a4d2
  3671. 989.89 s [vector] depends base-orphans-0.9.3-9yjqMPRAzm43qWwTewpEcl
  3672. 989.89 s [vector] depends primitive-0.9.1.0-1Z9etogBUXA7BaLw7HCIll
  3673. 989.89 s [vector] depends random-1.2.1.3-jboRdLLnYgxZ05UNY3Mp
  3674. 989.89 s [vector] depends tasty-1.5.3-KEgV0Lf2f7EJ3jK2Y7VIf6
  3675. 989.89 s [vector] depends tasty-hunit-0.10.2-JS3cbCHWyhEKpg2zmj91qe
  3676. 989.89 s [vector] depends tasty-quickcheck-0.11.1-DHhHz1LjT4W7Z49DpnNAd3
  3677. 989.89 s [vector] depends template-haskell-2.21.0.0-cf26
  3678. 989.89 s [vector] depends transformers-0.6.1.0-8f1d
  3679. 989.89 s [vector] depends vector-0.13.2.0-91VeWMtvsgACG7wykjdBs
  3680. 989.89 s [vector] definite vector-0.13.2.0-7azfzKLqBdS38T2hfwD3o4-benchmarks-O2
  3681. 989.89 s [vector] depends base-4.19.2.0-a4d2
  3682. 989.89 s [vector] depends random-1.2.1.3-jboRdLLnYgxZ05UNY3Mp
  3683. 989.89 s [vector] depends tasty-1.5.3-KEgV0Lf2f7EJ3jK2Y7VIf6
  3684. 989.89 s [vector] depends vector-0.13.2.0-91VeWMtvsgACG7wykjdBs
  3685. 989.89 s [vector] definite vector-0.13.2.0-1pMDqWq8buBtxqSZra7bT-vector-inspection
  3686. 989.89 s [vector] depends base-4.19.2.0-a4d2
  3687. 989.89 s [vector] depends primitive-0.9.1.0-1Z9etogBUXA7BaLw7HCIll
  3688. 989.89 s [vector] depends tasty-1.5.3-KEgV0Lf2f7EJ3jK2Y7VIf6
  3689. 989.89 s [vector] depends tasty-inspection-testing-0.2.1-IzQkojs7Fg6G5SvPQDqXwF
  3690. 989.89 s [vector] depends vector-0.13.2.0-91VeWMtvsgACG7wykjdBs
  3691. 989.89 s [vector] Using Cabal-3.10.3.0 compiled by ghc-9.8
  3692. 989.89 s [vector] Using compiler: ghc-9.8.4
  3693. 989.89 s [vector] Using install prefix:
  3694. 989.89 s [vector] /nix/store/2kc95v941mryycild8hhab0q3kwgdry6-vector-0.13.2.0
  3695. 989.89 s [vector] Executables installed in:
  3696. 989.89 s [vector] /nix/store/2kc95v941mryycild8hhab0q3kwgdry6-vector-0.13.2.0/bin
  3697. 989.89 s [vector] Libraries installed in:
  3698. 989.89 s [vector] /nix/store/2kc95v941mryycild8hhab0q3kwgdry6-vector-0.13.2.0/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/vector-0.13.2.0-91VeWMtvsgACG7wykjdBs
  3699. 989.89 s [vector] Dynamic Libraries installed in:
  3700. 989.89 s [vector] /nix/store/2kc95v941mryycild8hhab0q3kwgdry6-vector-0.13.2.0/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4
  3701. 989.89 s [vector] Private executables installed in:
  3702. 989.89 s [vector] /nix/store/2kc95v941mryycild8hhab0q3kwgdry6-vector-0.13.2.0/libexec/x86_64-linux-ghc-9.8.4/vector-0.13.2.0
  3703. 989.89 s [vector] Data files installed in:
  3704. 989.89 s [vector] /nix/store/2kc95v941mryycild8hhab0q3kwgdry6-vector-0.13.2.0/share/x86_64-linux-ghc-9.8.4/vector-0.13.2.0
  3705. 989.89 s [vector] Documentation installed in:
  3706. 989.89 s [vector] /nix/store/2kc95v941mryycild8hhab0q3kwgdry6-vector-0.13.2.0/share/doc/x86_64-linux-ghc-9.8.4/vector-0.13.2.0
  3707. 989.89 s [vector] Configuration files installed in:
  3708. 989.89 s [vector] /nix/store/2kc95v941mryycild8hhab0q3kwgdry6-vector-0.13.2.0/etc
  3709. 989.89 s [vector] No alex found
  3710. 989.89 s [vector] Using ar found on system at:
  3711. 989.89 s [vector] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
  3712. 989.89 s [vector] No c2hs found
  3713. 989.89 s [vector] No cpphs found
  3714. 989.89 s [vector] Using doctest version 0.24.2 found on system at:
  3715. 989.89 s [vector] /nix/store/njpw8hiwdi4abvh8g8yavys2ykkm6gmp-doctest-0.24.2/bin/doctest
  3716. 989.89 s [vector] Using gcc version 14.3.0 given by user at:
  3717. 989.89 s [vector] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
  3718. 989.89 s [vector] Using ghc version 9.8.4 found on system at:
  3719. 989.89 s [vector] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/ghc
  3720. 989.89 s [vector] Using ghc-pkg version 9.8.4 found on system at:
  3721. 989.89 s [vector] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/ghc-pkg-9.8.4
  3722. 989.89 s [vector] No ghcjs found
  3723. 989.89 s [vector] No ghcjs-pkg found
  3724. 989.89 s [vector] No greencard found
  3725. 989.89 s [vector] Using haddock version 2.30.0 found on system at:
  3726. 989.89 s [vector] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/haddock-ghc-9.8.4
  3727. 989.89 s [vector] No happy found
  3728. 989.89 s [vector] Using haskell-suite found on system at: haskell-suite-dummy-location
  3729. 989.89 s [vector] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  3730. 989.89 s [vector] No hmake found
  3731. 989.89 s [vector] Using hpc version 0.69 found on system at:
  3732. 989.89 s [vector] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/hpc-ghc-9.8.4
  3733. 989.89 s [vector] Using hsc2hs version 0.68.10 found on system at:
  3734. 989.89 s [vector] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/hsc2hs-ghc-9.8.4
  3735. 989.89 s [vector] Using hscolour version 1.25 found on system at:
  3736. 989.89 s [vector] /nix/store/vl14mqkz7z183r6sq9qz932j3pix6v5c-hscolour-1.25/bin/HsColour
  3737. 989.89 s [vector] No jhc found
  3738. 989.89 s [vector] Using ld found on system at:
  3739. 989.89 s [vector] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ld.gold
  3740. 989.89 s [vector] No pkg-config found
  3741. 989.89 s [vector] Using runghc version 9.8.4 found on system at:
  3742. 989.89 s [vector] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/runghc-9.8.4
  3743. 989.89 s [vector] Using strip version 2.44 found on system at:
  3744. 989.89 s [vector] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
  3745. 989.89 s [vector] Using tar found on system at:
  3746. 989.89 s [vector] /nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
  3747. 989.89 s [vector] No uhc found
  3748. 989.89 s [duoids] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  3749. 989.89 s [duoids] >=4.21.0 && <4.22 || >=4.22.0 && <4.23: using base-4.19.2.0
  3750. 989.89 s [duoids] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  3751. 989.89 s [duoids] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  3752. 989.89 s [duoids] >=4.21.0 && <4.22 || >=4.22.0 && <4.23: using base-4.19.2.0
  3753. 989.89 s [duoids] Dependency doctest >=0.21.1 && <0.22 || >=0.22.6 && <0.23 || >=0.24.0 &&
  3754. 989.89 s [duoids] <0.25: using doctest-0.24.2
  3755. 989.89 s [duoids] Dependency duoids: using duoids-0.0.1.0
  3756. 989.89 s [duoids] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  3757. 989.89 s [duoids] Source component graph:
  3758. 989.89 s [duoids] component lib
  3759. 989.89 s [duoids] component test:doctests dependency lib
  3760. 989.89 s [duoids] Configured component graph:
  3761. 989.89 s [duoids] component duoids-0.0.1.0-HGVxlGiTGubJau1PjiOPQY
  3762. 989.89 s [duoids] include base-4.19.2.0-a4d2
  3763. 989.89 s [duoids] include ghc-compat-plugin-0.1.0.1-7MjAExeaX6DEMyHCY8avBD
  3764. 989.89 s [duoids] component duoids-0.0.1.0-KT7AVAn7OaA79Vd2hcgoD7-doctests
  3765. 989.89 s [duoids] include base-4.19.2.0-a4d2
  3766. 989.89 s [duoids] include doctest-0.24.2-7CW3VAqweMx6JNSdbfXAyp
  3767. 989.89 s [duoids] include duoids-0.0.1.0-HGVxlGiTGubJau1PjiOPQY
  3768. 989.89 s [duoids] include ghc-compat-plugin-0.1.0.1-7MjAExeaX6DEMyHCY8avBD
  3769. 989.89 s [duoids] Linked component graph:
  3770. 989.89 s [duoids] unit duoids-0.0.1.0-HGVxlGiTGubJau1PjiOPQY
  3771. 989.89 s [duoids] include base-4.19.2.0-a4d2
  3772. 989.89 s [duoids] include ghc-compat-plugin-0.1.0.1-7MjAExeaX6DEMyHCY8avBD
  3773. 989.89 s [duoids] Control.Duoidal=duoids-0.0.1.0-HGVxlGiTGubJau1PjiOPQY:Control.Duoidal,Control.Duoidal.Either=duoids-0.0.1.0-HGVxlGiTGubJau1PjiOPQY:Control.Duoidal.Either,Control.Duoidal.Laws=duoids-0.0.1.0-HGVxlGiTGubJau1PjiOPQY:Control.Duoidal.Laws,Data.Duoid=duoids-0.0.1.0-HGVxlGiTGubJau1PjiOPQY:Data.Duoid,Data.Duoid.Laws=duoids-0.0.1.0-HGVxlGiTGubJau1PjiOPQY:Data.Duoid.Laws
  3774. 989.89 s [duoids] unit duoids-0.0.1.0-KT7AVAn7OaA79Vd2hcgoD7-doctests
  3775. 989.89 s [duoids] include base-4.19.2.0-a4d2
  3776. 989.89 s [duoids] include doctest-0.24.2-7CW3VAqweMx6JNSdbfXAyp
  3777. 989.89 s [duoids] include duoids-0.0.1.0-HGVxlGiTGubJau1PjiOPQY
  3778. 989.89 s [duoids] include ghc-compat-plugin-0.1.0.1-7MjAExeaX6DEMyHCY8avBD
  3779. 989.90 s [duoids] Ready component graph:
  3780. 989.90 s [duoids] definite duoids-0.0.1.0-HGVxlGiTGubJau1PjiOPQY
  3781. 989.90 s [duoids] depends base-4.19.2.0-a4d2
  3782. 989.90 s [duoids] depends ghc-compat-plugin-0.1.0.1-7MjAExeaX6DEMyHCY8avBD
  3783. 989.90 s [duoids] definite duoids-0.0.1.0-KT7AVAn7OaA79Vd2hcgoD7-doctests
  3784. 989.90 s [duoids] depends base-4.19.2.0-a4d2
  3785. 989.90 s [duoids] depends doctest-0.24.2-7CW3VAqweMx6JNSdbfXAyp
  3786. 989.90 s [duoids] depends duoids-0.0.1.0-HGVxlGiTGubJau1PjiOPQY
  3787. 989.90 s [duoids] depends ghc-compat-plugin-0.1.0.1-7MjAExeaX6DEMyHCY8avBD
  3788. 989.90 s [duoids] Using Cabal-3.12.1.0 compiled by ghc-9.8
  3789. 989.90 s [duoids] Using compiler: ghc-9.8.4
  3790. 989.90 s [duoids] Using install prefix:
  3791. 989.90 s [duoids] /nix/store/m49xks76j1h3wsvdilf50skd80j6wchy-duoids-0.0.1.0
  3792. 989.90 s [duoids] Executables installed in:
  3793. 989.90 s [duoids] /nix/store/m49xks76j1h3wsvdilf50skd80j6wchy-duoids-0.0.1.0/bin
  3794. 989.90 s [duoids] Libraries installed in:
  3795. 989.90 s [duoids] /nix/store/m49xks76j1h3wsvdilf50skd80j6wchy-duoids-0.0.1.0/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4-952d/duoids-0.0.1.0-HGVxlGiTGubJau1PjiOPQY
  3796. 989.90 s [duoids] Dynamic Libraries installed in:
  3797. 989.90 s [duoids] /nix/store/m49xks76j1h3wsvdilf50skd80j6wchy-duoids-0.0.1.0/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4-952d
  3798. 989.90 s [duoids] Private executables installed in:
  3799. 989.90 s [duoids] /nix/store/m49xks76j1h3wsvdilf50skd80j6wchy-duoids-0.0.1.0/libexec/x86_64-linux-ghc-9.8.4-952d/duoids-0.0.1.0
  3800. 989.90 s [duoids] Data files installed in:
  3801. 989.90 s [duoids] /nix/store/m49xks76j1h3wsvdilf50skd80j6wchy-duoids-0.0.1.0/share/x86_64-linux-ghc-9.8.4-952d/duoids-0.0.1.0
  3802. 989.90 s [duoids] Documentation installed in:
  3803. 989.90 s [duoids] /nix/store/29cf6cypyr5ny7p5v05ikgb3kbdw1r6h-duoids-0.0.1.0-doc/share/doc/duoids-0.0.1.0
  3804. 989.90 s [duoids] Configuration files installed in:
  3805. 989.90 s [duoids] /nix/store/m49xks76j1h3wsvdilf50skd80j6wchy-duoids-0.0.1.0/etc
  3806. 989.90 s [duoids] No alex found
  3807. 989.90 s [duoids] Using ar found on system at:
  3808. 989.90 s [duoids] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
  3809. 989.90 s [duoids] No c2hs found
  3810. 989.90 s [duoids] No cpphs found
  3811. 989.90 s [duoids] Using doctest version 0.24.2 found on system at:
  3812. 989.90 s [duoids] /nix/store/njpw8hiwdi4abvh8g8yavys2ykkm6gmp-doctest-0.24.2/bin/doctest
  3813. 989.90 s [duoids] Using gcc version 14.3.0 given by user at:
  3814. 989.90 s [duoids] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
  3815. 989.90 s [duoids] Using ghc version 9.8.4 found on system at:
  3816. 989.90 s [duoids] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/ghc
  3817. 989.90 s [duoids] Using ghc-pkg version 9.8.4 found on system at:
  3818. 989.90 s [duoids] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/ghc-pkg-9.8.4
  3819. 989.90 s [duoids] No ghcjs found
  3820. 989.90 s [duoids] No ghcjs-pkg found
  3821. 989.90 s [duoids] No greencard found
  3822. 989.90 s [duoids] Using haddock version 2.30.0 found on system at:
  3823. 989.90 s [duoids] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/haddock-ghc-9.8.4
  3824. 989.90 s [duoids] No happy found
  3825. 989.90 s [duoids] Using haskell-suite found on system at: haskell-suite-dummy-location
  3826. 989.90 s [duoids] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  3827. 989.90 s [duoids] No hmake found
  3828. 989.90 s [duoids] Using hpc version 0.69 found on system at:
  3829. 989.90 s [duoids] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/hpc-ghc-9.8.4
  3830. 989.90 s [duoids] Using hsc2hs version 0.68.10 found on system at:
  3831. 989.90 s [duoids] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/hsc2hs-ghc-9.8.4
  3832. 989.90 s [duoids] Using hscolour version 1.25 found on system at:
  3833. 989.90 s [duoids] /nix/store/vl14mqkz7z183r6sq9qz932j3pix6v5c-hscolour-1.25/bin/HsColour
  3834. 989.90 s [duoids] No jhc found
  3835. 989.90 s [duoids] Using ld found on system at:
  3836. 989.90 s [duoids] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ld.gold
  3837. 989.90 s [duoids] No pkg-config found
  3838. 989.90 s [duoids] Using runghc version 9.8.4 found on system at:
  3839. 989.90 s [duoids] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/runghc-9.8.4
  3840. 989.90 s [duoids] Using strip version 2.44 found on system at:
  3841. 989.90 s [duoids] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
  3842. 989.90 s [duoids] Using tar found on system at:
  3843. 989.90 s [duoids] /nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
  3844. 989.90 s [duoids] No uhc found
  3845. 990.07 s [duoids] Phase: buildPhase
  3846. 990.10 s [vector] Phase: buildPhase
  3847. 990.17 s [duoids] Preprocessing library for duoids-0.0.1.0...
  3848. 990.17 s [duoids] Building library for duoids-0.0.1.0...
  3849. 990.21 s [vector] Preprocessing library for vector-0.13.2.0..
  3850. 990.21 s [vector] Building library for vector-0.13.2.0..
  3851. 990.32 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 )
  3852. 990.96 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 )
  3853. 991.07 s [duoids] [2 of 6] Compiling Data.Duoid ( src/Data/Duoid.hs, dist/build/Data/Duoid.o, dist/build/Data/Duoid.dyn_o )
  3854. 991.07 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 )
  3855. 991.07 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 )
  3856. 991.33 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 )
  3857. 991.33 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 )
  3858. 991.33 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 )
  3859. 991.33 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 )
  3860. 993.26 s [duoids] [3 of 6] Compiling Control.Duoidal ( src/Control/Duoidal.hs, dist/build/Control/Duoidal.o, dist/build/Control/Duoidal.dyn_o )
  3861. 997.05 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 )
  3862. 997.10 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 )
  3863. 997.10 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 )
  3864. 997.77 s [duoids] [1 of 6] Compiling Control.Duoidal.Async ( src/Control/Duoidal/Async.hs, dist/build/Control/Duoidal/Async.p_o )
  3865. 998.80 s [duoids] [2 of 6] Compiling Data.Duoid ( src/Data/Duoid.hs, dist/build/Data/Duoid.p_o )
  3866. 1001.38 s [duoids] [3 of 6] Compiling Control.Duoidal ( src/Control/Duoidal.hs, dist/build/Control/Duoidal.p_o )
  3867. 1001.83 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 )
  3868. 1004.93 s [duoids] [4 of 6] Compiling Control.Duoidal.Either ( src/Control/Duoidal/Either.hs, dist/build/Control/Duoidal/Either.p_o )
  3869. 1005.15 s [duoids] [5 of 6] Compiling Data.Duoid.Laws ( src/Data/Duoid/Laws.hs, dist/build/Data/Duoid/Laws.p_o )
  3870. 1005.18 s [duoids] [6 of 6] Compiling Control.Duoidal.Laws ( src/Control/Duoidal/Laws.hs, dist/build/Control/Duoidal/Laws.p_o )
  3871. 1007.20 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 )
  3872. 1011.42 s [duoids] Preprocessing test suite 'doctests' for duoids-0.0.1.0...
  3873. 1011.42 s [duoids] Building test suite 'doctests' for duoids-0.0.1.0...
  3874. 1011.59 s [duoids] [1 of 2] Compiling Build_doctests ( dist/build/doctests/autogen/Build_doctests.hs, dist/build/doctests/doctests-tmp/Build_doctests.o )
  3875. 1012.36 s [duoids] [2 of 2] Compiling Main ( tests/doctests.hs, dist/build/doctests/doctests-tmp/Main.o )
  3876. 1012.52 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 )
  3877. 1013.60 s [duoids] [3 of 3] Linking dist/build/doctests/doctests
  3878. 1013.70 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 )
  3879. 1021.51 s [duoids] buildPhase completed in 31 seconds
  3880. 1021.51 s [duoids] Phase: checkPhase
  3881. 1022.10 s [duoids] Running 1 test suites...
  3882. 1022.10 s [duoids] Test suite doctests: RUNNING...
  3883. 1023.15 s [duoids]
  3884. 1023.15 s [duoids] on the commandline: warning: [GHC-98887]
  3885. 1023.15 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  3886. 1023.16 s [duoids]
  3887. 1023.16 s [duoids] on the commandline: warning: [GHC-98887]
  3888. 1023.16 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  3889. 1023.16 s [duoids]
  3890. 1023.16 s [duoids] on the commandline: warning: [GHC-98887]
  3891. 1023.16 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  3892. 1023.16 s [duoids]
  3893. 1023.16 s [duoids] on the commandline: warning: [GHC-98887]
  3894. 1023.16 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  3895. 1023.17 s [duoids]
  3896. 1023.17 s [duoids] on the commandline: warning: [GHC-98887]
  3897. 1023.17 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  3898. 1023.17 s [duoids]
  3899. 1023.17 s [duoids] on the commandline: warning: [GHC-98887]
  3900. 1023.17 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  3901. 1023.17 s [duoids]
  3902. 1023.17 s [duoids] on the commandline: warning: [GHC-98887]
  3903. 1023.17 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  3904. 1023.18 s [duoids]
  3905. 1023.18 s [duoids] on the commandline: warning: [GHC-98887]
  3906. 1023.18 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  3907. 1023.18 s [duoids]
  3908. 1023.18 s [duoids] on the commandline: warning: [GHC-98887]
  3909. 1023.18 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  3910. 1023.19 s [duoids]
  3911. 1023.19 s [duoids] on the commandline: warning: [GHC-98887]
  3912. 1023.19 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  3913. 1026.48 s [duoids] Examples: 5 Tried: 5 Errors: 0 Failures: 0
  3914. 1026.59 s [duoids] NameLib Nothing
  3915. 1026.59 s [duoids] ----------------------------------------
  3916. 1026.62 s [duoids] Test suite doctests: PASS
  3917. 1026.62 s [duoids] Test suite logged to: dist/test/duoids-0.0.1.0-doctests.log
  3918. 1026.62 s [duoids] 1 of 1 test suites (1 of 1 test cases) passed.
  3919. 1026.70 s [duoids] Phase: haddockPhase
  3920. 1027.20 s [duoids] Preprocessing library for duoids-0.0.1.0...
  3921. 1027.20 s [duoids] Running Haddock on library for duoids-0.0.1.0...
  3922. 1028.12 s [duoids] [1 of 6] Compiling Control.Duoidal.Async ( src/Control/Duoidal/Async.hs, nothing )
  3923. 1028.86 s [duoids] [2 of 6] Compiling Data.Duoid ( src/Data/Duoid.hs, nothing )
  3924. 1029.68 s [duoids] [3 of 6] Compiling Control.Duoidal ( src/Control/Duoidal.hs, nothing )
  3925. 1030.74 s [duoids] [4 of 6] Compiling Control.Duoidal.Either ( src/Control/Duoidal/Either.hs, nothing )
  3926. 1030.76 s [duoids] [5 of 6] Compiling Data.Duoid.Laws ( src/Data/Duoid/Laws.hs, nothing )
  3927. 1030.82 s [duoids] [6 of 6] Compiling Control.Duoidal.Laws ( src/Control/Duoidal/Laws.hs, nothing )
  3928. 1030.86 s [duoids] Haddock coverage:
  3929. 1030.86 s [duoids] Warning: 'cancel' is out of scope.
  3930. 1030.86 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  3931. 1030.86 s [duoids] Warning: 'Applicative' is out of scope.
  3932. 1030.86 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  3933. 1030.86 s [duoids] Warning: 'Alternative' is out of scope.
  3934. 1030.86 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  3935. 1031.04 s [duoids] Warning: 'Par' is ambiguous. It is defined
  3936. 1031.04 s [duoids] * at src/Data/Duoid.hs:62:5
  3937. 1031.04 s [duoids] * at src/Data/Duoid.hs:58:1
  3938. 1031.04 s [duoids] You may be able to disambiguate the identifier by qualifying it or
  3939. 1031.04 s [duoids] by specifying the type/value namespace explicitly.
  3940. 1031.04 s [duoids] Defaulting to the one defined at src/Data/Duoid.hs:58:1
  3941. 1031.04 s [duoids] Warning: 'Seq' is ambiguous. It is defined
  3942. 1031.04 s [duoids] * at src/Data/Duoid.hs:118:5
  3943. 1031.04 s [duoids] * at src/Data/Duoid.hs:114:1
  3944. 1031.04 s [duoids] You may be able to disambiguate the identifier by qualifying it or
  3945. 1031.04 s [duoids] by specifying the type/value namespace explicitly.
  3946. 1031.04 s [duoids] Defaulting to the one defined at src/Data/Duoid.hs:114:1
  3947. 1031.04 s [duoids] 100% ( 10 / 10) in 'Data.Duoid'
  3948. 1031.04 s [duoids] Warning: 'ExceptT' is out of scope.
  3949. 1031.04 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  3950. 1031.04 s [duoids] Warning: 'Parallel' is ambiguous. It is defined
  3951. 1031.04 s [duoids] * at src/Control/Duoidal.hs:238:5
  3952. 1031.04 s [duoids] * at src/Control/Duoidal.hs:234:1
  3953. 1031.04 s [duoids] You may be able to disambiguate the identifier by qualifying it or
  3954. 1031.04 s [duoids] by specifying the type/value namespace explicitly.
  3955. 1031.04 s [duoids] Defaulting to the one defined at src/Control/Duoidal.hs:234:1
  3956. 1031.04 s [duoids] Warning: 'Sequential' is ambiguous. It is defined
  3957. 1031.04 s [duoids] * at src/Control/Duoidal.hs:308:5
  3958. 1031.05 s [duoids] * at src/Control/Duoidal.hs:304:1
  3959. 1031.05 s [duoids] You may be able to disambiguate the identifier by qualifying it or
  3960. 1031.05 s [duoids] by specifying the type/value namespace explicitly.
  3961. 1031.05 s [duoids] Defaulting to the one defined at src/Control/Duoidal.hs:304:1
  3962. 1031.05 s [duoids] Warning: 'NoDefaultPrelude' is out of scope.
  3963. 1031.05 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  3964. 1031.05 s [duoids] Warning: 'Validation' is out of scope.
  3965. 1031.05 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  3966. 1031.05 s [duoids] Warning: 'fail' is out of scope.
  3967. 1031.05 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  3968. 1031.05 s [duoids] Warning: 'MonadFail' is out of scope.
  3969. 1031.05 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  3970. 1031.05 s [duoids] Warning: 'Commutative' is ambiguous. It is defined
  3971. 1031.05 s [duoids] * at src/Control/Duoidal.hs:774:5
  3972. 1031.05 s [duoids] * at src/Control/Duoidal.hs:770:1
  3973. 1031.05 s [duoids] You may be able to disambiguate the identifier by qualifying it or
  3974. 1031.05 s [duoids] by specifying the type/value namespace explicitly.
  3975. 1031.05 s [duoids] Defaulting to the one defined at src/Control/Duoidal.hs:770:1
  3976. 1031.05 s [duoids] Warning: 'Writer' is out of scope.
  3977. 1031.05 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  3978. 1031.05 s [duoids] Warning: 'Set' is out of scope.
  3979. 1031.05 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  3980. 1031.05 s [duoids] Warning: 'Char' is out of scope.
  3981. 1031.05 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  3982. 1031.05 s [duoids] Warning: 'Const' is ambiguous. It is defined
  3983. 1031.05 s [duoids] * in ‘Data.Functor.Const’
  3984. 1031.05 s [duoids] * in ‘Data.Functor.Const’
  3985. 1031.05 s [duoids] You may be able to disambiguate the identifier by qualifying it or
  3986. 1031.05 s [duoids] by specifying the type/value namespace explicitly.
  3987. 1031.05 s [duoids] Defaulting to the one defined in ‘Data.Functor.Const’
  3988. 1031.05 s [duoids] Warning: 'Normal' is ambiguous. It is defined
  3989. 1031.05 s [duoids] * at src/Control/Duoidal.hs:395:1
  3990. 1031.05 s [duoids] * at src/Data/Duoid.hs:183:1
  3991. 1031.05 s [duoids] You may be able to disambiguate the identifier by qualifying it or
  3992. 1031.05 s [duoids] by specifying the type/value namespace explicitly.
  3993. 1031.05 s [duoids] Defaulting to the one defined at src/Data/Duoid.hs:183:1
  3994. 1031.06 s [duoids] 100% ( 60 / 60) in 'Control.Duoidal'
  3995. 1031.06 s [duoids] 100% ( 2 / 2) in 'Control.Duoidal.Either'
  3996. 1031.06 s [duoids] Warning: 'Normal' is out of scope.
  3997. 1031.06 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  3998. 1031.06 s [duoids] Warning: 'Law' is ambiguous. It is defined
  3999. 1031.06 s [duoids] * at src/Data/Duoid/Laws.hs:38:5
  4000. 1031.06 s [duoids] * at src/Data/Duoid/Laws.hs:34:1
  4001. 1031.06 s [duoids] You may be able to disambiguate the identifier by qualifying it or
  4002. 1031.06 s [duoids] by specifying the type/value namespace explicitly.
  4003. 1031.06 s [duoids] Defaulting to the one defined at src/Data/Duoid/Laws.hs:34:1
  4004. 1031.06 s [duoids] 100% ( 12 / 12) in 'Data.Duoid.Laws'
  4005. 1031.06 s [duoids] 100% ( 6 / 6) in 'Control.Duoidal.Laws'
  4006. 1031.69 s [duoids] Warning: Data.Duoid: could not find link destinations for:
  4007. 1031.69 s [duoids] - Data.Duoid.Rep_Comm
  4008. 1031.69 s [duoids] - Data.Duoid.Rep1_Comm
  4009. 1031.69 s [duoids] - Data.Duoid.Rep_Seq
  4010. 1031.69 s [duoids] - Data.Duoid.Rep1_Seq
  4011. 1031.69 s [duoids] - Data.Duoid.Rep_Par
  4012. 1031.69 s [duoids] - Data.Duoid.Rep1_Par
  4013. 1031.75 s [duoids] Warning: Control.Duoidal: could not find link destinations for:
  4014. 1031.75 s [duoids] - Control.Duoidal.Rep_Commutative
  4015. 1031.75 s [duoids] - Control.Duoidal.Rep1_Commutative
  4016. 1031.75 s [duoids] - Control.Duoidal.Rep_Sequential
  4017. 1031.75 s [duoids] - Control.Duoidal.Rep1_Sequential
  4018. 1031.75 s [duoids] - Control.Duoidal.Rep_Parallel
  4019. 1031.75 s [duoids] - Control.Duoidal.Rep1_Parallel
  4020. 1031.75 s [duoids] Warning: Data.Duoid.Laws: could not find link destinations for:
  4021. 1031.76 s [duoids] - Data.Duoid.Laws.Rep_NormalLaws
  4022. 1031.76 s [duoids] - Data.Duoid.Laws.Rep1_NormalLaws
  4023. 1031.76 s [duoids] - Data.Duoid.Laws.Rep_Laws
  4024. 1031.76 s [duoids] - Data.Duoid.Laws.Rep_Law
  4025. 1032.46 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 )
  4026. 1032.50 s [vector] [13 of 23] Compiling Data.Vector ( src/Data/Vector.hs, dist/build/Data/Vector.o, dist/build/Data/Vector.dyn_o )
  4027. 1058.18 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 )
  4028. 1058.22 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 )
  4029. 1058.22 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 )
  4030. 1058.22 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 )
  4031. 1058.22 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 )
  4032. 1058.25 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 )
  4033. 1058.25 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 )
  4034. 1058.41 s [duoids] Documentation created: dist/doc/html/duoids/, dist/doc/html/duoids/duoids.txt
  4035. 1058.56 s [duoids] Preprocessing test suite 'doctests' for duoids-0.0.1.0...
  4036. 1058.57 s [duoids] haddockPhase completed in 32 seconds
  4037. 1058.57 s [duoids] Phase: installPhase
  4038. 1058.74 s [duoids] Installing library in /nix/store/m49xks76j1h3wsvdilf50skd80j6wchy-duoids-0.0.1.0/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4-952d/duoids-0.0.1.0-HGVxlGiTGubJau1PjiOPQY
  4039. 1059.59 s [duoids] Phase: fixupPhase
  4040. 1059.63 s [duoids] shrinking RPATHs of ELF executables and libraries in /nix/store/m49xks76j1h3wsvdilf50skd80j6wchy-duoids-0.0.1.0
  4041. 1059.64 s [duoids] shrinking /nix/store/m49xks76j1h3wsvdilf50skd80j6wchy-duoids-0.0.1.0/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4-952d/libHSduoids-0.0.1.0-HGVxlGiTGubJau1PjiOPQY-ghc9.8.4.so
  4042. 1059.66 s [duoids] checking for references to /build/ in /nix/store/m49xks76j1h3wsvdilf50skd80j6wchy-duoids-0.0.1.0...
  4043. 1059.69 s [duoids] patching script interpreter paths in /nix/store/m49xks76j1h3wsvdilf50skd80j6wchy-duoids-0.0.1.0
  4044. 1059.70 s [duoids] stripping (with command strip and flags -S -p) in /nix/store/m49xks76j1h3wsvdilf50skd80j6wchy-duoids-0.0.1.0/lib
  4045. 1059.91 s [duoids] shrinking RPATHs of ELF executables and libraries in /nix/store/29cf6cypyr5ny7p5v05ikgb3kbdw1r6h-duoids-0.0.1.0-doc
  4046. 1059.92 s [duoids] checking for references to /build/ in /nix/store/29cf6cypyr5ny7p5v05ikgb3kbdw1r6h-duoids-0.0.1.0-doc...
  4047. 1059.95 s [duoids] patching script interpreter paths in /nix/store/29cf6cypyr5ny7p5v05ikgb3kbdw1r6h-duoids-0.0.1.0-doc
  4048. 1060.33 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/29cf6cypyr5ny7p5v05ikgb3kbdw1r6h-duoids-0.0.1.0-doc /nix/store/m49xks76j1h3wsvdilf50skd80j6wchy-duoids-0.0.1.0
  4049. 1061.29 s [post-build-hook] Pushing 2 paths (72 are already present) using zstd to cache sellout ⏳
  4050. 1061.29 s [post-build-hook]
  4051. 1061.68 s [post-build-hook] Pushing /nix/store/29cf6cypyr5ny7p5v05ikgb3kbdw1r6h-duoids-0.0.1.0-doc (2.26 MiB)
  4052. 1061.73 s [post-build-hook] Pushing /nix/store/m49xks76j1h3wsvdilf50skd80j6wchy-duoids-0.0.1.0 (8.11 MiB)
  4053. 1062.97 s [post-build-hook]
  4054. 1062.97 s [post-build-hook] All done.
  4055. 1063.02 s [post-build-hook] Uploading to the NixCI cache: /nix/store/29cf6cypyr5ny7p5v05ikgb3kbdw1r6h-duoids-0.0.1.0-doc /nix/store/m49xks76j1h3wsvdilf50skd80j6wchy-duoids-0.0.1.0
  4056. 1063.12 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  4057. 1063.15 s [post-build-hook] copying 2 paths...
  4058. 1063.15 s [post-build-hook] copying path '/nix/store/29cf6cypyr5ny7p5v05ikgb3kbdw1r6h-duoids-0.0.1.0-doc' to 'https://cache.nix-ci.com'...
  4059. 1064.04 s [post-build-hook] copying path '/nix/store/m49xks76j1h3wsvdilf50skd80j6wchy-duoids-0.0.1.0' to 'https://cache.nix-ci.com'...
  4060. 1068.23 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  4061. 1068.57 s [post-build-hook] copying 1 paths...
  4062. 1068.57 s [post-build-hook] copying path '/nix/store/rbghj3j5wynmmnsy390iq2ham26ykpda-duoids-0.0.1.0.drv' to 'https://cache.nix-ci.com'...
  4063. 1068.86 s Progress: 6 of 22 built (1 building), 160 of 160 downloaded from cache
  4064. 1068.95 s Building duoidal-transformers
  4065. 1069.03 s Building duoids-hedgehog
  4066. 1069.07 s [duoidal-transformers] Phase: setupCompilerEnvironmentPhase
  4067. 1069.11 s [duoidal-transformers] Build with /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4.
  4068. 1069.24 s [duoids-hedgehog] Phase: setupCompilerEnvironmentPhase
  4069. 1069.24 s [duoids-hedgehog] Build with /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4.
  4070. 1069.48 s [duoidal-transformers] Phase: unpackPhase
  4071. 1069.48 s [duoidal-transformers] unpacking source archive /nix/store/hwhxlh4aq4w3fvrlk65js3cdkm3in22k-5y8mzl3igbd7qyrpb010fqiak50k5q01-source/./transformers
  4072. 1069.50 s [duoidal-transformers] source root is transformers
  4073. 1069.51 s [duoidal-transformers] Phase: patchPhase
  4074. 1069.53 s [duoidal-transformers] Phase: compileBuildDriverPhase
  4075. 1069.53 s [duoidal-transformers] setupCompileFlags: -package-db=/build/tmp.HGbrNcgeDF/setup-package.conf.d -threaded
  4076. 1069.71 s [duoidal-transformers] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.HGbrNcgeDF/Main.o )
  4077. 1069.79 s [duoids-hedgehog] Phase: unpackPhase
  4078. 1069.80 s [duoids-hedgehog] unpacking source archive /nix/store/hwhxlh4aq4w3fvrlk65js3cdkm3in22k-5y8mzl3igbd7qyrpb010fqiak50k5q01-source/./hedgehog
  4079. 1069.81 s [duoids-hedgehog] source root is hedgehog
  4080. 1069.82 s [duoids-hedgehog] Phase: patchPhase
  4081. 1069.84 s [duoids-hedgehog] Phase: compileBuildDriverPhase
  4082. 1069.84 s [duoids-hedgehog] setupCompileFlags: -package-db=/build/tmp.1hoxZ3sutx/setup-package.conf.d -threaded
  4083. 1069.86 s [duoidal-transformers] [2 of 2] Linking Setup
  4084. 1070.01 s [duoids-hedgehog] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.1hoxZ3sutx/Main.o )
  4085. 1070.17 s [duoids-hedgehog] [2 of 2] Linking Setup
  4086. 1073.24 s [duoidal-transformers] Phase: updateAutotoolsGnuConfigScriptsPhase
  4087. 1073.28 s [duoidal-transformers] Phase: configurePhase
  4088. 1073.29 s [duoidal-transformers] configureFlags: --verbose --prefix=/nix/store/aj1wphvkxd5d6385fmiixhm34np0amm5-duoidal-transformers-0.0.1.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/xvvxl5m8a7i5myavhdm3blpazf4ajnf3-duoidal-transformers-0.0.1.0-doc/share/doc/duoidal-transformers-0.0.1.0 --with-gcc=gcc --package-db=/build/tmp.HGbrNcgeDF/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --ghc-options=-Werror --extra-lib-dirs=/nix/store/xp8g8298vbm4k9ipj14xf1r4rh899hr4-ncurses-6.5/lib --extra-lib-dirs=/nix/store/wxm6pczq28ppr7ffwclsl6njbzzr48zf-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/3f0hp921ncxr249f5lmspc8silkqr8f7-elfutils-0.194/lib --extra-lib-dirs=/nix/store/km81slwkcc82dbwywl10gpffjb78g6ni-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/fvsl0b39y6ns2z66gfvc2raca3b5wr18-numactl-2.0.18/lib --extra-lib-dirs=/nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/lib
  4089. 1073.32 s [duoidal-transformers] Using Parsec parser
  4090. 1073.32 s [duoidal-transformers] Configuring duoidal-transformers-0.0.1.0...
  4091. 1073.59 s [duoids-hedgehog] Phase: updateAutotoolsGnuConfigScriptsPhase
  4092. 1073.61 s [duoids-hedgehog] Phase: configurePhase
  4093. 1073.62 s [duoids-hedgehog] configureFlags: --verbose --prefix=/nix/store/vm5i94j0k512cw26vxh9slszby68s1aw-duoids-hedgehog-0.0.1.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/b3f82ryc5skmjd5swkrsxn545jg8dah4-duoids-hedgehog-0.0.1.0-doc/share/doc/duoids-hedgehog-0.0.1.0 --with-gcc=gcc --package-db=/build/tmp.1hoxZ3sutx/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --ghc-options=-Werror --extra-lib-dirs=/nix/store/xp8g8298vbm4k9ipj14xf1r4rh899hr4-ncurses-6.5/lib --extra-lib-dirs=/nix/store/wxm6pczq28ppr7ffwclsl6njbzzr48zf-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/3f0hp921ncxr249f5lmspc8silkqr8f7-elfutils-0.194/lib --extra-lib-dirs=/nix/store/km81slwkcc82dbwywl10gpffjb78g6ni-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/fvsl0b39y6ns2z66gfvc2raca3b5wr18-numactl-2.0.18/lib --extra-lib-dirs=/nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/lib
  4094. 1073.65 s [duoids-hedgehog] Using Parsec parser
  4095. 1073.65 s [duoids-hedgehog] Configuring duoids-hedgehog-0.0.1.0...
  4096. 1074.25 s [duoidal-transformers] Flags chosen: lint=False, noisy-deprecations=True
  4097. 1074.54 s [duoids-hedgehog] Flags chosen: lint=False, noisy-deprecations=True
  4098. 1074.93 s [duoidal-transformers] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  4099. 1074.93 s [duoidal-transformers] >=4.21.0 && <4.22 || >=4.22.0 && <4.23: using base-4.19.2.0
  4100. 1074.93 s [duoidal-transformers] Dependency duoids >=0.0.1 && <0.1: using duoids-0.0.1.0
  4101. 1074.93 s [duoidal-transformers] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  4102. 1074.93 s [duoidal-transformers] Dependency transformers >=0.6.1 && <0.7: using transformers-0.6.1.0
  4103. 1074.93 s [duoidal-transformers] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  4104. 1074.93 s [duoidal-transformers] >=4.21.0 && <4.22 || >=4.22.0 && <4.23: using base-4.19.2.0
  4105. 1074.93 s [duoidal-transformers] Dependency doctest >=0.21.1 && <0.22 || >=0.22.6 && <0.23 || >=0.24.0 &&
  4106. 1074.93 s [duoidal-transformers] <0.25: using doctest-0.24.2
  4107. 1074.93 s [duoidal-transformers] Dependency duoidal-transformers: using duoidal-transformers-0.0.1.0
  4108. 1074.93 s [duoidal-transformers] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  4109. 1074.93 s [duoidal-transformers] Source component graph:
  4110. 1074.93 s [duoidal-transformers] component lib
  4111. 1074.93 s [duoidal-transformers] component test:doctests dependency lib
  4112. 1074.93 s [duoidal-transformers] Configured component graph:
  4113. 1074.93 s [duoidal-transformers] component duoidal-transformers-0.0.1.0-AFNUfQjqJGy5PBgQtMcdM9
  4114. 1074.93 s [duoidal-transformers] include base-4.19.2.0-a4d2
  4115. 1074.93 s [duoidal-transformers] include duoids-0.0.1.0-HGVxlGiTGubJau1PjiOPQY
  4116. 1074.93 s [duoidal-transformers] include ghc-compat-plugin-0.1.0.1-7MjAExeaX6DEMyHCY8avBD
  4117. 1074.93 s [duoidal-transformers] include transformers-0.6.1.0-8f1d
  4118. 1074.93 s [duoidal-transformers] component duoidal-transformers-0.0.1.0-47XBNSqmJPADfKnvXhmvO0-doctests
  4119. 1074.93 s [duoidal-transformers] include base-4.19.2.0-a4d2
  4120. 1074.93 s [duoidal-transformers] include doctest-0.24.2-7CW3VAqweMx6JNSdbfXAyp
  4121. 1074.93 s [duoidal-transformers] include duoidal-transformers-0.0.1.0-AFNUfQjqJGy5PBgQtMcdM9
  4122. 1074.93 s [duoidal-transformers] include ghc-compat-plugin-0.1.0.1-7MjAExeaX6DEMyHCY8avBD
  4123. 1074.93 s [duoidal-transformers] Linked component graph:
  4124. 1074.93 s [duoidal-transformers] unit duoidal-transformers-0.0.1.0-AFNUfQjqJGy5PBgQtMcdM9
  4125. 1074.93 s [duoidal-transformers] include base-4.19.2.0-a4d2
  4126. 1074.93 s [duoidal-transformers] include duoids-0.0.1.0-HGVxlGiTGubJau1PjiOPQY
  4127. 1074.93 s [duoidal-transformers] include ghc-compat-plugin-0.1.0.1-7MjAExeaX6DEMyHCY8avBD
  4128. 1074.93 s [duoidal-transformers] include transformers-0.6.1.0-8f1d
  4129. 1074.93 s [duoidal-transformers] Control.Duoidal.Trans.Class=duoidal-transformers-0.0.1.0-AFNUfQjqJGy5PBgQtMcdM9:Control.Duoidal.Trans.Class,Control.Duoidal.Trans.Orphans=duoidal-transformers-0.0.1.0-AFNUfQjqJGy5PBgQtMcdM9:Control.Duoidal.Trans.Orphans
  4130. 1074.93 s [duoidal-transformers] unit duoidal-transformers-0.0.1.0-47XBNSqmJPADfKnvXhmvO0-doctests
  4131. 1074.93 s [duoidal-transformers] include base-4.19.2.0-a4d2
  4132. 1074.93 s [duoidal-transformers] include doctest-0.24.2-7CW3VAqweMx6JNSdbfXAyp
  4133. 1074.93 s [duoidal-transformers] include duoidal-transformers-0.0.1.0-AFNUfQjqJGy5PBgQtMcdM9
  4134. 1074.93 s [duoidal-transformers] include ghc-compat-plugin-0.1.0.1-7MjAExeaX6DEMyHCY8avBD
  4135. 1074.93 s [duoidal-transformers] Ready component graph:
  4136. 1074.93 s [duoidal-transformers] definite duoidal-transformers-0.0.1.0-AFNUfQjqJGy5PBgQtMcdM9
  4137. 1074.93 s [duoidal-transformers] depends base-4.19.2.0-a4d2
  4138. 1074.93 s [duoidal-transformers] depends duoids-0.0.1.0-HGVxlGiTGubJau1PjiOPQY
  4139. 1074.93 s [duoidal-transformers] depends ghc-compat-plugin-0.1.0.1-7MjAExeaX6DEMyHCY8avBD
  4140. 1074.93 s [duoidal-transformers] depends transformers-0.6.1.0-8f1d
  4141. 1074.93 s [duoidal-transformers] definite duoidal-transformers-0.0.1.0-47XBNSqmJPADfKnvXhmvO0-doctests
  4142. 1074.93 s [duoidal-transformers] depends base-4.19.2.0-a4d2
  4143. 1074.93 s [duoidal-transformers] depends doctest-0.24.2-7CW3VAqweMx6JNSdbfXAyp
  4144. 1074.93 s [duoidal-transformers] depends duoidal-transformers-0.0.1.0-AFNUfQjqJGy5PBgQtMcdM9
  4145. 1074.93 s [duoidal-transformers] depends ghc-compat-plugin-0.1.0.1-7MjAExeaX6DEMyHCY8avBD
  4146. 1074.93 s [duoidal-transformers] Using Cabal-3.12.1.0 compiled by ghc-9.8
  4147. 1074.93 s [duoidal-transformers] Using compiler: ghc-9.8.4
  4148. 1074.93 s [duoidal-transformers] Using install prefix:
  4149. 1074.93 s [duoidal-transformers] /nix/store/aj1wphvkxd5d6385fmiixhm34np0amm5-duoidal-transformers-0.0.1.0
  4150. 1074.93 s [duoidal-transformers] Executables installed in:
  4151. 1074.93 s [duoidal-transformers] /nix/store/aj1wphvkxd5d6385fmiixhm34np0amm5-duoidal-transformers-0.0.1.0/bin
  4152. 1074.93 s [duoidal-transformers] Libraries installed in:
  4153. 1074.93 s [duoidal-transformers] /nix/store/aj1wphvkxd5d6385fmiixhm34np0amm5-duoidal-transformers-0.0.1.0/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4-952d/duoidal-transformers-0.0.1.0-AFNUfQjqJGy5PBgQtMcdM9
  4154. 1074.93 s [duoidal-transformers] Dynamic Libraries installed in:
  4155. 1074.93 s [duoidal-transformers] /nix/store/aj1wphvkxd5d6385fmiixhm34np0amm5-duoidal-transformers-0.0.1.0/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4-952d
  4156. 1074.93 s [duoidal-transformers] Private executables installed in:
  4157. 1074.93 s [duoidal-transformers] /nix/store/aj1wphvkxd5d6385fmiixhm34np0amm5-duoidal-transformers-0.0.1.0/libexec/x86_64-linux-ghc-9.8.4-952d/duoidal-transformers-0.0.1.0
  4158. 1074.93 s [duoidal-transformers] Data files installed in:
  4159. 1074.93 s [duoidal-transformers] /nix/store/aj1wphvkxd5d6385fmiixhm34np0amm5-duoidal-transformers-0.0.1.0/share/x86_64-linux-ghc-9.8.4-952d/duoidal-transformers-0.0.1.0
  4160. 1074.93 s [duoidal-transformers] Documentation installed in:
  4161. 1074.93 s [duoidal-transformers] /nix/store/xvvxl5m8a7i5myavhdm3blpazf4ajnf3-duoidal-transformers-0.0.1.0-doc/share/doc/duoidal-transformers-0.0.1.0
  4162. 1074.93 s [duoidal-transformers] Configuration files installed in:
  4163. 1074.93 s [duoidal-transformers] /nix/store/aj1wphvkxd5d6385fmiixhm34np0amm5-duoidal-transformers-0.0.1.0/etc
  4164. 1074.93 s [duoidal-transformers] No alex found
  4165. 1074.93 s [duoidal-transformers] Using ar found on system at:
  4166. 1074.93 s [duoidal-transformers] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
  4167. 1074.93 s [duoidal-transformers] No c2hs found
  4168. 1074.93 s [duoidal-transformers] No cpphs found
  4169. 1074.93 s [duoidal-transformers] Using doctest version 0.24.2 found on system at:
  4170. 1074.93 s [duoidal-transformers] /nix/store/njpw8hiwdi4abvh8g8yavys2ykkm6gmp-doctest-0.24.2/bin/doctest
  4171. 1074.93 s [duoidal-transformers] Using gcc version 14.3.0 given by user at:
  4172. 1074.93 s [duoidal-transformers] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
  4173. 1074.93 s [duoidal-transformers] Using ghc version 9.8.4 found on system at:
  4174. 1074.93 s [duoidal-transformers] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/ghc
  4175. 1074.93 s [duoidal-transformers] Using ghc-pkg version 9.8.4 found on system at:
  4176. 1074.93 s [duoidal-transformers] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/ghc-pkg-9.8.4
  4177. 1074.93 s [duoidal-transformers] No ghcjs found
  4178. 1074.93 s [duoidal-transformers] No ghcjs-pkg found
  4179. 1074.93 s [duoidal-transformers] No greencard found
  4180. 1074.93 s [duoidal-transformers] Using haddock version 2.30.0 found on system at:
  4181. 1074.93 s [duoidal-transformers] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/haddock-ghc-9.8.4
  4182. 1074.93 s [duoidal-transformers] No happy found
  4183. 1074.93 s [duoidal-transformers] Using haskell-suite found on system at: haskell-suite-dummy-location
  4184. 1074.93 s [duoidal-transformers] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  4185. 1074.93 s [duoidal-transformers] No hmake found
  4186. 1074.93 s [duoidal-transformers] Using hpc version 0.69 found on system at:
  4187. 1074.93 s [duoidal-transformers] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/hpc-ghc-9.8.4
  4188. 1074.93 s [duoidal-transformers] Using hsc2hs version 0.68.10 found on system at:
  4189. 1074.93 s [duoidal-transformers] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/hsc2hs-ghc-9.8.4
  4190. 1074.93 s [duoidal-transformers] Using hscolour version 1.25 found on system at:
  4191. 1074.93 s [duoidal-transformers] /nix/store/vl14mqkz7z183r6sq9qz932j3pix6v5c-hscolour-1.25/bin/HsColour
  4192. 1074.93 s [duoidal-transformers] No jhc found
  4193. 1074.93 s [duoidal-transformers] Using ld found on system at:
  4194. 1074.93 s [duoidal-transformers] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ld.gold
  4195. 1074.93 s [duoidal-transformers] No pkg-config found
  4196. 1074.93 s [duoidal-transformers] Using runghc version 9.8.4 found on system at:
  4197. 1074.93 s [duoidal-transformers] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/runghc-9.8.4
  4198. 1074.93 s [duoidal-transformers] Using strip version 2.44 found on system at:
  4199. 1074.93 s [duoidal-transformers] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
  4200. 1074.93 s [duoidal-transformers] Using tar found on system at:
  4201. 1074.93 s [duoidal-transformers] /nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
  4202. 1074.93 s [duoidal-transformers] No uhc found
  4203. 1075.18 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 )
  4204. 1075.21 s [duoidal-transformers] Phase: buildPhase
  4205. 1075.30 s [duoids-hedgehog] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  4206. 1075.30 s [duoids-hedgehog] >=4.21.0 && <4.22 || >=4.22.0 && <4.23: using base-4.19.2.0
  4207. 1075.30 s [duoids-hedgehog] Dependency duoids >=0.0.1 && <0.1: using duoids-0.0.1.0
  4208. 1075.30 s [duoids-hedgehog] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  4209. 1075.30 s [duoids-hedgehog] Dependency hedgehog >=1.2 && <1.3 || >=1.4 && <1.6 || >=1.7 && <1.8: using
  4210. 1075.30 s [duoids-hedgehog] hedgehog-1.5
  4211. 1075.30 s [duoids-hedgehog] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  4212. 1075.30 s [duoids-hedgehog] >=4.21.0 && <4.22 || >=4.22.0 && <4.23: using base-4.19.2.0
  4213. 1075.31 s [duoids-hedgehog] Dependency duoids-hedgehog: using duoids-hedgehog-0.0.1.0
  4214. 1075.31 s [duoids-hedgehog] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  4215. 1075.31 s [duoids-hedgehog] Dependency hedgehog >=1.2 && <1.3 || >=1.4 && <1.6 || >=1.7 && <1.8: using
  4216. 1075.31 s [duoids-hedgehog] hedgehog-1.5
  4217. 1075.31 s [duoids-hedgehog] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  4218. 1075.31 s [duoids-hedgehog] >=4.21.0 && <4.22 || >=4.22.0 && <4.23: using base-4.19.2.0
  4219. 1075.31 s [duoids-hedgehog] Dependency doctest >=0.21.1 && <0.22 || >=0.22.6 && <0.23 || >=0.24.0 &&
  4220. 1075.31 s [duoids-hedgehog] <0.25: using doctest-0.24.2
  4221. 1075.31 s [duoids-hedgehog] Dependency duoids-hedgehog: using duoids-hedgehog-0.0.1.0
  4222. 1075.31 s [duoids-hedgehog] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  4223. 1075.31 s [duoids-hedgehog] Source component graph:
  4224. 1075.31 s [duoids-hedgehog] component lib
  4225. 1075.31 s [duoids-hedgehog] component test:doctests dependency lib
  4226. 1075.31 s [duoids-hedgehog] component test:laws dependency lib
  4227. 1075.31 s [duoids-hedgehog] Configured component graph:
  4228. 1075.31 s [duoids-hedgehog] component duoids-hedgehog-0.0.1.0-DNfhlYCCG6pCyVz8JVxsPH
  4229. 1075.31 s [duoids-hedgehog] include base-4.19.2.0-a4d2
  4230. 1075.31 s [duoids-hedgehog] include duoids-0.0.1.0-HGVxlGiTGubJau1PjiOPQY
  4231. 1075.31 s [duoids-hedgehog] include ghc-compat-plugin-0.1.0.1-7MjAExeaX6DEMyHCY8avBD
  4232. 1075.31 s [duoids-hedgehog] include hedgehog-1.5-I61WWSEyWWs9b1Ow8jewYT
  4233. 1075.31 s [duoids-hedgehog] component duoids-hedgehog-0.0.1.0-2voqHNyLv91JAI4xC6iWB3-doctests
  4234. 1075.31 s [duoids-hedgehog] include base-4.19.2.0-a4d2
  4235. 1075.31 s [duoids-hedgehog] include doctest-0.24.2-7CW3VAqweMx6JNSdbfXAyp
  4236. 1075.31 s [duoids-hedgehog] include duoids-hedgehog-0.0.1.0-DNfhlYCCG6pCyVz8JVxsPH
  4237. 1075.31 s [duoids-hedgehog] include ghc-compat-plugin-0.1.0.1-7MjAExeaX6DEMyHCY8avBD
  4238. 1075.31 s [duoids-hedgehog] component duoids-hedgehog-0.0.1.0-3i564kN2UkJxjpJZZQvq6-laws
  4239. 1075.31 s [duoids-hedgehog] include base-4.19.2.0-a4d2
  4240. 1075.31 s [duoids-hedgehog] include duoids-hedgehog-0.0.1.0-DNfhlYCCG6pCyVz8JVxsPH
  4241. 1075.31 s [duoids-hedgehog] include ghc-compat-plugin-0.1.0.1-7MjAExeaX6DEMyHCY8avBD
  4242. 1075.31 s [duoids-hedgehog] include hedgehog-1.5-I61WWSEyWWs9b1Ow8jewYT
  4243. 1075.31 s [duoids-hedgehog] Linked component graph:
  4244. 1075.31 s [duoids-hedgehog] unit duoids-hedgehog-0.0.1.0-DNfhlYCCG6pCyVz8JVxsPH
  4245. 1075.31 s [duoids-hedgehog] include base-4.19.2.0-a4d2
  4246. 1075.31 s [duoids-hedgehog] include duoids-0.0.1.0-HGVxlGiTGubJau1PjiOPQY
  4247. 1075.31 s [duoids-hedgehog] include ghc-compat-plugin-0.1.0.1-7MjAExeaX6DEMyHCY8avBD
  4248. 1075.31 s [duoids-hedgehog] include hedgehog-1.5-I61WWSEyWWs9b1Ow8jewYT
  4249. 1075.31 s [duoids-hedgehog] Test.Duoid=duoids-hedgehog-0.0.1.0-DNfhlYCCG6pCyVz8JVxsPH:Test.Duoid,Test.Duoidal=duoids-hedgehog-0.0.1.0-DNfhlYCCG6pCyVz8JVxsPH:Test.Duoidal
  4250. 1075.31 s [duoids-hedgehog] unit duoids-hedgehog-0.0.1.0-2voqHNyLv91JAI4xC6iWB3-doctests
  4251. 1075.31 s [duoids-hedgehog] include base-4.19.2.0-a4d2
  4252. 1075.31 s [duoids-hedgehog] include doctest-0.24.2-7CW3VAqweMx6JNSdbfXAyp
  4253. 1075.31 s [duoids-hedgehog] include duoids-hedgehog-0.0.1.0-DNfhlYCCG6pCyVz8JVxsPH
  4254. 1075.31 s [duoids-hedgehog] include ghc-compat-plugin-0.1.0.1-7MjAExeaX6DEMyHCY8avBD
  4255. 1075.31 s [duoids-hedgehog] unit duoids-hedgehog-0.0.1.0-3i564kN2UkJxjpJZZQvq6-laws
  4256. 1075.31 s [duoids-hedgehog] include base-4.19.2.0-a4d2
  4257. 1075.31 s [duoids-hedgehog] include duoids-hedgehog-0.0.1.0-DNfhlYCCG6pCyVz8JVxsPH
  4258. 1075.31 s [duoids-hedgehog] include ghc-compat-plugin-0.1.0.1-7MjAExeaX6DEMyHCY8avBD
  4259. 1075.31 s [duoids-hedgehog] include hedgehog-1.5-I61WWSEyWWs9b1Ow8jewYT
  4260. 1075.31 s [duoids-hedgehog] Ready component graph:
  4261. 1075.31 s [duoids-hedgehog] definite duoids-hedgehog-0.0.1.0-DNfhlYCCG6pCyVz8JVxsPH
  4262. 1075.31 s [duoids-hedgehog] depends base-4.19.2.0-a4d2
  4263. 1075.31 s [duoids-hedgehog] depends duoids-0.0.1.0-HGVxlGiTGubJau1PjiOPQY
  4264. 1075.31 s [duoids-hedgehog] depends ghc-compat-plugin-0.1.0.1-7MjAExeaX6DEMyHCY8avBD
  4265. 1075.31 s [duoids-hedgehog] depends hedgehog-1.5-I61WWSEyWWs9b1Ow8jewYT
  4266. 1075.31 s [duoids-hedgehog] definite duoids-hedgehog-0.0.1.0-3i564kN2UkJxjpJZZQvq6-laws
  4267. 1075.31 s [duoids-hedgehog] depends base-4.19.2.0-a4d2
  4268. 1075.31 s [duoids-hedgehog] depends duoids-hedgehog-0.0.1.0-DNfhlYCCG6pCyVz8JVxsPH
  4269. 1075.31 s [duoids-hedgehog] depends ghc-compat-plugin-0.1.0.1-7MjAExeaX6DEMyHCY8avBD
  4270. 1075.31 s [duoids-hedgehog] depends hedgehog-1.5-I61WWSEyWWs9b1Ow8jewYT
  4271. 1075.31 s [duoids-hedgehog] definite duoids-hedgehog-0.0.1.0-2voqHNyLv91JAI4xC6iWB3-doctests
  4272. 1075.31 s [duoids-hedgehog] depends base-4.19.2.0-a4d2
  4273. 1075.31 s [duoids-hedgehog] depends doctest-0.24.2-7CW3VAqweMx6JNSdbfXAyp
  4274. 1075.31 s [duoids-hedgehog] depends duoids-hedgehog-0.0.1.0-DNfhlYCCG6pCyVz8JVxsPH
  4275. 1075.31 s [duoids-hedgehog] depends ghc-compat-plugin-0.1.0.1-7MjAExeaX6DEMyHCY8avBD
  4276. 1075.31 s [duoids-hedgehog] Using Cabal-3.12.1.0 compiled by ghc-9.8
  4277. 1075.31 s [duoids-hedgehog] Using compiler: ghc-9.8.4
  4278. 1075.31 s [duoids-hedgehog] Using install prefix:
  4279. 1075.31 s [duoids-hedgehog] /nix/store/vm5i94j0k512cw26vxh9slszby68s1aw-duoids-hedgehog-0.0.1.0
  4280. 1075.31 s [duoids-hedgehog] Executables installed in:
  4281. 1075.31 s [duoids-hedgehog] /nix/store/vm5i94j0k512cw26vxh9slszby68s1aw-duoids-hedgehog-0.0.1.0/bin
  4282. 1075.31 s [duoids-hedgehog] Libraries installed in:
  4283. 1075.31 s [duoids-hedgehog] /nix/store/vm5i94j0k512cw26vxh9slszby68s1aw-duoids-hedgehog-0.0.1.0/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4-952d/duoids-hedgehog-0.0.1.0-DNfhlYCCG6pCyVz8JVxsPH
  4284. 1075.31 s [duoids-hedgehog] Dynamic Libraries installed in:
  4285. 1075.31 s [duoids-hedgehog] /nix/store/vm5i94j0k512cw26vxh9slszby68s1aw-duoids-hedgehog-0.0.1.0/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4-952d
  4286. 1075.31 s [duoids-hedgehog] Private executables installed in:
  4287. 1075.31 s [duoids-hedgehog] /nix/store/vm5i94j0k512cw26vxh9slszby68s1aw-duoids-hedgehog-0.0.1.0/libexec/x86_64-linux-ghc-9.8.4-952d/duoids-hedgehog-0.0.1.0
  4288. 1075.31 s [duoids-hedgehog] Data files installed in:
  4289. 1075.31 s [duoids-hedgehog] /nix/store/vm5i94j0k512cw26vxh9slszby68s1aw-duoids-hedgehog-0.0.1.0/share/x86_64-linux-ghc-9.8.4-952d/duoids-hedgehog-0.0.1.0
  4290. 1075.31 s [duoids-hedgehog] Documentation installed in:
  4291. 1075.31 s [duoids-hedgehog] /nix/store/b3f82ryc5skmjd5swkrsxn545jg8dah4-duoids-hedgehog-0.0.1.0-doc/share/doc/duoids-hedgehog-0.0.1.0
  4292. 1075.31 s [duoids-hedgehog] Configuration files installed in:
  4293. 1075.31 s [duoids-hedgehog] /nix/store/vm5i94j0k512cw26vxh9slszby68s1aw-duoids-hedgehog-0.0.1.0/etc
  4294. 1075.31 s [duoids-hedgehog] No alex found
  4295. 1075.31 s [duoids-hedgehog] Using ar found on system at:
  4296. 1075.31 s [duoids-hedgehog] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
  4297. 1075.31 s [duoids-hedgehog] No c2hs found
  4298. 1075.31 s [duoids-hedgehog] No cpphs found
  4299. 1075.31 s [duoids-hedgehog] Using doctest version 0.24.2 found on system at:
  4300. 1075.31 s [duoids-hedgehog] /nix/store/njpw8hiwdi4abvh8g8yavys2ykkm6gmp-doctest-0.24.2/bin/doctest
  4301. 1075.31 s [duoids-hedgehog] Using gcc version 14.3.0 given by user at:
  4302. 1075.31 s [duoids-hedgehog] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
  4303. 1075.31 s [duoids-hedgehog] Using ghc version 9.8.4 found on system at:
  4304. 1075.31 s [duoids-hedgehog] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/ghc
  4305. 1075.31 s [duoids-hedgehog] Using ghc-pkg version 9.8.4 found on system at:
  4306. 1075.31 s [duoids-hedgehog] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/ghc-pkg-9.8.4
  4307. 1075.31 s [duoids-hedgehog] No ghcjs found
  4308. 1075.31 s [duoids-hedgehog] No ghcjs-pkg found
  4309. 1075.31 s [duoids-hedgehog] No greencard found
  4310. 1075.31 s [duoids-hedgehog] Using haddock version 2.30.0 found on system at:
  4311. 1075.31 s [duoids-hedgehog] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/haddock-ghc-9.8.4
  4312. 1075.31 s [duoids-hedgehog] No happy found
  4313. 1075.31 s [duoids-hedgehog] Using haskell-suite found on system at: haskell-suite-dummy-location
  4314. 1075.31 s [duoids-hedgehog] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  4315. 1075.31 s [duoids-hedgehog] No hmake found
  4316. 1075.31 s [duoids-hedgehog] Using hpc version 0.69 found on system at:
  4317. 1075.31 s [duoids-hedgehog] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/hpc-ghc-9.8.4
  4318. 1075.31 s [duoids-hedgehog] Using hsc2hs version 0.68.10 found on system at:
  4319. 1075.31 s [duoids-hedgehog] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/hsc2hs-ghc-9.8.4
  4320. 1075.31 s [duoids-hedgehog] Using hscolour version 1.25 found on system at:
  4321. 1075.31 s [duoids-hedgehog] /nix/store/vl14mqkz7z183r6sq9qz932j3pix6v5c-hscolour-1.25/bin/HsColour
  4322. 1075.31 s [duoids-hedgehog] No jhc found
  4323. 1075.31 s [duoids-hedgehog] Using ld found on system at:
  4324. 1075.31 s [duoids-hedgehog] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ld.gold
  4325. 1075.31 s [duoids-hedgehog] No pkg-config found
  4326. 1075.31 s [duoids-hedgehog] Using runghc version 9.8.4 found on system at:
  4327. 1075.31 s [duoids-hedgehog] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/runghc-9.8.4
  4328. 1075.32 s [duoids-hedgehog] Using strip version 2.44 found on system at:
  4329. 1075.32 s [duoids-hedgehog] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
  4330. 1075.32 s [duoids-hedgehog] Using tar found on system at:
  4331. 1075.32 s [duoids-hedgehog] /nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
  4332. 1075.32 s [duoids-hedgehog] No uhc found
  4333. 1075.44 s [duoidal-transformers] Preprocessing library for duoidal-transformers-0.0.1.0...
  4334. 1075.45 s [duoidal-transformers] Building library for duoidal-transformers-0.0.1.0...
  4335. 1075.68 s [duoids-hedgehog] Phase: buildPhase
  4336. 1075.73 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 )
  4337. 1075.86 s [duoids-hedgehog] Preprocessing library for duoids-hedgehog-0.0.1.0...
  4338. 1075.86 s [duoids-hedgehog] Building library for duoids-hedgehog-0.0.1.0...
  4339. 1076.18 s [duoids-hedgehog] [1 of 2] Compiling Test.Duoid ( src/Test/Duoid.hs, dist/build/Test/Duoid.o, dist/build/Test/Duoid.dyn_o )
  4340. 1076.23 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 )
  4341. 1077.40 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 )
  4342. 1077.47 s [duoids-hedgehog] [2 of 2] Compiling Test.Duoidal ( src/Test/Duoidal.hs, dist/build/Test/Duoidal.o, dist/build/Test/Duoidal.dyn_o )
  4343. 1078.06 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 )
  4344. 1078.08 s [duoids-hedgehog] [1 of 2] Compiling Test.Duoid ( src/Test/Duoid.hs, dist/build/Test/Duoid.p_o )
  4345. 1079.35 s [duoids-hedgehog] [2 of 2] Compiling Test.Duoidal ( src/Test/Duoidal.hs, dist/build/Test/Duoidal.p_o )
  4346. 1088.87 s [duoidal-transformers] Preprocessing test suite 'doctests' for duoidal-transformers-0.0.1.0...
  4347. 1088.87 s [duoidal-transformers] Building test suite 'doctests' for duoidal-transformers-0.0.1.0...
  4348. 1089.24 s [duoidal-transformers] [1 of 2] Compiling Build_doctests ( dist/build/doctests/autogen/Build_doctests.hs, dist/build/doctests/doctests-tmp/Build_doctests.o )
  4349. 1090.10 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 )
  4350. 1090.40 s [duoidal-transformers] [2 of 2] Compiling Main ( tests/doctests.hs, dist/build/doctests/doctests-tmp/Main.o )
  4351. 1091.32 s [duoids-hedgehog] Preprocessing test suite 'laws' for duoids-hedgehog-0.0.1.0...
  4352. 1091.32 s [duoids-hedgehog] Building test suite 'laws' for duoids-hedgehog-0.0.1.0...
  4353. 1091.65 s [duoids-hedgehog] [1 of 1] Compiling Main ( tests/laws.hs, dist/build/laws/laws-tmp/Main.o )
  4354. 1091.92 s [duoidal-transformers] [3 of 3] Linking dist/build/doctests/doctests
  4355. 1093.90 s [duoids-hedgehog] [2 of 2] Linking dist/build/laws/laws
  4356. 1096.02 s [duoids-hedgehog] Preprocessing test suite 'doctests' for duoids-hedgehog-0.0.1.0...
  4357. 1096.06 s [duoids-hedgehog] Building test suite 'doctests' for duoids-hedgehog-0.0.1.0...
  4358. 1096.32 s [duoids-hedgehog] [1 of 2] Compiling Build_doctests ( dist/build/doctests/autogen/Build_doctests.hs, dist/build/doctests/doctests-tmp/Build_doctests.o )
  4359. 1097.17 s [duoids-hedgehog] [2 of 2] Compiling Main ( tests/doctests.hs, dist/build/doctests/doctests-tmp/Main.o )
  4360. 1098.64 s [duoids-hedgehog] [3 of 3] Linking dist/build/doctests/doctests
  4361. 1101.19 s [duoidal-transformers] Phase: checkPhase
  4362. 1102.07 s [duoidal-transformers] Running 1 test suites...
  4363. 1102.07 s [duoidal-transformers] Test suite doctests: RUNNING...
  4364. 1102.87 s [duoidal-transformers]
  4365. 1102.88 s [duoidal-transformers] on the commandline: warning: [GHC-98887]
  4366. 1102.88 s [duoidal-transformers] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  4367. 1102.88 s [duoidal-transformers]
  4368. 1102.88 s [duoidal-transformers] on the commandline: warning: [GHC-98887]
  4369. 1102.88 s [duoidal-transformers] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  4370. 1102.88 s [duoidal-transformers]
  4371. 1102.88 s [duoidal-transformers] on the commandline: warning: [GHC-98887]
  4372. 1102.88 s [duoidal-transformers] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  4373. 1103.58 s [duoidal-transformers] Examples: 0 Tried: 0 Errors: 0 Failures: 0
  4374. 1103.69 s [duoidal-transformers] NameLib Nothing
  4375. 1103.69 s [duoidal-transformers] ----------------------------------------
  4376. 1103.71 s [duoidal-transformers] Test suite doctests: PASS
  4377. 1103.71 s [duoidal-transformers] Test suite logged to: dist/test/duoidal-transformers-0.0.1.0-doctests.log
  4378. 1103.71 s [duoidal-transformers] 1 of 1 test suites (1 of 1 test cases) passed.
  4379. 1103.73 s [duoidal-transformers] Phase: haddockPhase
  4380. 1104.23 s [duoidal-transformers] Preprocessing library for duoidal-transformers-0.0.1.0...
  4381. 1104.23 s [duoidal-transformers] Running Haddock on library for duoidal-transformers-0.0.1.0...
  4382. 1105.48 s [duoidal-transformers] [1 of 2] Compiling Control.Duoidal.Trans.Class ( src/Control/Duoidal/Trans/Class.hs, nothing )
  4383. 1105.95 s [duoidal-transformers] [2 of 2] Compiling Control.Duoidal.Trans.Orphans ( src/Control/Duoidal/Trans/Orphans.hs, nothing )
  4384. 1106.59 s [duoidal-transformers] Haddock coverage:
  4385. 1106.59 s [duoidal-transformers] Warning: 'MonadTrans' is out of scope.
  4386. 1106.59 s [duoidal-transformers] If you qualify the identifier, haddock can try to link it anyway.
  4387. 1106.61 s [duoidal-transformers] 100% ( 3 / 3) in 'Control.Duoidal.Trans.Class'
  4388. 1106.61 s [duoidal-transformers] 100% ( 1 / 1) in 'Control.Duoidal.Trans.Orphans'
  4389. 1108.71 s [duoids-hedgehog] buildPhase completed in 33 seconds
  4390. 1108.71 s [duoids-hedgehog] Phase: checkPhase
  4391. 1108.82 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 )
  4392. 1109.75 s [duoids-hedgehog] Running 2 test suites...
  4393. 1109.75 s [duoids-hedgehog] Test suite laws: RUNNING...
  4394. 1109.77 s [duoids-hedgehog] ━━━ Duoid Int ━━━
  4395. 1109.78 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  4396. 1109.78 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  4397. 1109.78 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  4398. 1109.78 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  4399. 1109.78 s [duoids-hedgehog] ✓ 4 succeeded.
  4400. 1109.78 s [duoids-hedgehog] ━━━ Duoid Int16 ━━━
  4401. 1109.79 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  4402. 1109.79 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  4403. 1109.79 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  4404. 1109.79 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  4405. 1109.79 s [duoids-hedgehog] ✓ 4 succeeded.
  4406. 1109.79 s [duoids-hedgehog] ━━━ Duoid Int32 ━━━
  4407. 1109.80 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  4408. 1109.80 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  4409. 1109.80 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  4410. 1109.80 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  4411. 1109.80 s [duoids-hedgehog] ✓ 4 succeeded.
  4412. 1109.80 s [duoids-hedgehog] ━━━ Duoid Int64 ━━━
  4413. 1109.81 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  4414. 1109.81 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  4415. 1109.81 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  4416. 1109.81 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  4417. 1109.81 s [duoids-hedgehog] ✓ 4 succeeded.
  4418. 1109.81 s [duoids-hedgehog] ━━━ Duoid Int8 ━━━
  4419. 1109.81 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  4420. 1109.81 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  4421. 1109.81 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  4422. 1109.81 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  4423. 1109.81 s [duoids-hedgehog] ✓ 4 succeeded.
  4424. 1109.81 s [duoids-hedgehog] ━━━ Duoid.Normal Natural ━━━
  4425. 1109.82 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  4426. 1109.82 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  4427. 1109.82 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  4428. 1109.82 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  4429. 1109.82 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  4430. 1109.82 s [duoids-hedgehog] ✓ 5 succeeded.
  4431. 1109.82 s [duoids-hedgehog] ━━━ Duoid.Normal (Ratio Natural) ━━━
  4432. 1109.82 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  4433. 1109.82 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  4434. 1109.82 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  4435. 1109.82 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  4436. 1109.82 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  4437. 1109.82 s [duoids-hedgehog] ✓ 5 succeeded.
  4438. 1109.82 s [duoids-hedgehog] ━━━ Duoid (Ratio Integer) ━━━
  4439. 1109.83 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  4440. 1109.83 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  4441. 1109.83 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  4442. 1109.83 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  4443. 1109.83 s [duoids-hedgehog] ✓ 4 succeeded.
  4444. 1109.83 s [duoids-hedgehog] ━━━ Duoid.Normal Word ━━━
  4445. 1109.84 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  4446. 1109.84 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  4447. 1109.84 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  4448. 1109.84 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  4449. 1109.84 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  4450. 1109.84 s [duoids-hedgehog] ✓ 5 succeeded.
  4451. 1109.84 s [duoids-hedgehog] ━━━ Duoid.Normal Word16 ━━━
  4452. 1109.84 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  4453. 1109.84 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  4454. 1109.84 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  4455. 1109.84 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  4456. 1109.84 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  4457. 1109.84 s [duoids-hedgehog] ✓ 5 succeeded.
  4458. 1109.84 s [duoids-hedgehog] ━━━ Duoid.Normal Word32 ━━━
  4459. 1109.85 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  4460. 1109.85 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  4461. 1109.85 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  4462. 1109.85 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  4463. 1109.85 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  4464. 1109.85 s [duoids-hedgehog] ✓ 5 succeeded.
  4465. 1109.85 s [duoids-hedgehog] ━━━ Duoid.Normal Word64 ━━━
  4466. 1109.85 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  4467. 1109.85 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  4468. 1109.85 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  4469. 1109.85 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  4470. 1109.85 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  4471. 1109.85 s [duoids-hedgehog] ✓ 5 succeeded.
  4472. 1109.85 s [duoids-hedgehog] ━━━ Duoid.Normal Word8 ━━━
  4473. 1109.86 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  4474. 1109.86 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  4475. 1109.86 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  4476. 1109.86 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  4477. 1109.86 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  4478. 1109.86 s [duoids-hedgehog] ✓ 5 succeeded.
  4479. 1109.86 s [duoids-hedgehog] Test suite laws: PASS
  4480. 1109.86 s [duoids-hedgehog] Test suite logged to: dist/test/duoids-hedgehog-0.0.1.0-laws.log
  4481. 1109.86 s [duoids-hedgehog] Test suite doctests: RUNNING...
  4482. 1110.97 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 )
  4483. 1111.85 s [vector] [ 2 of 23] Compiling Data.Vector.Fusion.Util ( src/Data/Vector/Fusion/Util.hs, dist/build/Data/Vector/Fusion/Util.p_o )
  4484. 1112.04 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 )
  4485. 1112.07 s [duoids-hedgehog] Examples: 0 Tried: 0 Errors: 0 Failures: 0
  4486. 1112.24 s [duoids-hedgehog] NameLib Nothing
  4487. 1112.24 s [duoids-hedgehog] ----------------------------------------
  4488. 1112.26 s [duoids-hedgehog] Test suite doctests: PASS
  4489. 1112.26 s [duoids-hedgehog] Test suite logged to: dist/test/duoids-hedgehog-0.0.1.0-doctests.log
  4490. 1112.26 s [duoids-hedgehog] 2 of 2 test suites (2 of 2 test cases) passed.
  4491. 1112.28 s [duoids-hedgehog] Phase: haddockPhase
  4492. 1112.80 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 )
  4493. 1112.80 s [vector] [ 5 of 23] Compiling Data.Vector.Generic.Base ( src/Data/Vector/Generic/Base.hs, dist/build/Data/Vector/Generic/Base.p_o )
  4494. 1112.80 s [vector] [ 6 of 23] Compiling Data.Vector.Internal.Check ( src/Data/Vector/Internal/Check.hs, dist/build/Data/Vector/Internal/Check.p_o )
  4495. 1112.80 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 )
  4496. 1112.81 s [duoids-hedgehog] Preprocessing library for duoids-hedgehog-0.0.1.0...
  4497. 1112.81 s [duoids-hedgehog] Running Haddock on library for duoids-hedgehog-0.0.1.0...
  4498. 1114.34 s [duoids-hedgehog] [1 of 2] Compiling Test.Duoid ( src/Test/Duoid.hs, nothing )
  4499. 1116.27 s [duoids-hedgehog] [2 of 2] Compiling Test.Duoidal ( src/Test/Duoidal.hs, nothing )
  4500. 1116.44 s [duoids-hedgehog] Haddock coverage:
  4501. 1116.45 s [duoids-hedgehog] 100% ( 3 / 3) in 'Test.Duoid'
  4502. 1116.45 s [duoids-hedgehog] 100% ( 2 / 2) in 'Test.Duoidal'
  4503. 1127.11 s [vector] [ 8 of 23] Compiling Data.Vector.Fusion.Bundle ( src/Data/Vector/Fusion/Bundle.hs, dist/build/Data/Vector/Fusion/Bundle.p_o )
  4504. 1131.89 s [duoidal-transformers] Documentation created: dist/doc/html/duoidal-transformers/,
  4505. 1131.92 s [duoidal-transformers] dist/doc/html/duoidal-transformers/duoidal-transformers.txt
  4506. 1132.04 s [duoidal-transformers] Preprocessing test suite 'doctests' for duoidal-transformers-0.0.1.0...
  4507. 1132.06 s [duoidal-transformers] Phase: installPhase
  4508. 1132.23 s [duoidal-transformers] Installing library in /nix/store/aj1wphvkxd5d6385fmiixhm34np0amm5-duoidal-transformers-0.0.1.0/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4-952d/duoidal-transformers-0.0.1.0-AFNUfQjqJGy5PBgQtMcdM9
  4509. 1132.80 s [duoidal-transformers] Phase: fixupPhase
  4510. 1132.85 s [duoidal-transformers] shrinking RPATHs of ELF executables and libraries in /nix/store/aj1wphvkxd5d6385fmiixhm34np0amm5-duoidal-transformers-0.0.1.0
  4511. 1132.85 s [duoidal-transformers] shrinking /nix/store/aj1wphvkxd5d6385fmiixhm34np0amm5-duoidal-transformers-0.0.1.0/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4-952d/libHSduoidal-transformers-0.0.1.0-AFNUfQjqJGy5PBgQtMcdM9-ghc9.8.4.so
  4512. 1132.86 s [duoidal-transformers] checking for references to /build/ in /nix/store/aj1wphvkxd5d6385fmiixhm34np0amm5-duoidal-transformers-0.0.1.0...
  4513. 1132.90 s [duoidal-transformers] patching script interpreter paths in /nix/store/aj1wphvkxd5d6385fmiixhm34np0amm5-duoidal-transformers-0.0.1.0
  4514. 1132.91 s [duoidal-transformers] stripping (with command strip and flags -S -p) in /nix/store/aj1wphvkxd5d6385fmiixhm34np0amm5-duoidal-transformers-0.0.1.0/lib
  4515. 1133.01 s [duoidal-transformers] shrinking RPATHs of ELF executables and libraries in /nix/store/xvvxl5m8a7i5myavhdm3blpazf4ajnf3-duoidal-transformers-0.0.1.0-doc
  4516. 1133.02 s [duoidal-transformers] checking for references to /build/ in /nix/store/xvvxl5m8a7i5myavhdm3blpazf4ajnf3-duoidal-transformers-0.0.1.0-doc...
  4517. 1133.06 s [duoidal-transformers] patching script interpreter paths in /nix/store/xvvxl5m8a7i5myavhdm3blpazf4ajnf3-duoidal-transformers-0.0.1.0-doc
  4518. 1133.48 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/aj1wphvkxd5d6385fmiixhm34np0amm5-duoidal-transformers-0.0.1.0 /nix/store/xvvxl5m8a7i5myavhdm3blpazf4ajnf3-duoidal-transformers-0.0.1.0-doc
  4519. 1134.76 s [post-build-hook] Pushing 2 paths (74 are already present) using zstd to cache sellout ⏳
  4520. 1134.76 s [post-build-hook]
  4521. 1135.17 s [post-build-hook] Pushing /nix/store/xvvxl5m8a7i5myavhdm3blpazf4ajnf3-duoidal-transformers-0.0.1.0-doc (348.23 KiB)
  4522. 1135.31 s [post-build-hook] Pushing /nix/store/aj1wphvkxd5d6385fmiixhm34np0amm5-duoidal-transformers-0.0.1.0 (664.32 KiB)
  4523. 1136.34 s [post-build-hook]
  4524. 1136.34 s [post-build-hook] All done.
  4525. 1136.45 s [post-build-hook] Uploading to the NixCI cache: /nix/store/aj1wphvkxd5d6385fmiixhm34np0amm5-duoidal-transformers-0.0.1.0 /nix/store/xvvxl5m8a7i5myavhdm3blpazf4ajnf3-duoidal-transformers-0.0.1.0-doc
  4526. 1137.02 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  4527. 1137.07 s [post-build-hook] copying 2 paths...
  4528. 1137.11 s [post-build-hook] copying path '/nix/store/xvvxl5m8a7i5myavhdm3blpazf4ajnf3-duoidal-transformers-0.0.1.0-doc' to 'https://cache.nix-ci.com'...
  4529. 1137.58 s [post-build-hook] copying path '/nix/store/aj1wphvkxd5d6385fmiixhm34np0amm5-duoidal-transformers-0.0.1.0' to 'https://cache.nix-ci.com'...
  4530. 1138.20 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  4531. 1138.54 s [post-build-hook] copying 1 paths...
  4532. 1138.55 s [post-build-hook] copying path '/nix/store/82y45j0va54ak9cyl7z2l7d0nwl6cxbd-duoidal-transformers-0.0.1.0.drv' to 'https://cache.nix-ci.com'...
  4533. 1139.00 s Progress: 7 of 21 built (2 building), 160 of 160 downloaded from cache
  4534. 1139.01 s [vector] [ 9 of 23] Compiling Data.Vector.Generic.Mutable ( src/Data/Vector/Generic/Mutable.hs, dist/build/Data/Vector/Generic/Mutable.p_o )
  4535. 1142.00 s [vector] [10 of 23] Compiling Data.Vector.Generic.New ( src/Data/Vector/Generic/New.hs, dist/build/Data/Vector/Generic/New.p_o )
  4536. 1142.91 s [duoids-hedgehog] Documentation created: dist/doc/html/duoids-hedgehog/,
  4537. 1142.95 s [duoids-hedgehog] dist/doc/html/duoids-hedgehog/duoids-hedgehog.txt
  4538. 1143.03 s [duoids-hedgehog] Preprocessing test suite 'laws' for duoids-hedgehog-0.0.1.0...
  4539. 1143.04 s [duoids-hedgehog] Preprocessing test suite 'doctests' for duoids-hedgehog-0.0.1.0...
  4540. 1143.05 s [duoids-hedgehog] haddockPhase completed in 31 seconds
  4541. 1143.05 s [duoids-hedgehog] Phase: installPhase
  4542. 1143.32 s [duoids-hedgehog] Installing library in /nix/store/vm5i94j0k512cw26vxh9slszby68s1aw-duoids-hedgehog-0.0.1.0/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4-952d/duoids-hedgehog-0.0.1.0-DNfhlYCCG6pCyVz8JVxsPH
  4543. 1143.54 s [vector] [11 of 23] Compiling Data.Vector.Generic ( src/Data/Vector/Generic.hs, dist/build/Data/Vector/Generic.p_o )
  4544. 1143.96 s [duoids-hedgehog] Phase: fixupPhase
  4545. 1144.02 s [duoids-hedgehog] shrinking RPATHs of ELF executables and libraries in /nix/store/vm5i94j0k512cw26vxh9slszby68s1aw-duoids-hedgehog-0.0.1.0
  4546. 1144.02 s [duoids-hedgehog] shrinking /nix/store/vm5i94j0k512cw26vxh9slszby68s1aw-duoids-hedgehog-0.0.1.0/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4-952d/libHSduoids-hedgehog-0.0.1.0-DNfhlYCCG6pCyVz8JVxsPH-ghc9.8.4.so
  4547. 1144.03 s [duoids-hedgehog] checking for references to /build/ in /nix/store/vm5i94j0k512cw26vxh9slszby68s1aw-duoids-hedgehog-0.0.1.0...
  4548. 1144.07 s [duoids-hedgehog] patching script interpreter paths in /nix/store/vm5i94j0k512cw26vxh9slszby68s1aw-duoids-hedgehog-0.0.1.0
  4549. 1144.08 s [duoids-hedgehog] stripping (with command strip and flags -S -p) in /nix/store/vm5i94j0k512cw26vxh9slszby68s1aw-duoids-hedgehog-0.0.1.0/lib
  4550. 1144.16 s [duoids-hedgehog] shrinking RPATHs of ELF executables and libraries in /nix/store/b3f82ryc5skmjd5swkrsxn545jg8dah4-duoids-hedgehog-0.0.1.0-doc
  4551. 1144.17 s [duoids-hedgehog] checking for references to /build/ in /nix/store/b3f82ryc5skmjd5swkrsxn545jg8dah4-duoids-hedgehog-0.0.1.0-doc...
  4552. 1144.20 s [duoids-hedgehog] patching script interpreter paths in /nix/store/b3f82ryc5skmjd5swkrsxn545jg8dah4-duoids-hedgehog-0.0.1.0-doc
  4553. 1144.55 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/b3f82ryc5skmjd5swkrsxn545jg8dah4-duoids-hedgehog-0.0.1.0-doc /nix/store/vm5i94j0k512cw26vxh9slszby68s1aw-duoids-hedgehog-0.0.1.0
  4554. 1145.88 s [post-build-hook] Pushing 2 paths (138 are already present) using zstd to cache sellout ⏳
  4555. 1145.88 s [post-build-hook]
  4556. 1146.34 s [post-build-hook] Pushing /nix/store/vm5i94j0k512cw26vxh9slszby68s1aw-duoids-hedgehog-0.0.1.0 (525.30 KiB)
  4557. 1146.46 s [post-build-hook] Pushing /nix/store/b3f82ryc5skmjd5swkrsxn545jg8dah4-duoids-hedgehog-0.0.1.0-doc (301.70 KiB)
  4558. 1147.62 s [post-build-hook]
  4559. 1147.62 s [post-build-hook] All done.
  4560. 1147.73 s [post-build-hook] Uploading to the NixCI cache: /nix/store/b3f82ryc5skmjd5swkrsxn545jg8dah4-duoids-hedgehog-0.0.1.0-doc /nix/store/vm5i94j0k512cw26vxh9slszby68s1aw-duoids-hedgehog-0.0.1.0
  4561. 1148.09 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  4562. 1148.15 s [post-build-hook] copying 2 paths...
  4563. 1148.20 s [post-build-hook] copying path '/nix/store/b3f82ryc5skmjd5swkrsxn545jg8dah4-duoids-hedgehog-0.0.1.0-doc' to 'https://cache.nix-ci.com'...
  4564. 1148.63 s [post-build-hook] copying path '/nix/store/vm5i94j0k512cw26vxh9slszby68s1aw-duoids-hedgehog-0.0.1.0' to 'https://cache.nix-ci.com'...
  4565. 1149.60 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  4566. 1150.11 s [post-build-hook] copying 39 paths...
  4567. 1150.12 s [post-build-hook] copying path '/nix/store/5zrapaidy8rm3hhv9cznwgg1dl3drak2-wl-pprint-annotated-0.1.0.1.drv' to 'https://cache.nix-ci.com'...
  4568. 1150.12 s [post-build-hook] copying path '/nix/store/35jh7885f7x9qf2vmgl7h17rg6lzkh1y-hostname-1.0.drv' to 'https://cache.nix-ci.com'...
  4569. 1150.12 s [post-build-hook] copying path '/nix/store/abg89lxd150qrs7v7pc21vvry59hw74y-unliftio-core-0.2.1.0.drv' to 'https://cache.nix-ci.com'...
  4570. 1150.12 s [post-build-hook] copying path '/nix/store/5pllc362hvhvnih2y88sl88mvzapsm7a-terminal-size-0.3.4.drv' to 'https://cache.nix-ci.com'...
  4571. 1150.12 s [post-build-hook] copying path '/nix/store/6fhjx28fd66wazffslha08ryq5y3ayiv-tasty-quickcheck-0.11.1.drv' to 'https://cache.nix-ci.com'...
  4572. 1150.12 s [post-build-hook] copying path '/nix/store/fh4lgchwah59r27kzx6gj1v7s4rhbi2n-regex-base-0.94.0.3.drv' to 'https://cache.nix-ci.com'...
  4573. 1150.13 s [post-build-hook] copying path '/nix/store/j5wpd46w8h07jnwp8s7wf3bwp3rr3rcz-pretty-show-1.10.drv' to 'https://cache.nix-ci.com'...
  4574. 1150.13 s [post-build-hook] copying path '/nix/store/bygzwc5hwbaaqmpc7jan3zr7kmdvm5x2-mmorph-1.2.1.drv' to 'https://cache.nix-ci.com'...
  4575. 1150.13 s [post-build-hook] copying path '/nix/store/8x63ddhjgr9hmn5m673qs5rhyi2xwqjk-old-locale-1.0.0.7.drv' to 'https://cache.nix-ci.com'...
  4576. 1150.14 s [post-build-hook] copying path '/nix/store/0wgwgg67iw7hxnkj3zqk02kmi3k0fcjs-erf-2.0.0.0.drv' to 'https://cache.nix-ci.com'...
  4577. 1150.14 s [post-build-hook] copying path '/nix/store/880firy801aaazsjw699y9hj0ggj8hvy-th-abstraction-0.7.1.0.drv' to 'https://cache.nix-ci.com'...
  4578. 1150.14 s [post-build-hook] copying path '/nix/store/6ig21znwwdqssr6gal1938m7msp3glpy-quickcheck-classes-base-0.6.2.0.drv' to 'https://cache.nix-ci.com'...
  4579. 1150.16 s [post-build-hook] copying path '/nix/store/116fgy7lmwvhg7w2hpqhxsmiapyfcpnx-base-orphans-0.9.3.drv' to 'https://cache.nix-ci.com'...
  4580. 1150.16 s [post-build-hook] copying path '/nix/store/dwmdi8170bryf0f21mxlm5drssc87776-prettyprinter-compat-ansi-wl-pprint-1.0.2.drv' to 'https://cache.nix-ci.com'...
  4581. 1150.18 s [post-build-hook] copying path '/nix/store/ccrck78bjsphnwvvhfs2rmdvkhvkkdyx-boring-0.2.2.drv' to 'https://cache.nix-ci.com'...
  4582. 1150.22 s [post-build-hook] copying path '/nix/store/fdmjgbwzdrjw274ps90j5993rgjcz3rq-xml-1.3.14.drv' to 'https://cache.nix-ci.com'...
  4583. 1150.50 s [post-build-hook] copying path '/nix/store/n5f36rci6xypw3ac8ryyww5ggz0apcqx-jailbreak-cabal-1.4.1.drv' to 'https://cache.nix-ci.com'...
  4584. 1150.50 s [post-build-hook] copying path '/nix/store/ps9ncgygjx3ny4ssc394kidjf2dmf6wh-extensible-exceptions-0.1.1.4.drv' to 'https://cache.nix-ci.com'...
  4585. 1150.51 s [post-build-hook] copying path '/nix/store/y6cxr1w4yc5hi9pvj0qh1v7x51fib79i-void-0.7.3.drv' to 'https://cache.nix-ci.com'...
  4586. 1150.54 s [post-build-hook] copying path '/nix/store/iwr8px6p6gvaf64agcmnvxjhgv94afsb-resourcet-1.3.0.drv' to 'https://cache.nix-ci.com'...
  4587. 1150.54 s [post-build-hook] copying path '/nix/store/7xinhhqc5sjd6z0hj5mzfmdqpch93crs-generic-deriving-1.14.6.drv' to 'https://cache.nix-ci.com'...
  4588. 1150.55 s [post-build-hook] copying path '/nix/store/qglxpzaj4n62as1rcrfx5qiwq28js9l9-regex-posix-0.96.0.2.drv' to 'https://cache.nix-ci.com'...
  4589. 1150.56 s [post-build-hook] copying path '/nix/store/b44r0qgim0j9vfqzyzcx5nhgch0g0jzy-os-string-2.0.8.drv' to 'https://cache.nix-ci.com'...
  4590. 1150.57 s [post-build-hook] copying path '/nix/store/wwxnfzw0dl3326xwdj21274maj6hr517-ansi-wl-pprint-1.0.2.drv' to 'https://cache.nix-ci.com'...
  4591. 1150.61 s [post-build-hook] copying path '/nix/store/d0kfsamd2imzgsm965p4sv5ckxy6hw9p-transformers-base-0.4.6.drv' to 'https://cache.nix-ci.com'...
  4592. 1150.77 s [post-build-hook] copying path '/nix/store/h154nilrkpzf98ip6blhlim35c22hdyl-safe-exceptions-0.1.7.4.drv' to 'https://cache.nix-ci.com'...
  4593. 1150.81 s [post-build-hook] copying path '/nix/store/9sd5sf2ca0qb1yv3zjdybinyg18lrkcm-distributive-0.6.2.1.drv' to 'https://cache.nix-ci.com'...
  4594. 1150.83 s [post-build-hook] copying path '/nix/store/di3wwfnzh8mfpsm47bf29whym41rnjxa-test-framework-0.8.2.2.drv' to 'https://cache.nix-ci.com'...
  4595. 1150.85 s [post-build-hook] copying path '/nix/store/pix78nynwh4zvdbjbiqa0pmny6a4j0sv-hashable-1.5.0.0.drv' to 'https://cache.nix-ci.com'...
  4596. 1150.85 s [post-build-hook] copying path '/nix/store/3dh2s3k1f3zwkpfi5spzv1m7dwn3bmaj-monad-control-1.0.3.1.drv' to 'https://cache.nix-ci.com'...
  4597. 1151.03 s [post-build-hook] copying path '/nix/store/91q6wqcr81b850c0camiwcyhwz3fq3l7-barbies-2.1.1.0.drv' to 'https://cache.nix-ci.com'...
  4598. 1151.06 s [post-build-hook] copying path '/nix/store/97nl6h2hcgb4j4rkch42f3wxxz1kvg3a-test-framework-hunit-0.3.0.2.drv' to 'https://cache.nix-ci.com'...
  4599. 1151.09 s [post-build-hook] copying path '/nix/store/fwypj5dv49zzrxjn8kndq2xkyjhx3wxg-constraints-0.14.2.drv' to 'https://cache.nix-ci.com'...
  4600. 1151.31 s [post-build-hook] copying path '/nix/store/pwcbj611ngzsddacm2rv7j7ian4gxqw0-async-2.2.5.drv' to 'https://cache.nix-ci.com'...
  4601. 1151.32 s [post-build-hook] copying path '/nix/store/qlkaygzvdsxbb59vvnyf8j7azp5wr1w2-lifted-base-0.2.3.12.drv' to 'https://cache.nix-ci.com'...
  4602. 1151.56 s [post-build-hook] copying path '/nix/store/2bcmibbz51pri3cjp3g6iprkqaa5y0ns-concurrent-output-1.10.21.drv' to 'https://cache.nix-ci.com'...
  4603. 1151.57 s [post-build-hook] copying path '/nix/store/aijpsi0mp48gapvk92q5d6v7fsk21lj9-lifted-async-0.10.2.7.drv' to 'https://cache.nix-ci.com'...
  4604. 1151.80 s [post-build-hook] copying path '/nix/store/n270r4bi977j9y4xvbh149846b57pcs5-hedgehog-1.5.drv' to 'https://cache.nix-ci.com'...
  4605. 1152.32 s [post-build-hook] copying path '/nix/store/bv9mzl1ja9xyyq9d2020nh334cby1r06-duoids-hedgehog-0.0.1.0.drv' to 'https://cache.nix-ci.com'...
  4606. 1152.75 s Progress: 8 of 20 built (1 building), 160 of 160 downloaded from cache
  4607. 1161.26 s [vector] [12 of 23] Compiling Data.Vector.Mutable ( src/Data/Vector/Mutable.hs, dist/build/Data/Vector/Mutable.p_o )
  4608. 1161.30 s [vector] [13 of 23] Compiling Data.Vector ( src/Data/Vector.hs, dist/build/Data/Vector.p_o )
  4609. 1179.00 s [vector] [14 of 23] Compiling Data.Vector.Primitive.Mutable ( src/Data/Vector/Primitive/Mutable.hs, dist/build/Data/Vector/Primitive/Mutable.p_o )
  4610. 1179.04 s [vector] [15 of 23] Compiling Data.Vector.Primitive ( src/Data/Vector/Primitive.hs, dist/build/Data/Vector/Primitive.p_o )
  4611. 1179.04 s [vector] [16 of 23] Compiling Data.Vector.Storable.Internal ( src/Data/Vector/Storable/Internal.hs, dist/build/Data/Vector/Storable/Internal.p_o )
  4612. 1179.04 s [vector] [17 of 23] Compiling Data.Vector.Storable.Mutable ( src/Data/Vector/Storable/Mutable.hs, dist/build/Data/Vector/Storable/Mutable.p_o )
  4613. 1179.04 s [vector] [18 of 23] Compiling Data.Vector.Storable ( src/Data/Vector/Storable.hs, dist/build/Data/Vector/Storable.p_o )
  4614. 1181.52 s [vector] [19 of 23] Compiling Data.Vector.Strict.Mutable ( src/Data/Vector/Strict/Mutable.hs, dist/build/Data/Vector/Strict/Mutable.p_o )
  4615. 1181.52 s [vector] [20 of 23] Compiling Data.Vector.Strict ( src/Data/Vector/Strict.hs, dist/build/Data/Vector/Strict.p_o )
  4616. 1193.50 s [vector] [21 of 23] Compiling Data.Vector.Unboxed.Base ( src/Data/Vector/Unboxed/Base.hs, dist/build/Data/Vector/Unboxed/Base.p_o )
  4617. 1202.85 s [vector] [22 of 23] Compiling Data.Vector.Unboxed ( src/Data/Vector/Unboxed.hs, dist/build/Data/Vector/Unboxed.p_o )
  4618. 1211.21 s [vector] [23 of 23] Compiling Data.Vector.Unboxed.Mutable ( src/Data/Vector/Unboxed/Mutable.hs, dist/build/Data/Vector/Unboxed/Mutable.p_o )
  4619. 1213.98 s [vector] Preprocessing test suite 'vector-tests-O0' for vector-0.13.2.0..
  4620. 1213.99 s [vector] Building test suite 'vector-tests-O0' for vector-0.13.2.0..
  4621. 1214.15 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 )
  4622. 1214.33 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 )
  4623. 1216.91 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 )
  4624. 1216.95 s [vector]
  4625. 1216.95 s [vector] tests/Utilities.hs:244:17: warning: [GHC-63394] [-Wx-partial]
  4626. 1216.95 s [vector] In the use of ‘tail’
  4627. 1216.95 s [vector] (imported from Prelude, but defined in GHC.List):
  4628. 1216.95 s [vector] "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
  4629. 1216.95 s [vector] |
  4630. 1216.95 s [vector] 244 | postscanl f z = tail . scanl f z
  4631. 1216.95 s [vector] | ^^^^
  4632. 1216.95 s [vector]
  4633. 1216.95 s [vector] tests/Utilities.hs:245:16: warning: [GHC-63394] [-Wx-partial]
  4634. 1216.95 s [vector] In the use of ‘tail’
  4635. 1216.95 s [vector] (imported from Prelude, but defined in GHC.List):
  4636. 1216.95 s [vector] "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
  4637. 1216.95 s [vector] |
  4638. 1216.95 s [vector] 245 | prescanr f z = tail . scanr f z
  4639. 1216.95 s [vector] | ^^^^
  4640. 1216.95 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 )
  4641. 1216.95 s [vector]
  4642. 1216.95 s [vector] tests/Tests/Vector/Property.hs:243:68: warning: [GHC-63394] [-Wx-partial]
  4643. 1216.95 s [vector] In the use of ‘head’
  4644. 1216.95 s [vector] (imported from Data.List, but defined in GHC.List):
  4645. 1216.95 s [vector] "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
  4646. 1216.95 s [vector] |
  4647. 1216.95 s [vector] 243 | prop_head :: P (v a -> a) = not . V.null ===> V.head `eq` head
  4648. 1216.95 s [vector] | ^^^^
  4649. 1216.95 s [vector]
  4650. 1216.95 s [vector] tests/Tests/Vector/Property.hs:256:76: warning: [GHC-63394] [-Wx-partial]
  4651. 1216.95 s [vector] In the use of ‘head’
  4652. 1216.95 s [vector] (imported from Data.List, but defined in GHC.List):
  4653. 1216.95 s [vector] "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
  4654. 1216.95 s [vector] |
  4655. 1216.95 s [vector] 256 | prop_unsafeHead :: P (v a -> a) = not . V.null ===> V.unsafeHead `eq` head
  4656. 1216.95 s [vector] | ^^^^
  4657. 1216.95 s [vector]
  4658. 1216.95 s [vector] tests/Tests/Vector/Property.hs:272:65: warning: [GHC-63394] [-Wx-partial]
  4659. 1216.95 s [vector] In the use of ‘tail’
  4660. 1216.95 s [vector] (imported from Data.List, but defined in GHC.List):
  4661. 1216.95 s [vector] "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
  4662. 1216.95 s [vector] |
  4663. 1216.95 s [vector] 272 | prop_tail :: P (v a -> v a) = not . V.null ===> V.tail `eq` tail
  4664. 1216.95 s [vector] | ^^^^
  4665. 1216.95 s [vector]
  4666. 1216.95 s [vector] tests/Tests/Vector/Property.hs:439:26: warning: [GHC-63394] [-Wx-partial]
  4667. 1216.95 s [vector] In the use of ‘head’
  4668. 1216.95 s [vector] (imported from Data.List, but defined in GHC.List):
  4669. 1216.95 s [vector] "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
  4670. 1216.95 s [vector] |
  4671. 1216.95 s [vector] 439 | = V.uniq `eq` (map head . group)
  4672. 1216.95 s [vector] | ^^^^
  4673. 1218.37 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 )
  4674. 1218.54 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 )
  4675. 1218.54 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 )
  4676. 1218.54 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 )
  4677. 1218.54 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 )
  4678. 1218.54 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 )
  4679. 1218.54 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 )
  4680. 1218.54 s [vector]
  4681. 1218.54 s [vector] tests/Tests/Bundle.hs:76:77: warning: [GHC-63394] [-Wx-partial]
  4682. 1218.54 s [vector] In the use of ‘head’
  4683. 1218.54 s [vector] (imported from Prelude, but defined in GHC.List):
  4684. 1218.54 s [vector] "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
  4685. 1218.54 s [vector] |
  4686. 1218.54 s [vector] 76 | prop_head :: P (S.Bundle v a -> a) = not . S.null ===> S.head `eq` head
  4687. 1218.54 s [vector] | ^^^^
  4688. 1218.54 s [vector]
  4689. 1218.54 s [vector] tests/Tests/Bundle.hs:92:83: warning: [GHC-63394] [-Wx-partial]
  4690. 1218.54 s [vector] In the use of ‘tail’
  4691. 1218.54 s [vector] (imported from Prelude, but defined in GHC.List):
  4692. 1218.54 s [vector] "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
  4693. 1218.54 s [vector] |
  4694. 1218.54 s [vector] 92 | prop_tail :: P (S.Bundle v a -> S.Bundle v a) = not . S.null ===> S.tail `eq` tail
  4695. 1218.54 s [vector] | ^^^^
  4696. 1218.54 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 )
  4697. 1219.24 s [vector] [13 of 13] Linking dist/build/vector-tests-O0/vector-tests-O0
  4698. 1220.60 s [vector] Preprocessing test suite 'vector-doctest' for vector-0.13.2.0..
  4699. 1220.60 s [vector] Building test suite 'vector-doctest' for vector-0.13.2.0..
  4700. 1220.72 s [vector] [1 of 1] Compiling Main ( tests/doctests.hs, dist/build/vector-doctest/vector-doctest-tmp/Main.o )
  4701. 1221.19 s [vector] [2 of 2] Linking dist/build/vector-doctest/vector-doctest
  4702. 1227.53 s [vector] Preprocessing test suite 'vector-tests-O2' for vector-0.13.2.0..
  4703. 1227.57 s [vector] Building test suite 'vector-tests-O2' for vector-0.13.2.0..
  4704. 1227.78 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 )
  4705. 1228.13 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 )
  4706. 1240.80 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 )
  4707. 1240.84 s [vector]
  4708. 1240.84 s [vector] tests/Utilities.hs:244:17: warning: [GHC-63394] [-Wx-partial]
  4709. 1240.84 s [vector] In the use of ‘tail’
  4710. 1240.84 s [vector] (imported from Prelude, but defined in GHC.List):
  4711. 1240.84 s [vector] "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
  4712. 1240.84 s [vector] |
  4713. 1240.84 s [vector] 244 | postscanl f z = tail . scanl f z
  4714. 1240.84 s [vector] | ^^^^
  4715. 1240.84 s [vector]
  4716. 1240.84 s [vector] tests/Utilities.hs:245:16: warning: [GHC-63394] [-Wx-partial]
  4717. 1240.84 s [vector] In the use of ‘tail’
  4718. 1240.84 s [vector] (imported from Prelude, but defined in GHC.List):
  4719. 1240.84 s [vector] "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
  4720. 1240.84 s [vector] |
  4721. 1240.84 s [vector] 245 | prescanr f z = tail . scanr f z
  4722. 1240.84 s [vector] | ^^^^
  4723. 1240.84 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 )
  4724. 1240.84 s [vector]
  4725. 1240.84 s [vector] tests/Tests/Vector/Property.hs:243:68: warning: [GHC-63394] [-Wx-partial]
  4726. 1240.84 s [vector] In the use of ‘head’
  4727. 1240.84 s [vector] (imported from Data.List, but defined in GHC.List):
  4728. 1240.84 s [vector] "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
  4729. 1240.84 s [vector] |
  4730. 1240.84 s [vector] 243 | prop_head :: P (v a -> a) = not . V.null ===> V.head `eq` head
  4731. 1240.84 s [vector] | ^^^^
  4732. 1240.84 s [vector]
  4733. 1240.84 s [vector] tests/Tests/Vector/Property.hs:256:76: warning: [GHC-63394] [-Wx-partial]
  4734. 1240.84 s [vector] In the use of ‘head’
  4735. 1240.84 s [vector] (imported from Data.List, but defined in GHC.List):
  4736. 1240.84 s [vector] "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
  4737. 1240.84 s [vector] |
  4738. 1240.84 s [vector] 256 | prop_unsafeHead :: P (v a -> a) = not . V.null ===> V.unsafeHead `eq` head
  4739. 1240.84 s [vector] | ^^^^
  4740. 1240.84 s [vector]
  4741. 1240.84 s [vector] tests/Tests/Vector/Property.hs:272:65: warning: [GHC-63394] [-Wx-partial]
  4742. 1240.84 s [vector] In the use of ‘tail’
  4743. 1240.84 s [vector] (imported from Data.List, but defined in GHC.List):
  4744. 1240.84 s [vector] "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
  4745. 1240.84 s [vector] |
  4746. 1240.84 s [vector] 272 | prop_tail :: P (v a -> v a) = not . V.null ===> V.tail `eq` tail
  4747. 1240.84 s [vector] | ^^^^
  4748. 1240.84 s [vector]
  4749. 1240.84 s [vector] tests/Tests/Vector/Property.hs:439:26: warning: [GHC-63394] [-Wx-partial]
  4750. 1240.84 s [vector] In the use of ‘head’
  4751. 1240.84 s [vector] (imported from Data.List, but defined in GHC.List):
  4752. 1240.84 s [vector] "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
  4753. 1240.84 s [vector] |
  4754. 1240.84 s [vector] 439 | = V.uniq `eq` (map head . group)
  4755. 1240.84 s [vector] | ^^^^
  4756. 1252.64 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 )
  4757. 1282.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 )
  4758. 1282.55 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 )
  4759. 1282.55 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 )
  4760. 1282.55 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 )
  4761. 1282.55 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 )
  4762. 1282.55 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 )
  4763. 1282.55 s [vector]
  4764. 1282.55 s [vector] tests/Tests/Bundle.hs:76:77: warning: [GHC-63394] [-Wx-partial]
  4765. 1282.55 s [vector] In the use of ‘head’
  4766. 1282.56 s [vector] (imported from Prelude, but defined in GHC.List):
  4767. 1282.56 s [vector] "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
  4768. 1282.56 s [vector] |
  4769. 1282.56 s [vector] 76 | prop_head :: P (S.Bundle v a -> a) = not . S.null ===> S.head `eq` head
  4770. 1282.56 s [vector] | ^^^^
  4771. 1282.56 s [vector]
  4772. 1282.56 s [vector] tests/Tests/Bundle.hs:92:83: warning: [GHC-63394] [-Wx-partial]
  4773. 1282.56 s [vector] In the use of ‘tail’
  4774. 1282.56 s [vector] (imported from Prelude, but defined in GHC.List):
  4775. 1282.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 Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
  4776. 1282.56 s [vector] |
  4777. 1282.56 s [vector] 92 | prop_tail :: P (S.Bundle v a -> S.Bundle v a) = not . S.null ===> S.tail `eq` tail
  4778. 1282.56 s [vector] | ^^^^
  4779. 1282.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 )
  4780. 1283.25 s [vector] [13 of 13] Linking dist/build/vector-tests-O2/vector-tests-O2
  4781. 1284.70 s [vector] Preprocessing library 'benchmarks-O2' for vector-0.13.2.0..
  4782. 1284.70 s [vector] Building library 'benchmarks-O2' for vector-0.13.2.0..
  4783. 1284.82 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 )
  4784. 1287.71 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 )
  4785. 1287.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 )
  4786. 1288.09 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 )
  4787. 1288.09 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 )
  4788. 1288.09 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 )
  4789. 1288.09 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 )
  4790. 1288.09 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 )
  4791. 1288.09 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 )
  4792. 1288.09 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 )
  4793. 1288.09 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 )
  4794. 1288.09 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 )
  4795. 1288.09 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 )
  4796. 1288.09 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 )
  4797. 1288.41 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 )
  4798. 1291.33 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 )
  4799. 1291.33 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 )
  4800. 1291.54 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 )
  4801. 1291.54 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 )
  4802. 1291.54 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 )
  4803. 1291.54 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 )
  4804. 1291.54 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 )
  4805. 1291.54 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 )
  4806. 1291.54 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 )
  4807. 1291.54 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 )
  4808. 1291.54 s [vector] [12 of 14] Compiling Bench.Vector.Tasty ( benchlib/Bench/Vector/Tasty.hs, dist/build/benchmarks-O2/Bench/Vector/Tasty.p_o )
  4809. 1291.54 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 )
  4810. 1291.54 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 )
  4811. 1294.26 s [vector] Preprocessing test suite 'vector-inspection' for vector-0.13.2.0..
  4812. 1294.26 s [vector] Building test suite 'vector-inspection' for vector-0.13.2.0..
  4813. 1294.52 s [vector] [1 of 4] Compiling Inspect ( tests-inspect/Inspect.hs, dist/build/vector-inspection/vector-inspection-tmp/Inspect.o )
  4814. 1295.83 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 )
  4815. 1295.83 s [vector] [3 of 4] Compiling Inspect.DerivingVia ( tests-inspect/Inspect/DerivingVia.hs, dist/build/vector-inspection/vector-inspection-tmp/Inspect/DerivingVia.o )
  4816. 1297.82 s [vector] [4 of 4] Compiling Main ( tests-inspect/main.hs, dist/build/vector-inspection/vector-inspection-tmp/Main.o )
  4817. 1298.83 s [vector] [5 of 5] Linking dist/build/vector-inspection/vector-inspection
  4818. 1300.29 s [vector] buildPhase completed in 5 minutes 10 seconds
  4819. 1300.29 s [vector] Phase: checkPhase
  4820. 1300.36 s [vector] Running 2 test suites...
  4821. 1300.38 s [vector] Test suite vector-tests-O0: RUNNING...
  4822. 1300.52 s [vector] toplevel
  4823. 1300.52 s [vector] Data.Vector.Fusion.Bundle
  4824. 1300.52 s [vector] fromList.toList == id: OK
  4825. 1300.52 s [vector] +++ OK, passed 100 tests.
  4826. 1300.52 s [vector] toList.fromList == id: OK
  4827. 1300.52 s [vector] +++ OK, passed 100 tests.
  4828. 1300.52 s [vector] eq: OK
  4829. 1300.52 s [vector] +++ OK, passed 100 tests.
  4830. 1300.53 s [vector] length: OK
  4831. 1300.53 s [vector] +++ OK, passed 100 tests.
  4832. 1300.53 s [vector] null: OK
  4833. 1300.53 s [vector] +++ OK, passed 100 tests.
  4834. 1300.53 s [vector] empty: OK
  4835. 1300.53 s [vector] +++ OK, passed 100 tests.
  4836. 1300.54 s [vector] singleton: OK
  4837. 1300.54 s [vector] +++ OK, passed 100 tests.
  4838. 1300.54 s [vector] replicate: OK
  4839. 1300.54 s [vector] +++ OK, passed 100 tests.
  4840. 1300.54 s [vector] cons: OK
  4841. 1300.54 s [vector] +++ OK, passed 100 tests.
  4842. 1300.54 s [vector] snoc: OK
  4843. 1300.54 s [vector] +++ OK, passed 100 tests.
  4844. 1300.54 s [vector] append: OK
  4845. 1300.54 s [vector] +++ OK, passed 100 tests.
  4846. 1300.54 s [vector] head: OK
  4847. 1300.54 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4848. 1300.54 s [vector] last: OK
  4849. 1300.54 s [vector] +++ OK, passed 100 tests; 20 discarded.
  4850. 1300.54 s [vector] index: OK
  4851. 1300.54 s [vector] +++ OK, passed 100 tests; 13 discarded.
  4852. 1300.54 s [vector] extract: OK
  4853. 1300.55 s [vector] +++ OK, passed 100 tests.
  4854. 1300.55 s [vector] init: OK
  4855. 1300.55 s [vector] +++ OK, passed 100 tests; 13 discarded.
  4856. 1300.55 s [vector] tail: OK
  4857. 1300.55 s [vector] +++ OK, passed 100 tests; 12 discarded.
  4858. 1300.55 s [vector] take: OK
  4859. 1300.55 s [vector] +++ OK, passed 100 tests.
  4860. 1300.55 s [vector] drop: OK
  4861. 1300.55 s [vector] +++ OK, passed 100 tests.
  4862. 1300.55 s [vector] map: OK
  4863. 1300.55 s [vector] +++ OK, passed 100 tests.
  4864. 1300.55 s [vector] zipWith: OK
  4865. 1300.55 s [vector] +++ OK, passed 100 tests.
  4866. 1300.55 s [vector] zipWith3: OK
  4867. 1300.55 s [vector] +++ OK, passed 100 tests.
  4868. 1300.55 s [vector] filter: OK
  4869. 1300.55 s [vector] +++ OK, passed 100 tests.
  4870. 1300.55 s [vector] takeWhile: OK
  4871. 1300.55 s [vector] +++ OK, passed 100 tests.
  4872. 1300.55 s [vector] dropWhile: OK
  4873. 1300.55 s [vector] +++ OK, passed 100 tests.
  4874. 1300.55 s [vector] elem: OK
  4875. 1300.55 s [vector] +++ OK, passed 100 tests.
  4876. 1300.55 s [vector] notElem: OK
  4877. 1300.55 s [vector] +++ OK, passed 100 tests.
  4878. 1300.55 s [vector] find: OK
  4879. 1300.55 s [vector] +++ OK, passed 100 tests.
  4880. 1300.55 s [vector] findIndex: OK
  4881. 1300.55 s [vector] +++ OK, passed 100 tests.
  4882. 1300.55 s [vector] foldl: OK
  4883. 1300.55 s [vector] +++ OK, passed 100 tests.
  4884. 1300.55 s [vector] foldl1: OK (0.01s)
  4885. 1300.55 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4886. 1300.55 s [vector] foldl': OK
  4887. 1300.55 s [vector] +++ OK, passed 100 tests.
  4888. 1300.55 s [vector] foldl1': OK
  4889. 1300.55 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4890. 1300.55 s [vector] foldr: OK (0.02s)
  4891. 1300.55 s [vector] +++ OK, passed 100 tests.
  4892. 1300.55 s [vector] foldr1: OK
  4893. 1300.55 s [vector] +++ OK, passed 100 tests; 18 discarded.
  4894. 1300.55 s [vector] prescanl: OK
  4895. 1300.55 s [vector] +++ OK, passed 100 tests.
  4896. 1300.55 s [vector] prescanl': OK
  4897. 1300.55 s [vector] +++ OK, passed 100 tests.
  4898. 1300.55 s [vector] postscanl: OK
  4899. 1300.55 s [vector] +++ OK, passed 100 tests.
  4900. 1300.55 s [vector] postscanl': OK
  4901. 1300.55 s [vector] +++ OK, passed 100 tests.
  4902. 1300.55 s [vector] scanl: OK
  4903. 1300.55 s [vector] +++ OK, passed 100 tests.
  4904. 1300.55 s [vector] scanl': OK
  4905. 1300.55 s [vector] +++ OK, passed 100 tests.
  4906. 1300.55 s [vector] scanl1: OK
  4907. 1300.55 s [vector] +++ OK, passed 100 tests; 21 discarded.
  4908. 1300.55 s [vector] scanl1': OK
  4909. 1300.55 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4910. 1300.55 s [vector] concatMap: OK
  4911. 1300.55 s [vector] +++ OK, passed 100 tests.
  4912. 1300.55 s [vector] unfoldr: OK
  4913. 1300.55 s [vector] +++ OK, passed 100 tests.
  4914. 1300.55 s [vector] and: OK
  4915. 1300.55 s [vector] +++ OK, passed 100 tests.
  4916. 1300.55 s [vector] or: OK
  4917. 1300.55 s [vector] +++ OK, passed 100 tests.
  4918. 1300.55 s [vector] Tests.Vector.Boxed
  4919. 1300.55 s [vector] Bool
  4920. 1300.55 s [vector] fromList.toList == id: OK
  4921. 1300.55 s [vector] +++ OK, passed 100 tests.
  4922. 1300.55 s [vector] toList.fromList == id: OK
  4923. 1300.55 s [vector] +++ OK, passed 100 tests.
  4924. 1300.55 s [vector] unstream.stream == id: OK
  4925. 1300.55 s [vector] +++ OK, passed 100 tests.
  4926. 1300.55 s [vector] stream.unstream == id: OK
  4927. 1300.55 s [vector] +++ OK, passed 100 tests.
  4928. 1300.55 s [vector] eq: OK
  4929. 1300.55 s [vector] +++ OK, passed 100 tests.
  4930. 1300.55 s [vector] length: OK
  4931. 1300.55 s [vector] +++ OK, passed 100 tests.
  4932. 1300.55 s [vector] null: OK
  4933. 1300.55 s [vector] +++ OK, passed 100 tests.
  4934. 1300.55 s [vector] index: OK (0.02s)
  4935. 1300.55 s [vector] +++ OK, passed 100 tests; 25 discarded.
  4936. 1300.55 s [vector] safeIndex: OK
  4937. 1300.55 s [vector] +++ OK, passed 100 tests.
  4938. 1300.55 s [vector] head: OK
  4939. 1300.55 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4940. 1300.55 s [vector] last: OK
  4941. 1300.55 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4942. 1300.55 s [vector] unsafeIndex: OK
  4943. 1300.55 s [vector] +++ OK, passed 100 tests; 13 discarded.
  4944. 1300.55 s [vector] unsafeHead: OK
  4945. 1300.55 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4946. 1300.55 s [vector] unsafeLast: OK
  4947. 1300.55 s [vector] +++ OK, passed 100 tests; 18 discarded.
  4948. 1300.55 s [vector] slice: OK
  4949. 1300.55 s [vector] +++ OK, passed 100 tests.
  4950. 1300.55 s [vector] init: OK
  4951. 1300.55 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4952. 1300.55 s [vector] tail: OK
  4953. 1300.55 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4954. 1300.55 s [vector] take: OK
  4955. 1300.55 s [vector] +++ OK, passed 100 tests.
  4956. 1300.56 s [vector] drop: OK
  4957. 1300.56 s [vector] +++ OK, passed 100 tests.
  4958. 1300.56 s [vector] splitAt: OK
  4959. 1300.56 s [vector] +++ OK, passed 100 tests.
  4960. 1300.56 s [vector] empty: OK
  4961. 1300.56 s [vector] +++ OK, passed 100 tests.
  4962. 1300.56 s [vector] singleton: OK
  4963. 1300.56 s [vector] +++ OK, passed 100 tests.
  4964. 1300.56 s [vector] replicate: OK
  4965. 1300.56 s [vector] +++ OK, passed 100 tests.
  4966. 1300.56 s [vector] generate: OK
  4967. 1300.56 s [vector] +++ OK, passed 100 tests.
  4968. 1300.56 s [vector] iterateN: OK
  4969. 1300.56 s [vector] +++ OK, passed 100 tests.
  4970. 1300.63 s [vector] iterateNM: OK (0.04s)
  4971. 1300.64 s [vector] +++ OK, passed 100 tests.
  4972. 1300.67 s [vector] generateM: OK (0.04s)
  4973. 1300.67 s [vector] +++ OK, passed 100 tests.
  4974. 1300.67 s [vector] replicateM: OK
  4975. 1300.67 s [vector] +++ OK, passed 100 tests.
  4976. 1300.67 s [vector] create: OK
  4977. 1300.67 s [vector] +++ OK, passed 100 tests.
  4978. 1300.67 s [vector] createT: OK
  4979. 1300.67 s [vector] +++ OK, passed 100 tests.
  4980. 1300.67 s [vector] unfoldr: OK
  4981. 1300.67 s [vector] +++ OK, passed 100 tests.
  4982. 1300.67 s [vector] unfoldrN: OK
  4983. 1300.67 s [vector] +++ OK, passed 100 tests.
  4984. 1300.67 s [vector] unfoldrExactN: OK
  4985. 1300.67 s [vector] +++ OK, passed 100 tests.
  4986. 1300.68 s [vector] unfoldrM: OK
  4987. 1300.70 s [vector] +++ OK, passed 100 tests.
  4988. 1300.70 s [vector] unfoldrNM: OK
  4989. 1300.70 s [vector] +++ OK, passed 100 tests.
  4990. 1300.76 s [vector] unfoldrExactNM: OK (0.07s)
  4991. 1300.76 s [vector] +++ OK, passed 100 tests.
  4992. 1300.76 s [vector] constructN: OK
  4993. 1300.76 s [vector] +++ OK, passed 100 tests.
  4994. 1300.76 s [vector] constructrN: OK
  4995. 1300.76 s [vector] +++ OK, passed 100 tests.
  4996. 1300.76 s [vector] cons: OK
  4997. 1300.76 s [vector] +++ OK, passed 100 tests.
  4998. 1300.76 s [vector] snoc: OK
  4999. 1300.76 s [vector] +++ OK, passed 100 tests.
  5000. 1300.77 s [vector] append: OK
  5001. 1300.78 s [vector] +++ OK, passed 100 tests.
  5002. 1300.78 s [vector] concat: OK (0.01s)
  5003. 1300.78 s [vector] +++ OK, passed 100 tests.
  5004. 1300.78 s [vector] force: OK
  5005. 1300.78 s [vector] +++ OK, passed 100 tests.
  5006. 1300.79 s [vector] upd: OK
  5007. 1300.79 s [vector] +++ OK, passed 100 tests.
  5008. 1300.79 s [vector] accum: OK
  5009. 1300.79 s [vector] +++ OK, passed 100 tests.
  5010. 1300.79 s [vector] reverse: OK
  5011. 1300.79 s [vector] +++ OK, passed 100 tests.
  5012. 1300.79 s [vector] backpermute: OK
  5013. 1300.79 s [vector] +++ OK, passed 100 tests.
  5014. 1300.79 s [vector] map: OK
  5015. 1300.79 s [vector] +++ OK, passed 100 tests.
  5016. 1300.79 s [vector] imap: OK
  5017. 1300.79 s [vector] +++ OK, passed 100 tests.
  5018. 1300.80 s [vector] concatMap: OK
  5019. 1300.80 s [vector] +++ OK, passed 100 tests.
  5020. 1300.81 s [vector] mapM: OK
  5021. 1300.81 s [vector] +++ OK, passed 100 tests.
  5022. 1300.82 s [vector] mapM_: OK (0.02s)
  5023. 1300.82 s [vector] +++ OK, passed 100 tests.
  5024. 1300.83 s [vector] forM: OK
  5025. 1300.84 s [vector] +++ OK, passed 100 tests.
  5026. 1300.84 s [vector] forM_: OK (0.02s)
  5027. 1300.84 s [vector] +++ OK, passed 100 tests.
  5028. 1300.84 s [vector] imapM: OK
  5029. 1300.85 s [vector] +++ OK, passed 100 tests.
  5030. 1300.86 s [vector] imapM_: OK (0.02s)
  5031. 1300.86 s [vector] +++ OK, passed 100 tests.
  5032. 1300.86 s [vector] zipWith: OK
  5033. 1300.86 s [vector] +++ OK, passed 100 tests.
  5034. 1300.86 s [vector] zipWith3: OK
  5035. 1300.86 s [vector] +++ OK, passed 100 tests.
  5036. 1300.86 s [vector] izipWith: OK
  5037. 1300.87 s [vector] +++ OK, passed 100 tests.
  5038. 1300.87 s [vector] izipWith3: OK
  5039. 1300.87 s [vector] +++ OK, passed 100 tests.
  5040. 1300.87 s [vector] izipWithM: OK
  5041. 1300.87 s [vector] +++ OK, passed 100 tests.
  5042. 1300.89 s [vector] izipWithM_: OK (0.01s)
  5043. 1300.89 s [vector] +++ OK, passed 100 tests.
  5044. 1300.89 s [vector] zipWithM: OK
  5045. 1300.89 s [vector] +++ OK, passed 100 tests.
  5046. 1300.90 s [vector] zipWithM_: OK (0.01s)
  5047. 1300.91 s [vector] +++ OK, passed 100 tests.
  5048. 1300.91 s [vector] filter: OK
  5049. 1300.91 s [vector] +++ OK, passed 100 tests.
  5050. 1300.91 s [vector] ifilter: OK
  5051. 1300.91 s [vector] +++ OK, passed 100 tests.
  5052. 1300.94 s [vector] filterM: OK (0.03s)
  5053. 1300.94 s [vector] +++ OK, passed 100 tests.
  5054. 1300.94 s [vector] uniq: OK
  5055. 1300.94 s [vector] +++ OK, passed 100 tests.
  5056. 1300.94 s [vector] mapMaybe: OK
  5057. 1300.94 s [vector] +++ OK, passed 100 tests.
  5058. 1300.94 s [vector] imapMaybe: OK
  5059. 1300.94 s [vector] +++ OK, passed 100 tests.
  5060. 1300.94 s [vector] takeWhile: OK
  5061. 1300.94 s [vector] +++ OK, passed 100 tests.
  5062. 1300.94 s [vector] dropWhile: OK
  5063. 1300.94 s [vector] +++ OK, passed 100 tests.
  5064. 1300.95 s [vector] partition: OK
  5065. 1300.95 s [vector] +++ OK, passed 100 tests.
  5066. 1300.95 s [vector] partitionWith: OK
  5067. 1300.95 s [vector] +++ OK, passed 100 tests.
  5068. 1300.95 s [vector] span: OK
  5069. 1300.95 s [vector] +++ OK, passed 100 tests.
  5070. 1300.95 s [vector] break: OK
  5071. 1300.95 s [vector] +++ OK, passed 100 tests.
  5072. 1300.95 s [vector] spanR: OK
  5073. 1300.95 s [vector] +++ OK, passed 100 tests.
  5074. 1300.95 s [vector] breakR: OK
  5075. 1300.95 s [vector] +++ OK, passed 100 tests.
  5076. 1300.95 s [vector] groupBy: OK
  5077. 1300.95 s [vector] +++ OK, passed 100 tests.
  5078. 1300.95 s [vector] elem: OK
  5079. 1300.95 s [vector] +++ OK, passed 100 tests.
  5080. 1300.95 s [vector] notElem: OK
  5081. 1300.95 s [vector] +++ OK, passed 100 tests.
  5082. 1300.95 s [vector] find: OK
  5083. 1300.95 s [vector] +++ OK, passed 100 tests.
  5084. 1300.95 s [vector] findIndex: OK
  5085. 1300.95 s [vector] +++ OK, passed 100 tests.
  5086. 1300.96 s [vector] findIndexR: OK
  5087. 1300.96 s [vector] +++ OK, passed 100 tests.
  5088. 1300.96 s [vector] findIndices: OK
  5089. 1300.96 s [vector] +++ OK, passed 100 tests.
  5090. 1300.96 s [vector] elemIndex: OK
  5091. 1300.96 s [vector] +++ OK, passed 100 tests.
  5092. 1300.96 s [vector] elemIndices: OK
  5093. 1300.96 s [vector] +++ OK, passed 100 tests.
  5094. 1300.96 s [vector] foldl: OK
  5095. 1300.96 s [vector] +++ OK, passed 100 tests.
  5096. 1300.96 s [vector] foldl1: OK
  5097. 1300.96 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5098. 1300.96 s [vector] foldl': OK
  5099. 1300.97 s [vector] +++ OK, passed 100 tests.
  5100. 1300.97 s [vector] foldl1': OK
  5101. 1300.97 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5102. 1300.97 s [vector] foldr: OK
  5103. 1300.97 s [vector] +++ OK, passed 100 tests.
  5104. 1300.97 s [vector] foldr1: OK
  5105. 1300.97 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5106. 1300.97 s [vector] foldr': OK
  5107. 1300.98 s [vector] +++ OK, passed 100 tests.
  5108. 1300.98 s [vector] foldr1': OK
  5109. 1300.98 s [vector] +++ OK, passed 100 tests; 11 discarded.
  5110. 1300.98 s [vector] ifoldl: OK
  5111. 1300.98 s [vector] +++ OK, passed 100 tests.
  5112. 1300.98 s [vector] ifoldl': OK
  5113. 1300.98 s [vector] +++ OK, passed 100 tests.
  5114. 1300.99 s [vector] ifoldr: OK
  5115. 1300.99 s [vector] +++ OK, passed 100 tests.
  5116. 1300.99 s [vector] ifoldr': OK
  5117. 1300.99 s [vector] +++ OK, passed 100 tests.
  5118. 1300.99 s [vector] ifoldM: OK
  5119. 1300.99 s [vector] +++ OK, passed 100 tests.
  5120. 1301.00 s [vector] ifoldM': OK
  5121. 1301.00 s [vector] +++ OK, passed 100 tests.
  5122. 1301.02 s [vector] ifoldM_: OK
  5123. 1301.02 s [vector] +++ OK, passed 100 tests.
  5124. 1301.03 s [vector] ifoldM'_: OK (0.02s)
  5125. 1301.03 s [vector] +++ OK, passed 100 tests.
  5126. 1301.03 s [vector] all: OK
  5127. 1301.03 s [vector] +++ OK, passed 100 tests.
  5128. 1301.03 s [vector] any: OK
  5129. 1301.03 s [vector] +++ OK, passed 100 tests.
  5130. 1301.04 s [vector] prescanl: OK
  5131. 1301.04 s [vector] +++ OK, passed 100 tests.
  5132. 1301.04 s [vector] prescanl': OK
  5133. 1301.04 s [vector] +++ OK, passed 100 tests.
  5134. 1301.04 s [vector] postscanl: OK
  5135. 1301.04 s [vector] +++ OK, passed 100 tests.
  5136. 1301.04 s [vector] postscanl': OK
  5137. 1301.04 s [vector] +++ OK, passed 100 tests.
  5138. 1301.05 s [vector] scanl: OK
  5139. 1301.05 s [vector] +++ OK, passed 100 tests.
  5140. 1301.05 s [vector] scanl': OK
  5141. 1301.05 s [vector] +++ OK, passed 100 tests.
  5142. 1301.05 s [vector] scanl1: OK
  5143. 1301.05 s [vector] +++ OK, passed 100 tests.
  5144. 1301.05 s [vector] scanl1': OK
  5145. 1301.05 s [vector] +++ OK, passed 100 tests.
  5146. 1301.06 s [vector] iscanl: OK
  5147. 1301.06 s [vector] +++ OK, passed 100 tests.
  5148. 1301.06 s [vector] iscanl': OK
  5149. 1301.06 s [vector] +++ OK, passed 100 tests.
  5150. 1301.06 s [vector] prescanr: OK
  5151. 1301.06 s [vector] +++ OK, passed 100 tests.
  5152. 1301.07 s [vector] prescanr': OK
  5153. 1301.07 s [vector] +++ OK, passed 100 tests.
  5154. 1301.07 s [vector] postscanr: OK
  5155. 1301.07 s [vector] +++ OK, passed 100 tests.
  5156. 1301.07 s [vector] postscanr': OK
  5157. 1301.07 s [vector] +++ OK, passed 100 tests.
  5158. 1301.07 s [vector] scanr: OK
  5159. 1301.07 s [vector] +++ OK, passed 100 tests.
  5160. 1301.07 s [vector] scanr': OK
  5161. 1301.07 s [vector] +++ OK, passed 100 tests.
  5162. 1301.07 s [vector] scanr1: OK
  5163. 1301.07 s [vector] +++ OK, passed 100 tests.
  5164. 1301.08 s [vector] scanr1': OK
  5165. 1301.08 s [vector] +++ OK, passed 100 tests.
  5166. 1301.08 s [vector] iscanr: OK
  5167. 1301.09 s [vector] +++ OK, passed 100 tests.
  5168. 1301.09 s [vector] iscanr': OK
  5169. 1301.09 s [vector] +++ OK, passed 100 tests.
  5170. 1301.09 s [vector] mut_read: OK
  5171. 1301.09 s [vector] +++ OK, passed 100 tests; 20 discarded.
  5172. 1301.09 s [vector] mut_write: OK
  5173. 1301.09 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5174. 1301.09 s [vector] mut_modify: OK
  5175. 1301.09 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5176. 1301.09 s [vector] mut_generate: OK
  5177. 1301.09 s [vector] +++ OK, passed 100 tests.
  5178. 1301.10 s [vector] mut_generateM: OK
  5179. 1301.11 s [vector] +++ OK, passed 100 tests.
  5180. 1301.13 s [vector] mut_mapM_: OK (0.02s)
  5181. 1301.14 s [vector] +++ OK, passed 100 tests.
  5182. 1301.15 s [vector] mut_imapM_: OK (0.02s)
  5183. 1301.15 s [vector] +++ OK, passed 100 tests.
  5184. 1301.15 s [vector] mut_forM_: OK (0.01s)
  5185. 1301.15 s [vector] +++ OK, passed 100 tests.
  5186. 1301.17 s [vector] mut_iforM_: OK (0.02s)
  5187. 1301.17 s [vector] +++ OK, passed 100 tests.
  5188. 1301.17 s [vector] mut_foldr: OK
  5189. 1301.17 s [vector] +++ OK, passed 100 tests.
  5190. 1301.17 s [vector] mut_foldr': OK
  5191. 1301.17 s [vector] +++ OK, passed 100 tests.
  5192. 1301.18 s [vector] mut_foldl: OK
  5193. 1301.18 s [vector] +++ OK, passed 100 tests.
  5194. 1301.18 s [vector] mut_foldl': OK
  5195. 1301.19 s [vector] +++ OK, passed 100 tests.
  5196. 1301.19 s [vector] mut_ifoldr: OK
  5197. 1301.19 s [vector] +++ OK, passed 100 tests.
  5198. 1301.20 s [vector] mut_ifoldr': OK
  5199. 1301.20 s [vector] +++ OK, passed 100 tests.
  5200. 1301.20 s [vector] mut_ifoldl: OK
  5201. 1301.20 s [vector] +++ OK, passed 100 tests.
  5202. 1301.20 s [vector] mut_ifoldl': OK
  5203. 1301.20 s [vector] +++ OK, passed 100 tests.
  5204. 1301.21 s [vector] mut_foldM: OK
  5205. 1301.21 s [vector] +++ OK, passed 100 tests.
  5206. 1301.21 s [vector] mut_foldM': OK
  5207. 1301.22 s [vector] +++ OK, passed 100 tests.
  5208. 1301.23 s [vector] mut_foldrM: OK
  5209. 1301.23 s [vector] +++ OK, passed 100 tests.
  5210. 1301.23 s [vector] mut_foldrM': OK
  5211. 1301.24 s [vector] +++ OK, passed 100 tests.
  5212. 1301.24 s [vector] mut_ifoldM: OK
  5213. 1301.24 s [vector] +++ OK, passed 100 tests.
  5214. 1301.25 s [vector] mut_ifoldM': OK
  5215. 1301.25 s [vector] +++ OK, passed 100 tests.
  5216. 1301.25 s [vector] mut_ifoldrM: OK
  5217. 1301.26 s [vector] +++ OK, passed 100 tests.
  5218. 1301.26 s [vector] mut_ifoldrM': OK (0.01s)
  5219. 1301.26 s [vector] +++ OK, passed 100 tests.
  5220. 1301.26 s [vector] compare: OK
  5221. 1301.26 s [vector] +++ OK, passed 100 tests.
  5222. 1301.27 s [vector] maximum: OK
  5223. 1301.27 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5224. 1301.27 s [vector] minimum: OK
  5225. 1301.27 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5226. 1301.27 s [vector] minIndex: OK
  5227. 1301.27 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5228. 1301.27 s [vector] maxIndex: OK
  5229. 1301.27 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5230. 1301.27 s [vector] maximumBy: OK
  5231. 1301.27 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5232. 1301.27 s [vector] minimumBy: OK
  5233. 1301.27 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5234. 1301.27 s [vector] maximumOn: OK
  5235. 1301.27 s [vector] +++ OK, passed 100 tests; 21 discarded.
  5236. 1301.27 s [vector] minimumOn: OK
  5237. 1301.28 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5238. 1301.28 s [vector] maxIndexBy: OK
  5239. 1301.28 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5240. 1301.28 s [vector] minIndexBy: OK
  5241. 1301.28 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5242. 1301.28 s [vector] ListFirstMaxIndexWins: OK
  5243. 1301.28 s [vector] +++ OK, passed 100 tests; 10 discarded.
  5244. 1301.28 s [vector] FalseListFirstMaxIndexWins: OK
  5245. 1301.28 s [vector] +++ OK, failed as expected. (after 1 test):
  5246. 1301.28 s [vector] Exception:
  5247. 1301.28 s [vector] Prelude.foldr1: empty list
  5248. 1301.28 s [vector] CallStack (from HasCallStack):
  5249. 1301.28 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  5250. 1301.28 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  5251. 1301.28 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  5252. 1301.28 s [vector] []
  5253. 1301.28 s [vector] zip: OK
  5254. 1301.28 s [vector] +++ OK, passed 100 tests.
  5255. 1301.28 s [vector] zip3: OK
  5256. 1301.28 s [vector] +++ OK, passed 100 tests.
  5257. 1301.28 s [vector] unzip: OK
  5258. 1301.28 s [vector] +++ OK, passed 100 tests.
  5259. 1301.28 s [vector] unzip3: OK
  5260. 1301.28 s [vector] +++ OK, passed 100 tests.
  5261. 1301.28 s [vector] indexed: OK
  5262. 1301.28 s [vector] +++ OK, passed 100 tests.
  5263. 1301.28 s [vector] update: OK
  5264. 1301.29 s [vector] +++ OK, passed 100 tests.
  5265. 1301.29 s [vector] concat: OK
  5266. 1301.29 s [vector] +++ OK, passed 100 tests.
  5267. 1301.29 s [vector] mempty: OK
  5268. 1301.29 s [vector] +++ OK, passed 100 tests.
  5269. 1301.29 s [vector] mappend: OK
  5270. 1301.29 s [vector] +++ OK, passed 100 tests.
  5271. 1301.30 s [vector] mconcat: OK
  5272. 1301.30 s [vector] +++ OK, passed 100 tests.
  5273. 1301.30 s [vector] fmap: OK
  5274. 1301.30 s [vector] +++ OK, passed 100 tests.
  5275. 1301.31 s [vector] return: OK
  5276. 1301.31 s [vector] +++ OK, passed 100 tests.
  5277. 1301.32 s [vector] bind: OK (0.01s)
  5278. 1301.32 s [vector] +++ OK, passed 100 tests.
  5279. 1301.32 s [vector] mzip: OK
  5280. 1301.32 s [vector] +++ OK, passed 100 tests.
  5281. 1301.32 s [vector] munzip: OK
  5282. 1301.32 s [vector] +++ OK, passed 100 tests.
  5283. 1301.32 s [vector] applicative_pure: OK
  5284. 1301.33 s [vector] +++ OK, passed 100 tests.
  5285. 1301.34 s [vector] applicative_appl: OK (0.02s)
  5286. 1301.34 s [vector] +++ OK, passed 100 tests.
  5287. 1301.34 s [vector] alternative_empty: OK
  5288. 1301.34 s [vector] +++ OK, passed 100 tests.
  5289. 1301.36 s [vector] alternative_or: OK
  5290. 1301.36 s [vector] +++ OK, passed 100 tests.
  5291. 1301.37 s [vector] sequence: OK (0.03s)
  5292. 1301.38 s [vector] +++ OK, passed 100 tests.
  5293. 1301.38 s [vector] sequence_: OK
  5294. 1301.38 s [vector] +++ OK, passed 100 tests.
  5295. 1301.38 s [vector] glength: OK
  5296. 1301.38 s [vector] +++ OK, passed 100 tests.
  5297. 1301.38 s [vector] and: OK
  5298. 1301.38 s [vector] +++ OK, passed 100 tests.
  5299. 1301.38 s [vector] or: OK
  5300. 1301.38 s [vector] +++ OK, passed 100 tests.
  5301. 1301.38 s [vector] Int
  5302. 1301.38 s [vector] fromList.toList == id: OK
  5303. 1301.38 s [vector] +++ OK, passed 100 tests.
  5304. 1301.38 s [vector] toList.fromList == id: OK
  5305. 1301.38 s [vector] +++ OK, passed 100 tests.
  5306. 1301.39 s [vector] unstream.stream == id: OK
  5307. 1301.39 s [vector] +++ OK, passed 100 tests.
  5308. 1301.39 s [vector] stream.unstream == id: OK
  5309. 1301.39 s [vector] +++ OK, passed 100 tests.
  5310. 1301.39 s [vector] eq: OK
  5311. 1301.39 s [vector] +++ OK, passed 100 tests.
  5312. 1301.39 s [vector] length: OK
  5313. 1301.39 s [vector] +++ OK, passed 100 tests.
  5314. 1301.39 s [vector] null: OK
  5315. 1301.39 s [vector] +++ OK, passed 100 tests.
  5316. 1301.39 s [vector] index: OK
  5317. 1301.39 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5318. 1301.39 s [vector] safeIndex: OK
  5319. 1301.39 s [vector] +++ OK, passed 100 tests.
  5320. 1301.39 s [vector] head: OK
  5321. 1301.39 s [vector] +++ OK, passed 100 tests; 21 discarded.
  5322. 1301.39 s [vector] last: OK
  5323. 1301.39 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5324. 1301.39 s [vector] unsafeIndex: OK
  5325. 1301.39 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5326. 1301.39 s [vector] unsafeHead: OK
  5327. 1301.39 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5328. 1301.39 s [vector] unsafeLast: OK
  5329. 1301.39 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5330. 1301.39 s [vector] slice: OK
  5331. 1301.39 s [vector] +++ OK, passed 100 tests.
  5332. 1301.39 s [vector] init: OK
  5333. 1301.39 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5334. 1301.39 s [vector] tail: OK
  5335. 1301.39 s [vector] +++ OK, passed 100 tests; 21 discarded.
  5336. 1301.39 s [vector] take: OK
  5337. 1301.39 s [vector] +++ OK, passed 100 tests.
  5338. 1301.39 s [vector] drop: OK
  5339. 1301.39 s [vector] +++ OK, passed 100 tests.
  5340. 1301.39 s [vector] splitAt: OK
  5341. 1301.39 s [vector] +++ OK, passed 100 tests.
  5342. 1301.39 s [vector] empty: OK
  5343. 1301.39 s [vector] +++ OK, passed 100 tests.
  5344. 1301.39 s [vector] singleton: OK
  5345. 1301.39 s [vector] +++ OK, passed 100 tests.
  5346. 1301.41 s [vector] replicate: OK
  5347. 1301.42 s [vector] +++ OK, passed 100 tests.
  5348. 1301.42 s [vector] generate: OK
  5349. 1301.42 s [vector] +++ OK, passed 100 tests.
  5350. 1301.42 s [vector] iterateN: OK
  5351. 1301.42 s [vector] +++ OK, passed 100 tests.
  5352. 1301.42 s [vector] iterateNM: OK (0.02s)
  5353. 1301.42 s [vector] +++ OK, passed 100 tests.
  5354. 1301.45 s [vector] generateM: OK
  5355. 1301.45 s [vector] +++ OK, passed 100 tests.
  5356. 1301.45 s [vector] replicateM: OK
  5357. 1301.45 s [vector] +++ OK, passed 100 tests.
  5358. 1301.45 s [vector] create: OK
  5359. 1301.45 s [vector] +++ OK, passed 100 tests.
  5360. 1301.45 s [vector] createT: OK
  5361. 1301.45 s [vector] +++ OK, passed 100 tests.
  5362. 1301.45 s [vector] unfoldr: OK
  5363. 1301.45 s [vector] +++ OK, passed 100 tests.
  5364. 1301.45 s [vector] unfoldrN: OK
  5365. 1301.45 s [vector] +++ OK, passed 100 tests.
  5366. 1301.45 s [vector] unfoldrExactN: OK
  5367. 1301.45 s [vector] +++ OK, passed 100 tests.
  5368. 1301.46 s [vector] unfoldrM: OK
  5369. 1301.46 s [vector] +++ OK, passed 100 tests.
  5370. 1301.46 s [vector] unfoldrNM: OK
  5371. 1301.46 s [vector] +++ OK, passed 100 tests.
  5372. 1301.51 s [vector] unfoldrExactNM: OK (0.06s)
  5373. 1301.52 s [vector] +++ OK, passed 100 tests.
  5374. 1301.52 s [vector] constructN: OK
  5375. 1301.52 s [vector] +++ OK, passed 100 tests.
  5376. 1301.52 s [vector] constructrN: OK
  5377. 1301.54 s [vector] +++ OK, passed 100 tests.
  5378. 1301.54 s [vector] cons: OK
  5379. 1301.54 s [vector] +++ OK, passed 100 tests.
  5380. 1301.54 s [vector] snoc: OK
  5381. 1301.54 s [vector] +++ OK, passed 100 tests.
  5382. 1301.54 s [vector] append: OK
  5383. 1301.54 s [vector] +++ OK, passed 100 tests.
  5384. 1301.54 s [vector] concat: OK (0.02s)
  5385. 1301.54 s [vector] +++ OK, passed 100 tests.
  5386. 1301.54 s [vector] force: OK
  5387. 1301.54 s [vector] +++ OK, passed 100 tests.
  5388. 1301.54 s [vector] upd: OK
  5389. 1301.54 s [vector] +++ OK, passed 100 tests.
  5390. 1301.55 s [vector] accum: OK
  5391. 1301.55 s [vector] +++ OK, passed 100 tests.
  5392. 1301.55 s [vector] reverse: OK
  5393. 1301.55 s [vector] +++ OK, passed 100 tests.
  5394. 1301.55 s [vector] backpermute: OK
  5395. 1301.56 s [vector] +++ OK, passed 100 tests.
  5396. 1301.57 s [vector] map: OK
  5397. 1301.58 s [vector] +++ OK, passed 100 tests.
  5398. 1301.58 s [vector] imap: OK
  5399. 1301.58 s [vector] +++ OK, passed 100 tests.
  5400. 1301.58 s [vector] concatMap: OK
  5401. 1301.58 s [vector] +++ OK, passed 100 tests.
  5402. 1301.58 s [vector] mapM: OK
  5403. 1301.60 s [vector] +++ OK, passed 100 tests.
  5404. 1301.60 s [vector] mapM_: OK (0.02s)
  5405. 1301.60 s [vector] +++ OK, passed 100 tests.
  5406. 1301.60 s [vector] forM: OK
  5407. 1301.60 s [vector] +++ OK, passed 100 tests.
  5408. 1301.60 s [vector] forM_: OK (0.02s)
  5409. 1301.61 s [vector] +++ OK, passed 100 tests.
  5410. 1301.62 s [vector] imapM: OK
  5411. 1301.62 s [vector] +++ OK, passed 100 tests.
  5412. 1301.62 s [vector] imapM_: OK (0.02s)
  5413. 1301.62 s [vector] +++ OK, passed 100 tests.
  5414. 1301.62 s [vector] zipWith: OK
  5415. 1301.62 s [vector] +++ OK, passed 100 tests.
  5416. 1301.62 s [vector] zipWith3: OK
  5417. 1301.63 s [vector] +++ OK, passed 100 tests.
  5418. 1301.63 s [vector] izipWith: OK
  5419. 1301.63 s [vector] +++ OK, passed 100 tests.
  5420. 1301.64 s [vector] izipWith3: OK
  5421. 1301.64 s [vector] +++ OK, passed 100 tests.
  5422. 1301.64 s [vector] izipWithM: OK
  5423. 1301.64 s [vector] +++ OK, passed 100 tests.
  5424. 1301.65 s [vector] izipWithM_: OK (0.01s)
  5425. 1301.66 s [vector] +++ OK, passed 100 tests.
  5426. 1301.66 s [vector] zipWithM: OK
  5427. 1301.66 s [vector] +++ OK, passed 100 tests.
  5428. 1301.67 s [vector] zipWithM_: OK (0.02s)
  5429. 1301.67 s [vector] +++ OK, passed 100 tests.
  5430. 1301.68 s [vector] filter: OK
  5431. 1301.68 s [vector] +++ OK, passed 100 tests.
  5432. 1301.68 s [vector] ifilter: OK (0.01s)
  5433. 1301.68 s [vector] +++ OK, passed 100 tests.
  5434. 1301.73 s [vector] filterM: OK (0.03s)
  5435. 1301.74 s [vector] +++ OK, passed 100 tests.
  5436. 1301.74 s [vector] uniq: OK
  5437. 1301.74 s [vector] +++ OK, passed 100 tests.
  5438. 1301.75 s [vector] mapMaybe: OK (0.01s)
  5439. 1301.75 s [vector] +++ OK, passed 100 tests.
  5440. 1301.75 s [vector] imapMaybe: OK
  5441. 1301.75 s [vector] +++ OK, passed 100 tests.
  5442. 1301.75 s [vector] takeWhile: OK
  5443. 1301.75 s [vector] +++ OK, passed 100 tests.
  5444. 1301.75 s [vector] dropWhile: OK
  5445. 1301.75 s [vector] +++ OK, passed 100 tests.
  5446. 1301.75 s [vector] partition: OK
  5447. 1301.75 s [vector] +++ OK, passed 100 tests.
  5448. 1301.75 s [vector] partitionWith: OK
  5449. 1301.75 s [vector] +++ OK, passed 100 tests.
  5450. 1301.76 s [vector] span: OK
  5451. 1301.76 s [vector] +++ OK, passed 100 tests.
  5452. 1301.76 s [vector] break: OK
  5453. 1301.76 s [vector] +++ OK, passed 100 tests.
  5454. 1301.76 s [vector] spanR: OK
  5455. 1301.76 s [vector] +++ OK, passed 100 tests.
  5456. 1301.76 s [vector] breakR: OK
  5457. 1301.77 s [vector] +++ OK, passed 100 tests.
  5458. 1301.77 s [vector] groupBy: OK
  5459. 1301.77 s [vector] +++ OK, passed 100 tests.
  5460. 1301.77 s [vector] elem: OK
  5461. 1301.77 s [vector] +++ OK, passed 100 tests.
  5462. 1301.77 s [vector] notElem: OK
  5463. 1301.77 s [vector] +++ OK, passed 100 tests.
  5464. 1301.77 s [vector] find: OK
  5465. 1301.77 s [vector] +++ OK, passed 100 tests.
  5466. 1301.77 s [vector] findIndex: OK
  5467. 1301.77 s [vector] +++ OK, passed 100 tests.
  5468. 1301.78 s [vector] findIndexR: OK
  5469. 1301.78 s [vector] +++ OK, passed 100 tests.
  5470. 1301.78 s [vector] findIndices: OK
  5471. 1301.79 s [vector] +++ OK, passed 100 tests.
  5472. 1301.79 s [vector] elemIndex: OK
  5473. 1301.79 s [vector] +++ OK, passed 100 tests.
  5474. 1301.80 s [vector] elemIndices: OK
  5475. 1301.80 s [vector] +++ OK, passed 100 tests.
  5476. 1301.81 s [vector] foldl: OK
  5477. 1301.81 s [vector] +++ OK, passed 100 tests.
  5478. 1301.82 s [vector] foldl1: OK
  5479. 1301.82 s [vector] +++ OK, passed 100 tests; 20 discarded.
  5480. 1301.82 s [vector] foldl': OK
  5481. 1301.82 s [vector] +++ OK, passed 100 tests.
  5482. 1301.82 s [vector] foldl1': OK
  5483. 1301.82 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5484. 1301.82 s [vector] foldr: OK
  5485. 1301.82 s [vector] +++ OK, passed 100 tests.
  5486. 1301.83 s [vector] foldr1: OK
  5487. 1301.84 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5488. 1301.84 s [vector] foldr': OK
  5489. 1301.84 s [vector] +++ OK, passed 100 tests.
  5490. 1301.84 s [vector] foldr1': OK
  5491. 1301.84 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5492. 1301.84 s [vector] ifoldl: OK
  5493. 1301.84 s [vector] +++ OK, passed 100 tests.
  5494. 1301.84 s [vector] ifoldl': OK
  5495. 1301.84 s [vector] +++ OK, passed 100 tests.
  5496. 1301.84 s [vector] ifoldr: OK
  5497. 1301.84 s [vector] +++ OK, passed 100 tests.
  5498. 1301.85 s [vector] ifoldr': OK
  5499. 1301.85 s [vector] +++ OK, passed 100 tests.
  5500. 1301.86 s [vector] ifoldM: OK
  5501. 1301.86 s [vector] +++ OK, passed 100 tests.
  5502. 1301.86 s [vector] ifoldM': OK
  5503. 1301.87 s [vector] +++ OK, passed 100 tests.
  5504. 1301.87 s [vector] ifoldM_: OK (0.02s)
  5505. 1301.87 s [vector] +++ OK, passed 100 tests.
  5506. 1301.87 s [vector] ifoldM'_: OK (0.02s)
  5507. 1301.87 s [vector] +++ OK, passed 100 tests.
  5508. 1301.87 s [vector] all: OK
  5509. 1301.87 s [vector] +++ OK, passed 100 tests.
  5510. 1301.87 s [vector] any: OK
  5511. 1301.87 s [vector] +++ OK, passed 100 tests.
  5512. 1301.87 s [vector] prescanl: OK
  5513. 1301.87 s [vector] +++ OK, passed 100 tests.
  5514. 1301.88 s [vector] prescanl': OK
  5515. 1301.88 s [vector] +++ OK, passed 100 tests.
  5516. 1301.88 s [vector] postscanl: OK
  5517. 1301.88 s [vector] +++ OK, passed 100 tests.
  5518. 1301.88 s [vector] postscanl': OK
  5519. 1301.88 s [vector] +++ OK, passed 100 tests.
  5520. 1301.88 s [vector] scanl: OK
  5521. 1301.88 s [vector] +++ OK, passed 100 tests.
  5522. 1301.89 s [vector] scanl': OK
  5523. 1301.89 s [vector] +++ OK, passed 100 tests.
  5524. 1301.89 s [vector] scanl1: OK
  5525. 1301.89 s [vector] +++ OK, passed 100 tests.
  5526. 1301.89 s [vector] scanl1': OK
  5527. 1301.89 s [vector] +++ OK, passed 100 tests.
  5528. 1301.89 s [vector] iscanl: OK
  5529. 1301.89 s [vector] +++ OK, passed 100 tests.
  5530. 1301.89 s [vector] iscanl': OK
  5531. 1301.89 s [vector] +++ OK, passed 100 tests.
  5532. 1301.89 s [vector] prescanr: OK
  5533. 1301.89 s [vector] +++ OK, passed 100 tests.
  5534. 1301.89 s [vector] prescanr': OK
  5535. 1301.89 s [vector] +++ OK, passed 100 tests.
  5536. 1301.89 s [vector] postscanr: OK
  5537. 1301.89 s [vector] +++ OK, passed 100 tests.
  5538. 1301.89 s [vector] postscanr': OK
  5539. 1301.89 s [vector] +++ OK, passed 100 tests.
  5540. 1301.89 s [vector] scanr: OK
  5541. 1301.89 s [vector] +++ OK, passed 100 tests.
  5542. 1301.89 s [vector] scanr': OK
  5543. 1301.89 s [vector] +++ OK, passed 100 tests.
  5544. 1301.89 s [vector] scanr1: OK
  5545. 1301.89 s [vector] +++ OK, passed 100 tests.
  5546. 1301.89 s [vector] scanr1': OK
  5547. 1301.89 s [vector] +++ OK, passed 100 tests.
  5548. 1301.89 s [vector] iscanr: OK
  5549. 1301.89 s [vector] +++ OK, passed 100 tests.
  5550. 1301.89 s [vector] iscanr': OK
  5551. 1301.89 s [vector] +++ OK, passed 100 tests.
  5552. 1301.89 s [vector] mut_read: OK
  5553. 1301.90 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5554. 1301.90 s [vector] mut_write: OK
  5555. 1301.90 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5556. 1301.91 s [vector] mut_modify: OK
  5557. 1301.91 s [vector] +++ OK, passed 100 tests; 12 discarded.
  5558. 1301.92 s [vector] mut_generate: OK
  5559. 1301.92 s [vector] +++ OK, passed 100 tests.
  5560. 1301.92 s [vector] mut_generateM: OK (0.01s)
  5561. 1301.92 s [vector] +++ OK, passed 100 tests.
  5562. 1301.93 s [vector] mut_mapM_: OK (0.02s)
  5563. 1301.94 s [vector] +++ OK, passed 100 tests.
  5564. 1301.95 s [vector] mut_imapM_: OK (0.02s)
  5565. 1301.96 s [vector] +++ OK, passed 100 tests.
  5566. 1301.97 s [vector] mut_forM_: OK (0.02s)
  5567. 1301.98 s [vector] +++ OK, passed 100 tests.
  5568. 1301.98 s [vector] mut_iforM_: OK (0.02s)
  5569. 1301.98 s [vector] +++ OK, passed 100 tests.
  5570. 1301.99 s [vector] mut_foldr: OK
  5571. 1301.99 s [vector] +++ OK, passed 100 tests.
  5572. 1301.99 s [vector] mut_foldr': OK
  5573. 1301.99 s [vector] +++ OK, passed 100 tests.
  5574. 1301.99 s [vector] mut_foldl: OK
  5575. 1301.99 s [vector] +++ OK, passed 100 tests.
  5576. 1301.99 s [vector] mut_foldl': OK
  5577. 1301.99 s [vector] +++ OK, passed 100 tests.
  5578. 1302.00 s [vector] mut_ifoldr: OK
  5579. 1302.00 s [vector] +++ OK, passed 100 tests.
  5580. 1302.00 s [vector] mut_ifoldr': OK
  5581. 1302.00 s [vector] +++ OK, passed 100 tests.
  5582. 1302.00 s [vector] mut_ifoldl: OK
  5583. 1302.00 s [vector] +++ OK, passed 100 tests.
  5584. 1302.00 s [vector] mut_ifoldl': OK
  5585. 1302.00 s [vector] +++ OK, passed 100 tests.
  5586. 1302.01 s [vector] mut_foldM: OK
  5587. 1302.01 s [vector] +++ OK, passed 100 tests.
  5588. 1302.01 s [vector] mut_foldM': OK
  5589. 1302.01 s [vector] +++ OK, passed 100 tests.
  5590. 1302.01 s [vector] mut_foldrM: OK
  5591. 1302.01 s [vector] +++ OK, passed 100 tests.
  5592. 1302.01 s [vector] mut_foldrM': OK
  5593. 1302.01 s [vector] +++ OK, passed 100 tests.
  5594. 1302.02 s [vector] mut_ifoldM: OK
  5595. 1302.03 s [vector] +++ OK, passed 100 tests.
  5596. 1302.03 s [vector] mut_ifoldM': OK
  5597. 1302.03 s [vector] +++ OK, passed 100 tests.
  5598. 1302.03 s [vector] mut_ifoldrM: OK
  5599. 1302.03 s [vector] +++ OK, passed 100 tests.
  5600. 1302.03 s [vector] mut_ifoldrM': OK
  5601. 1302.03 s [vector] +++ OK, passed 100 tests.
  5602. 1302.03 s [vector] compare: OK
  5603. 1302.03 s [vector] +++ OK, passed 100 tests.
  5604. 1302.03 s [vector] maximum: OK
  5605. 1302.03 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5606. 1302.03 s [vector] minimum: OK
  5607. 1302.03 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5608. 1302.03 s [vector] minIndex: OK
  5609. 1302.03 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5610. 1302.03 s [vector] maxIndex: OK
  5611. 1302.03 s [vector] +++ OK, passed 100 tests; 12 discarded.
  5612. 1302.03 s [vector] maximumBy: OK
  5613. 1302.03 s [vector] +++ OK, passed 100 tests; 11 discarded.
  5614. 1302.03 s [vector] minimumBy: OK
  5615. 1302.03 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5616. 1302.03 s [vector] maximumOn: OK
  5617. 1302.04 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5618. 1302.04 s [vector] minimumOn: OK
  5619. 1302.04 s [vector] +++ OK, passed 100 tests; 12 discarded.
  5620. 1302.04 s [vector] maxIndexBy: OK
  5621. 1302.04 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5622. 1302.04 s [vector] minIndexBy: OK
  5623. 1302.04 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5624. 1302.04 s [vector] ListFirstMaxIndexWins: OK
  5625. 1302.04 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5626. 1302.04 s [vector] FalseListFirstMaxIndexWins: OK
  5627. 1302.04 s [vector] +++ OK, failed as expected. (after 1 test):
  5628. 1302.04 s [vector] Exception:
  5629. 1302.04 s [vector] Prelude.foldr1: empty list
  5630. 1302.04 s [vector] CallStack (from HasCallStack):
  5631. 1302.04 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  5632. 1302.04 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  5633. 1302.04 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  5634. 1302.04 s [vector] []
  5635. 1302.04 s [vector] zip: OK
  5636. 1302.04 s [vector] +++ OK, passed 100 tests.
  5637. 1302.04 s [vector] zip3: OK
  5638. 1302.04 s [vector] +++ OK, passed 100 tests.
  5639. 1302.04 s [vector] unzip: OK
  5640. 1302.04 s [vector] +++ OK, passed 100 tests.
  5641. 1302.04 s [vector] unzip3: OK
  5642. 1302.04 s [vector] +++ OK, passed 100 tests.
  5643. 1302.06 s [vector] indexed: OK
  5644. 1302.06 s [vector] +++ OK, passed 100 tests.
  5645. 1302.06 s [vector] update: OK
  5646. 1302.06 s [vector] +++ OK, passed 100 tests.
  5647. 1302.06 s [vector] concat: OK (0.01s)
  5648. 1302.06 s [vector] +++ OK, passed 100 tests.
  5649. 1302.06 s [vector] mempty: OK
  5650. 1302.06 s [vector] +++ OK, passed 100 tests.
  5651. 1302.06 s [vector] mappend: OK
  5652. 1302.07 s [vector] +++ OK, passed 100 tests.
  5653. 1302.07 s [vector] mconcat: OK
  5654. 1302.07 s [vector] +++ OK, passed 100 tests.
  5655. 1302.07 s [vector] fmap: OK
  5656. 1302.09 s [vector] +++ OK, passed 100 tests.
  5657. 1302.09 s [vector] return: OK
  5658. 1302.09 s [vector] +++ OK, passed 100 tests.
  5659. 1302.09 s [vector] bind: OK (0.02s)
  5660. 1302.09 s [vector] +++ OK, passed 100 tests.
  5661. 1302.09 s [vector] mzip: OK
  5662. 1302.09 s [vector] +++ OK, passed 100 tests.
  5663. 1302.10 s [vector] munzip: OK
  5664. 1302.11 s [vector] +++ OK, passed 100 tests.
  5665. 1302.12 s [vector] applicative_pure: OK
  5666. 1302.12 s [vector] +++ OK, passed 100 tests.
  5667. 1302.13 s [vector] applicative_appl: OK (0.03s)
  5668. 1302.13 s [vector] +++ OK, passed 100 tests.
  5669. 1302.13 s [vector] alternative_empty: OK
  5670. 1302.14 s [vector] +++ OK, passed 100 tests.
  5671. 1302.14 s [vector] alternative_or: OK
  5672. 1302.14 s [vector] +++ OK, passed 100 tests.
  5673. 1302.15 s [vector] sequence: OK (0.03s)
  5674. 1302.16 s [vector] +++ OK, passed 100 tests.
  5675. 1302.17 s [vector] sequence_: OK (0.02s)
  5676. 1302.17 s [vector] +++ OK, passed 100 tests.
  5677. 1302.17 s [vector] glength: OK
  5678. 1302.17 s [vector] +++ OK, passed 100 tests.
  5679. 1302.17 s [vector] sum: OK
  5680. 1302.17 s [vector] +++ OK, passed 100 tests.
  5681. 1302.17 s [vector] product: OK
  5682. 1302.17 s [vector] +++ OK, passed 100 tests.
  5683. 1302.17 s [vector] enumFromN: OK
  5684. 1302.17 s [vector] +++ OK, passed 100 tests.
  5685. 1302.18 s [vector] enumFromThenN: OK
  5686. 1302.18 s [vector] +++ OK, passed 100 tests.
  5687. 1302.18 s [vector] enumFromTo: OK
  5688. 1302.18 s [vector] +++ OK, passed 100 tests.
  5689. 1302.18 s [vector] enumFromThenTo: OK
  5690. 1302.18 s [vector] +++ OK, passed 100 tests; 12 discarded.
  5691. 1302.18 s [vector] unstream
  5692. 1302.18 s [vector] unstream == vunstream (exact): OK
  5693. 1302.18 s [vector] +++ OK, passed 100 tests.
  5694. 1302.18 s [vector] unstream == vunstream (unknown): OK
  5695. 1302.18 s [vector] +++ OK, passed 100 tests.
  5696. 1302.18 s [vector] unstreamR ~= vunstream (exact): OK
  5697. 1302.18 s [vector] +++ OK, passed 100 tests.
  5698. 1302.18 s [vector] unstreamR ~= vunstream (unknown): OK
  5699. 1302.18 s [vector] +++ OK, passed 100 tests.
  5700. 1302.18 s [vector] Tests.Vector.Primitive
  5701. 1302.18 s [vector] Int
  5702. 1302.18 s [vector] fromList.toList == id: OK
  5703. 1302.18 s [vector] +++ OK, passed 100 tests.
  5704. 1302.18 s [vector] toList.fromList == id: OK
  5705. 1302.18 s [vector] +++ OK, passed 100 tests.
  5706. 1302.18 s [vector] unstream.stream == id: OK
  5707. 1302.18 s [vector] +++ OK, passed 100 tests.
  5708. 1302.18 s [vector] stream.unstream == id: OK
  5709. 1302.18 s [vector] +++ OK, passed 100 tests.
  5710. 1302.19 s [vector] eq: OK
  5711. 1302.19 s [vector] +++ OK, passed 100 tests.
  5712. 1302.19 s [vector] length: OK
  5713. 1302.19 s [vector] +++ OK, passed 100 tests.
  5714. 1302.19 s [vector] null: OK
  5715. 1302.19 s [vector] +++ OK, passed 100 tests.
  5716. 1302.19 s [vector] index: OK
  5717. 1302.19 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5718. 1302.19 s [vector] safeIndex: OK
  5719. 1302.19 s [vector] +++ OK, passed 100 tests.
  5720. 1302.19 s [vector] head: OK
  5721. 1302.19 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5722. 1302.19 s [vector] last: OK
  5723. 1302.19 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5724. 1302.19 s [vector] unsafeIndex: OK
  5725. 1302.19 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5726. 1302.19 s [vector] unsafeHead: OK
  5727. 1302.19 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5728. 1302.19 s [vector] unsafeLast: OK
  5729. 1302.19 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5730. 1302.19 s [vector] slice: OK
  5731. 1302.19 s [vector] +++ OK, passed 100 tests.
  5732. 1302.19 s [vector] init: OK
  5733. 1302.19 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5734. 1302.19 s [vector] tail: OK
  5735. 1302.19 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5736. 1302.19 s [vector] take: OK
  5737. 1302.19 s [vector] +++ OK, passed 100 tests.
  5738. 1302.19 s [vector] drop: OK
  5739. 1302.19 s [vector] +++ OK, passed 100 tests.
  5740. 1302.19 s [vector] splitAt: OK
  5741. 1302.19 s [vector] +++ OK, passed 100 tests.
  5742. 1302.19 s [vector] empty: OK
  5743. 1302.19 s [vector] +++ OK, passed 100 tests.
  5744. 1302.19 s [vector] singleton: OK
  5745. 1302.19 s [vector] +++ OK, passed 100 tests.
  5746. 1302.19 s [vector] replicate: OK
  5747. 1302.20 s [vector] +++ OK, passed 100 tests.
  5748. 1302.20 s [vector] generate: OK
  5749. 1302.20 s [vector] +++ OK, passed 100 tests.
  5750. 1302.20 s [vector] iterateN: OK
  5751. 1302.21 s [vector] +++ OK, passed 100 tests.
  5752. 1302.23 s [vector] iterateNM: OK (0.04s)
  5753. 1302.23 s [vector] +++ OK, passed 100 tests.
  5754. 1302.25 s [vector] generateM: OK (0.02s)
  5755. 1302.26 s [vector] +++ OK, passed 100 tests.
  5756. 1302.27 s [vector] replicateM: OK
  5757. 1302.27 s [vector] +++ OK, passed 100 tests.
  5758. 1302.27 s [vector] create: OK
  5759. 1302.27 s [vector] +++ OK, passed 100 tests.
  5760. 1302.27 s [vector] createT: OK
  5761. 1302.27 s [vector] +++ OK, passed 100 tests.
  5762. 1302.27 s [vector] unfoldr: OK
  5763. 1302.27 s [vector] +++ OK, passed 100 tests.
  5764. 1302.27 s [vector] unfoldrN: OK
  5765. 1302.27 s [vector] +++ OK, passed 100 tests.
  5766. 1302.27 s [vector] unfoldrExactN: OK
  5767. 1302.27 s [vector] +++ OK, passed 100 tests.
  5768. 1302.27 s [vector] unfoldrM: OK
  5769. 1302.27 s [vector] +++ OK, passed 100 tests.
  5770. 1302.29 s [vector] unfoldrNM: OK (0.01s)
  5771. 1302.29 s [vector] +++ OK, passed 100 tests.
  5772. 1302.34 s [vector] unfoldrExactNM: OK (0.04s)
  5773. 1302.34 s [vector] +++ OK, passed 100 tests.
  5774. 1302.34 s [vector] constructN: OK (0.01s)
  5775. 1302.34 s [vector] +++ OK, passed 100 tests.
  5776. 1302.34 s [vector] constructrN: OK
  5777. 1302.34 s [vector] +++ OK, passed 100 tests.
  5778. 1302.34 s [vector] cons: OK
  5779. 1302.34 s [vector] +++ OK, passed 100 tests.
  5780. 1302.34 s [vector] snoc: OK
  5781. 1302.35 s [vector] +++ OK, passed 100 tests.
  5782. 1302.36 s [vector] append: OK
  5783. 1302.36 s [vector] +++ OK, passed 100 tests.
  5784. 1302.36 s [vector] concat: OK (0.02s)
  5785. 1302.36 s [vector] +++ OK, passed 100 tests.
  5786. 1302.37 s [vector] force: OK
  5787. 1302.37 s [vector] +++ OK, passed 100 tests.
  5788. 1302.37 s [vector] upd: OK
  5789. 1302.37 s [vector] +++ OK, passed 100 tests.
  5790. 1302.37 s [vector] accum: OK
  5791. 1302.37 s [vector] +++ OK, passed 100 tests.
  5792. 1302.37 s [vector] reverse: OK
  5793. 1302.37 s [vector] +++ OK, passed 100 tests.
  5794. 1302.37 s [vector] backpermute: OK
  5795. 1302.37 s [vector] +++ OK, passed 100 tests.
  5796. 1302.38 s [vector] map: OK
  5797. 1302.38 s [vector] +++ OK, passed 100 tests.
  5798. 1302.38 s [vector] imap: OK
  5799. 1302.38 s [vector] +++ OK, passed 100 tests.
  5800. 1302.38 s [vector] concatMap: OK
  5801. 1302.38 s [vector] +++ OK, passed 100 tests.
  5802. 1302.39 s [vector] mapM: OK
  5803. 1302.40 s [vector] +++ OK, passed 100 tests.
  5804. 1302.40 s [vector] mapM_: OK (0.02s)
  5805. 1302.41 s [vector] +++ OK, passed 100 tests.
  5806. 1302.41 s [vector] forM: OK
  5807. 1302.42 s [vector] +++ OK, passed 100 tests.
  5808. 1302.42 s [vector] forM_: OK (0.02s)
  5809. 1302.42 s [vector] +++ OK, passed 100 tests.
  5810. 1302.42 s [vector] imapM: OK
  5811. 1302.42 s [vector] +++ OK, passed 100 tests.
  5812. 1302.44 s [vector] imapM_: OK
  5813. 1302.44 s [vector] +++ OK, passed 100 tests.
  5814. 1302.44 s [vector] zipWith: OK
  5815. 1302.44 s [vector] +++ OK, passed 100 tests.
  5816. 1302.45 s [vector] zipWith3: OK
  5817. 1302.45 s [vector] +++ OK, passed 100 tests.
  5818. 1302.45 s [vector] izipWith: OK
  5819. 1302.45 s [vector] +++ OK, passed 100 tests.
  5820. 1302.45 s [vector] izipWith3: OK
  5821. 1302.45 s [vector] +++ OK, passed 100 tests.
  5822. 1302.47 s [vector] izipWithM: OK
  5823. 1302.47 s [vector] +++ OK, passed 100 tests.
  5824. 1302.47 s [vector] izipWithM_: OK (0.01s)
  5825. 1302.47 s [vector] +++ OK, passed 100 tests.
  5826. 1302.48 s [vector] zipWithM: OK
  5827. 1302.48 s [vector] +++ OK, passed 100 tests.
  5828. 1302.49 s [vector] zipWithM_: OK (0.01s)
  5829. 1302.49 s [vector] +++ OK, passed 100 tests.
  5830. 1302.50 s [vector] filter: OK
  5831. 1302.50 s [vector] +++ OK, passed 100 tests.
  5832. 1302.50 s [vector] ifilter: OK
  5833. 1302.50 s [vector] +++ OK, passed 100 tests.
  5834. 1302.51 s [vector] filterM: OK (0.02s)
  5835. 1302.52 s [vector] +++ OK, passed 100 tests.
  5836. 1302.52 s [vector] uniq: OK
  5837. 1302.52 s [vector] +++ OK, passed 100 tests.
  5838. 1302.52 s [vector] mapMaybe: OK
  5839. 1302.52 s [vector] +++ OK, passed 100 tests.
  5840. 1302.52 s [vector] imapMaybe: OK
  5841. 1302.53 s [vector] +++ OK, passed 100 tests.
  5842. 1302.53 s [vector] takeWhile: OK
  5843. 1302.53 s [vector] +++ OK, passed 100 tests.
  5844. 1302.53 s [vector] dropWhile: OK
  5845. 1302.53 s [vector] +++ OK, passed 100 tests.
  5846. 1302.53 s [vector] partition: OK
  5847. 1302.53 s [vector] +++ OK, passed 100 tests.
  5848. 1302.53 s [vector] partitionWith: OK
  5849. 1302.53 s [vector] +++ OK, passed 100 tests.
  5850. 1302.53 s [vector] span: OK
  5851. 1302.53 s [vector] +++ OK, passed 100 tests.
  5852. 1302.53 s [vector] break: OK
  5853. 1302.53 s [vector] +++ OK, passed 100 tests.
  5854. 1302.53 s [vector] spanR: OK
  5855. 1302.53 s [vector] +++ OK, passed 100 tests.
  5856. 1302.53 s [vector] breakR: OK
  5857. 1302.53 s [vector] +++ OK, passed 100 tests.
  5858. 1302.53 s [vector] groupBy: OK
  5859. 1302.53 s [vector] +++ OK, passed 100 tests.
  5860. 1302.53 s [vector] elem: OK
  5861. 1302.54 s [vector] +++ OK, passed 100 tests.
  5862. 1302.54 s [vector] notElem: OK
  5863. 1302.54 s [vector] +++ OK, passed 100 tests.
  5864. 1302.54 s [vector] find: OK
  5865. 1302.54 s [vector] +++ OK, passed 100 tests.
  5866. 1302.55 s [vector] findIndex: OK
  5867. 1302.55 s [vector] +++ OK, passed 100 tests.
  5868. 1302.55 s [vector] findIndexR: OK
  5869. 1302.56 s [vector] +++ OK, passed 100 tests.
  5870. 1302.56 s [vector] findIndices: OK
  5871. 1302.56 s [vector] +++ OK, passed 100 tests.
  5872. 1302.57 s [vector] elemIndex: OK
  5873. 1302.57 s [vector] +++ OK, passed 100 tests.
  5874. 1302.57 s [vector] elemIndices: OK
  5875. 1302.57 s [vector] +++ OK, passed 100 tests.
  5876. 1302.57 s [vector] foldl: OK
  5877. 1302.57 s [vector] +++ OK, passed 100 tests.
  5878. 1302.57 s [vector] foldl1: OK
  5879. 1302.57 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5880. 1302.57 s [vector] foldl': OK
  5881. 1302.57 s [vector] +++ OK, passed 100 tests.
  5882. 1302.57 s [vector] foldl1': OK
  5883. 1302.57 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5884. 1302.57 s [vector] foldr: OK
  5885. 1302.57 s [vector] +++ OK, passed 100 tests.
  5886. 1302.57 s [vector] foldr1: OK
  5887. 1302.57 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5888. 1302.57 s [vector] foldr': OK
  5889. 1302.57 s [vector] +++ OK, passed 100 tests.
  5890. 1302.57 s [vector] foldr1': OK
  5891. 1302.57 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5892. 1302.57 s [vector] ifoldl: OK
  5893. 1302.57 s [vector] +++ OK, passed 100 tests.
  5894. 1302.57 s [vector] ifoldl': OK
  5895. 1302.58 s [vector] +++ OK, passed 100 tests.
  5896. 1302.58 s [vector] ifoldr: OK
  5897. 1302.58 s [vector] +++ OK, passed 100 tests.
  5898. 1302.58 s [vector] ifoldr': OK
  5899. 1302.58 s [vector] +++ OK, passed 100 tests.
  5900. 1302.59 s [vector] ifoldM: OK
  5901. 1302.60 s [vector] +++ OK, passed 100 tests.
  5902. 1302.60 s [vector] ifoldM': OK
  5903. 1302.60 s [vector] +++ OK, passed 100 tests.
  5904. 1302.62 s [vector] ifoldM_: OK (0.02s)
  5905. 1302.62 s [vector] +++ OK, passed 100 tests.
  5906. 1302.63 s [vector] ifoldM'_: OK (0.02s)
  5907. 1302.63 s [vector] +++ OK, passed 100 tests.
  5908. 1302.63 s [vector] all: OK
  5909. 1302.63 s [vector] +++ OK, passed 100 tests.
  5910. 1302.63 s [vector] any: OK
  5911. 1302.63 s [vector] +++ OK, passed 100 tests.
  5912. 1302.63 s [vector] prescanl: OK
  5913. 1302.63 s [vector] +++ OK, passed 100 tests.
  5914. 1302.63 s [vector] prescanl': OK
  5915. 1302.63 s [vector] +++ OK, passed 100 tests.
  5916. 1302.64 s [vector] postscanl: OK
  5917. 1302.64 s [vector] +++ OK, passed 100 tests.
  5918. 1302.64 s [vector] postscanl': OK
  5919. 1302.64 s [vector] +++ OK, passed 100 tests.
  5920. 1302.64 s [vector] scanl: OK
  5921. 1302.64 s [vector] +++ OK, passed 100 tests.
  5922. 1302.65 s [vector] scanl': OK
  5923. 1302.65 s [vector] +++ OK, passed 100 tests.
  5924. 1302.65 s [vector] scanl1: OK
  5925. 1302.65 s [vector] +++ OK, passed 100 tests.
  5926. 1302.65 s [vector] scanl1': OK
  5927. 1302.65 s [vector] +++ OK, passed 100 tests.
  5928. 1302.66 s [vector] iscanl: OK
  5929. 1302.66 s [vector] +++ OK, passed 100 tests.
  5930. 1302.67 s [vector] iscanl': OK
  5931. 1302.67 s [vector] +++ OK, passed 100 tests.
  5932. 1302.67 s [vector] prescanr: OK
  5933. 1302.67 s [vector] +++ OK, passed 100 tests.
  5934. 1302.67 s [vector] prescanr': OK
  5935. 1302.67 s [vector] +++ OK, passed 100 tests.
  5936. 1302.67 s [vector] postscanr: OK
  5937. 1302.67 s [vector] +++ OK, passed 100 tests.
  5938. 1302.67 s [vector] postscanr': OK
  5939. 1302.67 s [vector] +++ OK, passed 100 tests.
  5940. 1302.68 s [vector] scanr: OK
  5941. 1302.68 s [vector] +++ OK, passed 100 tests.
  5942. 1302.69 s [vector] scanr': OK
  5943. 1302.69 s [vector] +++ OK, passed 100 tests.
  5944. 1302.69 s [vector] scanr1: OK
  5945. 1302.69 s [vector] +++ OK, passed 100 tests.
  5946. 1302.69 s [vector] scanr1': OK
  5947. 1302.69 s [vector] +++ OK, passed 100 tests.
  5948. 1302.69 s [vector] iscanr: OK
  5949. 1302.69 s [vector] +++ OK, passed 100 tests.
  5950. 1302.70 s [vector] iscanr': OK
  5951. 1302.70 s [vector] +++ OK, passed 100 tests.
  5952. 1302.70 s [vector] mut_read: OK
  5953. 1302.70 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5954. 1302.70 s [vector] mut_write: OK
  5955. 1302.70 s [vector] +++ OK, passed 100 tests; 25 discarded.
  5956. 1302.70 s [vector] mut_modify: OK
  5957. 1302.70 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5958. 1302.71 s [vector] mut_generate: OK
  5959. 1302.71 s [vector] +++ OK, passed 100 tests.
  5960. 1302.73 s [vector] mut_generateM: OK (0.01s)
  5961. 1302.73 s [vector] +++ OK, passed 100 tests.
  5962. 1302.74 s [vector] mut_mapM_: OK (0.02s)
  5963. 1302.74 s [vector] +++ OK, passed 100 tests.
  5964. 1302.76 s [vector] mut_imapM_: OK (0.02s)
  5965. 1302.76 s [vector] +++ OK, passed 100 tests.
  5966. 1302.77 s [vector] mut_forM_: OK (0.02s)
  5967. 1302.77 s [vector] +++ OK, passed 100 tests.
  5968. 1302.79 s [vector] mut_iforM_: OK (0.02s)
  5969. 1302.79 s [vector] +++ OK, passed 100 tests.
  5970. 1302.79 s [vector] mut_foldr: OK
  5971. 1302.79 s [vector] +++ OK, passed 100 tests.
  5972. 1302.80 s [vector] mut_foldr': OK
  5973. 1302.80 s [vector] +++ OK, passed 100 tests.
  5974. 1302.80 s [vector] mut_foldl: OK
  5975. 1302.81 s [vector] +++ OK, passed 100 tests.
  5976. 1302.81 s [vector] mut_foldl': OK
  5977. 1302.81 s [vector] +++ OK, passed 100 tests.
  5978. 1302.82 s [vector] mut_ifoldr: OK
  5979. 1302.82 s [vector] +++ OK, passed 100 tests.
  5980. 1302.82 s [vector] mut_ifoldr': OK
  5981. 1302.82 s [vector] +++ OK, passed 100 tests.
  5982. 1302.83 s [vector] mut_ifoldl: OK
  5983. 1302.83 s [vector] +++ OK, passed 100 tests.
  5984. 1302.83 s [vector] mut_ifoldl': OK
  5985. 1302.84 s [vector] +++ OK, passed 100 tests.
  5986. 1302.84 s [vector] mut_foldM: OK
  5987. 1302.84 s [vector] +++ OK, passed 100 tests.
  5988. 1302.84 s [vector] mut_foldM': OK
  5989. 1302.84 s [vector] +++ OK, passed 100 tests.
  5990. 1302.84 s [vector] mut_foldrM: OK
  5991. 1302.84 s [vector] +++ OK, passed 100 tests.
  5992. 1302.84 s [vector] mut_foldrM': OK
  5993. 1302.84 s [vector] +++ OK, passed 100 tests.
  5994. 1302.84 s [vector] mut_ifoldM: OK
  5995. 1302.84 s [vector] +++ OK, passed 100 tests.
  5996. 1302.84 s [vector] mut_ifoldM': OK
  5997. 1302.84 s [vector] +++ OK, passed 100 tests.
  5998. 1302.84 s [vector] mut_ifoldrM: OK
  5999. 1302.84 s [vector] +++ OK, passed 100 tests.
  6000. 1302.84 s [vector] mut_ifoldrM': OK
  6001. 1302.84 s [vector] +++ OK, passed 100 tests.
  6002. 1302.84 s [vector] compare: OK
  6003. 1302.84 s [vector] +++ OK, passed 100 tests.
  6004. 1302.84 s [vector] maximum: OK
  6005. 1302.84 s [vector] +++ OK, passed 100 tests; 23 discarded.
  6006. 1302.84 s [vector] minimum: OK
  6007. 1302.84 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6008. 1302.84 s [vector] minIndex: OK
  6009. 1302.84 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6010. 1302.84 s [vector] maxIndex: OK
  6011. 1302.84 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6012. 1302.84 s [vector] maximumBy: OK
  6013. 1302.84 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6014. 1302.84 s [vector] minimumBy: OK
  6015. 1302.84 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6016. 1302.84 s [vector] maximumOn: OK
  6017. 1302.84 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6018. 1302.84 s [vector] minimumOn: OK
  6019. 1302.84 s [vector] +++ OK, passed 100 tests; 11 discarded.
  6020. 1302.84 s [vector] maxIndexBy: OK
  6021. 1302.84 s [vector] +++ OK, passed 100 tests; 11 discarded.
  6022. 1302.84 s [vector] minIndexBy: OK
  6023. 1302.84 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6024. 1302.85 s [vector] ListFirstMaxIndexWins: OK
  6025. 1302.85 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6026. 1302.85 s [vector] FalseListFirstMaxIndexWins: OK
  6027. 1302.85 s [vector] +++ OK, failed as expected. (after 1 test):
  6028. 1302.85 s [vector] Exception:
  6029. 1302.85 s [vector] Prelude.foldr1: empty list
  6030. 1302.85 s [vector] CallStack (from HasCallStack):
  6031. 1302.85 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  6032. 1302.85 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  6033. 1302.85 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  6034. 1302.85 s [vector] []
  6035. 1302.85 s [vector] mempty: OK
  6036. 1302.85 s [vector] +++ OK, passed 100 tests.
  6037. 1302.85 s [vector] mappend: OK
  6038. 1302.85 s [vector] +++ OK, passed 100 tests.
  6039. 1302.87 s [vector] mconcat: OK (0.01s)
  6040. 1302.87 s [vector] +++ OK, passed 100 tests.
  6041. 1302.87 s [vector] glength: OK
  6042. 1302.87 s [vector] +++ OK, passed 100 tests.
  6043. 1302.87 s [vector] sum: OK
  6044. 1302.87 s [vector] +++ OK, passed 100 tests.
  6045. 1302.87 s [vector] product: OK
  6046. 1302.87 s [vector] +++ OK, passed 100 tests.
  6047. 1302.87 s [vector] enumFromN: OK
  6048. 1302.87 s [vector] +++ OK, passed 100 tests.
  6049. 1302.87 s [vector] enumFromThenN: OK
  6050. 1302.87 s [vector] +++ OK, passed 100 tests.
  6051. 1302.88 s [vector] enumFromTo: OK
  6052. 1302.88 s [vector] +++ OK, passed 100 tests.
  6053. 1302.88 s [vector] enumFromThenTo: OK
  6054. 1302.88 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6055. 1302.88 s [vector] Double
  6056. 1302.88 s [vector] fromList.toList == id: OK
  6057. 1302.88 s [vector] +++ OK, passed 100 tests.
  6058. 1302.88 s [vector] toList.fromList == id: OK
  6059. 1302.88 s [vector] +++ OK, passed 100 tests.
  6060. 1302.88 s [vector] unstream.stream == id: OK
  6061. 1302.88 s [vector] +++ OK, passed 100 tests.
  6062. 1302.89 s [vector] stream.unstream == id: OK
  6063. 1302.89 s [vector] +++ OK, passed 100 tests.
  6064. 1302.89 s [vector] eq: OK
  6065. 1302.89 s [vector] +++ OK, passed 100 tests.
  6066. 1302.89 s [vector] length: OK
  6067. 1302.89 s [vector] +++ OK, passed 100 tests.
  6068. 1302.89 s [vector] null: OK
  6069. 1302.89 s [vector] +++ OK, passed 100 tests.
  6070. 1302.89 s [vector] index: OK
  6071. 1302.89 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6072. 1302.89 s [vector] safeIndex: OK
  6073. 1302.89 s [vector] +++ OK, passed 100 tests.
  6074. 1302.89 s [vector] head: OK
  6075. 1302.89 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6076. 1302.89 s [vector] last: OK
  6077. 1302.89 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6078. 1302.89 s [vector] unsafeIndex: OK
  6079. 1302.89 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6080. 1302.89 s [vector] unsafeHead: OK
  6081. 1302.89 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6082. 1302.89 s [vector] unsafeLast: OK
  6083. 1302.89 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6084. 1302.89 s [vector] slice: OK
  6085. 1302.89 s [vector] +++ OK, passed 100 tests.
  6086. 1302.89 s [vector] init: OK
  6087. 1302.89 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6088. 1302.89 s [vector] tail: OK
  6089. 1302.89 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6090. 1302.89 s [vector] take: OK
  6091. 1302.89 s [vector] +++ OK, passed 100 tests.
  6092. 1302.89 s [vector] drop: OK
  6093. 1302.89 s [vector] +++ OK, passed 100 tests.
  6094. 1302.89 s [vector] splitAt: OK
  6095. 1302.89 s [vector] +++ OK, passed 100 tests.
  6096. 1302.89 s [vector] empty: OK
  6097. 1302.89 s [vector] +++ OK, passed 100 tests.
  6098. 1302.89 s [vector] singleton: OK
  6099. 1302.89 s [vector] +++ OK, passed 100 tests.
  6100. 1302.89 s [vector] replicate: OK
  6101. 1302.89 s [vector] +++ OK, passed 100 tests.
  6102. 1302.89 s [vector] generate: OK
  6103. 1302.90 s [vector] +++ OK, passed 100 tests.
  6104. 1302.90 s [vector] iterateN: OK
  6105. 1302.90 s [vector] +++ OK, passed 100 tests.
  6106. 1302.94 s [vector] iterateNM: OK (0.02s)
  6107. 1302.94 s [vector] +++ OK, passed 100 tests.
  6108. 1302.95 s [vector] generateM: OK (0.02s)
  6109. 1302.95 s [vector] +++ OK, passed 100 tests.
  6110. 1302.95 s [vector] replicateM: OK
  6111. 1302.95 s [vector] +++ OK, passed 100 tests.
  6112. 1302.95 s [vector] create: OK
  6113. 1302.95 s [vector] +++ OK, passed 100 tests.
  6114. 1302.95 s [vector] createT: OK
  6115. 1302.95 s [vector] +++ OK, passed 100 tests.
  6116. 1302.95 s [vector] unfoldr: OK
  6117. 1302.95 s [vector] +++ OK, passed 100 tests.
  6118. 1302.95 s [vector] unfoldrN: OK
  6119. 1302.95 s [vector] +++ OK, passed 100 tests.
  6120. 1302.95 s [vector] unfoldrExactN: OK
  6121. 1302.95 s [vector] +++ OK, passed 100 tests.
  6122. 1302.95 s [vector] unfoldrM: OK
  6123. 1302.96 s [vector] +++ OK, passed 100 tests.
  6124. 1302.96 s [vector] unfoldrNM: OK
  6125. 1302.96 s [vector] +++ OK, passed 100 tests.
  6126. 1303.01 s [vector] unfoldrExactNM: OK (0.04s)
  6127. 1303.01 s [vector] +++ OK, passed 100 tests.
  6128. 1303.02 s [vector] constructN: OK (0.01s)
  6129. 1303.02 s [vector] +++ OK, passed 100 tests.
  6130. 1303.03 s [vector] constructrN: OK (0.02s)
  6131. 1303.03 s [vector] +++ OK, passed 100 tests.
  6132. 1303.03 s [vector] cons: OK
  6133. 1303.03 s [vector] +++ OK, passed 100 tests.
  6134. 1303.03 s [vector] snoc: OK
  6135. 1303.03 s [vector] +++ OK, passed 100 tests.
  6136. 1303.04 s [vector] append: OK
  6137. 1303.04 s [vector] +++ OK, passed 100 tests.
  6138. 1303.06 s [vector] concat: OK (0.02s)
  6139. 1303.06 s [vector] +++ OK, passed 100 tests.
  6140. 1303.06 s [vector] force: OK
  6141. 1303.06 s [vector] +++ OK, passed 100 tests.
  6142. 1303.07 s [vector] upd: OK
  6143. 1303.07 s [vector] +++ OK, passed 100 tests.
  6144. 1303.07 s [vector] accum: OK (0.02s)
  6145. 1303.08 s [vector] +++ OK, passed 100 tests.
  6146. 1303.08 s [vector] reverse: OK
  6147. 1303.08 s [vector] +++ OK, passed 100 tests.
  6148. 1303.09 s [vector] backpermute: OK
  6149. 1303.09 s [vector] +++ OK, passed 100 tests.
  6150. 1303.10 s [vector] map: OK
  6151. 1303.11 s [vector] +++ OK, passed 100 tests.
  6152. 1303.11 s [vector] imap: OK
  6153. 1303.11 s [vector] +++ OK, passed 100 tests.
  6154. 1303.13 s [vector] concatMap: OK
  6155. 1303.13 s [vector] +++ OK, passed 100 tests.
  6156. 1303.13 s [vector] mapM: OK (0.01s)
  6157. 1303.13 s [vector] +++ OK, passed 100 tests.
  6158. 1303.17 s [vector] mapM_: OK (0.06s)
  6159. 1303.18 s [vector] +++ OK, passed 100 tests.
  6160. 1303.18 s [vector] forM: OK (0.01s)
  6161. 1303.18 s [vector] +++ OK, passed 100 tests.
  6162. 1303.25 s [vector] forM_: OK (0.04s)
  6163. 1303.25 s [vector] +++ OK, passed 100 tests.
  6164. 1303.25 s [vector] imapM: OK (0.02s)
  6165. 1303.25 s [vector] +++ OK, passed 100 tests.
  6166. 1303.29 s [vector] imapM_: OK (0.04s)
  6167. 1303.29 s [vector] +++ OK, passed 100 tests.
  6168. 1303.31 s [vector] zipWith: OK (0.01s)
  6169. 1303.32 s [vector] +++ OK, passed 100 tests.
  6170. 1303.33 s [vector] zipWith3: OK (0.01s)
  6171. 1303.34 s [vector] +++ OK, passed 100 tests.
  6172. 1303.35 s [vector] izipWith: OK (0.01s)
  6173. 1303.35 s [vector] +++ OK, passed 100 tests.
  6174. 1303.36 s [vector] izipWith3: OK (0.01s)
  6175. 1303.36 s [vector] +++ OK, passed 100 tests.
  6176. 1303.36 s [vector] izipWithM: OK (0.01s)
  6177. 1303.36 s [vector] +++ OK, passed 100 tests.
  6178. 1303.40 s [vector] izipWithM_: OK (0.03s)
  6179. 1303.40 s [vector] +++ OK, passed 100 tests.
  6180. 1303.42 s [vector] zipWithM: OK (0.01s)
  6181. 1303.42 s [vector] +++ OK, passed 100 tests.
  6182. 1303.43 s [vector] zipWithM_: OK (0.03s)
  6183. 1303.43 s [vector] +++ OK, passed 100 tests.
  6184. 1303.44 s [vector] filter: OK
  6185. 1303.44 s [vector] +++ OK, passed 100 tests.
  6186. 1303.46 s [vector] ifilter: OK
  6187. 1303.46 s [vector] +++ OK, passed 100 tests.
  6188. 1303.50 s [vector] filterM: OK (0.05s)
  6189. 1303.50 s [vector] +++ OK, passed 100 tests.
  6190. 1303.50 s [vector] uniq: OK (0.01s)
  6191. 1303.50 s [vector] +++ OK, passed 100 tests.
  6192. 1303.51 s [vector] mapMaybe: OK
  6193. 1303.51 s [vector] +++ OK, passed 100 tests.
  6194. 1303.52 s [vector] imapMaybe: OK
  6195. 1303.52 s [vector] +++ OK, passed 100 tests.
  6196. 1303.52 s [vector] takeWhile: OK
  6197. 1303.52 s [vector] +++ OK, passed 100 tests.
  6198. 1303.53 s [vector] dropWhile: OK
  6199. 1303.53 s [vector] +++ OK, passed 100 tests.
  6200. 1303.53 s [vector] partition: OK
  6201. 1303.53 s [vector] +++ OK, passed 100 tests.
  6202. 1303.54 s [vector] partitionWith: OK
  6203. 1303.54 s [vector] +++ OK, passed 100 tests.
  6204. 1303.55 s [vector] span: OK
  6205. 1303.55 s [vector] +++ OK, passed 100 tests.
  6206. 1303.55 s [vector] break: OK
  6207. 1303.55 s [vector] +++ OK, passed 100 tests.
  6208. 1303.55 s [vector] spanR: OK
  6209. 1303.55 s [vector] +++ OK, passed 100 tests.
  6210. 1303.55 s [vector] breakR: OK
  6211. 1303.55 s [vector] +++ OK, passed 100 tests.
  6212. 1303.56 s [vector] groupBy: OK (0.01s)
  6213. 1303.56 s [vector] +++ OK, passed 100 tests.
  6214. 1303.56 s [vector] elem: OK
  6215. 1303.56 s [vector] +++ OK, passed 100 tests.
  6216. 1303.56 s [vector] notElem: OK
  6217. 1303.56 s [vector] +++ OK, passed 100 tests.
  6218. 1303.56 s [vector] find: OK
  6219. 1303.56 s [vector] +++ OK, passed 100 tests.
  6220. 1303.56 s [vector] findIndex: OK
  6221. 1303.56 s [vector] +++ OK, passed 100 tests.
  6222. 1303.57 s [vector] findIndexR: OK
  6223. 1303.57 s [vector] +++ OK, passed 100 tests.
  6224. 1303.57 s [vector] findIndices: OK
  6225. 1303.57 s [vector] +++ OK, passed 100 tests.
  6226. 1303.58 s [vector] elemIndex: OK
  6227. 1303.58 s [vector] +++ OK, passed 100 tests.
  6228. 1303.58 s [vector] elemIndices: OK
  6229. 1303.58 s [vector] +++ OK, passed 100 tests.
  6230. 1303.60 s [vector] foldl: OK (0.01s)
  6231. 1303.60 s [vector] +++ OK, passed 100 tests.
  6232. 1303.62 s [vector] foldl1: OK (0.01s)
  6233. 1303.62 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6234. 1303.62 s [vector] foldl': OK (0.01s)
  6235. 1303.62 s [vector] +++ OK, passed 100 tests.
  6236. 1303.63 s [vector] foldl1': OK (0.01s)
  6237. 1303.64 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6238. 1303.66 s [vector] foldr: OK (0.01s)
  6239. 1303.66 s [vector] +++ OK, passed 100 tests.
  6240. 1303.66 s [vector] foldr1: OK (0.01s)
  6241. 1303.66 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6242. 1303.67 s [vector] foldr': OK
  6243. 1303.67 s [vector] +++ OK, passed 100 tests.
  6244. 1303.70 s [vector] foldr1': OK (0.01s)
  6245. 1303.70 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6246. 1303.72 s [vector] ifoldl: OK (0.02s)
  6247. 1303.72 s [vector] +++ OK, passed 100 tests.
  6248. 1303.74 s [vector] ifoldl': OK (0.02s)
  6249. 1303.74 s [vector] +++ OK, passed 100 tests.
  6250. 1303.76 s [vector] ifoldr: OK (0.03s)
  6251. 1303.76 s [vector] +++ OK, passed 100 tests.
  6252. 1303.78 s [vector] ifoldr': OK (0.03s)
  6253. 1303.78 s [vector] +++ OK, passed 100 tests.
  6254. 1303.80 s [vector] ifoldM: OK (0.02s)
  6255. 1303.80 s [vector] +++ OK, passed 100 tests.
  6256. 1303.82 s [vector] ifoldM': OK (0.02s)
  6257. 1303.82 s [vector] +++ OK, passed 100 tests.
  6258. 1303.86 s [vector] ifoldM_: OK (0.05s)
  6259. 1303.86 s [vector] +++ OK, passed 100 tests.
  6260. 1303.90 s [vector] ifoldM'_: OK (0.04s)
  6261. 1303.90 s [vector] +++ OK, passed 100 tests.
  6262. 1303.90 s [vector] all: OK
  6263. 1303.91 s [vector] +++ OK, passed 100 tests.
  6264. 1303.92 s [vector] any: OK
  6265. 1303.92 s [vector] +++ OK, passed 100 tests.
  6266. 1303.93 s [vector] prescanl: OK (0.01s)
  6267. 1303.93 s [vector] +++ OK, passed 100 tests.
  6268. 1303.94 s [vector] prescanl': OK (0.02s)
  6269. 1303.94 s [vector] +++ OK, passed 100 tests.
  6270. 1303.95 s [vector] postscanl: OK (0.02s)
  6271. 1303.96 s [vector] +++ OK, passed 100 tests.
  6272. 1303.97 s [vector] postscanl': OK (0.01s)
  6273. 1303.97 s [vector] +++ OK, passed 100 tests.
  6274. 1303.98 s [vector] scanl: OK (0.02s)
  6275. 1303.98 s [vector] +++ OK, passed 100 tests.
  6276. 1304.00 s [vector] scanl': OK (0.01s)
  6277. 1304.00 s [vector] +++ OK, passed 100 tests.
  6278. 1304.02 s [vector] scanl1: OK (0.02s)
  6279. 1304.02 s [vector] +++ OK, passed 100 tests.
  6280. 1304.04 s [vector] scanl1': OK (0.02s)
  6281. 1304.04 s [vector] +++ OK, passed 100 tests.
  6282. 1304.06 s [vector] iscanl: OK (0.02s)
  6283. 1304.06 s [vector] +++ OK, passed 100 tests.
  6284. 1304.08 s [vector] iscanl': OK (0.02s)
  6285. 1304.08 s [vector] +++ OK, passed 100 tests.
  6286. 1304.09 s [vector] prescanr: OK (0.02s)
  6287. 1304.10 s [vector] +++ OK, passed 100 tests.
  6288. 1304.10 s [vector] prescanr': OK (0.01s)
  6289. 1304.10 s [vector] +++ OK, passed 100 tests.
  6290. 1304.11 s [vector] postscanr: OK
  6291. 1304.12 s [vector] +++ OK, passed 100 tests.
  6292. 1304.15 s [vector] postscanr': OK (0.02s)
  6293. 1304.16 s [vector] +++ OK, passed 100 tests.
  6294. 1304.18 s [vector] scanr: OK (0.02s)
  6295. 1304.18 s [vector] +++ OK, passed 100 tests.
  6296. 1304.19 s [vector] scanr': OK (0.03s)
  6297. 1304.19 s [vector] +++ OK, passed 100 tests.
  6298. 1304.21 s [vector] scanr1: OK
  6299. 1304.22 s [vector] +++ OK, passed 100 tests.
  6300. 1304.24 s [vector] scanr1': OK (0.02s)
  6301. 1304.24 s [vector] +++ OK, passed 100 tests.
  6302. 1304.26 s [vector] iscanr: OK (0.02s)
  6303. 1304.26 s [vector] +++ OK, passed 100 tests.
  6304. 1304.26 s [vector] iscanr': OK (0.02s)
  6305. 1304.26 s [vector] +++ OK, passed 100 tests.
  6306. 1304.26 s [vector] mut_read: OK
  6307. 1304.26 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6308. 1304.26 s [vector] mut_write: OK
  6309. 1304.26 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6310. 1304.28 s [vector] mut_modify: OK
  6311. 1304.28 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6312. 1304.28 s [vector] mut_generate: OK
  6313. 1304.28 s [vector] +++ OK, passed 100 tests.
  6314. 1304.30 s [vector] mut_generateM: OK (0.03s)
  6315. 1304.30 s [vector] +++ OK, passed 100 tests.
  6316. 1304.34 s [vector] mut_mapM_: OK (0.04s)
  6317. 1304.34 s [vector] +++ OK, passed 100 tests.
  6318. 1304.44 s [vector] mut_imapM_: OK (0.09s)
  6319. 1304.44 s [vector] +++ OK, passed 100 tests.
  6320. 1304.47 s [vector] mut_forM_: OK (0.04s)
  6321. 1304.47 s [vector] +++ OK, passed 100 tests.
  6322. 1304.52 s [vector] mut_iforM_: OK (0.04s)
  6323. 1304.52 s [vector] +++ OK, passed 100 tests.
  6324. 1304.54 s [vector] mut_foldr: OK (0.02s)
  6325. 1304.54 s [vector] +++ OK, passed 100 tests.
  6326. 1304.56 s [vector] mut_foldr': OK (0.02s)
  6327. 1304.56 s [vector] +++ OK, passed 100 tests.
  6328. 1304.56 s [vector] mut_foldl: OK (0.02s)
  6329. 1304.56 s [vector] +++ OK, passed 100 tests.
  6330. 1304.58 s [vector] mut_foldl': OK (0.01s)
  6331. 1304.58 s [vector] +++ OK, passed 100 tests.
  6332. 1304.60 s [vector] mut_ifoldr: OK (0.02s)
  6333. 1304.60 s [vector] +++ OK, passed 100 tests.
  6334. 1304.61 s [vector] mut_ifoldr': OK (0.02s)
  6335. 1304.61 s [vector] +++ OK, passed 100 tests.
  6336. 1304.61 s [vector] mut_ifoldl: OK (0.02s)
  6337. 1304.61 s [vector] +++ OK, passed 100 tests.
  6338. 1304.64 s [vector] mut_ifoldl': OK (0.02s)
  6339. 1304.64 s [vector] +++ OK, passed 100 tests.
  6340. 1304.66 s [vector] mut_foldM: OK (0.02s)
  6341. 1304.66 s [vector] +++ OK, passed 100 tests.
  6342. 1304.68 s [vector] mut_foldM': OK (0.02s)
  6343. 1304.68 s [vector] +++ OK, passed 100 tests.
  6344. 1304.69 s [vector] mut_foldrM: OK (0.02s)
  6345. 1304.69 s [vector] +++ OK, passed 100 tests.
  6346. 1304.69 s [vector] mut_foldrM': OK (0.01s)
  6347. 1304.69 s [vector] +++ OK, passed 100 tests.
  6348. 1304.73 s [vector] mut_ifoldM: OK (0.03s)
  6349. 1304.73 s [vector] +++ OK, passed 100 tests.
  6350. 1304.76 s [vector] mut_ifoldM': OK (0.02s)
  6351. 1304.76 s [vector] +++ OK, passed 100 tests.
  6352. 1304.78 s [vector] mut_ifoldrM: OK (0.02s)
  6353. 1304.78 s [vector] +++ OK, passed 100 tests.
  6354. 1304.79 s [vector] mut_ifoldrM': OK (0.02s)
  6355. 1304.79 s [vector] +++ OK, passed 100 tests.
  6356. 1304.79 s [vector] compare: OK
  6357. 1304.79 s [vector] +++ OK, passed 100 tests.
  6358. 1304.79 s [vector] maximum: OK
  6359. 1304.79 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6360. 1304.79 s [vector] minimum: OK
  6361. 1304.79 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6362. 1304.79 s [vector] minIndex: OK
  6363. 1304.79 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6364. 1304.79 s [vector] maxIndex: OK
  6365. 1304.80 s [vector] +++ OK, passed 100 tests; 20 discarded.
  6366. 1304.80 s [vector] maximumBy: OK
  6367. 1304.80 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6368. 1304.80 s [vector] minimumBy: OK
  6369. 1304.80 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6370. 1304.80 s [vector] maximumOn: OK
  6371. 1304.80 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6372. 1304.80 s [vector] minimumOn: OK
  6373. 1304.80 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6374. 1304.80 s [vector] maxIndexBy: OK
  6375. 1304.80 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6376. 1304.80 s [vector] minIndexBy: OK
  6377. 1304.80 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6378. 1304.80 s [vector] ListFirstMaxIndexWins: OK
  6379. 1304.80 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6380. 1304.80 s [vector] FalseListFirstMaxIndexWins: OK
  6381. 1304.80 s [vector] +++ OK, failed as expected. (after 1 test):
  6382. 1304.80 s [vector] Exception:
  6383. 1304.80 s [vector] Prelude.foldr1: empty list
  6384. 1304.80 s [vector] CallStack (from HasCallStack):
  6385. 1304.81 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  6386. 1304.81 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  6387. 1304.81 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  6388. 1304.81 s [vector] []
  6389. 1304.82 s [vector] mempty: OK
  6390. 1304.82 s [vector] +++ OK, passed 100 tests.
  6391. 1304.82 s [vector] mappend: OK
  6392. 1304.82 s [vector] +++ OK, passed 100 tests.
  6393. 1304.84 s [vector] mconcat: OK (0.03s)
  6394. 1304.84 s [vector] +++ OK, passed 100 tests.
  6395. 1304.84 s [vector] glength: OK
  6396. 1304.84 s [vector] +++ OK, passed 100 tests.
  6397. 1304.84 s [vector] sum: OK
  6398. 1304.84 s [vector] +++ OK, passed 100 tests.
  6399. 1304.84 s [vector] product: OK
  6400. 1304.84 s [vector] +++ OK, passed 100 tests.
  6401. 1304.84 s [vector] enumFromN: OK
  6402. 1304.85 s [vector] +++ OK, passed 100 tests.
  6403. 1304.85 s [vector] enumFromThenN: OK
  6404. 1304.85 s [vector] +++ OK, passed 100 tests.
  6405. 1304.85 s [vector] enumFromTo: OK
  6406. 1304.85 s [vector] +++ OK, passed 100 tests.
  6407. 1304.85 s [vector] enumFromThenTo: OK
  6408. 1304.85 s [vector] +++ OK, passed 100 tests; 2 discarded.
  6409. 1304.85 s [vector] unstream
  6410. 1304.85 s [vector] unstream == vunstream (exact): OK
  6411. 1304.85 s [vector] +++ OK, passed 100 tests.
  6412. 1304.85 s [vector] unstream == vunstream (unknown): OK
  6413. 1304.85 s [vector] +++ OK, passed 100 tests.
  6414. 1304.86 s [vector] unstreamR ~= vunstream (exact): OK
  6415. 1304.86 s [vector] +++ OK, passed 100 tests.
  6416. 1304.86 s [vector] unstreamR ~= vunstream (unknown): OK
  6417. 1304.86 s [vector] +++ OK, passed 100 tests.
  6418. 1304.86 s [vector] Tests.Vector.Storable
  6419. 1304.86 s [vector] Data.Vector.Storable.Vector (Int)
  6420. 1304.86 s [vector] fromList.toList == id: OK
  6421. 1304.86 s [vector] +++ OK, passed 100 tests.
  6422. 1304.86 s [vector] toList.fromList == id: OK
  6423. 1304.86 s [vector] +++ OK, passed 100 tests.
  6424. 1304.86 s [vector] unstream.stream == id: OK
  6425. 1304.86 s [vector] +++ OK, passed 100 tests.
  6426. 1304.86 s [vector] stream.unstream == id: OK
  6427. 1304.87 s [vector] +++ OK, passed 100 tests.
  6428. 1304.87 s [vector] eq: OK
  6429. 1304.87 s [vector] +++ OK, passed 100 tests.
  6430. 1304.87 s [vector] length: OK
  6431. 1304.87 s [vector] +++ OK, passed 100 tests.
  6432. 1304.87 s [vector] null: OK
  6433. 1304.87 s [vector] +++ OK, passed 100 tests.
  6434. 1304.87 s [vector] index: OK
  6435. 1304.87 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6436. 1304.87 s [vector] safeIndex: OK
  6437. 1304.87 s [vector] +++ OK, passed 100 tests.
  6438. 1304.87 s [vector] head: OK
  6439. 1304.87 s [vector] +++ OK, passed 100 tests; 10 discarded.
  6440. 1304.87 s [vector] last: OK
  6441. 1304.87 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6442. 1304.87 s [vector] unsafeIndex: OK
  6443. 1304.87 s [vector] +++ OK, passed 100 tests; 22 discarded.
  6444. 1304.87 s [vector] unsafeHead: OK
  6445. 1304.87 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6446. 1304.87 s [vector] unsafeLast: OK
  6447. 1304.87 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6448. 1304.87 s [vector] slice: OK
  6449. 1304.87 s [vector] +++ OK, passed 100 tests.
  6450. 1304.87 s [vector] init: OK
  6451. 1304.87 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6452. 1304.88 s [vector] tail: OK
  6453. 1304.88 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6454. 1304.88 s [vector] take: OK
  6455. 1304.88 s [vector] +++ OK, passed 100 tests.
  6456. 1304.88 s [vector] drop: OK
  6457. 1304.88 s [vector] +++ OK, passed 100 tests.
  6458. 1304.88 s [vector] splitAt: OK
  6459. 1304.88 s [vector] +++ OK, passed 100 tests.
  6460. 1304.88 s [vector] empty: OK
  6461. 1304.88 s [vector] +++ OK, passed 100 tests.
  6462. 1304.88 s [vector] singleton: OK
  6463. 1304.90 s [vector] +++ OK, passed 100 tests.
  6464. 1304.90 s [vector] replicate: OK
  6465. 1304.90 s [vector] +++ OK, passed 100 tests.
  6466. 1304.90 s [vector] generate: OK
  6467. 1304.90 s [vector] +++ OK, passed 100 tests.
  6468. 1304.90 s [vector] iterateN: OK
  6469. 1304.90 s [vector] +++ OK, passed 100 tests.
  6470. 1304.96 s [vector] iterateNM: OK (0.06s)
  6471. 1304.96 s [vector] +++ OK, passed 100 tests.
  6472. 1304.99 s [vector] generateM: OK (0.03s)
  6473. 1304.99 s [vector] +++ OK, passed 100 tests.
  6474. 1304.99 s [vector] replicateM: OK (0.01s)
  6475. 1304.99 s [vector] +++ OK, passed 100 tests.
  6476. 1304.99 s [vector] create: OK
  6477. 1304.99 s [vector] +++ OK, passed 100 tests.
  6478. 1304.99 s [vector] createT: OK
  6479. 1304.99 s [vector] +++ OK, passed 100 tests.
  6480. 1304.99 s [vector] unfoldr: OK
  6481. 1304.99 s [vector] +++ OK, passed 100 tests.
  6482. 1305.00 s [vector] unfoldrN: OK
  6483. 1305.01 s [vector] +++ OK, passed 100 tests.
  6484. 1305.01 s [vector] unfoldrExactN: OK
  6485. 1305.01 s [vector] +++ OK, passed 100 tests.
  6486. 1305.01 s [vector] unfoldrM: OK
  6487. 1305.02 s [vector] +++ OK, passed 100 tests.
  6488. 1305.02 s [vector] unfoldrNM: OK
  6489. 1305.02 s [vector] +++ OK, passed 100 tests.
  6490. 1305.07 s [vector] unfoldrExactNM: OK (0.05s)
  6491. 1305.07 s [vector] +++ OK, passed 100 tests.
  6492. 1305.07 s [vector] constructN: OK
  6493. 1305.07 s [vector] +++ OK, passed 100 tests.
  6494. 1305.07 s [vector] constructrN: OK
  6495. 1305.07 s [vector] +++ OK, passed 100 tests.
  6496. 1305.07 s [vector] cons: OK
  6497. 1305.07 s [vector] +++ OK, passed 100 tests.
  6498. 1305.08 s [vector] snoc: OK
  6499. 1305.08 s [vector] +++ OK, passed 100 tests.
  6500. 1305.08 s [vector] append: OK
  6501. 1305.08 s [vector] +++ OK, passed 100 tests.
  6502. 1305.09 s [vector] concat: OK (0.02s)
  6503. 1305.09 s [vector] +++ OK, passed 100 tests.
  6504. 1305.09 s [vector] force: OK
  6505. 1305.09 s [vector] +++ OK, passed 100 tests.
  6506. 1305.09 s [vector] upd: OK
  6507. 1305.09 s [vector] +++ OK, passed 100 tests.
  6508. 1305.10 s [vector] accum: OK
  6509. 1305.10 s [vector] +++ OK, passed 100 tests.
  6510. 1305.10 s [vector] reverse: OK
  6511. 1305.10 s [vector] +++ OK, passed 100 tests.
  6512. 1305.10 s [vector] backpermute: OK
  6513. 1305.10 s [vector] +++ OK, passed 100 tests.
  6514. 1305.10 s [vector] map: OK
  6515. 1305.10 s [vector] +++ OK, passed 100 tests.
  6516. 1305.10 s [vector] imap: OK
  6517. 1305.11 s [vector] +++ OK, passed 100 tests.
  6518. 1305.11 s [vector] concatMap: OK
  6519. 1305.11 s [vector] +++ OK, passed 100 tests.
  6520. 1305.11 s [vector] mapM: OK
  6521. 1305.11 s [vector] +++ OK, passed 100 tests.
  6522. 1305.13 s [vector] mapM_: OK (0.02s)
  6523. 1305.13 s [vector] +++ OK, passed 100 tests.
  6524. 1305.14 s [vector] forM: OK
  6525. 1305.14 s [vector] +++ OK, passed 100 tests.
  6526. 1305.15 s [vector] forM_: OK (0.02s)
  6527. 1305.15 s [vector] +++ OK, passed 100 tests.
  6528. 1305.16 s [vector] imapM: OK
  6529. 1305.16 s [vector] +++ OK, passed 100 tests.
  6530. 1305.17 s [vector] imapM_: OK (0.02s)
  6531. 1305.17 s [vector] +++ OK, passed 100 tests.
  6532. 1305.17 s [vector] zipWith: OK
  6533. 1305.17 s [vector] +++ OK, passed 100 tests.
  6534. 1305.17 s [vector] zipWith3: OK
  6535. 1305.17 s [vector] +++ OK, passed 100 tests.
  6536. 1305.18 s [vector] izipWith: OK
  6537. 1305.18 s [vector] +++ OK, passed 100 tests.
  6538. 1305.18 s [vector] izipWith3: OK
  6539. 1305.18 s [vector] +++ OK, passed 100 tests.
  6540. 1305.19 s [vector] izipWithM: OK
  6541. 1305.20 s [vector] +++ OK, passed 100 tests.
  6542. 1305.20 s [vector] izipWithM_: OK (0.01s)
  6543. 1305.20 s [vector] +++ OK, passed 100 tests.
  6544. 1305.22 s [vector] zipWithM: OK
  6545. 1305.22 s [vector] +++ OK, passed 100 tests.
  6546. 1305.22 s [vector] zipWithM_: OK (0.02s)
  6547. 1305.22 s [vector] +++ OK, passed 100 tests.
  6548. 1305.22 s [vector] filter: OK
  6549. 1305.23 s [vector] +++ OK, passed 100 tests.
  6550. 1305.24 s [vector] ifilter: OK
  6551. 1305.24 s [vector] +++ OK, passed 100 tests.
  6552. 1305.25 s [vector] filterM: OK (0.02s)
  6553. 1305.25 s [vector] +++ OK, passed 100 tests.
  6554. 1305.25 s [vector] uniq: OK
  6555. 1305.25 s [vector] +++ OK, passed 100 tests.
  6556. 1305.25 s [vector] mapMaybe: OK
  6557. 1305.25 s [vector] +++ OK, passed 100 tests.
  6558. 1305.26 s [vector] imapMaybe: OK
  6559. 1305.26 s [vector] +++ OK, passed 100 tests.
  6560. 1305.26 s [vector] takeWhile: OK
  6561. 1305.26 s [vector] +++ OK, passed 100 tests.
  6562. 1305.26 s [vector] dropWhile: OK
  6563. 1305.26 s [vector] +++ OK, passed 100 tests.
  6564. 1305.27 s [vector] partition: OK
  6565. 1305.27 s [vector] +++ OK, passed 100 tests.
  6566. 1305.27 s [vector] partitionWith: OK
  6567. 1305.27 s [vector] +++ OK, passed 100 tests.
  6568. 1305.28 s [vector] span: OK
  6569. 1305.28 s [vector] +++ OK, passed 100 tests.
  6570. 1305.28 s [vector] break: OK
  6571. 1305.28 s [vector] +++ OK, passed 100 tests.
  6572. 1305.28 s [vector] spanR: OK
  6573. 1305.28 s [vector] +++ OK, passed 100 tests.
  6574. 1305.28 s [vector] breakR: OK
  6575. 1305.28 s [vector] +++ OK, passed 100 tests.
  6576. 1305.30 s [vector] groupBy: OK
  6577. 1305.30 s [vector] +++ OK, passed 100 tests.
  6578. 1305.30 s [vector] elem: OK (0.01s)
  6579. 1305.30 s [vector] +++ OK, passed 100 tests.
  6580. 1305.30 s [vector] notElem: OK
  6581. 1305.30 s [vector] +++ OK, passed 100 tests.
  6582. 1305.30 s [vector] find: OK
  6583. 1305.30 s [vector] +++ OK, passed 100 tests.
  6584. 1305.30 s [vector] findIndex: OK
  6585. 1305.30 s [vector] +++ OK, passed 100 tests.
  6586. 1305.31 s [vector] findIndexR: OK
  6587. 1305.31 s [vector] +++ OK, passed 100 tests.
  6588. 1305.32 s [vector] findIndices: OK
  6589. 1305.32 s [vector] +++ OK, passed 100 tests.
  6590. 1305.32 s [vector] elemIndex: OK
  6591. 1305.32 s [vector] +++ OK, passed 100 tests.
  6592. 1305.32 s [vector] elemIndices: OK
  6593. 1305.32 s [vector] +++ OK, passed 100 tests.
  6594. 1305.32 s [vector] foldl: OK
  6595. 1305.32 s [vector] +++ OK, passed 100 tests.
  6596. 1305.32 s [vector] foldl1: OK
  6597. 1305.32 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6598. 1305.32 s [vector] foldl': OK
  6599. 1305.32 s [vector] +++ OK, passed 100 tests.
  6600. 1305.32 s [vector] foldl1': OK
  6601. 1305.32 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6602. 1305.32 s [vector] foldr: OK
  6603. 1305.32 s [vector] +++ OK, passed 100 tests.
  6604. 1305.32 s [vector] foldr1: OK
  6605. 1305.32 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6606. 1305.32 s [vector] foldr': OK
  6607. 1305.33 s [vector] +++ OK, passed 100 tests.
  6608. 1305.33 s [vector] foldr1': OK
  6609. 1305.33 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6610. 1305.34 s [vector] ifoldl: OK
  6611. 1305.34 s [vector] +++ OK, passed 100 tests.
  6612. 1305.34 s [vector] ifoldl': OK
  6613. 1305.34 s [vector] +++ OK, passed 100 tests.
  6614. 1305.34 s [vector] ifoldr: OK
  6615. 1305.34 s [vector] +++ OK, passed 100 tests.
  6616. 1305.35 s [vector] ifoldr': OK
  6617. 1305.35 s [vector] +++ OK, passed 100 tests.
  6618. 1305.35 s [vector] ifoldM: OK
  6619. 1305.35 s [vector] +++ OK, passed 100 tests.
  6620. 1305.35 s [vector] ifoldM': OK
  6621. 1305.36 s [vector] +++ OK, passed 100 tests.
  6622. 1305.37 s [vector] ifoldM_: OK (0.02s)
  6623. 1305.38 s [vector] +++ OK, passed 100 tests.
  6624. 1305.39 s [vector] ifoldM'_: OK (0.02s)
  6625. 1305.39 s [vector] +++ OK, passed 100 tests.
  6626. 1305.67 s [vector] all: OK
  6627. 1305.67 s [vector] +++ OK, passed 100 tests.
  6628. 1305.67 s [vector] any: OK
  6629. 1305.67 s [vector] +++ OK, passed 100 tests.
  6630. 1305.67 s [vector] prescanl: OK
  6631. 1305.67 s [vector] +++ OK, passed 100 tests.
  6632. 1305.67 s [vector] prescanl': OK
  6633. 1305.67 s [vector] +++ OK, passed 100 tests.
  6634. 1305.67 s [vector] postscanl: OK
  6635. 1305.67 s [vector] +++ OK, passed 100 tests.
  6636. 1305.67 s [vector] postscanl': OK
  6637. 1305.67 s [vector] +++ OK, passed 100 tests.
  6638. 1305.67 s [vector] scanl: OK
  6639. 1305.67 s [vector] +++ OK, passed 100 tests.
  6640. 1305.67 s [vector] scanl': OK
  6641. 1305.67 s [vector] +++ OK, passed 100 tests.
  6642. 1305.67 s [vector] scanl1: OK
  6643. 1305.67 s [vector] +++ OK, passed 100 tests.
  6644. 1305.67 s [vector] scanl1': OK
  6645. 1305.67 s [vector] +++ OK, passed 100 tests.
  6646. 1305.67 s [vector] iscanl: OK
  6647. 1305.67 s [vector] +++ OK, passed 100 tests.
  6648. 1305.67 s [vector] iscanl': OK
  6649. 1305.67 s [vector] +++ OK, passed 100 tests.
  6650. 1305.67 s [vector] prescanr: OK
  6651. 1305.67 s [vector] +++ OK, passed 100 tests.
  6652. 1305.67 s [vector] prescanr': OK
  6653. 1305.67 s [vector] +++ OK, passed 100 tests.
  6654. 1305.67 s [vector] postscanr: OK
  6655. 1305.67 s [vector] +++ OK, passed 100 tests.
  6656. 1305.67 s [vector] postscanr': OK
  6657. 1305.67 s [vector] +++ OK, passed 100 tests.
  6658. 1305.67 s [vector] scanr: OK
  6659. 1305.67 s [vector] +++ OK, passed 100 tests.
  6660. 1305.67 s [vector] scanr': OK
  6661. 1305.67 s [vector] +++ OK, passed 100 tests.
  6662. 1305.67 s [vector] scanr1: OK
  6663. 1305.67 s [vector] +++ OK, passed 100 tests.
  6664. 1305.68 s [vector] scanr1': OK
  6665. 1305.68 s [vector] +++ OK, passed 100 tests.
  6666. 1305.68 s [vector] iscanr: OK
  6667. 1305.68 s [vector] +++ OK, passed 100 tests.
  6668. 1305.68 s [vector] iscanr': OK
  6669. 1305.68 s [vector] +++ OK, passed 100 tests.
  6670. 1305.68 s [vector] mut_read: OK
  6671. 1305.68 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6672. 1305.68 s [vector] mut_write: OK
  6673. 1305.68 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6674. 1305.68 s [vector] mut_modify: OK
  6675. 1305.68 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6676. 1305.68 s [vector] mut_generate: OK
  6677. 1305.68 s [vector] +++ OK, passed 100 tests.
  6678. 1305.68 s [vector] mut_generateM: OK (0.02s)
  6679. 1305.68 s [vector] +++ OK, passed 100 tests.
  6680. 1305.68 s [vector] mut_mapM_: OK (0.03s)
  6681. 1305.68 s [vector] +++ OK, passed 100 tests.
  6682. 1305.68 s [vector] mut_imapM_: OK (0.02s)
  6683. 1305.68 s [vector] +++ OK, passed 100 tests.
  6684. 1305.68 s [vector] mut_forM_: OK (0.02s)
  6685. 1305.68 s [vector] +++ OK, passed 100 tests.
  6686. 1305.68 s [vector] mut_iforM_: OK (0.02s)
  6687. 1305.68 s [vector] +++ OK, passed 100 tests.
  6688. 1305.68 s [vector] mut_foldr: OK
  6689. 1305.68 s [vector] +++ OK, passed 100 tests.
  6690. 1305.68 s [vector] mut_foldr': OK
  6691. 1305.68 s [vector] +++ OK, passed 100 tests.
  6692. 1305.68 s [vector] mut_foldl: OK
  6693. 1305.68 s [vector] +++ OK, passed 100 tests.
  6694. 1305.68 s [vector] mut_foldl': OK
  6695. 1305.68 s [vector] +++ OK, passed 100 tests.
  6696. 1305.68 s [vector] mut_ifoldr: OK
  6697. 1305.68 s [vector] +++ OK, passed 100 tests.
  6698. 1305.68 s [vector] mut_ifoldr': OK
  6699. 1305.68 s [vector] +++ OK, passed 100 tests.
  6700. 1305.68 s [vector] mut_ifoldl: OK
  6701. 1305.68 s [vector] +++ OK, passed 100 tests.
  6702. 1305.68 s [vector] mut_ifoldl': OK
  6703. 1305.68 s [vector] +++ OK, passed 100 tests.
  6704. 1305.68 s [vector] mut_foldM: OK
  6705. 1305.68 s [vector] +++ OK, passed 100 tests.
  6706. 1305.68 s [vector] mut_foldM': OK
  6707. 1305.68 s [vector] +++ OK, passed 100 tests.
  6708. 1305.68 s [vector] mut_foldrM: OK
  6709. 1305.68 s [vector] +++ OK, passed 100 tests.
  6710. 1305.68 s [vector] mut_foldrM': OK
  6711. 1305.68 s [vector] +++ OK, passed 100 tests.
  6712. 1305.68 s [vector] mut_ifoldM: OK
  6713. 1305.68 s [vector] +++ OK, passed 100 tests.
  6714. 1305.68 s [vector] mut_ifoldM': OK
  6715. 1305.68 s [vector] +++ OK, passed 100 tests.
  6716. 1305.68 s [vector] mut_ifoldrM: OK
  6717. 1305.68 s [vector] +++ OK, passed 100 tests.
  6718. 1305.69 s [vector] mut_ifoldrM': OK
  6719. 1305.69 s [vector] +++ OK, passed 100 tests.
  6720. 1305.69 s [vector] compare: OK
  6721. 1305.69 s [vector] +++ OK, passed 100 tests.
  6722. 1305.69 s [vector] maximum: OK
  6723. 1305.69 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6724. 1305.70 s [vector] minimum: OK
  6725. 1305.70 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6726. 1305.70 s [vector] minIndex: OK
  6727. 1305.70 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6728. 1305.70 s [vector] maxIndex: OK
  6729. 1305.70 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6730. 1305.70 s [vector] maximumBy: OK
  6731. 1305.70 s [vector] +++ OK, passed 100 tests; 20 discarded.
  6732. 1305.70 s [vector] minimumBy: OK
  6733. 1305.70 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6734. 1305.70 s [vector] maximumOn: OK
  6735. 1305.70 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6736. 1305.70 s [vector] minimumOn: OK
  6737. 1305.70 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6738. 1305.70 s [vector] maxIndexBy: OK
  6739. 1305.70 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6740. 1305.70 s [vector] minIndexBy: OK
  6741. 1305.70 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6742. 1305.70 s [vector] ListFirstMaxIndexWins: OK
  6743. 1305.70 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6744. 1305.70 s [vector] FalseListFirstMaxIndexWins: OK
  6745. 1305.70 s [vector] +++ OK, failed as expected. (after 1 test):
  6746. 1305.71 s [vector] Exception:
  6747. 1305.71 s [vector] Prelude.foldr1: empty list
  6748. 1305.71 s [vector] CallStack (from HasCallStack):
  6749. 1305.71 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  6750. 1305.71 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  6751. 1305.71 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  6752. 1305.71 s [vector] []
  6753. 1305.71 s [vector] mempty: OK
  6754. 1305.71 s [vector] +++ OK, passed 100 tests.
  6755. 1305.71 s [vector] mappend: OK
  6756. 1305.72 s [vector] +++ OK, passed 100 tests.
  6757. 1305.73 s [vector] mconcat: OK (0.02s)
  6758. 1305.73 s [vector] +++ OK, passed 100 tests.
  6759. 1305.73 s [vector] glength: OK
  6760. 1305.73 s [vector] +++ OK, passed 100 tests.
  6761. 1305.73 s [vector] sum: OK
  6762. 1305.73 s [vector] +++ OK, passed 100 tests.
  6763. 1305.73 s [vector] product: OK
  6764. 1305.73 s [vector] +++ OK, passed 100 tests.
  6765. 1305.73 s [vector] enumFromN: OK
  6766. 1305.73 s [vector] +++ OK, passed 100 tests.
  6767. 1305.73 s [vector] enumFromThenN: OK
  6768. 1305.73 s [vector] +++ OK, passed 100 tests.
  6769. 1305.73 s [vector] enumFromTo: OK
  6770. 1305.73 s [vector] +++ OK, passed 100 tests.
  6771. 1305.73 s [vector] enumFromThenTo: OK
  6772. 1305.73 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6773. 1305.74 s [vector] Data.Vector.Storable.Vector (Double)
  6774. 1305.74 s [vector] fromList.toList == id: OK
  6775. 1305.74 s [vector] +++ OK, passed 100 tests.
  6776. 1305.74 s [vector] toList.fromList == id: OK
  6777. 1305.74 s [vector] +++ OK, passed 100 tests.
  6778. 1305.74 s [vector] unstream.stream == id: OK
  6779. 1305.74 s [vector] +++ OK, passed 100 tests.
  6780. 1305.74 s [vector] stream.unstream == id: OK
  6781. 1305.74 s [vector] +++ OK, passed 100 tests.
  6782. 1305.74 s [vector] eq: OK
  6783. 1305.74 s [vector] +++ OK, passed 100 tests.
  6784. 1305.74 s [vector] length: OK
  6785. 1305.74 s [vector] +++ OK, passed 100 tests.
  6786. 1305.74 s [vector] null: OK
  6787. 1305.74 s [vector] +++ OK, passed 100 tests.
  6788. 1305.74 s [vector] index: OK
  6789. 1305.74 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6790. 1305.74 s [vector] safeIndex: OK
  6791. 1305.74 s [vector] +++ OK, passed 100 tests.
  6792. 1305.74 s [vector] head: OK
  6793. 1305.74 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6794. 1305.74 s [vector] last: OK
  6795. 1305.74 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6796. 1305.74 s [vector] unsafeIndex: OK
  6797. 1305.74 s [vector] +++ OK, passed 100 tests; 22 discarded.
  6798. 1305.74 s [vector] unsafeHead: OK
  6799. 1305.74 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6800. 1305.75 s [vector] unsafeLast: OK
  6801. 1305.75 s [vector] +++ OK, passed 100 tests; 11 discarded.
  6802. 1305.75 s [vector] slice: OK
  6803. 1305.75 s [vector] +++ OK, passed 100 tests.
  6804. 1305.75 s [vector] init: OK
  6805. 1305.75 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6806. 1305.75 s [vector] tail: OK
  6807. 1305.75 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6808. 1305.75 s [vector] take: OK
  6809. 1305.75 s [vector] +++ OK, passed 100 tests.
  6810. 1305.75 s [vector] drop: OK
  6811. 1305.75 s [vector] +++ OK, passed 100 tests.
  6812. 1305.75 s [vector] splitAt: OK
  6813. 1305.75 s [vector] +++ OK, passed 100 tests.
  6814. 1305.75 s [vector] empty: OK
  6815. 1305.75 s [vector] +++ OK, passed 100 tests.
  6816. 1305.75 s [vector] singleton: OK
  6817. 1305.75 s [vector] +++ OK, passed 100 tests.
  6818. 1305.75 s [vector] replicate: OK
  6819. 1305.75 s [vector] +++ OK, passed 100 tests.
  6820. 1305.75 s [vector] generate: OK
  6821. 1305.75 s [vector] +++ OK, passed 100 tests.
  6822. 1305.78 s [vector] iterateN: OK
  6823. 1305.79 s [vector] +++ OK, passed 100 tests.
  6824. 1305.82 s [vector] iterateNM: OK (0.04s)
  6825. 1305.82 s [vector] +++ OK, passed 100 tests.
  6826. 1305.85 s [vector] generateM: OK (0.04s)
  6827. 1305.85 s [vector] +++ OK, passed 100 tests.
  6828. 1305.85 s [vector] replicateM: OK
  6829. 1305.85 s [vector] +++ OK, passed 100 tests.
  6830. 1305.85 s [vector] create: OK
  6831. 1305.85 s [vector] +++ OK, passed 100 tests.
  6832. 1305.85 s [vector] createT: OK
  6833. 1305.86 s [vector] +++ OK, passed 100 tests.
  6834. 1305.86 s [vector] unfoldr: OK
  6835. 1305.86 s [vector] +++ OK, passed 100 tests.
  6836. 1305.86 s [vector] unfoldrN: OK
  6837. 1305.86 s [vector] +++ OK, passed 100 tests.
  6838. 1305.87 s [vector] unfoldrExactN: OK
  6839. 1305.87 s [vector] +++ OK, passed 100 tests.
  6840. 1305.88 s [vector] unfoldrM: OK
  6841. 1305.88 s [vector] +++ OK, passed 100 tests.
  6842. 1305.88 s [vector] unfoldrNM: OK
  6843. 1305.90 s [vector] +++ OK, passed 100 tests.
  6844. 1305.92 s [vector] unfoldrExactNM: OK (0.04s)
  6845. 1305.92 s [vector] +++ OK, passed 100 tests.
  6846. 1305.94 s [vector] constructN: OK
  6847. 1305.94 s [vector] +++ OK, passed 100 tests.
  6848. 1305.96 s [vector] constructrN: OK (0.02s)
  6849. 1305.96 s [vector] +++ OK, passed 100 tests.
  6850. 1305.96 s [vector] cons: OK
  6851. 1305.96 s [vector] +++ OK, passed 100 tests.
  6852. 1305.96 s [vector] snoc: OK
  6853. 1305.96 s [vector] +++ OK, passed 100 tests.
  6854. 1305.98 s [vector] append: OK
  6855. 1305.98 s [vector] +++ OK, passed 100 tests.
  6856. 1305.99 s [vector] concat: OK (0.03s)
  6857. 1305.99 s [vector] +++ OK, passed 100 tests.
  6858. 1305.99 s [vector] force: OK
  6859. 1305.99 s [vector] +++ OK, passed 100 tests.
  6860. 1305.99 s [vector] upd: OK
  6861. 1306.00 s [vector] +++ OK, passed 100 tests.
  6862. 1306.01 s [vector] accum: OK (0.02s)
  6863. 1306.01 s [vector] +++ OK, passed 100 tests.
  6864. 1306.01 s [vector] reverse: OK
  6865. 1306.01 s [vector] +++ OK, passed 100 tests.
  6866. 1306.02 s [vector] backpermute: OK
  6867. 1306.02 s [vector] +++ OK, passed 100 tests.
  6868. 1306.02 s [vector] map: OK
  6869. 1306.02 s [vector] +++ OK, passed 100 tests.
  6870. 1306.03 s [vector] imap: OK
  6871. 1306.03 s [vector] +++ OK, passed 100 tests.
  6872. 1306.04 s [vector] concatMap: OK
  6873. 1306.04 s [vector] +++ OK, passed 100 tests.
  6874. 1306.05 s [vector] mapM: OK
  6875. 1306.05 s [vector] +++ OK, passed 100 tests.
  6876. 1306.10 s [vector] mapM_: OK (0.03s)
  6877. 1306.10 s [vector] +++ OK, passed 100 tests.
  6878. 1306.11 s [vector] forM: OK
  6879. 1306.12 s [vector] +++ OK, passed 100 tests.
  6880. 1306.14 s [vector] forM_: OK (0.04s)
  6881. 1306.14 s [vector] +++ OK, passed 100 tests.
  6882. 1306.16 s [vector] imapM: OK (0.01s)
  6883. 1306.16 s [vector] +++ OK, passed 100 tests.
  6884. 1306.18 s [vector] imapM_: OK (0.04s)
  6885. 1306.18 s [vector] +++ OK, passed 100 tests.
  6886. 1306.20 s [vector] zipWith: OK
  6887. 1306.20 s [vector] +++ OK, passed 100 tests.
  6888. 1306.21 s [vector] zipWith3: OK (0.01s)
  6889. 1306.21 s [vector] +++ OK, passed 100 tests.
  6890. 1306.22 s [vector] izipWith: OK (0.01s)
  6891. 1306.22 s [vector] +++ OK, passed 100 tests.
  6892. 1306.24 s [vector] izipWith3: OK (0.01s)
  6893. 1306.24 s [vector] +++ OK, passed 100 tests.
  6894. 1306.25 s [vector] izipWithM: OK (0.01s)
  6895. 1306.26 s [vector] +++ OK, passed 100 tests.
  6896. 1306.28 s [vector] izipWithM_: OK (0.04s)
  6897. 1306.28 s [vector] +++ OK, passed 100 tests.
  6898. 1306.30 s [vector] zipWithM: OK (0.02s)
  6899. 1306.30 s [vector] +++ OK, passed 100 tests.
  6900. 1306.33 s [vector] zipWithM_: OK (0.04s)
  6901. 1306.34 s [vector] +++ OK, passed 100 tests.
  6902. 1306.34 s [vector] filter: OK
  6903. 1306.34 s [vector] +++ OK, passed 100 tests.
  6904. 1306.35 s [vector] ifilter: OK
  6905. 1306.35 s [vector] +++ OK, passed 100 tests.
  6906. 1306.39 s [vector] filterM: OK (0.05s)
  6907. 1306.39 s [vector] +++ OK, passed 100 tests.
  6908. 1306.40 s [vector] uniq: OK
  6909. 1306.40 s [vector] +++ OK, passed 100 tests.
  6910. 1306.42 s [vector] mapMaybe: OK (0.02s)
  6911. 1306.42 s [vector] +++ OK, passed 100 tests.
  6912. 1306.43 s [vector] imapMaybe: OK
  6913. 1306.44 s [vector] +++ OK, passed 100 tests.
  6914. 1306.44 s [vector] takeWhile: OK
  6915. 1306.45 s [vector] +++ OK, passed 100 tests.
  6916. 1306.46 s [vector] dropWhile: OK
  6917. 1306.47 s [vector] +++ OK, passed 100 tests.
  6918. 1306.47 s [vector] partition: OK (0.01s)
  6919. 1306.47 s [vector] +++ OK, passed 100 tests.
  6920. 1306.47 s [vector] partitionWith: OK (0.02s)
  6921. 1306.47 s [vector] +++ OK, passed 100 tests.
  6922. 1306.47 s [vector] span: OK
  6923. 1306.47 s [vector] +++ OK, passed 100 tests.
  6924. 1306.48 s [vector] break: OK
  6925. 1306.48 s [vector] +++ OK, passed 100 tests.
  6926. 1306.49 s [vector] spanR: OK
  6927. 1306.49 s [vector] +++ OK, passed 100 tests.
  6928. 1306.49 s [vector] breakR: OK
  6929. 1306.49 s [vector] +++ OK, passed 100 tests.
  6930. 1306.49 s [vector] groupBy: OK (0.01s)
  6931. 1306.49 s [vector] +++ OK, passed 100 tests.
  6932. 1306.49 s [vector] elem: OK
  6933. 1306.49 s [vector] +++ OK, passed 100 tests.
  6934. 1306.49 s [vector] notElem: OK
  6935. 1306.49 s [vector] +++ OK, passed 100 tests.
  6936. 1306.49 s [vector] find: OK
  6937. 1306.49 s [vector] +++ OK, passed 100 tests.
  6938. 1306.50 s [vector] findIndex: OK
  6939. 1306.50 s [vector] +++ OK, passed 100 tests.
  6940. 1306.50 s [vector] findIndexR: OK
  6941. 1306.51 s [vector] +++ OK, passed 100 tests.
  6942. 1306.51 s [vector] findIndices: OK (0.01s)
  6943. 1306.51 s [vector] +++ OK, passed 100 tests.
  6944. 1306.51 s [vector] elemIndex: OK
  6945. 1306.51 s [vector] +++ OK, passed 100 tests.
  6946. 1306.51 s [vector] elemIndices: OK
  6947. 1306.51 s [vector] +++ OK, passed 100 tests.
  6948. 1306.53 s [vector] foldl: OK (0.02s)
  6949. 1306.54 s [vector] +++ OK, passed 100 tests.
  6950. 1306.56 s [vector] foldl1: OK (0.02s)
  6951. 1306.56 s [vector] +++ OK, passed 100 tests; 10 discarded.
  6952. 1306.57 s [vector] foldl': OK (0.01s)
  6953. 1306.57 s [vector] +++ OK, passed 100 tests.
  6954. 1306.57 s [vector] foldl1': OK (0.01s)
  6955. 1306.57 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6956. 1306.60 s [vector] foldr: OK (0.01s)
  6957. 1306.60 s [vector] +++ OK, passed 100 tests.
  6958. 1306.61 s [vector] foldr1: OK (0.01s)
  6959. 1306.61 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6960. 1306.62 s [vector] foldr': OK (0.01s)
  6961. 1306.62 s [vector] +++ OK, passed 100 tests.
  6962. 1306.64 s [vector] foldr1': OK (0.01s)
  6963. 1306.64 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6964. 1306.66 s [vector] ifoldl: OK (0.03s)
  6965. 1306.66 s [vector] +++ OK, passed 100 tests.
  6966. 1306.68 s [vector] ifoldl': OK
  6967. 1306.70 s [vector] +++ OK, passed 100 tests.
  6968. 1306.72 s [vector] ifoldr: OK (0.03s)
  6969. 1306.72 s [vector] +++ OK, passed 100 tests.
  6970. 1306.76 s [vector] ifoldr': OK (0.03s)
  6971. 1306.76 s [vector] +++ OK, passed 100 tests.
  6972. 1306.77 s [vector] ifoldM: OK (0.03s)
  6973. 1306.78 s [vector] +++ OK, passed 100 tests.
  6974. 1306.82 s [vector] ifoldM': OK (0.02s)
  6975. 1306.82 s [vector] +++ OK, passed 100 tests.
  6976. 1306.88 s [vector] ifoldM_: OK (0.07s)
  6977. 1306.88 s [vector] +++ OK, passed 100 tests.
  6978. 1306.93 s [vector] ifoldM'_: OK (0.06s)
  6979. 1306.93 s [vector] +++ OK, passed 100 tests.
  6980. 1306.93 s [vector] all: OK
  6981. 1306.93 s [vector] +++ OK, passed 100 tests.
  6982. 1306.93 s [vector] any: OK
  6983. 1306.93 s [vector] +++ OK, passed 100 tests.
  6984. 1306.95 s [vector] prescanl: OK (0.01s)
  6985. 1306.96 s [vector] +++ OK, passed 100 tests.
  6986. 1306.98 s [vector] prescanl': OK (0.02s)
  6987. 1306.98 s [vector] +++ OK, passed 100 tests.
  6988. 1307.02 s [vector] postscanl: OK (0.03s)
  6989. 1307.02 s [vector] +++ OK, passed 100 tests.
  6990. 1307.03 s [vector] postscanl': OK (0.03s)
  6991. 1307.04 s [vector] +++ OK, passed 100 tests.
  6992. 1307.05 s [vector] scanl: OK (0.02s)
  6993. 1307.06 s [vector] +++ OK, passed 100 tests.
  6994. 1307.08 s [vector] scanl': OK (0.02s)
  6995. 1307.08 s [vector] +++ OK, passed 100 tests.
  6996. 1307.10 s [vector] scanl1: OK (0.02s)
  6997. 1307.10 s [vector] +++ OK, passed 100 tests.
  6998. 1307.12 s [vector] scanl1': OK (0.02s)
  6999. 1307.12 s [vector] +++ OK, passed 100 tests.
  7000. 1307.16 s [vector] iscanl: OK (0.03s)
  7001. 1307.16 s [vector] +++ OK, passed 100 tests.
  7002. 1307.18 s [vector] iscanl': OK (0.03s)
  7003. 1307.18 s [vector] +++ OK, passed 100 tests.
  7004. 1307.20 s [vector] prescanr: OK (0.03s)
  7005. 1307.20 s [vector] +++ OK, passed 100 tests.
  7006. 1307.21 s [vector] prescanr': OK (0.02s)
  7007. 1307.22 s [vector] +++ OK, passed 100 tests.
  7008. 1307.24 s [vector] postscanr: OK (0.02s)
  7009. 1307.24 s [vector] +++ OK, passed 100 tests.
  7010. 1307.25 s [vector] postscanr': OK (0.01s)
  7011. 1307.25 s [vector] +++ OK, passed 100 tests.
  7012. 1307.26 s [vector] scanr: OK (0.02s)
  7013. 1307.26 s [vector] +++ OK, passed 100 tests.
  7014. 1307.27 s [vector] scanr': OK (0.02s)
  7015. 1307.28 s [vector] +++ OK, passed 100 tests.
  7016. 1307.29 s [vector] scanr1: OK (0.01s)
  7017. 1307.30 s [vector] +++ OK, passed 100 tests.
  7018. 1307.31 s [vector] scanr1': OK (0.02s)
  7019. 1307.31 s [vector] +++ OK, passed 100 tests.
  7020. 1307.32 s [vector] iscanr: OK (0.02s)
  7021. 1307.32 s [vector] +++ OK, passed 100 tests.
  7022. 1307.33 s [vector] iscanr': OK (0.02s)
  7023. 1307.33 s [vector] +++ OK, passed 100 tests.
  7024. 1307.33 s [vector] mut_read: OK
  7025. 1307.33 s [vector] +++ OK, passed 100 tests; 20 discarded.
  7026. 1307.33 s [vector] mut_write: OK
  7027. 1307.33 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7028. 1307.34 s [vector] mut_modify: OK
  7029. 1307.34 s [vector] +++ OK, passed 100 tests; 22 discarded.
  7030. 1307.34 s [vector] mut_generate: OK
  7031. 1307.34 s [vector] +++ OK, passed 100 tests.
  7032. 1307.38 s [vector] mut_generateM: OK (0.02s)
  7033. 1307.38 s [vector] +++ OK, passed 100 tests.
  7034. 1307.39 s [vector] mut_mapM_: OK (0.04s)
  7035. 1307.39 s [vector] +++ OK, passed 100 tests.
  7036. 1307.43 s [vector] mut_imapM_: OK (0.03s)
  7037. 1307.43 s [vector] +++ OK, passed 100 tests.
  7038. 1307.48 s [vector] mut_forM_: OK (0.03s)
  7039. 1307.48 s [vector] +++ OK, passed 100 tests.
  7040. 1307.52 s [vector] mut_iforM_: OK (0.05s)
  7041. 1307.52 s [vector] +++ OK, passed 100 tests.
  7042. 1307.54 s [vector] mut_foldr: OK
  7043. 1307.54 s [vector] +++ OK, passed 100 tests.
  7044. 1307.55 s [vector] mut_foldr': OK (0.02s)
  7045. 1307.56 s [vector] +++ OK, passed 100 tests.
  7046. 1307.57 s [vector] mut_foldl: OK (0.01s)
  7047. 1307.57 s [vector] +++ OK, passed 100 tests.
  7048. 1307.58 s [vector] mut_foldl': OK (0.01s)
  7049. 1307.58 s [vector] +++ OK, passed 100 tests.
  7050. 1307.59 s [vector] mut_ifoldr: OK (0.01s)
  7051. 1307.60 s [vector] +++ OK, passed 100 tests.
  7052. 1307.61 s [vector] mut_ifoldr': OK (0.01s)
  7053. 1307.61 s [vector] +++ OK, passed 100 tests.
  7054. 1307.61 s [vector] mut_ifoldl: OK (0.01s)
  7055. 1307.61 s [vector] +++ OK, passed 100 tests.
  7056. 1307.63 s [vector] mut_ifoldl': OK (0.01s)
  7057. 1307.64 s [vector] +++ OK, passed 100 tests.
  7058. 1307.65 s [vector] mut_foldM: OK (0.01s)
  7059. 1307.65 s [vector] +++ OK, passed 100 tests.
  7060. 1307.65 s [vector] mut_foldM': OK (0.02s)
  7061. 1307.65 s [vector] +++ OK, passed 100 tests.
  7062. 1307.67 s [vector] mut_foldrM: OK (0.02s)
  7063. 1307.68 s [vector] +++ OK, passed 100 tests.
  7064. 1307.68 s [vector] mut_foldrM': OK (0.01s)
  7065. 1307.68 s [vector] +++ OK, passed 100 tests.
  7066. 1307.71 s [vector] mut_ifoldM: OK
  7067. 1307.71 s [vector] +++ OK, passed 100 tests.
  7068. 1307.71 s [vector] mut_ifoldM': OK (0.01s)
  7069. 1307.71 s [vector] +++ OK, passed 100 tests.
  7070. 1307.73 s [vector] mut_ifoldrM: OK (0.01s)
  7071. 1307.74 s [vector] +++ OK, passed 100 tests.
  7072. 1307.74 s [vector] mut_ifoldrM': OK (0.01s)
  7073. 1307.74 s [vector] +++ OK, passed 100 tests.
  7074. 1307.74 s [vector] compare: OK
  7075. 1307.74 s [vector] +++ OK, passed 100 tests.
  7076. 1307.74 s [vector] maximum: OK
  7077. 1307.74 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7078. 1307.75 s [vector] minimum: OK
  7079. 1307.75 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7080. 1307.75 s [vector] minIndex: OK
  7081. 1307.75 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7082. 1307.75 s [vector] maxIndex: OK
  7083. 1307.75 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7084. 1307.75 s [vector] maximumBy: OK
  7085. 1307.75 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7086. 1307.76 s [vector] minimumBy: OK
  7087. 1307.76 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7088. 1307.76 s [vector] maximumOn: OK
  7089. 1307.76 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7090. 1307.76 s [vector] minimumOn: OK
  7091. 1307.76 s [vector] +++ OK, passed 100 tests; 20 discarded.
  7092. 1307.76 s [vector] maxIndexBy: OK
  7093. 1307.76 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7094. 1307.76 s [vector] minIndexBy: OK
  7095. 1307.76 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7096. 1307.76 s [vector] ListFirstMaxIndexWins: OK
  7097. 1307.76 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7098. 1307.77 s [vector] FalseListFirstMaxIndexWins: OK
  7099. 1307.77 s [vector] +++ OK, failed as expected. (after 1 test):
  7100. 1307.77 s [vector] Exception:
  7101. 1307.77 s [vector] Prelude.foldr1: empty list
  7102. 1307.77 s [vector] CallStack (from HasCallStack):
  7103. 1307.77 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  7104. 1307.77 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  7105. 1307.77 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  7106. 1307.77 s [vector] []
  7107. 1307.77 s [vector] mempty: OK
  7108. 1307.77 s [vector] +++ OK, passed 100 tests.
  7109. 1307.77 s [vector] mappend: OK
  7110. 1307.77 s [vector] +++ OK, passed 100 tests.
  7111. 1307.78 s [vector] mconcat: OK (0.02s)
  7112. 1307.78 s [vector] +++ OK, passed 100 tests.
  7113. 1307.78 s [vector] glength: OK
  7114. 1307.78 s [vector] +++ OK, passed 100 tests.
  7115. 1307.78 s [vector] sum: OK
  7116. 1307.78 s [vector] +++ OK, passed 100 tests.
  7117. 1307.78 s [vector] product: OK
  7118. 1307.78 s [vector] +++ OK, passed 100 tests.
  7119. 1307.78 s [vector] enumFromN: OK
  7120. 1307.78 s [vector] +++ OK, passed 100 tests.
  7121. 1307.78 s [vector] enumFromThenN: OK
  7122. 1307.78 s [vector] +++ OK, passed 100 tests.
  7123. 1307.78 s [vector] enumFromTo: OK
  7124. 1307.78 s [vector] +++ OK, passed 100 tests.
  7125. 1307.79 s [vector] enumFromThenTo: OK
  7126. 1307.79 s [vector] +++ OK, passed 100 tests; 9 discarded.
  7127. 1307.79 s [vector] unstream
  7128. 1307.79 s [vector] unstream == vunstream (exact): OK
  7129. 1307.79 s [vector] +++ OK, passed 100 tests.
  7130. 1307.79 s [vector] unstream == vunstream (unknown): OK
  7131. 1307.79 s [vector] +++ OK, passed 100 tests.
  7132. 1307.79 s [vector] unstreamR ~= vunstream (exact): OK
  7133. 1307.79 s [vector] +++ OK, passed 100 tests.
  7134. 1307.79 s [vector] unstreamR ~= vunstream (unknown): OK
  7135. 1307.79 s [vector] +++ OK, passed 100 tests.
  7136. 1307.79 s [vector] Tests.Vector.Strict
  7137. 1307.79 s [vector] Bool
  7138. 1307.79 s [vector] fromList.toList == id: OK
  7139. 1307.79 s [vector] +++ OK, passed 100 tests.
  7140. 1307.79 s [vector] toList.fromList == id: OK
  7141. 1307.79 s [vector] +++ OK, passed 100 tests.
  7142. 1307.79 s [vector] unstream.stream == id: OK
  7143. 1307.79 s [vector] +++ OK, passed 100 tests.
  7144. 1307.79 s [vector] stream.unstream == id: OK
  7145. 1307.79 s [vector] +++ OK, passed 100 tests.
  7146. 1307.79 s [vector] eq: OK
  7147. 1307.79 s [vector] +++ OK, passed 100 tests.
  7148. 1307.79 s [vector] length: OK
  7149. 1307.79 s [vector] +++ OK, passed 100 tests.
  7150. 1307.79 s [vector] null: OK
  7151. 1307.79 s [vector] +++ OK, passed 100 tests.
  7152. 1307.79 s [vector] index: OK
  7153. 1307.79 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7154. 1307.79 s [vector] safeIndex: OK
  7155. 1307.79 s [vector] +++ OK, passed 100 tests.
  7156. 1307.79 s [vector] head: OK
  7157. 1307.80 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7158. 1307.80 s [vector] last: OK
  7159. 1307.80 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7160. 1307.80 s [vector] unsafeIndex: OK
  7161. 1307.80 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7162. 1307.80 s [vector] unsafeHead: OK
  7163. 1307.80 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7164. 1307.80 s [vector] unsafeLast: OK
  7165. 1307.80 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7166. 1307.80 s [vector] slice: OK
  7167. 1307.80 s [vector] +++ OK, passed 100 tests.
  7168. 1307.80 s [vector] init: OK
  7169. 1307.80 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7170. 1307.80 s [vector] tail: OK
  7171. 1307.80 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7172. 1307.80 s [vector] take: OK
  7173. 1307.80 s [vector] +++ OK, passed 100 tests.
  7174. 1307.80 s [vector] drop: OK
  7175. 1307.80 s [vector] +++ OK, passed 100 tests.
  7176. 1307.80 s [vector] splitAt: OK
  7177. 1307.80 s [vector] +++ OK, passed 100 tests.
  7178. 1307.80 s [vector] empty: OK
  7179. 1307.80 s [vector] +++ OK, passed 100 tests.
  7180. 1307.80 s [vector] singleton: OK
  7181. 1307.80 s [vector] +++ OK, passed 100 tests.
  7182. 1307.80 s [vector] replicate: OK
  7183. 1307.80 s [vector] +++ OK, passed 100 tests.
  7184. 1307.80 s [vector] generate: OK
  7185. 1307.80 s [vector] +++ OK, passed 100 tests.
  7186. 1307.82 s [vector] iterateN: OK
  7187. 1307.82 s [vector] +++ OK, passed 100 tests.
  7188. 1307.84 s [vector] iterateNM: OK (0.03s)
  7189. 1307.84 s [vector] +++ OK, passed 100 tests.
  7190. 1307.85 s [vector] generateM: OK (0.01s)
  7191. 1307.85 s [vector] +++ OK, passed 100 tests.
  7192. 1307.87 s [vector] replicateM: OK (0.02s)
  7193. 1307.87 s [vector] +++ OK, passed 100 tests.
  7194. 1307.87 s [vector] create: OK
  7195. 1307.88 s [vector] +++ OK, passed 100 tests.
  7196. 1307.88 s [vector] createT: OK
  7197. 1307.88 s [vector] +++ OK, passed 100 tests.
  7198. 1307.88 s [vector] unfoldr: OK
  7199. 1307.88 s [vector] +++ OK, passed 100 tests.
  7200. 1307.88 s [vector] unfoldrN: OK
  7201. 1307.88 s [vector] +++ OK, passed 100 tests.
  7202. 1307.90 s [vector] unfoldrExactN: OK
  7203. 1307.90 s [vector] +++ OK, passed 100 tests.
  7204. 1307.90 s [vector] unfoldrM: OK (0.01s)
  7205. 1307.90 s [vector] +++ OK, passed 100 tests.
  7206. 1307.90 s [vector] unfoldrNM: OK
  7207. 1307.90 s [vector] +++ OK, passed 100 tests.
  7208. 1307.95 s [vector] unfoldrExactNM: OK (0.03s)
  7209. 1307.95 s [vector] +++ OK, passed 100 tests.
  7210. 1307.95 s [vector] constructN: OK
  7211. 1307.95 s [vector] +++ OK, passed 100 tests.
  7212. 1307.95 s [vector] constructrN: OK
  7213. 1307.95 s [vector] +++ OK, passed 100 tests.
  7214. 1307.95 s [vector] cons: OK
  7215. 1307.95 s [vector] +++ OK, passed 100 tests.
  7216. 1307.95 s [vector] snoc: OK
  7217. 1307.95 s [vector] +++ OK, passed 100 tests.
  7218. 1307.95 s [vector] append: OK
  7219. 1307.96 s [vector] +++ OK, passed 100 tests.
  7220. 1307.96 s [vector] concat: OK
  7221. 1307.97 s [vector] +++ OK, passed 100 tests.
  7222. 1307.97 s [vector] force: OK
  7223. 1307.97 s [vector] +++ OK, passed 100 tests.
  7224. 1307.97 s [vector] upd: OK
  7225. 1307.97 s [vector] +++ OK, passed 100 tests.
  7226. 1307.97 s [vector] accum: OK
  7227. 1307.97 s [vector] +++ OK, passed 100 tests.
  7228. 1307.97 s [vector] reverse: OK
  7229. 1307.97 s [vector] +++ OK, passed 100 tests.
  7230. 1307.97 s [vector] backpermute: OK
  7231. 1307.97 s [vector] +++ OK, passed 100 tests.
  7232. 1307.98 s [vector] map: OK
  7233. 1307.98 s [vector] +++ OK, passed 100 tests.
  7234. 1307.98 s [vector] imap: OK
  7235. 1307.98 s [vector] +++ OK, passed 100 tests.
  7236. 1307.98 s [vector] concatMap: OK
  7237. 1307.98 s [vector] +++ OK, passed 100 tests.
  7238. 1307.98 s [vector] mapM: OK
  7239. 1307.98 s [vector] +++ OK, passed 100 tests.
  7240. 1307.99 s [vector] mapM_: OK
  7241. 1307.99 s [vector] +++ OK, passed 100 tests.
  7242. 1307.99 s [vector] forM: OK
  7243. 1307.99 s [vector] +++ OK, passed 100 tests.
  7244. 1308.00 s [vector] forM_: OK (0.01s)
  7245. 1308.00 s [vector] +++ OK, passed 100 tests.
  7246. 1308.00 s [vector] imapM: OK
  7247. 1308.00 s [vector] +++ OK, passed 100 tests.
  7248. 1308.01 s [vector] imapM_: OK (0.01s)
  7249. 1308.01 s [vector] +++ OK, passed 100 tests.
  7250. 1308.01 s [vector] zipWith: OK
  7251. 1308.01 s [vector] +++ OK, passed 100 tests.
  7252. 1308.02 s [vector] zipWith3: OK
  7253. 1308.02 s [vector] +++ OK, passed 100 tests.
  7254. 1308.02 s [vector] izipWith: OK
  7255. 1308.02 s [vector] +++ OK, passed 100 tests.
  7256. 1308.02 s [vector] izipWith3: OK
  7257. 1308.03 s [vector] +++ OK, passed 100 tests.
  7258. 1308.03 s [vector] izipWithM: OK
  7259. 1308.03 s [vector] +++ OK, passed 100 tests.
  7260. 1308.04 s [vector] izipWithM_: OK
  7261. 1308.04 s [vector] +++ OK, passed 100 tests.
  7262. 1308.04 s [vector] zipWithM: OK
  7263. 1308.04 s [vector] +++ OK, passed 100 tests.
  7264. 1308.04 s [vector] zipWithM_: OK
  7265. 1308.04 s [vector] +++ OK, passed 100 tests.
  7266. 1308.04 s [vector] filter: OK
  7267. 1308.06 s [vector] +++ OK, passed 100 tests.
  7268. 1308.06 s [vector] ifilter: OK
  7269. 1308.06 s [vector] +++ OK, passed 100 tests.
  7270. 1308.07 s [vector] filterM: OK (0.02s)
  7271. 1308.07 s [vector] +++ OK, passed 100 tests.
  7272. 1308.07 s [vector] uniq: OK
  7273. 1308.07 s [vector] +++ OK, passed 100 tests.
  7274. 1308.07 s [vector] mapMaybe: OK
  7275. 1308.07 s [vector] +++ OK, passed 100 tests.
  7276. 1308.07 s [vector] imapMaybe: OK
  7277. 1308.07 s [vector] +++ OK, passed 100 tests.
  7278. 1308.07 s [vector] takeWhile: OK
  7279. 1308.07 s [vector] +++ OK, passed 100 tests.
  7280. 1308.07 s [vector] dropWhile: OK
  7281. 1308.07 s [vector] +++ OK, passed 100 tests.
  7282. 1308.07 s [vector] partition: OK
  7283. 1308.07 s [vector] +++ OK, passed 100 tests.
  7284. 1308.07 s [vector] partitionWith: OK
  7285. 1308.07 s [vector] +++ OK, passed 100 tests.
  7286. 1308.08 s [vector] span: OK
  7287. 1308.08 s [vector] +++ OK, passed 100 tests.
  7288. 1308.08 s [vector] break: OK
  7289. 1308.08 s [vector] +++ OK, passed 100 tests.
  7290. 1308.08 s [vector] spanR: OK
  7291. 1308.08 s [vector] +++ OK, passed 100 tests.
  7292. 1308.08 s [vector] breakR: OK
  7293. 1308.08 s [vector] +++ OK, passed 100 tests.
  7294. 1308.08 s [vector] groupBy: OK
  7295. 1308.08 s [vector] +++ OK, passed 100 tests.
  7296. 1308.08 s [vector] elem: OK
  7297. 1308.08 s [vector] +++ OK, passed 100 tests.
  7298. 1308.08 s [vector] notElem: OK
  7299. 1308.08 s [vector] +++ OK, passed 100 tests.
  7300. 1308.08 s [vector] find: OK
  7301. 1308.08 s [vector] +++ OK, passed 100 tests.
  7302. 1308.08 s [vector] findIndex: OK
  7303. 1308.08 s [vector] +++ OK, passed 100 tests.
  7304. 1308.08 s [vector] findIndexR: OK
  7305. 1308.08 s [vector] +++ OK, passed 100 tests.
  7306. 1308.08 s [vector] findIndices: OK
  7307. 1308.08 s [vector] +++ OK, passed 100 tests.
  7308. 1308.08 s [vector] elemIndex: OK
  7309. 1308.08 s [vector] +++ OK, passed 100 tests.
  7310. 1308.08 s [vector] elemIndices: OK
  7311. 1308.08 s [vector] +++ OK, passed 100 tests.
  7312. 1308.09 s [vector] foldl: OK
  7313. 1308.09 s [vector] +++ OK, passed 100 tests.
  7314. 1308.09 s [vector] foldl1: OK
  7315. 1308.09 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7316. 1308.09 s [vector] foldl': OK
  7317. 1308.09 s [vector] +++ OK, passed 100 tests.
  7318. 1308.09 s [vector] foldl1': OK
  7319. 1308.09 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7320. 1308.09 s [vector] foldr: OK
  7321. 1308.09 s [vector] +++ OK, passed 100 tests.
  7322. 1308.09 s [vector] foldr1: OK
  7323. 1308.09 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7324. 1308.10 s [vector] foldr': OK
  7325. 1308.10 s [vector] +++ OK, passed 100 tests.
  7326. 1308.10 s [vector] foldr1': OK
  7327. 1308.10 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7328. 1308.10 s [vector] ifoldl: OK
  7329. 1308.10 s [vector] +++ OK, passed 100 tests.
  7330. 1308.10 s [vector] ifoldl': OK
  7331. 1308.10 s [vector] +++ OK, passed 100 tests.
  7332. 1308.11 s [vector] ifoldr: OK
  7333. 1308.11 s [vector] +++ OK, passed 100 tests.
  7334. 1308.11 s [vector] ifoldr': OK
  7335. 1308.11 s [vector] +++ OK, passed 100 tests.
  7336. 1308.11 s [vector] ifoldM: OK
  7337. 1308.11 s [vector] +++ OK, passed 100 tests.
  7338. 1308.11 s [vector] ifoldM': OK
  7339. 1308.11 s [vector] +++ OK, passed 100 tests.
  7340. 1308.13 s [vector] ifoldM_: OK (0.01s)
  7341. 1308.14 s [vector] +++ OK, passed 100 tests.
  7342. 1308.14 s [vector] ifoldM'_: OK (0.01s)
  7343. 1308.14 s [vector] +++ OK, passed 100 tests.
  7344. 1308.14 s [vector] all: OK
  7345. 1308.14 s [vector] +++ OK, passed 100 tests.
  7346. 1308.14 s [vector] any: OK
  7347. 1308.14 s [vector] +++ OK, passed 100 tests.
  7348. 1308.14 s [vector] prescanl: OK
  7349. 1308.14 s [vector] +++ OK, passed 100 tests.
  7350. 1308.14 s [vector] prescanl': OK
  7351. 1308.14 s [vector] +++ OK, passed 100 tests.
  7352. 1308.14 s [vector] postscanl: OK
  7353. 1308.14 s [vector] +++ OK, passed 100 tests.
  7354. 1308.14 s [vector] postscanl': OK
  7355. 1308.15 s [vector] +++ OK, passed 100 tests.
  7356. 1308.15 s [vector] scanl: OK
  7357. 1308.15 s [vector] +++ OK, passed 100 tests.
  7358. 1308.15 s [vector] scanl': OK
  7359. 1308.15 s [vector] +++ OK, passed 100 tests.
  7360. 1308.15 s [vector] scanl1: OK
  7361. 1308.15 s [vector] +++ OK, passed 100 tests.
  7362. 1308.15 s [vector] scanl1': OK
  7363. 1308.15 s [vector] +++ OK, passed 100 tests.
  7364. 1308.15 s [vector] iscanl: OK
  7365. 1308.15 s [vector] +++ OK, passed 100 tests.
  7366. 1308.16 s [vector] iscanl': OK
  7367. 1308.16 s [vector] +++ OK, passed 100 tests.
  7368. 1308.16 s [vector] prescanr: OK
  7369. 1308.16 s [vector] +++ OK, passed 100 tests.
  7370. 1308.16 s [vector] prescanr': OK
  7371. 1308.16 s [vector] +++ OK, passed 100 tests.
  7372. 1308.16 s [vector] postscanr: OK
  7373. 1308.16 s [vector] +++ OK, passed 100 tests.
  7374. 1308.16 s [vector] postscanr': OK
  7375. 1308.16 s [vector] +++ OK, passed 100 tests.
  7376. 1308.16 s [vector] scanr: OK
  7377. 1308.16 s [vector] +++ OK, passed 100 tests.
  7378. 1308.17 s [vector] scanr': OK
  7379. 1308.17 s [vector] +++ OK, passed 100 tests.
  7380. 1308.17 s [vector] scanr1: OK
  7381. 1308.17 s [vector] +++ OK, passed 100 tests.
  7382. 1308.17 s [vector] scanr1': OK
  7383. 1308.17 s [vector] +++ OK, passed 100 tests.
  7384. 1308.17 s [vector] iscanr: OK
  7385. 1308.17 s [vector] +++ OK, passed 100 tests.
  7386. 1308.17 s [vector] iscanr': OK
  7387. 1308.17 s [vector] +++ OK, passed 100 tests.
  7388. 1308.17 s [vector] mut_read: OK
  7389. 1308.17 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7390. 1308.17 s [vector] mut_write: OK
  7391. 1308.17 s [vector] +++ OK, passed 100 tests; 22 discarded.
  7392. 1308.18 s [vector] mut_modify: OK
  7393. 1308.18 s [vector] +++ OK, passed 100 tests; 11 discarded.
  7394. 1308.18 s [vector] mut_generate: OK
  7395. 1308.18 s [vector] +++ OK, passed 100 tests.
  7396. 1308.18 s [vector] mut_generateM: OK
  7397. 1308.19 s [vector] +++ OK, passed 100 tests.
  7398. 1308.21 s [vector] mut_mapM_: OK (0.01s)
  7399. 1308.21 s [vector] +++ OK, passed 100 tests.
  7400. 1308.21 s [vector] mut_imapM_: OK (0.01s)
  7401. 1308.21 s [vector] +++ OK, passed 100 tests.
  7402. 1308.23 s [vector] mut_forM_: OK (0.01s)
  7403. 1308.23 s [vector] +++ OK, passed 100 tests.
  7404. 1308.23 s [vector] mut_iforM_: OK (0.01s)
  7405. 1308.23 s [vector] +++ OK, passed 100 tests.
  7406. 1308.23 s [vector] mut_foldr: OK
  7407. 1308.23 s [vector] +++ OK, passed 100 tests.
  7408. 1308.23 s [vector] mut_foldr': OK
  7409. 1308.23 s [vector] +++ OK, passed 100 tests.
  7410. 1308.24 s [vector] mut_foldl: OK
  7411. 1308.24 s [vector] +++ OK, passed 100 tests.
  7412. 1308.24 s [vector] mut_foldl': OK
  7413. 1308.24 s [vector] +++ OK, passed 100 tests.
  7414. 1308.24 s [vector] mut_ifoldr: OK
  7415. 1308.25 s [vector] +++ OK, passed 100 tests.
  7416. 1308.25 s [vector] mut_ifoldr': OK
  7417. 1308.25 s [vector] +++ OK, passed 100 tests.
  7418. 1308.25 s [vector] mut_ifoldl: OK
  7419. 1308.25 s [vector] +++ OK, passed 100 tests.
  7420. 1308.25 s [vector] mut_ifoldl': OK
  7421. 1308.25 s [vector] +++ OK, passed 100 tests.
  7422. 1308.25 s [vector] mut_foldM: OK
  7423. 1308.25 s [vector] +++ OK, passed 100 tests.
  7424. 1308.25 s [vector] mut_foldM': OK
  7425. 1308.25 s [vector] +++ OK, passed 100 tests.
  7426. 1308.25 s [vector] mut_foldrM: OK
  7427. 1308.25 s [vector] +++ OK, passed 100 tests.
  7428. 1308.26 s [vector] mut_foldrM': OK
  7429. 1308.26 s [vector] +++ OK, passed 100 tests.
  7430. 1308.26 s [vector] mut_ifoldM: OK
  7431. 1308.26 s [vector] +++ OK, passed 100 tests.
  7432. 1308.26 s [vector] mut_ifoldM': OK
  7433. 1308.26 s [vector] +++ OK, passed 100 tests.
  7434. 1308.27 s [vector] mut_ifoldrM: OK
  7435. 1308.27 s [vector] +++ OK, passed 100 tests.
  7436. 1308.27 s [vector] mut_ifoldrM': OK
  7437. 1308.27 s [vector] +++ OK, passed 100 tests.
  7438. 1308.27 s [vector] compare: OK
  7439. 1308.27 s [vector] +++ OK, passed 100 tests.
  7440. 1308.27 s [vector] maximum: OK
  7441. 1308.27 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7442. 1308.27 s [vector] minimum: OK
  7443. 1308.27 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7444. 1308.27 s [vector] minIndex: OK
  7445. 1308.27 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7446. 1308.27 s [vector] maxIndex: OK
  7447. 1308.27 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7448. 1308.27 s [vector] maximumBy: OK
  7449. 1308.27 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7450. 1308.27 s [vector] minimumBy: OK
  7451. 1308.27 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7452. 1308.27 s [vector] maximumOn: OK
  7453. 1308.27 s [vector] +++ OK, passed 100 tests; 22 discarded.
  7454. 1308.27 s [vector] minimumOn: OK
  7455. 1308.27 s [vector] +++ OK, passed 100 tests; 11 discarded.
  7456. 1308.27 s [vector] maxIndexBy: OK
  7457. 1308.27 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7458. 1308.27 s [vector] minIndexBy: OK
  7459. 1308.27 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7460. 1308.27 s [vector] ListFirstMaxIndexWins: OK
  7461. 1308.27 s [vector] +++ OK, passed 100 tests; 21 discarded.
  7462. 1308.27 s [vector] FalseListFirstMaxIndexWins: OK
  7463. 1308.27 s [vector] +++ OK, failed as expected. (after 1 test):
  7464. 1308.27 s [vector] Exception:
  7465. 1308.27 s [vector] Prelude.foldr1: empty list
  7466. 1308.27 s [vector] CallStack (from HasCallStack):
  7467. 1308.27 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  7468. 1308.27 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  7469. 1308.27 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  7470. 1308.27 s [vector] []
  7471. 1308.27 s [vector] zip: OK
  7472. 1308.27 s [vector] +++ OK, passed 100 tests.
  7473. 1308.28 s [vector] zip3: OK
  7474. 1308.28 s [vector] +++ OK, passed 100 tests.
  7475. 1308.28 s [vector] unzip: OK
  7476. 1308.28 s [vector] +++ OK, passed 100 tests.
  7477. 1308.28 s [vector] unzip3: OK
  7478. 1308.28 s [vector] +++ OK, passed 100 tests.
  7479. 1308.28 s [vector] indexed: OK
  7480. 1308.28 s [vector] +++ OK, passed 100 tests.
  7481. 1308.28 s [vector] update: OK
  7482. 1308.29 s [vector] +++ OK, passed 100 tests.
  7483. 1308.29 s [vector] concat: OK
  7484. 1308.29 s [vector] +++ OK, passed 100 tests.
  7485. 1308.29 s [vector] mempty: OK
  7486. 1308.29 s [vector] +++ OK, passed 100 tests.
  7487. 1308.29 s [vector] mappend: OK
  7488. 1308.29 s [vector] +++ OK, passed 100 tests.
  7489. 1308.29 s [vector] mconcat: OK
  7490. 1308.29 s [vector] +++ OK, passed 100 tests.
  7491. 1308.30 s [vector] fmap: OK
  7492. 1308.31 s [vector] +++ OK, passed 100 tests.
  7493. 1308.31 s [vector] return: OK
  7494. 1308.31 s [vector] +++ OK, passed 100 tests.
  7495. 1308.32 s [vector] bind: OK (0.01s)
  7496. 1308.32 s [vector] +++ OK, passed 100 tests.
  7497. 1308.32 s [vector] mzip: OK
  7498. 1308.32 s [vector] +++ OK, passed 100 tests.
  7499. 1308.32 s [vector] munzip: OK
  7500. 1308.32 s [vector] +++ OK, passed 100 tests.
  7501. 1308.33 s [vector] applicative_pure: OK
  7502. 1308.33 s [vector] +++ OK, passed 100 tests.
  7503. 1308.33 s [vector] applicative_appl: OK (0.01s)
  7504. 1308.34 s [vector] +++ OK, passed 100 tests.
  7505. 1308.34 s [vector] alternative_empty: OK
  7506. 1308.34 s [vector] +++ OK, passed 100 tests.
  7507. 1308.34 s [vector] alternative_or: OK
  7508. 1308.34 s [vector] +++ OK, passed 100 tests.
  7509. 1308.35 s [vector] sequence: OK (0.02s)
  7510. 1308.35 s [vector] +++ OK, passed 100 tests.
  7511. 1308.36 s [vector] sequence_: OK (0.01s)
  7512. 1308.36 s [vector] +++ OK, passed 100 tests.
  7513. 1308.36 s [vector] glength: OK
  7514. 1308.36 s [vector] +++ OK, passed 100 tests.
  7515. 1308.36 s [vector] and: OK
  7516. 1308.36 s [vector] +++ OK, passed 100 tests.
  7517. 1308.36 s [vector] or: OK
  7518. 1308.36 s [vector] +++ OK, passed 100 tests.
  7519. 1308.36 s [vector] Int
  7520. 1308.36 s [vector] fromList.toList == id: OK
  7521. 1308.36 s [vector] +++ OK, passed 100 tests.
  7522. 1308.36 s [vector] toList.fromList == id: OK
  7523. 1308.36 s [vector] +++ OK, passed 100 tests.
  7524. 1308.36 s [vector] unstream.stream == id: OK
  7525. 1308.36 s [vector] +++ OK, passed 100 tests.
  7526. 1308.36 s [vector] stream.unstream == id: OK
  7527. 1308.36 s [vector] +++ OK, passed 100 tests.
  7528. 1308.36 s [vector] eq: OK
  7529. 1308.36 s [vector] +++ OK, passed 100 tests.
  7530. 1308.36 s [vector] length: OK
  7531. 1308.36 s [vector] +++ OK, passed 100 tests.
  7532. 1308.36 s [vector] null: OK
  7533. 1308.36 s [vector] +++ OK, passed 100 tests.
  7534. 1308.37 s [vector] index: OK
  7535. 1308.37 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7536. 1308.37 s [vector] safeIndex: OK
  7537. 1308.37 s [vector] +++ OK, passed 100 tests.
  7538. 1308.37 s [vector] head: OK
  7539. 1308.37 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7540. 1308.37 s [vector] last: OK
  7541. 1308.37 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7542. 1308.37 s [vector] unsafeIndex: OK
  7543. 1308.37 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7544. 1308.37 s [vector] unsafeHead: OK
  7545. 1308.37 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7546. 1308.37 s [vector] unsafeLast: OK
  7547. 1308.37 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7548. 1308.37 s [vector] slice: OK
  7549. 1308.37 s [vector] +++ OK, passed 100 tests.
  7550. 1308.37 s [vector] init: OK
  7551. 1308.37 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7552. 1308.37 s [vector] tail: OK
  7553. 1308.37 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7554. 1308.37 s [vector] take: OK
  7555. 1308.37 s [vector] +++ OK, passed 100 tests.
  7556. 1308.37 s [vector] drop: OK
  7557. 1308.37 s [vector] +++ OK, passed 100 tests.
  7558. 1308.37 s [vector] splitAt: OK
  7559. 1308.37 s [vector] +++ OK, passed 100 tests.
  7560. 1308.37 s [vector] empty: OK
  7561. 1308.37 s [vector] +++ OK, passed 100 tests.
  7562. 1308.37 s [vector] singleton: OK
  7563. 1308.37 s [vector] +++ OK, passed 100 tests.
  7564. 1308.37 s [vector] replicate: OK
  7565. 1308.37 s [vector] +++ OK, passed 100 tests.
  7566. 1308.37 s [vector] generate: OK
  7567. 1308.39 s [vector] +++ OK, passed 100 tests.
  7568. 1308.40 s [vector] iterateN: OK
  7569. 1308.40 s [vector] +++ OK, passed 100 tests.
  7570. 1308.41 s [vector] iterateNM: OK (0.03s)
  7571. 1308.42 s [vector] +++ OK, passed 100 tests.
  7572. 1308.44 s [vector] generateM: OK (0.02s)
  7573. 1308.44 s [vector] +++ OK, passed 100 tests.
  7574. 1308.44 s [vector] replicateM: OK
  7575. 1308.44 s [vector] +++ OK, passed 100 tests.
  7576. 1308.44 s [vector] create: OK
  7577. 1308.44 s [vector] +++ OK, passed 100 tests.
  7578. 1308.44 s [vector] createT: OK
  7579. 1308.44 s [vector] +++ OK, passed 100 tests.
  7580. 1308.44 s [vector] unfoldr: OK
  7581. 1308.44 s [vector] +++ OK, passed 100 tests.
  7582. 1308.45 s [vector] unfoldrN: OK
  7583. 1308.45 s [vector] +++ OK, passed 100 tests.
  7584. 1308.45 s [vector] unfoldrExactN: OK
  7585. 1308.45 s [vector] +++ OK, passed 100 tests.
  7586. 1308.45 s [vector] unfoldrM: OK
  7587. 1308.45 s [vector] +++ OK, passed 100 tests.
  7588. 1308.45 s [vector] unfoldrNM: OK
  7589. 1308.45 s [vector] +++ OK, passed 100 tests.
  7590. 1308.49 s [vector] unfoldrExactNM: OK (0.03s)
  7591. 1308.49 s [vector] +++ OK, passed 100 tests.
  7592. 1308.49 s [vector] constructN: OK
  7593. 1308.49 s [vector] +++ OK, passed 100 tests.
  7594. 1308.49 s [vector] constructrN: OK
  7595. 1308.49 s [vector] +++ OK, passed 100 tests.
  7596. 1308.49 s [vector] cons: OK
  7597. 1308.49 s [vector] +++ OK, passed 100 tests.
  7598. 1308.49 s [vector] snoc: OK
  7599. 1308.49 s [vector] +++ OK, passed 100 tests.
  7600. 1308.49 s [vector] append: OK
  7601. 1308.49 s [vector] +++ OK, passed 100 tests.
  7602. 1308.50 s [vector] concat: OK (0.01s)
  7603. 1308.50 s [vector] +++ OK, passed 100 tests.
  7604. 1308.50 s [vector] force: OK
  7605. 1308.50 s [vector] +++ OK, passed 100 tests.
  7606. 1308.51 s [vector] upd: OK
  7607. 1308.51 s [vector] +++ OK, passed 100 tests.
  7608. 1308.51 s [vector] accum: OK
  7609. 1308.51 s [vector] +++ OK, passed 100 tests.
  7610. 1308.51 s [vector] reverse: OK
  7611. 1308.51 s [vector] +++ OK, passed 100 tests.
  7612. 1308.51 s [vector] backpermute: OK
  7613. 1308.51 s [vector] +++ OK, passed 100 tests.
  7614. 1308.52 s [vector] map: OK
  7615. 1308.52 s [vector] +++ OK, passed 100 tests.
  7616. 1308.52 s [vector] imap: OK
  7617. 1308.52 s [vector] +++ OK, passed 100 tests.
  7618. 1308.52 s [vector] concatMap: OK
  7619. 1308.52 s [vector] +++ OK, passed 100 tests.
  7620. 1308.53 s [vector] mapM: OK
  7621. 1308.53 s [vector] +++ OK, passed 100 tests.
  7622. 1308.54 s [vector] mapM_: OK (0.02s)
  7623. 1308.54 s [vector] +++ OK, passed 100 tests.
  7624. 1308.54 s [vector] forM: OK
  7625. 1308.54 s [vector] +++ OK, passed 100 tests.
  7626. 1308.56 s [vector] forM_: OK (0.02s)
  7627. 1308.57 s [vector] +++ OK, passed 100 tests.
  7628. 1308.58 s [vector] imapM: OK
  7629. 1308.58 s [vector] +++ OK, passed 100 tests.
  7630. 1308.58 s [vector] imapM_: OK (0.01s)
  7631. 1308.58 s [vector] +++ OK, passed 100 tests.
  7632. 1308.58 s [vector] zipWith: OK
  7633. 1308.58 s [vector] +++ OK, passed 100 tests.
  7634. 1308.58 s [vector] zipWith3: OK
  7635. 1308.58 s [vector] +++ OK, passed 100 tests.
  7636. 1308.59 s [vector] izipWith: OK
  7637. 1308.59 s [vector] +++ OK, passed 100 tests.
  7638. 1308.59 s [vector] izipWith3: OK
  7639. 1308.59 s [vector] +++ OK, passed 100 tests.
  7640. 1308.59 s [vector] izipWithM: OK
  7641. 1308.61 s [vector] +++ OK, passed 100 tests.
  7642. 1308.61 s [vector] izipWithM_: OK (0.02s)
  7643. 1308.62 s [vector] +++ OK, passed 100 tests.
  7644. 1308.63 s [vector] zipWithM: OK
  7645. 1308.63 s [vector] +++ OK, passed 100 tests.
  7646. 1308.63 s [vector] zipWithM_: OK (0.01s)
  7647. 1308.63 s [vector] +++ OK, passed 100 tests.
  7648. 1308.63 s [vector] filter: OK
  7649. 1308.64 s [vector] +++ OK, passed 100 tests.
  7650. 1308.64 s [vector] ifilter: OK
  7651. 1308.64 s [vector] +++ OK, passed 100 tests.
  7652. 1308.66 s [vector] filterM: OK (0.03s)
  7653. 1308.66 s [vector] +++ OK, passed 100 tests.
  7654. 1308.67 s [vector] uniq: OK
  7655. 1308.67 s [vector] +++ OK, passed 100 tests.
  7656. 1308.67 s [vector] mapMaybe: OK
  7657. 1308.67 s [vector] +++ OK, passed 100 tests.
  7658. 1308.67 s [vector] imapMaybe: OK
  7659. 1308.67 s [vector] +++ OK, passed 100 tests.
  7660. 1308.67 s [vector] takeWhile: OK
  7661. 1308.67 s [vector] +++ OK, passed 100 tests.
  7662. 1308.67 s [vector] dropWhile: OK
  7663. 1308.67 s [vector] +++ OK, passed 100 tests.
  7664. 1308.67 s [vector] partition: OK
  7665. 1308.68 s [vector] +++ OK, passed 100 tests.
  7666. 1308.68 s [vector] partitionWith: OK
  7667. 1308.68 s [vector] +++ OK, passed 100 tests.
  7668. 1308.68 s [vector] span: OK
  7669. 1308.68 s [vector] +++ OK, passed 100 tests.
  7670. 1308.68 s [vector] break: OK
  7671. 1308.68 s [vector] +++ OK, passed 100 tests.
  7672. 1308.68 s [vector] spanR: OK
  7673. 1308.68 s [vector] +++ OK, passed 100 tests.
  7674. 1308.68 s [vector] breakR: OK
  7675. 1308.68 s [vector] +++ OK, passed 100 tests.
  7676. 1308.69 s [vector] groupBy: OK
  7677. 1308.69 s [vector] +++ OK, passed 100 tests.
  7678. 1308.69 s [vector] elem: OK
  7679. 1308.69 s [vector] +++ OK, passed 100 tests.
  7680. 1308.69 s [vector] notElem: OK
  7681. 1308.69 s [vector] +++ OK, passed 100 tests.
  7682. 1308.69 s [vector] find: OK
  7683. 1308.69 s [vector] +++ OK, passed 100 tests.
  7684. 1308.69 s [vector] findIndex: OK
  7685. 1308.69 s [vector] +++ OK, passed 100 tests.
  7686. 1308.69 s [vector] findIndexR: OK
  7687. 1308.69 s [vector] +++ OK, passed 100 tests.
  7688. 1308.69 s [vector] findIndices: OK
  7689. 1308.69 s [vector] +++ OK, passed 100 tests.
  7690. 1308.69 s [vector] elemIndex: OK
  7691. 1308.69 s [vector] +++ OK, passed 100 tests.
  7692. 1308.69 s [vector] elemIndices: OK
  7693. 1308.69 s [vector] +++ OK, passed 100 tests.
  7694. 1308.70 s [vector] foldl: OK
  7695. 1308.70 s [vector] +++ OK, passed 100 tests.
  7696. 1308.70 s [vector] foldl1: OK
  7697. 1308.71 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7698. 1308.71 s [vector] foldl': OK
  7699. 1308.71 s [vector] +++ OK, passed 100 tests.
  7700. 1308.72 s [vector] foldl1': OK
  7701. 1308.72 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7702. 1308.72 s [vector] foldr: OK
  7703. 1308.72 s [vector] +++ OK, passed 100 tests.
  7704. 1308.72 s [vector] foldr1: OK
  7705. 1308.73 s [vector] +++ OK, passed 100 tests; 25 discarded.
  7706. 1308.73 s [vector] foldr': OK
  7707. 1308.74 s [vector] +++ OK, passed 100 tests.
  7708. 1308.74 s [vector] foldr1': OK
  7709. 1308.75 s [vector] +++ OK, passed 100 tests; 11 discarded.
  7710. 1308.75 s [vector] ifoldl: OK
  7711. 1308.75 s [vector] +++ OK, passed 100 tests.
  7712. 1308.75 s [vector] ifoldl': OK
  7713. 1308.75 s [vector] +++ OK, passed 100 tests.
  7714. 1308.75 s [vector] ifoldr: OK
  7715. 1308.75 s [vector] +++ OK, passed 100 tests.
  7716. 1308.76 s [vector] ifoldr': OK
  7717. 1308.76 s [vector] +++ OK, passed 100 tests.
  7718. 1308.76 s [vector] ifoldM: OK
  7719. 1308.76 s [vector] +++ OK, passed 100 tests.
  7720. 1308.76 s [vector] ifoldM': OK
  7721. 1308.76 s [vector] +++ OK, passed 100 tests.
  7722. 1308.79 s [vector] ifoldM_: OK (0.03s)
  7723. 1308.80 s [vector] +++ OK, passed 100 tests.
  7724. 1308.80 s [vector] ifoldM'_: OK (0.02s)
  7725. 1308.80 s [vector] +++ OK, passed 100 tests.
  7726. 1308.80 s [vector] all: OK
  7727. 1308.80 s [vector] +++ OK, passed 100 tests.
  7728. 1308.80 s [vector] any: OK
  7729. 1308.80 s [vector] +++ OK, passed 100 tests.
  7730. 1308.82 s [vector] prescanl: OK
  7731. 1308.82 s [vector] +++ OK, passed 100 tests.
  7732. 1308.82 s [vector] prescanl': OK (0.02s)
  7733. 1308.83 s [vector] +++ OK, passed 100 tests.
  7734. 1308.83 s [vector] postscanl: OK
  7735. 1308.83 s [vector] +++ OK, passed 100 tests.
  7736. 1308.84 s [vector] postscanl': OK
  7737. 1308.84 s [vector] +++ OK, passed 100 tests.
  7738. 1308.85 s [vector] scanl: OK
  7739. 1308.85 s [vector] +++ OK, passed 100 tests.
  7740. 1308.86 s [vector] scanl': OK
  7741. 1308.86 s [vector] +++ OK, passed 100 tests.
  7742. 1308.86 s [vector] scanl1: OK
  7743. 1308.86 s [vector] +++ OK, passed 100 tests.
  7744. 1308.86 s [vector] scanl1': OK
  7745. 1308.86 s [vector] +++ OK, passed 100 tests.
  7746. 1308.86 s [vector] iscanl: OK
  7747. 1308.86 s [vector] +++ OK, passed 100 tests.
  7748. 1308.86 s [vector] iscanl': OK
  7749. 1308.86 s [vector] +++ OK, passed 100 tests.
  7750. 1308.86 s [vector] prescanr: OK
  7751. 1308.87 s [vector] +++ OK, passed 100 tests.
  7752. 1308.87 s [vector] prescanr': OK
  7753. 1308.87 s [vector] +++ OK, passed 100 tests.
  7754. 1308.87 s [vector] postscanr: OK
  7755. 1308.87 s [vector] +++ OK, passed 100 tests.
  7756. 1308.87 s [vector] postscanr': OK
  7757. 1308.87 s [vector] +++ OK, passed 100 tests.
  7758. 1308.87 s [vector] scanr: OK
  7759. 1308.87 s [vector] +++ OK, passed 100 tests.
  7760. 1308.88 s [vector] scanr': OK
  7761. 1308.88 s [vector] +++ OK, passed 100 tests.
  7762. 1308.88 s [vector] scanr1: OK
  7763. 1308.88 s [vector] +++ OK, passed 100 tests.
  7764. 1308.89 s [vector] scanr1': OK
  7765. 1308.89 s [vector] +++ OK, passed 100 tests.
  7766. 1308.89 s [vector] iscanr: OK
  7767. 1308.89 s [vector] +++ OK, passed 100 tests.
  7768. 1308.89 s [vector] iscanr': OK
  7769. 1308.89 s [vector] +++ OK, passed 100 tests.
  7770. 1308.89 s [vector] mut_read: OK
  7771. 1308.89 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7772. 1308.89 s [vector] mut_write: OK
  7773. 1308.89 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7774. 1308.89 s [vector] mut_modify: OK
  7775. 1308.89 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7776. 1308.89 s [vector] mut_generate: OK
  7777. 1308.89 s [vector] +++ OK, passed 100 tests.
  7778. 1308.90 s [vector] mut_generateM: OK
  7779. 1308.90 s [vector] +++ OK, passed 100 tests.
  7780. 1308.93 s [vector] mut_mapM_: OK (0.02s)
  7781. 1308.94 s [vector] +++ OK, passed 100 tests.
  7782. 1308.95 s [vector] mut_imapM_: OK (0.02s)
  7783. 1308.95 s [vector] +++ OK, passed 100 tests.
  7784. 1308.96 s [vector] mut_forM_: OK (0.02s)
  7785. 1308.96 s [vector] +++ OK, passed 100 tests.
  7786. 1308.97 s [vector] mut_iforM_: OK (0.02s)
  7787. 1308.97 s [vector] +++ OK, passed 100 tests.
  7788. 1308.97 s [vector] mut_foldr: OK
  7789. 1308.97 s [vector] +++ OK, passed 100 tests.
  7790. 1308.98 s [vector] mut_foldr': OK
  7791. 1308.98 s [vector] +++ OK, passed 100 tests.
  7792. 1308.99 s [vector] mut_foldl: OK
  7793. 1308.99 s [vector] +++ OK, passed 100 tests.
  7794. 1308.99 s [vector] mut_foldl': OK
  7795. 1308.99 s [vector] +++ OK, passed 100 tests.
  7796. 1309.00 s [vector] mut_ifoldr: OK
  7797. 1309.00 s [vector] +++ OK, passed 100 tests.
  7798. 1309.01 s [vector] mut_ifoldr': OK
  7799. 1309.01 s [vector] +++ OK, passed 100 tests.
  7800. 1309.01 s [vector] mut_ifoldl: OK
  7801. 1309.01 s [vector] +++ OK, passed 100 tests.
  7802. 1309.01 s [vector] mut_ifoldl': OK
  7803. 1309.01 s [vector] +++ OK, passed 100 tests.
  7804. 1309.01 s [vector] mut_foldM: OK
  7805. 1309.01 s [vector] +++ OK, passed 100 tests.
  7806. 1309.01 s [vector] mut_foldM': OK
  7807. 1309.01 s [vector] +++ OK, passed 100 tests.
  7808. 1309.01 s [vector] mut_foldrM: OK
  7809. 1309.01 s [vector] +++ OK, passed 100 tests.
  7810. 1309.01 s [vector] mut_foldrM': OK
  7811. 1309.01 s [vector] +++ OK, passed 100 tests.
  7812. 1309.01 s [vector] mut_ifoldM: OK
  7813. 1309.02 s [vector] +++ OK, passed 100 tests.
  7814. 1309.02 s [vector] mut_ifoldM': OK
  7815. 1309.02 s [vector] +++ OK, passed 100 tests.
  7816. 1309.03 s [vector] mut_ifoldrM: OK
  7817. 1309.03 s [vector] +++ OK, passed 100 tests.
  7818. 1309.03 s [vector] mut_ifoldrM': OK
  7819. 1309.03 s [vector] +++ OK, passed 100 tests.
  7820. 1309.03 s [vector] compare: OK
  7821. 1309.03 s [vector] +++ OK, passed 100 tests.
  7822. 1309.03 s [vector] maximum: OK
  7823. 1309.03 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7824. 1309.03 s [vector] minimum: OK
  7825. 1309.03 s [vector] +++ OK, passed 100 tests; 10 discarded.
  7826. 1309.03 s [vector] minIndex: OK
  7827. 1309.03 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7828. 1309.03 s [vector] maxIndex: OK
  7829. 1309.03 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7830. 1309.03 s [vector] maximumBy: OK
  7831. 1309.03 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7832. 1309.03 s [vector] minimumBy: OK
  7833. 1309.03 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7834. 1309.03 s [vector] maximumOn: OK
  7835. 1309.03 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7836. 1309.03 s [vector] minimumOn: OK
  7837. 1309.03 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7838. 1309.03 s [vector] maxIndexBy: OK
  7839. 1309.03 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7840. 1309.03 s [vector] minIndexBy: OK
  7841. 1309.03 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7842. 1309.03 s [vector] ListFirstMaxIndexWins: OK
  7843. 1309.03 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7844. 1309.03 s [vector] FalseListFirstMaxIndexWins: OK
  7845. 1309.04 s [vector] +++ OK, failed as expected. (after 1 test):
  7846. 1309.04 s [vector] Exception:
  7847. 1309.04 s [vector] Prelude.foldr1: empty list
  7848. 1309.04 s [vector] CallStack (from HasCallStack):
  7849. 1309.04 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  7850. 1309.04 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  7851. 1309.04 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  7852. 1309.04 s [vector] []
  7853. 1309.04 s [vector] zip: OK
  7854. 1309.04 s [vector] +++ OK, passed 100 tests.
  7855. 1309.04 s [vector] zip3: OK
  7856. 1309.04 s [vector] +++ OK, passed 100 tests.
  7857. 1309.04 s [vector] unzip: OK
  7858. 1309.04 s [vector] +++ OK, passed 100 tests.
  7859. 1309.04 s [vector] unzip3: OK
  7860. 1309.04 s [vector] +++ OK, passed 100 tests.
  7861. 1309.04 s [vector] indexed: OK
  7862. 1309.04 s [vector] +++ OK, passed 100 tests.
  7863. 1309.04 s [vector] update: OK
  7864. 1309.04 s [vector] +++ OK, passed 100 tests.
  7865. 1309.05 s [vector] concat: OK
  7866. 1309.05 s [vector] +++ OK, passed 100 tests.
  7867. 1309.05 s [vector] mempty: OK
  7868. 1309.05 s [vector] +++ OK, passed 100 tests.
  7869. 1309.05 s [vector] mappend: OK
  7870. 1309.05 s [vector] +++ OK, passed 100 tests.
  7871. 1309.07 s [vector] mconcat: OK (0.01s)
  7872. 1309.07 s [vector] +++ OK, passed 100 tests.
  7873. 1309.07 s [vector] fmap: OK
  7874. 1309.07 s [vector] +++ OK, passed 100 tests.
  7875. 1309.07 s [vector] return: OK
  7876. 1309.07 s [vector] +++ OK, passed 100 tests.
  7877. 1309.09 s [vector] bind: OK (0.02s)
  7878. 1309.09 s [vector] +++ OK, passed 100 tests.
  7879. 1309.09 s [vector] mzip: OK
  7880. 1309.09 s [vector] +++ OK, passed 100 tests.
  7881. 1309.09 s [vector] munzip: OK
  7882. 1309.09 s [vector] +++ OK, passed 100 tests.
  7883. 1309.09 s [vector] applicative_pure: OK
  7884. 1309.09 s [vector] +++ OK, passed 100 tests.
  7885. 1309.12 s [vector] applicative_appl: OK (0.03s)
  7886. 1309.12 s [vector] +++ OK, passed 100 tests.
  7887. 1309.12 s [vector] alternative_empty: OK
  7888. 1309.12 s [vector] +++ OK, passed 100 tests.
  7889. 1309.12 s [vector] alternative_or: OK
  7890. 1309.12 s [vector] +++ OK, passed 100 tests.
  7891. 1309.17 s [vector] sequence: OK (0.04s)
  7892. 1309.17 s [vector] +++ OK, passed 100 tests.
  7893. 1309.18 s [vector] sequence_: OK
  7894. 1309.18 s [vector] +++ OK, passed 100 tests.
  7895. 1309.18 s [vector] glength: OK
  7896. 1309.18 s [vector] +++ OK, passed 100 tests.
  7897. 1309.18 s [vector] sum: OK
  7898. 1309.18 s [vector] +++ OK, passed 100 tests.
  7899. 1309.18 s [vector] product: OK
  7900. 1309.19 s [vector] +++ OK, passed 100 tests.
  7901. 1309.19 s [vector] enumFromN: OK
  7902. 1309.19 s [vector] +++ OK, passed 100 tests.
  7903. 1309.19 s [vector] enumFromThenN: OK
  7904. 1309.19 s [vector] +++ OK, passed 100 tests.
  7905. 1309.19 s [vector] enumFromTo: OK
  7906. 1309.19 s [vector] +++ OK, passed 100 tests.
  7907. 1309.19 s [vector] enumFromThenTo: OK
  7908. 1309.19 s [vector] +++ OK, passed 100 tests; 11 discarded.
  7909. 1309.19 s [vector] unstream
  7910. 1309.19 s [vector] unstream == vunstream (exact): OK
  7911. 1309.19 s [vector] +++ OK, passed 100 tests.
  7912. 1309.19 s [vector] unstream == vunstream (unknown): OK
  7913. 1309.19 s [vector] +++ OK, passed 100 tests.
  7914. 1309.19 s [vector] unstreamR ~= vunstream (exact): OK
  7915. 1309.19 s [vector] +++ OK, passed 100 tests.
  7916. 1309.19 s [vector] unstreamR ~= vunstream (unknown): OK
  7917. 1309.19 s [vector] +++ OK, passed 100 tests.
  7918. 1309.19 s [vector] Tests.Vector.Unboxed
  7919. 1309.19 s [vector] ()
  7920. 1309.19 s [vector] fromList.toList == id: OK
  7921. 1309.19 s [vector] +++ OK, passed 100 tests.
  7922. 1309.19 s [vector] toList.fromList == id: OK
  7923. 1309.19 s [vector] +++ OK, passed 100 tests.
  7924. 1309.19 s [vector] unstream.stream == id: OK
  7925. 1309.19 s [vector] +++ OK, passed 100 tests.
  7926. 1309.20 s [vector] stream.unstream == id: OK
  7927. 1309.20 s [vector] +++ OK, passed 100 tests.
  7928. 1309.20 s [vector] eq: OK
  7929. 1309.20 s [vector] +++ OK, passed 100 tests.
  7930. 1309.20 s [vector] length: OK
  7931. 1309.20 s [vector] +++ OK, passed 100 tests.
  7932. 1309.20 s [vector] null: OK
  7933. 1309.20 s [vector] +++ OK, passed 100 tests.
  7934. 1309.20 s [vector] index: OK
  7935. 1309.20 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7936. 1309.20 s [vector] safeIndex: OK
  7937. 1309.20 s [vector] +++ OK, passed 100 tests.
  7938. 1309.20 s [vector] head: OK
  7939. 1309.20 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7940. 1309.20 s [vector] last: OK
  7941. 1309.20 s [vector] +++ OK, passed 100 tests; 21 discarded.
  7942. 1309.20 s [vector] unsafeIndex: OK
  7943. 1309.20 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7944. 1309.20 s [vector] unsafeHead: OK
  7945. 1309.20 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7946. 1309.20 s [vector] unsafeLast: OK
  7947. 1309.20 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7948. 1309.20 s [vector] slice: OK
  7949. 1309.20 s [vector] +++ OK, passed 100 tests.
  7950. 1309.20 s [vector] init: OK
  7951. 1309.20 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7952. 1309.20 s [vector] tail: OK
  7953. 1309.20 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7954. 1309.20 s [vector] take: OK
  7955. 1309.20 s [vector] +++ OK, passed 100 tests.
  7956. 1309.20 s [vector] drop: OK
  7957. 1309.20 s [vector] +++ OK, passed 100 tests.
  7958. 1309.21 s [vector] splitAt: OK
  7959. 1309.21 s [vector] +++ OK, passed 100 tests.
  7960. 1309.21 s [vector] empty: OK
  7961. 1309.21 s [vector] +++ OK, passed 100 tests.
  7962. 1309.21 s [vector] singleton: OK
  7963. 1309.21 s [vector] +++ OK, passed 100 tests.
  7964. 1309.21 s [vector] replicate: OK
  7965. 1309.21 s [vector] +++ OK, passed 100 tests.
  7966. 1309.21 s [vector] generate: OK
  7967. 1309.21 s [vector] +++ OK, passed 100 tests.
  7968. 1309.21 s [vector] iterateN: OK
  7969. 1309.21 s [vector] +++ OK, passed 100 tests.
  7970. 1309.23 s [vector] iterateNM: OK (0.02s)
  7971. 1309.23 s [vector] +++ OK, passed 100 tests.
  7972. 1309.25 s [vector] generateM: OK (0.02s)
  7973. 1309.26 s [vector] +++ OK, passed 100 tests.
  7974. 1309.26 s [vector] replicateM: OK
  7975. 1309.26 s [vector] +++ OK, passed 100 tests.
  7976. 1309.26 s [vector] create: OK
  7977. 1309.26 s [vector] +++ OK, passed 100 tests.
  7978. 1309.26 s [vector] createT: OK
  7979. 1309.26 s [vector] +++ OK, passed 100 tests.
  7980. 1309.27 s [vector] unfoldr: OK
  7981. 1309.27 s [vector] +++ OK, passed 100 tests.
  7982. 1309.28 s [vector] unfoldrN: OK
  7983. 1309.28 s [vector] +++ OK, passed 100 tests.
  7984. 1309.28 s [vector] unfoldrExactN: OK
  7985. 1309.28 s [vector] +++ OK, passed 100 tests.
  7986. 1309.28 s [vector] unfoldrM: OK
  7987. 1309.28 s [vector] +++ OK, passed 100 tests.
  7988. 1309.28 s [vector] unfoldrNM: OK
  7989. 1309.28 s [vector] +++ OK, passed 100 tests.
  7990. 1309.32 s [vector] unfoldrExactNM: OK (0.05s)
  7991. 1309.32 s [vector] +++ OK, passed 100 tests.
  7992. 1309.32 s [vector] constructN: OK
  7993. 1309.32 s [vector] +++ OK, passed 100 tests.
  7994. 1309.32 s [vector] constructrN: OK
  7995. 1309.32 s [vector] +++ OK, passed 100 tests.
  7996. 1309.32 s [vector] cons: OK
  7997. 1309.32 s [vector] +++ OK, passed 100 tests.
  7998. 1309.32 s [vector] snoc: OK
  7999. 1309.32 s [vector] +++ OK, passed 100 tests.
  8000. 1309.33 s [vector] append: OK
  8001. 1309.33 s [vector] +++ OK, passed 100 tests.
  8002. 1309.34 s [vector] concat: OK
  8003. 1309.34 s [vector] +++ OK, passed 100 tests.
  8004. 1309.34 s [vector] force: OK
  8005. 1309.34 s [vector] +++ OK, passed 100 tests.
  8006. 1309.34 s [vector] upd: OK
  8007. 1309.34 s [vector] +++ OK, passed 100 tests.
  8008. 1309.34 s [vector] accum: OK
  8009. 1309.34 s [vector] +++ OK, passed 100 tests.
  8010. 1309.34 s [vector] reverse: OK
  8011. 1309.34 s [vector] +++ OK, passed 100 tests.
  8012. 1309.34 s [vector] backpermute: OK
  8013. 1309.34 s [vector] +++ OK, passed 100 tests.
  8014. 1309.34 s [vector] map: OK
  8015. 1309.34 s [vector] +++ OK, passed 100 tests.
  8016. 1309.34 s [vector] imap: OK
  8017. 1309.34 s [vector] +++ OK, passed 100 tests.
  8018. 1309.35 s [vector] concatMap: OK
  8019. 1309.35 s [vector] +++ OK, passed 100 tests.
  8020. 1309.36 s [vector] mapM: OK
  8021. 1309.36 s [vector] +++ OK, passed 100 tests.
  8022. 1309.36 s [vector] mapM_: OK
  8023. 1309.36 s [vector] +++ OK, passed 100 tests.
  8024. 1309.36 s [vector] forM: OK
  8025. 1309.36 s [vector] +++ OK, passed 100 tests.
  8026. 1309.37 s [vector] forM_: OK (0.01s)
  8027. 1309.37 s [vector] +++ OK, passed 100 tests.
  8028. 1309.38 s [vector] imapM: OK
  8029. 1309.38 s [vector] +++ OK, passed 100 tests.
  8030. 1309.38 s [vector] imapM_: OK (0.01s)
  8031. 1309.38 s [vector] +++ OK, passed 100 tests.
  8032. 1309.38 s [vector] zipWith: OK
  8033. 1309.38 s [vector] +++ OK, passed 100 tests.
  8034. 1309.38 s [vector] zipWith3: OK
  8035. 1309.38 s [vector] +++ OK, passed 100 tests.
  8036. 1309.38 s [vector] izipWith: OK
  8037. 1309.38 s [vector] +++ OK, passed 100 tests.
  8038. 1309.38 s [vector] izipWith3: OK
  8039. 1309.38 s [vector] +++ OK, passed 100 tests.
  8040. 1309.38 s [vector] izipWithM: OK
  8041. 1309.38 s [vector] +++ OK, passed 100 tests.
  8042. 1309.39 s [vector] izipWithM_: OK
  8043. 1309.39 s [vector] +++ OK, passed 100 tests.
  8044. 1309.40 s [vector] zipWithM: OK
  8045. 1309.40 s [vector] +++ OK, passed 100 tests.
  8046. 1309.40 s [vector] zipWithM_: OK
  8047. 1309.40 s [vector] +++ OK, passed 100 tests.
  8048. 1309.40 s [vector] filter: OK
  8049. 1309.40 s [vector] +++ OK, passed 100 tests.
  8050. 1309.40 s [vector] ifilter: OK
  8051. 1309.41 s [vector] +++ OK, passed 100 tests.
  8052. 1309.42 s [vector] filterM: OK (0.02s)
  8053. 1309.42 s [vector] +++ OK, passed 100 tests.
  8054. 1309.42 s [vector] uniq: OK
  8055. 1309.42 s [vector] +++ OK, passed 100 tests.
  8056. 1309.42 s [vector] mapMaybe: OK
  8057. 1309.42 s [vector] +++ OK, passed 100 tests.
  8058. 1309.42 s [vector] imapMaybe: OK
  8059. 1309.43 s [vector] +++ OK, passed 100 tests.
  8060. 1309.43 s [vector] takeWhile: OK
  8061. 1309.43 s [vector] +++ OK, passed 100 tests.
  8062. 1309.43 s [vector] dropWhile: OK
  8063. 1309.43 s [vector] +++ OK, passed 100 tests.
  8064. 1309.43 s [vector] partition: OK
  8065. 1309.43 s [vector] +++ OK, passed 100 tests.
  8066. 1309.43 s [vector] partitionWith: OK
  8067. 1309.43 s [vector] +++ OK, passed 100 tests.
  8068. 1309.43 s [vector] span: OK
  8069. 1309.43 s [vector] +++ OK, passed 100 tests.
  8070. 1309.43 s [vector] break: OK
  8071. 1309.43 s [vector] +++ OK, passed 100 tests.
  8072. 1309.43 s [vector] spanR: OK
  8073. 1309.43 s [vector] +++ OK, passed 100 tests.
  8074. 1309.43 s [vector] breakR: OK
  8075. 1309.43 s [vector] +++ OK, passed 100 tests.
  8076. 1309.43 s [vector] groupBy: OK
  8077. 1309.43 s [vector] +++ OK, passed 100 tests.
  8078. 1309.43 s [vector] elem: OK
  8079. 1309.43 s [vector] +++ OK, passed 100 tests.
  8080. 1309.43 s [vector] notElem: OK
  8081. 1309.43 s [vector] +++ OK, passed 100 tests.
  8082. 1309.43 s [vector] find: OK
  8083. 1309.43 s [vector] +++ OK, passed 100 tests.
  8084. 1309.43 s [vector] findIndex: OK
  8085. 1309.43 s [vector] +++ OK, passed 100 tests.
  8086. 1309.43 s [vector] findIndexR: OK
  8087. 1309.44 s [vector] +++ OK, passed 100 tests.
  8088. 1309.44 s [vector] findIndices: OK
  8089. 1309.44 s [vector] +++ OK, passed 100 tests.
  8090. 1309.44 s [vector] elemIndex: OK
  8091. 1309.44 s [vector] +++ OK, passed 100 tests.
  8092. 1309.44 s [vector] elemIndices: OK
  8093. 1309.44 s [vector] +++ OK, passed 100 tests.
  8094. 1309.44 s [vector] foldl: OK
  8095. 1309.44 s [vector] +++ OK, passed 100 tests.
  8096. 1309.44 s [vector] foldl1: OK
  8097. 1309.44 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8098. 1309.44 s [vector] foldl': OK
  8099. 1309.44 s [vector] +++ OK, passed 100 tests.
  8100. 1309.44 s [vector] foldl1': OK
  8101. 1309.44 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8102. 1309.44 s [vector] foldr: OK
  8103. 1309.44 s [vector] +++ OK, passed 100 tests.
  8104. 1309.44 s [vector] foldr1: OK
  8105. 1309.44 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8106. 1309.44 s [vector] foldr': OK
  8107. 1309.44 s [vector] +++ OK, passed 100 tests.
  8108. 1309.44 s [vector] foldr1': OK
  8109. 1309.44 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8110. 1309.44 s [vector] ifoldl: OK
  8111. 1309.44 s [vector] +++ OK, passed 100 tests.
  8112. 1309.44 s [vector] ifoldl': OK
  8113. 1309.44 s [vector] +++ OK, passed 100 tests.
  8114. 1309.44 s [vector] ifoldr: OK
  8115. 1309.44 s [vector] +++ OK, passed 100 tests.
  8116. 1309.44 s [vector] ifoldr': OK
  8117. 1309.44 s [vector] +++ OK, passed 100 tests.
  8118. 1309.45 s [vector] ifoldM: OK
  8119. 1309.45 s [vector] +++ OK, passed 100 tests.
  8120. 1309.46 s [vector] ifoldM': OK
  8121. 1309.46 s [vector] +++ OK, passed 100 tests.
  8122. 1309.46 s [vector] ifoldM_: OK (0.01s)
  8123. 1309.46 s [vector] +++ OK, passed 100 tests.
  8124. 1309.47 s [vector] ifoldM'_: OK (0.01s)
  8125. 1309.47 s [vector] +++ OK, passed 100 tests.
  8126. 1309.47 s [vector] all: OK
  8127. 1309.47 s [vector] +++ OK, passed 100 tests.
  8128. 1309.47 s [vector] any: OK
  8129. 1309.47 s [vector] +++ OK, passed 100 tests.
  8130. 1309.47 s [vector] prescanl: OK
  8131. 1309.47 s [vector] +++ OK, passed 100 tests.
  8132. 1309.47 s [vector] prescanl': OK
  8133. 1309.47 s [vector] +++ OK, passed 100 tests.
  8134. 1309.47 s [vector] postscanl: OK
  8135. 1309.47 s [vector] +++ OK, passed 100 tests.
  8136. 1309.48 s [vector] postscanl': OK
  8137. 1309.48 s [vector] +++ OK, passed 100 tests.
  8138. 1309.48 s [vector] scanl: OK
  8139. 1309.48 s [vector] +++ OK, passed 100 tests.
  8140. 1309.48 s [vector] scanl': OK
  8141. 1309.48 s [vector] +++ OK, passed 100 tests.
  8142. 1309.48 s [vector] scanl1: OK
  8143. 1309.49 s [vector] +++ OK, passed 100 tests.
  8144. 1309.49 s [vector] scanl1': OK
  8145. 1309.49 s [vector] +++ OK, passed 100 tests.
  8146. 1309.49 s [vector] iscanl: OK
  8147. 1309.49 s [vector] +++ OK, passed 100 tests.
  8148. 1309.49 s [vector] iscanl': OK
  8149. 1309.49 s [vector] +++ OK, passed 100 tests.
  8150. 1309.49 s [vector] prescanr: OK
  8151. 1309.49 s [vector] +++ OK, passed 100 tests.
  8152. 1309.49 s [vector] prescanr': OK
  8153. 1309.49 s [vector] +++ OK, passed 100 tests.
  8154. 1309.50 s [vector] postscanr: OK
  8155. 1309.50 s [vector] +++ OK, passed 100 tests.
  8156. 1309.50 s [vector] postscanr': OK
  8157. 1309.50 s [vector] +++ OK, passed 100 tests.
  8158. 1309.50 s [vector] scanr: OK
  8159. 1309.50 s [vector] +++ OK, passed 100 tests.
  8160. 1309.50 s [vector] scanr': OK
  8161. 1309.50 s [vector] +++ OK, passed 100 tests.
  8162. 1309.50 s [vector] scanr1: OK
  8163. 1309.50 s [vector] +++ OK, passed 100 tests.
  8164. 1309.50 s [vector] scanr1': OK
  8165. 1309.50 s [vector] +++ OK, passed 100 tests.
  8166. 1309.50 s [vector] iscanr: OK
  8167. 1309.50 s [vector] +++ OK, passed 100 tests.
  8168. 1309.50 s [vector] iscanr': OK
  8169. 1309.50 s [vector] +++ OK, passed 100 tests.
  8170. 1309.50 s [vector] mut_read: OK
  8171. 1309.50 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8172. 1309.50 s [vector] mut_write: OK
  8173. 1309.50 s [vector] +++ OK, passed 100 tests; 22 discarded.
  8174. 1309.50 s [vector] mut_modify: OK
  8175. 1309.50 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8176. 1309.50 s [vector] mut_generate: OK
  8177. 1309.50 s [vector] +++ OK, passed 100 tests.
  8178. 1309.51 s [vector] mut_generateM: OK
  8179. 1309.51 s [vector] +++ OK, passed 100 tests.
  8180. 1309.51 s [vector] mut_mapM_: OK
  8181. 1309.51 s [vector] +++ OK, passed 100 tests.
  8182. 1309.54 s [vector] mut_imapM_: OK
  8183. 1309.54 s [vector] +++ OK, passed 100 tests.
  8184. 1309.54 s [vector] mut_forM_: OK (0.01s)
  8185. 1309.54 s [vector] +++ OK, passed 100 tests.
  8186. 1309.55 s [vector] mut_iforM_: OK (0.01s)
  8187. 1309.55 s [vector] +++ OK, passed 100 tests.
  8188. 1309.55 s [vector] mut_foldr: OK
  8189. 1309.55 s [vector] +++ OK, passed 100 tests.
  8190. 1309.55 s [vector] mut_foldr': OK
  8191. 1309.55 s [vector] +++ OK, passed 100 tests.
  8192. 1309.55 s [vector] mut_foldl: OK
  8193. 1309.55 s [vector] +++ OK, passed 100 tests.
  8194. 1309.55 s [vector] mut_foldl': OK
  8195. 1309.55 s [vector] +++ OK, passed 100 tests.
  8196. 1309.55 s [vector] mut_ifoldr: OK
  8197. 1309.55 s [vector] +++ OK, passed 100 tests.
  8198. 1309.55 s [vector] mut_ifoldr': OK
  8199. 1309.55 s [vector] +++ OK, passed 100 tests.
  8200. 1309.55 s [vector] mut_ifoldl: OK
  8201. 1309.55 s [vector] +++ OK, passed 100 tests.
  8202. 1309.55 s [vector] mut_ifoldl': OK
  8203. 1309.55 s [vector] +++ OK, passed 100 tests.
  8204. 1309.56 s [vector] mut_foldM: OK
  8205. 1309.56 s [vector] +++ OK, passed 100 tests.
  8206. 1309.56 s [vector] mut_foldM': OK
  8207. 1309.56 s [vector] +++ OK, passed 100 tests.
  8208. 1309.56 s [vector] mut_foldrM: OK
  8209. 1309.56 s [vector] +++ OK, passed 100 tests.
  8210. 1309.56 s [vector] mut_foldrM': OK
  8211. 1309.56 s [vector] +++ OK, passed 100 tests.
  8212. 1309.56 s [vector] mut_ifoldM: OK
  8213. 1309.56 s [vector] +++ OK, passed 100 tests.
  8214. 1309.56 s [vector] mut_ifoldM': OK
  8215. 1309.56 s [vector] +++ OK, passed 100 tests.
  8216. 1309.56 s [vector] mut_ifoldrM: OK
  8217. 1309.56 s [vector] +++ OK, passed 100 tests.
  8218. 1309.56 s [vector] mut_ifoldrM': OK
  8219. 1309.56 s [vector] +++ OK, passed 100 tests.
  8220. 1309.56 s [vector] compare: OK
  8221. 1309.56 s [vector] +++ OK, passed 100 tests.
  8222. 1309.56 s [vector] maximum: OK
  8223. 1309.56 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8224. 1309.56 s [vector] minimum: OK
  8225. 1309.56 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8226. 1309.57 s [vector] minIndex: OK
  8227. 1309.57 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8228. 1309.57 s [vector] maxIndex: OK
  8229. 1309.57 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8230. 1309.57 s [vector] maximumBy: OK
  8231. 1309.57 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8232. 1309.57 s [vector] minimumBy: OK
  8233. 1309.57 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8234. 1309.57 s [vector] maximumOn: OK
  8235. 1309.57 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8236. 1309.57 s [vector] minimumOn: OK
  8237. 1309.57 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8238. 1309.57 s [vector] maxIndexBy: OK
  8239. 1309.57 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8240. 1309.57 s [vector] minIndexBy: OK
  8241. 1309.57 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8242. 1309.57 s [vector] ListFirstMaxIndexWins: OK
  8243. 1309.57 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8244. 1309.57 s [vector] FalseListFirstMaxIndexWins: OK
  8245. 1309.57 s [vector] +++ OK, failed as expected. (after 1 test):
  8246. 1309.57 s [vector] Exception:
  8247. 1309.57 s [vector] Prelude.foldr1: empty list
  8248. 1309.57 s [vector] CallStack (from HasCallStack):
  8249. 1309.57 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  8250. 1309.57 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  8251. 1309.57 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  8252. 1309.57 s [vector] []
  8253. 1309.57 s [vector] zip: OK
  8254. 1309.57 s [vector] +++ OK, passed 100 tests.
  8255. 1309.57 s [vector] zip3: OK
  8256. 1309.57 s [vector] +++ OK, passed 100 tests.
  8257. 1309.57 s [vector] unzip: OK
  8258. 1309.57 s [vector] +++ OK, passed 100 tests.
  8259. 1309.57 s [vector] unzip3: OK
  8260. 1309.57 s [vector] +++ OK, passed 100 tests.
  8261. 1309.57 s [vector] indexed: OK
  8262. 1309.57 s [vector] +++ OK, passed 100 tests.
  8263. 1309.58 s [vector] update: OK
  8264. 1309.58 s [vector] +++ OK, passed 100 tests.
  8265. 1309.59 s [vector] mempty: OK
  8266. 1309.59 s [vector] +++ OK, passed 100 tests.
  8267. 1309.59 s [vector] mappend: OK
  8268. 1309.59 s [vector] +++ OK, passed 100 tests.
  8269. 1309.59 s [vector] mconcat: OK
  8270. 1309.59 s [vector] +++ OK, passed 100 tests.
  8271. 1309.59 s [vector] glength: OK
  8272. 1309.59 s [vector] +++ OK, passed 100 tests.
  8273. 1309.59 s [vector] (Bool)
  8274. 1309.59 s [vector] fromList.toList == id: OK
  8275. 1309.59 s [vector] +++ OK, passed 100 tests.
  8276. 1309.59 s [vector] toList.fromList == id: OK
  8277. 1309.59 s [vector] +++ OK, passed 100 tests.
  8278. 1309.59 s [vector] unstream.stream == id: OK
  8279. 1309.59 s [vector] +++ OK, passed 100 tests.
  8280. 1309.59 s [vector] stream.unstream == id: OK
  8281. 1309.59 s [vector] +++ OK, passed 100 tests.
  8282. 1309.59 s [vector] eq: OK
  8283. 1309.59 s [vector] +++ OK, passed 100 tests.
  8284. 1309.59 s [vector] length: OK
  8285. 1309.59 s [vector] +++ OK, passed 100 tests.
  8286. 1309.59 s [vector] null: OK
  8287. 1309.59 s [vector] +++ OK, passed 100 tests.
  8288. 1309.59 s [vector] index: OK
  8289. 1309.59 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8290. 1309.59 s [vector] safeIndex: OK
  8291. 1309.59 s [vector] +++ OK, passed 100 tests.
  8292. 1309.59 s [vector] head: OK
  8293. 1309.59 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8294. 1309.59 s [vector] last: OK
  8295. 1309.59 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8296. 1309.59 s [vector] unsafeIndex: OK
  8297. 1309.59 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8298. 1309.59 s [vector] unsafeHead: OK
  8299. 1309.59 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8300. 1309.59 s [vector] unsafeLast: OK
  8301. 1309.59 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8302. 1309.60 s [vector] slice: OK
  8303. 1309.60 s [vector] +++ OK, passed 100 tests.
  8304. 1309.60 s [vector] init: OK
  8305. 1309.60 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8306. 1309.60 s [vector] tail: OK
  8307. 1309.60 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8308. 1309.60 s [vector] take: OK
  8309. 1309.60 s [vector] +++ OK, passed 100 tests.
  8310. 1309.60 s [vector] drop: OK
  8311. 1309.60 s [vector] +++ OK, passed 100 tests.
  8312. 1309.60 s [vector] splitAt: OK
  8313. 1309.60 s [vector] +++ OK, passed 100 tests.
  8314. 1309.60 s [vector] empty: OK
  8315. 1309.60 s [vector] +++ OK, passed 100 tests.
  8316. 1309.60 s [vector] singleton: OK
  8317. 1309.61 s [vector] +++ OK, passed 100 tests.
  8318. 1309.61 s [vector] replicate: OK
  8319. 1309.61 s [vector] +++ OK, passed 100 tests.
  8320. 1309.61 s [vector] generate: OK
  8321. 1309.61 s [vector] +++ OK, passed 100 tests.
  8322. 1309.62 s [vector] iterateN: OK
  8323. 1309.62 s [vector] +++ OK, passed 100 tests.
  8324. 1309.65 s [vector] iterateNM: OK (0.04s)
  8325. 1309.65 s [vector] +++ OK, passed 100 tests.
  8326. 1309.67 s [vector] generateM: OK (0.02s)
  8327. 1309.67 s [vector] +++ OK, passed 100 tests.
  8328. 1309.67 s [vector] replicateM: OK
  8329. 1309.67 s [vector] +++ OK, passed 100 tests.
  8330. 1309.67 s [vector] create: OK
  8331. 1309.67 s [vector] +++ OK, passed 100 tests.
  8332. 1309.67 s [vector] createT: OK
  8333. 1309.67 s [vector] +++ OK, passed 100 tests.
  8334. 1309.67 s [vector] unfoldr: OK
  8335. 1309.67 s [vector] +++ OK, passed 100 tests.
  8336. 1309.67 s [vector] unfoldrN: OK
  8337. 1309.67 s [vector] +++ OK, passed 100 tests.
  8338. 1309.68 s [vector] unfoldrExactN: OK
  8339. 1309.68 s [vector] +++ OK, passed 100 tests.
  8340. 1309.68 s [vector] unfoldrM: OK
  8341. 1309.68 s [vector] +++ OK, passed 100 tests.
  8342. 1309.70 s [vector] unfoldrNM: OK
  8343. 1309.70 s [vector] +++ OK, passed 100 tests.
  8344. 1309.71 s [vector] unfoldrExactNM: OK (0.02s)
  8345. 1309.71 s [vector] +++ OK, passed 100 tests.
  8346. 1309.71 s [vector] constructN: OK
  8347. 1309.71 s [vector] +++ OK, passed 100 tests.
  8348. 1309.71 s [vector] constructrN: OK
  8349. 1309.71 s [vector] +++ OK, passed 100 tests.
  8350. 1309.71 s [vector] cons: OK
  8351. 1309.71 s [vector] +++ OK, passed 100 tests.
  8352. 1309.71 s [vector] snoc: OK
  8353. 1309.71 s [vector] +++ OK, passed 100 tests.
  8354. 1309.71 s [vector] append: OK
  8355. 1309.71 s [vector] +++ OK, passed 100 tests.
  8356. 1309.72 s [vector] concat: OK (0.01s)
  8357. 1309.73 s [vector] +++ OK, passed 100 tests.
  8358. 1309.73 s [vector] force: OK
  8359. 1309.73 s [vector] +++ OK, passed 100 tests.
  8360. 1309.73 s [vector] upd: OK
  8361. 1309.73 s [vector] +++ OK, passed 100 tests.
  8362. 1309.73 s [vector] accum: OK
  8363. 1309.73 s [vector] +++ OK, passed 100 tests.
  8364. 1309.73 s [vector] reverse: OK
  8365. 1309.73 s [vector] +++ OK, passed 100 tests.
  8366. 1309.74 s [vector] backpermute: OK
  8367. 1309.74 s [vector] +++ OK, passed 100 tests.
  8368. 1309.75 s [vector] map: OK
  8369. 1309.75 s [vector] +++ OK, passed 100 tests.
  8370. 1309.75 s [vector] imap: OK
  8371. 1309.76 s [vector] +++ OK, passed 100 tests.
  8372. 1309.76 s [vector] concatMap: OK
  8373. 1309.76 s [vector] +++ OK, passed 100 tests.
  8374. 1309.76 s [vector] mapM: OK
  8375. 1309.76 s [vector] +++ OK, passed 100 tests.
  8376. 1309.76 s [vector] mapM_: OK (0.01s)
  8377. 1309.76 s [vector] +++ OK, passed 100 tests.
  8378. 1309.76 s [vector] forM: OK
  8379. 1309.76 s [vector] +++ OK, passed 100 tests.
  8380. 1309.77 s [vector] forM_: OK (0.01s)
  8381. 1309.77 s [vector] +++ OK, passed 100 tests.
  8382. 1309.78 s [vector] imapM: OK
  8383. 1309.78 s [vector] +++ OK, passed 100 tests.
  8384. 1309.78 s [vector] imapM_: OK (0.01s)
  8385. 1309.78 s [vector] +++ OK, passed 100 tests.
  8386. 1309.78 s [vector] zipWith: OK
  8387. 1309.78 s [vector] +++ OK, passed 100 tests.
  8388. 1309.79 s [vector] zipWith3: OK
  8389. 1309.79 s [vector] +++ OK, passed 100 tests.
  8390. 1309.80 s [vector] izipWith: OK
  8391. 1309.80 s [vector] +++ OK, passed 100 tests.
  8392. 1309.80 s [vector] izipWith3: OK
  8393. 1309.80 s [vector] +++ OK, passed 100 tests.
  8394. 1309.80 s [vector] izipWithM: OK
  8395. 1309.80 s [vector] +++ OK, passed 100 tests.
  8396. 1309.80 s [vector] izipWithM_: OK
  8397. 1309.80 s [vector] +++ OK, passed 100 tests.
  8398. 1309.80 s [vector] zipWithM: OK
  8399. 1309.80 s [vector] +++ OK, passed 100 tests.
  8400. 1309.81 s [vector] zipWithM_: OK
  8401. 1309.81 s [vector] +++ OK, passed 100 tests.
  8402. 1309.81 s [vector] filter: OK
  8403. 1309.81 s [vector] +++ OK, passed 100 tests.
  8404. 1309.81 s [vector] ifilter: OK
  8405. 1309.81 s [vector] +++ OK, passed 100 tests.
  8406. 1309.83 s [vector] filterM: OK (0.01s)
  8407. 1309.83 s [vector] +++ OK, passed 100 tests.
  8408. 1309.83 s [vector] uniq: OK
  8409. 1309.83 s [vector] +++ OK, passed 100 tests.
  8410. 1309.83 s [vector] mapMaybe: OK
  8411. 1309.83 s [vector] +++ OK, passed 100 tests.
  8412. 1309.83 s [vector] imapMaybe: OK
  8413. 1309.83 s [vector] +++ OK, passed 100 tests.
  8414. 1309.83 s [vector] takeWhile: OK
  8415. 1309.83 s [vector] +++ OK, passed 100 tests.
  8416. 1309.83 s [vector] dropWhile: OK
  8417. 1309.83 s [vector] +++ OK, passed 100 tests.
  8418. 1309.83 s [vector] partition: OK
  8419. 1309.83 s [vector] +++ OK, passed 100 tests.
  8420. 1309.84 s [vector] partitionWith: OK
  8421. 1309.84 s [vector] +++ OK, passed 100 tests.
  8422. 1309.84 s [vector] span: OK
  8423. 1309.84 s [vector] +++ OK, passed 100 tests.
  8424. 1309.84 s [vector] break: OK
  8425. 1309.84 s [vector] +++ OK, passed 100 tests.
  8426. 1309.84 s [vector] spanR: OK
  8427. 1309.84 s [vector] +++ OK, passed 100 tests.
  8428. 1309.84 s [vector] breakR: OK
  8429. 1309.84 s [vector] +++ OK, passed 100 tests.
  8430. 1309.84 s [vector] groupBy: OK
  8431. 1309.84 s [vector] +++ OK, passed 100 tests.
  8432. 1309.84 s [vector] elem: OK
  8433. 1309.84 s [vector] +++ OK, passed 100 tests.
  8434. 1309.84 s [vector] notElem: OK
  8435. 1309.84 s [vector] +++ OK, passed 100 tests.
  8436. 1309.84 s [vector] find: OK
  8437. 1309.84 s [vector] +++ OK, passed 100 tests.
  8438. 1309.85 s [vector] findIndex: OK
  8439. 1309.85 s [vector] +++ OK, passed 100 tests.
  8440. 1309.85 s [vector] findIndexR: OK
  8441. 1309.85 s [vector] +++ OK, passed 100 tests.
  8442. 1309.85 s [vector] findIndices: OK
  8443. 1309.85 s [vector] +++ OK, passed 100 tests.
  8444. 1309.85 s [vector] elemIndex: OK
  8445. 1309.85 s [vector] +++ OK, passed 100 tests.
  8446. 1309.85 s [vector] elemIndices: OK
  8447. 1309.85 s [vector] +++ OK, passed 100 tests.
  8448. 1309.85 s [vector] foldl: OK
  8449. 1309.85 s [vector] +++ OK, passed 100 tests.
  8450. 1309.85 s [vector] foldl1: OK
  8451. 1309.85 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8452. 1309.85 s [vector] foldl': OK
  8453. 1309.85 s [vector] +++ OK, passed 100 tests.
  8454. 1309.86 s [vector] foldl1': OK
  8455. 1309.86 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8456. 1309.86 s [vector] foldr: OK
  8457. 1309.86 s [vector] +++ OK, passed 100 tests.
  8458. 1309.86 s [vector] foldr1: OK
  8459. 1309.86 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8460. 1309.86 s [vector] foldr': OK
  8461. 1309.86 s [vector] +++ OK, passed 100 tests.
  8462. 1309.86 s [vector] foldr1': OK
  8463. 1309.87 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8464. 1309.87 s [vector] ifoldl: OK
  8465. 1309.88 s [vector] +++ OK, passed 100 tests.
  8466. 1309.88 s [vector] ifoldl': OK
  8467. 1309.88 s [vector] +++ OK, passed 100 tests.
  8468. 1309.89 s [vector] ifoldr: OK
  8469. 1309.89 s [vector] +++ OK, passed 100 tests.
  8470. 1309.89 s [vector] ifoldr': OK
  8471. 1309.89 s [vector] +++ OK, passed 100 tests.
  8472. 1309.90 s [vector] ifoldM: OK
  8473. 1309.90 s [vector] +++ OK, passed 100 tests.
  8474. 1309.90 s [vector] ifoldM': OK
  8475. 1309.90 s [vector] +++ OK, passed 100 tests.
  8476. 1309.91 s [vector] ifoldM_: OK (0.01s)
  8477. 1309.92 s [vector] +++ OK, passed 100 tests.
  8478. 1309.92 s [vector] ifoldM'_: OK (0.02s)
  8479. 1309.92 s [vector] +++ OK, passed 100 tests.
  8480. 1309.92 s [vector] all: OK
  8481. 1309.92 s [vector] +++ OK, passed 100 tests.
  8482. 1309.92 s [vector] any: OK
  8483. 1309.92 s [vector] +++ OK, passed 100 tests.
  8484. 1309.92 s [vector] prescanl: OK
  8485. 1309.92 s [vector] +++ OK, passed 100 tests.
  8486. 1309.92 s [vector] prescanl': OK
  8487. 1309.92 s [vector] +++ OK, passed 100 tests.
  8488. 1309.92 s [vector] postscanl: OK
  8489. 1309.92 s [vector] +++ OK, passed 100 tests.
  8490. 1309.92 s [vector] postscanl': OK
  8491. 1309.93 s [vector] +++ OK, passed 100 tests.
  8492. 1309.93 s [vector] scanl: OK
  8493. 1309.93 s [vector] +++ OK, passed 100 tests.
  8494. 1309.93 s [vector] scanl': OK
  8495. 1309.93 s [vector] +++ OK, passed 100 tests.
  8496. 1309.93 s [vector] scanl1: OK
  8497. 1309.93 s [vector] +++ OK, passed 100 tests.
  8498. 1309.93 s [vector] scanl1': OK
  8499. 1309.93 s [vector] +++ OK, passed 100 tests.
  8500. 1309.94 s [vector] iscanl: OK
  8501. 1309.94 s [vector] +++ OK, passed 100 tests.
  8502. 1309.94 s [vector] iscanl': OK
  8503. 1309.94 s [vector] +++ OK, passed 100 tests.
  8504. 1309.94 s [vector] prescanr: OK
  8505. 1309.94 s [vector] +++ OK, passed 100 tests.
  8506. 1309.94 s [vector] prescanr': OK
  8507. 1309.94 s [vector] +++ OK, passed 100 tests.
  8508. 1309.94 s [vector] postscanr: OK
  8509. 1309.94 s [vector] +++ OK, passed 100 tests.
  8510. 1309.94 s [vector] postscanr': OK
  8511. 1309.94 s [vector] +++ OK, passed 100 tests.
  8512. 1309.95 s [vector] scanr: OK
  8513. 1309.95 s [vector] +++ OK, passed 100 tests.
  8514. 1309.95 s [vector] scanr': OK
  8515. 1309.95 s [vector] +++ OK, passed 100 tests.
  8516. 1309.95 s [vector] scanr1: OK
  8517. 1309.95 s [vector] +++ OK, passed 100 tests.
  8518. 1309.95 s [vector] scanr1': OK
  8519. 1309.95 s [vector] +++ OK, passed 100 tests.
  8520. 1309.95 s [vector] iscanr: OK
  8521. 1309.95 s [vector] +++ OK, passed 100 tests.
  8522. 1309.96 s [vector] iscanr': OK
  8523. 1309.96 s [vector] +++ OK, passed 100 tests.
  8524. 1309.96 s [vector] mut_read: OK
  8525. 1309.96 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8526. 1309.96 s [vector] mut_write: OK
  8527. 1309.96 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8528. 1309.96 s [vector] mut_modify: OK
  8529. 1309.96 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8530. 1309.96 s [vector] mut_generate: OK
  8531. 1309.97 s [vector] +++ OK, passed 100 tests.
  8532. 1309.98 s [vector] mut_generateM: OK
  8533. 1309.98 s [vector] +++ OK, passed 100 tests.
  8534. 1309.98 s [vector] mut_mapM_: OK
  8535. 1309.98 s [vector] +++ OK, passed 100 tests.
  8536. 1309.99 s [vector] mut_imapM_: OK (0.01s)
  8537. 1310.00 s [vector] +++ OK, passed 100 tests.
  8538. 1310.01 s [vector] mut_forM_: OK (0.01s)
  8539. 1310.01 s [vector] +++ OK, passed 100 tests.
  8540. 1310.01 s [vector] mut_iforM_: OK (0.01s)
  8541. 1310.01 s [vector] +++ OK, passed 100 tests.
  8542. 1310.01 s [vector] mut_foldr: OK
  8543. 1310.01 s [vector] +++ OK, passed 100 tests.
  8544. 1310.01 s [vector] mut_foldr': OK
  8545. 1310.02 s [vector] +++ OK, passed 100 tests.
  8546. 1310.02 s [vector] mut_foldl: OK
  8547. 1310.02 s [vector] +++ OK, passed 100 tests.
  8548. 1310.02 s [vector] mut_foldl': OK
  8549. 1310.02 s [vector] +++ OK, passed 100 tests.
  8550. 1310.02 s [vector] mut_ifoldr: OK
  8551. 1310.02 s [vector] +++ OK, passed 100 tests.
  8552. 1310.03 s [vector] mut_ifoldr': OK
  8553. 1310.03 s [vector] +++ OK, passed 100 tests.
  8554. 1310.03 s [vector] mut_ifoldl: OK
  8555. 1310.03 s [vector] +++ OK, passed 100 tests.
  8556. 1310.03 s [vector] mut_ifoldl': OK
  8557. 1310.03 s [vector] +++ OK, passed 100 tests.
  8558. 1310.03 s [vector] mut_foldM: OK
  8559. 1310.03 s [vector] +++ OK, passed 100 tests.
  8560. 1310.03 s [vector] mut_foldM': OK
  8561. 1310.03 s [vector] +++ OK, passed 100 tests.
  8562. 1310.03 s [vector] mut_foldrM: OK
  8563. 1310.03 s [vector] +++ OK, passed 100 tests.
  8564. 1310.04 s [vector] mut_foldrM': OK
  8565. 1310.04 s [vector] +++ OK, passed 100 tests.
  8566. 1310.04 s [vector] mut_ifoldM: OK
  8567. 1310.04 s [vector] +++ OK, passed 100 tests.
  8568. 1310.04 s [vector] mut_ifoldM': OK
  8569. 1310.04 s [vector] +++ OK, passed 100 tests.
  8570. 1310.05 s [vector] mut_ifoldrM: OK
  8571. 1310.05 s [vector] +++ OK, passed 100 tests.
  8572. 1310.05 s [vector] mut_ifoldrM': OK
  8573. 1310.05 s [vector] +++ OK, passed 100 tests.
  8574. 1310.05 s [vector] compare: OK
  8575. 1310.05 s [vector] +++ OK, passed 100 tests.
  8576. 1310.05 s [vector] maximum: OK
  8577. 1310.05 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8578. 1310.05 s [vector] minimum: OK
  8579. 1310.05 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8580. 1310.05 s [vector] minIndex: OK
  8581. 1310.05 s [vector] +++ OK, passed 100 tests; 23 discarded.
  8582. 1310.05 s [vector] maxIndex: OK
  8583. 1310.05 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8584. 1310.05 s [vector] maximumBy: OK
  8585. 1310.05 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8586. 1310.05 s [vector] minimumBy: OK
  8587. 1310.05 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8588. 1310.05 s [vector] maximumOn: OK
  8589. 1310.05 s [vector] +++ OK, passed 100 tests; 24 discarded.
  8590. 1310.05 s [vector] minimumOn: OK
  8591. 1310.05 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8592. 1310.05 s [vector] maxIndexBy: OK
  8593. 1310.05 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8594. 1310.06 s [vector] minIndexBy: OK
  8595. 1310.06 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8596. 1310.06 s [vector] ListFirstMaxIndexWins: OK
  8597. 1310.06 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8598. 1310.06 s [vector] FalseListFirstMaxIndexWins: OK
  8599. 1310.06 s [vector] +++ OK, failed as expected. (after 1 test):
  8600. 1310.06 s [vector] Exception:
  8601. 1310.06 s [vector] Prelude.foldr1: empty list
  8602. 1310.06 s [vector] CallStack (from HasCallStack):
  8603. 1310.06 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  8604. 1310.06 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  8605. 1310.06 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  8606. 1310.06 s [vector] []
  8607. 1310.06 s [vector] zip: OK
  8608. 1310.06 s [vector] +++ OK, passed 100 tests.
  8609. 1310.06 s [vector] zip3: OK
  8610. 1310.06 s [vector] +++ OK, passed 100 tests.
  8611. 1310.06 s [vector] unzip: OK
  8612. 1310.06 s [vector] +++ OK, passed 100 tests.
  8613. 1310.06 s [vector] unzip3: OK
  8614. 1310.06 s [vector] +++ OK, passed 100 tests.
  8615. 1310.06 s [vector] indexed: OK
  8616. 1310.07 s [vector] +++ OK, passed 100 tests.
  8617. 1310.07 s [vector] update: OK
  8618. 1310.07 s [vector] +++ OK, passed 100 tests.
  8619. 1310.07 s [vector] mempty: OK
  8620. 1310.07 s [vector] +++ OK, passed 100 tests.
  8621. 1310.07 s [vector] mappend: OK
  8622. 1310.07 s [vector] +++ OK, passed 100 tests.
  8623. 1310.09 s [vector] mconcat: OK (0.01s)
  8624. 1310.09 s [vector] +++ OK, passed 100 tests.
  8625. 1310.09 s [vector] glength: OK
  8626. 1310.09 s [vector] +++ OK, passed 100 tests.
  8627. 1310.09 s [vector] and: OK
  8628. 1310.09 s [vector] +++ OK, passed 100 tests.
  8629. 1310.09 s [vector] or: OK
  8630. 1310.09 s [vector] +++ OK, passed 100 tests.
  8631. 1310.09 s [vector] (Int)
  8632. 1310.09 s [vector] fromList.toList == id: OK
  8633. 1310.09 s [vector] +++ OK, passed 100 tests.
  8634. 1310.09 s [vector] toList.fromList == id: OK
  8635. 1310.09 s [vector] +++ OK, passed 100 tests.
  8636. 1310.09 s [vector] unstream.stream == id: OK
  8637. 1310.09 s [vector] +++ OK, passed 100 tests.
  8638. 1310.09 s [vector] stream.unstream == id: OK
  8639. 1310.09 s [vector] +++ OK, passed 100 tests.
  8640. 1310.09 s [vector] eq: OK
  8641. 1310.09 s [vector] +++ OK, passed 100 tests.
  8642. 1310.09 s [vector] length: OK
  8643. 1310.09 s [vector] +++ OK, passed 100 tests.
  8644. 1310.09 s [vector] null: OK
  8645. 1310.09 s [vector] +++ OK, passed 100 tests.
  8646. 1310.09 s [vector] index: OK
  8647. 1310.09 s [vector] +++ OK, passed 100 tests; 20 discarded.
  8648. 1310.09 s [vector] safeIndex: OK
  8649. 1310.09 s [vector] +++ OK, passed 100 tests.
  8650. 1310.09 s [vector] head: OK
  8651. 1310.09 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8652. 1310.09 s [vector] last: OK
  8653. 1310.09 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8654. 1310.09 s [vector] unsafeIndex: OK
  8655. 1310.09 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8656. 1310.09 s [vector] unsafeHead: OK
  8657. 1310.09 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8658. 1310.10 s [vector] unsafeLast: OK
  8659. 1310.10 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8660. 1310.10 s [vector] slice: OK
  8661. 1310.10 s [vector] +++ OK, passed 100 tests.
  8662. 1310.10 s [vector] init: OK
  8663. 1310.10 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8664. 1310.10 s [vector] tail: OK
  8665. 1310.10 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8666. 1310.10 s [vector] take: OK
  8667. 1310.10 s [vector] +++ OK, passed 100 tests.
  8668. 1310.10 s [vector] drop: OK
  8669. 1310.10 s [vector] +++ OK, passed 100 tests.
  8670. 1310.10 s [vector] splitAt: OK
  8671. 1310.10 s [vector] +++ OK, passed 100 tests.
  8672. 1310.10 s [vector] empty: OK
  8673. 1310.10 s [vector] +++ OK, passed 100 tests.
  8674. 1310.10 s [vector] singleton: OK
  8675. 1310.10 s [vector] +++ OK, passed 100 tests.
  8676. 1310.10 s [vector] replicate: OK
  8677. 1310.10 s [vector] +++ OK, passed 100 tests.
  8678. 1310.10 s [vector] generate: OK
  8679. 1310.10 s [vector] +++ OK, passed 100 tests.
  8680. 1310.10 s [vector] iterateN: OK
  8681. 1310.10 s [vector] +++ OK, passed 100 tests.
  8682. 1310.18 s [vector] iterateNM: OK (0.04s)
  8683. 1310.18 s [vector] +++ OK, passed 100 tests.
  8684. 1310.20 s [vector] generateM: OK (0.02s)
  8685. 1310.20 s [vector] +++ OK, passed 100 tests.
  8686. 1310.21 s [vector] replicateM: OK (0.03s)
  8687. 1310.21 s [vector] +++ OK, passed 100 tests.
  8688. 1310.21 s [vector] create: OK
  8689. 1310.21 s [vector] +++ OK, passed 100 tests.
  8690. 1310.21 s [vector] createT: OK
  8691. 1310.21 s [vector] +++ OK, passed 100 tests.
  8692. 1310.21 s [vector] unfoldr: OK
  8693. 1310.21 s [vector] +++ OK, passed 100 tests.
  8694. 1310.21 s [vector] unfoldrN: OK
  8695. 1310.21 s [vector] +++ OK, passed 100 tests.
  8696. 1310.21 s [vector] unfoldrExactN: OK
  8697. 1310.21 s [vector] +++ OK, passed 100 tests.
  8698. 1310.21 s [vector] unfoldrM: OK
  8699. 1310.22 s [vector] +++ OK, passed 100 tests.
  8700. 1310.22 s [vector] unfoldrNM: OK
  8701. 1310.22 s [vector] +++ OK, passed 100 tests.
  8702. 1310.27 s [vector] unfoldrExactNM: OK (0.03s)
  8703. 1310.27 s [vector] +++ OK, passed 100 tests.
  8704. 1310.27 s [vector] constructN: OK
  8705. 1310.27 s [vector] +++ OK, passed 100 tests.
  8706. 1310.27 s [vector] constructrN: OK
  8707. 1310.27 s [vector] +++ OK, passed 100 tests.
  8708. 1310.27 s [vector] cons: OK
  8709. 1310.27 s [vector] +++ OK, passed 100 tests.
  8710. 1310.27 s [vector] snoc: OK
  8711. 1310.27 s [vector] +++ OK, passed 100 tests.
  8712. 1310.28 s [vector] append: OK
  8713. 1310.30 s [vector] +++ OK, passed 100 tests.
  8714. 1310.30 s [vector] concat: OK (0.02s)
  8715. 1310.30 s [vector] +++ OK, passed 100 tests.
  8716. 1310.30 s [vector] force: OK
  8717. 1310.30 s [vector] +++ OK, passed 100 tests.
  8718. 1310.30 s [vector] upd: OK
  8719. 1310.31 s [vector] +++ OK, passed 100 tests.
  8720. 1310.31 s [vector] accum: OK
  8721. 1310.31 s [vector] +++ OK, passed 100 tests.
  8722. 1310.31 s [vector] reverse: OK
  8723. 1310.31 s [vector] +++ OK, passed 100 tests.
  8724. 1310.31 s [vector] backpermute: OK
  8725. 1310.31 s [vector] +++ OK, passed 100 tests.
  8726. 1310.31 s [vector] map: OK
  8727. 1310.31 s [vector] +++ OK, passed 100 tests.
  8728. 1310.32 s [vector] imap: OK
  8729. 1310.32 s [vector] +++ OK, passed 100 tests.
  8730. 1310.32 s [vector] concatMap: OK
  8731. 1310.32 s [vector] +++ OK, passed 100 tests.
  8732. 1310.34 s [vector] mapM: OK
  8733. 1310.34 s [vector] +++ OK, passed 100 tests.
  8734. 1310.34 s [vector] mapM_: OK (0.02s)
  8735. 1310.35 s [vector] +++ OK, passed 100 tests.
  8736. 1310.36 s [vector] forM: OK
  8737. 1310.36 s [vector] +++ OK, passed 100 tests.
  8738. 1310.36 s [vector] forM_: OK (0.02s)
  8739. 1310.36 s [vector] +++ OK, passed 100 tests.
  8740. 1310.36 s [vector] imapM: OK
  8741. 1310.36 s [vector] +++ OK, passed 100 tests.
  8742. 1310.38 s [vector] imapM_: OK
  8743. 1310.38 s [vector] +++ OK, passed 100 tests.
  8744. 1310.38 s [vector] zipWith: OK
  8745. 1310.38 s [vector] +++ OK, passed 100 tests.
  8746. 1310.39 s [vector] zipWith3: OK
  8747. 1310.39 s [vector] +++ OK, passed 100 tests.
  8748. 1310.39 s [vector] izipWith: OK
  8749. 1310.67 s [vector] +++ OK, passed 100 tests.
  8750. 1310.67 s [vector] izipWith3: OK
  8751. 1310.67 s [vector] +++ OK, passed 100 tests.
  8752. 1310.67 s [vector] izipWithM: OK
  8753. 1310.67 s [vector] +++ OK, passed 100 tests.
  8754. 1310.67 s [vector] izipWithM_: OK (0.01s)
  8755. 1310.67 s [vector] +++ OK, passed 100 tests.
  8756. 1310.67 s [vector] zipWithM: OK
  8757. 1310.67 s [vector] +++ OK, passed 100 tests.
  8758. 1310.67 s [vector] zipWithM_: OK (0.02s)
  8759. 1310.67 s [vector] +++ OK, passed 100 tests.
  8760. 1310.67 s [vector] filter: OK
  8761. 1310.67 s [vector] +++ OK, passed 100 tests.
  8762. 1310.67 s [vector] ifilter: OK
  8763. 1310.67 s [vector] +++ OK, passed 100 tests.
  8764. 1310.67 s [vector] filterM: OK (0.02s)
  8765. 1310.67 s [vector] +++ OK, passed 100 tests.
  8766. 1310.67 s [vector] uniq: OK
  8767. 1310.67 s [vector] +++ OK, passed 100 tests.
  8768. 1310.67 s [vector] mapMaybe: OK
  8769. 1310.67 s [vector] +++ OK, passed 100 tests.
  8770. 1310.67 s [vector] imapMaybe: OK
  8771. 1310.67 s [vector] +++ OK, passed 100 tests.
  8772. 1310.68 s [vector] takeWhile: OK
  8773. 1310.68 s [vector] +++ OK, passed 100 tests.
  8774. 1310.68 s [vector] dropWhile: OK
  8775. 1310.68 s [vector] +++ OK, passed 100 tests.
  8776. 1310.68 s [vector] partition: OK
  8777. 1310.68 s [vector] +++ OK, passed 100 tests.
  8778. 1310.68 s [vector] partitionWith: OK
  8779. 1310.68 s [vector] +++ OK, passed 100 tests.
  8780. 1310.68 s [vector] span: OK
  8781. 1310.68 s [vector] +++ OK, passed 100 tests.
  8782. 1310.68 s [vector] break: OK
  8783. 1310.68 s [vector] +++ OK, passed 100 tests.
  8784. 1310.68 s [vector] spanR: OK
  8785. 1310.68 s [vector] +++ OK, passed 100 tests.
  8786. 1310.68 s [vector] breakR: OK
  8787. 1310.68 s [vector] +++ OK, passed 100 tests.
  8788. 1310.68 s [vector] groupBy: OK
  8789. 1310.68 s [vector] +++ OK, passed 100 tests.
  8790. 1310.68 s [vector] elem: OK
  8791. 1310.68 s [vector] +++ OK, passed 100 tests.
  8792. 1310.68 s [vector] notElem: OK
  8793. 1310.68 s [vector] +++ OK, passed 100 tests.
  8794. 1310.68 s [vector] find: OK
  8795. 1310.68 s [vector] +++ OK, passed 100 tests.
  8796. 1310.68 s [vector] findIndex: OK
  8797. 1310.68 s [vector] +++ OK, passed 100 tests.
  8798. 1310.68 s [vector] findIndexR: OK
  8799. 1310.68 s [vector] +++ OK, passed 100 tests.
  8800. 1310.68 s [vector] findIndices: OK
  8801. 1310.68 s [vector] +++ OK, passed 100 tests.
  8802. 1310.68 s [vector] elemIndex: OK
  8803. 1310.68 s [vector] +++ OK, passed 100 tests.
  8804. 1310.68 s [vector] elemIndices: OK
  8805. 1310.68 s [vector] +++ OK, passed 100 tests.
  8806. 1310.68 s [vector] foldl: OK
  8807. 1310.68 s [vector] +++ OK, passed 100 tests.
  8808. 1310.68 s [vector] foldl1: OK
  8809. 1310.68 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8810. 1310.68 s [vector] foldl': OK
  8811. 1310.68 s [vector] +++ OK, passed 100 tests.
  8812. 1310.68 s [vector] foldl1': OK
  8813. 1310.68 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8814. 1310.68 s [vector] foldr: OK
  8815. 1310.68 s [vector] +++ OK, passed 100 tests.
  8816. 1310.68 s [vector] foldr1: OK
  8817. 1310.68 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8818. 1310.68 s [vector] foldr': OK
  8819. 1310.68 s [vector] +++ OK, passed 100 tests.
  8820. 1310.68 s [vector] foldr1': OK
  8821. 1310.68 s [vector] +++ OK, passed 100 tests; 23 discarded.
  8822. 1310.68 s [vector] ifoldl: OK
  8823. 1310.68 s [vector] +++ OK, passed 100 tests.
  8824. 1310.68 s [vector] ifoldl': OK
  8825. 1310.68 s [vector] +++ OK, passed 100 tests.
  8826. 1310.68 s [vector] ifoldr: OK
  8827. 1310.68 s [vector] +++ OK, passed 100 tests.
  8828. 1310.68 s [vector] ifoldr': OK
  8829. 1310.68 s [vector] +++ OK, passed 100 tests.
  8830. 1310.68 s [vector] ifoldM: OK
  8831. 1310.68 s [vector] +++ OK, passed 100 tests.
  8832. 1310.68 s [vector] ifoldM': OK
  8833. 1310.68 s [vector] +++ OK, passed 100 tests.
  8834. 1310.68 s [vector] ifoldM_: OK (0.02s)
  8835. 1310.68 s [vector] +++ OK, passed 100 tests.
  8836. 1310.68 s [vector] ifoldM'_: OK (0.02s)
  8837. 1310.68 s [vector] +++ OK, passed 100 tests.
  8838. 1310.68 s [vector] all: OK
  8839. 1310.68 s [vector] +++ OK, passed 100 tests.
  8840. 1310.68 s [vector] any: OK
  8841. 1310.68 s [vector] +++ OK, passed 100 tests.
  8842. 1310.68 s [vector] prescanl: OK
  8843. 1310.68 s [vector] +++ OK, passed 100 tests.
  8844. 1310.68 s [vector] prescanl': OK
  8845. 1310.68 s [vector] +++ OK, passed 100 tests.
  8846. 1310.68 s [vector] postscanl: OK
  8847. 1310.68 s [vector] +++ OK, passed 100 tests.
  8848. 1310.68 s [vector] postscanl': OK
  8849. 1310.68 s [vector] +++ OK, passed 100 tests.
  8850. 1310.68 s [vector] scanl: OK
  8851. 1310.68 s [vector] +++ OK, passed 100 tests.
  8852. 1310.68 s [vector] scanl': OK
  8853. 1310.68 s [vector] +++ OK, passed 100 tests.
  8854. 1310.68 s [vector] scanl1: OK
  8855. 1310.68 s [vector] +++ OK, passed 100 tests.
  8856. 1310.68 s [vector] scanl1': OK
  8857. 1310.68 s [vector] +++ OK, passed 100 tests.
  8858. 1310.68 s [vector] iscanl: OK
  8859. 1310.68 s [vector] +++ OK, passed 100 tests.
  8860. 1310.68 s [vector] iscanl': OK
  8861. 1310.68 s [vector] +++ OK, passed 100 tests.
  8862. 1310.68 s [vector] prescanr: OK
  8863. 1310.68 s [vector] +++ OK, passed 100 tests.
  8864. 1310.68 s [vector] prescanr': OK
  8865. 1310.68 s [vector] +++ OK, passed 100 tests.
  8866. 1310.68 s [vector] postscanr: OK
  8867. 1310.68 s [vector] +++ OK, passed 100 tests.
  8868. 1310.68 s [vector] postscanr': OK
  8869. 1310.68 s [vector] +++ OK, passed 100 tests.
  8870. 1310.68 s [vector] scanr: OK
  8871. 1310.68 s [vector] +++ OK, passed 100 tests.
  8872. 1310.68 s [vector] scanr': OK
  8873. 1310.68 s [vector] +++ OK, passed 100 tests.
  8874. 1310.68 s [vector] scanr1: OK
  8875. 1310.68 s [vector] +++ OK, passed 100 tests.
  8876. 1310.68 s [vector] scanr1': OK
  8877. 1310.68 s [vector] +++ OK, passed 100 tests.
  8878. 1310.68 s [vector] iscanr: OK
  8879. 1310.68 s [vector] +++ OK, passed 100 tests.
  8880. 1310.68 s [vector] iscanr': OK
  8881. 1310.68 s [vector] +++ OK, passed 100 tests.
  8882. 1310.68 s [vector] mut_read: OK
  8883. 1310.68 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8884. 1310.68 s [vector] mut_write: OK
  8885. 1310.68 s [vector] +++ OK, passed 100 tests; 20 discarded.
  8886. 1310.68 s [vector] mut_modify: OK
  8887. 1310.68 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8888. 1310.68 s [vector] mut_generate: OK
  8889. 1310.68 s [vector] +++ OK, passed 100 tests.
  8890. 1310.68 s [vector] mut_generateM: OK (0.01s)
  8891. 1310.68 s [vector] +++ OK, passed 100 tests.
  8892. 1310.68 s [vector] mut_mapM_: OK (0.02s)
  8893. 1310.68 s [vector] +++ OK, passed 100 tests.
  8894. 1310.70 s [vector] mut_imapM_: OK (0.02s)
  8895. 1310.70 s [vector] +++ OK, passed 100 tests.
  8896. 1310.71 s [vector] mut_forM_: OK (0.02s)
  8897. 1310.71 s [vector] +++ OK, passed 100 tests.
  8898. 1310.73 s [vector] mut_iforM_: OK (0.01s)
  8899. 1310.73 s [vector] +++ OK, passed 100 tests.
  8900. 1310.73 s [vector] mut_foldr: OK
  8901. 1310.73 s [vector] +++ OK, passed 100 tests.
  8902. 1310.74 s [vector] mut_foldr': OK
  8903. 1310.74 s [vector] +++ OK, passed 100 tests.
  8904. 1310.74 s [vector] mut_foldl: OK
  8905. 1310.74 s [vector] +++ OK, passed 100 tests.
  8906. 1310.74 s [vector] mut_foldl': OK
  8907. 1310.74 s [vector] +++ OK, passed 100 tests.
  8908. 1310.74 s [vector] mut_ifoldr: OK
  8909. 1310.75 s [vector] +++ OK, passed 100 tests.
  8910. 1310.75 s [vector] mut_ifoldr': OK
  8911. 1310.75 s [vector] +++ OK, passed 100 tests.
  8912. 1310.75 s [vector] mut_ifoldl: OK
  8913. 1310.75 s [vector] +++ OK, passed 100 tests.
  8914. 1310.76 s [vector] mut_ifoldl': OK
  8915. 1310.76 s [vector] +++ OK, passed 100 tests.
  8916. 1310.77 s [vector] mut_foldM: OK
  8917. 1310.77 s [vector] +++ OK, passed 100 tests.
  8918. 1310.77 s [vector] mut_foldM': OK
  8919. 1310.77 s [vector] +++ OK, passed 100 tests.
  8920. 1310.77 s [vector] mut_foldrM: OK
  8921. 1310.77 s [vector] +++ OK, passed 100 tests.
  8922. 1310.78 s [vector] mut_foldrM': OK
  8923. 1310.78 s [vector] +++ OK, passed 100 tests.
  8924. 1310.78 s [vector] mut_ifoldM: OK
  8925. 1310.78 s [vector] +++ OK, passed 100 tests.
  8926. 1310.78 s [vector] mut_ifoldM': OK
  8927. 1310.79 s [vector] +++ OK, passed 100 tests.
  8928. 1310.79 s [vector] mut_ifoldrM: OK
  8929. 1310.79 s [vector] +++ OK, passed 100 tests.
  8930. 1310.79 s [vector] mut_ifoldrM': OK
  8931. 1310.79 s [vector] +++ OK, passed 100 tests.
  8932. 1310.79 s [vector] compare: OK
  8933. 1310.79 s [vector] +++ OK, passed 100 tests.
  8934. 1310.79 s [vector] maximum: OK
  8935. 1310.79 s [vector] +++ OK, passed 100 tests; 20 discarded.
  8936. 1310.79 s [vector] minimum: OK
  8937. 1310.79 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8938. 1310.79 s [vector] minIndex: OK
  8939. 1310.79 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8940. 1310.79 s [vector] maxIndex: OK
  8941. 1310.79 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8942. 1310.79 s [vector] maximumBy: OK
  8943. 1310.79 s [vector] +++ OK, passed 100 tests; 21 discarded.
  8944. 1310.79 s [vector] minimumBy: OK
  8945. 1310.79 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8946. 1310.79 s [vector] maximumOn: OK
  8947. 1310.79 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8948. 1310.80 s [vector] minimumOn: OK
  8949. 1310.80 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8950. 1310.80 s [vector] maxIndexBy: OK
  8951. 1310.80 s [vector] +++ OK, passed 100 tests; 21 discarded.
  8952. 1310.80 s [vector] minIndexBy: OK
  8953. 1310.80 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8954. 1310.80 s [vector] ListFirstMaxIndexWins: OK
  8955. 1310.80 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8956. 1310.80 s [vector] FalseListFirstMaxIndexWins: OK
  8957. 1310.80 s [vector] +++ OK, failed as expected. (after 1 test):
  8958. 1310.80 s [vector] Exception:
  8959. 1310.80 s [vector] Prelude.foldr1: empty list
  8960. 1310.80 s [vector] CallStack (from HasCallStack):
  8961. 1310.80 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  8962. 1310.80 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  8963. 1310.80 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  8964. 1310.80 s [vector] []
  8965. 1310.80 s [vector] zip: OK
  8966. 1310.80 s [vector] +++ OK, passed 100 tests.
  8967. 1310.81 s [vector] zip3: OK
  8968. 1310.81 s [vector] +++ OK, passed 100 tests.
  8969. 1310.81 s [vector] unzip: OK
  8970. 1310.81 s [vector] +++ OK, passed 100 tests.
  8971. 1310.81 s [vector] unzip3: OK
  8972. 1310.81 s [vector] +++ OK, passed 100 tests.
  8973. 1310.81 s [vector] indexed: OK
  8974. 1310.81 s [vector] +++ OK, passed 100 tests.
  8975. 1310.82 s [vector] update: OK
  8976. 1310.82 s [vector] +++ OK, passed 100 tests.
  8977. 1310.82 s [vector] mempty: OK
  8978. 1310.82 s [vector] +++ OK, passed 100 tests.
  8979. 1310.84 s [vector] mappend: OK
  8980. 1310.84 s [vector] +++ OK, passed 100 tests.
  8981. 1310.85 s [vector] mconcat: OK (0.03s)
  8982. 1310.85 s [vector] +++ OK, passed 100 tests.
  8983. 1310.85 s [vector] glength: OK
  8984. 1310.85 s [vector] +++ OK, passed 100 tests.
  8985. 1310.85 s [vector] sum: OK
  8986. 1310.85 s [vector] +++ OK, passed 100 tests.
  8987. 1310.85 s [vector] product: OK
  8988. 1310.85 s [vector] +++ OK, passed 100 tests.
  8989. 1310.85 s [vector] enumFromN: OK
  8990. 1310.85 s [vector] +++ OK, passed 100 tests.
  8991. 1310.85 s [vector] enumFromThenN: OK
  8992. 1310.85 s [vector] +++ OK, passed 100 tests.
  8993. 1310.86 s [vector] enumFromTo: OK
  8994. 1310.86 s [vector] +++ OK, passed 100 tests.
  8995. 1310.86 s [vector] enumFromThenTo: OK
  8996. 1310.86 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8997. 1310.86 s [vector] (Float)
  8998. 1310.86 s [vector] fromList.toList == id: OK
  8999. 1310.86 s [vector] +++ OK, passed 100 tests.
  9000. 1310.86 s [vector] toList.fromList == id: OK
  9001. 1310.86 s [vector] +++ OK, passed 100 tests.
  9002. 1310.86 s [vector] unstream.stream == id: OK
  9003. 1310.86 s [vector] +++ OK, passed 100 tests.
  9004. 1310.87 s [vector] stream.unstream == id: OK
  9005. 1310.87 s [vector] +++ OK, passed 100 tests.
  9006. 1310.87 s [vector] eq: OK
  9007. 1310.87 s [vector] +++ OK, passed 100 tests.
  9008. 1310.87 s [vector] length: OK
  9009. 1310.87 s [vector] +++ OK, passed 100 tests.
  9010. 1310.87 s [vector] null: OK
  9011. 1310.87 s [vector] +++ OK, passed 100 tests.
  9012. 1310.87 s [vector] index: OK
  9013. 1310.87 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9014. 1310.87 s [vector] safeIndex: OK
  9015. 1310.87 s [vector] +++ OK, passed 100 tests.
  9016. 1310.87 s [vector] head: OK
  9017. 1310.87 s [vector] +++ OK, passed 100 tests; 20 discarded.
  9018. 1310.87 s [vector] last: OK
  9019. 1310.87 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9020. 1310.88 s [vector] unsafeIndex: OK
  9021. 1310.88 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9022. 1310.88 s [vector] unsafeHead: OK
  9023. 1310.88 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9024. 1310.88 s [vector] unsafeLast: OK
  9025. 1310.88 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9026. 1310.88 s [vector] slice: OK
  9027. 1310.89 s [vector] +++ OK, passed 100 tests.
  9028. 1310.89 s [vector] init: OK
  9029. 1310.89 s [vector] +++ OK, passed 100 tests; 21 discarded.
  9030. 1310.89 s [vector] tail: OK
  9031. 1310.89 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9032. 1310.89 s [vector] take: OK
  9033. 1310.89 s [vector] +++ OK, passed 100 tests.
  9034. 1310.89 s [vector] drop: OK
  9035. 1310.89 s [vector] +++ OK, passed 100 tests.
  9036. 1310.89 s [vector] splitAt: OK
  9037. 1310.89 s [vector] +++ OK, passed 100 tests.
  9038. 1310.89 s [vector] empty: OK
  9039. 1310.89 s [vector] +++ OK, passed 100 tests.
  9040. 1310.89 s [vector] singleton: OK
  9041. 1310.89 s [vector] +++ OK, passed 100 tests.
  9042. 1310.89 s [vector] replicate: OK
  9043. 1310.90 s [vector] +++ OK, passed 100 tests.
  9044. 1310.90 s [vector] generate: OK
  9045. 1310.90 s [vector] +++ OK, passed 100 tests.
  9046. 1310.90 s [vector] iterateN: OK
  9047. 1310.91 s [vector] +++ OK, passed 100 tests.
  9048. 1310.98 s [vector] iterateNM: OK (0.07s)
  9049. 1310.98 s [vector] +++ OK, passed 100 tests.
  9050. 1311.02 s [vector] generateM: OK (0.04s)
  9051. 1311.02 s [vector] +++ OK, passed 100 tests.
  9052. 1311.02 s [vector] replicateM: OK (0.01s)
  9053. 1311.02 s [vector] +++ OK, passed 100 tests.
  9054. 1311.02 s [vector] create: OK
  9055. 1311.02 s [vector] +++ OK, passed 100 tests.
  9056. 1311.02 s [vector] createT: OK
  9057. 1311.03 s [vector] +++ OK, passed 100 tests.
  9058. 1311.03 s [vector] unfoldr: OK
  9059. 1311.03 s [vector] +++ OK, passed 100 tests.
  9060. 1311.03 s [vector] unfoldrN: OK
  9061. 1311.03 s [vector] +++ OK, passed 100 tests.
  9062. 1311.03 s [vector] unfoldrExactN: OK
  9063. 1311.03 s [vector] +++ OK, passed 100 tests.
  9064. 1311.03 s [vector] unfoldrM: OK
  9065. 1311.03 s [vector] +++ OK, passed 100 tests.
  9066. 1311.03 s [vector] unfoldrNM: OK
  9067. 1311.03 s [vector] +++ OK, passed 100 tests.
  9068. 1311.12 s [vector] unfoldrExactNM: OK (0.06s)
  9069. 1311.12 s [vector] +++ OK, passed 100 tests.
  9070. 1311.13 s [vector] constructN: OK (0.02s)
  9071. 1311.13 s [vector] +++ OK, passed 100 tests.
  9072. 1311.13 s [vector] constructrN: OK (0.01s)
  9073. 1311.13 s [vector] +++ OK, passed 100 tests.
  9074. 1311.13 s [vector] cons: OK
  9075. 1311.13 s [vector] +++ OK, passed 100 tests.
  9076. 1311.13 s [vector] snoc: OK
  9077. 1311.13 s [vector] +++ OK, passed 100 tests.
  9078. 1311.13 s [vector] append: OK
  9079. 1311.13 s [vector] +++ OK, passed 100 tests.
  9080. 1311.16 s [vector] concat: OK (0.02s)
  9081. 1311.16 s [vector] +++ OK, passed 100 tests.
  9082. 1311.16 s [vector] force: OK
  9083. 1311.16 s [vector] +++ OK, passed 100 tests.
  9084. 1311.16 s [vector] upd: OK
  9085. 1311.16 s [vector] +++ OK, passed 100 tests.
  9086. 1311.17 s [vector] accum: OK (0.01s)
  9087. 1311.17 s [vector] +++ OK, passed 100 tests.
  9088. 1311.17 s [vector] reverse: OK
  9089. 1311.18 s [vector] +++ OK, passed 100 tests.
  9090. 1311.18 s [vector] backpermute: OK
  9091. 1311.18 s [vector] +++ OK, passed 100 tests.
  9092. 1311.20 s [vector] map: OK
  9093. 1311.20 s [vector] +++ OK, passed 100 tests.
  9094. 1311.21 s [vector] imap: OK
  9095. 1311.21 s [vector] +++ OK, passed 100 tests.
  9096. 1311.21 s [vector] concatMap: OK (0.01s)
  9097. 1311.21 s [vector] +++ OK, passed 100 tests.
  9098. 1311.21 s [vector] mapM: OK
  9099. 1311.21 s [vector] +++ OK, passed 100 tests.
  9100. 1311.25 s [vector] mapM_: OK (0.03s)
  9101. 1311.25 s [vector] +++ OK, passed 100 tests.
  9102. 1311.26 s [vector] forM: OK
  9103. 1311.26 s [vector] +++ OK, passed 100 tests.
  9104. 1311.29 s [vector] forM_: OK (0.04s)
  9105. 1311.29 s [vector] +++ OK, passed 100 tests.
  9106. 1311.29 s [vector] imapM: OK
  9107. 1311.29 s [vector] +++ OK, passed 100 tests.
  9108. 1311.33 s [vector] imapM_: OK (0.03s)
  9109. 1311.33 s [vector] +++ OK, passed 100 tests.
  9110. 1311.34 s [vector] zipWith: OK
  9111. 1311.34 s [vector] +++ OK, passed 100 tests.
  9112. 1311.34 s [vector] zipWith3: OK
  9113. 1311.34 s [vector] +++ OK, passed 100 tests.
  9114. 1311.34 s [vector] izipWith: OK
  9115. 1311.34 s [vector] +++ OK, passed 100 tests.
  9116. 1311.35 s [vector] izipWith3: OK
  9117. 1311.36 s [vector] +++ OK, passed 100 tests.
  9118. 1311.38 s [vector] izipWithM: OK
  9119. 1311.38 s [vector] +++ OK, passed 100 tests.
  9120. 1311.40 s [vector] izipWithM_: OK (0.03s)
  9121. 1311.40 s [vector] +++ OK, passed 100 tests.
  9122. 1311.42 s [vector] zipWithM: OK (0.01s)
  9123. 1311.42 s [vector] +++ OK, passed 100 tests.
  9124. 1311.43 s [vector] zipWithM_: OK (0.03s)
  9125. 1311.43 s [vector] +++ OK, passed 100 tests.
  9126. 1311.44 s [vector] filter: OK
  9127. 1311.44 s [vector] +++ OK, passed 100 tests.
  9128. 1311.44 s [vector] ifilter: OK
  9129. 1311.44 s [vector] +++ OK, passed 100 tests.
  9130. 1311.48 s [vector] filterM: OK (0.04s)
  9131. 1311.48 s [vector] +++ OK, passed 100 tests.
  9132. 1311.48 s [vector] uniq: OK
  9133. 1311.48 s [vector] +++ OK, passed 100 tests.
  9134. 1311.48 s [vector] mapMaybe: OK
  9135. 1311.48 s [vector] +++ OK, passed 100 tests.
  9136. 1311.49 s [vector] imapMaybe: OK
  9137. 1311.49 s [vector] +++ OK, passed 100 tests.
  9138. 1311.49 s [vector] takeWhile: OK
  9139. 1311.49 s [vector] +++ OK, passed 100 tests.
  9140. 1311.49 s [vector] dropWhile: OK
  9141. 1311.49 s [vector] +++ OK, passed 100 tests.
  9142. 1311.50 s [vector] partition: OK
  9143. 1311.50 s [vector] +++ OK, passed 100 tests.
  9144. 1311.51 s [vector] partitionWith: OK
  9145. 1311.51 s [vector] +++ OK, passed 100 tests.
  9146. 1311.51 s [vector] span: OK
  9147. 1311.51 s [vector] +++ OK, passed 100 tests.
  9148. 1311.51 s [vector] break: OK
  9149. 1311.51 s [vector] +++ OK, passed 100 tests.
  9150. 1311.51 s [vector] spanR: OK
  9151. 1311.51 s [vector] +++ OK, passed 100 tests.
  9152. 1311.52 s [vector] breakR: OK
  9153. 1311.52 s [vector] +++ OK, passed 100 tests.
  9154. 1311.53 s [vector] groupBy: OK
  9155. 1311.53 s [vector] +++ OK, passed 100 tests.
  9156. 1311.53 s [vector] elem: OK
  9157. 1311.53 s [vector] +++ OK, passed 100 tests.
  9158. 1311.53 s [vector] notElem: OK
  9159. 1311.53 s [vector] +++ OK, passed 100 tests.
  9160. 1311.53 s [vector] find: OK
  9161. 1311.53 s [vector] +++ OK, passed 100 tests.
  9162. 1311.53 s [vector] findIndex: OK
  9163. 1311.53 s [vector] +++ OK, passed 100 tests.
  9164. 1311.53 s [vector] findIndexR: OK
  9165. 1311.53 s [vector] +++ OK, passed 100 tests.
  9166. 1311.54 s [vector] findIndices: OK
  9167. 1311.54 s [vector] +++ OK, passed 100 tests.
  9168. 1311.55 s [vector] elemIndex: OK
  9169. 1311.55 s [vector] +++ OK, passed 100 tests.
  9170. 1311.56 s [vector] elemIndices: OK
  9171. 1311.57 s [vector] +++ OK, passed 100 tests.
  9172. 1311.57 s [vector] foldl: OK
  9173. 1311.58 s [vector] +++ OK, passed 100 tests.
  9174. 1311.58 s [vector] foldl1: OK
  9175. 1311.58 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9176. 1311.58 s [vector] foldl': OK
  9177. 1311.58 s [vector] +++ OK, passed 100 tests.
  9178. 1311.58 s [vector] foldl1': OK
  9179. 1311.59 s [vector] +++ OK, passed 100 tests; 21 discarded.
  9180. 1311.59 s [vector] foldr: OK
  9181. 1311.60 s [vector] +++ OK, passed 100 tests.
  9182. 1311.61 s [vector] foldr1: OK
  9183. 1311.61 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9184. 1311.62 s [vector] foldr': OK
  9185. 1311.62 s [vector] +++ OK, passed 100 tests.
  9186. 1311.63 s [vector] foldr1': OK
  9187. 1311.64 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9188. 1311.64 s [vector] ifoldl: OK
  9189. 1311.64 s [vector] +++ OK, passed 100 tests.
  9190. 1311.64 s [vector] ifoldl': OK
  9191. 1311.64 s [vector] +++ OK, passed 100 tests.
  9192. 1311.64 s [vector] ifoldr: OK
  9193. 1311.64 s [vector] +++ OK, passed 100 tests.
  9194. 1311.65 s [vector] ifoldr': OK
  9195. 1311.65 s [vector] +++ OK, passed 100 tests.
  9196. 1311.66 s [vector] ifoldM: OK
  9197. 1311.66 s [vector] +++ OK, passed 100 tests.
  9198. 1311.68 s [vector] ifoldM': OK (0.01s)
  9199. 1311.68 s [vector] +++ OK, passed 100 tests.
  9200. 1311.69 s [vector] ifoldM_: OK (0.03s)
  9201. 1311.69 s [vector] +++ OK, passed 100 tests.
  9202. 1311.72 s [vector] ifoldM'_: OK (0.03s)
  9203. 1311.72 s [vector] +++ OK, passed 100 tests.
  9204. 1311.73 s [vector] all: OK
  9205. 1311.73 s [vector] +++ OK, passed 100 tests.
  9206. 1311.74 s [vector] any: OK
  9207. 1311.74 s [vector] +++ OK, passed 100 tests.
  9208. 1311.74 s [vector] prescanl: OK
  9209. 1311.74 s [vector] +++ OK, passed 100 tests.
  9210. 1311.74 s [vector] prescanl': OK
  9211. 1311.75 s [vector] +++ OK, passed 100 tests.
  9212. 1311.75 s [vector] postscanl: OK
  9213. 1311.75 s [vector] +++ OK, passed 100 tests.
  9214. 1311.75 s [vector] postscanl': OK
  9215. 1311.75 s [vector] +++ OK, passed 100 tests.
  9216. 1311.76 s [vector] scanl: OK
  9217. 1311.76 s [vector] +++ OK, passed 100 tests.
  9218. 1311.77 s [vector] scanl': OK
  9219. 1311.77 s [vector] +++ OK, passed 100 tests.
  9220. 1311.78 s [vector] scanl1: OK
  9221. 1311.78 s [vector] +++ OK, passed 100 tests.
  9222. 1311.79 s [vector] scanl1': OK
  9223. 1311.79 s [vector] +++ OK, passed 100 tests.
  9224. 1311.79 s [vector] iscanl: OK
  9225. 1311.80 s [vector] +++ OK, passed 100 tests.
  9226. 1311.81 s [vector] iscanl': OK (0.01s)
  9227. 1311.81 s [vector] +++ OK, passed 100 tests.
  9228. 1311.82 s [vector] prescanr: OK
  9229. 1311.82 s [vector] +++ OK, passed 100 tests.
  9230. 1311.83 s [vector] prescanr': OK
  9231. 1311.83 s [vector] +++ OK, passed 100 tests.
  9232. 1311.83 s [vector] postscanr: OK
  9233. 1311.83 s [vector] +++ OK, passed 100 tests.
  9234. 1311.84 s [vector] postscanr': OK
  9235. 1311.85 s [vector] +++ OK, passed 100 tests.
  9236. 1311.86 s [vector] scanr: OK
  9237. 1311.86 s [vector] +++ OK, passed 100 tests.
  9238. 1311.86 s [vector] scanr': OK
  9239. 1311.86 s [vector] +++ OK, passed 100 tests.
  9240. 1311.87 s [vector] scanr1: OK
  9241. 1311.87 s [vector] +++ OK, passed 100 tests.
  9242. 1311.89 s [vector] scanr1': OK
  9243. 1311.89 s [vector] +++ OK, passed 100 tests.
  9244. 1311.89 s [vector] iscanr: OK
  9245. 1311.89 s [vector] +++ OK, passed 100 tests.
  9246. 1311.89 s [vector] iscanr': OK (0.01s)
  9247. 1311.89 s [vector] +++ OK, passed 100 tests.
  9248. 1311.89 s [vector] mut_read: OK
  9249. 1311.89 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9250. 1311.89 s [vector] mut_write: OK
  9251. 1311.89 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9252. 1311.89 s [vector] mut_modify: OK
  9253. 1311.89 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9254. 1311.89 s [vector] mut_generate: OK
  9255. 1311.89 s [vector] +++ OK, passed 100 tests.
  9256. 1311.91 s [vector] mut_generateM: OK (0.02s)
  9257. 1311.92 s [vector] +++ OK, passed 100 tests.
  9258. 1311.95 s [vector] mut_mapM_: OK (0.03s)
  9259. 1311.96 s [vector] +++ OK, passed 100 tests.
  9260. 1311.98 s [vector] mut_imapM_: OK (0.03s)
  9261. 1311.98 s [vector] +++ OK, passed 100 tests.
  9262. 1312.01 s [vector] mut_forM_: OK (0.03s)
  9263. 1312.01 s [vector] +++ OK, passed 100 tests.
  9264. 1312.05 s [vector] mut_iforM_: OK (0.03s)
  9265. 1312.06 s [vector] +++ OK, passed 100 tests.
  9266. 1312.06 s [vector] mut_foldr: OK
  9267. 1312.07 s [vector] +++ OK, passed 100 tests.
  9268. 1312.07 s [vector] mut_foldr': OK
  9269. 1312.08 s [vector] +++ OK, passed 100 tests.
  9270. 1312.09 s [vector] mut_foldl: OK
  9271. 1312.09 s [vector] +++ OK, passed 100 tests.
  9272. 1312.09 s [vector] mut_foldl': OK
  9273. 1312.09 s [vector] +++ OK, passed 100 tests.
  9274. 1312.09 s [vector] mut_ifoldr: OK
  9275. 1312.09 s [vector] +++ OK, passed 100 tests.
  9276. 1312.09 s [vector] mut_ifoldr': OK
  9277. 1312.10 s [vector] +++ OK, passed 100 tests.
  9278. 1312.11 s [vector] mut_ifoldl: OK (0.01s)
  9279. 1312.11 s [vector] +++ OK, passed 100 tests.
  9280. 1312.12 s [vector] mut_ifoldl': OK
  9281. 1312.12 s [vector] +++ OK, passed 100 tests.
  9282. 1312.12 s [vector] mut_foldM: OK (0.01s)
  9283. 1312.12 s [vector] +++ OK, passed 100 tests.
  9284. 1312.14 s [vector] mut_foldM': OK
  9285. 1312.14 s [vector] +++ OK, passed 100 tests.
  9286. 1312.15 s [vector] mut_foldrM: OK
  9287. 1312.15 s [vector] +++ OK, passed 100 tests.
  9288. 1312.15 s [vector] mut_foldrM': OK
  9289. 1312.15 s [vector] +++ OK, passed 100 tests.
  9290. 1312.17 s [vector] mut_ifoldM: OK (0.01s)
  9291. 1312.17 s [vector] +++ OK, passed 100 tests.
  9292. 1312.18 s [vector] mut_ifoldM': OK
  9293. 1312.18 s [vector] +++ OK, passed 100 tests.
  9294. 1312.19 s [vector] mut_ifoldrM: OK (0.01s)
  9295. 1312.19 s [vector] +++ OK, passed 100 tests.
  9296. 1312.19 s [vector] mut_ifoldrM': OK
  9297. 1312.19 s [vector] +++ OK, passed 100 tests.
  9298. 1312.19 s [vector] compare: OK
  9299. 1312.19 s [vector] +++ OK, passed 100 tests.
  9300. 1312.19 s [vector] maximum: OK
  9301. 1312.19 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9302. 1312.19 s [vector] minimum: OK
  9303. 1312.19 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9304. 1312.20 s [vector] minIndex: OK
  9305. 1312.20 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9306. 1312.20 s [vector] maxIndex: OK
  9307. 1312.20 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9308. 1312.20 s [vector] maximumBy: OK
  9309. 1312.20 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9310. 1312.20 s [vector] minimumBy: OK
  9311. 1312.20 s [vector] +++ OK, passed 100 tests; 21 discarded.
  9312. 1312.20 s [vector] maximumOn: OK
  9313. 1312.20 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9314. 1312.21 s [vector] minimumOn: OK
  9315. 1312.21 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9316. 1312.21 s [vector] maxIndexBy: OK
  9317. 1312.21 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9318. 1312.21 s [vector] minIndexBy: OK
  9319. 1312.21 s [vector] +++ OK, passed 100 tests; 25 discarded.
  9320. 1312.21 s [vector] ListFirstMaxIndexWins: OK
  9321. 1312.21 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9322. 1312.21 s [vector] FalseListFirstMaxIndexWins: OK
  9323. 1312.21 s [vector] +++ OK, failed as expected. (after 1 test):
  9324. 1312.21 s [vector] Exception:
  9325. 1312.21 s [vector] Prelude.foldr1: empty list
  9326. 1312.21 s [vector] CallStack (from HasCallStack):
  9327. 1312.21 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  9328. 1312.21 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  9329. 1312.21 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  9330. 1312.21 s [vector] []
  9331. 1312.21 s [vector] zip: OK
  9332. 1312.21 s [vector] +++ OK, passed 100 tests.
  9333. 1312.21 s [vector] zip3: OK
  9334. 1312.21 s [vector] +++ OK, passed 100 tests.
  9335. 1312.21 s [vector] unzip: OK
  9336. 1312.21 s [vector] +++ OK, passed 100 tests.
  9337. 1312.21 s [vector] unzip3: OK
  9338. 1312.21 s [vector] +++ OK, passed 100 tests.
  9339. 1312.21 s [vector] indexed: OK
  9340. 1312.21 s [vector] +++ OK, passed 100 tests.
  9341. 1312.22 s [vector] update: OK
  9342. 1312.22 s [vector] +++ OK, passed 100 tests.
  9343. 1312.22 s [vector] mempty: OK
  9344. 1312.22 s [vector] +++ OK, passed 100 tests.
  9345. 1312.22 s [vector] mappend: OK
  9346. 1312.23 s [vector] +++ OK, passed 100 tests.
  9347. 1312.25 s [vector] mconcat: OK (0.03s)
  9348. 1312.25 s [vector] +++ OK, passed 100 tests.
  9349. 1312.25 s [vector] glength: OK
  9350. 1312.25 s [vector] +++ OK, passed 100 tests.
  9351. 1312.25 s [vector] sum: OK
  9352. 1312.25 s [vector] +++ OK, passed 100 tests.
  9353. 1312.25 s [vector] product: OK
  9354. 1312.25 s [vector] +++ OK, passed 100 tests.
  9355. 1312.25 s [vector] enumFromN: OK
  9356. 1312.25 s [vector] +++ OK, passed 100 tests.
  9357. 1312.25 s [vector] enumFromThenN: OK
  9358. 1312.25 s [vector] +++ OK, passed 100 tests.
  9359. 1312.25 s [vector] enumFromTo: OK
  9360. 1312.25 s [vector] +++ OK, passed 100 tests.
  9361. 1312.25 s [vector] enumFromThenTo: OK
  9362. 1312.25 s [vector] +++ OK, passed 100 tests; 3 discarded.
  9363. 1312.26 s [vector] (Double)
  9364. 1312.26 s [vector] fromList.toList == id: OK
  9365. 1312.26 s [vector] +++ OK, passed 100 tests.
  9366. 1312.26 s [vector] toList.fromList == id: OK
  9367. 1312.26 s [vector] +++ OK, passed 100 tests.
  9368. 1312.26 s [vector] unstream.stream == id: OK
  9369. 1312.26 s [vector] +++ OK, passed 100 tests.
  9370. 1312.26 s [vector] stream.unstream == id: OK
  9371. 1312.26 s [vector] +++ OK, passed 100 tests.
  9372. 1312.26 s [vector] eq: OK
  9373. 1312.26 s [vector] +++ OK, passed 100 tests.
  9374. 1312.26 s [vector] length: OK
  9375. 1312.26 s [vector] +++ OK, passed 100 tests.
  9376. 1312.26 s [vector] null: OK
  9377. 1312.26 s [vector] +++ OK, passed 100 tests.
  9378. 1312.26 s [vector] index: OK
  9379. 1312.26 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9380. 1312.26 s [vector] safeIndex: OK
  9381. 1312.26 s [vector] +++ OK, passed 100 tests.
  9382. 1312.26 s [vector] head: OK
  9383. 1312.26 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9384. 1312.26 s [vector] last: OK
  9385. 1312.26 s [vector] +++ OK, passed 100 tests; 12 discarded.
  9386. 1312.27 s [vector] unsafeIndex: OK
  9387. 1312.27 s [vector] +++ OK, passed 100 tests; 30 discarded.
  9388. 1312.27 s [vector] unsafeHead: OK
  9389. 1312.27 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9390. 1312.27 s [vector] unsafeLast: OK
  9391. 1312.27 s [vector] +++ OK, passed 100 tests; 20 discarded.
  9392. 1312.27 s [vector] slice: OK
  9393. 1312.27 s [vector] +++ OK, passed 100 tests.
  9394. 1312.27 s [vector] init: OK
  9395. 1312.27 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9396. 1312.27 s [vector] tail: OK
  9397. 1312.27 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9398. 1312.27 s [vector] take: OK
  9399. 1312.27 s [vector] +++ OK, passed 100 tests.
  9400. 1312.27 s [vector] drop: OK
  9401. 1312.27 s [vector] +++ OK, passed 100 tests.
  9402. 1312.27 s [vector] splitAt: OK
  9403. 1312.27 s [vector] +++ OK, passed 100 tests.
  9404. 1312.27 s [vector] empty: OK
  9405. 1312.27 s [vector] +++ OK, passed 100 tests.
  9406. 1312.27 s [vector] singleton: OK
  9407. 1312.27 s [vector] +++ OK, passed 100 tests.
  9408. 1312.27 s [vector] replicate: OK
  9409. 1312.27 s [vector] +++ OK, passed 100 tests.
  9410. 1312.27 s [vector] generate: OK
  9411. 1312.27 s [vector] +++ OK, passed 100 tests.
  9412. 1312.29 s [vector] iterateN: OK
  9413. 1312.29 s [vector] +++ OK, passed 100 tests.
  9414. 1312.33 s [vector] iterateNM: OK (0.04s)
  9415. 1312.33 s [vector] +++ OK, passed 100 tests.
  9416. 1312.39 s [vector] generateM: OK (0.05s)
  9417. 1312.39 s [vector] +++ OK, passed 100 tests.
  9418. 1312.39 s [vector] replicateM: OK (0.01s)
  9419. 1312.39 s [vector] +++ OK, passed 100 tests.
  9420. 1312.39 s [vector] create: OK
  9421. 1312.39 s [vector] +++ OK, passed 100 tests.
  9422. 1312.39 s [vector] createT: OK
  9423. 1312.39 s [vector] +++ OK, passed 100 tests.
  9424. 1312.39 s [vector] unfoldr: OK
  9425. 1312.39 s [vector] +++ OK, passed 100 tests.
  9426. 1312.39 s [vector] unfoldrN: OK
  9427. 1312.39 s [vector] +++ OK, passed 100 tests.
  9428. 1312.40 s [vector] unfoldrExactN: OK
  9429. 1312.40 s [vector] +++ OK, passed 100 tests.
  9430. 1312.40 s [vector] unfoldrM: OK
  9431. 1312.40 s [vector] +++ OK, passed 100 tests.
  9432. 1312.41 s [vector] unfoldrNM: OK
  9433. 1312.41 s [vector] +++ OK, passed 100 tests.
  9434. 1312.47 s [vector] unfoldrExactNM: OK (0.06s)
  9435. 1312.47 s [vector] +++ OK, passed 100 tests.
  9436. 1312.49 s [vector] constructN: OK (0.01s)
  9437. 1312.49 s [vector] +++ OK, passed 100 tests.
  9438. 1312.51 s [vector] constructrN: OK (0.02s)
  9439. 1312.51 s [vector] +++ OK, passed 100 tests.
  9440. 1312.51 s [vector] cons: OK
  9441. 1312.51 s [vector] +++ OK, passed 100 tests.
  9442. 1312.51 s [vector] snoc: OK
  9443. 1312.51 s [vector] +++ OK, passed 100 tests.
  9444. 1312.52 s [vector] append: OK
  9445. 1312.52 s [vector] +++ OK, passed 100 tests.
  9446. 1312.53 s [vector] concat: OK (0.02s)
  9447. 1312.53 s [vector] +++ OK, passed 100 tests.
  9448. 1312.53 s [vector] force: OK
  9449. 1312.53 s [vector] +++ OK, passed 100 tests.
  9450. 1312.53 s [vector] upd: OK
  9451. 1312.54 s [vector] +++ OK, passed 100 tests.
  9452. 1312.56 s [vector] accum: OK (0.02s)
  9453. 1312.56 s [vector] +++ OK, passed 100 tests.
  9454. 1312.56 s [vector] reverse: OK
  9455. 1312.56 s [vector] +++ OK, passed 100 tests.
  9456. 1312.56 s [vector] backpermute: OK
  9457. 1312.56 s [vector] +++ OK, passed 100 tests.
  9458. 1312.57 s [vector] map: OK
  9459. 1312.57 s [vector] +++ OK, passed 100 tests.
  9460. 1312.57 s [vector] imap: OK
  9461. 1312.57 s [vector] +++ OK, passed 100 tests.
  9462. 1312.59 s [vector] concatMap: OK (0.01s)
  9463. 1312.59 s [vector] +++ OK, passed 100 tests.
  9464. 1312.61 s [vector] mapM: OK (0.01s)
  9465. 1312.62 s [vector] +++ OK, passed 100 tests.
  9466. 1312.65 s [vector] mapM_: OK (0.05s)
  9467. 1312.65 s [vector] +++ OK, passed 100 tests.
  9468. 1312.66 s [vector] forM: OK
  9469. 1312.66 s [vector] +++ OK, passed 100 tests.
  9470. 1312.69 s [vector] forM_: OK (0.03s)
  9471. 1312.70 s [vector] +++ OK, passed 100 tests.
  9472. 1312.70 s [vector] imapM: OK
  9473. 1312.70 s [vector] +++ OK, passed 100 tests.
  9474. 1312.75 s [vector] imapM_: OK (0.04s)
  9475. 1312.75 s [vector] +++ OK, passed 100 tests.
  9476. 1312.76 s [vector] zipWith: OK (0.01s)
  9477. 1312.76 s [vector] +++ OK, passed 100 tests.
  9478. 1312.77 s [vector] zipWith3: OK (0.02s)
  9479. 1312.78 s [vector] +++ OK, passed 100 tests.
  9480. 1312.79 s [vector] izipWith: OK (0.02s)
  9481. 1312.79 s [vector] +++ OK, passed 100 tests.
  9482. 1312.79 s [vector] izipWith3: OK (0.01s)
  9483. 1312.79 s [vector] +++ OK, passed 100 tests.
  9484. 1312.81 s [vector] izipWithM: OK (0.01s)
  9485. 1312.82 s [vector] +++ OK, passed 100 tests.
  9486. 1312.85 s [vector] izipWithM_: OK (0.04s)
  9487. 1312.85 s [vector] +++ OK, passed 100 tests.
  9488. 1312.86 s [vector] zipWithM: OK
  9489. 1312.86 s [vector] +++ OK, passed 100 tests.
  9490. 1312.89 s [vector] zipWithM_: OK (0.03s)
  9491. 1312.89 s [vector] +++ OK, passed 100 tests.
  9492. 1312.89 s [vector] filter: OK
  9493. 1312.90 s [vector] +++ OK, passed 100 tests.
  9494. 1312.91 s [vector] ifilter: OK
  9495. 1312.92 s [vector] +++ OK, passed 100 tests.
  9496. 1312.97 s [vector] filterM: OK (0.06s)
  9497. 1312.97 s [vector] +++ OK, passed 100 tests.
  9498. 1312.97 s [vector] uniq: OK
  9499. 1312.97 s [vector] +++ OK, passed 100 tests.
  9500. 1312.98 s [vector] mapMaybe: OK (0.02s)
  9501. 1312.98 s [vector] +++ OK, passed 100 tests.
  9502. 1313.00 s [vector] imapMaybe: OK
  9503. 1313.00 s [vector] +++ OK, passed 100 tests.
  9504. 1313.01 s [vector] takeWhile: OK
  9505. 1313.01 s [vector] +++ OK, passed 100 tests.
  9506. 1313.02 s [vector] dropWhile: OK
  9507. 1313.04 s [vector] +++ OK, passed 100 tests.
  9508. 1313.04 s [vector] partition: OK (0.01s)
  9509. 1313.04 s [vector] +++ OK, passed 100 tests.
  9510. 1313.04 s [vector] partitionWith: OK (0.02s)
  9511. 1313.04 s [vector] +++ OK, passed 100 tests.
  9512. 1313.04 s [vector] span: OK
  9513. 1313.04 s [vector] +++ OK, passed 100 tests.
  9514. 1313.04 s [vector] break: OK
  9515. 1313.04 s [vector] +++ OK, passed 100 tests.
  9516. 1313.05 s [vector] spanR: OK
  9517. 1313.05 s [vector] +++ OK, passed 100 tests.
  9518. 1313.05 s [vector] breakR: OK
  9519. 1313.06 s [vector] +++ OK, passed 100 tests.
  9520. 1313.06 s [vector] groupBy: OK (0.01s)
  9521. 1313.06 s [vector] +++ OK, passed 100 tests.
  9522. 1313.06 s [vector] elem: OK
  9523. 1313.06 s [vector] +++ OK, passed 100 tests.
  9524. 1313.06 s [vector] notElem: OK
  9525. 1313.06 s [vector] +++ OK, passed 100 tests.
  9526. 1313.06 s [vector] find: OK
  9527. 1313.07 s [vector] +++ OK, passed 100 tests.
  9528. 1313.08 s [vector] findIndex: OK
  9529. 1313.08 s [vector] +++ OK, passed 100 tests.
  9530. 1313.08 s [vector] findIndexR: OK
  9531. 1313.08 s [vector] +++ OK, passed 100 tests.
  9532. 1313.08 s [vector] findIndices: OK
  9533. 1313.08 s [vector] +++ OK, passed 100 tests.
  9534. 1313.08 s [vector] elemIndex: OK
  9535. 1313.08 s [vector] +++ OK, passed 100 tests.
  9536. 1313.08 s [vector] elemIndices: OK
  9537. 1313.10 s [vector] +++ OK, passed 100 tests.
  9538. 1313.11 s [vector] foldl: OK (0.02s)
  9539. 1313.12 s [vector] +++ OK, passed 100 tests.
  9540. 1313.14 s [vector] foldl1: OK (0.02s)
  9541. 1313.14 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9542. 1313.15 s [vector] foldl': OK (0.03s)
  9543. 1313.15 s [vector] +++ OK, passed 100 tests.
  9544. 1313.19 s [vector] foldl1': OK (0.03s)
  9545. 1313.20 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9546. 1313.21 s [vector] foldr: OK (0.03s)
  9547. 1313.21 s [vector] +++ OK, passed 100 tests.
  9548. 1313.25 s [vector] foldr1: OK (0.03s)
  9549. 1313.26 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9550. 1313.27 s [vector] foldr': OK (0.02s)
  9551. 1313.28 s [vector] +++ OK, passed 100 tests.
  9552. 1313.29 s [vector] foldr1': OK (0.03s)
  9553. 1313.30 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9554. 1313.31 s [vector] ifoldl: OK (0.02s)
  9555. 1313.32 s [vector] +++ OK, passed 100 tests.
  9556. 1313.33 s [vector] ifoldl': OK (0.02s)
  9557. 1313.33 s [vector] +++ OK, passed 100 tests.
  9558. 1313.35 s [vector] ifoldr: OK (0.01s)
  9559. 1313.35 s [vector] +++ OK, passed 100 tests.
  9560. 1313.37 s [vector] ifoldr': OK
  9561. 1313.37 s [vector] +++ OK, passed 100 tests.
  9562. 1313.37 s [vector] ifoldM: OK (0.01s)
  9563. 1313.38 s [vector] +++ OK, passed 100 tests.
  9564. 1313.39 s [vector] ifoldM': OK (0.01s)
  9565. 1313.39 s [vector] +++ OK, passed 100 tests.
  9566. 1313.43 s [vector] ifoldM_: OK (0.04s)
  9567. 1313.43 s [vector] +++ OK, passed 100 tests.
  9568. 1313.46 s [vector] ifoldM'_: OK (0.04s)
  9569. 1313.46 s [vector] +++ OK, passed 100 tests.
  9570. 1313.48 s [vector] all: OK
  9571. 1313.48 s [vector] +++ OK, passed 100 tests.
  9572. 1313.49 s [vector] any: OK
  9573. 1313.49 s [vector] +++ OK, passed 100 tests.
  9574. 1313.50 s [vector] prescanl: OK (0.01s)
  9575. 1313.50 s [vector] +++ OK, passed 100 tests.
  9576. 1313.52 s [vector] prescanl': OK (0.01s)
  9577. 1313.52 s [vector] +++ OK, passed 100 tests.
  9578. 1313.52 s [vector] postscanl: OK (0.01s)
  9579. 1313.52 s [vector] +++ OK, passed 100 tests.
  9580. 1313.53 s [vector] postscanl': OK (0.02s)
  9581. 1313.53 s [vector] +++ OK, passed 100 tests.
  9582. 1313.54 s [vector] scanl: OK (0.01s)
  9583. 1313.54 s [vector] +++ OK, passed 100 tests.
  9584. 1313.55 s [vector] scanl': OK (0.02s)
  9585. 1313.56 s [vector] +++ OK, passed 100 tests.
  9586. 1313.58 s [vector] scanl1: OK (0.02s)
  9587. 1313.58 s [vector] +++ OK, passed 100 tests.
  9588. 1313.59 s [vector] scanl1': OK (0.01s)
  9589. 1313.59 s [vector] +++ OK, passed 100 tests.
  9590. 1313.60 s [vector] iscanl: OK (0.01s)
  9591. 1313.60 s [vector] +++ OK, passed 100 tests.
  9592. 1313.61 s [vector] iscanl': OK (0.02s)
  9593. 1313.62 s [vector] +++ OK, passed 100 tests.
  9594. 1313.64 s [vector] prescanr: OK (0.01s)
  9595. 1313.64 s [vector] +++ OK, passed 100 tests.
  9596. 1313.64 s [vector] prescanr': OK (0.02s)
  9597. 1313.64 s [vector] +++ OK, passed 100 tests.
  9598. 1313.66 s [vector] postscanr: OK (0.01s)
  9599. 1313.66 s [vector] +++ OK, passed 100 tests.
  9600. 1313.68 s [vector] postscanr': OK (0.02s)
  9601. 1313.68 s [vector] +++ OK, passed 100 tests.
  9602. 1313.69 s [vector] scanr: OK (0.02s)
  9603. 1313.70 s [vector] +++ OK, passed 100 tests.
  9604. 1313.71 s [vector] scanr': OK (0.01s)
  9605. 1313.71 s [vector] +++ OK, passed 100 tests.
  9606. 1313.71 s [vector] scanr1: OK (0.01s)
  9607. 1313.71 s [vector] +++ OK, passed 100 tests.
  9608. 1313.73 s [vector] scanr1': OK (0.01s)
  9609. 1313.74 s [vector] +++ OK, passed 100 tests.
  9610. 1313.76 s [vector] iscanr: OK (0.02s)
  9611. 1313.76 s [vector] +++ OK, passed 100 tests.
  9612. 1313.76 s [vector] iscanr': OK (0.02s)
  9613. 1313.76 s [vector] +++ OK, passed 100 tests.
  9614. 1313.76 s [vector] mut_read: OK
  9615. 1313.76 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9616. 1313.76 s [vector] mut_write: OK
  9617. 1313.77 s [vector] +++ OK, passed 100 tests; 20 discarded.
  9618. 1313.78 s [vector] mut_modify: OK
  9619. 1313.78 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9620. 1313.78 s [vector] mut_generate: OK
  9621. 1313.78 s [vector] +++ OK, passed 100 tests.
  9622. 1313.79 s [vector] mut_generateM: OK (0.02s)
  9623. 1313.80 s [vector] +++ OK, passed 100 tests.
  9624. 1313.83 s [vector] mut_mapM_: OK (0.04s)
  9625. 1313.84 s [vector] +++ OK, passed 100 tests.
  9626. 1313.91 s [vector] mut_imapM_: OK (0.07s)
  9627. 1313.91 s [vector] +++ OK, passed 100 tests.
  9628. 1313.97 s [vector] mut_forM_: OK (0.06s)
  9629. 1313.97 s [vector] +++ OK, passed 100 tests.
  9630. 1314.03 s [vector] mut_iforM_: OK (0.07s)
  9631. 1314.04 s [vector] +++ OK, passed 100 tests.
  9632. 1314.07 s [vector] mut_foldr: OK (0.02s)
  9633. 1314.07 s [vector] +++ OK, passed 100 tests.
  9634. 1314.09 s [vector] mut_foldr': OK (0.03s)
  9635. 1314.10 s [vector] +++ OK, passed 100 tests.
  9636. 1314.11 s [vector] mut_foldl: OK (0.02s)
  9637. 1314.11 s [vector] +++ OK, passed 100 tests.
  9638. 1314.13 s [vector] mut_foldl': OK (0.01s)
  9639. 1314.14 s [vector] +++ OK, passed 100 tests.
  9640. 1314.15 s [vector] mut_ifoldr: OK (0.02s)
  9641. 1314.15 s [vector] +++ OK, passed 100 tests.
  9642. 1314.15 s [vector] mut_ifoldr': OK (0.02s)
  9643. 1314.15 s [vector] +++ OK, passed 100 tests.
  9644. 1314.17 s [vector] mut_ifoldl: OK (0.01s)
  9645. 1314.18 s [vector] +++ OK, passed 100 tests.
  9646. 1314.19 s [vector] mut_ifoldl': OK (0.01s)
  9647. 1314.19 s [vector] +++ OK, passed 100 tests.
  9648. 1314.19 s [vector] mut_foldM: OK (0.01s)
  9649. 1314.19 s [vector] +++ OK, passed 100 tests.
  9650. 1314.21 s [vector] mut_foldM': OK (0.01s)
  9651. 1314.22 s [vector] +++ OK, passed 100 tests.
  9652. 1314.23 s [vector] mut_foldrM: OK (0.01s)
  9653. 1314.23 s [vector] +++ OK, passed 100 tests.
  9654. 1314.24 s [vector] mut_foldrM': OK (0.01s)
  9655. 1314.24 s [vector] +++ OK, passed 100 tests.
  9656. 1314.25 s [vector] mut_ifoldM: OK (0.02s)
  9657. 1314.26 s [vector] +++ OK, passed 100 tests.
  9658. 1314.27 s [vector] mut_ifoldM': OK (0.02s)
  9659. 1314.28 s [vector] +++ OK, passed 100 tests.
  9660. 1314.29 s [vector] mut_ifoldrM: OK (0.01s)
  9661. 1314.29 s [vector] +++ OK, passed 100 tests.
  9662. 1314.30 s [vector] mut_ifoldrM': OK (0.02s)
  9663. 1314.30 s [vector] +++ OK, passed 100 tests.
  9664. 1314.30 s [vector] compare: OK
  9665. 1314.30 s [vector] +++ OK, passed 100 tests.
  9666. 1314.30 s [vector] maximum: OK
  9667. 1314.30 s [vector] +++ OK, passed 100 tests; 23 discarded.
  9668. 1314.30 s [vector] minimum: OK
  9669. 1314.30 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9670. 1314.30 s [vector] minIndex: OK
  9671. 1314.30 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9672. 1314.30 s [vector] maxIndex: OK
  9673. 1314.30 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9674. 1314.30 s [vector] maximumBy: OK
  9675. 1314.30 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9676. 1314.30 s [vector] minimumBy: OK
  9677. 1314.30 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9678. 1314.30 s [vector] maximumOn: OK
  9679. 1314.30 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9680. 1314.30 s [vector] minimumOn: OK
  9681. 1314.30 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9682. 1314.30 s [vector] maxIndexBy: OK
  9683. 1314.30 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9684. 1314.30 s [vector] minIndexBy: OK
  9685. 1314.30 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9686. 1314.31 s [vector] ListFirstMaxIndexWins: OK
  9687. 1314.31 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9688. 1314.31 s [vector] FalseListFirstMaxIndexWins: OK
  9689. 1314.31 s [vector] +++ OK, failed as expected. (after 1 test):
  9690. 1314.32 s [vector] Exception:
  9691. 1314.32 s [vector] Prelude.foldr1: empty list
  9692. 1314.32 s [vector] CallStack (from HasCallStack):
  9693. 1314.32 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  9694. 1314.32 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  9695. 1314.32 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  9696. 1314.32 s [vector] []
  9697. 1314.32 s [vector] zip: OK
  9698. 1314.32 s [vector] +++ OK, passed 100 tests.
  9699. 1314.32 s [vector] zip3: OK
  9700. 1314.32 s [vector] +++ OK, passed 100 tests.
  9701. 1314.32 s [vector] unzip: OK
  9702. 1314.32 s [vector] +++ OK, passed 100 tests.
  9703. 1314.32 s [vector] unzip3: OK
  9704. 1314.32 s [vector] +++ OK, passed 100 tests.
  9705. 1314.32 s [vector] indexed: OK
  9706. 1314.32 s [vector] +++ OK, passed 100 tests.
  9707. 1314.34 s [vector] update: OK
  9708. 1314.34 s [vector] +++ OK, passed 100 tests.
  9709. 1314.34 s [vector] mempty: OK
  9710. 1314.34 s [vector] +++ OK, passed 100 tests.
  9711. 1314.34 s [vector] mappend: OK
  9712. 1314.34 s [vector] +++ OK, passed 100 tests.
  9713. 1314.35 s [vector] mconcat: OK (0.02s)
  9714. 1314.35 s [vector] +++ OK, passed 100 tests.
  9715. 1314.35 s [vector] glength: OK
  9716. 1314.35 s [vector] +++ OK, passed 100 tests.
  9717. 1314.35 s [vector] sum: OK
  9718. 1314.35 s [vector] +++ OK, passed 100 tests.
  9719. 1314.35 s [vector] product: OK
  9720. 1314.35 s [vector] +++ OK, passed 100 tests.
  9721. 1314.35 s [vector] enumFromN: OK
  9722. 1314.35 s [vector] +++ OK, passed 100 tests.
  9723. 1314.35 s [vector] enumFromThenN: OK
  9724. 1314.35 s [vector] +++ OK, passed 100 tests.
  9725. 1314.35 s [vector] enumFromTo: OK
  9726. 1314.35 s [vector] +++ OK, passed 100 tests.
  9727. 1314.35 s [vector] enumFromThenTo: OK
  9728. 1314.35 s [vector] +++ OK, passed 100 tests.
  9729. 1314.35 s [vector] (Int,Bool)
  9730. 1314.35 s [vector] fromList.toList == id: OK
  9731. 1314.35 s [vector] +++ OK, passed 100 tests.
  9732. 1314.35 s [vector] toList.fromList == id: OK
  9733. 1314.36 s [vector] +++ OK, passed 100 tests.
  9734. 1314.36 s [vector] unstream.stream == id: OK
  9735. 1314.36 s [vector] +++ OK, passed 100 tests.
  9736. 1314.36 s [vector] stream.unstream == id: OK
  9737. 1314.36 s [vector] +++ OK, passed 100 tests.
  9738. 1314.36 s [vector] eq: OK
  9739. 1314.36 s [vector] +++ OK, passed 100 tests.
  9740. 1314.36 s [vector] length: OK
  9741. 1314.36 s [vector] +++ OK, passed 100 tests.
  9742. 1314.36 s [vector] null: OK
  9743. 1314.36 s [vector] +++ OK, passed 100 tests.
  9744. 1314.36 s [vector] index: OK
  9745. 1314.36 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9746. 1314.36 s [vector] safeIndex: OK
  9747. 1314.36 s [vector] +++ OK, passed 100 tests.
  9748. 1314.36 s [vector] head: OK
  9749. 1314.36 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9750. 1314.36 s [vector] last: OK
  9751. 1314.36 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9752. 1314.36 s [vector] unsafeIndex: OK
  9753. 1314.36 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9754. 1314.36 s [vector] unsafeHead: OK
  9755. 1314.36 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9756. 1314.36 s [vector] unsafeLast: OK
  9757. 1314.36 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9758. 1314.37 s [vector] slice: OK
  9759. 1314.37 s [vector] +++ OK, passed 100 tests.
  9760. 1314.37 s [vector] init: OK
  9761. 1314.37 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9762. 1314.37 s [vector] tail: OK
  9763. 1314.37 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9764. 1314.37 s [vector] take: OK
  9765. 1314.37 s [vector] +++ OK, passed 100 tests.
  9766. 1314.37 s [vector] drop: OK
  9767. 1314.37 s [vector] +++ OK, passed 100 tests.
  9768. 1314.37 s [vector] splitAt: OK
  9769. 1314.37 s [vector] +++ OK, passed 100 tests.
  9770. 1314.37 s [vector] empty: OK
  9771. 1314.37 s [vector] +++ OK, passed 100 tests.
  9772. 1314.37 s [vector] singleton: OK
  9773. 1314.37 s [vector] +++ OK, passed 100 tests.
  9774. 1314.37 s [vector] replicate: OK
  9775. 1314.37 s [vector] +++ OK, passed 100 tests.
  9776. 1314.38 s [vector] generate: OK
  9777. 1314.38 s [vector] +++ OK, passed 100 tests.
  9778. 1314.38 s [vector] iterateN: OK
  9779. 1314.40 s [vector] +++ OK, passed 100 tests.
  9780. 1314.45 s [vector] iterateNM: OK (0.06s)
  9781. 1314.46 s [vector] +++ OK, passed 100 tests.
  9782. 1314.47 s [vector] generateM: OK (0.03s)
  9783. 1314.47 s [vector] +++ OK, passed 100 tests.
  9784. 1314.47 s [vector] replicateM: OK
  9785. 1314.47 s [vector] +++ OK, passed 100 tests.
  9786. 1314.47 s [vector] create: OK
  9787. 1314.47 s [vector] +++ OK, passed 100 tests.
  9788. 1314.48 s [vector] createT: OK
  9789. 1314.48 s [vector] +++ OK, passed 100 tests.
  9790. 1314.48 s [vector] unfoldr: OK
  9791. 1314.48 s [vector] +++ OK, passed 100 tests.
  9792. 1314.48 s [vector] unfoldrN: OK
  9793. 1314.48 s [vector] +++ OK, passed 100 tests.
  9794. 1314.48 s [vector] unfoldrExactN: OK
  9795. 1314.48 s [vector] +++ OK, passed 100 tests.
  9796. 1314.48 s [vector] unfoldrM: OK
  9797. 1314.48 s [vector] +++ OK, passed 100 tests.
  9798. 1314.50 s [vector] unfoldrNM: OK
  9799. 1314.50 s [vector] +++ OK, passed 100 tests.
  9800. 1314.52 s [vector] unfoldrExactNM: OK (0.03s)
  9801. 1314.53 s [vector] +++ OK, passed 100 tests.
  9802. 1314.53 s [vector] constructN: OK
  9803. 1314.53 s [vector] +++ OK, passed 100 tests.
  9804. 1314.53 s [vector] constructrN: OK
  9805. 1314.53 s [vector] +++ OK, passed 100 tests.
  9806. 1314.53 s [vector] cons: OK
  9807. 1314.53 s [vector] +++ OK, passed 100 tests.
  9808. 1314.53 s [vector] snoc: OK
  9809. 1314.54 s [vector] +++ OK, passed 100 tests.
  9810. 1314.54 s [vector] append: OK
  9811. 1314.54 s [vector] +++ OK, passed 100 tests.
  9812. 1314.58 s [vector] concat: OK (0.04s)
  9813. 1314.58 s [vector] +++ OK, passed 100 tests.
  9814. 1314.59 s [vector] force: OK
  9815. 1314.59 s [vector] +++ OK, passed 100 tests.
  9816. 1314.59 s [vector] upd: OK
  9817. 1314.59 s [vector] +++ OK, passed 100 tests.
  9818. 1314.59 s [vector] accum: OK
  9819. 1314.59 s [vector] +++ OK, passed 100 tests.
  9820. 1314.59 s [vector] reverse: OK
  9821. 1314.59 s [vector] +++ OK, passed 100 tests.
  9822. 1314.60 s [vector] backpermute: OK
  9823. 1314.60 s [vector] +++ OK, passed 100 tests.
  9824. 1314.60 s [vector] map: OK
  9825. 1314.60 s [vector] +++ OK, passed 100 tests.
  9826. 1314.61 s [vector] imap: OK
  9827. 1314.61 s [vector] +++ OK, passed 100 tests.
  9828. 1314.61 s [vector] concatMap: OK
  9829. 1314.61 s [vector] +++ OK, passed 100 tests.
  9830. 1314.62 s [vector] mapM: OK
  9831. 1314.63 s [vector] +++ OK, passed 100 tests.
  9832. 1314.65 s [vector] mapM_: OK (0.03s)
  9833. 1314.65 s [vector] +++ OK, passed 100 tests.
  9834. 1314.66 s [vector] forM: OK
  9835. 1314.66 s [vector] +++ OK, passed 100 tests.
  9836. 1314.69 s [vector] forM_: OK (0.03s)
  9837. 1314.69 s [vector] +++ OK, passed 100 tests.
  9838. 1314.70 s [vector] imapM: OK
  9839. 1314.70 s [vector] +++ OK, passed 100 tests.
  9840. 1314.74 s [vector] imapM_: OK (0.04s)
  9841. 1314.74 s [vector] +++ OK, passed 100 tests.
  9842. 1314.75 s [vector] zipWith: OK
  9843. 1314.75 s [vector] +++ OK, passed 100 tests.
  9844. 1314.76 s [vector] zipWith3: OK
  9845. 1314.77 s [vector] +++ OK, passed 100 tests.
  9846. 1314.78 s [vector] izipWith: OK
  9847. 1314.78 s [vector] +++ OK, passed 100 tests.
  9848. 1314.78 s [vector] izipWith3: OK
  9849. 1314.78 s [vector] +++ OK, passed 100 tests.
  9850. 1314.80 s [vector] izipWithM: OK (0.01s)
  9851. 1314.80 s [vector] +++ OK, passed 100 tests.
  9852. 1314.81 s [vector] izipWithM_: OK (0.03s)
  9853. 1314.81 s [vector] +++ OK, passed 100 tests.
  9854. 1314.81 s [vector] zipWithM: OK
  9855. 1314.81 s [vector] +++ OK, passed 100 tests.
  9856. 1314.83 s [vector] zipWithM_: OK (0.02s)
  9857. 1314.84 s [vector] +++ OK, passed 100 tests.
  9858. 1314.84 s [vector] filter: OK
  9859. 1314.84 s [vector] +++ OK, passed 100 tests.
  9860. 1314.84 s [vector] ifilter: OK
  9861. 1314.86 s [vector] +++ OK, passed 100 tests.
  9862. 1314.89 s [vector] filterM: OK (0.05s)
  9863. 1314.89 s [vector] +++ OK, passed 100 tests.
  9864. 1314.90 s [vector] uniq: OK
  9865. 1314.90 s [vector] +++ OK, passed 100 tests.
  9866. 1314.90 s [vector] mapMaybe: OK
  9867. 1314.90 s [vector] +++ OK, passed 100 tests.
  9868. 1314.91 s [vector] imapMaybe: OK
  9869. 1314.91 s [vector] +++ OK, passed 100 tests.
  9870. 1314.91 s [vector] takeWhile: OK
  9871. 1314.91 s [vector] +++ OK, passed 100 tests.
  9872. 1314.91 s [vector] dropWhile: OK
  9873. 1314.91 s [vector] +++ OK, passed 100 tests.
  9874. 1314.91 s [vector] partition: OK
  9875. 1314.91 s [vector] +++ OK, passed 100 tests.
  9876. 1314.91 s [vector] partitionWith: OK
  9877. 1314.91 s [vector] +++ OK, passed 100 tests.
  9878. 1314.91 s [vector] span: OK
  9879. 1314.91 s [vector] +++ OK, passed 100 tests.
  9880. 1314.91 s [vector] break: OK
  9881. 1314.91 s [vector] +++ OK, passed 100 tests.
  9882. 1314.91 s [vector] spanR: OK
  9883. 1314.91 s [vector] +++ OK, passed 100 tests.
  9884. 1314.92 s [vector] breakR: OK
  9885. 1314.92 s [vector] +++ OK, passed 100 tests.
  9886. 1314.92 s [vector] groupBy: OK
  9887. 1314.93 s [vector] +++ OK, passed 100 tests.
  9888. 1314.93 s [vector] elem: OK
  9889. 1314.93 s [vector] +++ OK, passed 100 tests.
  9890. 1314.93 s [vector] notElem: OK
  9891. 1314.93 s [vector] +++ OK, passed 100 tests.
  9892. 1314.93 s [vector] find: OK
  9893. 1314.93 s [vector] +++ OK, passed 100 tests.
  9894. 1314.93 s [vector] findIndex: OK
  9895. 1314.93 s [vector] +++ OK, passed 100 tests.
  9896. 1314.93 s [vector] findIndexR: OK
  9897. 1314.93 s [vector] +++ OK, passed 100 tests.
  9898. 1314.93 s [vector] findIndices: OK
  9899. 1314.93 s [vector] +++ OK, passed 100 tests.
  9900. 1314.93 s [vector] elemIndex: OK
  9901. 1314.93 s [vector] +++ OK, passed 100 tests.
  9902. 1314.94 s [vector] elemIndices: OK
  9903. 1314.94 s [vector] +++ OK, passed 100 tests.
  9904. 1314.94 s [vector] foldl: OK
  9905. 1314.94 s [vector] +++ OK, passed 100 tests.
  9906. 1314.94 s [vector] foldl1: OK
  9907. 1314.94 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9908. 1314.95 s [vector] foldl': OK
  9909. 1314.95 s [vector] +++ OK, passed 100 tests.
  9910. 1314.95 s [vector] foldl1': OK
  9911. 1314.95 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9912. 1314.96 s [vector] foldr: OK
  9913. 1314.97 s [vector] +++ OK, passed 100 tests.
  9914. 1314.97 s [vector] foldr1: OK
  9915. 1314.97 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9916. 1314.97 s [vector] foldr': OK
  9917. 1314.98 s [vector] +++ OK, passed 100 tests.
  9918. 1314.98 s [vector] foldr1': OK
  9919. 1314.98 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9920. 1314.98 s [vector] ifoldl: OK
  9921. 1314.98 s [vector] +++ OK, passed 100 tests.
  9922. 1314.99 s [vector] ifoldl': OK
  9923. 1314.99 s [vector] +++ OK, passed 100 tests.
  9924. 1314.99 s [vector] ifoldr: OK
  9925. 1314.99 s [vector] +++ OK, passed 100 tests.
  9926. 1315.00 s [vector] ifoldr': OK
  9927. 1315.00 s [vector] +++ OK, passed 100 tests.
  9928. 1315.03 s [vector] ifoldM: OK (0.02s)
  9929. 1315.03 s [vector] +++ OK, passed 100 tests.
  9930. 1315.04 s [vector] ifoldM': OK
  9931. 1315.04 s [vector] +++ OK, passed 100 tests.
  9932. 1315.08 s [vector] ifoldM_: OK (0.03s)
  9933. 1315.08 s [vector] +++ OK, passed 100 tests.
  9934. 1315.10 s [vector] ifoldM'_: OK (0.04s)
  9935. 1315.10 s [vector] +++ OK, passed 100 tests.
  9936. 1315.10 s [vector] all: OK
  9937. 1315.10 s [vector] +++ OK, passed 100 tests.
  9938. 1315.10 s [vector] any: OK
  9939. 1315.10 s [vector] +++ OK, passed 100 tests.
  9940. 1315.11 s [vector] prescanl: OK
  9941. 1315.11 s [vector] +++ OK, passed 100 tests.
  9942. 1315.11 s [vector] prescanl': OK
  9943. 1315.11 s [vector] +++ OK, passed 100 tests.
  9944. 1315.11 s [vector] postscanl: OK
  9945. 1315.11 s [vector] +++ OK, passed 100 tests.
  9946. 1315.12 s [vector] postscanl': OK
  9947. 1315.13 s [vector] +++ OK, passed 100 tests.
  9948. 1315.13 s [vector] scanl: OK
  9949. 1315.13 s [vector] +++ OK, passed 100 tests.
  9950. 1315.13 s [vector] scanl': OK
  9951. 1315.13 s [vector] +++ OK, passed 100 tests.
  9952. 1315.14 s [vector] scanl1: OK
  9953. 1315.15 s [vector] +++ OK, passed 100 tests.
  9954. 1315.15 s [vector] scanl1': OK
  9955. 1315.15 s [vector] +++ OK, passed 100 tests.
  9956. 1315.15 s [vector] iscanl: OK
  9957. 1315.15 s [vector] +++ OK, passed 100 tests.
  9958. 1315.17 s [vector] iscanl': OK (0.02s)
  9959. 1315.17 s [vector] +++ OK, passed 100 tests.
  9960. 1315.17 s [vector] prescanr: OK
  9961. 1315.18 s [vector] +++ OK, passed 100 tests.
  9962. 1315.18 s [vector] prescanr': OK
  9963. 1315.19 s [vector] +++ OK, passed 100 tests.
  9964. 1315.19 s [vector] postscanr: OK
  9965. 1315.19 s [vector] +++ OK, passed 100 tests.
  9966. 1315.19 s [vector] postscanr': OK
  9967. 1315.20 s [vector] +++ OK, passed 100 tests.
  9968. 1315.20 s [vector] scanr: OK
  9969. 1315.21 s [vector] +++ OK, passed 100 tests.
  9970. 1315.22 s [vector] scanr': OK
  9971. 1315.23 s [vector] +++ OK, passed 100 tests.
  9972. 1315.23 s [vector] scanr1: OK (0.01s)
  9973. 1315.23 s [vector] +++ OK, passed 100 tests.
  9974. 1315.25 s [vector] scanr1': OK
  9975. 1315.25 s [vector] +++ OK, passed 100 tests.
  9976. 1315.25 s [vector] iscanr: OK (0.01s)
  9977. 1315.25 s [vector] +++ OK, passed 100 tests.
  9978. 1315.26 s [vector] iscanr': OK (0.01s)
  9979. 1315.26 s [vector] +++ OK, passed 100 tests.
  9980. 1315.27 s [vector] mut_read: OK
  9981. 1315.27 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9982. 1315.27 s [vector] mut_write: OK
  9983. 1315.27 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9984. 1315.27 s [vector] mut_modify: OK
  9985. 1315.27 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9986. 1315.27 s [vector] mut_generate: OK
  9987. 1315.27 s [vector] +++ OK, passed 100 tests.
  9988. 1315.32 s [vector] mut_generateM: OK (0.03s)
  9989. 1315.32 s [vector] +++ OK, passed 100 tests.
  9990. 1315.33 s [vector] mut_mapM_: OK (0.03s)
  9991. 1315.34 s [vector] +++ OK, passed 100 tests.
  9992. 1315.38 s [vector] mut_imapM_: OK (0.04s)
  9993. 1315.38 s [vector] +++ OK, passed 100 tests.
  9994. 1315.42 s [vector] mut_forM_: OK (0.03s)
  9995. 1315.61 s [vector] +++ OK, passed 100 tests.
  9996. 1315.61 s [vector] mut_iforM_: OK (0.04s)
  9997. 1315.61 s [vector] +++ OK, passed 100 tests.
  9998. 1315.61 s [vector] mut_foldr: OK
  9999. 1315.61 s [vector] +++ OK, passed 100 tests.
  10000. 1315.61 s [vector] mut_foldr': OK
  10001. 1315.61 s [vector] +++ OK, passed 100 tests.
  10002. 1315.61 s [vector] mut_foldl: OK
  10003. 1315.61 s [vector] +++ OK, passed 100 tests.
  10004. 1315.61 s [vector] mut_foldl': OK
  10005. 1315.61 s [vector] +++ OK, passed 100 tests.
  10006. 1315.61 s [vector] mut_ifoldr: OK
  10007. 1315.61 s [vector] +++ OK, passed 100 tests.
  10008. 1315.61 s [vector] mut_ifoldr': OK
  10009. 1315.61 s [vector] +++ OK, passed 100 tests.
  10010. 1315.61 s [vector] mut_ifoldl: OK
  10011. 1315.61 s [vector] +++ OK, passed 100 tests.
  10012. 1315.61 s [vector] mut_ifoldl': OK
  10013. 1315.61 s [vector] +++ OK, passed 100 tests.
  10014. 1315.61 s [vector] mut_foldM: OK
  10015. 1315.61 s [vector] +++ OK, passed 100 tests.
  10016. 1315.61 s [vector] mut_foldM': OK
  10017. 1315.61 s [vector] +++ OK, passed 100 tests.
  10018. 1315.61 s [vector] mut_foldrM: OK
  10019. 1315.61 s [vector] +++ OK, passed 100 tests.
  10020. 1315.61 s [vector] mut_foldrM': OK
  10021. 1315.61 s [vector] +++ OK, passed 100 tests.
  10022. 1315.61 s [vector] mut_ifoldM: OK
  10023. 1315.61 s [vector] +++ OK, passed 100 tests.
  10024. 1315.61 s [vector] mut_ifoldM': OK
  10025. 1315.61 s [vector] +++ OK, passed 100 tests.
  10026. 1315.61 s [vector] mut_ifoldrM: OK
  10027. 1315.61 s [vector] +++ OK, passed 100 tests.
  10028. 1315.61 s [vector] mut_ifoldrM': OK
  10029. 1315.61 s [vector] +++ OK, passed 100 tests.
  10030. 1315.61 s [vector] compare: OK
  10031. 1315.61 s [vector] +++ OK, passed 100 tests.
  10032. 1315.61 s [vector] maximum: OK
  10033. 1315.61 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10034. 1315.61 s [vector] minimum: OK
  10035. 1315.61 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10036. 1315.61 s [vector] minIndex: OK
  10037. 1315.61 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10038. 1315.61 s [vector] maxIndex: OK
  10039. 1315.61 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10040. 1315.61 s [vector] maximumBy: OK
  10041. 1315.61 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10042. 1315.61 s [vector] minimumBy: OK
  10043. 1315.61 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10044. 1315.61 s [vector] maximumOn: OK
  10045. 1315.61 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10046. 1315.61 s [vector] minimumOn: OK
  10047. 1315.61 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10048. 1315.61 s [vector] maxIndexBy: OK
  10049. 1315.61 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10050. 1315.61 s [vector] minIndexBy: OK
  10051. 1315.61 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10052. 1315.61 s [vector] ListFirstMaxIndexWins: OK
  10053. 1315.61 s [vector] +++ OK, passed 100 tests; 24 discarded.
  10054. 1315.61 s [vector] FalseListFirstMaxIndexWins: OK
  10055. 1315.62 s [vector] +++ OK, failed as expected. (after 1 test):
  10056. 1315.62 s [vector] Exception:
  10057. 1315.62 s [vector] Prelude.foldr1: empty list
  10058. 1315.62 s [vector] CallStack (from HasCallStack):
  10059. 1315.62 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  10060. 1315.62 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  10061. 1315.62 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  10062. 1315.62 s [vector] []
  10063. 1315.62 s [vector] zip: OK
  10064. 1315.62 s [vector] +++ OK, passed 100 tests.
  10065. 1315.62 s [vector] zip3: OK
  10066. 1315.62 s [vector] +++ OK, passed 100 tests.
  10067. 1315.62 s [vector] unzip: OK
  10068. 1315.62 s [vector] +++ OK, passed 100 tests.
  10069. 1315.62 s [vector] unzip3: OK
  10070. 1315.62 s [vector] +++ OK, passed 100 tests.
  10071. 1315.62 s [vector] indexed: OK
  10072. 1315.62 s [vector] +++ OK, passed 100 tests.
  10073. 1315.62 s [vector] update: OK
  10074. 1315.62 s [vector] +++ OK, passed 100 tests.
  10075. 1315.62 s [vector] mempty: OK
  10076. 1315.62 s [vector] +++ OK, passed 100 tests.
  10077. 1315.62 s [vector] mappend: OK
  10078. 1315.62 s [vector] +++ OK, passed 100 tests.
  10079. 1315.65 s [vector] mconcat: OK (0.04s)
  10080. 1315.65 s [vector] +++ OK, passed 100 tests.
  10081. 1315.65 s [vector] glength: OK
  10082. 1315.65 s [vector] +++ OK, passed 100 tests.
  10083. 1315.65 s [vector] (Int,Bool,Int)
  10084. 1315.66 s [vector] fromList.toList == id: OK
  10085. 1315.66 s [vector] +++ OK, passed 100 tests.
  10086. 1315.66 s [vector] toList.fromList == id: OK
  10087. 1315.66 s [vector] +++ OK, passed 100 tests.
  10088. 1315.66 s [vector] unstream.stream == id: OK
  10089. 1315.66 s [vector] +++ OK, passed 100 tests.
  10090. 1315.67 s [vector] stream.unstream == id: OK
  10091. 1315.67 s [vector] +++ OK, passed 100 tests.
  10092. 1315.67 s [vector] eq: OK
  10093. 1315.67 s [vector] +++ OK, passed 100 tests.
  10094. 1315.67 s [vector] length: OK
  10095. 1315.67 s [vector] +++ OK, passed 100 tests.
  10096. 1315.67 s [vector] null: OK
  10097. 1315.67 s [vector] +++ OK, passed 100 tests.
  10098. 1315.67 s [vector] index: OK
  10099. 1315.67 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10100. 1315.67 s [vector] safeIndex: OK
  10101. 1315.67 s [vector] +++ OK, passed 100 tests.
  10102. 1315.67 s [vector] head: OK
  10103. 1315.67 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10104. 1315.67 s [vector] last: OK
  10105. 1315.67 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10106. 1315.67 s [vector] unsafeIndex: OK
  10107. 1315.67 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10108. 1315.67 s [vector] unsafeHead: OK
  10109. 1315.67 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10110. 1315.67 s [vector] unsafeLast: OK
  10111. 1315.67 s [vector] +++ OK, passed 100 tests; 25 discarded.
  10112. 1315.67 s [vector] slice: OK
  10113. 1315.67 s [vector] +++ OK, passed 100 tests.
  10114. 1315.67 s [vector] init: OK
  10115. 1315.67 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10116. 1315.68 s [vector] tail: OK
  10117. 1315.68 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10118. 1315.68 s [vector] take: OK
  10119. 1315.68 s [vector] +++ OK, passed 100 tests.
  10120. 1315.68 s [vector] drop: OK
  10121. 1315.68 s [vector] +++ OK, passed 100 tests.
  10122. 1315.68 s [vector] splitAt: OK
  10123. 1315.68 s [vector] +++ OK, passed 100 tests.
  10124. 1315.69 s [vector] empty: OK
  10125. 1315.69 s [vector] +++ OK, passed 100 tests.
  10126. 1315.69 s [vector] singleton: OK
  10127. 1315.70 s [vector] +++ OK, passed 100 tests.
  10128. 1315.70 s [vector] replicate: OK
  10129. 1315.70 s [vector] +++ OK, passed 100 tests.
  10130. 1315.70 s [vector] generate: OK
  10131. 1315.70 s [vector] +++ OK, passed 100 tests.
  10132. 1315.70 s [vector] iterateN: OK
  10133. 1315.70 s [vector] +++ OK, passed 100 tests.
  10134. 1315.77 s [vector] iterateNM: OK (0.08s)
  10135. 1315.78 s [vector] +++ OK, passed 100 tests.
  10136. 1315.81 s [vector] generateM: OK (0.04s)
  10137. 1315.82 s [vector] +++ OK, passed 100 tests.
  10138. 1315.82 s [vector] replicateM: OK (0.01s)
  10139. 1315.82 s [vector] +++ OK, passed 100 tests.
  10140. 1315.82 s [vector] create: OK
  10141. 1315.82 s [vector] +++ OK, passed 100 tests.
  10142. 1315.82 s [vector] createT: OK
  10143. 1315.82 s [vector] +++ OK, passed 100 tests.
  10144. 1315.82 s [vector] unfoldr: OK
  10145. 1315.82 s [vector] +++ OK, passed 100 tests.
  10146. 1315.82 s [vector] unfoldrN: OK
  10147. 1315.83 s [vector] +++ OK, passed 100 tests.
  10148. 1315.83 s [vector] unfoldrExactN: OK
  10149. 1315.84 s [vector] +++ OK, passed 100 tests.
  10150. 1315.84 s [vector] unfoldrM: OK
  10151. 1315.84 s [vector] +++ OK, passed 100 tests.
  10152. 1315.84 s [vector] unfoldrNM: OK
  10153. 1315.84 s [vector] +++ OK, passed 100 tests.
  10154. 1315.93 s [vector] unfoldrExactNM: OK (0.09s)
  10155. 1315.93 s [vector] +++ OK, passed 100 tests.
  10156. 1315.94 s [vector] constructN: OK (0.01s)
  10157. 1315.94 s [vector] +++ OK, passed 100 tests.
  10158. 1315.94 s [vector] constructrN: OK (0.01s)
  10159. 1315.94 s [vector] +++ OK, passed 100 tests.
  10160. 1315.94 s [vector] cons: OK
  10161. 1315.94 s [vector] +++ OK, passed 100 tests.
  10162. 1315.95 s [vector] snoc: OK
  10163. 1315.95 s [vector] +++ OK, passed 100 tests.
  10164. 1315.96 s [vector] append: OK
  10165. 1315.96 s [vector] +++ OK, passed 100 tests.
  10166. 1316.03 s [vector] concat: OK (0.08s)
  10167. 1316.03 s [vector] +++ OK, passed 100 tests.
  10168. 1316.03 s [vector] force: OK
  10169. 1316.04 s [vector] +++ OK, passed 100 tests.
  10170. 1316.05 s [vector] upd: OK (0.02s)
  10171. 1316.06 s [vector] +++ OK, passed 100 tests.
  10172. 1316.06 s [vector] accum: OK (0.01s)
  10173. 1316.06 s [vector] +++ OK, passed 100 tests.
  10174. 1316.07 s [vector] reverse: OK
  10175. 1316.07 s [vector] +++ OK, passed 100 tests.
  10176. 1316.08 s [vector] backpermute: OK
  10177. 1316.08 s [vector] +++ OK, passed 100 tests.
  10178. 1316.08 s [vector] map: OK
  10179. 1316.08 s [vector] +++ OK, passed 100 tests.
  10180. 1316.09 s [vector] imap: OK
  10181. 1316.09 s [vector] +++ OK, passed 100 tests.
  10182. 1316.09 s [vector] concatMap: OK
  10183. 1316.09 s [vector] +++ OK, passed 100 tests.
  10184. 1316.09 s [vector] mapM: OK
  10185. 1316.09 s [vector] +++ OK, passed 100 tests.
  10186. 1316.14 s [vector] mapM_: OK (0.04s)
  10187. 1316.14 s [vector] +++ OK, passed 100 tests.
  10188. 1316.14 s [vector] forM: OK
  10189. 1316.14 s [vector] +++ OK, passed 100 tests.
  10190. 1316.19 s [vector] forM_: OK (0.04s)
  10191. 1316.19 s [vector] +++ OK, passed 100 tests.
  10192. 1316.19 s [vector] imapM: OK
  10193. 1316.19 s [vector] +++ OK, passed 100 tests.
  10194. 1316.25 s [vector] imapM_: OK (0.04s)
  10195. 1316.25 s [vector] +++ OK, passed 100 tests.
  10196. 1316.26 s [vector] zipWith: OK (0.01s)
  10197. 1316.26 s [vector] +++ OK, passed 100 tests.
  10198. 1316.27 s [vector] zipWith3: OK (0.02s)
  10199. 1316.27 s [vector] +++ OK, passed 100 tests.
  10200. 1316.28 s [vector] izipWith: OK (0.01s)
  10201. 1316.28 s [vector] +++ OK, passed 100 tests.
  10202. 1316.30 s [vector] izipWith3: OK (0.02s)
  10203. 1316.30 s [vector] +++ OK, passed 100 tests.
  10204. 1316.32 s [vector] izipWithM: OK (0.02s)
  10205. 1316.32 s [vector] +++ OK, passed 100 tests.
  10206. 1316.37 s [vector] izipWithM_: OK (0.06s)
  10207. 1316.38 s [vector] +++ OK, passed 100 tests.
  10208. 1316.39 s [vector] zipWithM: OK (0.01s)
  10209. 1316.39 s [vector] +++ OK, passed 100 tests.
  10210. 1316.43 s [vector] zipWithM_: OK (0.05s)
  10211. 1316.44 s [vector] +++ OK, passed 100 tests.
  10212. 1316.44 s [vector] filter: OK
  10213. 1316.44 s [vector] +++ OK, passed 100 tests.
  10214. 1316.44 s [vector] ifilter: OK
  10215. 1316.44 s [vector] +++ OK, passed 100 tests.
  10216. 1316.51 s [vector] filterM: OK (0.07s)
  10217. 1316.52 s [vector] +++ OK, passed 100 tests.
  10218. 1316.52 s [vector] uniq: OK
  10219. 1316.52 s [vector] +++ OK, passed 100 tests.
  10220. 1316.53 s [vector] mapMaybe: OK
  10221. 1316.53 s [vector] +++ OK, passed 100 tests.
  10222. 1316.53 s [vector] imapMaybe: OK
  10223. 1316.53 s [vector] +++ OK, passed 100 tests.
  10224. 1316.54 s [vector] takeWhile: OK
  10225. 1316.54 s [vector] +++ OK, passed 100 tests.
  10226. 1316.54 s [vector] dropWhile: OK
  10227. 1316.54 s [vector] +++ OK, passed 100 tests.
  10228. 1316.54 s [vector] partition: OK
  10229. 1316.54 s [vector] +++ OK, passed 100 tests.
  10230. 1316.55 s [vector] partitionWith: OK
  10231. 1316.55 s [vector] +++ OK, passed 100 tests.
  10232. 1316.55 s [vector] span: OK
  10233. 1316.55 s [vector] +++ OK, passed 100 tests.
  10234. 1316.56 s [vector] break: OK
  10235. 1316.57 s [vector] +++ OK, passed 100 tests.
  10236. 1316.57 s [vector] spanR: OK
  10237. 1316.57 s [vector] +++ OK, passed 100 tests.
  10238. 1316.57 s [vector] breakR: OK
  10239. 1316.57 s [vector] +++ OK, passed 100 tests.
  10240. 1316.57 s [vector] groupBy: OK
  10241. 1316.57 s [vector] +++ OK, passed 100 tests.
  10242. 1316.57 s [vector] elem: OK
  10243. 1316.57 s [vector] +++ OK, passed 100 tests.
  10244. 1316.57 s [vector] notElem: OK
  10245. 1316.57 s [vector] +++ OK, passed 100 tests.
  10246. 1316.57 s [vector] find: OK
  10247. 1316.57 s [vector] +++ OK, passed 100 tests.
  10248. 1316.57 s [vector] findIndex: OK
  10249. 1316.57 s [vector] +++ OK, passed 100 tests.
  10250. 1316.58 s [vector] findIndexR: OK
  10251. 1316.58 s [vector] +++ OK, passed 100 tests.
  10252. 1316.59 s [vector] findIndices: OK
  10253. 1316.59 s [vector] +++ OK, passed 100 tests.
  10254. 1316.59 s [vector] elemIndex: OK
  10255. 1316.59 s [vector] +++ OK, passed 100 tests.
  10256. 1316.59 s [vector] elemIndices: OK
  10257. 1316.59 s [vector] +++ OK, passed 100 tests.
  10258. 1316.59 s [vector] foldl: OK
  10259. 1316.60 s [vector] +++ OK, passed 100 tests.
  10260. 1316.60 s [vector] foldl1: OK
  10261. 1316.60 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10262. 1316.62 s [vector] foldl': OK (0.01s)
  10263. 1316.62 s [vector] +++ OK, passed 100 tests.
  10264. 1316.63 s [vector] foldl1': OK (0.01s)
  10265. 1316.63 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10266. 1316.63 s [vector] foldr: OK
  10267. 1316.63 s [vector] +++ OK, passed 100 tests.
  10268. 1316.65 s [vector] foldr1: OK
  10269. 1316.65 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10270. 1316.65 s [vector] foldr': OK
  10271. 1316.65 s [vector] +++ OK, passed 100 tests.
  10272. 1316.65 s [vector] foldr1': OK
  10273. 1316.66 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10274. 1316.67 s [vector] ifoldl: OK (0.01s)
  10275. 1316.67 s [vector] +++ OK, passed 100 tests.
  10276. 1316.68 s [vector] ifoldl': OK
  10277. 1316.68 s [vector] +++ OK, passed 100 tests.
  10278. 1316.68 s [vector] ifoldr: OK
  10279. 1316.69 s [vector] +++ OK, passed 100 tests.
  10280. 1316.70 s [vector] ifoldr': OK (0.01s)
  10281. 1316.70 s [vector] +++ OK, passed 100 tests.
  10282. 1316.70 s [vector] ifoldM: OK
  10283. 1316.71 s [vector] +++ OK, passed 100 tests.
  10284. 1316.71 s [vector] ifoldM': OK
  10285. 1316.72 s [vector] +++ OK, passed 100 tests.
  10286. 1316.75 s [vector] ifoldM_: OK (0.04s)
  10287. 1316.76 s [vector] +++ OK, passed 100 tests.
  10288. 1316.80 s [vector] ifoldM'_: OK (0.04s)
  10289. 1316.80 s [vector] +++ OK, passed 100 tests.
  10290. 1316.80 s [vector] all: OK
  10291. 1316.80 s [vector] +++ OK, passed 100 tests.
  10292. 1316.81 s [vector] any: OK
  10293. 1316.81 s [vector] +++ OK, passed 100 tests.
  10294. 1316.81 s [vector] prescanl: OK
  10295. 1316.81 s [vector] +++ OK, passed 100 tests.
  10296. 1316.82 s [vector] prescanl': OK
  10297. 1316.82 s [vector] +++ OK, passed 100 tests.
  10298. 1316.83 s [vector] postscanl: OK
  10299. 1316.83 s [vector] +++ OK, passed 100 tests.
  10300. 1316.84 s [vector] postscanl': OK
  10301. 1316.84 s [vector] +++ OK, passed 100 tests.
  10302. 1316.84 s [vector] scanl: OK
  10303. 1316.84 s [vector] +++ OK, passed 100 tests.
  10304. 1316.85 s [vector] scanl': OK
  10305. 1316.86 s [vector] +++ OK, passed 100 tests.
  10306. 1316.86 s [vector] scanl1: OK
  10307. 1316.86 s [vector] +++ OK, passed 100 tests.
  10308. 1316.87 s [vector] scanl1': OK
  10309. 1316.88 s [vector] +++ OK, passed 100 tests.
  10310. 1316.89 s [vector] iscanl: OK (0.01s)
  10311. 1316.89 s [vector] +++ OK, passed 100 tests.
  10312. 1316.90 s [vector] iscanl': OK
  10313. 1316.90 s [vector] +++ OK, passed 100 tests.
  10314. 1316.90 s [vector] prescanr: OK
  10315. 1316.90 s [vector] +++ OK, passed 100 tests.
  10316. 1316.91 s [vector] prescanr': OK
  10317. 1316.91 s [vector] +++ OK, passed 100 tests.
  10318. 1316.92 s [vector] postscanr: OK
  10319. 1316.92 s [vector] +++ OK, passed 100 tests.
  10320. 1316.92 s [vector] postscanr': OK
  10321. 1316.92 s [vector] +++ OK, passed 100 tests.
  10322. 1316.92 s [vector] scanr: OK
  10323. 1316.93 s [vector] +++ OK, passed 100 tests.
  10324. 1316.93 s [vector] scanr': OK
  10325. 1316.93 s [vector] +++ OK, passed 100 tests.
  10326. 1316.94 s [vector] scanr1: OK
  10327. 1316.94 s [vector] +++ OK, passed 100 tests.
  10328. 1316.95 s [vector] scanr1': OK
  10329. 1316.95 s [vector] +++ OK, passed 100 tests.
  10330. 1316.96 s [vector] iscanr: OK
  10331. 1316.97 s [vector] +++ OK, passed 100 tests.
  10332. 1316.97 s [vector] iscanr': OK
  10333. 1316.97 s [vector] +++ OK, passed 100 tests.
  10334. 1316.98 s [vector] mut_read: OK
  10335. 1316.98 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10336. 1316.98 s [vector] mut_write: OK
  10337. 1316.98 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10338. 1316.98 s [vector] mut_modify: OK
  10339. 1316.98 s [vector] +++ OK, passed 100 tests; 21 discarded.
  10340. 1316.98 s [vector] mut_generate: OK
  10341. 1316.98 s [vector] +++ OK, passed 100 tests.
  10342. 1317.06 s [vector] mut_generateM: OK (0.06s)
  10343. 1317.06 s [vector] +++ OK, passed 100 tests.
  10344. 1317.10 s [vector] mut_mapM_: OK (0.07s)
  10345. 1317.10 s [vector] +++ OK, passed 100 tests.
  10346. 1317.16 s [vector] mut_imapM_: OK (0.04s)
  10347. 1317.16 s [vector] +++ OK, passed 100 tests.
  10348. 1317.19 s [vector] mut_forM_: OK (0.04s)
  10349. 1317.19 s [vector] +++ OK, passed 100 tests.
  10350. 1317.24 s [vector] mut_iforM_: OK (0.04s)
  10351. 1317.24 s [vector] +++ OK, passed 100 tests.
  10352. 1317.24 s [vector] mut_foldr: OK
  10353. 1317.24 s [vector] +++ OK, passed 100 tests.
  10354. 1317.25 s [vector] mut_foldr': OK
  10355. 1317.25 s [vector] +++ OK, passed 100 tests.
  10356. 1317.25 s [vector] mut_foldl: OK
  10357. 1317.25 s [vector] +++ OK, passed 100 tests.
  10358. 1317.26 s [vector] mut_foldl': OK
  10359. 1317.26 s [vector] +++ OK, passed 100 tests.
  10360. 1317.27 s [vector] mut_ifoldr: OK
  10361. 1317.28 s [vector] +++ OK, passed 100 tests.
  10362. 1317.29 s [vector] mut_ifoldr': OK
  10363. 1317.29 s [vector] +++ OK, passed 100 tests.
  10364. 1317.29 s [vector] mut_ifoldl: OK
  10365. 1317.29 s [vector] +++ OK, passed 100 tests.
  10366. 1317.29 s [vector] mut_ifoldl': OK
  10367. 1317.29 s [vector] +++ OK, passed 100 tests.
  10368. 1317.30 s [vector] mut_foldM: OK
  10369. 1317.30 s [vector] +++ OK, passed 100 tests.
  10370. 1317.31 s [vector] mut_foldM': OK (0.01s)
  10371. 1317.32 s [vector] +++ OK, passed 100 tests.
  10372. 1317.32 s [vector] mut_foldrM: OK
  10373. 1317.32 s [vector] +++ OK, passed 100 tests.
  10374. 1317.33 s [vector] mut_foldrM': OK
  10375. 1317.33 s [vector] +++ OK, passed 100 tests.
  10376. 1317.35 s [vector] mut_ifoldM: OK
  10377. 1317.35 s [vector] +++ OK, passed 100 tests.
  10378. 1317.36 s [vector] mut_ifoldM': OK
  10379. 1317.37 s [vector] +++ OK, passed 100 tests.
  10380. 1317.37 s [vector] mut_ifoldrM: OK (0.01s)
  10381. 1317.37 s [vector] +++ OK, passed 100 tests.
  10382. 1317.37 s [vector] mut_ifoldrM': OK
  10383. 1317.37 s [vector] +++ OK, passed 100 tests.
  10384. 1317.37 s [vector] compare: OK
  10385. 1317.37 s [vector] +++ OK, passed 100 tests.
  10386. 1317.37 s [vector] maximum: OK
  10387. 1317.37 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10388. 1317.37 s [vector] minimum: OK
  10389. 1317.38 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10390. 1317.38 s [vector] minIndex: OK
  10391. 1317.38 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10392. 1317.38 s [vector] maxIndex: OK
  10393. 1317.38 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10394. 1317.38 s [vector] maximumBy: OK
  10395. 1317.38 s [vector] +++ OK, passed 100 tests; 11 discarded.
  10396. 1317.38 s [vector] minimumBy: OK
  10397. 1317.38 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10398. 1317.38 s [vector] maximumOn: OK
  10399. 1317.38 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10400. 1317.38 s [vector] minimumOn: OK
  10401. 1317.39 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10402. 1317.39 s [vector] maxIndexBy: OK
  10403. 1317.39 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10404. 1317.39 s [vector] minIndexBy: OK
  10405. 1317.39 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10406. 1317.40 s [vector] ListFirstMaxIndexWins: OK
  10407. 1317.40 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10408. 1317.40 s [vector] FalseListFirstMaxIndexWins: OK
  10409. 1317.40 s [vector] +++ OK, failed as expected. (after 1 test):
  10410. 1317.40 s [vector] Exception:
  10411. 1317.40 s [vector] Prelude.foldr1: empty list
  10412. 1317.41 s [vector] CallStack (from HasCallStack):
  10413. 1317.42 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  10414. 1317.42 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  10415. 1317.42 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  10416. 1317.42 s [vector] []
  10417. 1317.42 s [vector] zip: OK
  10418. 1317.42 s [vector] +++ OK, passed 100 tests.
  10419. 1317.42 s [vector] zip3: OK
  10420. 1317.42 s [vector] +++ OK, passed 100 tests.
  10421. 1317.42 s [vector] unzip: OK
  10422. 1317.42 s [vector] +++ OK, passed 100 tests.
  10423. 1317.43 s [vector] unzip3: OK (0.02s)
  10424. 1317.43 s [vector] +++ OK, passed 100 tests.
  10425. 1317.44 s [vector] indexed: OK
  10426. 1317.44 s [vector] +++ OK, passed 100 tests.
  10427. 1317.45 s [vector] update: OK (0.01s)
  10428. 1317.45 s [vector] +++ OK, passed 100 tests.
  10429. 1317.45 s [vector] mempty: OK
  10430. 1317.45 s [vector] +++ OK, passed 100 tests.
  10431. 1317.46 s [vector] mappend: OK
  10432. 1317.46 s [vector] +++ OK, passed 100 tests.
  10433. 1317.52 s [vector] mconcat: OK (0.07s)
  10434. 1317.52 s [vector] +++ OK, passed 100 tests.
  10435. 1317.53 s [vector] glength: OK
  10436. 1317.53 s [vector] +++ OK, passed 100 tests.
  10437. 1317.53 s [vector] unstream
  10438. 1317.53 s [vector] unstream == vunstream (exact): OK
  10439. 1317.53 s [vector] +++ OK, passed 100 tests.
  10440. 1317.53 s [vector] unstream == vunstream (unknown): OK
  10441. 1317.53 s [vector] +++ OK, passed 100 tests.
  10442. 1317.53 s [vector] unstreamR ~= vunstream (exact): OK
  10443. 1317.53 s [vector] +++ OK, passed 100 tests.
  10444. 1317.53 s [vector] unstreamR ~= vunstream (unknown): OK
  10445. 1317.53 s [vector] +++ OK, passed 100 tests.
  10446. 1317.53 s [vector] Data.Vector.Storable.Vector Alignment
  10447. 1317.53 s [vector] Aligned Double: OK
  10448. 1317.53 s [vector] Aligned Int: OK
  10449. 1317.53 s [vector] Regression tests
  10450. 1317.53 s [vector] enumFromTo crash #188
  10451. 1317.53 s [vector] Word8: OK
  10452. 1317.53 s [vector] Word16: OK
  10453. 1317.53 s [vector] Word32: OK
  10454. 1317.53 s [vector] Word64: OK
  10455. 1317.53 s [vector] Word: OK
  10456. 1317.53 s [vector] Int8: OK
  10457. 1317.53 s [vector] Int16: OK
  10458. 1317.53 s [vector] Int32: OK
  10459. 1317.53 s [vector] Int64: OK
  10460. 1317.53 s [vector] Int: OK
  10461. 1317.53 s [vector] Char: OK
  10462. 1317.53 s [vector] Negative tests
  10463. 1317.53 s [vector] slice out of bounds #257
  10464. 1317.53 s [vector] Boxed
  10465. 1317.53 s [vector] Negative ix: OK
  10466. 1317.53 s [vector] Negative size: OK
  10467. 1317.53 s [vector] Negative ix and size: OK
  10468. 1317.53 s [vector] Too large ix: OK
  10469. 1317.53 s [vector] Too large size: OK
  10470. 1317.53 s [vector] Too large ix and size: OK
  10471. 1317.53 s [vector] Overflow: OK
  10472. 1317.53 s [vector] OutOfMemory: OK
  10473. 1317.53 s [vector] Primitive
  10474. 1317.53 s [vector] Negative ix: OK
  10475. 1317.53 s [vector] Negative size: OK
  10476. 1317.53 s [vector] Negative ix and size: OK
  10477. 1317.53 s [vector] Too large ix: OK
  10478. 1317.53 s [vector] Too large size: OK
  10479. 1317.53 s [vector] Too large ix and size: OK
  10480. 1317.53 s [vector] Overflow: OK
  10481. 1317.53 s [vector] OutOfMemory: OK
  10482. 1317.53 s [vector] Storable
  10483. 1317.53 s [vector] Negative ix: OK
  10484. 1317.53 s [vector] Negative size: OK
  10485. 1317.53 s [vector] Negative ix and size: OK
  10486. 1317.53 s [vector] Too large ix: OK
  10487. 1317.53 s [vector] Too large size: OK
  10488. 1317.53 s [vector] Too large ix and size: OK
  10489. 1317.53 s [vector] Overflow: OK
  10490. 1317.53 s [vector] OutOfMemory: OK
  10491. 1317.53 s [vector] Unboxed
  10492. 1317.53 s [vector] Negative ix: OK
  10493. 1317.53 s [vector] Negative size: OK
  10494. 1317.53 s [vector] Negative ix and size: OK
  10495. 1317.53 s [vector] Too large ix: OK
  10496. 1317.53 s [vector] Too large size: OK
  10497. 1317.53 s [vector] Too large ix and size: OK
  10498. 1317.53 s [vector] Overflow: OK
  10499. 1317.53 s [vector] OutOfMemory: OK
  10500. 1317.53 s [vector] take #282
  10501. 1317.53 s [vector] Boxed: OK
  10502. 1317.53 s [vector] Primitive: OK
  10503. 1317.53 s [vector] Storable: OK
  10504. 1317.53 s [vector] Unboxed: OK
  10505. 1317.53 s [vector] Data.Vector
  10506. 1317.53 s [vector] MonadFix: OK
  10507. 1317.53 s [vector] toFromArray: OK
  10508. 1317.53 s [vector] toFromArraySlice: OK
  10509. 1317.53 s [vector] toFromArraySliceUnsafe: OK
  10510. 1317.53 s [vector] toFromMutableArray: OK
  10511. 1317.54 s [vector] Data.Vector.Mutable (Move): OK
  10512. 1317.54 s [vector] +++ OK, passed 100 tests; 11 discarded.
  10513. 1317.54 s [vector] Data.Vector.Primitive.Mutable (Move): OK
  10514. 1317.54 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10515. 1317.54 s [vector] Data.Vector.Unboxed.Mutable (Move): OK
  10516. 1317.54 s [vector] +++ OK, passed 100 tests; 11 discarded.
  10517. 1317.56 s [vector] Data.Vector.Storable.Mutable (Move): OK
  10518. 1317.56 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10519. 1317.58 s [vector] Data.Vector.Generic.Mutable (nextPermutation): OK (0.02s)
  10520. 1317.58 s [vector] +++ OK, passed 100 tests.
  10521. 1317.58 s [vector] Data.Vector.Generic.Mutable (prevPermutation): OK (0.02s)
  10522. 1317.58 s [vector] +++ OK, passed 100 tests.
  10523. 1317.58 s [vector] Data.Vector.Generic.Mutable (nextPermutation then prevPermutation = id): OK
  10524. 1317.58 s [vector] +++ OK, passed 100 tests.
  10525. 1317.58 s [vector] Data.Vector.Generic.Mutable (prevPermutation then nextPermutation = id): OK
  10526. 1317.58 s [vector] +++ OK, passed 100 tests.
  10527. 1317.58 s [vector]
  10528. 1317.58 s [vector] All 2808 tests passed (17.17s)
  10529. 1317.59 s [vector] Test suite vector-tests-O0: PASS
  10530. 1317.59 s [vector] Test suite logged to: dist/test/vector-0.13.2.0-vector-tests-O0.log
  10531. 1317.59 s [vector] Test suite vector-tests-O2: RUNNING...
  10532. 1317.78 s [vector] toplevel
  10533. 1317.78 s [vector] Data.Vector.Fusion.Bundle
  10534. 1317.79 s [vector] fromList.toList == id: OK
  10535. 1317.79 s [vector] +++ OK, passed 100 tests.
  10536. 1317.79 s [vector] toList.fromList == id: OK
  10537. 1317.79 s [vector] +++ OK, passed 100 tests.
  10538. 1317.80 s [vector] eq: OK
  10539. 1317.80 s [vector] +++ OK, passed 100 tests.
  10540. 1317.80 s [vector] length: OK
  10541. 1317.80 s [vector] +++ OK, passed 100 tests.
  10542. 1317.80 s [vector] null: OK
  10543. 1317.80 s [vector] +++ OK, passed 100 tests.
  10544. 1317.80 s [vector] empty: OK
  10545. 1317.80 s [vector] +++ OK, passed 100 tests.
  10546. 1317.80 s [vector] singleton: OK
  10547. 1317.80 s [vector] +++ OK, passed 100 tests.
  10548. 1317.80 s [vector] replicate: OK
  10549. 1317.80 s [vector] +++ OK, passed 100 tests.
  10550. 1317.80 s [vector] cons: OK
  10551. 1317.80 s [vector] +++ OK, passed 100 tests.
  10552. 1317.80 s [vector] snoc: OK
  10553. 1317.80 s [vector] +++ OK, passed 100 tests.
  10554. 1317.80 s [vector] append: OK
  10555. 1317.80 s [vector] +++ OK, passed 100 tests.
  10556. 1317.80 s [vector] head: OK
  10557. 1317.80 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10558. 1317.80 s [vector] last: OK
  10559. 1317.80 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10560. 1317.80 s [vector] index: OK
  10561. 1317.80 s [vector] +++ OK, passed 100 tests; 25 discarded.
  10562. 1317.80 s [vector] extract: OK
  10563. 1317.80 s [vector] +++ OK, passed 100 tests.
  10564. 1317.80 s [vector] init: OK
  10565. 1317.80 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10566. 1317.80 s [vector] tail: OK
  10567. 1317.80 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10568. 1317.80 s [vector] take: OK
  10569. 1317.80 s [vector] +++ OK, passed 100 tests.
  10570. 1317.80 s [vector] drop: OK
  10571. 1317.80 s [vector] +++ OK, passed 100 tests.
  10572. 1317.80 s [vector] map: OK
  10573. 1317.80 s [vector] +++ OK, passed 100 tests.
  10574. 1317.80 s [vector] zipWith: OK
  10575. 1317.80 s [vector] +++ OK, passed 100 tests.
  10576. 1317.80 s [vector] zipWith3: OK
  10577. 1317.80 s [vector] +++ OK, passed 100 tests.
  10578. 1317.80 s [vector] filter: OK
  10579. 1317.80 s [vector] +++ OK, passed 100 tests.
  10580. 1317.80 s [vector] takeWhile: OK
  10581. 1317.80 s [vector] +++ OK, passed 100 tests.
  10582. 1317.80 s [vector] dropWhile: OK
  10583. 1317.80 s [vector] +++ OK, passed 100 tests.
  10584. 1317.80 s [vector] elem: OK
  10585. 1317.80 s [vector] +++ OK, passed 100 tests.
  10586. 1317.80 s [vector] notElem: OK
  10587. 1317.80 s [vector] +++ OK, passed 100 tests.
  10588. 1317.80 s [vector] find: OK
  10589. 1317.80 s [vector] +++ OK, passed 100 tests.
  10590. 1317.80 s [vector] findIndex: OK
  10591. 1317.80 s [vector] +++ OK, passed 100 tests.
  10592. 1317.80 s [vector] foldl: OK
  10593. 1317.80 s [vector] +++ OK, passed 100 tests.
  10594. 1317.80 s [vector] foldl1: OK
  10595. 1317.80 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10596. 1317.80 s [vector] foldl': OK
  10597. 1317.80 s [vector] +++ OK, passed 100 tests.
  10598. 1317.80 s [vector] foldl1': OK
  10599. 1317.81 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10600. 1317.81 s [vector] foldr: OK
  10601. 1317.81 s [vector] +++ OK, passed 100 tests.
  10602. 1317.81 s [vector] foldr1: OK
  10603. 1317.81 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10604. 1317.81 s [vector] prescanl: OK
  10605. 1317.81 s [vector] +++ OK, passed 100 tests.
  10606. 1317.81 s [vector] prescanl': OK
  10607. 1317.81 s [vector] +++ OK, passed 100 tests.
  10608. 1317.81 s [vector] postscanl: OK
  10609. 1317.82 s [vector] +++ OK, passed 100 tests.
  10610. 1317.82 s [vector] postscanl': OK
  10611. 1317.82 s [vector] +++ OK, passed 100 tests.
  10612. 1317.82 s [vector] scanl: OK
  10613. 1317.82 s [vector] +++ OK, passed 100 tests.
  10614. 1317.82 s [vector] scanl': OK
  10615. 1317.82 s [vector] +++ OK, passed 100 tests.
  10616. 1317.83 s [vector] scanl1: OK
  10617. 1317.83 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10618. 1317.83 s [vector] scanl1': OK
  10619. 1317.83 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10620. 1317.83 s [vector] concatMap: OK
  10621. 1317.83 s [vector] +++ OK, passed 100 tests.
  10622. 1317.83 s [vector] unfoldr: OK
  10623. 1317.83 s [vector] +++ OK, passed 100 tests.
  10624. 1317.84 s [vector] and: OK
  10625. 1317.84 s [vector] +++ OK, passed 100 tests.
  10626. 1317.84 s [vector] or: OK
  10627. 1317.84 s [vector] +++ OK, passed 100 tests.
  10628. 1317.84 s [vector] Tests.Vector.Boxed
  10629. 1317.84 s [vector] Bool
  10630. 1317.84 s [vector] fromList.toList == id: OK
  10631. 1317.84 s [vector] +++ OK, passed 100 tests.
  10632. 1317.84 s [vector] toList.fromList == id: OK
  10633. 1317.84 s [vector] +++ OK, passed 100 tests.
  10634. 1317.84 s [vector] unstream.stream == id: OK
  10635. 1317.84 s [vector] +++ OK, passed 100 tests.
  10636. 1317.84 s [vector] stream.unstream == id: OK
  10637. 1317.84 s [vector] +++ OK, passed 100 tests.
  10638. 1317.84 s [vector] eq: OK
  10639. 1317.84 s [vector] +++ OK, passed 100 tests.
  10640. 1317.84 s [vector] length: OK
  10641. 1317.84 s [vector] +++ OK, passed 100 tests.
  10642. 1317.84 s [vector] null: OK
  10643. 1317.84 s [vector] +++ OK, passed 100 tests.
  10644. 1317.84 s [vector] index: OK
  10645. 1317.84 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10646. 1317.84 s [vector] safeIndex: OK
  10647. 1317.84 s [vector] +++ OK, passed 100 tests.
  10648. 1317.84 s [vector] head: OK
  10649. 1317.84 s [vector] +++ OK, passed 100 tests; 21 discarded.
  10650. 1317.84 s [vector] last: OK
  10651. 1317.84 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10652. 1317.84 s [vector] unsafeIndex: OK
  10653. 1317.84 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10654. 1317.84 s [vector] unsafeHead: OK
  10655. 1317.84 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10656. 1317.84 s [vector] unsafeLast: OK
  10657. 1317.84 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10658. 1317.85 s [vector] slice: OK
  10659. 1317.85 s [vector] +++ OK, passed 100 tests.
  10660. 1317.85 s [vector] init: OK
  10661. 1317.85 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10662. 1317.85 s [vector] tail: OK
  10663. 1317.85 s [vector] +++ OK, passed 100 tests; 20 discarded.
  10664. 1317.85 s [vector] take: OK
  10665. 1317.85 s [vector] +++ OK, passed 100 tests.
  10666. 1317.85 s [vector] drop: OK
  10667. 1317.85 s [vector] +++ OK, passed 100 tests.
  10668. 1317.85 s [vector] splitAt: OK
  10669. 1317.85 s [vector] +++ OK, passed 100 tests.
  10670. 1317.85 s [vector] empty: OK
  10671. 1317.85 s [vector] +++ OK, passed 100 tests.
  10672. 1317.85 s [vector] singleton: OK
  10673. 1317.85 s [vector] +++ OK, passed 100 tests.
  10674. 1317.85 s [vector] replicate: OK
  10675. 1317.85 s [vector] +++ OK, passed 100 tests.
  10676. 1317.85 s [vector] generate: OK
  10677. 1317.85 s [vector] +++ OK, passed 100 tests.
  10678. 1317.86 s [vector] iterateN: OK
  10679. 1317.86 s [vector] +++ OK, passed 100 tests.
  10680. 1317.86 s [vector] iterateNM: OK (0.02s)
  10681. 1317.86 s [vector] +++ OK, passed 100 tests.
  10682. 1317.86 s [vector] generateM: OK
  10683. 1317.86 s [vector] +++ OK, passed 100 tests.
  10684. 1317.86 s [vector] replicateM: OK (0.02s)
  10685. 1317.86 s [vector] +++ OK, passed 100 tests.
  10686. 1317.86 s [vector] create: OK
  10687. 1317.86 s [vector] +++ OK, passed 100 tests.
  10688. 1317.86 s [vector] createT: OK
  10689. 1317.86 s [vector] +++ OK, passed 100 tests.
  10690. 1317.87 s [vector] unfoldr: OK
  10691. 1317.87 s [vector] +++ OK, passed 100 tests.
  10692. 1317.87 s [vector] unfoldrN: OK
  10693. 1317.87 s [vector] +++ OK, passed 100 tests.
  10694. 1317.87 s [vector] unfoldrExactN: OK
  10695. 1317.87 s [vector] +++ OK, passed 100 tests.
  10696. 1317.87 s [vector] unfoldrM: OK
  10697. 1317.87 s [vector] +++ OK, passed 100 tests.
  10698. 1317.87 s [vector] unfoldrNM: OK
  10699. 1317.87 s [vector] +++ OK, passed 100 tests.
  10700. 1317.87 s [vector] unfoldrExactNM: OK (0.01s)
  10701. 1317.87 s [vector] +++ OK, passed 100 tests.
  10702. 1317.87 s [vector] constructN: OK
  10703. 1317.87 s [vector] +++ OK, passed 100 tests.
  10704. 1317.87 s [vector] constructrN: OK
  10705. 1317.87 s [vector] +++ OK, passed 100 tests.
  10706. 1317.87 s [vector] cons: OK
  10707. 1317.87 s [vector] +++ OK, passed 100 tests.
  10708. 1317.87 s [vector] snoc: OK
  10709. 1317.87 s [vector] +++ OK, passed 100 tests.
  10710. 1317.87 s [vector] append: OK
  10711. 1317.87 s [vector] +++ OK, passed 100 tests.
  10712. 1317.87 s [vector] concat: OK
  10713. 1317.87 s [vector] +++ OK, passed 100 tests.
  10714. 1317.87 s [vector] force: OK
  10715. 1317.87 s [vector] +++ OK, passed 100 tests.
  10716. 1317.87 s [vector] upd: OK
  10717. 1317.87 s [vector] +++ OK, passed 100 tests.
  10718. 1317.87 s [vector] accum: OK
  10719. 1317.87 s [vector] +++ OK, passed 100 tests.
  10720. 1317.87 s [vector] reverse: OK
  10721. 1317.87 s [vector] +++ OK, passed 100 tests.
  10722. 1317.87 s [vector] backpermute: OK
  10723. 1317.87 s [vector] +++ OK, passed 100 tests.
  10724. 1317.87 s [vector] map: OK
  10725. 1317.87 s [vector] +++ OK, passed 100 tests.
  10726. 1317.87 s [vector] imap: OK
  10727. 1317.87 s [vector] +++ OK, passed 100 tests.
  10728. 1317.87 s [vector] concatMap: OK
  10729. 1317.87 s [vector] +++ OK, passed 100 tests.
  10730. 1317.87 s [vector] mapM: OK
  10731. 1317.87 s [vector] +++ OK, passed 100 tests.
  10732. 1317.87 s [vector] mapM_: OK (0.05s)
  10733. 1317.87 s [vector] +++ OK, passed 100 tests.
  10734. 1317.87 s [vector] forM: OK
  10735. 1317.87 s [vector] +++ OK, passed 100 tests.
  10736. 1317.87 s [vector] forM_: OK (0.01s)
  10737. 1317.87 s [vector] +++ OK, passed 100 tests.
  10738. 1317.87 s [vector] imapM: OK
  10739. 1317.87 s [vector] +++ OK, passed 100 tests.
  10740. 1317.88 s [vector] imapM_: OK
  10741. 1317.88 s [vector] +++ OK, passed 100 tests.
  10742. 1317.88 s [vector] zipWith: OK
  10743. 1317.88 s [vector] +++ OK, passed 100 tests.
  10744. 1317.88 s [vector] zipWith3: OK
  10745. 1317.88 s [vector] +++ OK, passed 100 tests.
  10746. 1317.88 s [vector] izipWith: OK
  10747. 1317.88 s [vector] +++ OK, passed 100 tests.
  10748. 1317.88 s [vector] izipWith3: OK
  10749. 1317.88 s [vector] +++ OK, passed 100 tests.
  10750. 1317.88 s [vector] izipWithM: OK
  10751. 1317.88 s [vector] +++ OK, passed 100 tests.
  10752. 1317.88 s [vector] izipWithM_: OK
  10753. 1317.88 s [vector] +++ OK, passed 100 tests.
  10754. 1317.88 s [vector] zipWithM: OK
  10755. 1317.88 s [vector] +++ OK, passed 100 tests.
  10756. 1317.88 s [vector] zipWithM_: OK
  10757. 1317.88 s [vector] +++ OK, passed 100 tests.
  10758. 1317.88 s [vector] filter: OK
  10759. 1317.88 s [vector] +++ OK, passed 100 tests.
  10760. 1317.88 s [vector] ifilter: OK
  10761. 1317.88 s [vector] +++ OK, passed 100 tests.
  10762. 1317.88 s [vector] filterM: OK (0.01s)
  10763. 1317.88 s [vector] +++ OK, passed 100 tests.
  10764. 1317.88 s [vector] uniq: OK
  10765. 1317.88 s [vector] +++ OK, passed 100 tests.
  10766. 1317.88 s [vector] mapMaybe: OK
  10767. 1317.88 s [vector] +++ OK, passed 100 tests.
  10768. 1317.88 s [vector] imapMaybe: OK
  10769. 1317.88 s [vector] +++ OK, passed 100 tests.
  10770. 1317.88 s [vector] takeWhile: OK
  10771. 1317.88 s [vector] +++ OK, passed 100 tests.
  10772. 1317.88 s [vector] dropWhile: OK
  10773. 1317.88 s [vector] +++ OK, passed 100 tests.
  10774. 1317.88 s [vector] partition: OK
  10775. 1317.88 s [vector] +++ OK, passed 100 tests.
  10776. 1317.88 s [vector] partitionWith: OK
  10777. 1317.88 s [vector] +++ OK, passed 100 tests.
  10778. 1317.88 s [vector] span: OK
  10779. 1317.88 s [vector] +++ OK, passed 100 tests.
  10780. 1317.88 s [vector] break: OK
  10781. 1317.88 s [vector] +++ OK, passed 100 tests.
  10782. 1317.88 s [vector] spanR: OK
  10783. 1317.88 s [vector] +++ OK, passed 100 tests.
  10784. 1317.88 s [vector] breakR: OK
  10785. 1317.88 s [vector] +++ OK, passed 100 tests.
  10786. 1317.88 s [vector] groupBy: OK
  10787. 1317.88 s [vector] +++ OK, passed 100 tests.
  10788. 1317.88 s [vector] elem: OK
  10789. 1317.88 s [vector] +++ OK, passed 100 tests.
  10790. 1317.88 s [vector] notElem: OK
  10791. 1317.88 s [vector] +++ OK, passed 100 tests.
  10792. 1317.88 s [vector] find: OK
  10793. 1317.88 s [vector] +++ OK, passed 100 tests.
  10794. 1317.88 s [vector] findIndex: OK
  10795. 1317.88 s [vector] +++ OK, passed 100 tests.
  10796. 1317.88 s [vector] findIndexR: OK
  10797. 1317.88 s [vector] +++ OK, passed 100 tests.
  10798. 1317.88 s [vector] findIndices: OK
  10799. 1317.88 s [vector] +++ OK, passed 100 tests.
  10800. 1317.88 s [vector] elemIndex: OK
  10801. 1317.88 s [vector] +++ OK, passed 100 tests.
  10802. 1317.88 s [vector] elemIndices: OK
  10803. 1317.88 s [vector] +++ OK, passed 100 tests.
  10804. 1317.88 s [vector] foldl: OK
  10805. 1317.88 s [vector] +++ OK, passed 100 tests.
  10806. 1317.88 s [vector] foldl1: OK
  10807. 1317.88 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10808. 1317.88 s [vector] foldl': OK
  10809. 1317.88 s [vector] +++ OK, passed 100 tests.
  10810. 1317.89 s [vector] foldl1': OK
  10811. 1317.89 s [vector] +++ OK, passed 100 tests; 24 discarded.
  10812. 1317.89 s [vector] foldr: OK
  10813. 1317.89 s [vector] +++ OK, passed 100 tests.
  10814. 1317.89 s [vector] foldr1: OK
  10815. 1317.89 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10816. 1317.89 s [vector] foldr': OK
  10817. 1317.89 s [vector] +++ OK, passed 100 tests.
  10818. 1317.89 s [vector] foldr1': OK
  10819. 1317.89 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10820. 1317.90 s [vector] ifoldl: OK
  10821. 1317.90 s [vector] +++ OK, passed 100 tests.
  10822. 1317.90 s [vector] ifoldl': OK
  10823. 1317.90 s [vector] +++ OK, passed 100 tests.
  10824. 1317.90 s [vector] ifoldr: OK
  10825. 1317.90 s [vector] +++ OK, passed 100 tests.
  10826. 1317.91 s [vector] ifoldr': OK
  10827. 1317.91 s [vector] +++ OK, passed 100 tests.
  10828. 1317.92 s [vector] ifoldM: OK
  10829. 1317.92 s [vector] +++ OK, passed 100 tests.
  10830. 1317.92 s [vector] ifoldM': OK
  10831. 1317.92 s [vector] +++ OK, passed 100 tests.
  10832. 1317.92 s [vector] ifoldM_: OK (0.01s)
  10833. 1317.92 s [vector] +++ OK, passed 100 tests.
  10834. 1317.93 s [vector] ifoldM'_: OK (0.01s)
  10835. 1317.93 s [vector] +++ OK, passed 100 tests.
  10836. 1317.94 s [vector] all: OK
  10837. 1317.94 s [vector] +++ OK, passed 100 tests.
  10838. 1317.94 s [vector] any: OK
  10839. 1317.94 s [vector] +++ OK, passed 100 tests.
  10840. 1317.94 s [vector] prescanl: OK
  10841. 1317.94 s [vector] +++ OK, passed 100 tests.
  10842. 1317.94 s [vector] prescanl': OK
  10843. 1317.94 s [vector] +++ OK, passed 100 tests.
  10844. 1317.94 s [vector] postscanl: OK
  10845. 1317.95 s [vector] +++ OK, passed 100 tests.
  10846. 1317.95 s [vector] postscanl': OK
  10847. 1317.95 s [vector] +++ OK, passed 100 tests.
  10848. 1317.95 s [vector] scanl: OK
  10849. 1317.95 s [vector] +++ OK, passed 100 tests.
  10850. 1317.95 s [vector] scanl': OK
  10851. 1317.95 s [vector] +++ OK, passed 100 tests.
  10852. 1317.95 s [vector] scanl1: OK
  10853. 1317.95 s [vector] +++ OK, passed 100 tests.
  10854. 1317.95 s [vector] scanl1': OK
  10855. 1317.95 s [vector] +++ OK, passed 100 tests.
  10856. 1317.95 s [vector] iscanl: OK
  10857. 1317.96 s [vector] +++ OK, passed 100 tests.
  10858. 1317.96 s [vector] iscanl': OK
  10859. 1317.96 s [vector] +++ OK, passed 100 tests.
  10860. 1317.96 s [vector] prescanr: OK
  10861. 1317.96 s [vector] +++ OK, passed 100 tests.
  10862. 1317.96 s [vector] prescanr': OK
  10863. 1317.96 s [vector] +++ OK, passed 100 tests.
  10864. 1317.96 s [vector] postscanr: OK
  10865. 1317.96 s [vector] +++ OK, passed 100 tests.
  10866. 1317.96 s [vector] postscanr': OK
  10867. 1317.96 s [vector] +++ OK, passed 100 tests.
  10868. 1317.96 s [vector] scanr: OK
  10869. 1317.96 s [vector] +++ OK, passed 100 tests.
  10870. 1317.97 s [vector] scanr': OK
  10871. 1317.97 s [vector] +++ OK, passed 100 tests.
  10872. 1317.97 s [vector] scanr1: OK
  10873. 1317.97 s [vector] +++ OK, passed 100 tests.
  10874. 1317.97 s [vector] scanr1': OK
  10875. 1317.97 s [vector] +++ OK, passed 100 tests.
  10876. 1317.97 s [vector] iscanr: OK
  10877. 1317.97 s [vector] +++ OK, passed 100 tests.
  10878. 1317.97 s [vector] iscanr': OK
  10879. 1317.97 s [vector] +++ OK, passed 100 tests.
  10880. 1317.98 s [vector] mut_read: OK
  10881. 1317.98 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10882. 1317.98 s [vector] mut_write: OK
  10883. 1317.98 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10884. 1317.98 s [vector] mut_modify: OK
  10885. 1317.98 s [vector] +++ OK, passed 100 tests; 20 discarded.
  10886. 1317.98 s [vector] mut_generate: OK
  10887. 1317.98 s [vector] +++ OK, passed 100 tests.
  10888. 1317.99 s [vector] mut_generateM: OK
  10889. 1317.99 s [vector] +++ OK, passed 100 tests.
  10890. 1318.00 s [vector] mut_mapM_: OK (0.01s)
  10891. 1318.00 s [vector] +++ OK, passed 100 tests.
  10892. 1318.00 s [vector] mut_imapM_: OK
  10893. 1318.00 s [vector] +++ OK, passed 100 tests.
  10894. 1318.02 s [vector] mut_forM_: OK
  10895. 1318.02 s [vector] +++ OK, passed 100 tests.
  10896. 1318.02 s [vector] mut_iforM_: OK
  10897. 1318.02 s [vector] +++ OK, passed 100 tests.
  10898. 1318.02 s [vector] mut_foldr: OK
  10899. 1318.02 s [vector] +++ OK, passed 100 tests.
  10900. 1318.02 s [vector] mut_foldr': OK
  10901. 1318.02 s [vector] +++ OK, passed 100 tests.
  10902. 1318.02 s [vector] mut_foldl: OK
  10903. 1318.02 s [vector] +++ OK, passed 100 tests.
  10904. 1318.02 s [vector] mut_foldl': OK
  10905. 1318.02 s [vector] +++ OK, passed 100 tests.
  10906. 1318.02 s [vector] mut_ifoldr: OK
  10907. 1318.02 s [vector] +++ OK, passed 100 tests.
  10908. 1318.02 s [vector] mut_ifoldr': OK
  10909. 1318.02 s [vector] +++ OK, passed 100 tests.
  10910. 1318.02 s [vector] mut_ifoldl: OK
  10911. 1318.02 s [vector] +++ OK, passed 100 tests.
  10912. 1318.02 s [vector] mut_ifoldl': OK
  10913. 1318.02 s [vector] +++ OK, passed 100 tests.
  10914. 1318.03 s [vector] mut_foldM: OK
  10915. 1318.03 s [vector] +++ OK, passed 100 tests.
  10916. 1318.03 s [vector] mut_foldM': OK
  10917. 1318.03 s [vector] +++ OK, passed 100 tests.
  10918. 1318.03 s [vector] mut_foldrM: OK
  10919. 1318.03 s [vector] +++ OK, passed 100 tests.
  10920. 1318.03 s [vector] mut_foldrM': OK
  10921. 1318.03 s [vector] +++ OK, passed 100 tests.
  10922. 1318.03 s [vector] mut_ifoldM: OK
  10923. 1318.03 s [vector] +++ OK, passed 100 tests.
  10924. 1318.03 s [vector] mut_ifoldM': OK
  10925. 1318.03 s [vector] +++ OK, passed 100 tests.
  10926. 1318.04 s [vector] mut_ifoldrM: OK
  10927. 1318.04 s [vector] +++ OK, passed 100 tests.
  10928. 1318.04 s [vector] mut_ifoldrM': OK
  10929. 1318.04 s [vector] +++ OK, passed 100 tests.
  10930. 1318.04 s [vector] compare: OK
  10931. 1318.04 s [vector] +++ OK, passed 100 tests.
  10932. 1318.04 s [vector] maximum: OK
  10933. 1318.04 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10934. 1318.04 s [vector] minimum: OK
  10935. 1318.04 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10936. 1318.04 s [vector] minIndex: OK
  10937. 1318.04 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10938. 1318.04 s [vector] maxIndex: OK
  10939. 1318.04 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10940. 1318.04 s [vector] maximumBy: OK
  10941. 1318.04 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10942. 1318.04 s [vector] minimumBy: OK
  10943. 1318.04 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10944. 1318.04 s [vector] maximumOn: OK
  10945. 1318.04 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10946. 1318.04 s [vector] minimumOn: OK
  10947. 1318.04 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10948. 1318.04 s [vector] maxIndexBy: OK
  10949. 1318.04 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10950. 1318.05 s [vector] minIndexBy: OK
  10951. 1318.05 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10952. 1318.05 s [vector] ListFirstMaxIndexWins: OK
  10953. 1318.05 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10954. 1318.05 s [vector] FalseListFirstMaxIndexWins: OK
  10955. 1318.05 s [vector] +++ OK, failed as expected. (after 1 test):
  10956. 1318.05 s [vector] Exception:
  10957. 1318.05 s [vector] Prelude.foldr1: empty list
  10958. 1318.05 s [vector] CallStack (from HasCallStack):
  10959. 1318.05 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  10960. 1318.05 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  10961. 1318.06 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  10962. 1318.06 s [vector] []
  10963. 1318.06 s [vector] zip: OK
  10964. 1318.06 s [vector] +++ OK, passed 100 tests.
  10965. 1318.06 s [vector] zip3: OK
  10966. 1318.06 s [vector] +++ OK, passed 100 tests.
  10967. 1318.06 s [vector] unzip: OK
  10968. 1318.06 s [vector] +++ OK, passed 100 tests.
  10969. 1318.06 s [vector] unzip3: OK
  10970. 1318.06 s [vector] +++ OK, passed 100 tests.
  10971. 1318.06 s [vector] indexed: OK
  10972. 1318.06 s [vector] +++ OK, passed 100 tests.
  10973. 1318.06 s [vector] update: OK
  10974. 1318.06 s [vector] +++ OK, passed 100 tests.
  10975. 1318.06 s [vector] concat: OK
  10976. 1318.06 s [vector] +++ OK, passed 100 tests.
  10977. 1318.07 s [vector] mempty: OK
  10978. 1318.07 s [vector] +++ OK, passed 100 tests.
  10979. 1318.07 s [vector] mappend: OK
  10980. 1318.07 s [vector] +++ OK, passed 100 tests.
  10981. 1318.07 s [vector] mconcat: OK
  10982. 1318.07 s [vector] +++ OK, passed 100 tests.
  10983. 1318.07 s [vector] fmap: OK
  10984. 1318.07 s [vector] +++ OK, passed 100 tests.
  10985. 1318.07 s [vector] return: OK
  10986. 1318.07 s [vector] +++ OK, passed 100 tests.
  10987. 1318.07 s [vector] bind: OK (0.01s)
  10988. 1318.07 s [vector] +++ OK, passed 100 tests.
  10989. 1318.07 s [vector] mzip: OK
  10990. 1318.07 s [vector] +++ OK, passed 100 tests.
  10991. 1318.07 s [vector] munzip: OK
  10992. 1318.07 s [vector] +++ OK, passed 100 tests.
  10993. 1318.07 s [vector] applicative_pure: OK
  10994. 1318.07 s [vector] +++ OK, passed 100 tests.
  10995. 1318.10 s [vector] applicative_appl: OK (0.02s)
  10996. 1318.10 s [vector] +++ OK, passed 100 tests.
  10997. 1318.10 s [vector] alternative_empty: OK
  10998. 1318.10 s [vector] +++ OK, passed 100 tests.
  10999. 1318.10 s [vector] alternative_or: OK
  11000. 1318.10 s [vector] +++ OK, passed 100 tests.
  11001. 1318.14 s [vector] sequence: OK (0.03s)
  11002. 1318.14 s [vector] +++ OK, passed 100 tests.
  11003. 1318.14 s [vector] sequence_: OK
  11004. 1318.14 s [vector] +++ OK, passed 100 tests.
  11005. 1318.14 s [vector] glength: OK
  11006. 1318.14 s [vector] +++ OK, passed 100 tests.
  11007. 1318.14 s [vector] and: OK
  11008. 1318.15 s [vector] +++ OK, passed 100 tests.
  11009. 1318.15 s [vector] or: OK
  11010. 1318.15 s [vector] +++ OK, passed 100 tests.
  11011. 1318.15 s [vector] Int
  11012. 1318.15 s [vector] fromList.toList == id: OK
  11013. 1318.15 s [vector] +++ OK, passed 100 tests.
  11014. 1318.15 s [vector] toList.fromList == id: OK
  11015. 1318.15 s [vector] +++ OK, passed 100 tests.
  11016. 1318.15 s [vector] unstream.stream == id: OK
  11017. 1318.15 s [vector] +++ OK, passed 100 tests.
  11018. 1318.15 s [vector] stream.unstream == id: OK
  11019. 1318.15 s [vector] +++ OK, passed 100 tests.
  11020. 1318.15 s [vector] eq: OK
  11021. 1318.15 s [vector] +++ OK, passed 100 tests.
  11022. 1318.15 s [vector] length: OK
  11023. 1318.15 s [vector] +++ OK, passed 100 tests.
  11024. 1318.15 s [vector] null: OK
  11025. 1318.15 s [vector] +++ OK, passed 100 tests.
  11026. 1318.15 s [vector] index: OK
  11027. 1318.15 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11028. 1318.15 s [vector] safeIndex: OK
  11029. 1318.15 s [vector] +++ OK, passed 100 tests.
  11030. 1318.15 s [vector] head: OK
  11031. 1318.15 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11032. 1318.15 s [vector] last: OK
  11033. 1318.15 s [vector] +++ OK, passed 100 tests; 20 discarded.
  11034. 1318.15 s [vector] unsafeIndex: OK
  11035. 1318.15 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11036. 1318.15 s [vector] unsafeHead: OK
  11037. 1318.15 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11038. 1318.15 s [vector] unsafeLast: OK
  11039. 1318.15 s [vector] +++ OK, passed 100 tests; 23 discarded.
  11040. 1318.16 s [vector] slice: OK
  11041. 1318.16 s [vector] +++ OK, passed 100 tests.
  11042. 1318.16 s [vector] init: OK
  11043. 1318.16 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11044. 1318.16 s [vector] tail: OK
  11045. 1318.16 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11046. 1318.16 s [vector] take: OK
  11047. 1318.16 s [vector] +++ OK, passed 100 tests.
  11048. 1318.16 s [vector] drop: OK
  11049. 1318.16 s [vector] +++ OK, passed 100 tests.
  11050. 1318.16 s [vector] splitAt: OK
  11051. 1318.16 s [vector] +++ OK, passed 100 tests.
  11052. 1318.16 s [vector] empty: OK
  11053. 1318.16 s [vector] +++ OK, passed 100 tests.
  11054. 1318.16 s [vector] singleton: OK
  11055. 1318.16 s [vector] +++ OK, passed 100 tests.
  11056. 1318.16 s [vector] replicate: OK
  11057. 1318.16 s [vector] +++ OK, passed 100 tests.
  11058. 1318.16 s [vector] generate: OK
  11059. 1318.16 s [vector] +++ OK, passed 100 tests.
  11060. 1318.16 s [vector] iterateN: OK
  11061. 1318.16 s [vector] +++ OK, passed 100 tests.
  11062. 1318.18 s [vector] iterateNM: OK (0.02s)
  11063. 1318.18 s [vector] +++ OK, passed 100 tests.
  11064. 1318.20 s [vector] generateM: OK (0.02s)
  11065. 1318.20 s [vector] +++ OK, passed 100 tests.
  11066. 1318.21 s [vector] replicateM: OK (0.01s)
  11067. 1318.21 s [vector] +++ OK, passed 100 tests.
  11068. 1318.21 s [vector] create: OK
  11069. 1318.21 s [vector] +++ OK, passed 100 tests.
  11070. 1318.21 s [vector] createT: OK
  11071. 1318.21 s [vector] +++ OK, passed 100 tests.
  11072. 1318.21 s [vector] unfoldr: OK
  11073. 1318.22 s [vector] +++ OK, passed 100 tests.
  11074. 1318.22 s [vector] unfoldrN: OK
  11075. 1318.22 s [vector] +++ OK, passed 100 tests.
  11076. 1318.22 s [vector] unfoldrExactN: OK
  11077. 1318.22 s [vector] +++ OK, passed 100 tests.
  11078. 1318.22 s [vector] unfoldrM: OK
  11079. 1318.22 s [vector] +++ OK, passed 100 tests.
  11080. 1318.22 s [vector] unfoldrNM: OK
  11081. 1318.22 s [vector] +++ OK, passed 100 tests.
  11082. 1318.24 s [vector] unfoldrExactNM: OK (0.01s)
  11083. 1318.24 s [vector] +++ OK, passed 100 tests.
  11084. 1318.24 s [vector] constructN: OK
  11085. 1318.24 s [vector] +++ OK, passed 100 tests.
  11086. 1318.24 s [vector] constructrN: OK
  11087. 1318.24 s [vector] +++ OK, passed 100 tests.
  11088. 1318.24 s [vector] cons: OK
  11089. 1318.24 s [vector] +++ OK, passed 100 tests.
  11090. 1318.24 s [vector] snoc: OK
  11091. 1318.26 s [vector] +++ OK, passed 100 tests.
  11092. 1318.26 s [vector] append: OK
  11093. 1318.26 s [vector] +++ OK, passed 100 tests.
  11094. 1318.26 s [vector] concat: OK (0.01s)
  11095. 1318.26 s [vector] +++ OK, passed 100 tests.
  11096. 1318.26 s [vector] force: OK
  11097. 1318.26 s [vector] +++ OK, passed 100 tests.
  11098. 1318.26 s [vector] upd: OK
  11099. 1318.26 s [vector] +++ OK, passed 100 tests.
  11100. 1318.26 s [vector] accum: OK
  11101. 1318.26 s [vector] +++ OK, passed 100 tests.
  11102. 1318.27 s [vector] reverse: OK
  11103. 1318.27 s [vector] +++ OK, passed 100 tests.
  11104. 1318.27 s [vector] backpermute: OK
  11105. 1318.28 s [vector] +++ OK, passed 100 tests.
  11106. 1318.28 s [vector] map: OK
  11107. 1318.28 s [vector] +++ OK, passed 100 tests.
  11108. 1318.28 s [vector] imap: OK
  11109. 1318.28 s [vector] +++ OK, passed 100 tests.
  11110. 1318.29 s [vector] concatMap: OK
  11111. 1318.29 s [vector] +++ OK, passed 100 tests.
  11112. 1318.29 s [vector] mapM: OK
  11113. 1318.29 s [vector] +++ OK, passed 100 tests.
  11114. 1318.29 s [vector] mapM_: OK (0.01s)
  11115. 1318.29 s [vector] +++ OK, passed 100 tests.
  11116. 1318.30 s [vector] forM: OK
  11117. 1318.30 s [vector] +++ OK, passed 100 tests.
  11118. 1318.31 s [vector] forM_: OK (0.02s)
  11119. 1318.32 s [vector] +++ OK, passed 100 tests.
  11120. 1318.32 s [vector] imapM: OK
  11121. 1318.32 s [vector] +++ OK, passed 100 tests.
  11122. 1318.33 s [vector] imapM_: OK (0.02s)
  11123. 1318.33 s [vector] +++ OK, passed 100 tests.
  11124. 1318.33 s [vector] zipWith: OK
  11125. 1318.34 s [vector] +++ OK, passed 100 tests.
  11126. 1318.34 s [vector] zipWith3: OK
  11127. 1318.34 s [vector] +++ OK, passed 100 tests.
  11128. 1318.34 s [vector] izipWith: OK
  11129. 1318.34 s [vector] +++ OK, passed 100 tests.
  11130. 1318.34 s [vector] izipWith3: OK
  11131. 1318.34 s [vector] +++ OK, passed 100 tests.
  11132. 1318.35 s [vector] izipWithM: OK
  11133. 1318.35 s [vector] +++ OK, passed 100 tests.
  11134. 1318.37 s [vector] izipWithM_: OK (0.02s)
  11135. 1318.38 s [vector] +++ OK, passed 100 tests.
  11136. 1318.38 s [vector] zipWithM: OK
  11137. 1318.38 s [vector] +++ OK, passed 100 tests.
  11138. 1318.39 s [vector] zipWithM_: OK (0.02s)
  11139. 1318.39 s [vector] +++ OK, passed 100 tests.
  11140. 1318.40 s [vector] filter: OK
  11141. 1318.40 s [vector] +++ OK, passed 100 tests.
  11142. 1318.40 s [vector] ifilter: OK
  11143. 1318.40 s [vector] +++ OK, passed 100 tests.
  11144. 1318.42 s [vector] filterM: OK (0.03s)
  11145. 1318.42 s [vector] +++ OK, passed 100 tests.
  11146. 1318.42 s [vector] uniq: OK
  11147. 1318.42 s [vector] +++ OK, passed 100 tests.
  11148. 1318.42 s [vector] mapMaybe: OK
  11149. 1318.42 s [vector] +++ OK, passed 100 tests.
  11150. 1318.43 s [vector] imapMaybe: OK
  11151. 1318.43 s [vector] +++ OK, passed 100 tests.
  11152. 1318.43 s [vector] takeWhile: OK
  11153. 1318.43 s [vector] +++ OK, passed 100 tests.
  11154. 1318.43 s [vector] dropWhile: OK
  11155. 1318.43 s [vector] +++ OK, passed 100 tests.
  11156. 1318.43 s [vector] partition: OK
  11157. 1318.43 s [vector] +++ OK, passed 100 tests.
  11158. 1318.43 s [vector] partitionWith: OK
  11159. 1318.43 s [vector] +++ OK, passed 100 tests.
  11160. 1318.43 s [vector] span: OK
  11161. 1318.43 s [vector] +++ OK, passed 100 tests.
  11162. 1318.43 s [vector] break: OK
  11163. 1318.43 s [vector] +++ OK, passed 100 tests.
  11164. 1318.43 s [vector] spanR: OK
  11165. 1318.43 s [vector] +++ OK, passed 100 tests.
  11166. 1318.44 s [vector] breakR: OK
  11167. 1318.44 s [vector] +++ OK, passed 100 tests.
  11168. 1318.44 s [vector] groupBy: OK
  11169. 1318.44 s [vector] +++ OK, passed 100 tests.
  11170. 1318.44 s [vector] elem: OK
  11171. 1318.44 s [vector] +++ OK, passed 100 tests.
  11172. 1318.44 s [vector] notElem: OK
  11173. 1318.44 s [vector] +++ OK, passed 100 tests.
  11174. 1318.44 s [vector] find: OK
  11175. 1318.45 s [vector] +++ OK, passed 100 tests.
  11176. 1318.45 s [vector] findIndex: OK
  11177. 1318.45 s [vector] +++ OK, passed 100 tests.
  11178. 1318.45 s [vector] findIndexR: OK
  11179. 1318.46 s [vector] +++ OK, passed 100 tests.
  11180. 1318.46 s [vector] findIndices: OK
  11181. 1318.46 s [vector] +++ OK, passed 100 tests.
  11182. 1318.46 s [vector] elemIndex: OK
  11183. 1318.46 s [vector] +++ OK, passed 100 tests.
  11184. 1318.46 s [vector] elemIndices: OK
  11185. 1318.46 s [vector] +++ OK, passed 100 tests.
  11186. 1318.46 s [vector] foldl: OK
  11187. 1318.46 s [vector] +++ OK, passed 100 tests.
  11188. 1318.46 s [vector] foldl1: OK
  11189. 1318.46 s [vector] +++ OK, passed 100 tests; 11 discarded.
  11190. 1318.46 s [vector] foldl': OK
  11191. 1318.46 s [vector] +++ OK, passed 100 tests.
  11192. 1318.47 s [vector] foldl1': OK
  11193. 1318.47 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11194. 1318.47 s [vector] foldr: OK
  11195. 1318.48 s [vector] +++ OK, passed 100 tests.
  11196. 1318.48 s [vector] foldr1: OK
  11197. 1318.48 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11198. 1318.48 s [vector] foldr': OK
  11199. 1318.48 s [vector] +++ OK, passed 100 tests.
  11200. 1318.48 s [vector] foldr1': OK
  11201. 1318.48 s [vector] +++ OK, passed 100 tests; 20 discarded.
  11202. 1318.48 s [vector] ifoldl: OK
  11203. 1318.48 s [vector] +++ OK, passed 100 tests.
  11204. 1318.49 s [vector] ifoldl': OK
  11205. 1318.49 s [vector] +++ OK, passed 100 tests.
  11206. 1318.50 s [vector] ifoldr: OK
  11207. 1318.50 s [vector] +++ OK, passed 100 tests.
  11208. 1318.50 s [vector] ifoldr': OK
  11209. 1318.50 s [vector] +++ OK, passed 100 tests.
  11210. 1318.50 s [vector] ifoldM: OK
  11211. 1318.50 s [vector] +++ OK, passed 100 tests.
  11212. 1318.51 s [vector] ifoldM': OK
  11213. 1318.51 s [vector] +++ OK, passed 100 tests.
  11214. 1318.54 s [vector] ifoldM_: OK (0.02s)
  11215. 1318.54 s [vector] +++ OK, passed 100 tests.
  11216. 1318.54 s [vector] ifoldM'_: OK (0.01s)
  11217. 1318.54 s [vector] +++ OK, passed 100 tests.
  11218. 1318.54 s [vector] all: OK
  11219. 1318.54 s [vector] +++ OK, passed 100 tests.
  11220. 1318.54 s [vector] any: OK
  11221. 1318.54 s [vector] +++ OK, passed 100 tests.
  11222. 1318.54 s [vector] prescanl: OK
  11223. 1318.54 s [vector] +++ OK, passed 100 tests.
  11224. 1318.55 s [vector] prescanl': OK
  11225. 1318.55 s [vector] +++ OK, passed 100 tests.
  11226. 1318.55 s [vector] postscanl: OK
  11227. 1318.55 s [vector] +++ OK, passed 100 tests.
  11228. 1318.55 s [vector] postscanl': OK
  11229. 1318.55 s [vector] +++ OK, passed 100 tests.
  11230. 1318.55 s [vector] scanl: OK
  11231. 1318.55 s [vector] +++ OK, passed 100 tests.
  11232. 1318.56 s [vector] scanl': OK
  11233. 1318.56 s [vector] +++ OK, passed 100 tests.
  11234. 1318.57 s [vector] scanl1: OK
  11235. 1318.57 s [vector] +++ OK, passed 100 tests.
  11236. 1318.57 s [vector] scanl1': OK
  11237. 1318.57 s [vector] +++ OK, passed 100 tests.
  11238. 1318.57 s [vector] iscanl: OK
  11239. 1318.57 s [vector] +++ OK, passed 100 tests.
  11240. 1318.58 s [vector] iscanl': OK (0.01s)
  11241. 1318.58 s [vector] +++ OK, passed 100 tests.
  11242. 1318.59 s [vector] prescanr: OK
  11243. 1318.59 s [vector] +++ OK, passed 100 tests.
  11244. 1318.59 s [vector] prescanr': OK
  11245. 1318.60 s [vector] +++ OK, passed 100 tests.
  11246. 1318.60 s [vector] postscanr: OK
  11247. 1318.60 s [vector] +++ OK, passed 100 tests.
  11248. 1318.61 s [vector] postscanr': OK
  11249. 1318.61 s [vector] +++ OK, passed 100 tests.
  11250. 1318.62 s [vector] scanr: OK
  11251. 1318.62 s [vector] +++ OK, passed 100 tests.
  11252. 1318.62 s [vector] scanr': OK
  11253. 1318.62 s [vector] +++ OK, passed 100 tests.
  11254. 1318.63 s [vector] scanr1: OK
  11255. 1318.63 s [vector] +++ OK, passed 100 tests.
  11256. 1318.63 s [vector] scanr1': OK
  11257. 1318.63 s [vector] +++ OK, passed 100 tests.
  11258. 1318.63 s [vector] iscanr: OK
  11259. 1318.64 s [vector] +++ OK, passed 100 tests.
  11260. 1318.64 s [vector] iscanr': OK
  11261. 1318.64 s [vector] +++ OK, passed 100 tests.
  11262. 1318.64 s [vector] mut_read: OK
  11263. 1318.64 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11264. 1318.64 s [vector] mut_write: OK
  11265. 1318.64 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11266. 1318.65 s [vector] mut_modify: OK
  11267. 1318.65 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11268. 1318.65 s [vector] mut_generate: OK
  11269. 1318.66 s [vector] +++ OK, passed 100 tests.
  11270. 1318.66 s [vector] mut_generateM: OK (0.01s)
  11271. 1318.66 s [vector] +++ OK, passed 100 tests.
  11272. 1318.66 s [vector] mut_mapM_: OK (0.01s)
  11273. 1318.66 s [vector] +++ OK, passed 100 tests.
  11274. 1318.68 s [vector] mut_imapM_: OK (0.02s)
  11275. 1318.68 s [vector] +++ OK, passed 100 tests.
  11276. 1318.70 s [vector] mut_forM_: OK (0.01s)
  11277. 1318.70 s [vector] +++ OK, passed 100 tests.
  11278. 1318.71 s [vector] mut_iforM_: OK (0.01s)
  11279. 1318.71 s [vector] +++ OK, passed 100 tests.
  11280. 1318.71 s [vector] mut_foldr: OK
  11281. 1318.71 s [vector] +++ OK, passed 100 tests.
  11282. 1318.71 s [vector] mut_foldr': OK
  11283. 1318.71 s [vector] +++ OK, passed 100 tests.
  11284. 1318.71 s [vector] mut_foldl: OK
  11285. 1318.71 s [vector] +++ OK, passed 100 tests.
  11286. 1318.72 s [vector] mut_foldl': OK
  11287. 1318.72 s [vector] +++ OK, passed 100 tests.
  11288. 1318.72 s [vector] mut_ifoldr: OK
  11289. 1318.72 s [vector] +++ OK, passed 100 tests.
  11290. 1318.72 s [vector] mut_ifoldr': OK
  11291. 1318.72 s [vector] +++ OK, passed 100 tests.
  11292. 1318.73 s [vector] mut_ifoldl: OK
  11293. 1318.73 s [vector] +++ OK, passed 100 tests.
  11294. 1318.73 s [vector] mut_ifoldl': OK
  11295. 1318.73 s [vector] +++ OK, passed 100 tests.
  11296. 1318.73 s [vector] mut_foldM: OK
  11297. 1318.73 s [vector] +++ OK, passed 100 tests.
  11298. 1318.73 s [vector] mut_foldM': OK
  11299. 1318.73 s [vector] +++ OK, passed 100 tests.
  11300. 1318.74 s [vector] mut_foldrM: OK
  11301. 1318.74 s [vector] +++ OK, passed 100 tests.
  11302. 1318.74 s [vector] mut_foldrM': OK
  11303. 1318.74 s [vector] +++ OK, passed 100 tests.
  11304. 1318.74 s [vector] mut_ifoldM: OK
  11305. 1318.74 s [vector] +++ OK, passed 100 tests.
  11306. 1318.75 s [vector] mut_ifoldM': OK
  11307. 1318.75 s [vector] +++ OK, passed 100 tests.
  11308. 1318.75 s [vector] mut_ifoldrM: OK
  11309. 1318.75 s [vector] +++ OK, passed 100 tests.
  11310. 1318.75 s [vector] mut_ifoldrM': OK
  11311. 1318.75 s [vector] +++ OK, passed 100 tests.
  11312. 1318.75 s [vector] compare: OK
  11313. 1318.75 s [vector] +++ OK, passed 100 tests.
  11314. 1318.75 s [vector] maximum: OK
  11315. 1318.75 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11316. 1318.75 s [vector] minimum: OK
  11317. 1318.75 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11318. 1318.75 s [vector] minIndex: OK
  11319. 1318.75 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11320. 1318.75 s [vector] maxIndex: OK
  11321. 1318.75 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11322. 1318.75 s [vector] maximumBy: OK
  11323. 1318.75 s [vector] +++ OK, passed 100 tests; 12 discarded.
  11324. 1318.75 s [vector] minimumBy: OK
  11325. 1318.75 s [vector] +++ OK, passed 100 tests; 20 discarded.
  11326. 1318.75 s [vector] maximumOn: OK
  11327. 1318.75 s [vector] +++ OK, passed 100 tests; 12 discarded.
  11328. 1318.75 s [vector] minimumOn: OK
  11329. 1318.76 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11330. 1318.76 s [vector] maxIndexBy: OK
  11331. 1318.76 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11332. 1318.76 s [vector] minIndexBy: OK
  11333. 1318.76 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11334. 1318.76 s [vector] ListFirstMaxIndexWins: OK
  11335. 1318.76 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11336. 1318.76 s [vector] FalseListFirstMaxIndexWins: OK
  11337. 1318.76 s [vector] +++ OK, failed as expected. (after 1 test):
  11338. 1318.76 s [vector] Exception:
  11339. 1318.76 s [vector] Prelude.foldr1: empty list
  11340. 1318.76 s [vector] CallStack (from HasCallStack):
  11341. 1318.76 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  11342. 1318.76 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  11343. 1318.76 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  11344. 1318.76 s [vector] []
  11345. 1318.76 s [vector] zip: OK
  11346. 1318.76 s [vector] +++ OK, passed 100 tests.
  11347. 1318.76 s [vector] zip3: OK
  11348. 1318.76 s [vector] +++ OK, passed 100 tests.
  11349. 1318.76 s [vector] unzip: OK
  11350. 1318.76 s [vector] +++ OK, passed 100 tests.
  11351. 1318.76 s [vector] unzip3: OK
  11352. 1318.76 s [vector] +++ OK, passed 100 tests.
  11353. 1318.76 s [vector] indexed: OK
  11354. 1318.76 s [vector] +++ OK, passed 100 tests.
  11355. 1318.76 s [vector] update: OK
  11356. 1318.78 s [vector] +++ OK, passed 100 tests.
  11357. 1318.78 s [vector] concat: OK (0.01s)
  11358. 1318.78 s [vector] +++ OK, passed 100 tests.
  11359. 1318.78 s [vector] mempty: OK
  11360. 1318.78 s [vector] +++ OK, passed 100 tests.
  11361. 1318.78 s [vector] mappend: OK
  11362. 1318.78 s [vector] +++ OK, passed 100 tests.
  11363. 1318.79 s [vector] mconcat: OK (0.01s)
  11364. 1318.79 s [vector] +++ OK, passed 100 tests.
  11365. 1318.79 s [vector] fmap: OK
  11366. 1318.79 s [vector] +++ OK, passed 100 tests.
  11367. 1318.79 s [vector] return: OK
  11368. 1318.79 s [vector] +++ OK, passed 100 tests.
  11369. 1318.81 s [vector] bind: OK (0.01s)
  11370. 1318.81 s [vector] +++ OK, passed 100 tests.
  11371. 1318.81 s [vector] mzip: OK
  11372. 1318.81 s [vector] +++ OK, passed 100 tests.
  11373. 1318.82 s [vector] munzip: OK
  11374. 1318.82 s [vector] +++ OK, passed 100 tests.
  11375. 1318.82 s [vector] applicative_pure: OK
  11376. 1318.82 s [vector] +++ OK, passed 100 tests.
  11377. 1318.86 s [vector] applicative_appl: OK (0.05s)
  11378. 1318.87 s [vector] +++ OK, passed 100 tests.
  11379. 1318.87 s [vector] alternative_empty: OK
  11380. 1318.87 s [vector] +++ OK, passed 100 tests.
  11381. 1318.88 s [vector] alternative_or: OK
  11382. 1318.88 s [vector] +++ OK, passed 100 tests.
  11383. 1318.90 s [vector] sequence: OK (0.03s)
  11384. 1318.90 s [vector] +++ OK, passed 100 tests.
  11385. 1318.92 s [vector] sequence_: OK (0.01s)
  11386. 1318.92 s [vector] +++ OK, passed 100 tests.
  11387. 1318.92 s [vector] glength: OK
  11388. 1318.92 s [vector] +++ OK, passed 100 tests.
  11389. 1318.92 s [vector] sum: OK
  11390. 1318.92 s [vector] +++ OK, passed 100 tests.
  11391. 1318.92 s [vector] product: OK
  11392. 1318.92 s [vector] +++ OK, passed 100 tests.
  11393. 1318.92 s [vector] enumFromN: OK
  11394. 1318.92 s [vector] +++ OK, passed 100 tests.
  11395. 1318.92 s [vector] enumFromThenN: OK
  11396. 1318.92 s [vector] +++ OK, passed 100 tests.
  11397. 1318.92 s [vector] enumFromTo: OK
  11398. 1318.92 s [vector] +++ OK, passed 100 tests.
  11399. 1318.92 s [vector] enumFromThenTo: OK
  11400. 1318.92 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11401. 1318.92 s [vector] unstream
  11402. 1318.92 s [vector] unstream == vunstream (exact): OK
  11403. 1318.92 s [vector] +++ OK, passed 100 tests.
  11404. 1318.92 s [vector] unstream == vunstream (unknown): OK
  11405. 1318.92 s [vector] +++ OK, passed 100 tests.
  11406. 1318.92 s [vector] unstreamR ~= vunstream (exact): OK
  11407. 1318.92 s [vector] +++ OK, passed 100 tests.
  11408. 1318.92 s [vector] unstreamR ~= vunstream (unknown): OK
  11409. 1318.92 s [vector] +++ OK, passed 100 tests.
  11410. 1318.92 s [vector] Tests.Vector.Primitive
  11411. 1318.92 s [vector] Int
  11412. 1318.92 s [vector] fromList.toList == id: OK
  11413. 1318.92 s [vector] +++ OK, passed 100 tests.
  11414. 1318.93 s [vector] toList.fromList == id: OK
  11415. 1318.93 s [vector] +++ OK, passed 100 tests.
  11416. 1318.93 s [vector] unstream.stream == id: OK
  11417. 1318.93 s [vector] +++ OK, passed 100 tests.
  11418. 1318.93 s [vector] stream.unstream == id: OK
  11419. 1318.93 s [vector] +++ OK, passed 100 tests.
  11420. 1318.93 s [vector] eq: OK
  11421. 1318.93 s [vector] +++ OK, passed 100 tests.
  11422. 1318.93 s [vector] length: OK
  11423. 1318.93 s [vector] +++ OK, passed 100 tests.
  11424. 1318.93 s [vector] null: OK
  11425. 1318.93 s [vector] +++ OK, passed 100 tests.
  11426. 1318.93 s [vector] index: OK
  11427. 1318.93 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11428. 1318.93 s [vector] safeIndex: OK
  11429. 1318.93 s [vector] +++ OK, passed 100 tests.
  11430. 1318.93 s [vector] head: OK
  11431. 1318.93 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11432. 1318.93 s [vector] last: OK
  11433. 1318.93 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11434. 1318.93 s [vector] unsafeIndex: OK
  11435. 1318.93 s [vector] +++ OK, passed 100 tests; 20 discarded.
  11436. 1318.93 s [vector] unsafeHead: OK
  11437. 1318.93 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11438. 1318.93 s [vector] unsafeLast: OK
  11439. 1318.93 s [vector] +++ OK, passed 100 tests; 20 discarded.
  11440. 1318.93 s [vector] slice: OK
  11441. 1318.93 s [vector] +++ OK, passed 100 tests.
  11442. 1318.93 s [vector] init: OK
  11443. 1318.94 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11444. 1318.94 s [vector] tail: OK
  11445. 1318.94 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11446. 1318.94 s [vector] take: OK
  11447. 1318.94 s [vector] +++ OK, passed 100 tests.
  11448. 1318.94 s [vector] drop: OK
  11449. 1318.94 s [vector] +++ OK, passed 100 tests.
  11450. 1318.94 s [vector] splitAt: OK
  11451. 1318.94 s [vector] +++ OK, passed 100 tests.
  11452. 1318.94 s [vector] empty: OK
  11453. 1318.94 s [vector] +++ OK, passed 100 tests.
  11454. 1318.94 s [vector] singleton: OK
  11455. 1318.94 s [vector] +++ OK, passed 100 tests.
  11456. 1318.94 s [vector] replicate: OK
  11457. 1318.94 s [vector] +++ OK, passed 100 tests.
  11458. 1318.94 s [vector] generate: OK
  11459. 1318.94 s [vector] +++ OK, passed 100 tests.
  11460. 1318.94 s [vector] iterateN: OK
  11461. 1318.94 s [vector] +++ OK, passed 100 tests.
  11462. 1318.97 s [vector] iterateNM: OK (0.02s)
  11463. 1318.97 s [vector] +++ OK, passed 100 tests.
  11464. 1319.00 s [vector] generateM: OK (0.04s)
  11465. 1319.00 s [vector] +++ OK, passed 100 tests.
  11466. 1319.02 s [vector] replicateM: OK (0.01s)
  11467. 1319.02 s [vector] +++ OK, passed 100 tests.
  11468. 1319.02 s [vector] create: OK
  11469. 1319.02 s [vector] +++ OK, passed 100 tests.
  11470. 1319.02 s [vector] createT: OK
  11471. 1319.02 s [vector] +++ OK, passed 100 tests.
  11472. 1319.02 s [vector] unfoldr: OK
  11473. 1319.02 s [vector] +++ OK, passed 100 tests.
  11474. 1319.02 s [vector] unfoldrN: OK
  11475. 1319.02 s [vector] +++ OK, passed 100 tests.
  11476. 1319.02 s [vector] unfoldrExactN: OK
  11477. 1319.02 s [vector] +++ OK, passed 100 tests.
  11478. 1319.02 s [vector] unfoldrM: OK
  11479. 1319.02 s [vector] +++ OK, passed 100 tests.
  11480. 1319.04 s [vector] unfoldrNM: OK
  11481. 1319.04 s [vector] +++ OK, passed 100 tests.
  11482. 1319.05 s [vector] unfoldrExactNM: OK (0.02s)
  11483. 1319.06 s [vector] +++ OK, passed 100 tests.
  11484. 1319.06 s [vector] constructN: OK
  11485. 1319.06 s [vector] +++ OK, passed 100 tests.
  11486. 1319.06 s [vector] constructrN: OK
  11487. 1319.07 s [vector] +++ OK, passed 100 tests.
  11488. 1319.07 s [vector] cons: OK
  11489. 1319.07 s [vector] +++ OK, passed 100 tests.
  11490. 1319.07 s [vector] snoc: OK
  11491. 1319.07 s [vector] +++ OK, passed 100 tests.
  11492. 1319.07 s [vector] append: OK
  11493. 1319.07 s [vector] +++ OK, passed 100 tests.
  11494. 1319.08 s [vector] concat: OK (0.01s)
  11495. 1319.08 s [vector] +++ OK, passed 100 tests.
  11496. 1319.08 s [vector] force: OK
  11497. 1319.08 s [vector] +++ OK, passed 100 tests.
  11498. 1319.09 s [vector] upd: OK
  11499. 1319.09 s [vector] +++ OK, passed 100 tests.
  11500. 1319.10 s [vector] accum: OK
  11501. 1319.10 s [vector] +++ OK, passed 100 tests.
  11502. 1319.10 s [vector] reverse: OK
  11503. 1319.10 s [vector] +++ OK, passed 100 tests.
  11504. 1319.10 s [vector] backpermute: OK
  11505. 1319.10 s [vector] +++ OK, passed 100 tests.
  11506. 1319.10 s [vector] map: OK
  11507. 1319.10 s [vector] +++ OK, passed 100 tests.
  11508. 1319.10 s [vector] imap: OK
  11509. 1319.10 s [vector] +++ OK, passed 100 tests.
  11510. 1319.10 s [vector] concatMap: OK
  11511. 1319.10 s [vector] +++ OK, passed 100 tests.
  11512. 1319.11 s [vector] mapM: OK
  11513. 1319.12 s [vector] +++ OK, passed 100 tests.
  11514. 1319.12 s [vector] mapM_: OK (0.01s)
  11515. 1319.12 s [vector] +++ OK, passed 100 tests.
  11516. 1319.12 s [vector] forM: OK
  11517. 1319.12 s [vector] +++ OK, passed 100 tests.
  11518. 1319.14 s [vector] forM_: OK (0.01s)
  11519. 1319.14 s [vector] +++ OK, passed 100 tests.
  11520. 1319.14 s [vector] imapM: OK
  11521. 1319.14 s [vector] +++ OK, passed 100 tests.
  11522. 1319.15 s [vector] imapM_: OK (0.01s)
  11523. 1319.15 s [vector] +++ OK, passed 100 tests.
  11524. 1319.15 s [vector] zipWith: OK
  11525. 1319.15 s [vector] +++ OK, passed 100 tests.
  11526. 1319.15 s [vector] zipWith3: OK
  11527. 1319.15 s [vector] +++ OK, passed 100 tests.
  11528. 1319.16 s [vector] izipWith: OK
  11529. 1319.16 s [vector] +++ OK, passed 100 tests.
  11530. 1319.16 s [vector] izipWith3: OK
  11531. 1319.16 s [vector] +++ OK, passed 100 tests.
  11532. 1319.16 s [vector] izipWithM: OK
  11533. 1319.16 s [vector] +++ OK, passed 100 tests.
  11534. 1319.17 s [vector] izipWithM_: OK (0.01s)
  11535. 1319.17 s [vector] +++ OK, passed 100 tests.
  11536. 1319.18 s [vector] zipWithM: OK
  11537. 1319.18 s [vector] +++ OK, passed 100 tests.
  11538. 1319.18 s [vector] zipWithM_: OK (0.01s)
  11539. 1319.18 s [vector] +++ OK, passed 100 tests.
  11540. 1319.18 s [vector] filter: OK
  11541. 1319.18 s [vector] +++ OK, passed 100 tests.
  11542. 1319.18 s [vector] ifilter: OK
  11543. 1319.19 s [vector] +++ OK, passed 100 tests.
  11544. 1319.21 s [vector] filterM: OK (0.03s)
  11545. 1319.22 s [vector] +++ OK, passed 100 tests.
  11546. 1319.22 s [vector] uniq: OK
  11547. 1319.22 s [vector] +++ OK, passed 100 tests.
  11548. 1319.22 s [vector] mapMaybe: OK
  11549. 1319.22 s [vector] +++ OK, passed 100 tests.
  11550. 1319.22 s [vector] imapMaybe: OK
  11551. 1319.22 s [vector] +++ OK, passed 100 tests.
  11552. 1319.22 s [vector] takeWhile: OK
  11553. 1319.22 s [vector] +++ OK, passed 100 tests.
  11554. 1319.22 s [vector] dropWhile: OK
  11555. 1319.22 s [vector] +++ OK, passed 100 tests.
  11556. 1319.22 s [vector] partition: OK
  11557. 1319.22 s [vector] +++ OK, passed 100 tests.
  11558. 1319.23 s [vector] partitionWith: OK
  11559. 1319.23 s [vector] +++ OK, passed 100 tests.
  11560. 1319.23 s [vector] span: OK
  11561. 1319.23 s [vector] +++ OK, passed 100 tests.
  11562. 1319.23 s [vector] break: OK
  11563. 1319.23 s [vector] +++ OK, passed 100 tests.
  11564. 1319.23 s [vector] spanR: OK
  11565. 1319.23 s [vector] +++ OK, passed 100 tests.
  11566. 1319.23 s [vector] breakR: OK
  11567. 1319.23 s [vector] +++ OK, passed 100 tests.
  11568. 1319.23 s [vector] groupBy: OK
  11569. 1319.23 s [vector] +++ OK, passed 100 tests.
  11570. 1319.24 s [vector] elem: OK
  11571. 1319.24 s [vector] +++ OK, passed 100 tests.
  11572. 1319.24 s [vector] notElem: OK
  11573. 1319.24 s [vector] +++ OK, passed 100 tests.
  11574. 1319.24 s [vector] find: OK
  11575. 1319.24 s [vector] +++ OK, passed 100 tests.
  11576. 1319.25 s [vector] findIndex: OK
  11577. 1319.25 s [vector] +++ OK, passed 100 tests.
  11578. 1319.25 s [vector] findIndexR: OK
  11579. 1319.25 s [vector] +++ OK, passed 100 tests.
  11580. 1319.25 s [vector] findIndices: OK
  11581. 1319.25 s [vector] +++ OK, passed 100 tests.
  11582. 1319.25 s [vector] elemIndex: OK
  11583. 1319.25 s [vector] +++ OK, passed 100 tests.
  11584. 1319.25 s [vector] elemIndices: OK
  11585. 1319.25 s [vector] +++ OK, passed 100 tests.
  11586. 1319.25 s [vector] foldl: OK
  11587. 1319.25 s [vector] +++ OK, passed 100 tests.
  11588. 1319.25 s [vector] foldl1: OK
  11589. 1319.25 s [vector] +++ OK, passed 100 tests; 12 discarded.
  11590. 1319.25 s [vector] foldl': OK
  11591. 1319.25 s [vector] +++ OK, passed 100 tests.
  11592. 1319.25 s [vector] foldl1': OK
  11593. 1319.25 s [vector] +++ OK, passed 100 tests; 20 discarded.
  11594. 1319.25 s [vector] foldr: OK
  11595. 1319.26 s [vector] +++ OK, passed 100 tests.
  11596. 1319.26 s [vector] foldr1: OK
  11597. 1319.26 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11598. 1319.26 s [vector] foldr': OK
  11599. 1319.26 s [vector] +++ OK, passed 100 tests.
  11600. 1319.26 s [vector] foldr1': OK
  11601. 1319.26 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11602. 1319.26 s [vector] ifoldl: OK
  11603. 1319.26 s [vector] +++ OK, passed 100 tests.
  11604. 1319.26 s [vector] ifoldl': OK
  11605. 1319.26 s [vector] +++ OK, passed 100 tests.
  11606. 1319.26 s [vector] ifoldr: OK
  11607. 1319.26 s [vector] +++ OK, passed 100 tests.
  11608. 1319.26 s [vector] ifoldr': OK
  11609. 1319.26 s [vector] +++ OK, passed 100 tests.
  11610. 1319.27 s [vector] ifoldM: OK
  11611. 1319.27 s [vector] +++ OK, passed 100 tests.
  11612. 1319.28 s [vector] ifoldM': OK
  11613. 1319.28 s [vector] +++ OK, passed 100 tests.
  11614. 1319.30 s [vector] ifoldM_: OK (0.02s)
  11615. 1319.30 s [vector] +++ OK, passed 100 tests.
  11616. 1319.30 s [vector] ifoldM'_: OK (0.01s)
  11617. 1319.30 s [vector] +++ OK, passed 100 tests.
  11618. 1319.31 s [vector] all: OK
  11619. 1319.31 s [vector] +++ OK, passed 100 tests.
  11620. 1319.32 s [vector] any: OK
  11621. 1319.32 s [vector] +++ OK, passed 100 tests.
  11622. 1319.32 s [vector] prescanl: OK
  11623. 1319.32 s [vector] +++ OK, passed 100 tests.
  11624. 1319.32 s [vector] prescanl': OK
  11625. 1319.32 s [vector] +++ OK, passed 100 tests.
  11626. 1319.32 s [vector] postscanl: OK
  11627. 1319.33 s [vector] +++ OK, passed 100 tests.
  11628. 1319.33 s [vector] postscanl': OK
  11629. 1319.33 s [vector] +++ OK, passed 100 tests.
  11630. 1319.33 s [vector] scanl: OK
  11631. 1319.33 s [vector] +++ OK, passed 100 tests.
  11632. 1319.33 s [vector] scanl': OK
  11633. 1319.33 s [vector] +++ OK, passed 100 tests.
  11634. 1319.33 s [vector] scanl1: OK
  11635. 1319.33 s [vector] +++ OK, passed 100 tests.
  11636. 1319.33 s [vector] scanl1': OK
  11637. 1319.33 s [vector] +++ OK, passed 100 tests.
  11638. 1319.33 s [vector] iscanl: OK
  11639. 1319.33 s [vector] +++ OK, passed 100 tests.
  11640. 1319.34 s [vector] iscanl': OK
  11641. 1319.34 s [vector] +++ OK, passed 100 tests.
  11642. 1319.34 s [vector] prescanr: OK
  11643. 1319.34 s [vector] +++ OK, passed 100 tests.
  11644. 1319.34 s [vector] prescanr': OK
  11645. 1319.35 s [vector] +++ OK, passed 100 tests.
  11646. 1319.35 s [vector] postscanr: OK
  11647. 1319.36 s [vector] +++ OK, passed 100 tests.
  11648. 1319.36 s [vector] postscanr': OK
  11649. 1319.36 s [vector] +++ OK, passed 100 tests.
  11650. 1319.36 s [vector] scanr: OK
  11651. 1319.36 s [vector] +++ OK, passed 100 tests.
  11652. 1319.36 s [vector] scanr': OK
  11653. 1319.36 s [vector] +++ OK, passed 100 tests.
  11654. 1319.36 s [vector] scanr1: OK
  11655. 1319.36 s [vector] +++ OK, passed 100 tests.
  11656. 1319.36 s [vector] scanr1': OK
  11657. 1319.36 s [vector] +++ OK, passed 100 tests.
  11658. 1319.36 s [vector] iscanr: OK
  11659. 1319.36 s [vector] +++ OK, passed 100 tests.
  11660. 1319.36 s [vector] iscanr': OK
  11661. 1319.36 s [vector] +++ OK, passed 100 tests.
  11662. 1319.36 s [vector] mut_read: OK
  11663. 1319.36 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11664. 1319.36 s [vector] mut_write: OK
  11665. 1319.36 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11666. 1319.36 s [vector] mut_modify: OK
  11667. 1319.36 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11668. 1319.36 s [vector] mut_generate: OK
  11669. 1319.36 s [vector] +++ OK, passed 100 tests.
  11670. 1319.38 s [vector] mut_generateM: OK
  11671. 1319.38 s [vector] +++ OK, passed 100 tests.
  11672. 1319.40 s [vector] mut_mapM_: OK (0.01s)
  11673. 1319.40 s [vector] +++ OK, passed 100 tests.
  11674. 1319.40 s [vector] mut_imapM_: OK (0.01s)
  11675. 1319.40 s [vector] +++ OK, passed 100 tests.
  11676. 1319.42 s [vector] mut_forM_: OK (0.01s)
  11677. 1319.42 s [vector] +++ OK, passed 100 tests.
  11678. 1319.43 s [vector] mut_iforM_: OK (0.01s)
  11679. 1319.43 s [vector] +++ OK, passed 100 tests.
  11680. 1319.43 s [vector] mut_foldr: OK
  11681. 1319.43 s [vector] +++ OK, passed 100 tests.
  11682. 1319.43 s [vector] mut_foldr': OK
  11683. 1319.43 s [vector] +++ OK, passed 100 tests.
  11684. 1319.44 s [vector] mut_foldl: OK
  11685. 1319.44 s [vector] +++ OK, passed 100 tests.
  11686. 1319.44 s [vector] mut_foldl': OK
  11687. 1319.44 s [vector] +++ OK, passed 100 tests.
  11688. 1319.44 s [vector] mut_ifoldr: OK
  11689. 1319.44 s [vector] +++ OK, passed 100 tests.
  11690. 1319.45 s [vector] mut_ifoldr': OK
  11691. 1319.45 s [vector] +++ OK, passed 100 tests.
  11692. 1319.45 s [vector] mut_ifoldl: OK
  11693. 1319.46 s [vector] +++ OK, passed 100 tests.
  11694. 1319.46 s [vector] mut_ifoldl': OK
  11695. 1319.46 s [vector] +++ OK, passed 100 tests.
  11696. 1319.46 s [vector] mut_foldM: OK
  11697. 1319.47 s [vector] +++ OK, passed 100 tests.
  11698. 1319.47 s [vector] mut_foldM': OK
  11699. 1319.47 s [vector] +++ OK, passed 100 tests.
  11700. 1319.47 s [vector] mut_foldrM: OK
  11701. 1319.47 s [vector] +++ OK, passed 100 tests.
  11702. 1319.47 s [vector] mut_foldrM': OK
  11703. 1319.47 s [vector] +++ OK, passed 100 tests.
  11704. 1319.47 s [vector] mut_ifoldM: OK
  11705. 1319.47 s [vector] +++ OK, passed 100 tests.
  11706. 1319.47 s [vector] mut_ifoldM': OK
  11707. 1319.47 s [vector] +++ OK, passed 100 tests.
  11708. 1319.47 s [vector] mut_ifoldrM: OK
  11709. 1319.47 s [vector] +++ OK, passed 100 tests.
  11710. 1319.47 s [vector] mut_ifoldrM': OK
  11711. 1319.47 s [vector] +++ OK, passed 100 tests.
  11712. 1319.47 s [vector] compare: OK
  11713. 1319.47 s [vector] +++ OK, passed 100 tests.
  11714. 1319.48 s [vector] maximum: OK
  11715. 1319.48 s [vector] +++ OK, passed 100 tests; 12 discarded.
  11716. 1319.48 s [vector] minimum: OK
  11717. 1319.48 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11718. 1319.49 s [vector] minIndex: OK
  11719. 1319.49 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11720. 1319.49 s [vector] maxIndex: OK
  11721. 1319.49 s [vector] +++ OK, passed 100 tests; 12 discarded.
  11722. 1319.49 s [vector] maximumBy: OK
  11723. 1319.49 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11724. 1319.50 s [vector] minimumBy: OK
  11725. 1319.50 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11726. 1319.50 s [vector] maximumOn: OK
  11727. 1319.50 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11728. 1319.50 s [vector] minimumOn: OK
  11729. 1319.50 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11730. 1319.50 s [vector] maxIndexBy: OK
  11731. 1319.51 s [vector] +++ OK, passed 100 tests; 21 discarded.
  11732. 1319.51 s [vector] minIndexBy: OK
  11733. 1319.51 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11734. 1319.51 s [vector] ListFirstMaxIndexWins: OK
  11735. 1319.51 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11736. 1319.51 s [vector] FalseListFirstMaxIndexWins: OK
  11737. 1319.51 s [vector] +++ OK, failed as expected. (after 1 test):
  11738. 1319.51 s [vector] Exception:
  11739. 1319.51 s [vector] Prelude.foldr1: empty list
  11740. 1319.51 s [vector] CallStack (from HasCallStack):
  11741. 1319.51 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  11742. 1319.51 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  11743. 1319.51 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  11744. 1319.51 s [vector] []
  11745. 1319.51 s [vector] mempty: OK
  11746. 1319.51 s [vector] +++ OK, passed 100 tests.
  11747. 1319.51 s [vector] mappend: OK
  11748. 1319.53 s [vector] +++ OK, passed 100 tests.
  11749. 1319.54 s [vector] mconcat: OK (0.03s)
  11750. 1319.54 s [vector] +++ OK, passed 100 tests.
  11751. 1319.55 s [vector] glength: OK
  11752. 1319.55 s [vector] +++ OK, passed 100 tests.
  11753. 1319.55 s [vector] sum: OK
  11754. 1319.55 s [vector] +++ OK, passed 100 tests.
  11755. 1319.55 s [vector] product: OK
  11756. 1319.55 s [vector] +++ OK, passed 100 tests.
  11757. 1319.55 s [vector] enumFromN: OK
  11758. 1319.55 s [vector] +++ OK, passed 100 tests.
  11759. 1319.55 s [vector] enumFromThenN: OK
  11760. 1319.55 s [vector] +++ OK, passed 100 tests.
  11761. 1319.55 s [vector] enumFromTo: OK
  11762. 1319.55 s [vector] +++ OK, passed 100 tests.
  11763. 1319.55 s [vector] enumFromThenTo: OK
  11764. 1319.55 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11765. 1319.55 s [vector] Double
  11766. 1319.55 s [vector] fromList.toList == id: OK
  11767. 1319.55 s [vector] +++ OK, passed 100 tests.
  11768. 1319.55 s [vector] toList.fromList == id: OK
  11769. 1319.56 s [vector] +++ OK, passed 100 tests.
  11770. 1319.56 s [vector] unstream.stream == id: OK
  11771. 1319.56 s [vector] +++ OK, passed 100 tests.
  11772. 1319.56 s [vector] stream.unstream == id: OK
  11773. 1319.56 s [vector] +++ OK, passed 100 tests.
  11774. 1319.56 s [vector] eq: OK
  11775. 1319.56 s [vector] +++ OK, passed 100 tests.
  11776. 1319.56 s [vector] length: OK
  11777. 1319.56 s [vector] +++ OK, passed 100 tests.
  11778. 1319.56 s [vector] null: OK
  11779. 1319.56 s [vector] +++ OK, passed 100 tests.
  11780. 1319.56 s [vector] index: OK
  11781. 1319.56 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11782. 1319.56 s [vector] safeIndex: OK
  11783. 1319.56 s [vector] +++ OK, passed 100 tests.
  11784. 1319.56 s [vector] head: OK
  11785. 1319.56 s [vector] +++ OK, passed 100 tests; 11 discarded.
  11786. 1319.56 s [vector] last: OK
  11787. 1319.57 s [vector] +++ OK, passed 100 tests; 21 discarded.
  11788. 1319.57 s [vector] unsafeIndex: OK
  11789. 1319.57 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11790. 1319.57 s [vector] unsafeHead: OK
  11791. 1319.57 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11792. 1319.57 s [vector] unsafeLast: OK
  11793. 1319.57 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11794. 1319.57 s [vector] slice: OK
  11795. 1319.57 s [vector] +++ OK, passed 100 tests.
  11796. 1319.57 s [vector] init: OK
  11797. 1319.57 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11798. 1319.57 s [vector] tail: OK
  11799. 1319.57 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11800. 1319.57 s [vector] take: OK
  11801. 1319.57 s [vector] +++ OK, passed 100 tests.
  11802. 1319.57 s [vector] drop: OK
  11803. 1319.57 s [vector] +++ OK, passed 100 tests.
  11804. 1319.57 s [vector] splitAt: OK
  11805. 1319.57 s [vector] +++ OK, passed 100 tests.
  11806. 1319.57 s [vector] empty: OK
  11807. 1319.57 s [vector] +++ OK, passed 100 tests.
  11808. 1319.57 s [vector] singleton: OK
  11809. 1319.57 s [vector] +++ OK, passed 100 tests.
  11810. 1319.57 s [vector] replicate: OK
  11811. 1319.57 s [vector] +++ OK, passed 100 tests.
  11812. 1319.57 s [vector] generate: OK
  11813. 1319.57 s [vector] +++ OK, passed 100 tests.
  11814. 1319.57 s [vector] iterateN: OK
  11815. 1319.57 s [vector] +++ OK, passed 100 tests.
  11816. 1319.60 s [vector] iterateNM: OK (0.02s)
  11817. 1319.61 s [vector] +++ OK, passed 100 tests.
  11818. 1319.62 s [vector] generateM: OK (0.02s)
  11819. 1319.62 s [vector] +++ OK, passed 100 tests.
  11820. 1319.63 s [vector] replicateM: OK (0.02s)
  11821. 1319.63 s [vector] +++ OK, passed 100 tests.
  11822. 1319.63 s [vector] create: OK
  11823. 1319.63 s [vector] +++ OK, passed 100 tests.
  11824. 1319.63 s [vector] createT: OK
  11825. 1319.63 s [vector] +++ OK, passed 100 tests.
  11826. 1319.63 s [vector] unfoldr: OK
  11827. 1319.63 s [vector] +++ OK, passed 100 tests.
  11828. 1319.63 s [vector] unfoldrN: OK
  11829. 1319.63 s [vector] +++ OK, passed 100 tests.
  11830. 1319.63 s [vector] unfoldrExactN: OK
  11831. 1319.64 s [vector] +++ OK, passed 100 tests.
  11832. 1319.64 s [vector] unfoldrM: OK
  11833. 1319.64 s [vector] +++ OK, passed 100 tests.
  11834. 1319.64 s [vector] unfoldrNM: OK
  11835. 1319.64 s [vector] +++ OK, passed 100 tests.
  11836. 1319.68 s [vector] unfoldrExactNM: OK (0.03s)
  11837. 1319.68 s [vector] +++ OK, passed 100 tests.
  11838. 1319.70 s [vector] constructN: OK (0.01s)
  11839. 1319.70 s [vector] +++ OK, passed 100 tests.
  11840. 1319.70 s [vector] constructrN: OK (0.02s)
  11841. 1319.70 s [vector] +++ OK, passed 100 tests.
  11842. 1319.70 s [vector] cons: OK
  11843. 1319.70 s [vector] +++ OK, passed 100 tests.
  11844. 1319.70 s [vector] snoc: OK
  11845. 1319.70 s [vector] +++ OK, passed 100 tests.
  11846. 1319.70 s [vector] append: OK
  11847. 1319.70 s [vector] +++ OK, passed 100 tests.
  11848. 1319.73 s [vector] concat: OK (0.02s)
  11849. 1319.73 s [vector] +++ OK, passed 100 tests.
  11850. 1319.75 s [vector] force: OK
  11851. 1319.75 s [vector] +++ OK, passed 100 tests.
  11852. 1319.75 s [vector] upd: OK
  11853. 1319.76 s [vector] +++ OK, passed 100 tests.
  11854. 1319.77 s [vector] accum: OK (0.02s)
  11855. 1319.77 s [vector] +++ OK, passed 100 tests.
  11856. 1319.77 s [vector] reverse: OK
  11857. 1319.77 s [vector] +++ OK, passed 100 tests.
  11858. 1319.77 s [vector] backpermute: OK
  11859. 1319.77 s [vector] +++ OK, passed 100 tests.
  11860. 1319.77 s [vector] map: OK
  11861. 1319.77 s [vector] +++ OK, passed 100 tests.
  11862. 1319.77 s [vector] imap: OK
  11863. 1319.77 s [vector] +++ OK, passed 100 tests.
  11864. 1319.77 s [vector] concatMap: OK
  11865. 1319.77 s [vector] +++ OK, passed 100 tests.
  11866. 1319.78 s [vector] mapM: OK
  11867. 1319.78 s [vector] +++ OK, passed 100 tests.
  11868. 1319.82 s [vector] mapM_: OK (0.03s)
  11869. 1319.82 s [vector] +++ OK, passed 100 tests.
  11870. 1319.85 s [vector] forM: OK
  11871. 1319.85 s [vector] +++ OK, passed 100 tests.
  11872. 1319.88 s [vector] forM_: OK (0.05s)
  11873. 1319.88 s [vector] +++ OK, passed 100 tests.
  11874. 1319.90 s [vector] imapM: OK (0.02s)
  11875. 1319.90 s [vector] +++ OK, passed 100 tests.
  11876. 1319.92 s [vector] imapM_: OK (0.03s)
  11877. 1319.92 s [vector] +++ OK, passed 100 tests.
  11878. 1319.94 s [vector] zipWith: OK
  11879. 1319.94 s [vector] +++ OK, passed 100 tests.
  11880. 1319.96 s [vector] zipWith3: OK (0.01s)
  11881. 1319.96 s [vector] +++ OK, passed 100 tests.
  11882. 1319.96 s [vector] izipWith: OK (0.01s)
  11883. 1319.96 s [vector] +++ OK, passed 100 tests.
  11884. 1319.98 s [vector] izipWith3: OK (0.01s)
  11885. 1319.98 s [vector] +++ OK, passed 100 tests.
  11886. 1319.99 s [vector] izipWithM: OK (0.01s)
  11887. 1319.99 s [vector] +++ OK, passed 100 tests.
  11888. 1320.02 s [vector] izipWithM_: OK (0.04s)
  11889. 1320.02 s [vector] +++ OK, passed 100 tests.
  11890. 1320.04 s [vector] zipWithM: OK
  11891. 1320.04 s [vector] +++ OK, passed 100 tests.
  11892. 1320.06 s [vector] zipWithM_: OK (0.03s)
  11893. 1320.06 s [vector] +++ OK, passed 100 tests.
  11894. 1320.07 s [vector] filter: OK
  11895. 1320.08 s [vector] +++ OK, passed 100 tests.
  11896. 1320.08 s [vector] ifilter: OK
  11897. 1320.08 s [vector] +++ OK, passed 100 tests.
  11898. 1320.12 s [vector] filterM: OK (0.04s)
  11899. 1320.12 s [vector] +++ OK, passed 100 tests.
  11900. 1320.13 s [vector] uniq: OK
  11901. 1320.13 s [vector] +++ OK, passed 100 tests.
  11902. 1320.14 s [vector] mapMaybe: OK (0.01s)
  11903. 1320.14 s [vector] +++ OK, passed 100 tests.
  11904. 1320.15 s [vector] imapMaybe: OK
  11905. 1320.15 s [vector] +++ OK, passed 100 tests.
  11906. 1320.15 s [vector] takeWhile: OK
  11907. 1320.15 s [vector] +++ OK, passed 100 tests.
  11908. 1320.15 s [vector] dropWhile: OK
  11909. 1320.15 s [vector] +++ OK, passed 100 tests.
  11910. 1320.15 s [vector] partition: OK
  11911. 1320.15 s [vector] +++ OK, passed 100 tests.
  11912. 1320.16 s [vector] partitionWith: OK
  11913. 1320.16 s [vector] +++ OK, passed 100 tests.
  11914. 1320.16 s [vector] span: OK
  11915. 1320.16 s [vector] +++ OK, passed 100 tests.
  11916. 1320.16 s [vector] break: OK
  11917. 1320.16 s [vector] +++ OK, passed 100 tests.
  11918. 1320.18 s [vector] spanR: OK
  11919. 1320.18 s [vector] +++ OK, passed 100 tests.
  11920. 1320.18 s [vector] breakR: OK
  11921. 1320.18 s [vector] +++ OK, passed 100 tests.
  11922. 1320.18 s [vector] groupBy: OK
  11923. 1320.18 s [vector] +++ OK, passed 100 tests.
  11924. 1320.19 s [vector] elem: OK
  11925. 1320.19 s [vector] +++ OK, passed 100 tests.
  11926. 1320.19 s [vector] notElem: OK
  11927. 1320.20 s [vector] +++ OK, passed 100 tests.
  11928. 1320.20 s [vector] find: OK
  11929. 1320.20 s [vector] +++ OK, passed 100 tests.
  11930. 1320.20 s [vector] findIndex: OK
  11931. 1320.20 s [vector] +++ OK, passed 100 tests.
  11932. 1320.20 s [vector] findIndexR: OK
  11933. 1320.20 s [vector] +++ OK, passed 100 tests.
  11934. 1320.20 s [vector] findIndices: OK
  11935. 1320.20 s [vector] +++ OK, passed 100 tests.
  11936. 1320.20 s [vector] elemIndex: OK
  11937. 1320.20 s [vector] +++ OK, passed 100 tests.
  11938. 1320.20 s [vector] elemIndices: OK
  11939. 1320.22 s [vector] +++ OK, passed 100 tests.
  11940. 1320.22 s [vector] foldl: OK (0.01s)
  11941. 1320.22 s [vector] +++ OK, passed 100 tests.
  11942. 1320.22 s [vector] foldl1: OK (0.02s)
  11943. 1320.22 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11944. 1320.24 s [vector] foldl': OK (0.02s)
  11945. 1320.24 s [vector] +++ OK, passed 100 tests.
  11946. 1320.27 s [vector] foldl1': OK (0.02s)
  11947. 1320.27 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11948. 1320.28 s [vector] foldr: OK (0.02s)
  11949. 1320.28 s [vector] +++ OK, passed 100 tests.
  11950. 1320.30 s [vector] foldr1: OK (0.01s)
  11951. 1320.30 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11952. 1320.32 s [vector] foldr': OK (0.01s)
  11953. 1320.32 s [vector] +++ OK, passed 100 tests.
  11954. 1320.33 s [vector] foldr1': OK (0.01s)
  11955. 1320.33 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11956. 1320.34 s [vector] ifoldl: OK (0.01s)
  11957. 1320.34 s [vector] +++ OK, passed 100 tests.
  11958. 1320.36 s [vector] ifoldl': OK (0.01s)
  11959. 1320.36 s [vector] +++ OK, passed 100 tests.
  11960. 1320.38 s [vector] ifoldr: OK (0.02s)
  11961. 1320.38 s [vector] +++ OK, passed 100 tests.
  11962. 1320.38 s [vector] ifoldr': OK (0.02s)
  11963. 1320.38 s [vector] +++ OK, passed 100 tests.
  11964. 1320.40 s [vector] ifoldM: OK (0.01s)
  11965. 1320.41 s [vector] +++ OK, passed 100 tests.
  11966. 1320.42 s [vector] ifoldM': OK (0.01s)
  11967. 1320.42 s [vector] +++ OK, passed 100 tests.
  11968. 1320.72 s [vector] ifoldM_: OK (0.04s)
  11969. 1320.72 s [vector] +++ OK, passed 100 tests.
  11970. 1320.72 s [vector] ifoldM'_: OK (0.04s)
  11971. 1320.72 s [vector] +++ OK, passed 100 tests.
  11972. 1320.72 s [vector] all: OK
  11973. 1320.72 s [vector] +++ OK, passed 100 tests.
  11974. 1320.72 s [vector] any: OK
  11975. 1320.72 s [vector] +++ OK, passed 100 tests.
  11976. 1320.72 s [vector] prescanl: OK (0.01s)
  11977. 1320.72 s [vector] +++ OK, passed 100 tests.
  11978. 1320.72 s [vector] prescanl': OK (0.01s)
  11979. 1320.72 s [vector] +++ OK, passed 100 tests.
  11980. 1320.72 s [vector] postscanl: OK (0.01s)
  11981. 1320.72 s [vector] +++ OK, passed 100 tests.
  11982. 1320.72 s [vector] postscanl': OK (0.01s)
  11983. 1320.72 s [vector] +++ OK, passed 100 tests.
  11984. 1320.72 s [vector] scanl: OK (0.01s)
  11985. 1320.72 s [vector] +++ OK, passed 100 tests.
  11986. 1320.72 s [vector] scanl': OK (0.01s)
  11987. 1320.72 s [vector] +++ OK, passed 100 tests.
  11988. 1320.72 s [vector] scanl1: OK (0.01s)
  11989. 1320.72 s [vector] +++ OK, passed 100 tests.
  11990. 1320.72 s [vector] scanl1': OK (0.02s)
  11991. 1320.72 s [vector] +++ OK, passed 100 tests.
  11992. 1320.72 s [vector] iscanl: OK (0.01s)
  11993. 1320.72 s [vector] +++ OK, passed 100 tests.
  11994. 1320.72 s [vector] iscanl': OK (0.02s)
  11995. 1320.72 s [vector] +++ OK, passed 100 tests.
  11996. 1320.72 s [vector] prescanr: OK (0.02s)
  11997. 1320.72 s [vector] +++ OK, passed 100 tests.
  11998. 1320.72 s [vector] prescanr': OK (0.02s)
  11999. 1320.72 s [vector] +++ OK, passed 100 tests.
  12000. 1320.72 s [vector] postscanr: OK (0.02s)
  12001. 1320.72 s [vector] +++ OK, passed 100 tests.
  12002. 1320.72 s [vector] postscanr': OK (0.01s)
  12003. 1320.72 s [vector] +++ OK, passed 100 tests.
  12004. 1320.72 s [vector] scanr: OK (0.01s)
  12005. 1320.72 s [vector] +++ OK, passed 100 tests.
  12006. 1320.72 s [vector] scanr': OK (0.01s)
  12007. 1320.72 s [vector] +++ OK, passed 100 tests.
  12008. 1320.74 s [vector] scanr1: OK (0.01s)
  12009. 1320.74 s [vector] +++ OK, passed 100 tests.
  12010. 1320.74 s [vector] scanr1': OK (0.01s)
  12011. 1320.75 s [vector] +++ OK, passed 100 tests.
  12012. 1320.76 s [vector] iscanr: OK (0.02s)
  12013. 1320.76 s [vector] +++ OK, passed 100 tests.
  12014. 1320.78 s [vector] iscanr': OK (0.02s)
  12015. 1320.78 s [vector] +++ OK, passed 100 tests.
  12016. 1320.78 s [vector] mut_read: OK
  12017. 1320.78 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12018. 1320.78 s [vector] mut_write: OK
  12019. 1320.78 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12020. 1320.78 s [vector] mut_modify: OK
  12021. 1320.78 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12022. 1320.78 s [vector] mut_generate: OK
  12023. 1320.78 s [vector] +++ OK, passed 100 tests.
  12024. 1320.80 s [vector] mut_generateM: OK (0.01s)
  12025. 1320.80 s [vector] +++ OK, passed 100 tests.
  12026. 1320.84 s [vector] mut_mapM_: OK (0.04s)
  12027. 1320.84 s [vector] +++ OK, passed 100 tests.
  12028. 1320.88 s [vector] mut_imapM_: OK (0.04s)
  12029. 1320.88 s [vector] +++ OK, passed 100 tests.
  12030. 1320.90 s [vector] mut_forM_: OK (0.03s)
  12031. 1320.90 s [vector] +++ OK, passed 100 tests.
  12032. 1320.94 s [vector] mut_iforM_: OK (0.04s)
  12033. 1320.94 s [vector] +++ OK, passed 100 tests.
  12034. 1320.96 s [vector] mut_foldr: OK
  12035. 1320.96 s [vector] +++ OK, passed 100 tests.
  12036. 1320.98 s [vector] mut_foldr': OK (0.01s)
  12037. 1320.98 s [vector] +++ OK, passed 100 tests.
  12038. 1320.99 s [vector] mut_foldl: OK (0.01s)
  12039. 1320.99 s [vector] +++ OK, passed 100 tests.
  12040. 1321.01 s [vector] mut_foldl': OK (0.01s)
  12041. 1321.01 s [vector] +++ OK, passed 100 tests.
  12042. 1321.02 s [vector] mut_ifoldr: OK (0.03s)
  12043. 1321.02 s [vector] +++ OK, passed 100 tests.
  12044. 1321.06 s [vector] mut_ifoldr': OK (0.03s)
  12045. 1321.06 s [vector] +++ OK, passed 100 tests.
  12046. 1321.08 s [vector] mut_ifoldl: OK (0.03s)
  12047. 1321.08 s [vector] +++ OK, passed 100 tests.
  12048. 1321.10 s [vector] mut_ifoldl': OK (0.02s)
  12049. 1321.10 s [vector] +++ OK, passed 100 tests.
  12050. 1321.14 s [vector] mut_foldM: OK (0.03s)
  12051. 1321.14 s [vector] +++ OK, passed 100 tests.
  12052. 1321.16 s [vector] mut_foldM': OK (0.03s)
  12053. 1321.16 s [vector] +++ OK, passed 100 tests.
  12054. 1321.18 s [vector] mut_foldrM: OK (0.02s)
  12055. 1321.18 s [vector] +++ OK, passed 100 tests.
  12056. 1321.22 s [vector] mut_foldrM': OK (0.02s)
  12057. 1321.22 s [vector] +++ OK, passed 100 tests.
  12058. 1321.24 s [vector] mut_ifoldM: OK (0.03s)
  12059. 1321.24 s [vector] +++ OK, passed 100 tests.
  12060. 1321.26 s [vector] mut_ifoldM': OK (0.03s)
  12061. 1321.26 s [vector] +++ OK, passed 100 tests.
  12062. 1321.28 s [vector] mut_ifoldrM: OK (0.02s)
  12063. 1321.28 s [vector] +++ OK, passed 100 tests.
  12064. 1321.30 s [vector] mut_ifoldrM': OK (0.03s)
  12065. 1321.30 s [vector] +++ OK, passed 100 tests.
  12066. 1321.31 s [vector] compare: OK
  12067. 1321.31 s [vector] +++ OK, passed 100 tests.
  12068. 1321.31 s [vector] maximum: OK
  12069. 1321.31 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12070. 1321.31 s [vector] minimum: OK
  12071. 1321.31 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12072. 1321.31 s [vector] minIndex: OK
  12073. 1321.31 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12074. 1321.31 s [vector] maxIndex: OK
  12075. 1321.31 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12076. 1321.32 s [vector] maximumBy: OK
  12077. 1321.32 s [vector] +++ OK, passed 100 tests; 20 discarded.
  12078. 1321.32 s [vector] minimumBy: OK
  12079. 1321.32 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12080. 1321.32 s [vector] maximumOn: OK
  12081. 1321.32 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12082. 1321.32 s [vector] minimumOn: OK
  12083. 1321.32 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12084. 1321.32 s [vector] maxIndexBy: OK
  12085. 1321.32 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12086. 1321.32 s [vector] minIndexBy: OK
  12087. 1321.32 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12088. 1321.32 s [vector] ListFirstMaxIndexWins: OK
  12089. 1321.32 s [vector] +++ OK, passed 100 tests; 12 discarded.
  12090. 1321.32 s [vector] FalseListFirstMaxIndexWins: OK
  12091. 1321.32 s [vector] +++ OK, failed as expected. (after 1 test):
  12092. 1321.33 s [vector] Exception:
  12093. 1321.33 s [vector] Prelude.foldr1: empty list
  12094. 1321.33 s [vector] CallStack (from HasCallStack):
  12095. 1321.33 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  12096. 1321.33 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  12097. 1321.33 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  12098. 1321.33 s [vector] []
  12099. 1321.33 s [vector] mempty: OK
  12100. 1321.33 s [vector] +++ OK, passed 100 tests.
  12101. 1321.34 s [vector] mappend: OK
  12102. 1321.34 s [vector] +++ OK, passed 100 tests.
  12103. 1321.37 s [vector] mconcat: OK (0.04s)
  12104. 1321.37 s [vector] +++ OK, passed 100 tests.
  12105. 1321.37 s [vector] glength: OK
  12106. 1321.37 s [vector] +++ OK, passed 100 tests.
  12107. 1321.38 s [vector] sum: OK
  12108. 1321.38 s [vector] +++ OK, passed 100 tests.
  12109. 1321.38 s [vector] product: OK
  12110. 1321.38 s [vector] +++ OK, passed 100 tests.
  12111. 1321.38 s [vector] enumFromN: OK
  12112. 1321.38 s [vector] +++ OK, passed 100 tests.
  12113. 1321.38 s [vector] enumFromThenN: OK
  12114. 1321.38 s [vector] +++ OK, passed 100 tests.
  12115. 1321.38 s [vector] enumFromTo: OK
  12116. 1321.38 s [vector] +++ OK, passed 100 tests.
  12117. 1321.38 s [vector] enumFromThenTo: OK
  12118. 1321.38 s [vector] +++ OK, passed 100 tests; 1 discarded.
  12119. 1321.38 s [vector] unstream
  12120. 1321.38 s [vector] unstream == vunstream (exact): OK
  12121. 1321.38 s [vector] +++ OK, passed 100 tests.
  12122. 1321.38 s [vector] unstream == vunstream (unknown): OK
  12123. 1321.38 s [vector] +++ OK, passed 100 tests.
  12124. 1321.38 s [vector] unstreamR ~= vunstream (exact): OK
  12125. 1321.38 s [vector] +++ OK, passed 100 tests.
  12126. 1321.38 s [vector] unstreamR ~= vunstream (unknown): OK
  12127. 1321.38 s [vector] +++ OK, passed 100 tests.
  12128. 1321.39 s [vector] Tests.Vector.Storable
  12129. 1321.39 s [vector] Data.Vector.Storable.Vector (Int)
  12130. 1321.39 s [vector] fromList.toList == id: OK
  12131. 1321.39 s [vector] +++ OK, passed 100 tests.
  12132. 1321.39 s [vector] toList.fromList == id: OK
  12133. 1321.39 s [vector] +++ OK, passed 100 tests.
  12134. 1321.39 s [vector] unstream.stream == id: OK
  12135. 1321.39 s [vector] +++ OK, passed 100 tests.
  12136. 1321.39 s [vector] stream.unstream == id: OK
  12137. 1321.39 s [vector] +++ OK, passed 100 tests.
  12138. 1321.39 s [vector] eq: OK
  12139. 1321.39 s [vector] +++ OK, passed 100 tests.
  12140. 1321.39 s [vector] length: OK
  12141. 1321.39 s [vector] +++ OK, passed 100 tests.
  12142. 1321.39 s [vector] null: OK
  12143. 1321.39 s [vector] +++ OK, passed 100 tests.
  12144. 1321.39 s [vector] index: OK
  12145. 1321.39 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12146. 1321.39 s [vector] safeIndex: OK
  12147. 1321.39 s [vector] +++ OK, passed 100 tests.
  12148. 1321.39 s [vector] head: OK
  12149. 1321.39 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12150. 1321.39 s [vector] last: OK
  12151. 1321.39 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12152. 1321.39 s [vector] unsafeIndex: OK
  12153. 1321.39 s [vector] +++ OK, passed 100 tests; 21 discarded.
  12154. 1321.39 s [vector] unsafeHead: OK
  12155. 1321.39 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12156. 1321.39 s [vector] unsafeLast: OK
  12157. 1321.39 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12158. 1321.39 s [vector] slice: OK
  12159. 1321.39 s [vector] +++ OK, passed 100 tests.
  12160. 1321.39 s [vector] init: OK
  12161. 1321.39 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12162. 1321.39 s [vector] tail: OK
  12163. 1321.39 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12164. 1321.40 s [vector] take: OK
  12165. 1321.40 s [vector] +++ OK, passed 100 tests.
  12166. 1321.40 s [vector] drop: OK
  12167. 1321.40 s [vector] +++ OK, passed 100 tests.
  12168. 1321.40 s [vector] splitAt: OK
  12169. 1321.40 s [vector] +++ OK, passed 100 tests.
  12170. 1321.40 s [vector] empty: OK
  12171. 1321.40 s [vector] +++ OK, passed 100 tests.
  12172. 1321.40 s [vector] singleton: OK
  12173. 1321.40 s [vector] +++ OK, passed 100 tests.
  12174. 1321.40 s [vector] replicate: OK
  12175. 1321.40 s [vector] +++ OK, passed 100 tests.
  12176. 1321.40 s [vector] generate: OK
  12177. 1321.40 s [vector] +++ OK, passed 100 tests.
  12178. 1321.40 s [vector] iterateN: OK
  12179. 1321.40 s [vector] +++ OK, passed 100 tests.
  12180. 1321.44 s [vector] iterateNM: OK (0.03s)
  12181. 1321.44 s [vector] +++ OK, passed 100 tests.
  12182. 1321.44 s [vector] generateM: OK (0.01s)
  12183. 1321.44 s [vector] +++ OK, passed 100 tests.
  12184. 1321.45 s [vector] replicateM: OK (0.01s)
  12185. 1321.45 s [vector] +++ OK, passed 100 tests.
  12186. 1321.45 s [vector] create: OK
  12187. 1321.45 s [vector] +++ OK, passed 100 tests.
  12188. 1321.45 s [vector] createT: OK
  12189. 1321.45 s [vector] +++ OK, passed 100 tests.
  12190. 1321.45 s [vector] unfoldr: OK
  12191. 1321.45 s [vector] +++ OK, passed 100 tests.
  12192. 1321.45 s [vector] unfoldrN: OK
  12193. 1321.45 s [vector] +++ OK, passed 100 tests.
  12194. 1321.46 s [vector] unfoldrExactN: OK
  12195. 1321.46 s [vector] +++ OK, passed 100 tests.
  12196. 1321.46 s [vector] unfoldrM: OK
  12197. 1321.46 s [vector] +++ OK, passed 100 tests.
  12198. 1321.46 s [vector] unfoldrNM: OK
  12199. 1321.46 s [vector] +++ OK, passed 100 tests.
  12200. 1321.47 s [vector] unfoldrExactNM: OK
  12201. 1321.47 s [vector] +++ OK, passed 100 tests.
  12202. 1321.48 s [vector] constructN: OK
  12203. 1321.48 s [vector] +++ OK, passed 100 tests.
  12204. 1321.48 s [vector] constructrN: OK
  12205. 1321.48 s [vector] +++ OK, passed 100 tests.
  12206. 1321.48 s [vector] cons: OK
  12207. 1321.49 s [vector] +++ OK, passed 100 tests.
  12208. 1321.50 s [vector] snoc: OK
  12209. 1321.50 s [vector] +++ OK, passed 100 tests.
  12210. 1321.50 s [vector] append: OK
  12211. 1321.50 s [vector] +++ OK, passed 100 tests.
  12212. 1321.50 s [vector] concat: OK (0.01s)
  12213. 1321.50 s [vector] +++ OK, passed 100 tests.
  12214. 1321.50 s [vector] force: OK
  12215. 1321.50 s [vector] +++ OK, passed 100 tests.
  12216. 1321.50 s [vector] upd: OK
  12217. 1321.50 s [vector] +++ OK, passed 100 tests.
  12218. 1321.51 s [vector] accum: OK
  12219. 1321.51 s [vector] +++ OK, passed 100 tests.
  12220. 1321.51 s [vector] reverse: OK
  12221. 1321.51 s [vector] +++ OK, passed 100 tests.
  12222. 1321.52 s [vector] backpermute: OK
  12223. 1321.52 s [vector] +++ OK, passed 100 tests.
  12224. 1321.52 s [vector] map: OK
  12225. 1321.52 s [vector] +++ OK, passed 100 tests.
  12226. 1321.53 s [vector] imap: OK
  12227. 1321.53 s [vector] +++ OK, passed 100 tests.
  12228. 1321.53 s [vector] concatMap: OK
  12229. 1321.53 s [vector] +++ OK, passed 100 tests.
  12230. 1321.53 s [vector] mapM: OK
  12231. 1321.53 s [vector] +++ OK, passed 100 tests.
  12232. 1321.54 s [vector] mapM_: OK (0.02s)
  12233. 1321.54 s [vector] +++ OK, passed 100 tests.
  12234. 1321.54 s [vector] forM: OK
  12235. 1321.54 s [vector] +++ OK, passed 100 tests.
  12236. 1321.56 s [vector] forM_: OK (0.02s)
  12237. 1321.56 s [vector] +++ OK, passed 100 tests.
  12238. 1321.56 s [vector] imapM: OK
  12239. 1321.56 s [vector] +++ OK, passed 100 tests.
  12240. 1321.58 s [vector] imapM_: OK (0.02s)
  12241. 1321.58 s [vector] +++ OK, passed 100 tests.
  12242. 1321.59 s [vector] zipWith: OK
  12243. 1321.59 s [vector] +++ OK, passed 100 tests.
  12244. 1321.59 s [vector] zipWith3: OK
  12245. 1321.59 s [vector] +++ OK, passed 100 tests.
  12246. 1321.59 s [vector] izipWith: OK
  12247. 1321.59 s [vector] +++ OK, passed 100 tests.
  12248. 1321.59 s [vector] izipWith3: OK
  12249. 1321.59 s [vector] +++ OK, passed 100 tests.
  12250. 1321.59 s [vector] izipWithM: OK
  12251. 1321.60 s [vector] +++ OK, passed 100 tests.
  12252. 1321.61 s [vector] izipWithM_: OK (0.01s)
  12253. 1321.61 s [vector] +++ OK, passed 100 tests.
  12254. 1321.61 s [vector] zipWithM: OK
  12255. 1321.61 s [vector] +++ OK, passed 100 tests.
  12256. 1321.62 s [vector] zipWithM_: OK
  12257. 1321.62 s [vector] +++ OK, passed 100 tests.
  12258. 1321.62 s [vector] filter: OK
  12259. 1321.63 s [vector] +++ OK, passed 100 tests.
  12260. 1321.64 s [vector] ifilter: OK
  12261. 1321.64 s [vector] +++ OK, passed 100 tests.
  12262. 1321.67 s [vector] filterM: OK (0.03s)
  12263. 1321.67 s [vector] +++ OK, passed 100 tests.
  12264. 1321.67 s [vector] uniq: OK
  12265. 1321.67 s [vector] +++ OK, passed 100 tests.
  12266. 1321.68 s [vector] mapMaybe: OK
  12267. 1321.68 s [vector] +++ OK, passed 100 tests.
  12268. 1321.68 s [vector] imapMaybe: OK
  12269. 1321.68 s [vector] +++ OK, passed 100 tests.
  12270. 1321.68 s [vector] takeWhile: OK
  12271. 1321.68 s [vector] +++ OK, passed 100 tests.
  12272. 1321.68 s [vector] dropWhile: OK
  12273. 1321.68 s [vector] +++ OK, passed 100 tests.
  12274. 1321.69 s [vector] partition: OK
  12275. 1321.69 s [vector] +++ OK, passed 100 tests.
  12276. 1321.69 s [vector] partitionWith: OK
  12277. 1321.69 s [vector] +++ OK, passed 100 tests.
  12278. 1321.70 s [vector] span: OK
  12279. 1321.70 s [vector] +++ OK, passed 100 tests.
  12280. 1321.70 s [vector] break: OK
  12281. 1321.71 s [vector] +++ OK, passed 100 tests.
  12282. 1321.71 s [vector] spanR: OK
  12283. 1321.71 s [vector] +++ OK, passed 100 tests.
  12284. 1321.71 s [vector] breakR: OK
  12285. 1321.71 s [vector] +++ OK, passed 100 tests.
  12286. 1321.71 s [vector] groupBy: OK
  12287. 1321.71 s [vector] +++ OK, passed 100 tests.
  12288. 1321.71 s [vector] elem: OK
  12289. 1321.71 s [vector] +++ OK, passed 100 tests.
  12290. 1321.71 s [vector] notElem: OK
  12291. 1321.71 s [vector] +++ OK, passed 100 tests.
  12292. 1321.72 s [vector] find: OK
  12293. 1321.72 s [vector] +++ OK, passed 100 tests.
  12294. 1321.72 s [vector] findIndex: OK
  12295. 1321.72 s [vector] +++ OK, passed 100 tests.
  12296. 1321.72 s [vector] findIndexR: OK
  12297. 1321.72 s [vector] +++ OK, passed 100 tests.
  12298. 1321.72 s [vector] findIndices: OK
  12299. 1321.72 s [vector] +++ OK, passed 100 tests.
  12300. 1321.72 s [vector] elemIndex: OK
  12301. 1321.72 s [vector] +++ OK, passed 100 tests.
  12302. 1321.72 s [vector] elemIndices: OK
  12303. 1321.72 s [vector] +++ OK, passed 100 tests.
  12304. 1321.72 s [vector] foldl: OK
  12305. 1321.72 s [vector] +++ OK, passed 100 tests.
  12306. 1321.73 s [vector] foldl1: OK
  12307. 1321.73 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12308. 1321.73 s [vector] foldl': OK
  12309. 1321.73 s [vector] +++ OK, passed 100 tests.
  12310. 1321.74 s [vector] foldl1': OK
  12311. 1321.74 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12312. 1321.74 s [vector] foldr: OK
  12313. 1321.74 s [vector] +++ OK, passed 100 tests.
  12314. 1321.74 s [vector] foldr1: OK
  12315. 1321.74 s [vector] +++ OK, passed 100 tests; 21 discarded.
  12316. 1321.74 s [vector] foldr': OK
  12317. 1321.74 s [vector] +++ OK, passed 100 tests.
  12318. 1321.74 s [vector] foldr1': OK
  12319. 1321.75 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12320. 1321.75 s [vector] ifoldl: OK
  12321. 1321.75 s [vector] +++ OK, passed 100 tests.
  12322. 1321.76 s [vector] ifoldl': OK
  12323. 1321.76 s [vector] +++ OK, passed 100 tests.
  12324. 1321.76 s [vector] ifoldr: OK
  12325. 1321.76 s [vector] +++ OK, passed 100 tests.
  12326. 1321.76 s [vector] ifoldr': OK
  12327. 1321.76 s [vector] +++ OK, passed 100 tests.
  12328. 1321.76 s [vector] ifoldM: OK
  12329. 1321.76 s [vector] +++ OK, passed 100 tests.
  12330. 1321.76 s [vector] ifoldM': OK
  12331. 1321.76 s [vector] +++ OK, passed 100 tests.
  12332. 1321.79 s [vector] ifoldM_: OK (0.02s)
  12333. 1321.79 s [vector] +++ OK, passed 100 tests.
  12334. 1321.79 s [vector] ifoldM'_: OK (0.02s)
  12335. 1321.79 s [vector] +++ OK, passed 100 tests.
  12336. 1321.79 s [vector] all: OK
  12337. 1321.79 s [vector] +++ OK, passed 100 tests.
  12338. 1321.79 s [vector] any: OK
  12339. 1321.80 s [vector] +++ OK, passed 100 tests.
  12340. 1321.80 s [vector] prescanl: OK
  12341. 1321.80 s [vector] +++ OK, passed 100 tests.
  12342. 1321.80 s [vector] prescanl': OK
  12343. 1321.80 s [vector] +++ OK, passed 100 tests.
  12344. 1321.80 s [vector] postscanl: OK
  12345. 1321.80 s [vector] +++ OK, passed 100 tests.
  12346. 1321.80 s [vector] postscanl': OK
  12347. 1321.80 s [vector] +++ OK, passed 100 tests.
  12348. 1321.81 s [vector] scanl: OK
  12349. 1321.81 s [vector] +++ OK, passed 100 tests.
  12350. 1321.81 s [vector] scanl': OK
  12351. 1321.81 s [vector] +++ OK, passed 100 tests.
  12352. 1321.82 s [vector] scanl1: OK
  12353. 1321.82 s [vector] +++ OK, passed 100 tests.
  12354. 1321.83 s [vector] scanl1': OK
  12355. 1321.83 s [vector] +++ OK, passed 100 tests.
  12356. 1321.83 s [vector] iscanl: OK
  12357. 1321.83 s [vector] +++ OK, passed 100 tests.
  12358. 1321.83 s [vector] iscanl': OK
  12359. 1321.83 s [vector] +++ OK, passed 100 tests.
  12360. 1321.83 s [vector] prescanr: OK
  12361. 1321.83 s [vector] +++ OK, passed 100 tests.
  12362. 1321.83 s [vector] prescanr': OK
  12363. 1321.83 s [vector] +++ OK, passed 100 tests.
  12364. 1321.83 s [vector] postscanr: OK
  12365. 1321.84 s [vector] +++ OK, passed 100 tests.
  12366. 1321.84 s [vector] postscanr': OK
  12367. 1321.84 s [vector] +++ OK, passed 100 tests.
  12368. 1321.84 s [vector] scanr: OK
  12369. 1321.84 s [vector] +++ OK, passed 100 tests.
  12370. 1321.85 s [vector] scanr': OK
  12371. 1321.85 s [vector] +++ OK, passed 100 tests.
  12372. 1321.85 s [vector] scanr1: OK
  12373. 1321.85 s [vector] +++ OK, passed 100 tests.
  12374. 1321.86 s [vector] scanr1': OK
  12375. 1321.86 s [vector] +++ OK, passed 100 tests.
  12376. 1321.86 s [vector] iscanr: OK
  12377. 1321.86 s [vector] +++ OK, passed 100 tests.
  12378. 1321.86 s [vector] iscanr': OK
  12379. 1321.86 s [vector] +++ OK, passed 100 tests.
  12380. 1321.86 s [vector] mut_read: OK
  12381. 1321.86 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12382. 1321.86 s [vector] mut_write: OK
  12383. 1321.87 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12384. 1321.87 s [vector] mut_modify: OK
  12385. 1321.87 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12386. 1321.87 s [vector] mut_generate: OK
  12387. 1321.88 s [vector] +++ OK, passed 100 tests.
  12388. 1321.88 s [vector] mut_generateM: OK (0.01s)
  12389. 1321.88 s [vector] +++ OK, passed 100 tests.
  12390. 1321.90 s [vector] mut_mapM_: OK (0.02s)
  12391. 1321.90 s [vector] +++ OK, passed 100 tests.
  12392. 1321.92 s [vector] mut_imapM_: OK (0.02s)
  12393. 1321.92 s [vector] +++ OK, passed 100 tests.
  12394. 1321.94 s [vector] mut_forM_: OK (0.01s)
  12395. 1321.94 s [vector] +++ OK, passed 100 tests.
  12396. 1321.95 s [vector] mut_iforM_: OK (0.02s)
  12397. 1321.95 s [vector] +++ OK, passed 100 tests.
  12398. 1321.95 s [vector] mut_foldr: OK
  12399. 1321.96 s [vector] +++ OK, passed 100 tests.
  12400. 1321.96 s [vector] mut_foldr': OK
  12401. 1321.96 s [vector] +++ OK, passed 100 tests.
  12402. 1321.96 s [vector] mut_foldl: OK
  12403. 1321.96 s [vector] +++ OK, passed 100 tests.
  12404. 1321.97 s [vector] mut_foldl': OK
  12405. 1321.97 s [vector] +++ OK, passed 100 tests.
  12406. 1321.97 s [vector] mut_ifoldr: OK
  12407. 1321.97 s [vector] +++ OK, passed 100 tests.
  12408. 1321.97 s [vector] mut_ifoldr': OK
  12409. 1321.98 s [vector] +++ OK, passed 100 tests.
  12410. 1321.98 s [vector] mut_ifoldl: OK
  12411. 1321.98 s [vector] +++ OK, passed 100 tests.
  12412. 1321.98 s [vector] mut_ifoldl': OK
  12413. 1321.98 s [vector] +++ OK, passed 100 tests.
  12414. 1321.98 s [vector] mut_foldM: OK
  12415. 1321.98 s [vector] +++ OK, passed 100 tests.
  12416. 1321.99 s [vector] mut_foldM': OK
  12417. 1321.99 s [vector] +++ OK, passed 100 tests.
  12418. 1321.99 s [vector] mut_foldrM: OK
  12419. 1321.99 s [vector] +++ OK, passed 100 tests.
  12420. 1321.99 s [vector] mut_foldrM': OK
  12421. 1321.99 s [vector] +++ OK, passed 100 tests.
  12422. 1321.99 s [vector] mut_ifoldM: OK
  12423. 1321.99 s [vector] +++ OK, passed 100 tests.
  12424. 1321.99 s [vector] mut_ifoldM': OK
  12425. 1322.00 s [vector] +++ OK, passed 100 tests.
  12426. 1322.00 s [vector] mut_ifoldrM: OK
  12427. 1322.00 s [vector] +++ OK, passed 100 tests.
  12428. 1322.00 s [vector] mut_ifoldrM': OK
  12429. 1322.00 s [vector] +++ OK, passed 100 tests.
  12430. 1322.01 s [vector] compare: OK
  12431. 1322.01 s [vector] +++ OK, passed 100 tests.
  12432. 1322.01 s [vector] maximum: OK
  12433. 1322.02 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12434. 1322.02 s [vector] minimum: OK
  12435. 1322.02 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12436. 1322.02 s [vector] minIndex: OK
  12437. 1322.02 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12438. 1322.02 s [vector] maxIndex: OK
  12439. 1322.03 s [vector] +++ OK, passed 100 tests; 20 discarded.
  12440. 1322.03 s [vector] maximumBy: OK
  12441. 1322.03 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12442. 1322.03 s [vector] minimumBy: OK
  12443. 1322.03 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12444. 1322.03 s [vector] maximumOn: OK
  12445. 1322.03 s [vector] +++ OK, passed 100 tests; 21 discarded.
  12446. 1322.03 s [vector] minimumOn: OK
  12447. 1322.03 s [vector] +++ OK, passed 100 tests; 21 discarded.
  12448. 1322.03 s [vector] maxIndexBy: OK
  12449. 1322.03 s [vector] +++ OK, passed 100 tests; 12 discarded.
  12450. 1322.03 s [vector] minIndexBy: OK
  12451. 1322.03 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12452. 1322.03 s [vector] ListFirstMaxIndexWins: OK
  12453. 1322.03 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12454. 1322.03 s [vector] FalseListFirstMaxIndexWins: OK
  12455. 1322.03 s [vector] +++ OK, failed as expected. (after 1 test):
  12456. 1322.03 s [vector] Exception:
  12457. 1322.03 s [vector] Prelude.foldr1: empty list
  12458. 1322.03 s [vector] CallStack (from HasCallStack):
  12459. 1322.03 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  12460. 1322.04 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  12461. 1322.04 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  12462. 1322.04 s [vector] []
  12463. 1322.04 s [vector] mempty: OK
  12464. 1322.04 s [vector] +++ OK, passed 100 tests.
  12465. 1322.04 s [vector] mappend: OK
  12466. 1322.04 s [vector] +++ OK, passed 100 tests.
  12467. 1322.05 s [vector] mconcat: OK (0.01s)
  12468. 1322.05 s [vector] +++ OK, passed 100 tests.
  12469. 1322.05 s [vector] glength: OK
  12470. 1322.05 s [vector] +++ OK, passed 100 tests.
  12471. 1322.05 s [vector] sum: OK
  12472. 1322.05 s [vector] +++ OK, passed 100 tests.
  12473. 1322.05 s [vector] product: OK
  12474. 1322.05 s [vector] +++ OK, passed 100 tests.
  12475. 1322.05 s [vector] enumFromN: OK
  12476. 1322.05 s [vector] +++ OK, passed 100 tests.
  12477. 1322.05 s [vector] enumFromThenN: OK
  12478. 1322.05 s [vector] +++ OK, passed 100 tests.
  12479. 1322.05 s [vector] enumFromTo: OK
  12480. 1322.05 s [vector] +++ OK, passed 100 tests.
  12481. 1322.05 s [vector] enumFromThenTo: OK
  12482. 1322.05 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12483. 1322.05 s [vector] Data.Vector.Storable.Vector (Double)
  12484. 1322.05 s [vector] fromList.toList == id: OK
  12485. 1322.05 s [vector] +++ OK, passed 100 tests.
  12486. 1322.05 s [vector] toList.fromList == id: OK
  12487. 1322.05 s [vector] +++ OK, passed 100 tests.
  12488. 1322.05 s [vector] unstream.stream == id: OK
  12489. 1322.05 s [vector] +++ OK, passed 100 tests.
  12490. 1322.05 s [vector] stream.unstream == id: OK
  12491. 1322.06 s [vector] +++ OK, passed 100 tests.
  12492. 1322.06 s [vector] eq: OK
  12493. 1322.06 s [vector] +++ OK, passed 100 tests.
  12494. 1322.06 s [vector] length: OK
  12495. 1322.06 s [vector] +++ OK, passed 100 tests.
  12496. 1322.06 s [vector] null: OK
  12497. 1322.06 s [vector] +++ OK, passed 100 tests.
  12498. 1322.06 s [vector] index: OK
  12499. 1322.06 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12500. 1322.06 s [vector] safeIndex: OK
  12501. 1322.06 s [vector] +++ OK, passed 100 tests.
  12502. 1322.06 s [vector] head: OK
  12503. 1322.06 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12504. 1322.06 s [vector] last: OK
  12505. 1322.06 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12506. 1322.06 s [vector] unsafeIndex: OK
  12507. 1322.06 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12508. 1322.06 s [vector] unsafeHead: OK
  12509. 1322.06 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12510. 1322.06 s [vector] unsafeLast: OK
  12511. 1322.06 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12512. 1322.07 s [vector] slice: OK
  12513. 1322.07 s [vector] +++ OK, passed 100 tests.
  12514. 1322.07 s [vector] init: OK
  12515. 1322.07 s [vector] +++ OK, passed 100 tests; 11 discarded.
  12516. 1322.07 s [vector] tail: OK
  12517. 1322.07 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12518. 1322.07 s [vector] take: OK
  12519. 1322.07 s [vector] +++ OK, passed 100 tests.
  12520. 1322.07 s [vector] drop: OK
  12521. 1322.07 s [vector] +++ OK, passed 100 tests.
  12522. 1322.07 s [vector] splitAt: OK
  12523. 1322.07 s [vector] +++ OK, passed 100 tests.
  12524. 1322.07 s [vector] empty: OK
  12525. 1322.07 s [vector] +++ OK, passed 100 tests.
  12526. 1322.07 s [vector] singleton: OK
  12527. 1322.07 s [vector] +++ OK, passed 100 tests.
  12528. 1322.07 s [vector] replicate: OK
  12529. 1322.08 s [vector] +++ OK, passed 100 tests.
  12530. 1322.08 s [vector] generate: OK
  12531. 1322.08 s [vector] +++ OK, passed 100 tests.
  12532. 1322.08 s [vector] iterateN: OK
  12533. 1322.08 s [vector] +++ OK, passed 100 tests.
  12534. 1322.10 s [vector] iterateNM: OK (0.02s)
  12535. 1322.10 s [vector] +++ OK, passed 100 tests.
  12536. 1322.12 s [vector] generateM: OK
  12537. 1322.12 s [vector] +++ OK, passed 100 tests.
  12538. 1322.12 s [vector] replicateM: OK
  12539. 1322.12 s [vector] +++ OK, passed 100 tests.
  12540. 1322.12 s [vector] create: OK
  12541. 1322.12 s [vector] +++ OK, passed 100 tests.
  12542. 1322.12 s [vector] createT: OK
  12543. 1322.12 s [vector] +++ OK, passed 100 tests.
  12544. 1322.12 s [vector] unfoldr: OK
  12545. 1322.12 s [vector] +++ OK, passed 100 tests.
  12546. 1322.12 s [vector] unfoldrN: OK
  12547. 1322.12 s [vector] +++ OK, passed 100 tests.
  12548. 1322.12 s [vector] unfoldrExactN: OK
  12549. 1322.12 s [vector] +++ OK, passed 100 tests.
  12550. 1322.13 s [vector] unfoldrM: OK
  12551. 1322.14 s [vector] +++ OK, passed 100 tests.
  12552. 1322.14 s [vector] unfoldrNM: OK
  12553. 1322.14 s [vector] +++ OK, passed 100 tests.
  12554. 1322.14 s [vector] unfoldrExactNM: OK (0.02s)
  12555. 1322.14 s [vector] +++ OK, passed 100 tests.
  12556. 1322.16 s [vector] constructN: OK (0.02s)
  12557. 1322.16 s [vector] +++ OK, passed 100 tests.
  12558. 1322.17 s [vector] constructrN: OK (0.01s)
  12559. 1322.17 s [vector] +++ OK, passed 100 tests.
  12560. 1322.18 s [vector] cons: OK
  12561. 1322.18 s [vector] +++ OK, passed 100 tests.
  12562. 1322.18 s [vector] snoc: OK
  12563. 1322.18 s [vector] +++ OK, passed 100 tests.
  12564. 1322.18 s [vector] append: OK
  12565. 1322.18 s [vector] +++ OK, passed 100 tests.
  12566. 1322.20 s [vector] concat: OK (0.02s)
  12567. 1322.20 s [vector] +++ OK, passed 100 tests.
  12568. 1322.20 s [vector] force: OK
  12569. 1322.21 s [vector] +++ OK, passed 100 tests.
  12570. 1322.21 s [vector] upd: OK
  12571. 1322.21 s [vector] +++ OK, passed 100 tests.
  12572. 1322.22 s [vector] accum: OK (0.01s)
  12573. 1322.22 s [vector] +++ OK, passed 100 tests.
  12574. 1322.22 s [vector] reverse: OK
  12575. 1322.22 s [vector] +++ OK, passed 100 tests.
  12576. 1322.22 s [vector] backpermute: OK
  12577. 1322.22 s [vector] +++ OK, passed 100 tests.
  12578. 1322.23 s [vector] map: OK
  12579. 1322.24 s [vector] +++ OK, passed 100 tests.
  12580. 1322.24 s [vector] imap: OK
  12581. 1322.25 s [vector] +++ OK, passed 100 tests.
  12582. 1322.26 s [vector] concatMap: OK
  12583. 1322.26 s [vector] +++ OK, passed 100 tests.
  12584. 1322.27 s [vector] mapM: OK
  12585. 1322.27 s [vector] +++ OK, passed 100 tests.
  12586. 1322.28 s [vector] mapM_: OK (0.03s)
  12587. 1322.28 s [vector] +++ OK, passed 100 tests.
  12588. 1322.30 s [vector] forM: OK
  12589. 1322.30 s [vector] +++ OK, passed 100 tests.
  12590. 1322.33 s [vector] forM_: OK (0.03s)
  12591. 1322.34 s [vector] +++ OK, passed 100 tests.
  12592. 1322.34 s [vector] imapM: OK
  12593. 1322.34 s [vector] +++ OK, passed 100 tests.
  12594. 1322.38 s [vector] imapM_: OK (0.05s)
  12595. 1322.38 s [vector] +++ OK, passed 100 tests.
  12596. 1322.39 s [vector] zipWith: OK
  12597. 1322.39 s [vector] +++ OK, passed 100 tests.
  12598. 1322.41 s [vector] zipWith3: OK (0.01s)
  12599. 1322.42 s [vector] +++ OK, passed 100 tests.
  12600. 1322.42 s [vector] izipWith: OK
  12601. 1322.42 s [vector] +++ OK, passed 100 tests.
  12602. 1322.44 s [vector] izipWith3: OK (0.01s)
  12603. 1322.44 s [vector] +++ OK, passed 100 tests.
  12604. 1322.44 s [vector] izipWithM: OK (0.01s)
  12605. 1322.44 s [vector] +++ OK, passed 100 tests.
  12606. 1322.47 s [vector] izipWithM_: OK (0.03s)
  12607. 1322.47 s [vector] +++ OK, passed 100 tests.
  12608. 1322.48 s [vector] zipWithM: OK
  12609. 1322.48 s [vector] +++ OK, passed 100 tests.
  12610. 1322.50 s [vector] zipWithM_: OK (0.03s)
  12611. 1322.50 s [vector] +++ OK, passed 100 tests.
  12612. 1322.52 s [vector] filter: OK
  12613. 1322.52 s [vector] +++ OK, passed 100 tests.
  12614. 1322.52 s [vector] ifilter: OK
  12615. 1322.52 s [vector] +++ OK, passed 100 tests.
  12616. 1322.56 s [vector] filterM: OK (0.04s)
  12617. 1322.56 s [vector] +++ OK, passed 100 tests.
  12618. 1322.57 s [vector] uniq: OK
  12619. 1322.57 s [vector] +++ OK, passed 100 tests.
  12620. 1322.58 s [vector] mapMaybe: OK (0.02s)
  12621. 1322.58 s [vector] +++ OK, passed 100 tests.
  12622. 1322.59 s [vector] imapMaybe: OK (0.01s)
  12623. 1322.59 s [vector] +++ OK, passed 100 tests.
  12624. 1322.59 s [vector] takeWhile: OK
  12625. 1322.60 s [vector] +++ OK, passed 100 tests.
  12626. 1322.60 s [vector] dropWhile: OK
  12627. 1322.60 s [vector] +++ OK, passed 100 tests.
  12628. 1322.60 s [vector] partition: OK
  12629. 1322.60 s [vector] +++ OK, passed 100 tests.
  12630. 1322.61 s [vector] partitionWith: OK
  12631. 1322.61 s [vector] +++ OK, passed 100 tests.
  12632. 1322.61 s [vector] span: OK
  12633. 1322.61 s [vector] +++ OK, passed 100 tests.
  12634. 1322.61 s [vector] break: OK
  12635. 1322.62 s [vector] +++ OK, passed 100 tests.
  12636. 1322.62 s [vector] spanR: OK
  12637. 1322.62 s [vector] +++ OK, passed 100 tests.
  12638. 1322.62 s [vector] breakR: OK
  12639. 1322.62 s [vector] +++ OK, passed 100 tests.
  12640. 1322.63 s [vector] groupBy: OK (0.01s)
  12641. 1322.63 s [vector] +++ OK, passed 100 tests.
  12642. 1322.63 s [vector] elem: OK
  12643. 1322.63 s [vector] +++ OK, passed 100 tests.
  12644. 1322.63 s [vector] notElem: OK
  12645. 1322.64 s [vector] +++ OK, passed 100 tests.
  12646. 1322.64 s [vector] find: OK
  12647. 1322.64 s [vector] +++ OK, passed 100 tests.
  12648. 1322.64 s [vector] findIndex: OK
  12649. 1322.65 s [vector] +++ OK, passed 100 tests.
  12650. 1322.65 s [vector] findIndexR: OK
  12651. 1322.65 s [vector] +++ OK, passed 100 tests.
  12652. 1322.65 s [vector] findIndices: OK
  12653. 1322.65 s [vector] +++ OK, passed 100 tests.
  12654. 1322.65 s [vector] elemIndex: OK
  12655. 1322.66 s [vector] +++ OK, passed 100 tests.
  12656. 1322.66 s [vector] elemIndices: OK
  12657. 1322.68 s [vector] +++ OK, passed 100 tests.
  12658. 1322.69 s [vector] foldl: OK (0.01s)
  12659. 1322.69 s [vector] +++ OK, passed 100 tests.
  12660. 1322.69 s [vector] foldl1: OK (0.01s)
  12661. 1322.69 s [vector] +++ OK, passed 100 tests; 12 discarded.
  12662. 1322.71 s [vector] foldl': OK (0.01s)
  12663. 1322.71 s [vector] +++ OK, passed 100 tests.
  12664. 1322.72 s [vector] foldl1': OK (0.02s)
  12665. 1322.72 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12666. 1322.74 s [vector] foldr: OK (0.02s)
  12667. 1322.74 s [vector] +++ OK, passed 100 tests.
  12668. 1322.74 s [vector] foldr1: OK (0.01s)
  12669. 1322.74 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12670. 1322.76 s [vector] foldr': OK (0.02s)
  12671. 1322.76 s [vector] +++ OK, passed 100 tests.
  12672. 1322.79 s [vector] foldr1': OK
  12673. 1322.79 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12674. 1322.82 s [vector] ifoldl: OK (0.02s)
  12675. 1322.82 s [vector] +++ OK, passed 100 tests.
  12676. 1322.84 s [vector] ifoldl': OK (0.01s)
  12677. 1322.84 s [vector] +++ OK, passed 100 tests.
  12678. 1322.84 s [vector] ifoldr: OK (0.01s)
  12679. 1322.84 s [vector] +++ OK, passed 100 tests.
  12680. 1322.86 s [vector] ifoldr': OK (0.02s)
  12681. 1322.86 s [vector] +++ OK, passed 100 tests.
  12682. 1322.87 s [vector] ifoldM: OK (0.01s)
  12683. 1322.87 s [vector] +++ OK, passed 100 tests.
  12684. 1322.88 s [vector] ifoldM': OK
  12685. 1322.88 s [vector] +++ OK, passed 100 tests.
  12686. 1322.92 s [vector] ifoldM_: OK (0.01s)
  12687. 1322.92 s [vector] +++ OK, passed 100 tests.
  12688. 1322.95 s [vector] ifoldM'_: OK (0.03s)
  12689. 1322.95 s [vector] +++ OK, passed 100 tests.
  12690. 1322.95 s [vector] all: OK
  12691. 1322.95 s [vector] +++ OK, passed 100 tests.
  12692. 1322.96 s [vector] any: OK
  12693. 1322.96 s [vector] +++ OK, passed 100 tests.
  12694. 1322.96 s [vector] prescanl: OK (0.01s)
  12695. 1322.97 s [vector] +++ OK, passed 100 tests.
  12696. 1322.98 s [vector] prescanl': OK
  12697. 1322.98 s [vector] +++ OK, passed 100 tests.
  12698. 1323.00 s [vector] postscanl: OK (0.01s)
  12699. 1323.00 s [vector] +++ OK, passed 100 tests.
  12700. 1323.02 s [vector] postscanl': OK (0.01s)
  12701. 1323.02 s [vector] +++ OK, passed 100 tests.
  12702. 1323.02 s [vector] scanl: OK
  12703. 1323.02 s [vector] +++ OK, passed 100 tests.
  12704. 1323.04 s [vector] scanl': OK (0.01s)
  12705. 1323.04 s [vector] +++ OK, passed 100 tests.
  12706. 1323.06 s [vector] scanl1: OK (0.01s)
  12707. 1323.06 s [vector] +++ OK, passed 100 tests.
  12708. 1323.06 s [vector] scanl1': OK (0.01s)
  12709. 1323.06 s [vector] +++ OK, passed 100 tests.
  12710. 1323.08 s [vector] iscanl: OK (0.01s)
  12711. 1323.08 s [vector] +++ OK, passed 100 tests.
  12712. 1323.10 s [vector] iscanl': OK (0.02s)
  12713. 1323.11 s [vector] +++ OK, passed 100 tests.
  12714. 1323.12 s [vector] prescanr: OK (0.01s)
  12715. 1323.12 s [vector] +++ OK, passed 100 tests.
  12716. 1323.12 s [vector] prescanr': OK (0.01s)
  12717. 1323.12 s [vector] +++ OK, passed 100 tests.
  12718. 1323.14 s [vector] postscanr: OK (0.01s)
  12719. 1323.14 s [vector] +++ OK, passed 100 tests.
  12720. 1323.14 s [vector] postscanr': OK (0.01s)
  12721. 1323.14 s [vector] +++ OK, passed 100 tests.
  12722. 1323.16 s [vector] scanr: OK (0.01s)
  12723. 1323.16 s [vector] +++ OK, passed 100 tests.
  12724. 1323.18 s [vector] scanr': OK (0.01s)
  12725. 1323.18 s [vector] +++ OK, passed 100 tests.
  12726. 1323.19 s [vector] scanr1: OK (0.01s)
  12727. 1323.19 s [vector] +++ OK, passed 100 tests.
  12728. 1323.20 s [vector] scanr1': OK (0.01s)
  12729. 1323.20 s [vector] +++ OK, passed 100 tests.
  12730. 1323.22 s [vector] iscanr: OK (0.01s)
  12731. 1323.22 s [vector] +++ OK, passed 100 tests.
  12732. 1323.22 s [vector] iscanr': OK (0.01s)
  12733. 1323.22 s [vector] +++ OK, passed 100 tests.
  12734. 1323.22 s [vector] mut_read: OK
  12735. 1323.22 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12736. 1323.22 s [vector] mut_write: OK
  12737. 1323.24 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12738. 1323.24 s [vector] mut_modify: OK
  12739. 1323.24 s [vector] +++ OK, passed 100 tests; 21 discarded.
  12740. 1323.24 s [vector] mut_generate: OK
  12741. 1323.24 s [vector] +++ OK, passed 100 tests.
  12742. 1323.24 s [vector] mut_generateM: OK (0.02s)
  12743. 1323.24 s [vector] +++ OK, passed 100 tests.
  12744. 1323.28 s [vector] mut_mapM_: OK (0.03s)
  12745. 1323.28 s [vector] +++ OK, passed 100 tests.
  12746. 1323.30 s [vector] mut_imapM_: OK (0.03s)
  12747. 1323.30 s [vector] +++ OK, passed 100 tests.
  12748. 1323.34 s [vector] mut_forM_: OK (0.04s)
  12749. 1323.34 s [vector] +++ OK, passed 100 tests.
  12750. 1323.38 s [vector] mut_iforM_: OK (0.03s)
  12751. 1323.38 s [vector] +++ OK, passed 100 tests.
  12752. 1323.38 s [vector] mut_foldr: OK (0.01s)
  12753. 1323.38 s [vector] +++ OK, passed 100 tests.
  12754. 1323.40 s [vector] mut_foldr': OK (0.01s)
  12755. 1323.40 s [vector] +++ OK, passed 100 tests.
  12756. 1323.42 s [vector] mut_foldl: OK (0.01s)
  12757. 1323.42 s [vector] +++ OK, passed 100 tests.
  12758. 1323.42 s [vector] mut_foldl': OK (0.01s)
  12759. 1323.42 s [vector] +++ OK, passed 100 tests.
  12760. 1323.44 s [vector] mut_ifoldr: OK (0.02s)
  12761. 1323.44 s [vector] +++ OK, passed 100 tests.
  12762. 1323.46 s [vector] mut_ifoldr': OK (0.02s)
  12763. 1323.46 s [vector] +++ OK, passed 100 tests.
  12764. 1323.48 s [vector] mut_ifoldl: OK (0.02s)
  12765. 1323.48 s [vector] +++ OK, passed 100 tests.
  12766. 1323.49 s [vector] mut_ifoldl': OK (0.01s)
  12767. 1323.49 s [vector] +++ OK, passed 100 tests.
  12768. 1323.52 s [vector] mut_foldM: OK
  12769. 1323.52 s [vector] +++ OK, passed 100 tests.
  12770. 1323.53 s [vector] mut_foldM': OK (0.01s)
  12771. 1323.53 s [vector] +++ OK, passed 100 tests.
  12772. 1323.54 s [vector] mut_foldrM: OK (0.01s)
  12773. 1323.54 s [vector] +++ OK, passed 100 tests.
  12774. 1323.56 s [vector] mut_foldrM': OK (0.01s)
  12775. 1323.56 s [vector] +++ OK, passed 100 tests.
  12776. 1323.57 s [vector] mut_ifoldM: OK (0.01s)
  12777. 1323.57 s [vector] +++ OK, passed 100 tests.
  12778. 1323.58 s [vector] mut_ifoldM': OK (0.02s)
  12779. 1323.58 s [vector] +++ OK, passed 100 tests.
  12780. 1323.60 s [vector] mut_ifoldrM: OK (0.01s)
  12781. 1323.60 s [vector] +++ OK, passed 100 tests.
  12782. 1323.60 s [vector] mut_ifoldrM': OK (0.01s)
  12783. 1323.60 s [vector] +++ OK, passed 100 tests.
  12784. 1323.60 s [vector] compare: OK
  12785. 1323.60 s [vector] +++ OK, passed 100 tests.
  12786. 1323.60 s [vector] maximum: OK
  12787. 1323.60 s [vector] +++ OK, passed 100 tests; 23 discarded.
  12788. 1323.60 s [vector] minimum: OK
  12789. 1323.60 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12790. 1323.60 s [vector] minIndex: OK
  12791. 1323.60 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12792. 1323.60 s [vector] maxIndex: OK
  12793. 1323.60 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12794. 1323.60 s [vector] maximumBy: OK
  12795. 1323.60 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12796. 1323.60 s [vector] minimumBy: OK
  12797. 1323.60 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12798. 1323.60 s [vector] maximumOn: OK
  12799. 1323.60 s [vector] +++ OK, passed 100 tests; 20 discarded.
  12800. 1323.61 s [vector] minimumOn: OK
  12801. 1323.61 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12802. 1323.61 s [vector] maxIndexBy: OK
  12803. 1323.61 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12804. 1323.61 s [vector] minIndexBy: OK
  12805. 1323.61 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12806. 1323.61 s [vector] ListFirstMaxIndexWins: OK
  12807. 1323.61 s [vector] +++ OK, passed 100 tests; 20 discarded.
  12808. 1323.61 s [vector] FalseListFirstMaxIndexWins: OK
  12809. 1323.61 s [vector] +++ OK, failed as expected. (after 1 test):
  12810. 1323.61 s [vector] Exception:
  12811. 1323.61 s [vector] Prelude.foldr1: empty list
  12812. 1323.61 s [vector] CallStack (from HasCallStack):
  12813. 1323.61 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  12814. 1323.61 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  12815. 1323.61 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  12816. 1323.61 s [vector] []
  12817. 1323.61 s [vector] mempty: OK
  12818. 1323.62 s [vector] +++ OK, passed 100 tests.
  12819. 1323.62 s [vector] mappend: OK
  12820. 1323.62 s [vector] +++ OK, passed 100 tests.
  12821. 1323.63 s [vector] mconcat: OK (0.02s)
  12822. 1323.63 s [vector] +++ OK, passed 100 tests.
  12823. 1323.63 s [vector] glength: OK
  12824. 1323.63 s [vector] +++ OK, passed 100 tests.
  12825. 1323.63 s [vector] sum: OK
  12826. 1323.63 s [vector] +++ OK, passed 100 tests.
  12827. 1323.63 s [vector] product: OK
  12828. 1323.63 s [vector] +++ OK, passed 100 tests.
  12829. 1323.63 s [vector] enumFromN: OK
  12830. 1323.63 s [vector] +++ OK, passed 100 tests.
  12831. 1323.63 s [vector] enumFromThenN: OK
  12832. 1323.63 s [vector] +++ OK, passed 100 tests.
  12833. 1323.63 s [vector] enumFromTo: OK
  12834. 1323.63 s [vector] +++ OK, passed 100 tests.
  12835. 1323.63 s [vector] enumFromThenTo: OK
  12836. 1323.63 s [vector] +++ OK, passed 100 tests; 1 discarded.
  12837. 1323.63 s [vector] unstream
  12838. 1323.63 s [vector] unstream == vunstream (exact): OK
  12839. 1323.64 s [vector] +++ OK, passed 100 tests.
  12840. 1323.64 s [vector] unstream == vunstream (unknown): OK
  12841. 1323.64 s [vector] +++ OK, passed 100 tests.
  12842. 1323.64 s [vector] unstreamR ~= vunstream (exact): OK
  12843. 1323.64 s [vector] +++ OK, passed 100 tests.
  12844. 1323.64 s [vector] unstreamR ~= vunstream (unknown): OK
  12845. 1323.64 s [vector] +++ OK, passed 100 tests.
  12846. 1323.64 s [vector] Tests.Vector.Strict
  12847. 1323.64 s [vector] Bool
  12848. 1323.64 s [vector] fromList.toList == id: OK
  12849. 1323.64 s [vector] +++ OK, passed 100 tests.
  12850. 1323.64 s [vector] toList.fromList == id: OK
  12851. 1323.64 s [vector] +++ OK, passed 100 tests.
  12852. 1323.64 s [vector] unstream.stream == id: OK
  12853. 1323.64 s [vector] +++ OK, passed 100 tests.
  12854. 1323.64 s [vector] stream.unstream == id: OK
  12855. 1323.64 s [vector] +++ OK, passed 100 tests.
  12856. 1323.64 s [vector] eq: OK
  12857. 1323.64 s [vector] +++ OK, passed 100 tests.
  12858. 1323.64 s [vector] length: OK
  12859. 1323.64 s [vector] +++ OK, passed 100 tests.
  12860. 1323.64 s [vector] null: OK
  12861. 1323.64 s [vector] +++ OK, passed 100 tests.
  12862. 1323.64 s [vector] index: OK
  12863. 1323.64 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12864. 1323.64 s [vector] safeIndex: OK
  12865. 1323.64 s [vector] +++ OK, passed 100 tests.
  12866. 1323.64 s [vector] head: OK
  12867. 1323.64 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12868. 1323.64 s [vector] last: OK
  12869. 1323.64 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12870. 1323.64 s [vector] unsafeIndex: OK
  12871. 1323.64 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12872. 1323.64 s [vector] unsafeHead: OK
  12873. 1323.64 s [vector] +++ OK, passed 100 tests; 20 discarded.
  12874. 1323.64 s [vector] unsafeLast: OK
  12875. 1323.64 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12876. 1323.64 s [vector] slice: OK
  12877. 1323.64 s [vector] +++ OK, passed 100 tests.
  12878. 1323.64 s [vector] init: OK
  12879. 1323.64 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12880. 1323.64 s [vector] tail: OK
  12881. 1323.64 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12882. 1323.64 s [vector] take: OK
  12883. 1323.64 s [vector] +++ OK, passed 100 tests.
  12884. 1323.64 s [vector] drop: OK
  12885. 1323.64 s [vector] +++ OK, passed 100 tests.
  12886. 1323.64 s [vector] splitAt: OK
  12887. 1323.64 s [vector] +++ OK, passed 100 tests.
  12888. 1323.64 s [vector] empty: OK
  12889. 1323.64 s [vector] +++ OK, passed 100 tests.
  12890. 1323.64 s [vector] singleton: OK
  12891. 1323.65 s [vector] +++ OK, passed 100 tests.
  12892. 1323.65 s [vector] replicate: OK
  12893. 1323.65 s [vector] +++ OK, passed 100 tests.
  12894. 1323.65 s [vector] generate: OK
  12895. 1323.65 s [vector] +++ OK, passed 100 tests.
  12896. 1323.65 s [vector] iterateN: OK
  12897. 1323.66 s [vector] +++ OK, passed 100 tests.
  12898. 1323.66 s [vector] iterateNM: OK (0.01s)
  12899. 1323.66 s [vector] +++ OK, passed 100 tests.
  12900. 1323.68 s [vector] generateM: OK (0.02s)
  12901. 1323.68 s [vector] +++ OK, passed 100 tests.
  12902. 1323.69 s [vector] replicateM: OK
  12903. 1323.69 s [vector] +++ OK, passed 100 tests.
  12904. 1323.69 s [vector] create: OK
  12905. 1323.69 s [vector] +++ OK, passed 100 tests.
  12906. 1323.69 s [vector] createT: OK
  12907. 1323.69 s [vector] +++ OK, passed 100 tests.
  12908. 1323.69 s [vector] unfoldr: OK
  12909. 1323.69 s [vector] +++ OK, passed 100 tests.
  12910. 1323.69 s [vector] unfoldrN: OK
  12911. 1323.69 s [vector] +++ OK, passed 100 tests.
  12912. 1323.69 s [vector] unfoldrExactN: OK
  12913. 1323.69 s [vector] +++ OK, passed 100 tests.
  12914. 1323.70 s [vector] unfoldrM: OK
  12915. 1323.70 s [vector] +++ OK, passed 100 tests.
  12916. 1323.70 s [vector] unfoldrNM: OK
  12917. 1323.70 s [vector] +++ OK, passed 100 tests.
  12918. 1323.72 s [vector] unfoldrExactNM: OK (0.02s)
  12919. 1323.72 s [vector] +++ OK, passed 100 tests.
  12920. 1323.72 s [vector] constructN: OK
  12921. 1323.72 s [vector] +++ OK, passed 100 tests.
  12922. 1323.72 s [vector] constructrN: OK
  12923. 1323.72 s [vector] +++ OK, passed 100 tests.
  12924. 1323.72 s [vector] cons: OK
  12925. 1323.73 s [vector] +++ OK, passed 100 tests.
  12926. 1323.73 s [vector] snoc: OK
  12927. 1323.73 s [vector] +++ OK, passed 100 tests.
  12928. 1323.73 s [vector] append: OK
  12929. 1323.73 s [vector] +++ OK, passed 100 tests.
  12930. 1323.73 s [vector] concat: OK
  12931. 1323.73 s [vector] +++ OK, passed 100 tests.
  12932. 1323.73 s [vector] force: OK
  12933. 1323.73 s [vector] +++ OK, passed 100 tests.
  12934. 1323.74 s [vector] upd: OK
  12935. 1323.74 s [vector] +++ OK, passed 100 tests.
  12936. 1323.74 s [vector] accum: OK
  12937. 1323.74 s [vector] +++ OK, passed 100 tests.
  12938. 1323.74 s [vector] reverse: OK
  12939. 1323.74 s [vector] +++ OK, passed 100 tests.
  12940. 1323.74 s [vector] backpermute: OK
  12941. 1323.74 s [vector] +++ OK, passed 100 tests.
  12942. 1323.74 s [vector] map: OK
  12943. 1323.74 s [vector] +++ OK, passed 100 tests.
  12944. 1323.75 s [vector] imap: OK
  12945. 1323.75 s [vector] +++ OK, passed 100 tests.
  12946. 1323.75 s [vector] concatMap: OK
  12947. 1323.76 s [vector] +++ OK, passed 100 tests.
  12948. 1323.76 s [vector] mapM: OK
  12949. 1323.76 s [vector] +++ OK, passed 100 tests.
  12950. 1323.76 s [vector] mapM_: OK (0.01s)
  12951. 1323.76 s [vector] +++ OK, passed 100 tests.
  12952. 1323.76 s [vector] forM: OK
  12953. 1323.76 s [vector] +++ OK, passed 100 tests.
  12954. 1323.77 s [vector] forM_: OK
  12955. 1323.77 s [vector] +++ OK, passed 100 tests.
  12956. 1323.78 s [vector] imapM: OK
  12957. 1323.78 s [vector] +++ OK, passed 100 tests.
  12958. 1323.78 s [vector] imapM_: OK
  12959. 1323.78 s [vector] +++ OK, passed 100 tests.
  12960. 1323.79 s [vector] zipWith: OK
  12961. 1323.79 s [vector] +++ OK, passed 100 tests.
  12962. 1323.79 s [vector] zipWith3: OK
  12963. 1323.79 s [vector] +++ OK, passed 100 tests.
  12964. 1323.79 s [vector] izipWith: OK
  12965. 1323.79 s [vector] +++ OK, passed 100 tests.
  12966. 1323.79 s [vector] izipWith3: OK
  12967. 1323.79 s [vector] +++ OK, passed 100 tests.
  12968. 1323.80 s [vector] izipWithM: OK
  12969. 1323.80 s [vector] +++ OK, passed 100 tests.
  12970. 1323.80 s [vector] izipWithM_: OK
  12971. 1323.80 s [vector] +++ OK, passed 100 tests.
  12972. 1323.80 s [vector] zipWithM: OK
  12973. 1323.81 s [vector] +++ OK, passed 100 tests.
  12974. 1323.82 s [vector] zipWithM_: OK
  12975. 1323.82 s [vector] +++ OK, passed 100 tests.
  12976. 1323.82 s [vector] filter: OK
  12977. 1323.82 s [vector] +++ OK, passed 100 tests.
  12978. 1323.82 s [vector] ifilter: OK
  12979. 1323.82 s [vector] +++ OK, passed 100 tests.
  12980. 1323.83 s [vector] filterM: OK (0.02s)
  12981. 1323.83 s [vector] +++ OK, passed 100 tests.
  12982. 1323.83 s [vector] uniq: OK
  12983. 1323.83 s [vector] +++ OK, passed 100 tests.
  12984. 1323.83 s [vector] mapMaybe: OK
  12985. 1323.83 s [vector] +++ OK, passed 100 tests.
  12986. 1323.83 s [vector] imapMaybe: OK
  12987. 1323.83 s [vector] +++ OK, passed 100 tests.
  12988. 1323.83 s [vector] takeWhile: OK
  12989. 1323.83 s [vector] +++ OK, passed 100 tests.
  12990. 1323.83 s [vector] dropWhile: OK
  12991. 1323.83 s [vector] +++ OK, passed 100 tests.
  12992. 1323.83 s [vector] partition: OK
  12993. 1323.83 s [vector] +++ OK, passed 100 tests.
  12994. 1323.83 s [vector] partitionWith: OK
  12995. 1323.83 s [vector] +++ OK, passed 100 tests.
  12996. 1323.83 s [vector] span: OK
  12997. 1323.83 s [vector] +++ OK, passed 100 tests.
  12998. 1323.83 s [vector] break: OK
  12999. 1323.83 s [vector] +++ OK, passed 100 tests.
  13000. 1323.83 s [vector] spanR: OK
  13001. 1323.83 s [vector] +++ OK, passed 100 tests.
  13002. 1323.83 s [vector] breakR: OK
  13003. 1323.83 s [vector] +++ OK, passed 100 tests.
  13004. 1323.83 s [vector] groupBy: OK
  13005. 1323.83 s [vector] +++ OK, passed 100 tests.
  13006. 1323.83 s [vector] elem: OK
  13007. 1323.83 s [vector] +++ OK, passed 100 tests.
  13008. 1323.83 s [vector] notElem: OK
  13009. 1323.84 s [vector] +++ OK, passed 100 tests.
  13010. 1323.84 s [vector] find: OK
  13011. 1323.84 s [vector] +++ OK, passed 100 tests.
  13012. 1323.84 s [vector] findIndex: OK
  13013. 1323.84 s [vector] +++ OK, passed 100 tests.
  13014. 1323.84 s [vector] findIndexR: OK
  13015. 1323.84 s [vector] +++ OK, passed 100 tests.
  13016. 1323.84 s [vector] findIndices: OK
  13017. 1323.84 s [vector] +++ OK, passed 100 tests.
  13018. 1323.84 s [vector] elemIndex: OK
  13019. 1323.84 s [vector] +++ OK, passed 100 tests.
  13020. 1323.84 s [vector] elemIndices: OK
  13021. 1323.84 s [vector] +++ OK, passed 100 tests.
  13022. 1323.84 s [vector] foldl: OK
  13023. 1323.85 s [vector] +++ OK, passed 100 tests.
  13024. 1323.85 s [vector] foldl1: OK
  13025. 1323.85 s [vector] +++ OK, passed 100 tests; 12 discarded.
  13026. 1323.85 s [vector] foldl': OK
  13027. 1323.85 s [vector] +++ OK, passed 100 tests.
  13028. 1323.85 s [vector] foldl1': OK
  13029. 1323.85 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13030. 1323.85 s [vector] foldr: OK
  13031. 1323.85 s [vector] +++ OK, passed 100 tests.
  13032. 1323.85 s [vector] foldr1: OK
  13033. 1323.85 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13034. 1323.85 s [vector] foldr': OK
  13035. 1323.85 s [vector] +++ OK, passed 100 tests.
  13036. 1323.85 s [vector] foldr1': OK
  13037. 1323.85 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13038. 1323.85 s [vector] ifoldl: OK
  13039. 1323.85 s [vector] +++ OK, passed 100 tests.
  13040. 1323.85 s [vector] ifoldl': OK
  13041. 1323.85 s [vector] +++ OK, passed 100 tests.
  13042. 1323.85 s [vector] ifoldr: OK
  13043. 1323.85 s [vector] +++ OK, passed 100 tests.
  13044. 1323.85 s [vector] ifoldr': OK
  13045. 1323.86 s [vector] +++ OK, passed 100 tests.
  13046. 1323.86 s [vector] ifoldM: OK
  13047. 1323.86 s [vector] +++ OK, passed 100 tests.
  13048. 1323.86 s [vector] ifoldM': OK
  13049. 1323.87 s [vector] +++ OK, passed 100 tests.
  13050. 1323.87 s [vector] ifoldM_: OK
  13051. 1323.88 s [vector] +++ OK, passed 100 tests.
  13052. 1323.88 s [vector] ifoldM'_: OK
  13053. 1323.88 s [vector] +++ OK, passed 100 tests.
  13054. 1323.88 s [vector] all: OK
  13055. 1323.88 s [vector] +++ OK, passed 100 tests.
  13056. 1323.88 s [vector] any: OK
  13057. 1323.88 s [vector] +++ OK, passed 100 tests.
  13058. 1323.88 s [vector] prescanl: OK
  13059. 1323.88 s [vector] +++ OK, passed 100 tests.
  13060. 1323.88 s [vector] prescanl': OK
  13061. 1323.88 s [vector] +++ OK, passed 100 tests.
  13062. 1323.88 s [vector] postscanl: OK
  13063. 1323.88 s [vector] +++ OK, passed 100 tests.
  13064. 1323.88 s [vector] postscanl': OK
  13065. 1323.88 s [vector] +++ OK, passed 100 tests.
  13066. 1323.89 s [vector] scanl: OK
  13067. 1323.89 s [vector] +++ OK, passed 100 tests.
  13068. 1323.89 s [vector] scanl': OK
  13069. 1323.89 s [vector] +++ OK, passed 100 tests.
  13070. 1323.89 s [vector] scanl1: OK
  13071. 1323.89 s [vector] +++ OK, passed 100 tests.
  13072. 1323.89 s [vector] scanl1': OK
  13073. 1323.89 s [vector] +++ OK, passed 100 tests.
  13074. 1323.89 s [vector] iscanl: OK
  13075. 1323.89 s [vector] +++ OK, passed 100 tests.
  13076. 1323.89 s [vector] iscanl': OK
  13077. 1323.89 s [vector] +++ OK, passed 100 tests.
  13078. 1323.89 s [vector] prescanr: OK
  13079. 1323.89 s [vector] +++ OK, passed 100 tests.
  13080. 1323.89 s [vector] prescanr': OK
  13081. 1323.89 s [vector] +++ OK, passed 100 tests.
  13082. 1323.90 s [vector] postscanr: OK
  13083. 1323.90 s [vector] +++ OK, passed 100 tests.
  13084. 1323.90 s [vector] postscanr': OK
  13085. 1323.90 s [vector] +++ OK, passed 100 tests.
  13086. 1323.90 s [vector] scanr: OK
  13087. 1323.90 s [vector] +++ OK, passed 100 tests.
  13088. 1323.90 s [vector] scanr': OK
  13089. 1323.90 s [vector] +++ OK, passed 100 tests.
  13090. 1323.90 s [vector] scanr1: OK
  13091. 1323.90 s [vector] +++ OK, passed 100 tests.
  13092. 1323.91 s [vector] scanr1': OK
  13093. 1323.91 s [vector] +++ OK, passed 100 tests.
  13094. 1323.92 s [vector] iscanr: OK
  13095. 1323.92 s [vector] +++ OK, passed 100 tests.
  13096. 1323.92 s [vector] iscanr': OK
  13097. 1323.92 s [vector] +++ OK, passed 100 tests.
  13098. 1323.92 s [vector] mut_read: OK
  13099. 1323.92 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13100. 1323.92 s [vector] mut_write: OK
  13101. 1323.92 s [vector] +++ OK, passed 100 tests; 22 discarded.
  13102. 1323.92 s [vector] mut_modify: OK
  13103. 1323.92 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13104. 1323.93 s [vector] mut_generate: OK
  13105. 1323.93 s [vector] +++ OK, passed 100 tests.
  13106. 1323.93 s [vector] mut_generateM: OK
  13107. 1323.93 s [vector] +++ OK, passed 100 tests.
  13108. 1323.93 s [vector] mut_mapM_: OK
  13109. 1323.93 s [vector] +++ OK, passed 100 tests.
  13110. 1323.93 s [vector] mut_imapM_: OK
  13111. 1323.93 s [vector] +++ OK, passed 100 tests.
  13112. 1323.96 s [vector] mut_forM_: OK (0.02s)
  13113. 1323.96 s [vector] +++ OK, passed 100 tests.
  13114. 1323.96 s [vector] mut_iforM_: OK
  13115. 1323.96 s [vector] +++ OK, passed 100 tests.
  13116. 1323.96 s [vector] mut_foldr: OK
  13117. 1323.96 s [vector] +++ OK, passed 100 tests.
  13118. 1323.96 s [vector] mut_foldr': OK
  13119. 1323.96 s [vector] +++ OK, passed 100 tests.
  13120. 1323.96 s [vector] mut_foldl: OK
  13121. 1323.96 s [vector] +++ OK, passed 100 tests.
  13122. 1323.96 s [vector] mut_foldl': OK
  13123. 1323.96 s [vector] +++ OK, passed 100 tests.
  13124. 1323.96 s [vector] mut_ifoldr: OK
  13125. 1323.96 s [vector] +++ OK, passed 100 tests.
  13126. 1323.96 s [vector] mut_ifoldr': OK
  13127. 1323.96 s [vector] +++ OK, passed 100 tests.
  13128. 1323.96 s [vector] mut_ifoldl: OK
  13129. 1323.96 s [vector] +++ OK, passed 100 tests.
  13130. 1323.97 s [vector] mut_ifoldl': OK
  13131. 1323.97 s [vector] +++ OK, passed 100 tests.
  13132. 1323.97 s [vector] mut_foldM: OK
  13133. 1323.97 s [vector] +++ OK, passed 100 tests.
  13134. 1323.97 s [vector] mut_foldM': OK
  13135. 1323.97 s [vector] +++ OK, passed 100 tests.
  13136. 1323.97 s [vector] mut_foldrM: OK
  13137. 1323.97 s [vector] +++ OK, passed 100 tests.
  13138. 1323.97 s [vector] mut_foldrM': OK
  13139. 1323.97 s [vector] +++ OK, passed 100 tests.
  13140. 1323.97 s [vector] mut_ifoldM: OK
  13141. 1323.98 s [vector] +++ OK, passed 100 tests.
  13142. 1323.98 s [vector] mut_ifoldM': OK
  13143. 1323.98 s [vector] +++ OK, passed 100 tests.
  13144. 1323.98 s [vector] mut_ifoldrM: OK
  13145. 1323.98 s [vector] +++ OK, passed 100 tests.
  13146. 1323.98 s [vector] mut_ifoldrM': OK
  13147. 1323.98 s [vector] +++ OK, passed 100 tests.
  13148. 1323.98 s [vector] compare: OK
  13149. 1323.98 s [vector] +++ OK, passed 100 tests.
  13150. 1323.98 s [vector] maximum: OK
  13151. 1323.98 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13152. 1323.98 s [vector] minimum: OK
  13153. 1323.98 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13154. 1323.98 s [vector] minIndex: OK
  13155. 1323.98 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13156. 1323.98 s [vector] maxIndex: OK
  13157. 1323.98 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13158. 1323.98 s [vector] maximumBy: OK
  13159. 1323.98 s [vector] +++ OK, passed 100 tests; 12 discarded.
  13160. 1323.98 s [vector] minimumBy: OK
  13161. 1323.98 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13162. 1323.98 s [vector] maximumOn: OK
  13163. 1323.98 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13164. 1323.98 s [vector] minimumOn: OK
  13165. 1323.98 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13166. 1323.98 s [vector] maxIndexBy: OK
  13167. 1323.98 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13168. 1323.98 s [vector] minIndexBy: OK
  13169. 1323.98 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13170. 1323.98 s [vector] ListFirstMaxIndexWins: OK
  13171. 1323.98 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13172. 1323.98 s [vector] FalseListFirstMaxIndexWins: OK
  13173. 1323.98 s [vector] +++ OK, failed as expected. (after 1 test):
  13174. 1323.98 s [vector] Exception:
  13175. 1323.98 s [vector] Prelude.foldr1: empty list
  13176. 1323.98 s [vector] CallStack (from HasCallStack):
  13177. 1323.98 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  13178. 1323.98 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  13179. 1323.98 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  13180. 1323.98 s [vector] []
  13181. 1323.99 s [vector] zip: OK
  13182. 1323.99 s [vector] +++ OK, passed 100 tests.
  13183. 1323.99 s [vector] zip3: OK
  13184. 1323.99 s [vector] +++ OK, passed 100 tests.
  13185. 1323.99 s [vector] unzip: OK
  13186. 1323.99 s [vector] +++ OK, passed 100 tests.
  13187. 1323.99 s [vector] unzip3: OK
  13188. 1323.99 s [vector] +++ OK, passed 100 tests.
  13189. 1323.99 s [vector] indexed: OK
  13190. 1323.99 s [vector] +++ OK, passed 100 tests.
  13191. 1324.00 s [vector] update: OK
  13192. 1324.00 s [vector] +++ OK, passed 100 tests.
  13193. 1324.00 s [vector] concat: OK
  13194. 1324.00 s [vector] +++ OK, passed 100 tests.
  13195. 1324.00 s [vector] mempty: OK
  13196. 1324.00 s [vector] +++ OK, passed 100 tests.
  13197. 1324.00 s [vector] mappend: OK
  13198. 1324.00 s [vector] +++ OK, passed 100 tests.
  13199. 1324.00 s [vector] mconcat: OK
  13200. 1324.01 s [vector] +++ OK, passed 100 tests.
  13201. 1324.01 s [vector] fmap: OK
  13202. 1324.01 s [vector] +++ OK, passed 100 tests.
  13203. 1324.01 s [vector] return: OK
  13204. 1324.01 s [vector] +++ OK, passed 100 tests.
  13205. 1324.01 s [vector] bind: OK
  13206. 1324.01 s [vector] +++ OK, passed 100 tests.
  13207. 1324.02 s [vector] mzip: OK
  13208. 1324.02 s [vector] +++ OK, passed 100 tests.
  13209. 1324.03 s [vector] munzip: OK
  13210. 1324.03 s [vector] +++ OK, passed 100 tests.
  13211. 1324.03 s [vector] applicative_pure: OK
  13212. 1324.03 s [vector] +++ OK, passed 100 tests.
  13213. 1324.03 s [vector] applicative_appl: OK (0.01s)
  13214. 1324.03 s [vector] +++ OK, passed 100 tests.
  13215. 1324.03 s [vector] alternative_empty: OK
  13216. 1324.03 s [vector] +++ OK, passed 100 tests.
  13217. 1324.04 s [vector] alternative_or: OK
  13218. 1324.04 s [vector] +++ OK, passed 100 tests.
  13219. 1324.06 s [vector] sequence: OK (0.02s)
  13220. 1324.06 s [vector] +++ OK, passed 100 tests.
  13221. 1324.06 s [vector] sequence_: OK (0.01s)
  13222. 1324.06 s [vector] +++ OK, passed 100 tests.
  13223. 1324.06 s [vector] glength: OK
  13224. 1324.06 s [vector] +++ OK, passed 100 tests.
  13225. 1324.06 s [vector] and: OK
  13226. 1324.06 s [vector] +++ OK, passed 100 tests.
  13227. 1324.06 s [vector] or: OK
  13228. 1324.07 s [vector] +++ OK, passed 100 tests.
  13229. 1324.07 s [vector] Int
  13230. 1324.07 s [vector] fromList.toList == id: OK
  13231. 1324.07 s [vector] +++ OK, passed 100 tests.
  13232. 1324.07 s [vector] toList.fromList == id: OK
  13233. 1324.07 s [vector] +++ OK, passed 100 tests.
  13234. 1324.07 s [vector] unstream.stream == id: OK
  13235. 1324.07 s [vector] +++ OK, passed 100 tests.
  13236. 1324.07 s [vector] stream.unstream == id: OK
  13237. 1324.07 s [vector] +++ OK, passed 100 tests.
  13238. 1324.07 s [vector] eq: OK
  13239. 1324.07 s [vector] +++ OK, passed 100 tests.
  13240. 1324.07 s [vector] length: OK
  13241. 1324.07 s [vector] +++ OK, passed 100 tests.
  13242. 1324.07 s [vector] null: OK
  13243. 1324.07 s [vector] +++ OK, passed 100 tests.
  13244. 1324.07 s [vector] index: OK
  13245. 1324.07 s [vector] +++ OK, passed 100 tests; 11 discarded.
  13246. 1324.07 s [vector] safeIndex: OK
  13247. 1324.07 s [vector] +++ OK, passed 100 tests.
  13248. 1324.07 s [vector] head: OK
  13249. 1324.07 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13250. 1324.07 s [vector] last: OK
  13251. 1324.07 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13252. 1324.07 s [vector] unsafeIndex: OK
  13253. 1324.07 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13254. 1324.07 s [vector] unsafeHead: OK
  13255. 1324.07 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13256. 1324.07 s [vector] unsafeLast: OK
  13257. 1324.07 s [vector] +++ OK, passed 100 tests; 19 discarded.
  13258. 1324.07 s [vector] slice: OK
  13259. 1324.07 s [vector] +++ OK, passed 100 tests.
  13260. 1324.07 s [vector] init: OK
  13261. 1324.07 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13262. 1324.07 s [vector] tail: OK
  13263. 1324.07 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13264. 1324.07 s [vector] take: OK
  13265. 1324.07 s [vector] +++ OK, passed 100 tests.
  13266. 1324.07 s [vector] drop: OK
  13267. 1324.08 s [vector] +++ OK, passed 100 tests.
  13268. 1324.08 s [vector] splitAt: OK
  13269. 1324.08 s [vector] +++ OK, passed 100 tests.
  13270. 1324.08 s [vector] empty: OK
  13271. 1324.08 s [vector] +++ OK, passed 100 tests.
  13272. 1324.08 s [vector] singleton: OK
  13273. 1324.08 s [vector] +++ OK, passed 100 tests.
  13274. 1324.08 s [vector] replicate: OK
  13275. 1324.08 s [vector] +++ OK, passed 100 tests.
  13276. 1324.08 s [vector] generate: OK
  13277. 1324.08 s [vector] +++ OK, passed 100 tests.
  13278. 1324.08 s [vector] iterateN: OK
  13279. 1324.08 s [vector] +++ OK, passed 100 tests.
  13280. 1324.10 s [vector] iterateNM: OK (0.02s)
  13281. 1324.10 s [vector] +++ OK, passed 100 tests.
  13282. 1324.14 s [vector] generateM: OK (0.04s)
  13283. 1324.14 s [vector] +++ OK, passed 100 tests.
  13284. 1324.15 s [vector] replicateM: OK (0.01s)
  13285. 1324.15 s [vector] +++ OK, passed 100 tests.
  13286. 1324.15 s [vector] create: OK
  13287. 1324.15 s [vector] +++ OK, passed 100 tests.
  13288. 1324.15 s [vector] createT: OK
  13289. 1324.15 s [vector] +++ OK, passed 100 tests.
  13290. 1324.15 s [vector] unfoldr: OK
  13291. 1324.15 s [vector] +++ OK, passed 100 tests.
  13292. 1324.15 s [vector] unfoldrN: OK
  13293. 1324.15 s [vector] +++ OK, passed 100 tests.
  13294. 1324.15 s [vector] unfoldrExactN: OK
  13295. 1324.16 s [vector] +++ OK, passed 100 tests.
  13296. 1324.16 s [vector] unfoldrM: OK
  13297. 1324.16 s [vector] +++ OK, passed 100 tests.
  13298. 1324.16 s [vector] unfoldrNM: OK
  13299. 1324.16 s [vector] +++ OK, passed 100 tests.
  13300. 1324.18 s [vector] unfoldrExactNM: OK (0.02s)
  13301. 1324.18 s [vector] +++ OK, passed 100 tests.
  13302. 1324.18 s [vector] constructN: OK
  13303. 1324.18 s [vector] +++ OK, passed 100 tests.
  13304. 1324.19 s [vector] constructrN: OK
  13305. 1324.19 s [vector] +++ OK, passed 100 tests.
  13306. 1324.19 s [vector] cons: OK
  13307. 1324.19 s [vector] +++ OK, passed 100 tests.
  13308. 1324.20 s [vector] snoc: OK
  13309. 1324.20 s [vector] +++ OK, passed 100 tests.
  13310. 1324.20 s [vector] append: OK
  13311. 1324.21 s [vector] +++ OK, passed 100 tests.
  13312. 1324.21 s [vector] concat: OK (0.02s)
  13313. 1324.21 s [vector] +++ OK, passed 100 tests.
  13314. 1324.21 s [vector] force: OK
  13315. 1324.21 s [vector] +++ OK, passed 100 tests.
  13316. 1324.21 s [vector] upd: OK
  13317. 1324.21 s [vector] +++ OK, passed 100 tests.
  13318. 1324.21 s [vector] accum: OK
  13319. 1324.21 s [vector] +++ OK, passed 100 tests.
  13320. 1324.22 s [vector] reverse: OK
  13321. 1324.22 s [vector] +++ OK, passed 100 tests.
  13322. 1324.22 s [vector] backpermute: OK
  13323. 1324.22 s [vector] +++ OK, passed 100 tests.
  13324. 1324.23 s [vector] map: OK
  13325. 1324.23 s [vector] +++ OK, passed 100 tests.
  13326. 1324.24 s [vector] imap: OK
  13327. 1324.24 s [vector] +++ OK, passed 100 tests.
  13328. 1324.24 s [vector] concatMap: OK
  13329. 1324.24 s [vector] +++ OK, passed 100 tests.
  13330. 1324.24 s [vector] mapM: OK
  13331. 1324.24 s [vector] +++ OK, passed 100 tests.
  13332. 1324.25 s [vector] mapM_: OK (0.02s)
  13333. 1324.26 s [vector] +++ OK, passed 100 tests.
  13334. 1324.26 s [vector] forM: OK
  13335. 1324.26 s [vector] +++ OK, passed 100 tests.
  13336. 1324.28 s [vector] forM_: OK (0.02s)
  13337. 1324.28 s [vector] +++ OK, passed 100 tests.
  13338. 1324.28 s [vector] imapM: OK
  13339. 1324.28 s [vector] +++ OK, passed 100 tests.
  13340. 1324.29 s [vector] imapM_: OK (0.01s)
  13341. 1324.30 s [vector] +++ OK, passed 100 tests.
  13342. 1324.30 s [vector] zipWith: OK
  13343. 1324.30 s [vector] +++ OK, passed 100 tests.
  13344. 1324.30 s [vector] zipWith3: OK
  13345. 1324.30 s [vector] +++ OK, passed 100 tests.
  13346. 1324.30 s [vector] izipWith: OK
  13347. 1324.30 s [vector] +++ OK, passed 100 tests.
  13348. 1324.32 s [vector] izipWith3: OK
  13349. 1324.32 s [vector] +++ OK, passed 100 tests.
  13350. 1324.32 s [vector] izipWithM: OK
  13351. 1324.32 s [vector] +++ OK, passed 100 tests.
  13352. 1324.32 s [vector] izipWithM_: OK (0.01s)
  13353. 1324.33 s [vector] +++ OK, passed 100 tests.
  13354. 1324.33 s [vector] zipWithM: OK
  13355. 1324.33 s [vector] +++ OK, passed 100 tests.
  13356. 1324.33 s [vector] zipWithM_: OK (0.01s)
  13357. 1324.33 s [vector] +++ OK, passed 100 tests.
  13358. 1324.34 s [vector] filter: OK
  13359. 1324.34 s [vector] +++ OK, passed 100 tests.
  13360. 1324.34 s [vector] ifilter: OK
  13361. 1324.35 s [vector] +++ OK, passed 100 tests.
  13362. 1324.36 s [vector] filterM: OK (0.03s)
  13363. 1324.36 s [vector] +++ OK, passed 100 tests.
  13364. 1324.36 s [vector] uniq: OK
  13365. 1324.36 s [vector] +++ OK, passed 100 tests.
  13366. 1324.37 s [vector] mapMaybe: OK
  13367. 1324.37 s [vector] +++ OK, passed 100 tests.
  13368. 1324.37 s [vector] imapMaybe: OK
  13369. 1324.37 s [vector] +++ OK, passed 100 tests.
  13370. 1324.37 s [vector] takeWhile: OK
  13371. 1324.37 s [vector] +++ OK, passed 100 tests.
  13372. 1324.37 s [vector] dropWhile: OK
  13373. 1324.37 s [vector] +++ OK, passed 100 tests.
  13374. 1324.37 s [vector] partition: OK
  13375. 1324.37 s [vector] +++ OK, passed 100 tests.
  13376. 1324.37 s [vector] partitionWith: OK
  13377. 1324.37 s [vector] +++ OK, passed 100 tests.
  13378. 1324.37 s [vector] span: OK
  13379. 1324.37 s [vector] +++ OK, passed 100 tests.
  13380. 1324.37 s [vector] break: OK
  13381. 1324.37 s [vector] +++ OK, passed 100 tests.
  13382. 1324.37 s [vector] spanR: OK
  13383. 1324.37 s [vector] +++ OK, passed 100 tests.
  13384. 1324.37 s [vector] breakR: OK
  13385. 1324.37 s [vector] +++ OK, passed 100 tests.
  13386. 1324.37 s [vector] groupBy: OK
  13387. 1324.37 s [vector] +++ OK, passed 100 tests.
  13388. 1324.37 s [vector] elem: OK
  13389. 1324.38 s [vector] +++ OK, passed 100 tests.
  13390. 1324.38 s [vector] notElem: OK
  13391. 1324.38 s [vector] +++ OK, passed 100 tests.
  13392. 1324.38 s [vector] find: OK
  13393. 1324.38 s [vector] +++ OK, passed 100 tests.
  13394. 1324.38 s [vector] findIndex: OK
  13395. 1324.38 s [vector] +++ OK, passed 100 tests.
  13396. 1324.38 s [vector] findIndexR: OK
  13397. 1324.38 s [vector] +++ OK, passed 100 tests.
  13398. 1324.38 s [vector] findIndices: OK
  13399. 1324.39 s [vector] +++ OK, passed 100 tests.
  13400. 1324.39 s [vector] elemIndex: OK
  13401. 1324.39 s [vector] +++ OK, passed 100 tests.
  13402. 1324.39 s [vector] elemIndices: OK
  13403. 1324.40 s [vector] +++ OK, passed 100 tests.
  13404. 1324.40 s [vector] foldl: OK
  13405. 1324.40 s [vector] +++ OK, passed 100 tests.
  13406. 1324.40 s [vector] foldl1: OK
  13407. 1324.41 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13408. 1324.42 s [vector] foldl': OK
  13409. 1324.42 s [vector] +++ OK, passed 100 tests.
  13410. 1324.42 s [vector] foldl1': OK
  13411. 1324.42 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13412. 1324.43 s [vector] foldr: OK
  13413. 1324.43 s [vector] +++ OK, passed 100 tests.
  13414. 1324.44 s [vector] foldr1: OK
  13415. 1324.44 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13416. 1324.44 s [vector] foldr': OK
  13417. 1324.44 s [vector] +++ OK, passed 100 tests.
  13418. 1324.44 s [vector] foldr1': OK
  13419. 1324.44 s [vector] +++ OK, passed 100 tests; 19 discarded.
  13420. 1324.44 s [vector] ifoldl: OK
  13421. 1324.44 s [vector] +++ OK, passed 100 tests.
  13422. 1324.45 s [vector] ifoldl': OK
  13423. 1324.45 s [vector] +++ OK, passed 100 tests.
  13424. 1324.45 s [vector] ifoldr: OK
  13425. 1324.45 s [vector] +++ OK, passed 100 tests.
  13426. 1324.46 s [vector] ifoldr': OK
  13427. 1324.46 s [vector] +++ OK, passed 100 tests.
  13428. 1324.46 s [vector] ifoldM: OK
  13429. 1324.46 s [vector] +++ OK, passed 100 tests.
  13430. 1324.46 s [vector] ifoldM': OK
  13431. 1324.46 s [vector] +++ OK, passed 100 tests.
  13432. 1324.46 s [vector] ifoldM_: OK (0.02s)
  13433. 1324.46 s [vector] +++ OK, passed 100 tests.
  13434. 1324.46 s [vector] ifoldM'_: OK (0.01s)
  13435. 1324.46 s [vector] +++ OK, passed 100 tests.
  13436. 1324.46 s [vector] all: OK
  13437. 1324.46 s [vector] +++ OK, passed 100 tests.
  13438. 1324.46 s [vector] any: OK
  13439. 1324.46 s [vector] +++ OK, passed 100 tests.
  13440. 1324.46 s [vector] prescanl: OK
  13441. 1324.46 s [vector] +++ OK, passed 100 tests.
  13442. 1324.46 s [vector] prescanl': OK
  13443. 1324.46 s [vector] +++ OK, passed 100 tests.
  13444. 1324.46 s [vector] postscanl: OK
  13445. 1324.46 s [vector] +++ OK, passed 100 tests.
  13446. 1324.46 s [vector] postscanl': OK
  13447. 1324.46 s [vector] +++ OK, passed 100 tests.
  13448. 1324.46 s [vector] scanl: OK
  13449. 1324.46 s [vector] +++ OK, passed 100 tests.
  13450. 1324.46 s [vector] scanl': OK
  13451. 1324.46 s [vector] +++ OK, passed 100 tests.
  13452. 1324.46 s [vector] scanl1: OK
  13453. 1324.46 s [vector] +++ OK, passed 100 tests.
  13454. 1324.46 s [vector] scanl1': OK
  13455. 1324.46 s [vector] +++ OK, passed 100 tests.
  13456. 1324.46 s [vector] iscanl: OK
  13457. 1324.47 s [vector] +++ OK, passed 100 tests.
  13458. 1324.47 s [vector] iscanl': OK
  13459. 1324.47 s [vector] +++ OK, passed 100 tests.
  13460. 1324.48 s [vector] prescanr: OK
  13461. 1324.48 s [vector] +++ OK, passed 100 tests.
  13462. 1324.48 s [vector] prescanr': OK
  13463. 1324.48 s [vector] +++ OK, passed 100 tests.
  13464. 1324.48 s [vector] postscanr: OK
  13465. 1324.48 s [vector] +++ OK, passed 100 tests.
  13466. 1324.48 s [vector] postscanr': OK
  13467. 1324.48 s [vector] +++ OK, passed 100 tests.
  13468. 1324.48 s [vector] scanr: OK
  13469. 1324.48 s [vector] +++ OK, passed 100 tests.
  13470. 1324.49 s [vector] scanr': OK
  13471. 1324.50 s [vector] +++ OK, passed 100 tests.
  13472. 1324.50 s [vector] scanr1: OK
  13473. 1324.50 s [vector] +++ OK, passed 100 tests.
  13474. 1324.50 s [vector] scanr1': OK
  13475. 1324.50 s [vector] +++ OK, passed 100 tests.
  13476. 1324.51 s [vector] iscanr: OK
  13477. 1324.51 s [vector] +++ OK, passed 100 tests.
  13478. 1324.52 s [vector] iscanr': OK
  13479. 1324.52 s [vector] +++ OK, passed 100 tests.
  13480. 1324.52 s [vector] mut_read: OK
  13481. 1324.52 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13482. 1324.52 s [vector] mut_write: OK
  13483. 1324.52 s [vector] +++ OK, passed 100 tests; 11 discarded.
  13484. 1324.52 s [vector] mut_modify: OK
  13485. 1324.53 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13486. 1324.53 s [vector] mut_generate: OK
  13487. 1324.54 s [vector] +++ OK, passed 100 tests.
  13488. 1324.54 s [vector] mut_generateM: OK (0.02s)
  13489. 1324.54 s [vector] +++ OK, passed 100 tests.
  13490. 1324.57 s [vector] mut_mapM_: OK (0.03s)
  13491. 1324.57 s [vector] +++ OK, passed 100 tests.
  13492. 1324.60 s [vector] mut_imapM_: OK (0.01s)
  13493. 1324.60 s [vector] +++ OK, passed 100 tests.
  13494. 1324.62 s [vector] mut_forM_: OK (0.02s)
  13495. 1324.62 s [vector] +++ OK, passed 100 tests.
  13496. 1324.65 s [vector] mut_iforM_: OK (0.03s)
  13497. 1324.65 s [vector] +++ OK, passed 100 tests.
  13498. 1324.66 s [vector] mut_foldr: OK
  13499. 1324.66 s [vector] +++ OK, passed 100 tests.
  13500. 1324.66 s [vector] mut_foldr': OK
  13501. 1324.66 s [vector] +++ OK, passed 100 tests.
  13502. 1324.66 s [vector] mut_foldl: OK
  13503. 1324.66 s [vector] +++ OK, passed 100 tests.
  13504. 1324.66 s [vector] mut_foldl': OK
  13505. 1324.66 s [vector] +++ OK, passed 100 tests.
  13506. 1324.66 s [vector] mut_ifoldr: OK
  13507. 1324.67 s [vector] +++ OK, passed 100 tests.
  13508. 1324.68 s [vector] mut_ifoldr': OK
  13509. 1324.68 s [vector] +++ OK, passed 100 tests.
  13510. 1324.68 s [vector] mut_ifoldl: OK
  13511. 1324.69 s [vector] +++ OK, passed 100 tests.
  13512. 1324.69 s [vector] mut_ifoldl': OK
  13513. 1324.69 s [vector] +++ OK, passed 100 tests.
  13514. 1324.69 s [vector] mut_foldM: OK
  13515. 1324.69 s [vector] +++ OK, passed 100 tests.
  13516. 1324.69 s [vector] mut_foldM': OK
  13517. 1324.69 s [vector] +++ OK, passed 100 tests.
  13518. 1324.69 s [vector] mut_foldrM: OK
  13519. 1324.69 s [vector] +++ OK, passed 100 tests.
  13520. 1324.70 s [vector] mut_foldrM': OK
  13521. 1324.70 s [vector] +++ OK, passed 100 tests.
  13522. 1324.70 s [vector] mut_ifoldM: OK
  13523. 1324.70 s [vector] +++ OK, passed 100 tests.
  13524. 1324.70 s [vector] mut_ifoldM': OK
  13525. 1324.70 s [vector] +++ OK, passed 100 tests.
  13526. 1324.70 s [vector] mut_ifoldrM: OK
  13527. 1324.70 s [vector] +++ OK, passed 100 tests.
  13528. 1324.70 s [vector] mut_ifoldrM': OK
  13529. 1324.70 s [vector] +++ OK, passed 100 tests.
  13530. 1324.70 s [vector] compare: OK
  13531. 1324.70 s [vector] +++ OK, passed 100 tests.
  13532. 1324.71 s [vector] maximum: OK
  13533. 1324.71 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13534. 1324.71 s [vector] minimum: OK
  13535. 1324.71 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13536. 1324.71 s [vector] minIndex: OK
  13537. 1324.71 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13538. 1324.71 s [vector] maxIndex: OK
  13539. 1324.71 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13540. 1324.71 s [vector] maximumBy: OK
  13541. 1324.71 s [vector] +++ OK, passed 100 tests; 19 discarded.
  13542. 1324.71 s [vector] minimumBy: OK
  13543. 1324.71 s [vector] +++ OK, passed 100 tests; 19 discarded.
  13544. 1324.71 s [vector] maximumOn: OK
  13545. 1324.71 s [vector] +++ OK, passed 100 tests; 20 discarded.
  13546. 1324.71 s [vector] minimumOn: OK
  13547. 1324.71 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13548. 1324.71 s [vector] maxIndexBy: OK
  13549. 1324.71 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13550. 1324.71 s [vector] minIndexBy: OK
  13551. 1324.71 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13552. 1324.71 s [vector] ListFirstMaxIndexWins: OK
  13553. 1324.71 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13554. 1324.71 s [vector] FalseListFirstMaxIndexWins: OK
  13555. 1324.71 s [vector] +++ OK, failed as expected. (after 1 test):
  13556. 1324.71 s [vector] Exception:
  13557. 1324.71 s [vector] Prelude.foldr1: empty list
  13558. 1324.71 s [vector] CallStack (from HasCallStack):
  13559. 1324.71 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  13560. 1324.71 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  13561. 1324.71 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  13562. 1324.71 s [vector] []
  13563. 1324.71 s [vector] zip: OK
  13564. 1324.71 s [vector] +++ OK, passed 100 tests.
  13565. 1324.72 s [vector] zip3: OK
  13566. 1324.72 s [vector] +++ OK, passed 100 tests.
  13567. 1324.72 s [vector] unzip: OK
  13568. 1324.72 s [vector] +++ OK, passed 100 tests.
  13569. 1324.72 s [vector] unzip3: OK
  13570. 1324.72 s [vector] +++ OK, passed 100 tests.
  13571. 1324.72 s [vector] indexed: OK
  13572. 1324.72 s [vector] +++ OK, passed 100 tests.
  13573. 1324.72 s [vector] update: OK
  13574. 1324.72 s [vector] +++ OK, passed 100 tests.
  13575. 1324.73 s [vector] concat: OK (0.01s)
  13576. 1324.73 s [vector] +++ OK, passed 100 tests.
  13577. 1324.74 s [vector] mempty: OK
  13578. 1324.74 s [vector] +++ OK, passed 100 tests.
  13579. 1324.74 s [vector] mappend: OK
  13580. 1324.74 s [vector] +++ OK, passed 100 tests.
  13581. 1324.74 s [vector] mconcat: OK
  13582. 1324.74 s [vector] +++ OK, passed 100 tests.
  13583. 1324.74 s [vector] fmap: OK
  13584. 1324.74 s [vector] +++ OK, passed 100 tests.
  13585. 1324.76 s [vector] return: OK
  13586. 1324.76 s [vector] +++ OK, passed 100 tests.
  13587. 1324.76 s [vector] bind: OK (0.02s)
  13588. 1324.76 s [vector] +++ OK, passed 100 tests.
  13589. 1324.76 s [vector] mzip: OK
  13590. 1324.77 s [vector] +++ OK, passed 100 tests.
  13591. 1324.77 s [vector] munzip: OK
  13592. 1324.77 s [vector] +++ OK, passed 100 tests.
  13593. 1324.77 s [vector] applicative_pure: OK
  13594. 1324.78 s [vector] +++ OK, passed 100 tests.
  13595. 1324.79 s [vector] applicative_appl: OK (0.03s)
  13596. 1324.79 s [vector] +++ OK, passed 100 tests.
  13597. 1324.79 s [vector] alternative_empty: OK
  13598. 1324.79 s [vector] +++ OK, passed 100 tests.
  13599. 1324.79 s [vector] alternative_or: OK
  13600. 1324.79 s [vector] +++ OK, passed 100 tests.
  13601. 1324.82 s [vector] sequence: OK (0.03s)
  13602. 1324.82 s [vector] +++ OK, passed 100 tests.
  13603. 1324.83 s [vector] sequence_: OK (0.01s)
  13604. 1324.83 s [vector] +++ OK, passed 100 tests.
  13605. 1324.83 s [vector] glength: OK
  13606. 1324.83 s [vector] +++ OK, passed 100 tests.
  13607. 1324.83 s [vector] sum: OK
  13608. 1324.83 s [vector] +++ OK, passed 100 tests.
  13609. 1324.83 s [vector] product: OK
  13610. 1324.83 s [vector] +++ OK, passed 100 tests.
  13611. 1324.83 s [vector] enumFromN: OK
  13612. 1324.83 s [vector] +++ OK, passed 100 tests.
  13613. 1324.83 s [vector] enumFromThenN: OK
  13614. 1324.83 s [vector] +++ OK, passed 100 tests.
  13615. 1324.84 s [vector] enumFromTo: OK
  13616. 1324.84 s [vector] +++ OK, passed 100 tests.
  13617. 1324.84 s [vector] enumFromThenTo: OK
  13618. 1324.84 s [vector] +++ OK, passed 100 tests; 11 discarded.
  13619. 1324.84 s [vector] unstream
  13620. 1324.84 s [vector] unstream == vunstream (exact): OK
  13621. 1324.84 s [vector] +++ OK, passed 100 tests.
  13622. 1324.84 s [vector] unstream == vunstream (unknown): OK
  13623. 1324.84 s [vector] +++ OK, passed 100 tests.
  13624. 1324.84 s [vector] unstreamR ~= vunstream (exact): OK
  13625. 1324.84 s [vector] +++ OK, passed 100 tests.
  13626. 1324.84 s [vector] unstreamR ~= vunstream (unknown): OK
  13627. 1324.84 s [vector] +++ OK, passed 100 tests.
  13628. 1324.84 s [vector] Tests.Vector.Unboxed
  13629. 1324.84 s [vector] ()
  13630. 1324.84 s [vector] fromList.toList == id: OK
  13631. 1324.84 s [vector] +++ OK, passed 100 tests.
  13632. 1324.84 s [vector] toList.fromList == id: OK
  13633. 1324.84 s [vector] +++ OK, passed 100 tests.
  13634. 1324.84 s [vector] unstream.stream == id: OK
  13635. 1324.84 s [vector] +++ OK, passed 100 tests.
  13636. 1324.84 s [vector] stream.unstream == id: OK
  13637. 1324.84 s [vector] +++ OK, passed 100 tests.
  13638. 1324.84 s [vector] eq: OK
  13639. 1324.84 s [vector] +++ OK, passed 100 tests.
  13640. 1324.84 s [vector] length: OK
  13641. 1324.84 s [vector] +++ OK, passed 100 tests.
  13642. 1324.84 s [vector] null: OK
  13643. 1324.84 s [vector] +++ OK, passed 100 tests.
  13644. 1324.84 s [vector] index: OK
  13645. 1324.84 s [vector] +++ OK, passed 100 tests; 12 discarded.
  13646. 1324.84 s [vector] safeIndex: OK
  13647. 1324.84 s [vector] +++ OK, passed 100 tests.
  13648. 1324.84 s [vector] head: OK
  13649. 1324.84 s [vector] +++ OK, passed 100 tests; 19 discarded.
  13650. 1324.84 s [vector] last: OK
  13651. 1324.84 s [vector] +++ OK, passed 100 tests; 23 discarded.
  13652. 1324.84 s [vector] unsafeIndex: OK
  13653. 1324.84 s [vector] +++ OK, passed 100 tests; 10 discarded.
  13654. 1324.84 s [vector] unsafeHead: OK
  13655. 1324.84 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13656. 1324.84 s [vector] unsafeLast: OK
  13657. 1324.84 s [vector] +++ OK, passed 100 tests; 20 discarded.
  13658. 1324.84 s [vector] slice: OK
  13659. 1324.84 s [vector] +++ OK, passed 100 tests.
  13660. 1324.84 s [vector] init: OK
  13661. 1324.84 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13662. 1324.85 s [vector] tail: OK
  13663. 1324.85 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13664. 1324.85 s [vector] take: OK
  13665. 1324.85 s [vector] +++ OK, passed 100 tests.
  13666. 1324.85 s [vector] drop: OK
  13667. 1324.85 s [vector] +++ OK, passed 100 tests.
  13668. 1324.85 s [vector] splitAt: OK
  13669. 1324.85 s [vector] +++ OK, passed 100 tests.
  13670. 1324.85 s [vector] empty: OK
  13671. 1324.85 s [vector] +++ OK, passed 100 tests.
  13672. 1324.85 s [vector] singleton: OK
  13673. 1324.85 s [vector] +++ OK, passed 100 tests.
  13674. 1324.85 s [vector] replicate: OK
  13675. 1324.85 s [vector] +++ OK, passed 100 tests.
  13676. 1324.85 s [vector] generate: OK
  13677. 1324.85 s [vector] +++ OK, passed 100 tests.
  13678. 1324.86 s [vector] iterateN: OK
  13679. 1324.86 s [vector] +++ OK, passed 100 tests.
  13680. 1324.86 s [vector] iterateNM: OK (0.01s)
  13681. 1324.86 s [vector] +++ OK, passed 100 tests.
  13682. 1324.90 s [vector] generateM: OK (0.03s)
  13683. 1324.90 s [vector] +++ OK, passed 100 tests.
  13684. 1324.90 s [vector] replicateM: OK
  13685. 1324.90 s [vector] +++ OK, passed 100 tests.
  13686. 1324.90 s [vector] create: OK
  13687. 1324.90 s [vector] +++ OK, passed 100 tests.
  13688. 1324.90 s [vector] createT: OK
  13689. 1324.90 s [vector] +++ OK, passed 100 tests.
  13690. 1324.90 s [vector] unfoldr: OK
  13691. 1324.90 s [vector] +++ OK, passed 100 tests.
  13692. 1324.91 s [vector] unfoldrN: OK
  13693. 1324.92 s [vector] +++ OK, passed 100 tests.
  13694. 1324.92 s [vector] unfoldrExactN: OK
  13695. 1324.92 s [vector] +++ OK, passed 100 tests.
  13696. 1324.92 s [vector] unfoldrM: OK
  13697. 1324.92 s [vector] +++ OK, passed 100 tests.
  13698. 1324.92 s [vector] unfoldrNM: OK
  13699. 1324.92 s [vector] +++ OK, passed 100 tests.
  13700. 1324.94 s [vector] unfoldrExactNM: OK (0.01s)
  13701. 1324.94 s [vector] +++ OK, passed 100 tests.
  13702. 1324.95 s [vector] constructN: OK (0.01s)
  13703. 1324.95 s [vector] +++ OK, passed 100 tests.
  13704. 1324.96 s [vector] constructrN: OK (0.01s)
  13705. 1324.96 s [vector] +++ OK, passed 100 tests.
  13706. 1324.96 s [vector] cons: OK
  13707. 1324.96 s [vector] +++ OK, passed 100 tests.
  13708. 1324.96 s [vector] snoc: OK
  13709. 1324.96 s [vector] +++ OK, passed 100 tests.
  13710. 1324.96 s [vector] append: OK
  13711. 1324.96 s [vector] +++ OK, passed 100 tests.
  13712. 1324.97 s [vector] concat: OK (0.01s)
  13713. 1324.97 s [vector] +++ OK, passed 100 tests.
  13714. 1324.97 s [vector] force: OK
  13715. 1324.97 s [vector] +++ OK, passed 100 tests.
  13716. 1324.98 s [vector] upd: OK
  13717. 1324.98 s [vector] +++ OK, passed 100 tests.
  13718. 1324.98 s [vector] accum: OK
  13719. 1324.98 s [vector] +++ OK, passed 100 tests.
  13720. 1324.98 s [vector] reverse: OK
  13721. 1324.98 s [vector] +++ OK, passed 100 tests.
  13722. 1324.98 s [vector] backpermute: OK
  13723. 1324.98 s [vector] +++ OK, passed 100 tests.
  13724. 1324.98 s [vector] map: OK
  13725. 1324.98 s [vector] +++ OK, passed 100 tests.
  13726. 1324.98 s [vector] imap: OK
  13727. 1324.98 s [vector] +++ OK, passed 100 tests.
  13728. 1324.98 s [vector] concatMap: OK
  13729. 1324.98 s [vector] +++ OK, passed 100 tests.
  13730. 1324.98 s [vector] mapM: OK
  13731. 1325.00 s [vector] +++ OK, passed 100 tests.
  13732. 1325.00 s [vector] mapM_: OK (0.01s)
  13733. 1325.00 s [vector] +++ OK, passed 100 tests.
  13734. 1325.00 s [vector] forM: OK
  13735. 1325.00 s [vector] +++ OK, passed 100 tests.
  13736. 1325.02 s [vector] forM_: OK (0.01s)
  13737. 1325.02 s [vector] +++ OK, passed 100 tests.
  13738. 1325.02 s [vector] imapM: OK
  13739. 1325.02 s [vector] +++ OK, passed 100 tests.
  13740. 1325.03 s [vector] imapM_: OK (0.02s)
  13741. 1325.03 s [vector] +++ OK, passed 100 tests.
  13742. 1325.03 s [vector] zipWith: OK
  13743. 1325.03 s [vector] +++ OK, passed 100 tests.
  13744. 1325.03 s [vector] zipWith3: OK
  13745. 1325.03 s [vector] +++ OK, passed 100 tests.
  13746. 1325.04 s [vector] izipWith: OK
  13747. 1325.04 s [vector] +++ OK, passed 100 tests.
  13748. 1325.04 s [vector] izipWith3: OK
  13749. 1325.04 s [vector] +++ OK, passed 100 tests.
  13750. 1325.04 s [vector] izipWithM: OK
  13751. 1325.04 s [vector] +++ OK, passed 100 tests.
  13752. 1325.04 s [vector] izipWithM_: OK
  13753. 1325.04 s [vector] +++ OK, passed 100 tests.
  13754. 1325.05 s [vector] zipWithM: OK
  13755. 1325.05 s [vector] +++ OK, passed 100 tests.
  13756. 1325.05 s [vector] zipWithM_: OK
  13757. 1325.05 s [vector] +++ OK, passed 100 tests.
  13758. 1325.05 s [vector] filter: OK
  13759. 1325.05 s [vector] +++ OK, passed 100 tests.
  13760. 1325.06 s [vector] ifilter: OK
  13761. 1325.06 s [vector] +++ OK, passed 100 tests.
  13762. 1325.08 s [vector] filterM: OK (0.02s)
  13763. 1325.08 s [vector] +++ OK, passed 100 tests.
  13764. 1325.08 s [vector] uniq: OK
  13765. 1325.08 s [vector] +++ OK, passed 100 tests.
  13766. 1325.08 s [vector] mapMaybe: OK
  13767. 1325.08 s [vector] +++ OK, passed 100 tests.
  13768. 1325.08 s [vector] imapMaybe: OK
  13769. 1325.08 s [vector] +++ OK, passed 100 tests.
  13770. 1325.08 s [vector] takeWhile: OK
  13771. 1325.08 s [vector] +++ OK, passed 100 tests.
  13772. 1325.08 s [vector] dropWhile: OK
  13773. 1325.08 s [vector] +++ OK, passed 100 tests.
  13774. 1325.08 s [vector] partition: OK
  13775. 1325.08 s [vector] +++ OK, passed 100 tests.
  13776. 1325.08 s [vector] partitionWith: OK
  13777. 1325.08 s [vector] +++ OK, passed 100 tests.
  13778. 1325.08 s [vector] span: OK
  13779. 1325.08 s [vector] +++ OK, passed 100 tests.
  13780. 1325.09 s [vector] break: OK
  13781. 1325.09 s [vector] +++ OK, passed 100 tests.
  13782. 1325.09 s [vector] spanR: OK
  13783. 1325.09 s [vector] +++ OK, passed 100 tests.
  13784. 1325.09 s [vector] breakR: OK
  13785. 1325.09 s [vector] +++ OK, passed 100 tests.
  13786. 1325.09 s [vector] groupBy: OK
  13787. 1325.09 s [vector] +++ OK, passed 100 tests.
  13788. 1325.09 s [vector] elem: OK
  13789. 1325.09 s [vector] +++ OK, passed 100 tests.
  13790. 1325.09 s [vector] notElem: OK
  13791. 1325.09 s [vector] +++ OK, passed 100 tests.
  13792. 1325.09 s [vector] find: OK
  13793. 1325.09 s [vector] +++ OK, passed 100 tests.
  13794. 1325.09 s [vector] findIndex: OK
  13795. 1325.09 s [vector] +++ OK, passed 100 tests.
  13796. 1325.09 s [vector] findIndexR: OK
  13797. 1325.09 s [vector] +++ OK, passed 100 tests.
  13798. 1325.09 s [vector] findIndices: OK
  13799. 1325.09 s [vector] +++ OK, passed 100 tests.
  13800. 1325.09 s [vector] elemIndex: OK
  13801. 1325.09 s [vector] +++ OK, passed 100 tests.
  13802. 1325.09 s [vector] elemIndices: OK
  13803. 1325.09 s [vector] +++ OK, passed 100 tests.
  13804. 1325.09 s [vector] foldl: OK
  13805. 1325.09 s [vector] +++ OK, passed 100 tests.
  13806. 1325.09 s [vector] foldl1: OK
  13807. 1325.09 s [vector] +++ OK, passed 100 tests; 12 discarded.
  13808. 1325.10 s [vector] foldl': OK
  13809. 1325.10 s [vector] +++ OK, passed 100 tests.
  13810. 1325.10 s [vector] foldl1': OK
  13811. 1325.10 s [vector] +++ OK, passed 100 tests; 19 discarded.
  13812. 1325.10 s [vector] foldr: OK
  13813. 1325.10 s [vector] +++ OK, passed 100 tests.
  13814. 1325.10 s [vector] foldr1: OK
  13815. 1325.10 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13816. 1325.10 s [vector] foldr': OK
  13817. 1325.10 s [vector] +++ OK, passed 100 tests.
  13818. 1325.10 s [vector] foldr1': OK
  13819. 1325.10 s [vector] +++ OK, passed 100 tests; 19 discarded.
  13820. 1325.10 s [vector] ifoldl: OK
  13821. 1325.10 s [vector] +++ OK, passed 100 tests.
  13822. 1325.10 s [vector] ifoldl': OK
  13823. 1325.10 s [vector] +++ OK, passed 100 tests.
  13824. 1325.10 s [vector] ifoldr: OK
  13825. 1325.10 s [vector] +++ OK, passed 100 tests.
  13826. 1325.10 s [vector] ifoldr': OK
  13827. 1325.10 s [vector] +++ OK, passed 100 tests.
  13828. 1325.10 s [vector] ifoldM: OK
  13829. 1325.10 s [vector] +++ OK, passed 100 tests.
  13830. 1325.12 s [vector] ifoldM': OK
  13831. 1325.12 s [vector] +++ OK, passed 100 tests.
  13832. 1325.12 s [vector] ifoldM_: OK (0.01s)
  13833. 1325.12 s [vector] +++ OK, passed 100 tests.
  13834. 1325.13 s [vector] ifoldM'_: OK (0.01s)
  13835. 1325.13 s [vector] +++ OK, passed 100 tests.
  13836. 1325.13 s [vector] all: OK
  13837. 1325.13 s [vector] +++ OK, passed 100 tests.
  13838. 1325.13 s [vector] any: OK
  13839. 1325.13 s [vector] +++ OK, passed 100 tests.
  13840. 1325.13 s [vector] prescanl: OK
  13841. 1325.13 s [vector] +++ OK, passed 100 tests.
  13842. 1325.13 s [vector] prescanl': OK
  13843. 1325.13 s [vector] +++ OK, passed 100 tests.
  13844. 1325.13 s [vector] postscanl: OK
  13845. 1325.13 s [vector] +++ OK, passed 100 tests.
  13846. 1325.14 s [vector] postscanl': OK
  13847. 1325.14 s [vector] +++ OK, passed 100 tests.
  13848. 1325.14 s [vector] scanl: OK
  13849. 1325.14 s [vector] +++ OK, passed 100 tests.
  13850. 1325.14 s [vector] scanl': OK
  13851. 1325.14 s [vector] +++ OK, passed 100 tests.
  13852. 1325.14 s [vector] scanl1: OK
  13853. 1325.14 s [vector] +++ OK, passed 100 tests.
  13854. 1325.14 s [vector] scanl1': OK
  13855. 1325.14 s [vector] +++ OK, passed 100 tests.
  13856. 1325.14 s [vector] iscanl: OK
  13857. 1325.14 s [vector] +++ OK, passed 100 tests.
  13858. 1325.14 s [vector] iscanl': OK
  13859. 1325.14 s [vector] +++ OK, passed 100 tests.
  13860. 1325.14 s [vector] prescanr: OK
  13861. 1325.14 s [vector] +++ OK, passed 100 tests.
  13862. 1325.15 s [vector] prescanr': OK
  13863. 1325.15 s [vector] +++ OK, passed 100 tests.
  13864. 1325.15 s [vector] postscanr: OK
  13865. 1325.15 s [vector] +++ OK, passed 100 tests.
  13866. 1325.15 s [vector] postscanr': OK
  13867. 1325.15 s [vector] +++ OK, passed 100 tests.
  13868. 1325.15 s [vector] scanr: OK
  13869. 1325.15 s [vector] +++ OK, passed 100 tests.
  13870. 1325.15 s [vector] scanr': OK
  13871. 1325.15 s [vector] +++ OK, passed 100 tests.
  13872. 1325.15 s [vector] scanr1: OK
  13873. 1325.15 s [vector] +++ OK, passed 100 tests.
  13874. 1325.15 s [vector] scanr1': OK
  13875. 1325.15 s [vector] +++ OK, passed 100 tests.
  13876. 1325.15 s [vector] iscanr: OK
  13877. 1325.16 s [vector] +++ OK, passed 100 tests.
  13878. 1325.16 s [vector] iscanr': OK
  13879. 1325.16 s [vector] +++ OK, passed 100 tests.
  13880. 1325.16 s [vector] mut_read: OK
  13881. 1325.16 s [vector] +++ OK, passed 100 tests; 19 discarded.
  13882. 1325.16 s [vector] mut_write: OK
  13883. 1325.16 s [vector] +++ OK, passed 100 tests; 25 discarded.
  13884. 1325.16 s [vector] mut_modify: OK
  13885. 1325.16 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13886. 1325.16 s [vector] mut_generate: OK
  13887. 1325.16 s [vector] +++ OK, passed 100 tests.
  13888. 1325.18 s [vector] mut_generateM: OK
  13889. 1325.18 s [vector] +++ OK, passed 100 tests.
  13890. 1325.18 s [vector] mut_mapM_: OK
  13891. 1325.18 s [vector] +++ OK, passed 100 tests.
  13892. 1325.20 s [vector] mut_imapM_: OK (0.01s)
  13893. 1325.20 s [vector] +++ OK, passed 100 tests.
  13894. 1325.20 s [vector] mut_forM_: OK (0.01s)
  13895. 1325.20 s [vector] +++ OK, passed 100 tests.
  13896. 1325.21 s [vector] mut_iforM_: OK (0.01s)
  13897. 1325.21 s [vector] +++ OK, passed 100 tests.
  13898. 1325.21 s [vector] mut_foldr: OK
  13899. 1325.21 s [vector] +++ OK, passed 100 tests.
  13900. 1325.21 s [vector] mut_foldr': OK
  13901. 1325.22 s [vector] +++ OK, passed 100 tests.
  13902. 1325.22 s [vector] mut_foldl: OK
  13903. 1325.22 s [vector] +++ OK, passed 100 tests.
  13904. 1325.22 s [vector] mut_foldl': OK
  13905. 1325.22 s [vector] +++ OK, passed 100 tests.
  13906. 1325.22 s [vector] mut_ifoldr: OK
  13907. 1325.22 s [vector] +++ OK, passed 100 tests.
  13908. 1325.22 s [vector] mut_ifoldr': OK
  13909. 1325.22 s [vector] +++ OK, passed 100 tests.
  13910. 1325.22 s [vector] mut_ifoldl: OK
  13911. 1325.22 s [vector] +++ OK, passed 100 tests.
  13912. 1325.22 s [vector] mut_ifoldl': OK
  13913. 1325.22 s [vector] +++ OK, passed 100 tests.
  13914. 1325.22 s [vector] mut_foldM: OK
  13915. 1325.22 s [vector] +++ OK, passed 100 tests.
  13916. 1325.22 s [vector] mut_foldM': OK
  13917. 1325.22 s [vector] +++ OK, passed 100 tests.
  13918. 1325.22 s [vector] mut_foldrM: OK
  13919. 1325.22 s [vector] +++ OK, passed 100 tests.
  13920. 1325.22 s [vector] mut_foldrM': OK
  13921. 1325.22 s [vector] +++ OK, passed 100 tests.
  13922. 1325.22 s [vector] mut_ifoldM: OK
  13923. 1325.22 s [vector] +++ OK, passed 100 tests.
  13924. 1325.22 s [vector] mut_ifoldM': OK
  13925. 1325.22 s [vector] +++ OK, passed 100 tests.
  13926. 1325.22 s [vector] mut_ifoldrM: OK
  13927. 1325.22 s [vector] +++ OK, passed 100 tests.
  13928. 1325.23 s [vector] mut_ifoldrM': OK
  13929. 1325.23 s [vector] +++ OK, passed 100 tests.
  13930. 1325.23 s [vector] compare: OK
  13931. 1325.23 s [vector] +++ OK, passed 100 tests.
  13932. 1325.23 s [vector] maximum: OK
  13933. 1325.23 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13934. 1325.23 s [vector] minimum: OK
  13935. 1325.23 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13936. 1325.23 s [vector] minIndex: OK
  13937. 1325.23 s [vector] +++ OK, passed 100 tests; 19 discarded.
  13938. 1325.23 s [vector] maxIndex: OK
  13939. 1325.23 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13940. 1325.23 s [vector] maximumBy: OK
  13941. 1325.23 s [vector] +++ OK, passed 100 tests; 21 discarded.
  13942. 1325.23 s [vector] minimumBy: OK
  13943. 1325.23 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13944. 1325.23 s [vector] maximumOn: OK
  13945. 1325.23 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13946. 1325.23 s [vector] minimumOn: OK
  13947. 1325.23 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13948. 1325.23 s [vector] maxIndexBy: OK
  13949. 1325.23 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13950. 1325.23 s [vector] minIndexBy: OK
  13951. 1325.23 s [vector] +++ OK, passed 100 tests; 20 discarded.
  13952. 1325.24 s [vector] ListFirstMaxIndexWins: OK
  13953. 1325.24 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13954. 1325.24 s [vector] FalseListFirstMaxIndexWins: OK
  13955. 1325.24 s [vector] +++ OK, failed as expected. (after 1 test):
  13956. 1325.24 s [vector] Exception:
  13957. 1325.24 s [vector] Prelude.foldr1: empty list
  13958. 1325.24 s [vector] CallStack (from HasCallStack):
  13959. 1325.24 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  13960. 1325.24 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  13961. 1325.24 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  13962. 1325.24 s [vector] []
  13963. 1325.24 s [vector] zip: OK
  13964. 1325.24 s [vector] +++ OK, passed 100 tests.
  13965. 1325.24 s [vector] zip3: OK
  13966. 1325.24 s [vector] +++ OK, passed 100 tests.
  13967. 1325.25 s [vector] unzip: OK
  13968. 1325.25 s [vector] +++ OK, passed 100 tests.
  13969. 1325.25 s [vector] unzip3: OK
  13970. 1325.25 s [vector] +++ OK, passed 100 tests.
  13971. 1325.25 s [vector] indexed: OK
  13972. 1325.25 s [vector] +++ OK, passed 100 tests.
  13973. 1325.26 s [vector] update: OK
  13974. 1325.26 s [vector] +++ OK, passed 100 tests.
  13975. 1325.26 s [vector] mempty: OK
  13976. 1325.26 s [vector] +++ OK, passed 100 tests.
  13977. 1325.26 s [vector] mappend: OK
  13978. 1325.26 s [vector] +++ OK, passed 100 tests.
  13979. 1325.26 s [vector] mconcat: OK
  13980. 1325.26 s [vector] +++ OK, passed 100 tests.
  13981. 1325.26 s [vector] glength: OK
  13982. 1325.26 s [vector] +++ OK, passed 100 tests.
  13983. 1325.26 s [vector] (Bool)
  13984. 1325.26 s [vector] fromList.toList == id: OK
  13985. 1325.26 s [vector] +++ OK, passed 100 tests.
  13986. 1325.26 s [vector] toList.fromList == id: OK
  13987. 1325.26 s [vector] +++ OK, passed 100 tests.
  13988. 1325.26 s [vector] unstream.stream == id: OK
  13989. 1325.26 s [vector] +++ OK, passed 100 tests.
  13990. 1325.26 s [vector] stream.unstream == id: OK
  13991. 1325.26 s [vector] +++ OK, passed 100 tests.
  13992. 1325.26 s [vector] eq: OK
  13993. 1325.26 s [vector] +++ OK, passed 100 tests.
  13994. 1325.26 s [vector] length: OK
  13995. 1325.26 s [vector] +++ OK, passed 100 tests.
  13996. 1325.26 s [vector] null: OK
  13997. 1325.26 s [vector] +++ OK, passed 100 tests.
  13998. 1325.26 s [vector] index: OK
  13999. 1325.26 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14000. 1325.26 s [vector] safeIndex: OK
  14001. 1325.27 s [vector] +++ OK, passed 100 tests.
  14002. 1325.27 s [vector] head: OK
  14003. 1325.27 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14004. 1325.27 s [vector] last: OK
  14005. 1325.27 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14006. 1325.27 s [vector] unsafeIndex: OK
  14007. 1325.27 s [vector] +++ OK, passed 100 tests; 19 discarded.
  14008. 1325.27 s [vector] unsafeHead: OK
  14009. 1325.27 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14010. 1325.27 s [vector] unsafeLast: OK
  14011. 1325.27 s [vector] +++ OK, passed 100 tests; 13 discarded.
  14012. 1325.27 s [vector] slice: OK
  14013. 1325.27 s [vector] +++ OK, passed 100 tests.
  14014. 1325.27 s [vector] init: OK
  14015. 1325.27 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14016. 1325.27 s [vector] tail: OK
  14017. 1325.27 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14018. 1325.27 s [vector] take: OK
  14019. 1325.27 s [vector] +++ OK, passed 100 tests.
  14020. 1325.27 s [vector] drop: OK
  14021. 1325.27 s [vector] +++ OK, passed 100 tests.
  14022. 1325.27 s [vector] splitAt: OK
  14023. 1325.27 s [vector] +++ OK, passed 100 tests.
  14024. 1325.28 s [vector] empty: OK
  14025. 1325.28 s [vector] +++ OK, passed 100 tests.
  14026. 1325.28 s [vector] singleton: OK
  14027. 1325.28 s [vector] +++ OK, passed 100 tests.
  14028. 1325.28 s [vector] replicate: OK
  14029. 1325.28 s [vector] +++ OK, passed 100 tests.
  14030. 1325.28 s [vector] generate: OK
  14031. 1325.28 s [vector] +++ OK, passed 100 tests.
  14032. 1325.28 s [vector] iterateN: OK
  14033. 1325.28 s [vector] +++ OK, passed 100 tests.
  14034. 1325.30 s [vector] iterateNM: OK (0.02s)
  14035. 1325.30 s [vector] +++ OK, passed 100 tests.
  14036. 1325.34 s [vector] generateM: OK (0.03s)
  14037. 1325.34 s [vector] +++ OK, passed 100 tests.
  14038. 1325.34 s [vector] replicateM: OK (0.01s)
  14039. 1325.34 s [vector] +++ OK, passed 100 tests.
  14040. 1325.34 s [vector] create: OK
  14041. 1325.34 s [vector] +++ OK, passed 100 tests.
  14042. 1325.34 s [vector] createT: OK
  14043. 1325.34 s [vector] +++ OK, passed 100 tests.
  14044. 1325.34 s [vector] unfoldr: OK
  14045. 1325.34 s [vector] +++ OK, passed 100 tests.
  14046. 1325.34 s [vector] unfoldrN: OK
  14047. 1325.34 s [vector] +++ OK, passed 100 tests.
  14048. 1325.34 s [vector] unfoldrExactN: OK
  14049. 1325.34 s [vector] +++ OK, passed 100 tests.
  14050. 1325.35 s [vector] unfoldrM: OK
  14051. 1325.35 s [vector] +++ OK, passed 100 tests.
  14052. 1325.36 s [vector] unfoldrNM: OK
  14053. 1325.36 s [vector] +++ OK, passed 100 tests.
  14054. 1325.39 s [vector] unfoldrExactNM: OK (0.04s)
  14055. 1325.39 s [vector] +++ OK, passed 100 tests.
  14056. 1325.39 s [vector] constructN: OK
  14057. 1325.39 s [vector] +++ OK, passed 100 tests.
  14058. 1325.40 s [vector] constructrN: OK
  14059. 1325.40 s [vector] +++ OK, passed 100 tests.
  14060. 1325.40 s [vector] cons: OK
  14061. 1325.40 s [vector] +++ OK, passed 100 tests.
  14062. 1325.40 s [vector] snoc: OK
  14063. 1325.40 s [vector] +++ OK, passed 100 tests.
  14064. 1325.42 s [vector] append: OK
  14065. 1325.42 s [vector] +++ OK, passed 100 tests.
  14066. 1325.43 s [vector] concat: OK (0.03s)
  14067. 1325.72 s [vector] +++ OK, passed 100 tests.
  14068. 1325.72 s [vector] force: OK
  14069. 1325.72 s [vector] +++ OK, passed 100 tests.
  14070. 1325.72 s [vector] upd: OK
  14071. 1325.72 s [vector] +++ OK, passed 100 tests.
  14072. 1325.72 s [vector] accum: OK
  14073. 1325.72 s [vector] +++ OK, passed 100 tests.
  14074. 1325.72 s [vector] reverse: OK
  14075. 1325.72 s [vector] +++ OK, passed 100 tests.
  14076. 1325.72 s [vector] backpermute: OK
  14077. 1325.72 s [vector] +++ OK, passed 100 tests.
  14078. 1325.72 s [vector] map: OK
  14079. 1325.72 s [vector] +++ OK, passed 100 tests.
  14080. 1325.72 s [vector] imap: OK
  14081. 1325.72 s [vector] +++ OK, passed 100 tests.
  14082. 1325.72 s [vector] concatMap: OK
  14083. 1325.72 s [vector] +++ OK, passed 100 tests.
  14084. 1325.72 s [vector] mapM: OK
  14085. 1325.72 s [vector] +++ OK, passed 100 tests.
  14086. 1325.72 s [vector] mapM_: OK (0.02s)
  14087. 1325.72 s [vector] +++ OK, passed 100 tests.
  14088. 1325.72 s [vector] forM: OK
  14089. 1325.72 s [vector] +++ OK, passed 100 tests.
  14090. 1325.72 s [vector] forM_: OK (0.02s)
  14091. 1325.72 s [vector] +++ OK, passed 100 tests.
  14092. 1325.72 s [vector] imapM: OK
  14093. 1325.72 s [vector] +++ OK, passed 100 tests.
  14094. 1325.72 s [vector] imapM_: OK (0.02s)
  14095. 1325.72 s [vector] +++ OK, passed 100 tests.
  14096. 1325.72 s [vector] zipWith: OK
  14097. 1325.72 s [vector] +++ OK, passed 100 tests.
  14098. 1325.72 s [vector] zipWith3: OK
  14099. 1325.72 s [vector] +++ OK, passed 100 tests.
  14100. 1325.72 s [vector] izipWith: OK
  14101. 1325.72 s [vector] +++ OK, passed 100 tests.
  14102. 1325.72 s [vector] izipWith3: OK
  14103. 1325.72 s [vector] +++ OK, passed 100 tests.
  14104. 1325.72 s [vector] izipWithM: OK
  14105. 1325.72 s [vector] +++ OK, passed 100 tests.
  14106. 1325.72 s [vector] izipWithM_: OK (0.01s)
  14107. 1325.72 s [vector] +++ OK, passed 100 tests.
  14108. 1325.72 s [vector] zipWithM: OK
  14109. 1325.72 s [vector] +++ OK, passed 100 tests.
  14110. 1325.72 s [vector] zipWithM_: OK (0.01s)
  14111. 1325.72 s [vector] +++ OK, passed 100 tests.
  14112. 1325.72 s [vector] filter: OK
  14113. 1325.72 s [vector] +++ OK, passed 100 tests.
  14114. 1325.72 s [vector] ifilter: OK
  14115. 1325.72 s [vector] +++ OK, passed 100 tests.
  14116. 1325.72 s [vector] filterM: OK (0.04s)
  14117. 1325.72 s [vector] +++ OK, passed 100 tests.
  14118. 1325.72 s [vector] uniq: OK
  14119. 1325.72 s [vector] +++ OK, passed 100 tests.
  14120. 1325.72 s [vector] mapMaybe: OK
  14121. 1325.72 s [vector] +++ OK, passed 100 tests.
  14122. 1325.72 s [vector] imapMaybe: OK
  14123. 1325.72 s [vector] +++ OK, passed 100 tests.
  14124. 1325.72 s [vector] takeWhile: OK
  14125. 1325.72 s [vector] +++ OK, passed 100 tests.
  14126. 1325.72 s [vector] dropWhile: OK
  14127. 1325.72 s [vector] +++ OK, passed 100 tests.
  14128. 1325.72 s [vector] partition: OK
  14129. 1325.72 s [vector] +++ OK, passed 100 tests.
  14130. 1325.72 s [vector] partitionWith: OK
  14131. 1325.72 s [vector] +++ OK, passed 100 tests.
  14132. 1325.72 s [vector] span: OK
  14133. 1325.72 s [vector] +++ OK, passed 100 tests.
  14134. 1325.72 s [vector] break: OK
  14135. 1325.72 s [vector] +++ OK, passed 100 tests.
  14136. 1325.72 s [vector] spanR: OK
  14137. 1325.72 s [vector] +++ OK, passed 100 tests.
  14138. 1325.72 s [vector] breakR: OK
  14139. 1325.72 s [vector] +++ OK, passed 100 tests.
  14140. 1325.72 s [vector] groupBy: OK
  14141. 1325.72 s [vector] +++ OK, passed 100 tests.
  14142. 1325.72 s [vector] elem: OK
  14143. 1325.72 s [vector] +++ OK, passed 100 tests.
  14144. 1325.72 s [vector] notElem: OK
  14145. 1325.72 s [vector] +++ OK, passed 100 tests.
  14146. 1325.72 s [vector] find: OK
  14147. 1325.72 s [vector] +++ OK, passed 100 tests.
  14148. 1325.72 s [vector] findIndex: OK
  14149. 1325.72 s [vector] +++ OK, passed 100 tests.
  14150. 1325.72 s [vector] findIndexR: OK
  14151. 1325.72 s [vector] +++ OK, passed 100 tests.
  14152. 1325.72 s [vector] findIndices: OK
  14153. 1325.72 s [vector] +++ OK, passed 100 tests.
  14154. 1325.72 s [vector] elemIndex: OK
  14155. 1325.72 s [vector] +++ OK, passed 100 tests.
  14156. 1325.73 s [vector] elemIndices: OK
  14157. 1325.73 s [vector] +++ OK, passed 100 tests.
  14158. 1325.73 s [vector] foldl: OK
  14159. 1325.73 s [vector] +++ OK, passed 100 tests.
  14160. 1325.73 s [vector] foldl1: OK
  14161. 1325.73 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14162. 1325.73 s [vector] foldl': OK
  14163. 1325.73 s [vector] +++ OK, passed 100 tests.
  14164. 1325.73 s [vector] foldl1': OK
  14165. 1325.73 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14166. 1325.73 s [vector] foldr: OK
  14167. 1325.73 s [vector] +++ OK, passed 100 tests.
  14168. 1325.73 s [vector] foldr1: OK
  14169. 1325.73 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14170. 1325.73 s [vector] foldr': OK
  14171. 1325.73 s [vector] +++ OK, passed 100 tests.
  14172. 1325.73 s [vector] foldr1': OK
  14173. 1325.73 s [vector] +++ OK, passed 100 tests; 11 discarded.
  14174. 1325.73 s [vector] ifoldl: OK
  14175. 1325.73 s [vector] +++ OK, passed 100 tests.
  14176. 1325.73 s [vector] ifoldl': OK
  14177. 1325.73 s [vector] +++ OK, passed 100 tests.
  14178. 1325.73 s [vector] ifoldr: OK
  14179. 1325.73 s [vector] +++ OK, passed 100 tests.
  14180. 1325.73 s [vector] ifoldr': OK
  14181. 1325.73 s [vector] +++ OK, passed 100 tests.
  14182. 1325.73 s [vector] ifoldM: OK
  14183. 1325.73 s [vector] +++ OK, passed 100 tests.
  14184. 1325.73 s [vector] ifoldM': OK
  14185. 1325.73 s [vector] +++ OK, passed 100 tests.
  14186. 1325.73 s [vector] ifoldM_: OK
  14187. 1325.73 s [vector] +++ OK, passed 100 tests.
  14188. 1325.73 s [vector] ifoldM'_: OK
  14189. 1325.73 s [vector] +++ OK, passed 100 tests.
  14190. 1325.73 s [vector] all: OK
  14191. 1325.73 s [vector] +++ OK, passed 100 tests.
  14192. 1325.73 s [vector] any: OK
  14193. 1325.73 s [vector] +++ OK, passed 100 tests.
  14194. 1325.73 s [vector] prescanl: OK
  14195. 1325.73 s [vector] +++ OK, passed 100 tests.
  14196. 1325.73 s [vector] prescanl': OK
  14197. 1325.73 s [vector] +++ OK, passed 100 tests.
  14198. 1325.73 s [vector] postscanl: OK
  14199. 1325.73 s [vector] +++ OK, passed 100 tests.
  14200. 1325.73 s [vector] postscanl': OK
  14201. 1325.73 s [vector] +++ OK, passed 100 tests.
  14202. 1325.73 s [vector] scanl: OK
  14203. 1325.73 s [vector] +++ OK, passed 100 tests.
  14204. 1325.73 s [vector] scanl': OK
  14205. 1325.73 s [vector] +++ OK, passed 100 tests.
  14206. 1325.73 s [vector] scanl1: OK
  14207. 1325.73 s [vector] +++ OK, passed 100 tests.
  14208. 1325.73 s [vector] scanl1': OK
  14209. 1325.73 s [vector] +++ OK, passed 100 tests.
  14210. 1325.73 s [vector] iscanl: OK
  14211. 1325.73 s [vector] +++ OK, passed 100 tests.
  14212. 1325.73 s [vector] iscanl': OK
  14213. 1325.73 s [vector] +++ OK, passed 100 tests.
  14214. 1325.73 s [vector] prescanr: OK
  14215. 1325.73 s [vector] +++ OK, passed 100 tests.
  14216. 1325.73 s [vector] prescanr': OK
  14217. 1325.73 s [vector] +++ OK, passed 100 tests.
  14218. 1325.73 s [vector] postscanr: OK
  14219. 1325.73 s [vector] +++ OK, passed 100 tests.
  14220. 1325.73 s [vector] postscanr': OK
  14221. 1325.73 s [vector] +++ OK, passed 100 tests.
  14222. 1325.73 s [vector] scanr: OK
  14223. 1325.73 s [vector] +++ OK, passed 100 tests.
  14224. 1325.73 s [vector] scanr': OK
  14225. 1325.73 s [vector] +++ OK, passed 100 tests.
  14226. 1325.73 s [vector] scanr1: OK
  14227. 1325.73 s [vector] +++ OK, passed 100 tests.
  14228. 1325.73 s [vector] scanr1': OK
  14229. 1325.73 s [vector] +++ OK, passed 100 tests.
  14230. 1325.73 s [vector] iscanr: OK
  14231. 1325.73 s [vector] +++ OK, passed 100 tests.
  14232. 1325.73 s [vector] iscanr': OK
  14233. 1325.73 s [vector] +++ OK, passed 100 tests.
  14234. 1325.73 s [vector] mut_read: OK
  14235. 1325.73 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14236. 1325.73 s [vector] mut_write: OK
  14237. 1325.73 s [vector] +++ OK, passed 100 tests; 13 discarded.
  14238. 1325.73 s [vector] mut_modify: OK
  14239. 1325.73 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14240. 1325.73 s [vector] mut_generate: OK
  14241. 1325.73 s [vector] +++ OK, passed 100 tests.
  14242. 1325.73 s [vector] mut_generateM: OK
  14243. 1325.73 s [vector] +++ OK, passed 100 tests.
  14244. 1325.74 s [vector] mut_mapM_: OK (0.01s)
  14245. 1325.74 s [vector] +++ OK, passed 100 tests.
  14246. 1325.74 s [vector] mut_imapM_: OK (0.01s)
  14247. 1325.74 s [vector] +++ OK, passed 100 tests.
  14248. 1325.76 s [vector] mut_forM_: OK (0.01s)
  14249. 1325.76 s [vector] +++ OK, passed 100 tests.
  14250. 1325.76 s [vector] mut_iforM_: OK
  14251. 1325.76 s [vector] +++ OK, passed 100 tests.
  14252. 1325.76 s [vector] mut_foldr: OK
  14253. 1325.76 s [vector] +++ OK, passed 100 tests.
  14254. 1325.76 s [vector] mut_foldr': OK
  14255. 1325.76 s [vector] +++ OK, passed 100 tests.
  14256. 1325.77 s [vector] mut_foldl: OK
  14257. 1325.77 s [vector] +++ OK, passed 100 tests.
  14258. 1325.77 s [vector] mut_foldl': OK
  14259. 1325.77 s [vector] +++ OK, passed 100 tests.
  14260. 1325.77 s [vector] mut_ifoldr: OK
  14261. 1325.77 s [vector] +++ OK, passed 100 tests.
  14262. 1325.77 s [vector] mut_ifoldr': OK
  14263. 1325.77 s [vector] +++ OK, passed 100 tests.
  14264. 1325.77 s [vector] mut_ifoldl: OK
  14265. 1325.78 s [vector] +++ OK, passed 100 tests.
  14266. 1325.78 s [vector] mut_ifoldl': OK
  14267. 1325.78 s [vector] +++ OK, passed 100 tests.
  14268. 1325.78 s [vector] mut_foldM: OK
  14269. 1325.78 s [vector] +++ OK, passed 100 tests.
  14270. 1325.78 s [vector] mut_foldM': OK
  14271. 1325.78 s [vector] +++ OK, passed 100 tests.
  14272. 1325.78 s [vector] mut_foldrM: OK
  14273. 1325.78 s [vector] +++ OK, passed 100 tests.
  14274. 1325.79 s [vector] mut_foldrM': OK
  14275. 1325.79 s [vector] +++ OK, passed 100 tests.
  14276. 1325.79 s [vector] mut_ifoldM: OK
  14277. 1325.79 s [vector] +++ OK, passed 100 tests.
  14278. 1325.79 s [vector] mut_ifoldM': OK
  14279. 1325.79 s [vector] +++ OK, passed 100 tests.
  14280. 1325.79 s [vector] mut_ifoldrM: OK
  14281. 1325.80 s [vector] +++ OK, passed 100 tests.
  14282. 1325.80 s [vector] mut_ifoldrM': OK
  14283. 1325.80 s [vector] +++ OK, passed 100 tests.
  14284. 1325.80 s [vector] compare: OK
  14285. 1325.80 s [vector] +++ OK, passed 100 tests.
  14286. 1325.80 s [vector] maximum: OK
  14287. 1325.80 s [vector] +++ OK, passed 100 tests; 12 discarded.
  14288. 1325.80 s [vector] minimum: OK
  14289. 1325.80 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14290. 1325.80 s [vector] minIndex: OK
  14291. 1325.80 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14292. 1325.80 s [vector] maxIndex: OK
  14293. 1325.80 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14294. 1325.80 s [vector] maximumBy: OK
  14295. 1325.80 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14296. 1325.80 s [vector] minimumBy: OK
  14297. 1325.80 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14298. 1325.80 s [vector] maximumOn: OK
  14299. 1325.80 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14300. 1325.80 s [vector] minimumOn: OK
  14301. 1325.80 s [vector] +++ OK, passed 100 tests; 22 discarded.
  14302. 1325.80 s [vector] maxIndexBy: OK
  14303. 1325.80 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14304. 1325.80 s [vector] minIndexBy: OK
  14305. 1325.80 s [vector] +++ OK, passed 100 tests; 19 discarded.
  14306. 1325.80 s [vector] ListFirstMaxIndexWins: OK
  14307. 1325.80 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14308. 1325.81 s [vector] FalseListFirstMaxIndexWins: OK
  14309. 1325.81 s [vector] +++ OK, failed as expected. (after 1 test):
  14310. 1325.81 s [vector] Exception:
  14311. 1325.81 s [vector] Prelude.foldr1: empty list
  14312. 1325.81 s [vector] CallStack (from HasCallStack):
  14313. 1325.81 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  14314. 1325.81 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  14315. 1325.81 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  14316. 1325.81 s [vector] []
  14317. 1325.81 s [vector] zip: OK
  14318. 1325.81 s [vector] +++ OK, passed 100 tests.
  14319. 1325.81 s [vector] zip3: OK
  14320. 1325.81 s [vector] +++ OK, passed 100 tests.
  14321. 1325.82 s [vector] unzip: OK
  14322. 1325.82 s [vector] +++ OK, passed 100 tests.
  14323. 1325.82 s [vector] unzip3: OK
  14324. 1325.82 s [vector] +++ OK, passed 100 tests.
  14325. 1325.82 s [vector] indexed: OK
  14326. 1325.82 s [vector] +++ OK, passed 100 tests.
  14327. 1325.82 s [vector] update: OK
  14328. 1325.82 s [vector] +++ OK, passed 100 tests.
  14329. 1325.82 s [vector] mempty: OK
  14330. 1325.82 s [vector] +++ OK, passed 100 tests.
  14331. 1325.82 s [vector] mappend: OK
  14332. 1325.82 s [vector] +++ OK, passed 100 tests.
  14333. 1325.84 s [vector] mconcat: OK (0.02s)
  14334. 1325.84 s [vector] +++ OK, passed 100 tests.
  14335. 1325.84 s [vector] glength: OK
  14336. 1325.84 s [vector] +++ OK, passed 100 tests.
  14337. 1325.84 s [vector] and: OK
  14338. 1325.84 s [vector] +++ OK, passed 100 tests.
  14339. 1325.84 s [vector] or: OK
  14340. 1325.84 s [vector] +++ OK, passed 100 tests.
  14341. 1325.84 s [vector] (Int)
  14342. 1325.84 s [vector] fromList.toList == id: OK
  14343. 1325.84 s [vector] +++ OK, passed 100 tests.
  14344. 1325.84 s [vector] toList.fromList == id: OK
  14345. 1325.84 s [vector] +++ OK, passed 100 tests.
  14346. 1325.84 s [vector] unstream.stream == id: OK
  14347. 1325.84 s [vector] +++ OK, passed 100 tests.
  14348. 1325.85 s [vector] stream.unstream == id: OK
  14349. 1325.85 s [vector] +++ OK, passed 100 tests.
  14350. 1325.85 s [vector] eq: OK
  14351. 1325.85 s [vector] +++ OK, passed 100 tests.
  14352. 1325.85 s [vector] length: OK
  14353. 1325.85 s [vector] +++ OK, passed 100 tests.
  14354. 1325.85 s [vector] null: OK
  14355. 1325.85 s [vector] +++ OK, passed 100 tests.
  14356. 1325.85 s [vector] index: OK
  14357. 1325.85 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14358. 1325.85 s [vector] safeIndex: OK
  14359. 1325.85 s [vector] +++ OK, passed 100 tests.
  14360. 1325.85 s [vector] head: OK
  14361. 1325.85 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14362. 1325.85 s [vector] last: OK
  14363. 1325.85 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14364. 1325.85 s [vector] unsafeIndex: OK
  14365. 1325.85 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14366. 1325.85 s [vector] unsafeHead: OK
  14367. 1325.85 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14368. 1325.85 s [vector] unsafeLast: OK
  14369. 1325.85 s [vector] +++ OK, passed 100 tests; 21 discarded.
  14370. 1325.85 s [vector] slice: OK
  14371. 1325.85 s [vector] +++ OK, passed 100 tests.
  14372. 1325.85 s [vector] init: OK
  14373. 1325.85 s [vector] +++ OK, passed 100 tests; 12 discarded.
  14374. 1325.86 s [vector] tail: OK
  14375. 1325.86 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14376. 1325.86 s [vector] take: OK
  14377. 1325.86 s [vector] +++ OK, passed 100 tests.
  14378. 1325.86 s [vector] drop: OK
  14379. 1325.86 s [vector] +++ OK, passed 100 tests.
  14380. 1325.86 s [vector] splitAt: OK
  14381. 1325.86 s [vector] +++ OK, passed 100 tests.
  14382. 1325.86 s [vector] empty: OK
  14383. 1325.86 s [vector] +++ OK, passed 100 tests.
  14384. 1325.86 s [vector] singleton: OK
  14385. 1325.86 s [vector] +++ OK, passed 100 tests.
  14386. 1325.86 s [vector] replicate: OK
  14387. 1325.86 s [vector] +++ OK, passed 100 tests.
  14388. 1325.86 s [vector] generate: OK
  14389. 1325.86 s [vector] +++ OK, passed 100 tests.
  14390. 1325.86 s [vector] iterateN: OK
  14391. 1325.86 s [vector] +++ OK, passed 100 tests.
  14392. 1325.90 s [vector] iterateNM: OK (0.02s)
  14393. 1325.90 s [vector] +++ OK, passed 100 tests.
  14394. 1325.92 s [vector] generateM: OK (0.04s)
  14395. 1325.92 s [vector] +++ OK, passed 100 tests.
  14396. 1325.93 s [vector] replicateM: OK (0.02s)
  14397. 1325.93 s [vector] +++ OK, passed 100 tests.
  14398. 1325.93 s [vector] create: OK
  14399. 1325.93 s [vector] +++ OK, passed 100 tests.
  14400. 1325.93 s [vector] createT: OK
  14401. 1325.93 s [vector] +++ OK, passed 100 tests.
  14402. 1325.94 s [vector] unfoldr: OK
  14403. 1325.94 s [vector] +++ OK, passed 100 tests.
  14404. 1325.94 s [vector] unfoldrN: OK
  14405. 1325.94 s [vector] +++ OK, passed 100 tests.
  14406. 1325.94 s [vector] unfoldrExactN: OK
  14407. 1325.94 s [vector] +++ OK, passed 100 tests.
  14408. 1325.95 s [vector] unfoldrM: OK
  14409. 1325.95 s [vector] +++ OK, passed 100 tests.
  14410. 1325.96 s [vector] unfoldrNM: OK
  14411. 1325.96 s [vector] +++ OK, passed 100 tests.
  14412. 1325.98 s [vector] unfoldrExactNM: OK (0.03s)
  14413. 1325.98 s [vector] +++ OK, passed 100 tests.
  14414. 1325.98 s [vector] constructN: OK
  14415. 1325.99 s [vector] +++ OK, passed 100 tests.
  14416. 1325.99 s [vector] constructrN: OK
  14417. 1325.99 s [vector] +++ OK, passed 100 tests.
  14418. 1326.00 s [vector] cons: OK
  14419. 1326.00 s [vector] +++ OK, passed 100 tests.
  14420. 1326.01 s [vector] snoc: OK
  14421. 1326.01 s [vector] +++ OK, passed 100 tests.
  14422. 1326.01 s [vector] append: OK
  14423. 1326.01 s [vector] +++ OK, passed 100 tests.
  14424. 1326.01 s [vector] concat: OK (0.02s)
  14425. 1326.01 s [vector] +++ OK, passed 100 tests.
  14426. 1326.01 s [vector] force: OK
  14427. 1326.01 s [vector] +++ OK, passed 100 tests.
  14428. 1326.02 s [vector] upd: OK
  14429. 1326.02 s [vector] +++ OK, passed 100 tests.
  14430. 1326.02 s [vector] accum: OK
  14431. 1326.02 s [vector] +++ OK, passed 100 tests.
  14432. 1326.02 s [vector] reverse: OK
  14433. 1326.02 s [vector] +++ OK, passed 100 tests.
  14434. 1326.02 s [vector] backpermute: OK
  14435. 1326.02 s [vector] +++ OK, passed 100 tests.
  14436. 1326.03 s [vector] map: OK
  14437. 1326.03 s [vector] +++ OK, passed 100 tests.
  14438. 1326.03 s [vector] imap: OK
  14439. 1326.04 s [vector] +++ OK, passed 100 tests.
  14440. 1326.04 s [vector] concatMap: OK
  14441. 1326.04 s [vector] +++ OK, passed 100 tests.
  14442. 1326.04 s [vector] mapM: OK
  14443. 1326.04 s [vector] +++ OK, passed 100 tests.
  14444. 1326.05 s [vector] mapM_: OK (0.02s)
  14445. 1326.05 s [vector] +++ OK, passed 100 tests.
  14446. 1326.06 s [vector] forM: OK
  14447. 1326.06 s [vector] +++ OK, passed 100 tests.
  14448. 1326.07 s [vector] forM_: OK (0.02s)
  14449. 1326.07 s [vector] +++ OK, passed 100 tests.
  14450. 1326.08 s [vector] imapM: OK
  14451. 1326.08 s [vector] +++ OK, passed 100 tests.
  14452. 1326.09 s [vector] imapM_: OK (0.02s)
  14453. 1326.09 s [vector] +++ OK, passed 100 tests.
  14454. 1326.09 s [vector] zipWith: OK
  14455. 1326.09 s [vector] +++ OK, passed 100 tests.
  14456. 1326.09 s [vector] zipWith3: OK
  14457. 1326.09 s [vector] +++ OK, passed 100 tests.
  14458. 1326.10 s [vector] izipWith: OK
  14459. 1326.10 s [vector] +++ OK, passed 100 tests.
  14460. 1326.10 s [vector] izipWith3: OK
  14461. 1326.10 s [vector] +++ OK, passed 100 tests.
  14462. 1326.10 s [vector] izipWithM: OK
  14463. 1326.12 s [vector] +++ OK, passed 100 tests.
  14464. 1326.12 s [vector] izipWithM_: OK (0.01s)
  14465. 1326.12 s [vector] +++ OK, passed 100 tests.
  14466. 1326.12 s [vector] zipWithM: OK
  14467. 1326.12 s [vector] +++ OK, passed 100 tests.
  14468. 1326.13 s [vector] zipWithM_: OK
  14469. 1326.13 s [vector] +++ OK, passed 100 tests.
  14470. 1326.13 s [vector] filter: OK
  14471. 1326.13 s [vector] +++ OK, passed 100 tests.
  14472. 1326.13 s [vector] ifilter: OK
  14473. 1326.14 s [vector] +++ OK, passed 100 tests.
  14474. 1326.17 s [vector] filterM: OK (0.03s)
  14475. 1326.17 s [vector] +++ OK, passed 100 tests.
  14476. 1326.17 s [vector] uniq: OK
  14477. 1326.17 s [vector] +++ OK, passed 100 tests.
  14478. 1326.17 s [vector] mapMaybe: OK
  14479. 1326.17 s [vector] +++ OK, passed 100 tests.
  14480. 1326.17 s [vector] imapMaybe: OK
  14481. 1326.17 s [vector] +++ OK, passed 100 tests.
  14482. 1326.17 s [vector] takeWhile: OK
  14483. 1326.18 s [vector] +++ OK, passed 100 tests.
  14484. 1326.18 s [vector] dropWhile: OK
  14485. 1326.18 s [vector] +++ OK, passed 100 tests.
  14486. 1326.18 s [vector] partition: OK
  14487. 1326.18 s [vector] +++ OK, passed 100 tests.
  14488. 1326.18 s [vector] partitionWith: OK
  14489. 1326.18 s [vector] +++ OK, passed 100 tests.
  14490. 1326.18 s [vector] span: OK
  14491. 1326.18 s [vector] +++ OK, passed 100 tests.
  14492. 1326.18 s [vector] break: OK
  14493. 1326.18 s [vector] +++ OK, passed 100 tests.
  14494. 1326.18 s [vector] spanR: OK
  14495. 1326.18 s [vector] +++ OK, passed 100 tests.
  14496. 1326.18 s [vector] breakR: OK
  14497. 1326.18 s [vector] +++ OK, passed 100 tests.
  14498. 1326.18 s [vector] groupBy: OK
  14499. 1326.19 s [vector] +++ OK, passed 100 tests.
  14500. 1326.19 s [vector] elem: OK
  14501. 1326.19 s [vector] +++ OK, passed 100 tests.
  14502. 1326.19 s [vector] notElem: OK
  14503. 1326.19 s [vector] +++ OK, passed 100 tests.
  14504. 1326.19 s [vector] find: OK
  14505. 1326.19 s [vector] +++ OK, passed 100 tests.
  14506. 1326.19 s [vector] findIndex: OK
  14507. 1326.19 s [vector] +++ OK, passed 100 tests.
  14508. 1326.19 s [vector] findIndexR: OK
  14509. 1326.20 s [vector] +++ OK, passed 100 tests.
  14510. 1326.20 s [vector] findIndices: OK
  14511. 1326.20 s [vector] +++ OK, passed 100 tests.
  14512. 1326.20 s [vector] elemIndex: OK
  14513. 1326.20 s [vector] +++ OK, passed 100 tests.
  14514. 1326.20 s [vector] elemIndices: OK
  14515. 1326.20 s [vector] +++ OK, passed 100 tests.
  14516. 1326.20 s [vector] foldl: OK
  14517. 1326.20 s [vector] +++ OK, passed 100 tests.
  14518. 1326.20 s [vector] foldl1: OK
  14519. 1326.20 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14520. 1326.20 s [vector] foldl': OK
  14521. 1326.20 s [vector] +++ OK, passed 100 tests.
  14522. 1326.20 s [vector] foldl1': OK
  14523. 1326.20 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14524. 1326.20 s [vector] foldr: OK
  14525. 1326.20 s [vector] +++ OK, passed 100 tests.
  14526. 1326.20 s [vector] foldr1: OK
  14527. 1326.21 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14528. 1326.22 s [vector] foldr': OK
  14529. 1326.22 s [vector] +++ OK, passed 100 tests.
  14530. 1326.22 s [vector] foldr1': OK
  14531. 1326.22 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14532. 1326.22 s [vector] ifoldl: OK
  14533. 1326.22 s [vector] +++ OK, passed 100 tests.
  14534. 1326.22 s [vector] ifoldl': OK
  14535. 1326.22 s [vector] +++ OK, passed 100 tests.
  14536. 1326.23 s [vector] ifoldr: OK
  14537. 1326.23 s [vector] +++ OK, passed 100 tests.
  14538. 1326.23 s [vector] ifoldr': OK
  14539. 1326.23 s [vector] +++ OK, passed 100 tests.
  14540. 1326.23 s [vector] ifoldM: OK
  14541. 1326.24 s [vector] +++ OK, passed 100 tests.
  14542. 1326.24 s [vector] ifoldM': OK
  14543. 1326.24 s [vector] +++ OK, passed 100 tests.
  14544. 1326.25 s [vector] ifoldM_: OK (0.02s)
  14545. 1326.25 s [vector] +++ OK, passed 100 tests.
  14546. 1326.27 s [vector] ifoldM'_: OK
  14547. 1326.27 s [vector] +++ OK, passed 100 tests.
  14548. 1326.27 s [vector] all: OK
  14549. 1326.27 s [vector] +++ OK, passed 100 tests.
  14550. 1326.27 s [vector] any: OK
  14551. 1326.27 s [vector] +++ OK, passed 100 tests.
  14552. 1326.27 s [vector] prescanl: OK
  14553. 1326.27 s [vector] +++ OK, passed 100 tests.
  14554. 1326.28 s [vector] prescanl': OK
  14555. 1326.28 s [vector] +++ OK, passed 100 tests.
  14556. 1326.28 s [vector] postscanl: OK
  14557. 1326.28 s [vector] +++ OK, passed 100 tests.
  14558. 1326.28 s [vector] postscanl': OK
  14559. 1326.28 s [vector] +++ OK, passed 100 tests.
  14560. 1326.29 s [vector] scanl: OK
  14561. 1326.29 s [vector] +++ OK, passed 100 tests.
  14562. 1326.29 s [vector] scanl': OK
  14563. 1326.29 s [vector] +++ OK, passed 100 tests.
  14564. 1326.30 s [vector] scanl1: OK
  14565. 1326.30 s [vector] +++ OK, passed 100 tests.
  14566. 1326.30 s [vector] scanl1': OK
  14567. 1326.30 s [vector] +++ OK, passed 100 tests.
  14568. 1326.30 s [vector] iscanl: OK
  14569. 1326.30 s [vector] +++ OK, passed 100 tests.
  14570. 1326.31 s [vector] iscanl': OK
  14571. 1326.31 s [vector] +++ OK, passed 100 tests.
  14572. 1326.31 s [vector] prescanr: OK
  14573. 1326.31 s [vector] +++ OK, passed 100 tests.
  14574. 1326.32 s [vector] prescanr': OK
  14575. 1326.32 s [vector] +++ OK, passed 100 tests.
  14576. 1326.32 s [vector] postscanr: OK
  14577. 1326.32 s [vector] +++ OK, passed 100 tests.
  14578. 1326.32 s [vector] postscanr': OK
  14579. 1326.32 s [vector] +++ OK, passed 100 tests.
  14580. 1326.33 s [vector] scanr: OK
  14581. 1326.33 s [vector] +++ OK, passed 100 tests.
  14582. 1326.33 s [vector] scanr': OK
  14583. 1326.34 s [vector] +++ OK, passed 100 tests.
  14584. 1326.34 s [vector] scanr1: OK
  14585. 1326.34 s [vector] +++ OK, passed 100 tests.
  14586. 1326.34 s [vector] scanr1': OK
  14587. 1326.34 s [vector] +++ OK, passed 100 tests.
  14588. 1326.34 s [vector] iscanr: OK
  14589. 1326.34 s [vector] +++ OK, passed 100 tests.
  14590. 1326.35 s [vector] iscanr': OK
  14591. 1326.35 s [vector] +++ OK, passed 100 tests.
  14592. 1326.35 s [vector] mut_read: OK
  14593. 1326.35 s [vector] +++ OK, passed 100 tests; 11 discarded.
  14594. 1326.35 s [vector] mut_write: OK
  14595. 1326.35 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14596. 1326.35 s [vector] mut_modify: OK
  14597. 1326.35 s [vector] +++ OK, passed 100 tests; 13 discarded.
  14598. 1326.35 s [vector] mut_generate: OK
  14599. 1326.36 s [vector] +++ OK, passed 100 tests.
  14600. 1326.36 s [vector] mut_generateM: OK
  14601. 1326.36 s [vector] +++ OK, passed 100 tests.
  14602. 1326.38 s [vector] mut_mapM_: OK (0.01s)
  14603. 1326.38 s [vector] +++ OK, passed 100 tests.
  14604. 1326.40 s [vector] mut_imapM_: OK (0.02s)
  14605. 1326.40 s [vector] +++ OK, passed 100 tests.
  14606. 1326.40 s [vector] mut_forM_: OK (0.01s)
  14607. 1326.40 s [vector] +++ OK, passed 100 tests.
  14608. 1326.43 s [vector] mut_iforM_: OK (0.02s)
  14609. 1326.43 s [vector] +++ OK, passed 100 tests.
  14610. 1326.43 s [vector] mut_foldr: OK
  14611. 1326.43 s [vector] +++ OK, passed 100 tests.
  14612. 1326.44 s [vector] mut_foldr': OK
  14613. 1326.44 s [vector] +++ OK, passed 100 tests.
  14614. 1326.44 s [vector] mut_foldl: OK
  14615. 1326.44 s [vector] +++ OK, passed 100 tests.
  14616. 1326.44 s [vector] mut_foldl': OK
  14617. 1326.44 s [vector] +++ OK, passed 100 tests.
  14618. 1326.44 s [vector] mut_ifoldr: OK
  14619. 1326.44 s [vector] +++ OK, passed 100 tests.
  14620. 1326.45 s [vector] mut_ifoldr': OK
  14621. 1326.46 s [vector] +++ OK, passed 100 tests.
  14622. 1326.46 s [vector] mut_ifoldl: OK
  14623. 1326.46 s [vector] +++ OK, passed 100 tests.
  14624. 1326.46 s [vector] mut_ifoldl': OK
  14625. 1326.46 s [vector] +++ OK, passed 100 tests.
  14626. 1326.46 s [vector] mut_foldM: OK
  14627. 1326.47 s [vector] +++ OK, passed 100 tests.
  14628. 1326.47 s [vector] mut_foldM': OK
  14629. 1326.48 s [vector] +++ OK, passed 100 tests.
  14630. 1326.48 s [vector] mut_foldrM: OK
  14631. 1326.48 s [vector] +++ OK, passed 100 tests.
  14632. 1326.49 s [vector] mut_foldrM': OK
  14633. 1326.49 s [vector] +++ OK, passed 100 tests.
  14634. 1326.49 s [vector] mut_ifoldM: OK
  14635. 1326.49 s [vector] +++ OK, passed 100 tests.
  14636. 1326.49 s [vector] mut_ifoldM': OK
  14637. 1326.50 s [vector] +++ OK, passed 100 tests.
  14638. 1326.50 s [vector] mut_ifoldrM: OK
  14639. 1326.50 s [vector] +++ OK, passed 100 tests.
  14640. 1326.50 s [vector] mut_ifoldrM': OK
  14641. 1326.50 s [vector] +++ OK, passed 100 tests.
  14642. 1326.51 s [vector] compare: OK
  14643. 1326.51 s [vector] +++ OK, passed 100 tests.
  14644. 1326.51 s [vector] maximum: OK
  14645. 1326.51 s [vector] +++ OK, passed 100 tests; 12 discarded.
  14646. 1326.51 s [vector] minimum: OK
  14647. 1326.51 s [vector] +++ OK, passed 100 tests; 20 discarded.
  14648. 1326.52 s [vector] minIndex: OK
  14649. 1326.52 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14650. 1326.52 s [vector] maxIndex: OK
  14651. 1326.52 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14652. 1326.52 s [vector] maximumBy: OK
  14653. 1326.52 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14654. 1326.52 s [vector] minimumBy: OK
  14655. 1326.52 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14656. 1326.52 s [vector] maximumOn: OK
  14657. 1326.52 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14658. 1326.52 s [vector] minimumOn: OK
  14659. 1326.52 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14660. 1326.52 s [vector] maxIndexBy: OK
  14661. 1326.52 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14662. 1326.52 s [vector] minIndexBy: OK
  14663. 1326.52 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14664. 1326.52 s [vector] ListFirstMaxIndexWins: OK
  14665. 1326.52 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14666. 1326.53 s [vector] FalseListFirstMaxIndexWins: OK
  14667. 1326.53 s [vector] +++ OK, failed as expected. (after 1 test):
  14668. 1326.53 s [vector] Exception:
  14669. 1326.53 s [vector] Prelude.foldr1: empty list
  14670. 1326.53 s [vector] CallStack (from HasCallStack):
  14671. 1326.53 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  14672. 1326.53 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  14673. 1326.53 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  14674. 1326.53 s [vector] []
  14675. 1326.53 s [vector] zip: OK
  14676. 1326.53 s [vector] +++ OK, passed 100 tests.
  14677. 1326.53 s [vector] zip3: OK
  14678. 1326.53 s [vector] +++ OK, passed 100 tests.
  14679. 1326.53 s [vector] unzip: OK
  14680. 1326.53 s [vector] +++ OK, passed 100 tests.
  14681. 1326.53 s [vector] unzip3: OK
  14682. 1326.54 s [vector] +++ OK, passed 100 tests.
  14683. 1326.54 s [vector] indexed: OK
  14684. 1326.54 s [vector] +++ OK, passed 100 tests.
  14685. 1326.54 s [vector] update: OK
  14686. 1326.54 s [vector] +++ OK, passed 100 tests.
  14687. 1326.54 s [vector] mempty: OK
  14688. 1326.54 s [vector] +++ OK, passed 100 tests.
  14689. 1326.54 s [vector] mappend: OK
  14690. 1326.54 s [vector] +++ OK, passed 100 tests.
  14691. 1326.57 s [vector] mconcat: OK (0.03s)
  14692. 1326.57 s [vector] +++ OK, passed 100 tests.
  14693. 1326.57 s [vector] glength: OK
  14694. 1326.57 s [vector] +++ OK, passed 100 tests.
  14695. 1326.57 s [vector] sum: OK
  14696. 1326.57 s [vector] +++ OK, passed 100 tests.
  14697. 1326.57 s [vector] product: OK
  14698. 1326.57 s [vector] +++ OK, passed 100 tests.
  14699. 1326.57 s [vector] enumFromN: OK
  14700. 1326.57 s [vector] +++ OK, passed 100 tests.
  14701. 1326.57 s [vector] enumFromThenN: OK
  14702. 1326.57 s [vector] +++ OK, passed 100 tests.
  14703. 1326.57 s [vector] enumFromTo: OK
  14704. 1326.57 s [vector] +++ OK, passed 100 tests.
  14705. 1326.57 s [vector] enumFromThenTo: OK
  14706. 1326.57 s [vector] +++ OK, passed 100 tests; 12 discarded.
  14707. 1326.57 s [vector] (Float)
  14708. 1326.57 s [vector] fromList.toList == id: OK
  14709. 1326.57 s [vector] +++ OK, passed 100 tests.
  14710. 1326.57 s [vector] toList.fromList == id: OK
  14711. 1326.58 s [vector] +++ OK, passed 100 tests.
  14712. 1326.58 s [vector] unstream.stream == id: OK
  14713. 1326.58 s [vector] +++ OK, passed 100 tests.
  14714. 1326.58 s [vector] stream.unstream == id: OK
  14715. 1326.58 s [vector] +++ OK, passed 100 tests.
  14716. 1326.58 s [vector] eq: OK
  14717. 1326.58 s [vector] +++ OK, passed 100 tests.
  14718. 1326.58 s [vector] length: OK
  14719. 1326.58 s [vector] +++ OK, passed 100 tests.
  14720. 1326.58 s [vector] null: OK
  14721. 1326.58 s [vector] +++ OK, passed 100 tests.
  14722. 1326.58 s [vector] index: OK
  14723. 1326.58 s [vector] +++ OK, passed 100 tests; 19 discarded.
  14724. 1326.58 s [vector] safeIndex: OK
  14725. 1326.59 s [vector] +++ OK, passed 100 tests.
  14726. 1326.59 s [vector] head: OK
  14727. 1326.59 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14728. 1326.59 s [vector] last: OK
  14729. 1326.59 s [vector] +++ OK, passed 100 tests; 19 discarded.
  14730. 1326.59 s [vector] unsafeIndex: OK
  14731. 1326.59 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14732. 1326.59 s [vector] unsafeHead: OK
  14733. 1326.59 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14734. 1326.59 s [vector] unsafeLast: OK
  14735. 1326.59 s [vector] +++ OK, passed 100 tests; 13 discarded.
  14736. 1326.59 s [vector] slice: OK
  14737. 1326.59 s [vector] +++ OK, passed 100 tests.
  14738. 1326.59 s [vector] init: OK
  14739. 1326.59 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14740. 1326.60 s [vector] tail: OK
  14741. 1326.60 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14742. 1326.60 s [vector] take: OK
  14743. 1326.60 s [vector] +++ OK, passed 100 tests.
  14744. 1326.60 s [vector] drop: OK
  14745. 1326.60 s [vector] +++ OK, passed 100 tests.
  14746. 1326.60 s [vector] splitAt: OK
  14747. 1326.60 s [vector] +++ OK, passed 100 tests.
  14748. 1326.60 s [vector] empty: OK
  14749. 1326.60 s [vector] +++ OK, passed 100 tests.
  14750. 1326.61 s [vector] singleton: OK
  14751. 1326.61 s [vector] +++ OK, passed 100 tests.
  14752. 1326.61 s [vector] replicate: OK
  14753. 1326.61 s [vector] +++ OK, passed 100 tests.
  14754. 1326.61 s [vector] generate: OK
  14755. 1326.61 s [vector] +++ OK, passed 100 tests.
  14756. 1326.62 s [vector] iterateN: OK
  14757. 1326.62 s [vector] +++ OK, passed 100 tests.
  14758. 1326.64 s [vector] iterateNM: OK (0.02s)
  14759. 1326.64 s [vector] +++ OK, passed 100 tests.
  14760. 1326.68 s [vector] generateM: OK (0.05s)
  14761. 1326.68 s [vector] +++ OK, passed 100 tests.
  14762. 1326.70 s [vector] replicateM: OK (0.02s)
  14763. 1326.70 s [vector] +++ OK, passed 100 tests.
  14764. 1326.70 s [vector] create: OK
  14765. 1326.70 s [vector] +++ OK, passed 100 tests.
  14766. 1326.70 s [vector] createT: OK
  14767. 1326.70 s [vector] +++ OK, passed 100 tests.
  14768. 1326.70 s [vector] unfoldr: OK
  14769. 1326.70 s [vector] +++ OK, passed 100 tests.
  14770. 1326.70 s [vector] unfoldrN: OK
  14771. 1326.71 s [vector] +++ OK, passed 100 tests.
  14772. 1326.71 s [vector] unfoldrExactN: OK
  14773. 1326.71 s [vector] +++ OK, passed 100 tests.
  14774. 1326.71 s [vector] unfoldrM: OK
  14775. 1326.71 s [vector] +++ OK, passed 100 tests.
  14776. 1326.72 s [vector] unfoldrNM: OK
  14777. 1326.72 s [vector] +++ OK, passed 100 tests.
  14778. 1326.73 s [vector] unfoldrExactNM: OK
  14779. 1326.73 s [vector] +++ OK, passed 100 tests.
  14780. 1326.73 s [vector] constructN: OK
  14781. 1326.73 s [vector] +++ OK, passed 100 tests.
  14782. 1326.74 s [vector] constructrN: OK
  14783. 1326.74 s [vector] +++ OK, passed 100 tests.
  14784. 1326.74 s [vector] cons: OK
  14785. 1326.74 s [vector] +++ OK, passed 100 tests.
  14786. 1326.75 s [vector] snoc: OK
  14787. 1326.75 s [vector] +++ OK, passed 100 tests.
  14788. 1326.75 s [vector] append: OK
  14789. 1326.75 s [vector] +++ OK, passed 100 tests.
  14790. 1326.76 s [vector] concat: OK (0.02s)
  14791. 1326.76 s [vector] +++ OK, passed 100 tests.
  14792. 1326.76 s [vector] force: OK
  14793. 1326.76 s [vector] +++ OK, passed 100 tests.
  14794. 1326.76 s [vector] upd: OK
  14795. 1326.77 s [vector] +++ OK, passed 100 tests.
  14796. 1326.77 s [vector] accum: OK (0.01s)
  14797. 1326.77 s [vector] +++ OK, passed 100 tests.
  14798. 1326.77 s [vector] reverse: OK
  14799. 1326.77 s [vector] +++ OK, passed 100 tests.
  14800. 1326.78 s [vector] backpermute: OK
  14801. 1326.78 s [vector] +++ OK, passed 100 tests.
  14802. 1326.78 s [vector] map: OK
  14803. 1326.79 s [vector] +++ OK, passed 100 tests.
  14804. 1326.80 s [vector] imap: OK
  14805. 1326.80 s [vector] +++ OK, passed 100 tests.
  14806. 1326.81 s [vector] concatMap: OK
  14807. 1326.81 s [vector] +++ OK, passed 100 tests.
  14808. 1326.81 s [vector] mapM: OK
  14809. 1326.81 s [vector] +++ OK, passed 100 tests.
  14810. 1326.83 s [vector] mapM_: OK (0.03s)
  14811. 1326.83 s [vector] +++ OK, passed 100 tests.
  14812. 1326.83 s [vector] forM: OK
  14813. 1326.83 s [vector] +++ OK, passed 100 tests.
  14814. 1326.86 s [vector] forM_: OK (0.01s)
  14815. 1326.86 s [vector] +++ OK, passed 100 tests.
  14816. 1326.86 s [vector] imapM: OK
  14817. 1326.86 s [vector] +++ OK, passed 100 tests.
  14818. 1326.89 s [vector] imapM_: OK (0.03s)
  14819. 1326.89 s [vector] +++ OK, passed 100 tests.
  14820. 1326.90 s [vector] zipWith: OK
  14821. 1326.90 s [vector] +++ OK, passed 100 tests.
  14822. 1326.92 s [vector] zipWith3: OK
  14823. 1326.92 s [vector] +++ OK, passed 100 tests.
  14824. 1326.92 s [vector] izipWith: OK (0.01s)
  14825. 1326.92 s [vector] +++ OK, passed 100 tests.
  14826. 1326.95 s [vector] izipWith3: OK (0.01s)
  14827. 1326.95 s [vector] +++ OK, passed 100 tests.
  14828. 1326.97 s [vector] izipWithM: OK (0.02s)
  14829. 1326.97 s [vector] +++ OK, passed 100 tests.
  14830. 1326.99 s [vector] izipWithM_: OK (0.04s)
  14831. 1326.99 s [vector] +++ OK, passed 100 tests.
  14832. 1327.00 s [vector] zipWithM: OK
  14833. 1327.00 s [vector] +++ OK, passed 100 tests.
  14834. 1327.01 s [vector] zipWithM_: OK (0.02s)
  14835. 1327.01 s [vector] +++ OK, passed 100 tests.
  14836. 1327.02 s [vector] filter: OK
  14837. 1327.02 s [vector] +++ OK, passed 100 tests.
  14838. 1327.04 s [vector] ifilter: OK
  14839. 1327.04 s [vector] +++ OK, passed 100 tests.
  14840. 1327.06 s [vector] filterM: OK (0.04s)
  14841. 1327.06 s [vector] +++ OK, passed 100 tests.
  14842. 1327.06 s [vector] uniq: OK
  14843. 1327.06 s [vector] +++ OK, passed 100 tests.
  14844. 1327.07 s [vector] mapMaybe: OK
  14845. 1327.07 s [vector] +++ OK, passed 100 tests.
  14846. 1327.08 s [vector] imapMaybe: OK
  14847. 1327.08 s [vector] +++ OK, passed 100 tests.
  14848. 1327.08 s [vector] takeWhile: OK
  14849. 1327.08 s [vector] +++ OK, passed 100 tests.
  14850. 1327.08 s [vector] dropWhile: OK
  14851. 1327.08 s [vector] +++ OK, passed 100 tests.
  14852. 1327.08 s [vector] partition: OK
  14853. 1327.08 s [vector] +++ OK, passed 100 tests.
  14854. 1327.08 s [vector] partitionWith: OK
  14855. 1327.08 s [vector] +++ OK, passed 100 tests.
  14856. 1327.08 s [vector] span: OK
  14857. 1327.08 s [vector] +++ OK, passed 100 tests.
  14858. 1327.09 s [vector] break: OK
  14859. 1327.09 s [vector] +++ OK, passed 100 tests.
  14860. 1327.09 s [vector] spanR: OK
  14861. 1327.09 s [vector] +++ OK, passed 100 tests.
  14862. 1327.09 s [vector] breakR: OK
  14863. 1327.09 s [vector] +++ OK, passed 100 tests.
  14864. 1327.09 s [vector] groupBy: OK
  14865. 1327.09 s [vector] +++ OK, passed 100 tests.
  14866. 1327.09 s [vector] elem: OK
  14867. 1327.09 s [vector] +++ OK, passed 100 tests.
  14868. 1327.10 s [vector] notElem: OK
  14869. 1327.10 s [vector] +++ OK, passed 100 tests.
  14870. 1327.10 s [vector] find: OK
  14871. 1327.10 s [vector] +++ OK, passed 100 tests.
  14872. 1327.10 s [vector] findIndex: OK
  14873. 1327.10 s [vector] +++ OK, passed 100 tests.
  14874. 1327.10 s [vector] findIndexR: OK
  14875. 1327.10 s [vector] +++ OK, passed 100 tests.
  14876. 1327.11 s [vector] findIndices: OK
  14877. 1327.11 s [vector] +++ OK, passed 100 tests.
  14878. 1327.11 s [vector] elemIndex: OK
  14879. 1327.11 s [vector] +++ OK, passed 100 tests.
  14880. 1327.11 s [vector] elemIndices: OK
  14881. 1327.12 s [vector] +++ OK, passed 100 tests.
  14882. 1327.14 s [vector] foldl: OK (0.01s)
  14883. 1327.14 s [vector] +++ OK, passed 100 tests.
  14884. 1327.14 s [vector] foldl1: OK (0.01s)
  14885. 1327.14 s [vector] +++ OK, passed 100 tests; 13 discarded.
  14886. 1327.16 s [vector] foldl': OK (0.01s)
  14887. 1327.16 s [vector] +++ OK, passed 100 tests.
  14888. 1327.16 s [vector] foldl1': OK
  14889. 1327.16 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14890. 1327.17 s [vector] foldr: OK
  14891. 1327.18 s [vector] +++ OK, passed 100 tests.
  14892. 1327.18 s [vector] foldr1: OK
  14893. 1327.18 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14894. 1327.20 s [vector] foldr': OK (0.01s)
  14895. 1327.20 s [vector] +++ OK, passed 100 tests.
  14896. 1327.20 s [vector] foldr1': OK
  14897. 1327.20 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14898. 1327.22 s [vector] ifoldl: OK
  14899. 1327.22 s [vector] +++ OK, passed 100 tests.
  14900. 1327.23 s [vector] ifoldl': OK
  14901. 1327.23 s [vector] +++ OK, passed 100 tests.
  14902. 1327.23 s [vector] ifoldr: OK
  14903. 1327.23 s [vector] +++ OK, passed 100 tests.
  14904. 1327.24 s [vector] ifoldr': OK
  14905. 1327.24 s [vector] +++ OK, passed 100 tests.
  14906. 1327.26 s [vector] ifoldM: OK
  14907. 1327.26 s [vector] +++ OK, passed 100 tests.
  14908. 1327.26 s [vector] ifoldM': OK (0.01s)
  14909. 1327.26 s [vector] +++ OK, passed 100 tests.
  14910. 1327.33 s [vector] ifoldM_: OK (0.06s)
  14911. 1327.33 s [vector] +++ OK, passed 100 tests.
  14912. 1327.37 s [vector] ifoldM'_: OK (0.05s)
  14913. 1327.37 s [vector] +++ OK, passed 100 tests.
  14914. 1327.37 s [vector] all: OK
  14915. 1327.37 s [vector] +++ OK, passed 100 tests.
  14916. 1327.38 s [vector] any: OK
  14917. 1327.38 s [vector] +++ OK, passed 100 tests.
  14918. 1327.39 s [vector] prescanl: OK
  14919. 1327.39 s [vector] +++ OK, passed 100 tests.
  14920. 1327.40 s [vector] prescanl': OK
  14921. 1327.40 s [vector] +++ OK, passed 100 tests.
  14922. 1327.40 s [vector] postscanl: OK
  14923. 1327.41 s [vector] +++ OK, passed 100 tests.
  14924. 1327.41 s [vector] postscanl': OK
  14925. 1327.41 s [vector] +++ OK, passed 100 tests.
  14926. 1327.42 s [vector] scanl: OK (0.01s)
  14927. 1327.42 s [vector] +++ OK, passed 100 tests.
  14928. 1327.44 s [vector] scanl': OK (0.01s)
  14929. 1327.44 s [vector] +++ OK, passed 100 tests.
  14930. 1327.44 s [vector] scanl1: OK (0.01s)
  14931. 1327.44 s [vector] +++ OK, passed 100 tests.
  14932. 1327.45 s [vector] scanl1': OK
  14933. 1327.46 s [vector] +++ OK, passed 100 tests.
  14934. 1327.46 s [vector] iscanl: OK (0.01s)
  14935. 1327.46 s [vector] +++ OK, passed 100 tests.
  14936. 1327.48 s [vector] iscanl': OK
  14937. 1327.48 s [vector] +++ OK, passed 100 tests.
  14938. 1327.48 s [vector] prescanr: OK
  14939. 1327.49 s [vector] +++ OK, passed 100 tests.
  14940. 1327.50 s [vector] prescanr': OK
  14941. 1327.50 s [vector] +++ OK, passed 100 tests.
  14942. 1327.50 s [vector] postscanr: OK
  14943. 1327.50 s [vector] +++ OK, passed 100 tests.
  14944. 1327.50 s [vector] postscanr': OK
  14945. 1327.50 s [vector] +++ OK, passed 100 tests.
  14946. 1327.51 s [vector] scanr: OK
  14947. 1327.52 s [vector] +++ OK, passed 100 tests.
  14948. 1327.52 s [vector] scanr': OK
  14949. 1327.52 s [vector] +++ OK, passed 100 tests.
  14950. 1327.52 s [vector] scanr1: OK
  14951. 1327.52 s [vector] +++ OK, passed 100 tests.
  14952. 1327.54 s [vector] scanr1': OK
  14953. 1327.54 s [vector] +++ OK, passed 100 tests.
  14954. 1327.54 s [vector] iscanr: OK
  14955. 1327.54 s [vector] +++ OK, passed 100 tests.
  14956. 1327.55 s [vector] iscanr': OK
  14957. 1327.55 s [vector] +++ OK, passed 100 tests.
  14958. 1327.55 s [vector] mut_read: OK
  14959. 1327.56 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14960. 1327.56 s [vector] mut_write: OK
  14961. 1327.56 s [vector] +++ OK, passed 100 tests; 12 discarded.
  14962. 1327.56 s [vector] mut_modify: OK
  14963. 1327.56 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14964. 1327.56 s [vector] mut_generate: OK
  14965. 1327.56 s [vector] +++ OK, passed 100 tests.
  14966. 1327.58 s [vector] mut_generateM: OK (0.01s)
  14967. 1327.58 s [vector] +++ OK, passed 100 tests.
  14968. 1327.60 s [vector] mut_mapM_: OK (0.04s)
  14969. 1327.60 s [vector] +++ OK, passed 100 tests.
  14970. 1327.64 s [vector] mut_imapM_: OK (0.03s)
  14971. 1327.64 s [vector] +++ OK, passed 100 tests.
  14972. 1327.68 s [vector] mut_forM_: OK (0.04s)
  14973. 1327.68 s [vector] +++ OK, passed 100 tests.
  14974. 1327.70 s [vector] mut_iforM_: OK (0.03s)
  14975. 1327.70 s [vector] +++ OK, passed 100 tests.
  14976. 1327.71 s [vector] mut_foldr: OK
  14977. 1327.71 s [vector] +++ OK, passed 100 tests.
  14978. 1327.72 s [vector] mut_foldr': OK
  14979. 1327.72 s [vector] +++ OK, passed 100 tests.
  14980. 1327.72 s [vector] mut_foldl: OK
  14981. 1327.72 s [vector] +++ OK, passed 100 tests.
  14982. 1327.73 s [vector] mut_foldl': OK
  14983. 1327.73 s [vector] +++ OK, passed 100 tests.
  14984. 1327.74 s [vector] mut_ifoldr: OK
  14985. 1327.74 s [vector] +++ OK, passed 100 tests.
  14986. 1327.75 s [vector] mut_ifoldr': OK
  14987. 1327.75 s [vector] +++ OK, passed 100 tests.
  14988. 1327.76 s [vector] mut_ifoldl: OK
  14989. 1327.76 s [vector] +++ OK, passed 100 tests.
  14990. 1327.76 s [vector] mut_ifoldl': OK
  14991. 1327.77 s [vector] +++ OK, passed 100 tests.
  14992. 1327.78 s [vector] mut_foldM: OK
  14993. 1327.78 s [vector] +++ OK, passed 100 tests.
  14994. 1327.78 s [vector] mut_foldM': OK
  14995. 1327.78 s [vector] +++ OK, passed 100 tests.
  14996. 1327.78 s [vector] mut_foldrM: OK (0.01s)
  14997. 1327.78 s [vector] +++ OK, passed 100 tests.
  14998. 1327.80 s [vector] mut_foldrM': OK (0.02s)
  14999. 1327.80 s [vector] +++ OK, passed 100 tests.
  15000. 1327.82 s [vector] mut_ifoldM: OK (0.02s)
  15001. 1327.82 s [vector] +++ OK, passed 100 tests.
  15002. 1327.84 s [vector] mut_ifoldM': OK (0.02s)
  15003. 1327.84 s [vector] +++ OK, passed 100 tests.
  15004. 1327.86 s [vector] mut_ifoldrM: OK (0.01s)
  15005. 1327.86 s [vector] +++ OK, passed 100 tests.
  15006. 1327.86 s [vector] mut_ifoldrM': OK (0.01s)
  15007. 1327.86 s [vector] +++ OK, passed 100 tests.
  15008. 1327.86 s [vector] compare: OK
  15009. 1327.86 s [vector] +++ OK, passed 100 tests.
  15010. 1327.86 s [vector] maximum: OK
  15011. 1327.86 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15012. 1327.86 s [vector] minimum: OK
  15013. 1327.86 s [vector] +++ OK, passed 100 tests; 18 discarded.
  15014. 1327.86 s [vector] minIndex: OK
  15015. 1327.86 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15016. 1327.86 s [vector] maxIndex: OK
  15017. 1327.86 s [vector] +++ OK, passed 100 tests; 19 discarded.
  15018. 1327.86 s [vector] maximumBy: OK
  15019. 1327.86 s [vector] +++ OK, passed 100 tests; 18 discarded.
  15020. 1327.86 s [vector] minimumBy: OK
  15021. 1327.86 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15022. 1327.86 s [vector] maximumOn: OK
  15023. 1327.86 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15024. 1327.86 s [vector] minimumOn: OK
  15025. 1327.86 s [vector] +++ OK, passed 100 tests; 13 discarded.
  15026. 1327.86 s [vector] maxIndexBy: OK
  15027. 1327.86 s [vector] +++ OK, passed 100 tests; 12 discarded.
  15028. 1327.87 s [vector] minIndexBy: OK
  15029. 1327.87 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15030. 1327.87 s [vector] ListFirstMaxIndexWins: OK
  15031. 1327.87 s [vector] +++ OK, passed 100 tests; 12 discarded.
  15032. 1327.87 s [vector] FalseListFirstMaxIndexWins: OK
  15033. 1327.87 s [vector] +++ OK, failed as expected. (after 1 test):
  15034. 1327.87 s [vector] Exception:
  15035. 1327.87 s [vector] Prelude.foldr1: empty list
  15036. 1327.87 s [vector] CallStack (from HasCallStack):
  15037. 1327.87 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  15038. 1327.87 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  15039. 1327.87 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  15040. 1327.87 s [vector] []
  15041. 1327.87 s [vector] zip: OK
  15042. 1327.87 s [vector] +++ OK, passed 100 tests.
  15043. 1327.87 s [vector] zip3: OK
  15044. 1327.87 s [vector] +++ OK, passed 100 tests.
  15045. 1327.87 s [vector] unzip: OK
  15046. 1327.87 s [vector] +++ OK, passed 100 tests.
  15047. 1327.88 s [vector] unzip3: OK
  15048. 1327.88 s [vector] +++ OK, passed 100 tests.
  15049. 1327.88 s [vector] indexed: OK
  15050. 1327.88 s [vector] +++ OK, passed 100 tests.
  15051. 1327.88 s [vector] update: OK
  15052. 1327.88 s [vector] +++ OK, passed 100 tests.
  15053. 1327.88 s [vector] mempty: OK
  15054. 1327.88 s [vector] +++ OK, passed 100 tests.
  15055. 1327.88 s [vector] mappend: OK
  15056. 1327.88 s [vector] +++ OK, passed 100 tests.
  15057. 1327.91 s [vector] mconcat: OK (0.02s)
  15058. 1327.91 s [vector] +++ OK, passed 100 tests.
  15059. 1327.91 s [vector] glength: OK
  15060. 1327.91 s [vector] +++ OK, passed 100 tests.
  15061. 1327.91 s [vector] sum: OK
  15062. 1327.91 s [vector] +++ OK, passed 100 tests.
  15063. 1327.91 s [vector] product: OK
  15064. 1327.91 s [vector] +++ OK, passed 100 tests.
  15065. 1327.91 s [vector] enumFromN: OK
  15066. 1327.91 s [vector] +++ OK, passed 100 tests.
  15067. 1327.91 s [vector] enumFromThenN: OK
  15068. 1327.91 s [vector] +++ OK, passed 100 tests.
  15069. 1327.91 s [vector] enumFromTo: OK
  15070. 1327.91 s [vector] +++ OK, passed 100 tests.
  15071. 1327.91 s [vector] enumFromThenTo: OK
  15072. 1327.91 s [vector] +++ OK, passed 100 tests.
  15073. 1327.91 s [vector] (Double)
  15074. 1327.91 s [vector] fromList.toList == id: OK
  15075. 1327.91 s [vector] +++ OK, passed 100 tests.
  15076. 1327.91 s [vector] toList.fromList == id: OK
  15077. 1327.91 s [vector] +++ OK, passed 100 tests.
  15078. 1327.92 s [vector] unstream.stream == id: OK
  15079. 1327.92 s [vector] +++ OK, passed 100 tests.
  15080. 1327.92 s [vector] stream.unstream == id: OK
  15081. 1327.92 s [vector] +++ OK, passed 100 tests.
  15082. 1327.92 s [vector] eq: OK
  15083. 1327.92 s [vector] +++ OK, passed 100 tests.
  15084. 1327.92 s [vector] length: OK
  15085. 1327.92 s [vector] +++ OK, passed 100 tests.
  15086. 1327.92 s [vector] null: OK
  15087. 1327.92 s [vector] +++ OK, passed 100 tests.
  15088. 1327.92 s [vector] index: OK
  15089. 1327.92 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15090. 1327.92 s [vector] safeIndex: OK
  15091. 1327.92 s [vector] +++ OK, passed 100 tests.
  15092. 1327.92 s [vector] head: OK
  15093. 1327.92 s [vector] +++ OK, passed 100 tests; 13 discarded.
  15094. 1327.92 s [vector] last: OK
  15095. 1327.92 s [vector] +++ OK, passed 100 tests; 20 discarded.
  15096. 1327.92 s [vector] unsafeIndex: OK
  15097. 1327.92 s [vector] +++ OK, passed 100 tests; 19 discarded.
  15098. 1327.92 s [vector] unsafeHead: OK
  15099. 1327.93 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15100. 1327.93 s [vector] unsafeLast: OK
  15101. 1327.93 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15102. 1327.93 s [vector] slice: OK
  15103. 1327.93 s [vector] +++ OK, passed 100 tests.
  15104. 1327.94 s [vector] init: OK
  15105. 1327.94 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15106. 1327.94 s [vector] tail: OK
  15107. 1327.94 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15108. 1327.94 s [vector] take: OK
  15109. 1327.94 s [vector] +++ OK, passed 100 tests.
  15110. 1327.94 s [vector] drop: OK
  15111. 1327.94 s [vector] +++ OK, passed 100 tests.
  15112. 1327.94 s [vector] splitAt: OK
  15113. 1327.94 s [vector] +++ OK, passed 100 tests.
  15114. 1327.94 s [vector] empty: OK
  15115. 1327.94 s [vector] +++ OK, passed 100 tests.
  15116. 1327.94 s [vector] singleton: OK
  15117. 1327.94 s [vector] +++ OK, passed 100 tests.
  15118. 1327.94 s [vector] replicate: OK
  15119. 1327.94 s [vector] +++ OK, passed 100 tests.
  15120. 1327.94 s [vector] generate: OK
  15121. 1327.94 s [vector] +++ OK, passed 100 tests.
  15122. 1327.95 s [vector] iterateN: OK
  15123. 1327.95 s [vector] +++ OK, passed 100 tests.
  15124. 1328.00 s [vector] iterateNM: OK (0.04s)
  15125. 1328.00 s [vector] +++ OK, passed 100 tests.
  15126. 1328.02 s [vector] generateM: OK (0.02s)
  15127. 1328.02 s [vector] +++ OK, passed 100 tests.
  15128. 1328.03 s [vector] replicateM: OK (0.02s)
  15129. 1328.03 s [vector] +++ OK, passed 100 tests.
  15130. 1328.03 s [vector] create: OK
  15131. 1328.03 s [vector] +++ OK, passed 100 tests.
  15132. 1328.03 s [vector] createT: OK
  15133. 1328.03 s [vector] +++ OK, passed 100 tests.
  15134. 1328.04 s [vector] unfoldr: OK
  15135. 1328.04 s [vector] +++ OK, passed 100 tests.
  15136. 1328.04 s [vector] unfoldrN: OK
  15137. 1328.04 s [vector] +++ OK, passed 100 tests.
  15138. 1328.04 s [vector] unfoldrExactN: OK
  15139. 1328.04 s [vector] +++ OK, passed 100 tests.
  15140. 1328.04 s [vector] unfoldrM: OK
  15141. 1328.04 s [vector] +++ OK, passed 100 tests.
  15142. 1328.05 s [vector] unfoldrNM: OK
  15143. 1328.05 s [vector] +++ OK, passed 100 tests.
  15144. 1328.10 s [vector] unfoldrExactNM: OK (0.04s)
  15145. 1328.10 s [vector] +++ OK, passed 100 tests.
  15146. 1328.13 s [vector] constructN: OK (0.02s)
  15147. 1328.13 s [vector] +++ OK, passed 100 tests.
  15148. 1328.14 s [vector] constructrN: OK (0.03s)
  15149. 1328.14 s [vector] +++ OK, passed 100 tests.
  15150. 1328.14 s [vector] cons: OK
  15151. 1328.15 s [vector] +++ OK, passed 100 tests.
  15152. 1328.16 s [vector] snoc: OK
  15153. 1328.16 s [vector] +++ OK, passed 100 tests.
  15154. 1328.16 s [vector] append: OK
  15155. 1328.16 s [vector] +++ OK, passed 100 tests.
  15156. 1328.17 s [vector] concat: OK (0.02s)
  15157. 1328.17 s [vector] +++ OK, passed 100 tests.
  15158. 1328.17 s [vector] force: OK
  15159. 1328.17 s [vector] +++ OK, passed 100 tests.
  15160. 1328.18 s [vector] upd: OK
  15161. 1328.18 s [vector] +++ OK, passed 100 tests.
  15162. 1328.19 s [vector] accum: OK (0.01s)
  15163. 1328.19 s [vector] +++ OK, passed 100 tests.
  15164. 1328.19 s [vector] reverse: OK
  15165. 1328.19 s [vector] +++ OK, passed 100 tests.
  15166. 1328.20 s [vector] backpermute: OK
  15167. 1328.20 s [vector] +++ OK, passed 100 tests.
  15168. 1328.21 s [vector] map: OK
  15169. 1328.21 s [vector] +++ OK, passed 100 tests.
  15170. 1328.21 s [vector] imap: OK
  15171. 1328.21 s [vector] +++ OK, passed 100 tests.
  15172. 1328.21 s [vector] concatMap: OK
  15173. 1328.22 s [vector] +++ OK, passed 100 tests.
  15174. 1328.24 s [vector] mapM: OK (0.01s)
  15175. 1328.24 s [vector] +++ OK, passed 100 tests.
  15176. 1328.27 s [vector] mapM_: OK (0.04s)
  15177. 1328.28 s [vector] +++ OK, passed 100 tests.
  15178. 1328.28 s [vector] forM: OK
  15179. 1328.28 s [vector] +++ OK, passed 100 tests.
  15180. 1328.32 s [vector] forM_: OK (0.03s)
  15181. 1328.32 s [vector] +++ OK, passed 100 tests.
  15182. 1328.32 s [vector] imapM: OK
  15183. 1328.32 s [vector] +++ OK, passed 100 tests.
  15184. 1328.36 s [vector] imapM_: OK (0.04s)
  15185. 1328.36 s [vector] +++ OK, passed 100 tests.
  15186. 1328.38 s [vector] zipWith: OK (0.01s)
  15187. 1328.38 s [vector] +++ OK, passed 100 tests.
  15188. 1328.39 s [vector] zipWith3: OK (0.01s)
  15189. 1328.39 s [vector] +++ OK, passed 100 tests.
  15190. 1328.40 s [vector] izipWith: OK (0.01s)
  15191. 1328.40 s [vector] +++ OK, passed 100 tests.
  15192. 1328.42 s [vector] izipWith3: OK (0.01s)
  15193. 1328.42 s [vector] +++ OK, passed 100 tests.
  15194. 1328.42 s [vector] izipWithM: OK (0.01s)
  15195. 1328.42 s [vector] +++ OK, passed 100 tests.
  15196. 1328.45 s [vector] izipWithM_: OK (0.03s)
  15197. 1328.46 s [vector] +++ OK, passed 100 tests.
  15198. 1328.46 s [vector] zipWithM: OK
  15199. 1328.46 s [vector] +++ OK, passed 100 tests.
  15200. 1328.48 s [vector] zipWithM_: OK (0.03s)
  15201. 1328.48 s [vector] +++ OK, passed 100 tests.
  15202. 1328.49 s [vector] filter: OK
  15203. 1328.49 s [vector] +++ OK, passed 100 tests.
  15204. 1328.50 s [vector] ifilter: OK
  15205. 1328.50 s [vector] +++ OK, passed 100 tests.
  15206. 1328.54 s [vector] filterM: OK (0.04s)
  15207. 1328.54 s [vector] +++ OK, passed 100 tests.
  15208. 1328.55 s [vector] uniq: OK
  15209. 1328.55 s [vector] +++ OK, passed 100 tests.
  15210. 1328.56 s [vector] mapMaybe: OK
  15211. 1328.56 s [vector] +++ OK, passed 100 tests.
  15212. 1328.56 s [vector] imapMaybe: OK
  15213. 1328.56 s [vector] +++ OK, passed 100 tests.
  15214. 1328.56 s [vector] takeWhile: OK
  15215. 1328.56 s [vector] +++ OK, passed 100 tests.
  15216. 1328.56 s [vector] dropWhile: OK
  15217. 1328.56 s [vector] +++ OK, passed 100 tests.
  15218. 1328.57 s [vector] partition: OK
  15219. 1328.57 s [vector] +++ OK, passed 100 tests.
  15220. 1328.57 s [vector] partitionWith: OK
  15221. 1328.57 s [vector] +++ OK, passed 100 tests.
  15222. 1328.58 s [vector] span: OK
  15223. 1328.58 s [vector] +++ OK, passed 100 tests.
  15224. 1328.58 s [vector] break: OK
  15225. 1328.58 s [vector] +++ OK, passed 100 tests.
  15226. 1328.58 s [vector] spanR: OK
  15227. 1328.58 s [vector] +++ OK, passed 100 tests.
  15228. 1328.58 s [vector] breakR: OK
  15229. 1328.58 s [vector] +++ OK, passed 100 tests.
  15230. 1328.59 s [vector] groupBy: OK (0.01s)
  15231. 1328.59 s [vector] +++ OK, passed 100 tests.
  15232. 1328.59 s [vector] elem: OK
  15233. 1328.60 s [vector] +++ OK, passed 100 tests.
  15234. 1328.60 s [vector] notElem: OK
  15235. 1328.60 s [vector] +++ OK, passed 100 tests.
  15236. 1328.60 s [vector] find: OK
  15237. 1328.60 s [vector] +++ OK, passed 100 tests.
  15238. 1328.60 s [vector] findIndex: OK
  15239. 1328.60 s [vector] +++ OK, passed 100 tests.
  15240. 1328.61 s [vector] findIndexR: OK
  15241. 1328.61 s [vector] +++ OK, passed 100 tests.
  15242. 1328.61 s [vector] findIndices: OK
  15243. 1328.61 s [vector] +++ OK, passed 100 tests.
  15244. 1328.61 s [vector] elemIndex: OK
  15245. 1328.61 s [vector] +++ OK, passed 100 tests.
  15246. 1328.62 s [vector] elemIndices: OK
  15247. 1328.62 s [vector] +++ OK, passed 100 tests.
  15248. 1328.62 s [vector] foldl: OK (0.01s)
  15249. 1328.62 s [vector] +++ OK, passed 100 tests.
  15250. 1328.64 s [vector] foldl1: OK (0.01s)
  15251. 1328.64 s [vector] +++ OK, passed 100 tests; 12 discarded.
  15252. 1328.66 s [vector] foldl': OK (0.01s)
  15253. 1328.66 s [vector] +++ OK, passed 100 tests.
  15254. 1328.67 s [vector] foldl1': OK (0.01s)
  15255. 1328.67 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15256. 1328.68 s [vector] foldr: OK (0.01s)
  15257. 1328.68 s [vector] +++ OK, passed 100 tests.
  15258. 1328.68 s [vector] foldr1: OK (0.01s)
  15259. 1328.69 s [vector] +++ OK, passed 100 tests; 20 discarded.
  15260. 1328.70 s [vector] foldr': OK (0.01s)
  15261. 1328.70 s [vector] +++ OK, passed 100 tests.
  15262. 1328.72 s [vector] foldr1': OK (0.01s)
  15263. 1328.72 s [vector] +++ OK, passed 100 tests; 13 discarded.
  15264. 1328.72 s [vector] ifoldl: OK (0.01s)
  15265. 1328.72 s [vector] +++ OK, passed 100 tests.
  15266. 1328.74 s [vector] ifoldl': OK (0.01s)
  15267. 1328.74 s [vector] +++ OK, passed 100 tests.
  15268. 1328.75 s [vector] ifoldr: OK (0.01s)
  15269. 1328.75 s [vector] +++ OK, passed 100 tests.
  15270. 1328.76 s [vector] ifoldr': OK (0.01s)
  15271. 1328.76 s [vector] +++ OK, passed 100 tests.
  15272. 1328.78 s [vector] ifoldM: OK (0.01s)
  15273. 1328.78 s [vector] +++ OK, passed 100 tests.
  15274. 1328.80 s [vector] ifoldM': OK (0.02s)
  15275. 1328.80 s [vector] +++ OK, passed 100 tests.
  15276. 1328.82 s [vector] ifoldM_: OK (0.03s)
  15277. 1328.82 s [vector] +++ OK, passed 100 tests.
  15278. 1328.86 s [vector] ifoldM'_: OK (0.04s)
  15279. 1328.86 s [vector] +++ OK, passed 100 tests.
  15280. 1328.86 s [vector] all: OK
  15281. 1328.87 s [vector] +++ OK, passed 100 tests.
  15282. 1328.87 s [vector] any: OK
  15283. 1328.87 s [vector] +++ OK, passed 100 tests.
  15284. 1328.88 s [vector] prescanl: OK (0.01s)
  15285. 1328.88 s [vector] +++ OK, passed 100 tests.
  15286. 1328.90 s [vector] prescanl': OK (0.01s)
  15287. 1328.90 s [vector] +++ OK, passed 100 tests.
  15288. 1328.91 s [vector] postscanl: OK (0.01s)
  15289. 1328.91 s [vector] +++ OK, passed 100 tests.
  15290. 1328.92 s [vector] postscanl': OK (0.02s)
  15291. 1328.92 s [vector] +++ OK, passed 100 tests.
  15292. 1328.96 s [vector] scanl: OK (0.02s)
  15293. 1328.96 s [vector] +++ OK, passed 100 tests.
  15294. 1328.96 s [vector] scanl': OK (0.01s)
  15295. 1328.96 s [vector] +++ OK, passed 100 tests.
  15296. 1328.98 s [vector] scanl1: OK (0.01s)
  15297. 1328.98 s [vector] +++ OK, passed 100 tests.
  15298. 1328.99 s [vector] scanl1': OK (0.01s)
  15299. 1328.99 s [vector] +++ OK, passed 100 tests.
  15300. 1329.00 s [vector] iscanl: OK (0.01s)
  15301. 1329.00 s [vector] +++ OK, passed 100 tests.
  15302. 1329.02 s [vector] iscanl': OK (0.01s)
  15303. 1329.02 s [vector] +++ OK, passed 100 tests.
  15304. 1329.02 s [vector] prescanr: OK (0.01s)
  15305. 1329.02 s [vector] +++ OK, passed 100 tests.
  15306. 1329.03 s [vector] prescanr': OK
  15307. 1329.03 s [vector] +++ OK, passed 100 tests.
  15308. 1329.04 s [vector] postscanr: OK (0.01s)
  15309. 1329.04 s [vector] +++ OK, passed 100 tests.
  15310. 1329.06 s [vector] postscanr': OK (0.01s)
  15311. 1329.06 s [vector] +++ OK, passed 100 tests.
  15312. 1329.09 s [vector] scanr: OK (0.01s)
  15313. 1329.09 s [vector] +++ OK, passed 100 tests.
  15314. 1329.10 s [vector] scanr': OK (0.02s)
  15315. 1329.10 s [vector] +++ OK, passed 100 tests.
  15316. 1329.12 s [vector] scanr1: OK (0.02s)
  15317. 1329.12 s [vector] +++ OK, passed 100 tests.
  15318. 1329.12 s [vector] scanr1': OK (0.01s)
  15319. 1329.12 s [vector] +++ OK, passed 100 tests.
  15320. 1329.14 s [vector] iscanr: OK (0.01s)
  15321. 1329.14 s [vector] +++ OK, passed 100 tests.
  15322. 1329.15 s [vector] iscanr': OK (0.01s)
  15323. 1329.15 s [vector] +++ OK, passed 100 tests.
  15324. 1329.15 s [vector] mut_read: OK
  15325. 1329.15 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15326. 1329.16 s [vector] mut_write: OK
  15327. 1329.16 s [vector] +++ OK, passed 100 tests; 12 discarded.
  15328. 1329.16 s [vector] mut_modify: OK
  15329. 1329.16 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15330. 1329.16 s [vector] mut_generate: OK
  15331. 1329.16 s [vector] +++ OK, passed 100 tests.
  15332. 1329.17 s [vector] mut_generateM: OK (0.02s)
  15333. 1329.17 s [vector] +++ OK, passed 100 tests.
  15334. 1329.20 s [vector] mut_mapM_: OK (0.02s)
  15335. 1329.20 s [vector] +++ OK, passed 100 tests.
  15336. 1329.24 s [vector] mut_imapM_: OK (0.03s)
  15337. 1329.24 s [vector] +++ OK, passed 100 tests.
  15338. 1329.26 s [vector] mut_forM_: OK (0.03s)
  15339. 1329.26 s [vector] +++ OK, passed 100 tests.
  15340. 1329.31 s [vector] mut_iforM_: OK (0.03s)
  15341. 1329.31 s [vector] +++ OK, passed 100 tests.
  15342. 1329.32 s [vector] mut_foldr: OK (0.02s)
  15343. 1329.33 s [vector] +++ OK, passed 100 tests.
  15344. 1329.34 s [vector] mut_foldr': OK (0.03s)
  15345. 1329.34 s [vector] +++ OK, passed 100 tests.
  15346. 1329.35 s [vector] mut_foldl: OK (0.01s)
  15347. 1329.35 s [vector] +++ OK, passed 100 tests.
  15348. 1329.38 s [vector] mut_foldl': OK
  15349. 1329.38 s [vector] +++ OK, passed 100 tests.
  15350. 1329.40 s [vector] mut_ifoldr: OK (0.02s)
  15351. 1329.40 s [vector] +++ OK, passed 100 tests.
  15352. 1329.42 s [vector] mut_ifoldr': OK (0.02s)
  15353. 1329.42 s [vector] +++ OK, passed 100 tests.
  15354. 1329.42 s [vector] mut_ifoldl: OK (0.02s)
  15355. 1329.42 s [vector] +++ OK, passed 100 tests.
  15356. 1329.44 s [vector] mut_ifoldl': OK (0.01s)
  15357. 1329.44 s [vector] +++ OK, passed 100 tests.
  15358. 1329.46 s [vector] mut_foldM: OK (0.02s)
  15359. 1329.46 s [vector] +++ OK, passed 100 tests.
  15360. 1329.47 s [vector] mut_foldM': OK (0.02s)
  15361. 1329.47 s [vector] +++ OK, passed 100 tests.
  15362. 1329.47 s [vector] mut_foldrM: OK (0.01s)
  15363. 1329.47 s [vector] +++ OK, passed 100 tests.
  15364. 1329.50 s [vector] mut_foldrM': OK (0.01s)
  15365. 1329.51 s [vector] +++ OK, passed 100 tests.
  15366. 1329.52 s [vector] mut_ifoldM: OK (0.01s)
  15367. 1329.52 s [vector] +++ OK, passed 100 tests.
  15368. 1329.53 s [vector] mut_ifoldM': OK (0.01s)
  15369. 1329.53 s [vector] +++ OK, passed 100 tests.
  15370. 1329.53 s [vector] mut_ifoldrM: OK
  15371. 1329.53 s [vector] +++ OK, passed 100 tests.
  15372. 1329.55 s [vector] mut_ifoldrM': OK
  15373. 1329.55 s [vector] +++ OK, passed 100 tests.
  15374. 1329.55 s [vector] compare: OK
  15375. 1329.55 s [vector] +++ OK, passed 100 tests.
  15376. 1329.55 s [vector] maximum: OK
  15377. 1329.55 s [vector] +++ OK, passed 100 tests; 13 discarded.
  15378. 1329.55 s [vector] minimum: OK
  15379. 1329.55 s [vector] +++ OK, passed 100 tests; 17 discarded.
  15380. 1329.55 s [vector] minIndex: OK
  15381. 1329.55 s [vector] +++ OK, passed 100 tests; 20 discarded.
  15382. 1329.55 s [vector] maxIndex: OK
  15383. 1329.55 s [vector] +++ OK, passed 100 tests; 21 discarded.
  15384. 1329.55 s [vector] maximumBy: OK
  15385. 1329.55 s [vector] +++ OK, passed 100 tests; 10 discarded.
  15386. 1329.55 s [vector] minimumBy: OK
  15387. 1329.56 s [vector] +++ OK, passed 100 tests; 12 discarded.
  15388. 1329.56 s [vector] maximumOn: OK
  15389. 1329.56 s [vector] +++ OK, passed 100 tests; 17 discarded.
  15390. 1329.56 s [vector] minimumOn: OK
  15391. 1329.56 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15392. 1329.56 s [vector] maxIndexBy: OK
  15393. 1329.56 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15394. 1329.56 s [vector] minIndexBy: OK
  15395. 1329.56 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15396. 1329.56 s [vector] ListFirstMaxIndexWins: OK
  15397. 1329.56 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15398. 1329.56 s [vector] FalseListFirstMaxIndexWins: OK
  15399. 1329.56 s [vector] +++ OK, failed as expected. (after 1 test):
  15400. 1329.56 s [vector] Exception:
  15401. 1329.56 s [vector] Prelude.foldr1: empty list
  15402. 1329.56 s [vector] CallStack (from HasCallStack):
  15403. 1329.56 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  15404. 1329.56 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  15405. 1329.56 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  15406. 1329.56 s [vector] []
  15407. 1329.57 s [vector] zip: OK
  15408. 1329.57 s [vector] +++ OK, passed 100 tests.
  15409. 1329.57 s [vector] zip3: OK
  15410. 1329.57 s [vector] +++ OK, passed 100 tests.
  15411. 1329.57 s [vector] unzip: OK
  15412. 1329.57 s [vector] +++ OK, passed 100 tests.
  15413. 1329.57 s [vector] unzip3: OK
  15414. 1329.57 s [vector] +++ OK, passed 100 tests.
  15415. 1329.58 s [vector] indexed: OK
  15416. 1329.58 s [vector] +++ OK, passed 100 tests.
  15417. 1329.58 s [vector] update: OK
  15418. 1329.58 s [vector] +++ OK, passed 100 tests.
  15419. 1329.58 s [vector] mempty: OK
  15420. 1329.58 s [vector] +++ OK, passed 100 tests.
  15421. 1329.58 s [vector] mappend: OK
  15422. 1329.58 s [vector] +++ OK, passed 100 tests.
  15423. 1329.60 s [vector] mconcat: OK (0.02s)
  15424. 1329.60 s [vector] +++ OK, passed 100 tests.
  15425. 1329.60 s [vector] glength: OK
  15426. 1329.60 s [vector] +++ OK, passed 100 tests.
  15427. 1329.60 s [vector] sum: OK
  15428. 1329.60 s [vector] +++ OK, passed 100 tests.
  15429. 1329.60 s [vector] product: OK
  15430. 1329.60 s [vector] +++ OK, passed 100 tests.
  15431. 1329.60 s [vector] enumFromN: OK
  15432. 1329.60 s [vector] +++ OK, passed 100 tests.
  15433. 1329.60 s [vector] enumFromThenN: OK
  15434. 1329.60 s [vector] +++ OK, passed 100 tests.
  15435. 1329.60 s [vector] enumFromTo: OK
  15436. 1329.60 s [vector] +++ OK, passed 100 tests.
  15437. 1329.60 s [vector] enumFromThenTo: OK
  15438. 1329.60 s [vector] +++ OK, passed 100 tests; 3 discarded.
  15439. 1329.60 s [vector] (Int,Bool)
  15440. 1329.60 s [vector] fromList.toList == id: OK
  15441. 1329.60 s [vector] +++ OK, passed 100 tests.
  15442. 1329.60 s [vector] toList.fromList == id: OK
  15443. 1329.60 s [vector] +++ OK, passed 100 tests.
  15444. 1329.60 s [vector] unstream.stream == id: OK
  15445. 1329.60 s [vector] +++ OK, passed 100 tests.
  15446. 1329.60 s [vector] stream.unstream == id: OK
  15447. 1329.60 s [vector] +++ OK, passed 100 tests.
  15448. 1329.61 s [vector] eq: OK
  15449. 1329.61 s [vector] +++ OK, passed 100 tests.
  15450. 1329.61 s [vector] length: OK
  15451. 1329.61 s [vector] +++ OK, passed 100 tests.
  15452. 1329.61 s [vector] null: OK
  15453. 1329.61 s [vector] +++ OK, passed 100 tests.
  15454. 1329.61 s [vector] index: OK
  15455. 1329.61 s [vector] +++ OK, passed 100 tests; 18 discarded.
  15456. 1329.61 s [vector] safeIndex: OK
  15457. 1329.61 s [vector] +++ OK, passed 100 tests.
  15458. 1329.61 s [vector] head: OK
  15459. 1329.61 s [vector] +++ OK, passed 100 tests; 18 discarded.
  15460. 1329.61 s [vector] last: OK
  15461. 1329.61 s [vector] +++ OK, passed 100 tests; 12 discarded.
  15462. 1329.61 s [vector] unsafeIndex: OK
  15463. 1329.61 s [vector] +++ OK, passed 100 tests; 22 discarded.
  15464. 1329.61 s [vector] unsafeHead: OK
  15465. 1329.61 s [vector] +++ OK, passed 100 tests; 12 discarded.
  15466. 1329.61 s [vector] unsafeLast: OK
  15467. 1329.61 s [vector] +++ OK, passed 100 tests; 12 discarded.
  15468. 1329.61 s [vector] slice: OK
  15469. 1329.61 s [vector] +++ OK, passed 100 tests.
  15470. 1329.61 s [vector] init: OK
  15471. 1329.62 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15472. 1329.62 s [vector] tail: OK
  15473. 1329.62 s [vector] +++ OK, passed 100 tests; 17 discarded.
  15474. 1329.62 s [vector] take: OK
  15475. 1329.62 s [vector] +++ OK, passed 100 tests.
  15476. 1329.62 s [vector] drop: OK
  15477. 1329.62 s [vector] +++ OK, passed 100 tests.
  15478. 1329.62 s [vector] splitAt: OK
  15479. 1329.62 s [vector] +++ OK, passed 100 tests.
  15480. 1329.62 s [vector] empty: OK
  15481. 1329.62 s [vector] +++ OK, passed 100 tests.
  15482. 1329.62 s [vector] singleton: OK
  15483. 1329.62 s [vector] +++ OK, passed 100 tests.
  15484. 1329.62 s [vector] replicate: OK
  15485. 1329.62 s [vector] +++ OK, passed 100 tests.
  15486. 1329.62 s [vector] generate: OK
  15487. 1329.62 s [vector] +++ OK, passed 100 tests.
  15488. 1329.62 s [vector] iterateN: OK
  15489. 1329.62 s [vector] +++ OK, passed 100 tests.
  15490. 1329.64 s [vector] iterateNM: OK (0.01s)
  15491. 1329.64 s [vector] +++ OK, passed 100 tests.
  15492. 1329.66 s [vector] generateM: OK (0.02s)
  15493. 1329.66 s [vector] +++ OK, passed 100 tests.
  15494. 1329.68 s [vector] replicateM: OK (0.02s)
  15495. 1329.68 s [vector] +++ OK, passed 100 tests.
  15496. 1329.68 s [vector] create: OK
  15497. 1329.68 s [vector] +++ OK, passed 100 tests.
  15498. 1329.68 s [vector] createT: OK
  15499. 1329.68 s [vector] +++ OK, passed 100 tests.
  15500. 1329.68 s [vector] unfoldr: OK
  15501. 1329.68 s [vector] +++ OK, passed 100 tests.
  15502. 1329.68 s [vector] unfoldrN: OK
  15503. 1329.68 s [vector] +++ OK, passed 100 tests.
  15504. 1329.68 s [vector] unfoldrExactN: OK
  15505. 1329.68 s [vector] +++ OK, passed 100 tests.
  15506. 1329.68 s [vector] unfoldrM: OK
  15507. 1329.68 s [vector] +++ OK, passed 100 tests.
  15508. 1329.70 s [vector] unfoldrNM: OK
  15509. 1329.70 s [vector] +++ OK, passed 100 tests.
  15510. 1329.72 s [vector] unfoldrExactNM: OK (0.03s)
  15511. 1329.72 s [vector] +++ OK, passed 100 tests.
  15512. 1329.72 s [vector] constructN: OK
  15513. 1329.73 s [vector] +++ OK, passed 100 tests.
  15514. 1329.73 s [vector] constructrN: OK
  15515. 1329.73 s [vector] +++ OK, passed 100 tests.
  15516. 1329.73 s [vector] cons: OK
  15517. 1329.73 s [vector] +++ OK, passed 100 tests.
  15518. 1329.74 s [vector] snoc: OK
  15519. 1329.74 s [vector] +++ OK, passed 100 tests.
  15520. 1329.74 s [vector] append: OK
  15521. 1329.74 s [vector] +++ OK, passed 100 tests.
  15522. 1329.76 s [vector] concat: OK (0.03s)
  15523. 1329.76 s [vector] +++ OK, passed 100 tests.
  15524. 1329.77 s [vector] force: OK
  15525. 1329.77 s [vector] +++ OK, passed 100 tests.
  15526. 1329.77 s [vector] upd: OK
  15527. 1329.77 s [vector] +++ OK, passed 100 tests.
  15528. 1329.77 s [vector] accum: OK
  15529. 1329.78 s [vector] +++ OK, passed 100 tests.
  15530. 1329.78 s [vector] reverse: OK
  15531. 1329.78 s [vector] +++ OK, passed 100 tests.
  15532. 1329.78 s [vector] backpermute: OK
  15533. 1329.79 s [vector] +++ OK, passed 100 tests.
  15534. 1329.79 s [vector] map: OK
  15535. 1329.80 s [vector] +++ OK, passed 100 tests.
  15536. 1329.80 s [vector] imap: OK
  15537. 1329.80 s [vector] +++ OK, passed 100 tests.
  15538. 1329.80 s [vector] concatMap: OK
  15539. 1329.80 s [vector] +++ OK, passed 100 tests.
  15540. 1329.80 s [vector] mapM: OK
  15541. 1329.80 s [vector] +++ OK, passed 100 tests.
  15542. 1329.84 s [vector] mapM_: OK (0.03s)
  15543. 1329.84 s [vector] +++ OK, passed 100 tests.
  15544. 1329.84 s [vector] forM: OK
  15545. 1329.84 s [vector] +++ OK, passed 100 tests.
  15546. 1329.86 s [vector] forM_: OK (0.03s)
  15547. 1329.86 s [vector] +++ OK, passed 100 tests.
  15548. 1329.86 s [vector] imapM: OK
  15549. 1329.86 s [vector] +++ OK, passed 100 tests.
  15550. 1329.89 s [vector] imapM_: OK (0.03s)
  15551. 1329.89 s [vector] +++ OK, passed 100 tests.
  15552. 1329.89 s [vector] zipWith: OK
  15553. 1329.90 s [vector] +++ OK, passed 100 tests.
  15554. 1329.90 s [vector] zipWith3: OK
  15555. 1329.90 s [vector] +++ OK, passed 100 tests.
  15556. 1329.91 s [vector] izipWith: OK
  15557. 1329.91 s [vector] +++ OK, passed 100 tests.
  15558. 1329.92 s [vector] izipWith3: OK
  15559. 1329.92 s [vector] +++ OK, passed 100 tests.
  15560. 1329.92 s [vector] izipWithM: OK
  15561. 1329.92 s [vector] +++ OK, passed 100 tests.
  15562. 1329.92 s [vector] izipWithM_: OK (0.02s)
  15563. 1329.92 s [vector] +++ OK, passed 100 tests.
  15564. 1329.94 s [vector] zipWithM: OK
  15565. 1329.94 s [vector] +++ OK, passed 100 tests.
  15566. 1329.95 s [vector] zipWithM_: OK (0.02s)
  15567. 1329.95 s [vector] +++ OK, passed 100 tests.
  15568. 1329.95 s [vector] filter: OK
  15569. 1329.95 s [vector] +++ OK, passed 100 tests.
  15570. 1329.96 s [vector] ifilter: OK
  15571. 1329.96 s [vector] +++ OK, passed 100 tests.
  15572. 1330.01 s [vector] filterM: OK (0.05s)
  15573. 1330.01 s [vector] +++ OK, passed 100 tests.
  15574. 1330.01 s [vector] uniq: OK
  15575. 1330.01 s [vector] +++ OK, passed 100 tests.
  15576. 1330.01 s [vector] mapMaybe: OK
  15577. 1330.01 s [vector] +++ OK, passed 100 tests.
  15578. 1330.01 s [vector] imapMaybe: OK
  15579. 1330.01 s [vector] +++ OK, passed 100 tests.
  15580. 1330.01 s [vector] takeWhile: OK
  15581. 1330.01 s [vector] +++ OK, passed 100 tests.
  15582. 1330.02 s [vector] dropWhile: OK
  15583. 1330.02 s [vector] +++ OK, passed 100 tests.
  15584. 1330.02 s [vector] partition: OK
  15585. 1330.02 s [vector] +++ OK, passed 100 tests.
  15586. 1330.02 s [vector] partitionWith: OK
  15587. 1330.03 s [vector] +++ OK, passed 100 tests.
  15588. 1330.03 s [vector] span: OK
  15589. 1330.03 s [vector] +++ OK, passed 100 tests.
  15590. 1330.03 s [vector] break: OK
  15591. 1330.03 s [vector] +++ OK, passed 100 tests.
  15592. 1330.03 s [vector] spanR: OK
  15593. 1330.03 s [vector] +++ OK, passed 100 tests.
  15594. 1330.03 s [vector] breakR: OK
  15595. 1330.03 s [vector] +++ OK, passed 100 tests.
  15596. 1330.04 s [vector] groupBy: OK
  15597. 1330.04 s [vector] +++ OK, passed 100 tests.
  15598. 1330.04 s [vector] elem: OK
  15599. 1330.04 s [vector] +++ OK, passed 100 tests.
  15600. 1330.04 s [vector] notElem: OK
  15601. 1330.04 s [vector] +++ OK, passed 100 tests.
  15602. 1330.05 s [vector] find: OK
  15603. 1330.05 s [vector] +++ OK, passed 100 tests.
  15604. 1330.05 s [vector] findIndex: OK
  15605. 1330.06 s [vector] +++ OK, passed 100 tests.
  15606. 1330.06 s [vector] findIndexR: OK
  15607. 1330.06 s [vector] +++ OK, passed 100 tests.
  15608. 1330.06 s [vector] findIndices: OK
  15609. 1330.06 s [vector] +++ OK, passed 100 tests.
  15610. 1330.06 s [vector] elemIndex: OK
  15611. 1330.06 s [vector] +++ OK, passed 100 tests.
  15612. 1330.06 s [vector] elemIndices: OK
  15613. 1330.06 s [vector] +++ OK, passed 100 tests.
  15614. 1330.06 s [vector] foldl: OK
  15615. 1330.07 s [vector] +++ OK, passed 100 tests.
  15616. 1330.07 s [vector] foldl1: OK
  15617. 1330.08 s [vector] +++ OK, passed 100 tests; 13 discarded.
  15618. 1330.08 s [vector] foldl': OK
  15619. 1330.08 s [vector] +++ OK, passed 100 tests.
  15620. 1330.08 s [vector] foldl1': OK
  15621. 1330.08 s [vector] +++ OK, passed 100 tests; 12 discarded.
  15622. 1330.08 s [vector] foldr: OK
  15623. 1330.08 s [vector] +++ OK, passed 100 tests.
  15624. 1330.08 s [vector] foldr1: OK
  15625. 1330.08 s [vector] +++ OK, passed 100 tests; 13 discarded.
  15626. 1330.08 s [vector] foldr': OK
  15627. 1330.09 s [vector] +++ OK, passed 100 tests.
  15628. 1330.10 s [vector] foldr1': OK
  15629. 1330.10 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15630. 1330.10 s [vector] ifoldl: OK
  15631. 1330.10 s [vector] +++ OK, passed 100 tests.
  15632. 1330.10 s [vector] ifoldl': OK
  15633. 1330.10 s [vector] +++ OK, passed 100 tests.
  15634. 1330.11 s [vector] ifoldr: OK
  15635. 1330.12 s [vector] +++ OK, passed 100 tests.
  15636. 1330.13 s [vector] ifoldr': OK
  15637. 1330.13 s [vector] +++ OK, passed 100 tests.
  15638. 1330.13 s [vector] ifoldM: OK
  15639. 1330.13 s [vector] +++ OK, passed 100 tests.
  15640. 1330.14 s [vector] ifoldM': OK
  15641. 1330.14 s [vector] +++ OK, passed 100 tests.
  15642. 1330.16 s [vector] ifoldM_: OK (0.03s)
  15643. 1330.16 s [vector] +++ OK, passed 100 tests.
  15644. 1330.19 s [vector] ifoldM'_: OK (0.02s)
  15645. 1330.19 s [vector] +++ OK, passed 100 tests.
  15646. 1330.19 s [vector] all: OK
  15647. 1330.19 s [vector] +++ OK, passed 100 tests.
  15648. 1330.19 s [vector] any: OK
  15649. 1330.19 s [vector] +++ OK, passed 100 tests.
  15650. 1330.20 s [vector] prescanl: OK
  15651. 1330.20 s [vector] +++ OK, passed 100 tests.
  15652. 1330.20 s [vector] prescanl': OK
  15653. 1330.21 s [vector] +++ OK, passed 100 tests.
  15654. 1330.21 s [vector] postscanl: OK
  15655. 1330.21 s [vector] +++ OK, passed 100 tests.
  15656. 1330.21 s [vector] postscanl': OK
  15657. 1330.22 s [vector] +++ OK, passed 100 tests.
  15658. 1330.22 s [vector] scanl: OK
  15659. 1330.22 s [vector] +++ OK, passed 100 tests.
  15660. 1330.23 s [vector] scanl': OK
  15661. 1330.23 s [vector] +++ OK, passed 100 tests.
  15662. 1330.24 s [vector] scanl1: OK
  15663. 1330.26 s [vector] +++ OK, passed 100 tests.
  15664. 1330.26 s [vector] scanl1': OK (0.01s)
  15665. 1330.26 s [vector] +++ OK, passed 100 tests.
  15666. 1330.28 s [vector] iscanl: OK (0.02s)
  15667. 1330.28 s [vector] +++ OK, passed 100 tests.
  15668. 1330.28 s [vector] iscanl': OK (0.01s)
  15669. 1330.28 s [vector] +++ OK, passed 100 tests.
  15670. 1330.30 s [vector] prescanr: OK
  15671. 1330.30 s [vector] +++ OK, passed 100 tests.
  15672. 1330.30 s [vector] prescanr': OK (0.01s)
  15673. 1330.30 s [vector] +++ OK, passed 100 tests.
  15674. 1330.32 s [vector] postscanr: OK
  15675. 1330.32 s [vector] +++ OK, passed 100 tests.
  15676. 1330.32 s [vector] postscanr': OK (0.01s)
  15677. 1330.32 s [vector] +++ OK, passed 100 tests.
  15678. 1330.33 s [vector] scanr: OK
  15679. 1330.34 s [vector] +++ OK, passed 100 tests.
  15680. 1330.35 s [vector] scanr': OK (0.01s)
  15681. 1330.35 s [vector] +++ OK, passed 100 tests.
  15682. 1330.36 s [vector] scanr1: OK (0.01s)
  15683. 1330.36 s [vector] +++ OK, passed 100 tests.
  15684. 1330.38 s [vector] scanr1': OK (0.01s)
  15685. 1330.38 s [vector] +++ OK, passed 100 tests.
  15686. 1330.40 s [vector] iscanr: OK (0.01s)
  15687. 1330.40 s [vector] +++ OK, passed 100 tests.
  15688. 1330.40 s [vector] iscanr': OK (0.01s)
  15689. 1330.40 s [vector] +++ OK, passed 100 tests.
  15690. 1330.41 s [vector] mut_read: OK
  15691. 1330.41 s [vector] +++ OK, passed 100 tests; 11 discarded.
  15692. 1330.42 s [vector] mut_write: OK
  15693. 1330.42 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15694. 1330.43 s [vector] mut_modify: OK
  15695. 1330.43 s [vector] +++ OK, passed 100 tests; 25 discarded.
  15696. 1330.43 s [vector] mut_generate: OK
  15697. 1330.44 s [vector] +++ OK, passed 100 tests.
  15698. 1330.45 s [vector] mut_generateM: OK (0.02s)
  15699. 1330.72 s [vector] +++ OK, passed 100 tests.
  15700. 1330.72 s [vector] mut_mapM_: OK (0.03s)
  15701. 1330.72 s [vector] +++ OK, passed 100 tests.
  15702. 1330.72 s [vector] mut_imapM_: OK (0.05s)
  15703. 1330.72 s [vector] +++ OK, passed 100 tests.
  15704. 1330.72 s [vector] mut_forM_: OK (0.03s)
  15705. 1330.72 s [vector] +++ OK, passed 100 tests.
  15706. 1330.72 s [vector] mut_iforM_: OK (0.06s)
  15707. 1330.72 s [vector] +++ OK, passed 100 tests.
  15708. 1330.72 s [vector] mut_foldr: OK
  15709. 1330.72 s [vector] +++ OK, passed 100 tests.
  15710. 1330.72 s [vector] mut_foldr': OK
  15711. 1330.72 s [vector] +++ OK, passed 100 tests.
  15712. 1330.72 s [vector] mut_foldl: OK (0.01s)
  15713. 1330.72 s [vector] +++ OK, passed 100 tests.
  15714. 1330.72 s [vector] mut_foldl': OK
  15715. 1330.72 s [vector] +++ OK, passed 100 tests.
  15716. 1330.72 s [vector] mut_ifoldr: OK
  15717. 1330.72 s [vector] +++ OK, passed 100 tests.
  15718. 1330.72 s [vector] mut_ifoldr': OK
  15719. 1330.72 s [vector] +++ OK, passed 100 tests.
  15720. 1330.72 s [vector] mut_ifoldl: OK
  15721. 1330.72 s [vector] +++ OK, passed 100 tests.
  15722. 1330.72 s [vector] mut_ifoldl': OK
  15723. 1330.72 s [vector] +++ OK, passed 100 tests.
  15724. 1330.72 s [vector] mut_foldM: OK
  15725. 1330.72 s [vector] +++ OK, passed 100 tests.
  15726. 1330.72 s [vector] mut_foldM': OK
  15727. 1330.72 s [vector] +++ OK, passed 100 tests.
  15728. 1330.72 s [vector] mut_foldrM: OK
  15729. 1330.72 s [vector] +++ OK, passed 100 tests.
  15730. 1330.72 s [vector] mut_foldrM': OK
  15731. 1330.72 s [vector] +++ OK, passed 100 tests.
  15732. 1330.73 s [vector] mut_ifoldM: OK
  15733. 1330.73 s [vector] +++ OK, passed 100 tests.
  15734. 1330.73 s [vector] mut_ifoldM': OK
  15735. 1330.74 s [vector] +++ OK, passed 100 tests.
  15736. 1330.74 s [vector] mut_ifoldrM: OK
  15737. 1330.74 s [vector] +++ OK, passed 100 tests.
  15738. 1330.75 s [vector] mut_ifoldrM': OK
  15739. 1330.75 s [vector] +++ OK, passed 100 tests.
  15740. 1330.75 s [vector] compare: OK
  15741. 1330.75 s [vector] +++ OK, passed 100 tests.
  15742. 1330.75 s [vector] maximum: OK
  15743. 1330.75 s [vector] +++ OK, passed 100 tests; 19 discarded.
  15744. 1330.75 s [vector] minimum: OK
  15745. 1330.75 s [vector] +++ OK, passed 100 tests; 21 discarded.
  15746. 1330.76 s [vector] minIndex: OK
  15747. 1330.76 s [vector] +++ OK, passed 100 tests; 11 discarded.
  15748. 1330.76 s [vector] maxIndex: OK
  15749. 1330.76 s [vector] +++ OK, passed 100 tests; 22 discarded.
  15750. 1330.76 s [vector] maximumBy: OK
  15751. 1330.76 s [vector] +++ OK, passed 100 tests; 20 discarded.
  15752. 1330.77 s [vector] minimumBy: OK
  15753. 1330.77 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15754. 1330.77 s [vector] maximumOn: OK
  15755. 1330.77 s [vector] +++ OK, passed 100 tests; 18 discarded.
  15756. 1330.77 s [vector] minimumOn: OK
  15757. 1330.77 s [vector] +++ OK, passed 100 tests; 13 discarded.
  15758. 1330.77 s [vector] maxIndexBy: OK
  15759. 1330.78 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15760. 1330.78 s [vector] minIndexBy: OK
  15761. 1330.78 s [vector] +++ OK, passed 100 tests; 13 discarded.
  15762. 1330.78 s [vector] ListFirstMaxIndexWins: OK
  15763. 1330.78 s [vector] +++ OK, passed 100 tests; 22 discarded.
  15764. 1330.78 s [vector] FalseListFirstMaxIndexWins: OK
  15765. 1330.78 s [vector] +++ OK, failed as expected. (after 1 test):
  15766. 1330.78 s [vector] Exception:
  15767. 1330.78 s [vector] Prelude.foldr1: empty list
  15768. 1330.78 s [vector] CallStack (from HasCallStack):
  15769. 1330.78 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  15770. 1330.79 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  15771. 1330.79 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  15772. 1330.79 s [vector] []
  15773. 1330.79 s [vector] zip: OK
  15774. 1330.79 s [vector] +++ OK, passed 100 tests.
  15775. 1330.80 s [vector] zip3: OK
  15776. 1330.80 s [vector] +++ OK, passed 100 tests.
  15777. 1330.80 s [vector] unzip: OK
  15778. 1330.80 s [vector] +++ OK, passed 100 tests.
  15779. 1330.82 s [vector] unzip3: OK (0.01s)
  15780. 1330.82 s [vector] +++ OK, passed 100 tests.
  15781. 1330.82 s [vector] indexed: OK
  15782. 1330.82 s [vector] +++ OK, passed 100 tests.
  15783. 1330.83 s [vector] update: OK
  15784. 1330.83 s [vector] +++ OK, passed 100 tests.
  15785. 1330.83 s [vector] mempty: OK
  15786. 1330.84 s [vector] +++ OK, passed 100 tests.
  15787. 1330.86 s [vector] mappend: OK
  15788. 1330.86 s [vector] +++ OK, passed 100 tests.
  15789. 1330.90 s [vector] mconcat: OK (0.05s)
  15790. 1330.90 s [vector] +++ OK, passed 100 tests.
  15791. 1330.91 s [vector] glength: OK
  15792. 1330.91 s [vector] +++ OK, passed 100 tests.
  15793. 1330.91 s [vector] (Int,Bool,Int)
  15794. 1330.91 s [vector] fromList.toList == id: OK
  15795. 1330.91 s [vector] +++ OK, passed 100 tests.
  15796. 1330.91 s [vector] toList.fromList == id: OK
  15797. 1330.91 s [vector] +++ OK, passed 100 tests.
  15798. 1330.91 s [vector] unstream.stream == id: OK
  15799. 1330.91 s [vector] +++ OK, passed 100 tests.
  15800. 1330.91 s [vector] stream.unstream == id: OK
  15801. 1330.91 s [vector] +++ OK, passed 100 tests.
  15802. 1330.91 s [vector] eq: OK
  15803. 1330.91 s [vector] +++ OK, passed 100 tests.
  15804. 1330.91 s [vector] length: OK
  15805. 1330.91 s [vector] +++ OK, passed 100 tests.
  15806. 1330.91 s [vector] null: OK
  15807. 1330.91 s [vector] +++ OK, passed 100 tests.
  15808. 1330.91 s [vector] index: OK
  15809. 1330.91 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15810. 1330.91 s [vector] safeIndex: OK
  15811. 1330.91 s [vector] +++ OK, passed 100 tests.
  15812. 1330.91 s [vector] head: OK
  15813. 1330.91 s [vector] +++ OK, passed 100 tests; 19 discarded.
  15814. 1330.91 s [vector] last: OK
  15815. 1330.91 s [vector] +++ OK, passed 100 tests; 17 discarded.
  15816. 1330.91 s [vector] unsafeIndex: OK
  15817. 1330.91 s [vector] +++ OK, passed 100 tests; 13 discarded.
  15818. 1330.91 s [vector] unsafeHead: OK
  15819. 1330.91 s [vector] +++ OK, passed 100 tests; 19 discarded.
  15820. 1330.91 s [vector] unsafeLast: OK
  15821. 1330.91 s [vector] +++ OK, passed 100 tests; 13 discarded.
  15822. 1330.91 s [vector] slice: OK
  15823. 1330.92 s [vector] +++ OK, passed 100 tests.
  15824. 1330.92 s [vector] init: OK
  15825. 1330.92 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15826. 1330.92 s [vector] tail: OK
  15827. 1330.92 s [vector] +++ OK, passed 100 tests; 22 discarded.
  15828. 1330.92 s [vector] take: OK
  15829. 1330.92 s [vector] +++ OK, passed 100 tests.
  15830. 1330.92 s [vector] drop: OK
  15831. 1330.92 s [vector] +++ OK, passed 100 tests.
  15832. 1330.92 s [vector] splitAt: OK
  15833. 1330.92 s [vector] +++ OK, passed 100 tests.
  15834. 1330.92 s [vector] empty: OK
  15835. 1330.92 s [vector] +++ OK, passed 100 tests.
  15836. 1330.92 s [vector] singleton: OK
  15837. 1330.92 s [vector] +++ OK, passed 100 tests.
  15838. 1330.92 s [vector] replicate: OK
  15839. 1330.92 s [vector] +++ OK, passed 100 tests.
  15840. 1330.93 s [vector] generate: OK
  15841. 1330.93 s [vector] +++ OK, passed 100 tests.
  15842. 1330.93 s [vector] iterateN: OK
  15843. 1330.94 s [vector] +++ OK, passed 100 tests.
  15844. 1330.97 s [vector] iterateNM: OK (0.02s)
  15845. 1330.97 s [vector] +++ OK, passed 100 tests.
  15846. 1331.00 s [vector] generateM: OK (0.05s)
  15847. 1331.00 s [vector] +++ OK, passed 100 tests.
  15848. 1331.00 s [vector] replicateM: OK
  15849. 1331.00 s [vector] +++ OK, passed 100 tests.
  15850. 1331.00 s [vector] create: OK
  15851. 1331.00 s [vector] +++ OK, passed 100 tests.
  15852. 1331.01 s [vector] createT: OK
  15853. 1331.01 s [vector] +++ OK, passed 100 tests.
  15854. 1331.01 s [vector] unfoldr: OK
  15855. 1331.01 s [vector] +++ OK, passed 100 tests.
  15856. 1331.01 s [vector] unfoldrN: OK
  15857. 1331.01 s [vector] +++ OK, passed 100 tests.
  15858. 1331.01 s [vector] unfoldrExactN: OK
  15859. 1331.01 s [vector] +++ OK, passed 100 tests.
  15860. 1331.01 s [vector] unfoldrM: OK
  15861. 1331.02 s [vector] +++ OK, passed 100 tests.
  15862. 1331.02 s [vector] unfoldrNM: OK
  15863. 1331.02 s [vector] +++ OK, passed 100 tests.
  15864. 1331.06 s [vector] unfoldrExactNM: OK (0.03s)
  15865. 1331.06 s [vector] +++ OK, passed 100 tests.
  15866. 1331.06 s [vector] constructN: OK (0.02s)
  15867. 1331.06 s [vector] +++ OK, passed 100 tests.
  15868. 1331.08 s [vector] constructrN: OK (0.01s)
  15869. 1331.08 s [vector] +++ OK, passed 100 tests.
  15870. 1331.08 s [vector] cons: OK
  15871. 1331.08 s [vector] +++ OK, passed 100 tests.
  15872. 1331.08 s [vector] snoc: OK
  15873. 1331.08 s [vector] +++ OK, passed 100 tests.
  15874. 1331.10 s [vector] append: OK
  15875. 1331.10 s [vector] +++ OK, passed 100 tests.
  15876. 1331.14 s [vector] concat: OK (0.05s)
  15877. 1331.14 s [vector] +++ OK, passed 100 tests.
  15878. 1331.14 s [vector] force: OK
  15879. 1331.16 s [vector] +++ OK, passed 100 tests.
  15880. 1331.16 s [vector] upd: OK
  15881. 1331.16 s [vector] +++ OK, passed 100 tests.
  15882. 1331.16 s [vector] accum: OK (0.01s)
  15883. 1331.16 s [vector] +++ OK, passed 100 tests.
  15884. 1331.16 s [vector] reverse: OK
  15885. 1331.16 s [vector] +++ OK, passed 100 tests.
  15886. 1331.17 s [vector] backpermute: OK
  15887. 1331.17 s [vector] +++ OK, passed 100 tests.
  15888. 1331.18 s [vector] map: OK
  15889. 1331.18 s [vector] +++ OK, passed 100 tests.
  15890. 1331.19 s [vector] imap: OK
  15891. 1331.19 s [vector] +++ OK, passed 100 tests.
  15892. 1331.20 s [vector] concatMap: OK (0.01s)
  15893. 1331.20 s [vector] +++ OK, passed 100 tests.
  15894. 1331.20 s [vector] mapM: OK
  15895. 1331.20 s [vector] +++ OK, passed 100 tests.
  15896. 1331.28 s [vector] mapM_: OK (0.04s)
  15897. 1331.28 s [vector] +++ OK, passed 100 tests.
  15898. 1331.28 s [vector] forM: OK
  15899. 1331.28 s [vector] +++ OK, passed 100 tests.
  15900. 1331.36 s [vector] forM_: OK (0.07s)
  15901. 1331.36 s [vector] +++ OK, passed 100 tests.
  15902. 1331.36 s [vector] imapM: OK (0.01s)
  15903. 1331.36 s [vector] +++ OK, passed 100 tests.
  15904. 1331.40 s [vector] imapM_: OK (0.04s)
  15905. 1331.40 s [vector] +++ OK, passed 100 tests.
  15906. 1331.41 s [vector] zipWith: OK
  15907. 1331.42 s [vector] +++ OK, passed 100 tests.
  15908. 1331.42 s [vector] zipWith3: OK
  15909. 1331.42 s [vector] +++ OK, passed 100 tests.
  15910. 1331.43 s [vector] izipWith: OK
  15911. 1331.43 s [vector] +++ OK, passed 100 tests.
  15912. 1331.43 s [vector] izipWith3: OK
  15913. 1331.43 s [vector] +++ OK, passed 100 tests.
  15914. 1331.43 s [vector] izipWithM: OK
  15915. 1331.43 s [vector] +++ OK, passed 100 tests.
  15916. 1331.46 s [vector] izipWithM_: OK (0.03s)
  15917. 1331.46 s [vector] +++ OK, passed 100 tests.
  15918. 1331.47 s [vector] zipWithM: OK
  15919. 1331.47 s [vector] +++ OK, passed 100 tests.
  15920. 1331.50 s [vector] zipWithM_: OK (0.03s)
  15921. 1331.50 s [vector] +++ OK, passed 100 tests.
  15922. 1331.50 s [vector] filter: OK
  15923. 1331.50 s [vector] +++ OK, passed 100 tests.
  15924. 1331.51 s [vector] ifilter: OK
  15925. 1331.51 s [vector] +++ OK, passed 100 tests.
  15926. 1331.58 s [vector] filterM: OK (0.07s)
  15927. 1331.58 s [vector] +++ OK, passed 100 tests.
  15928. 1331.58 s [vector] uniq: OK
  15929. 1331.58 s [vector] +++ OK, passed 100 tests.
  15930. 1331.60 s [vector] mapMaybe: OK (0.02s)
  15931. 1331.60 s [vector] +++ OK, passed 100 tests.
  15932. 1331.60 s [vector] imapMaybe: OK
  15933. 1331.60 s [vector] +++ OK, passed 100 tests.
  15934. 1331.61 s [vector] takeWhile: OK
  15935. 1331.62 s [vector] +++ OK, passed 100 tests.
  15936. 1331.62 s [vector] dropWhile: OK
  15937. 1331.62 s [vector] +++ OK, passed 100 tests.
  15938. 1331.62 s [vector] partition: OK
  15939. 1331.62 s [vector] +++ OK, passed 100 tests.
  15940. 1331.62 s [vector] partitionWith: OK
  15941. 1331.63 s [vector] +++ OK, passed 100 tests.
  15942. 1331.63 s [vector] span: OK
  15943. 1331.63 s [vector] +++ OK, passed 100 tests.
  15944. 1331.63 s [vector] break: OK
  15945. 1331.63 s [vector] +++ OK, passed 100 tests.
  15946. 1331.64 s [vector] spanR: OK
  15947. 1331.64 s [vector] +++ OK, passed 100 tests.
  15948. 1331.64 s [vector] breakR: OK
  15949. 1331.64 s [vector] +++ OK, passed 100 tests.
  15950. 1331.65 s [vector] groupBy: OK
  15951. 1331.65 s [vector] +++ OK, passed 100 tests.
  15952. 1331.65 s [vector] elem: OK
  15953. 1331.65 s [vector] +++ OK, passed 100 tests.
  15954. 1331.65 s [vector] notElem: OK
  15955. 1331.65 s [vector] +++ OK, passed 100 tests.
  15956. 1331.65 s [vector] find: OK
  15957. 1331.65 s [vector] +++ OK, passed 100 tests.
  15958. 1331.65 s [vector] findIndex: OK
  15959. 1331.65 s [vector] +++ OK, passed 100 tests.
  15960. 1331.66 s [vector] findIndexR: OK
  15961. 1331.66 s [vector] +++ OK, passed 100 tests.
  15962. 1331.66 s [vector] findIndices: OK
  15963. 1331.66 s [vector] +++ OK, passed 100 tests.
  15964. 1331.66 s [vector] elemIndex: OK
  15965. 1331.66 s [vector] +++ OK, passed 100 tests.
  15966. 1331.66 s [vector] elemIndices: OK
  15967. 1331.66 s [vector] +++ OK, passed 100 tests.
  15968. 1331.67 s [vector] foldl: OK
  15969. 1331.67 s [vector] +++ OK, passed 100 tests.
  15970. 1331.68 s [vector] foldl1: OK
  15971. 1331.68 s [vector] +++ OK, passed 100 tests; 18 discarded.
  15972. 1331.68 s [vector] foldl': OK
  15973. 1331.68 s [vector] +++ OK, passed 100 tests.
  15974. 1331.69 s [vector] foldl1': OK
  15975. 1331.69 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15976. 1331.69 s [vector] foldr: OK
  15977. 1331.69 s [vector] +++ OK, passed 100 tests.
  15978. 1331.70 s [vector] foldr1: OK
  15979. 1331.70 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15980. 1331.71 s [vector] foldr': OK
  15981. 1331.72 s [vector] +++ OK, passed 100 tests.
  15982. 1331.72 s [vector] foldr1': OK
  15983. 1331.73 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15984. 1331.73 s [vector] ifoldl: OK
  15985. 1331.74 s [vector] +++ OK, passed 100 tests.
  15986. 1331.74 s [vector] ifoldl': OK
  15987. 1331.75 s [vector] +++ OK, passed 100 tests.
  15988. 1331.75 s [vector] ifoldr: OK
  15989. 1331.76 s [vector] +++ OK, passed 100 tests.
  15990. 1331.76 s [vector] ifoldr': OK
  15991. 1331.76 s [vector] +++ OK, passed 100 tests.
  15992. 1331.76 s [vector] ifoldM: OK
  15993. 1331.76 s [vector] +++ OK, passed 100 tests.
  15994. 1331.76 s [vector] ifoldM': OK
  15995. 1331.76 s [vector] +++ OK, passed 100 tests.
  15996. 1331.80 s [vector] ifoldM_: OK (0.04s)
  15997. 1331.80 s [vector] +++ OK, passed 100 tests.
  15998. 1331.83 s [vector] ifoldM'_: OK (0.03s)
  15999. 1331.83 s [vector] +++ OK, passed 100 tests.
  16000. 1331.83 s [vector] all: OK
  16001. 1331.83 s [vector] +++ OK, passed 100 tests.
  16002. 1331.84 s [vector] any: OK
  16003. 1331.84 s [vector] +++ OK, passed 100 tests.
  16004. 1331.84 s [vector] prescanl: OK
  16005. 1331.84 s [vector] +++ OK, passed 100 tests.
  16006. 1331.85 s [vector] prescanl': OK
  16007. 1331.85 s [vector] +++ OK, passed 100 tests.
  16008. 1331.86 s [vector] postscanl: OK
  16009. 1331.86 s [vector] +++ OK, passed 100 tests.
  16010. 1331.87 s [vector] postscanl': OK
  16011. 1331.87 s [vector] +++ OK, passed 100 tests.
  16012. 1331.88 s [vector] scanl: OK
  16013. 1331.88 s [vector] +++ OK, passed 100 tests.
  16014. 1331.89 s [vector] scanl': OK
  16015. 1331.89 s [vector] +++ OK, passed 100 tests.
  16016. 1331.89 s [vector] scanl1: OK
  16017. 1331.90 s [vector] +++ OK, passed 100 tests.
  16018. 1331.90 s [vector] scanl1': OK
  16019. 1331.91 s [vector] +++ OK, passed 100 tests.
  16020. 1331.91 s [vector] iscanl: OK
  16021. 1331.91 s [vector] +++ OK, passed 100 tests.
  16022. 1331.91 s [vector] iscanl': OK
  16023. 1331.91 s [vector] +++ OK, passed 100 tests.
  16024. 1331.91 s [vector] prescanr: OK
  16025. 1331.91 s [vector] +++ OK, passed 100 tests.
  16026. 1331.91 s [vector] prescanr': OK
  16027. 1331.92 s [vector] +++ OK, passed 100 tests.
  16028. 1331.92 s [vector] postscanr: OK
  16029. 1331.92 s [vector] +++ OK, passed 100 tests.
  16030. 1331.94 s [vector] postscanr': OK (0.01s)
  16031. 1331.94 s [vector] +++ OK, passed 100 tests.
  16032. 1331.94 s [vector] scanr: OK
  16033. 1331.94 s [vector] +++ OK, passed 100 tests.
  16034. 1331.96 s [vector] scanr': OK
  16035. 1331.96 s [vector] +++ OK, passed 100 tests.
  16036. 1331.96 s [vector] scanr1: OK
  16037. 1331.97 s [vector] +++ OK, passed 100 tests.
  16038. 1331.98 s [vector] scanr1': OK
  16039. 1331.98 s [vector] +++ OK, passed 100 tests.
  16040. 1331.98 s [vector] iscanr: OK
  16041. 1331.98 s [vector] +++ OK, passed 100 tests.
  16042. 1331.98 s [vector] iscanr': OK
  16043. 1331.98 s [vector] +++ OK, passed 100 tests.
  16044. 1331.98 s [vector] mut_read: OK
  16045. 1331.98 s [vector] +++ OK, passed 100 tests; 25 discarded.
  16046. 1331.98 s [vector] mut_write: OK
  16047. 1331.98 s [vector] +++ OK, passed 100 tests; 17 discarded.
  16048. 1331.98 s [vector] mut_modify: OK
  16049. 1331.98 s [vector] +++ OK, passed 100 tests; 16 discarded.
  16050. 1331.98 s [vector] mut_generate: OK
  16051. 1331.98 s [vector] +++ OK, passed 100 tests.
  16052. 1332.00 s [vector] mut_generateM: OK
  16053. 1332.00 s [vector] +++ OK, passed 100 tests.
  16054. 1332.06 s [vector] mut_mapM_: OK (0.05s)
  16055. 1332.06 s [vector] +++ OK, passed 100 tests.
  16056. 1332.10 s [vector] mut_imapM_: OK (0.03s)
  16057. 1332.10 s [vector] +++ OK, passed 100 tests.
  16058. 1332.14 s [vector] mut_forM_: OK (0.05s)
  16059. 1332.14 s [vector] +++ OK, passed 100 tests.
  16060. 1332.18 s [vector] mut_iforM_: OK (0.04s)
  16061. 1332.18 s [vector] +++ OK, passed 100 tests.
  16062. 1332.18 s [vector] mut_foldr: OK
  16063. 1332.18 s [vector] +++ OK, passed 100 tests.
  16064. 1332.19 s [vector] mut_foldr': OK
  16065. 1332.19 s [vector] +++ OK, passed 100 tests.
  16066. 1332.19 s [vector] mut_foldl: OK
  16067. 1332.19 s [vector] +++ OK, passed 100 tests.
  16068. 1332.20 s [vector] mut_foldl': OK
  16069. 1332.20 s [vector] +++ OK, passed 100 tests.
  16070. 1332.21 s [vector] mut_ifoldr: OK
  16071. 1332.21 s [vector] +++ OK, passed 100 tests.
  16072. 1332.21 s [vector] mut_ifoldr': OK
  16073. 1332.22 s [vector] +++ OK, passed 100 tests.
  16074. 1332.23 s [vector] mut_ifoldl: OK (0.01s)
  16075. 1332.23 s [vector] +++ OK, passed 100 tests.
  16076. 1332.23 s [vector] mut_ifoldl': OK
  16077. 1332.24 s [vector] +++ OK, passed 100 tests.
  16078. 1332.24 s [vector] mut_foldM: OK
  16079. 1332.24 s [vector] +++ OK, passed 100 tests.
  16080. 1332.25 s [vector] mut_foldM': OK
  16081. 1332.25 s [vector] +++ OK, passed 100 tests.
  16082. 1332.25 s [vector] mut_foldrM: OK
  16083. 1332.26 s [vector] +++ OK, passed 100 tests.
  16084. 1332.27 s [vector] mut_foldrM': OK
  16085. 1332.28 s [vector] +++ OK, passed 100 tests.
  16086. 1332.28 s [vector] mut_ifoldM: OK
  16087. 1332.29 s [vector] +++ OK, passed 100 tests.
  16088. 1332.29 s [vector] mut_ifoldM': OK
  16089. 1332.29 s [vector] +++ OK, passed 100 tests.
  16090. 1332.29 s [vector] mut_ifoldrM: OK
  16091. 1332.29 s [vector] +++ OK, passed 100 tests.
  16092. 1332.29 s [vector] mut_ifoldrM': OK
  16093. 1332.29 s [vector] +++ OK, passed 100 tests.
  16094. 1332.30 s [vector] compare: OK
  16095. 1332.30 s [vector] +++ OK, passed 100 tests.
  16096. 1332.30 s [vector] maximum: OK
  16097. 1332.30 s [vector] +++ OK, passed 100 tests; 13 discarded.
  16098. 1332.30 s [vector] minimum: OK
  16099. 1332.30 s [vector] +++ OK, passed 100 tests; 13 discarded.
  16100. 1332.30 s [vector] minIndex: OK
  16101. 1332.30 s [vector] +++ OK, passed 100 tests; 17 discarded.
  16102. 1332.30 s [vector] maxIndex: OK
  16103. 1332.30 s [vector] +++ OK, passed 100 tests; 21 discarded.
  16104. 1332.30 s [vector] maximumBy: OK
  16105. 1332.30 s [vector] +++ OK, passed 100 tests; 12 discarded.
  16106. 1332.30 s [vector] minimumBy: OK
  16107. 1332.30 s [vector] +++ OK, passed 100 tests; 14 discarded.
  16108. 1332.31 s [vector] maximumOn: OK
  16109. 1332.31 s [vector] +++ OK, passed 100 tests; 16 discarded.
  16110. 1332.31 s [vector] minimumOn: OK
  16111. 1332.31 s [vector] +++ OK, passed 100 tests; 22 discarded.
  16112. 1332.32 s [vector] maxIndexBy: OK
  16113. 1332.32 s [vector] +++ OK, passed 100 tests; 12 discarded.
  16114. 1332.32 s [vector] minIndexBy: OK
  16115. 1332.32 s [vector] +++ OK, passed 100 tests; 13 discarded.
  16116. 1332.32 s [vector] ListFirstMaxIndexWins: OK
  16117. 1332.32 s [vector] +++ OK, passed 100 tests; 11 discarded.
  16118. 1332.32 s [vector] FalseListFirstMaxIndexWins: OK
  16119. 1332.32 s [vector] +++ OK, failed as expected. (after 1 test):
  16120. 1332.32 s [vector] Exception:
  16121. 1332.32 s [vector] Prelude.foldr1: empty list
  16122. 1332.32 s [vector] CallStack (from HasCallStack):
  16123. 1332.32 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  16124. 1332.32 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  16125. 1332.32 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  16126. 1332.32 s [vector] []
  16127. 1332.32 s [vector] zip: OK
  16128. 1332.32 s [vector] +++ OK, passed 100 tests.
  16129. 1332.33 s [vector] zip3: OK
  16130. 1332.33 s [vector] +++ OK, passed 100 tests.
  16131. 1332.33 s [vector] unzip: OK
  16132. 1332.33 s [vector] +++ OK, passed 100 tests.
  16133. 1332.33 s [vector] unzip3: OK
  16134. 1332.33 s [vector] +++ OK, passed 100 tests.
  16135. 1332.33 s [vector] indexed: OK
  16136. 1332.33 s [vector] +++ OK, passed 100 tests.
  16137. 1332.33 s [vector] update: OK
  16138. 1332.33 s [vector] +++ OK, passed 100 tests.
  16139. 1332.33 s [vector] mempty: OK
  16140. 1332.33 s [vector] +++ OK, passed 100 tests.
  16141. 1332.34 s [vector] mappend: OK
  16142. 1332.34 s [vector] +++ OK, passed 100 tests.
  16143. 1332.39 s [vector] mconcat: OK (0.05s)
  16144. 1332.39 s [vector] +++ OK, passed 100 tests.
  16145. 1332.39 s [vector] glength: OK
  16146. 1332.39 s [vector] +++ OK, passed 100 tests.
  16147. 1332.39 s [vector] unstream
  16148. 1332.39 s [vector] unstream == vunstream (exact): OK
  16149. 1332.39 s [vector] +++ OK, passed 100 tests.
  16150. 1332.39 s [vector] unstream == vunstream (unknown): OK
  16151. 1332.39 s [vector] +++ OK, passed 100 tests.
  16152. 1332.39 s [vector] unstreamR ~= vunstream (exact): OK
  16153. 1332.39 s [vector] +++ OK, passed 100 tests.
  16154. 1332.39 s [vector] unstreamR ~= vunstream (unknown): OK
  16155. 1332.39 s [vector] +++ OK, passed 100 tests.
  16156. 1332.39 s [vector] Data.Vector.Storable.Vector Alignment
  16157. 1332.39 s [vector] Aligned Double: OK
  16158. 1332.39 s [vector] Aligned Int: OK
  16159. 1332.39 s [vector] Regression tests
  16160. 1332.39 s [vector] enumFromTo crash #188
  16161. 1332.39 s [vector] Word8: OK
  16162. 1332.39 s [vector] Word16: OK
  16163. 1332.39 s [vector] Word32: OK
  16164. 1332.39 s [vector] Word64: OK
  16165. 1332.39 s [vector] Word: OK
  16166. 1332.39 s [vector] Int8: OK
  16167. 1332.39 s [vector] Int16: OK
  16168. 1332.39 s [vector] Int32: OK
  16169. 1332.39 s [vector] Int64: OK
  16170. 1332.39 s [vector] Int: OK
  16171. 1332.39 s [vector] Char: OK
  16172. 1332.39 s [vector] Negative tests
  16173. 1332.39 s [vector] slice out of bounds #257
  16174. 1332.39 s [vector] Boxed
  16175. 1332.39 s [vector] Negative ix: OK
  16176. 1332.39 s [vector] Negative size: OK
  16177. 1332.39 s [vector] Negative ix and size: OK
  16178. 1332.39 s [vector] Too large ix: OK
  16179. 1332.39 s [vector] Too large size: OK
  16180. 1332.39 s [vector] Too large ix and size: OK
  16181. 1332.39 s [vector] Overflow: OK
  16182. 1332.39 s [vector] OutOfMemory: OK
  16183. 1332.39 s [vector] Primitive
  16184. 1332.39 s [vector] Negative ix: OK
  16185. 1332.40 s [vector] Negative size: OK
  16186. 1332.40 s [vector] Negative ix and size: OK
  16187. 1332.40 s [vector] Too large ix: OK
  16188. 1332.40 s [vector] Too large size: OK
  16189. 1332.40 s [vector] Too large ix and size: OK
  16190. 1332.40 s [vector] Overflow: OK
  16191. 1332.40 s [vector] OutOfMemory: OK
  16192. 1332.40 s [vector] Storable
  16193. 1332.40 s [vector] Negative ix: OK
  16194. 1332.40 s [vector] Negative size: OK
  16195. 1332.40 s [vector] Negative ix and size: OK
  16196. 1332.40 s [vector] Too large ix: OK
  16197. 1332.40 s [vector] Too large size: OK
  16198. 1332.40 s [vector] Too large ix and size: OK
  16199. 1332.40 s [vector] Overflow: OK
  16200. 1332.40 s [vector] OutOfMemory: OK
  16201. 1332.40 s [vector] Unboxed
  16202. 1332.40 s [vector] Negative ix: OK
  16203. 1332.40 s [vector] Negative size: OK
  16204. 1332.40 s [vector] Negative ix and size: OK
  16205. 1332.40 s [vector] Too large ix: OK
  16206. 1332.40 s [vector] Too large size: OK
  16207. 1332.40 s [vector] Too large ix and size: OK
  16208. 1332.40 s [vector] Overflow: OK
  16209. 1332.40 s [vector] OutOfMemory: OK
  16210. 1332.40 s [vector] take #282
  16211. 1332.40 s [vector] Boxed: OK
  16212. 1332.40 s [vector] Primitive: OK
  16213. 1332.40 s [vector] Storable: OK
  16214. 1332.40 s [vector] Unboxed: OK
  16215. 1332.40 s [vector] Data.Vector
  16216. 1332.40 s [vector] MonadFix: OK
  16217. 1332.40 s [vector] toFromArray: OK
  16218. 1332.40 s [vector] toFromArraySlice: OK
  16219. 1332.40 s [vector] toFromArraySliceUnsafe: OK
  16220. 1332.40 s [vector] toFromMutableArray: OK
  16221. 1332.40 s [vector] Data.Vector.Mutable (Move): OK
  16222. 1332.40 s [vector] +++ OK, passed 100 tests; 16 discarded.
  16223. 1332.40 s [vector] Data.Vector.Primitive.Mutable (Move): OK
  16224. 1332.40 s [vector] +++ OK, passed 100 tests; 14 discarded.
  16225. 1332.40 s [vector] Data.Vector.Unboxed.Mutable (Move): OK
  16226. 1332.40 s [vector] +++ OK, passed 100 tests; 14 discarded.
  16227. 1332.40 s [vector] Data.Vector.Storable.Mutable (Move): OK
  16228. 1332.40 s [vector] +++ OK, passed 100 tests; 21 discarded.
  16229. 1332.42 s [vector] Data.Vector.Generic.Mutable (nextPermutation): OK
  16230. 1332.42 s [vector] +++ OK, passed 100 tests.
  16231. 1332.42 s [vector] Data.Vector.Generic.Mutable (prevPermutation): OK (0.02s)
  16232. 1332.42 s [vector] +++ OK, passed 100 tests.
  16233. 1332.42 s [vector] Data.Vector.Generic.Mutable (nextPermutation then prevPermutation = id): OK
  16234. 1332.42 s [vector] +++ OK, passed 100 tests.
  16235. 1332.42 s [vector] Data.Vector.Generic.Mutable (prevPermutation then nextPermutation = id): OK
  16236. 1332.42 s [vector] +++ OK, passed 100 tests.
  16237. 1332.42 s [vector]
  16238. 1332.42 s [vector] All 2808 tests passed (14.82s)
  16239. 1332.43 s [vector] Test suite vector-tests-O2: PASS
  16240. 1332.43 s [vector] Test suite logged to: dist/test/vector-0.13.2.0-vector-tests-O2.log
  16241. 1332.43 s [vector] 2 of 2 test suites (2 of 2 test cases) passed.
  16242. 1332.44 s [vector] checkPhase completed in 32 seconds
  16243. 1332.44 s [vector] Phase: haddockPhase
  16244. 1332.44 s [vector] Phase: installPhase
  16245. 1332.54 s [vector] Installing library in /nix/store/2kc95v941mryycild8hhab0q3kwgdry6-vector-0.13.2.0/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/vector-0.13.2.0-91VeWMtvsgACG7wykjdBs
  16246. 1333.90 s [vector] Installing internal library benchmarks-O2 in /nix/store/2kc95v941mryycild8hhab0q3kwgdry6-vector-0.13.2.0/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/vector-0.13.2.0-7azfzKLqBdS38T2hfwD3o4-benchmarks-O2
  16247. 1334.56 s [vector] Phase: fixupPhase
  16248. 1334.57 s [vector] shrinking RPATHs of ELF executables and libraries in /nix/store/2kc95v941mryycild8hhab0q3kwgdry6-vector-0.13.2.0
  16249. 1334.57 s [vector] shrinking /nix/store/2kc95v941mryycild8hhab0q3kwgdry6-vector-0.13.2.0/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/libHSvector-0.13.2.0-7azfzKLqBdS38T2hfwD3o4-benchmarks-O2-ghc9.8.4.so
  16250. 1334.60 s [vector] shrinking /nix/store/2kc95v941mryycild8hhab0q3kwgdry6-vector-0.13.2.0/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/libHSvector-0.13.2.0-91VeWMtvsgACG7wykjdBs-ghc9.8.4.so
  16251. 1334.63 s [vector] checking for references to /build/ in /nix/store/2kc95v941mryycild8hhab0q3kwgdry6-vector-0.13.2.0...
  16252. 1334.68 s [vector] patching script interpreter paths in /nix/store/2kc95v941mryycild8hhab0q3kwgdry6-vector-0.13.2.0
  16253. 1334.69 s [vector] stripping (with command strip and flags -S -p) in /nix/store/2kc95v941mryycild8hhab0q3kwgdry6-vector-0.13.2.0/lib
  16254. 1335.61 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/2kc95v941mryycild8hhab0q3kwgdry6-vector-0.13.2.0
  16255. 1336.08 s [post-build-hook] Nothing to push - all store paths are already on Cachix.
  16256. 1336.11 s [post-build-hook] Uploading to the NixCI cache: /nix/store/2kc95v941mryycild8hhab0q3kwgdry6-vector-0.13.2.0
  16257. 1336.17 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  16258. 1336.19 s [post-build-hook] copying 1 paths...
  16259. 1336.19 s [post-build-hook] copying path '/nix/store/2kc95v941mryycild8hhab0q3kwgdry6-vector-0.13.2.0' to 'https://cache.nix-ci.com'...
  16260. 1353.90 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  16261. 1354.03 s [post-build-hook] copying 0 paths...
  16262. 1354.06 s Progress: 9 of 19 built, 160 of 160 downloaded from cache
  16263. 1354.13 s Building nothunks
  16264. 1354.27 s [nothunks] Phase: setupCompilerEnvironmentPhase
  16265. 1354.28 s [nothunks] Build with /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4.
  16266. 1354.56 s [nothunks] Phase: unpackPhase
  16267. 1354.57 s [nothunks] unpacking source archive /nix/store/y2bnhvmx2j2igw7ad1jf22kp1dlk8pg2-nothunks-0.3.1.tar.gz
  16268. 1354.57 s [nothunks] source root is nothunks-0.3.1
  16269. 1354.58 s [nothunks] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "nothunks-0.3.1/test/Test/NoThunks/Class.hs"
  16270. 1354.59 s [nothunks] Phase: patchPhase
  16271. 1354.60 s [nothunks] Replace Cabal file with edited version from mirror://hackage/nothunks-0.3.1/revision/1.cabal.
  16272. 1354.60 s [nothunks] Run jailbreak-cabal to lift version restrictions on build inputs.
  16273. 1354.62 s [nothunks] Phase: compileBuildDriverPhase
  16274. 1354.63 s [nothunks] setupCompileFlags: -package-db=/build/tmp.iPghqxiq55/setup-package.conf.d -threaded
  16275. 1354.68 s [nothunks] [1 of 2] Compiling Main ( /nix/store/4mdp8nhyfddh7bllbi7xszz7k9955n79-Setup.hs, /build/tmp.iPghqxiq55/Main.o )
  16276. 1354.80 s [nothunks] [2 of 2] Linking Setup
  16277. 1356.42 s [nothunks] Phase: updateAutotoolsGnuConfigScriptsPhase
  16278. 1356.51 s [nothunks] Phase: configurePhase
  16279. 1356.52 s [nothunks] configureFlags: --verbose --prefix=/nix/store/x3cv0507h6hrbfqxfsgm0x6b5hcfi7qk-nothunks-0.3.1 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/ia7gkx1fbywqls30ah8jzvvjdpqz3pir-nothunks-0.3.1-doc/share/doc/nothunks-0.3.1 --with-gcc=gcc --package-db=/build/tmp.iPghqxiq55/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/xp8g8298vbm4k9ipj14xf1r4rh899hr4-ncurses-6.5/lib --extra-lib-dirs=/nix/store/wxm6pczq28ppr7ffwclsl6njbzzr48zf-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/3f0hp921ncxr249f5lmspc8silkqr8f7-elfutils-0.194/lib --extra-lib-dirs=/nix/store/km81slwkcc82dbwywl10gpffjb78g6ni-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/fvsl0b39y6ns2z66gfvc2raca3b5wr18-numactl-2.0.18/lib
  16280. 1356.53 s [nothunks] Using Parsec parser
  16281. 1356.53 s [nothunks] Configuring nothunks-0.3.1...
  16282. 1357.01 s [nothunks] Flags chosen: bytestring=True, text=True, vector=True
  16283. 1357.01 s [nothunks] Dependency base: using base-4.19.2.0
  16284. 1357.01 s [nothunks] Dependency bytestring >=0.10 && <0.13: using bytestring-0.12.1.0
  16285. 1357.01 s [nothunks] Dependency containers: using containers-0.6.8
  16286. 1357.01 s [nothunks] Dependency ghc-heap: using ghc-heap-9.8.4
  16287. 1357.01 s [nothunks] Dependency stm: using stm-2.5.3.1
  16288. 1357.01 s [nothunks] Dependency text >=1.2 && <1.3 || >=2 && <2.2: using text-2.1.1
  16289. 1357.01 s [nothunks] Dependency time: using time-1.12.2
  16290. 1357.01 s [nothunks] Dependency vector >=0.12 && <0.14: using vector-0.13.2.0
  16291. 1357.01 s [nothunks] Dependency wherefrom-compat >=0.1.1 && <0.3: using wherefrom-compat-0.1.1.1
  16292. 1357.01 s [nothunks] Dependency base: using base-4.19.2.0
  16293. 1357.01 s [nothunks] Dependency containers: using containers-0.6.8
  16294. 1357.01 s [nothunks] Dependency ghc-prim: using ghc-prim-0.11.0
  16295. 1357.01 s [nothunks] Dependency hedgehog: using hedgehog-1.5
  16296. 1357.01 s [nothunks] Dependency nothunks: using nothunks-0.3.1
  16297. 1357.01 s [nothunks] Dependency random: using random-1.2.1.3
  16298. 1357.01 s [nothunks] Dependency stm: using stm-2.5.3.1
  16299. 1357.01 s [nothunks] Dependency tasty: using tasty-1.5.3
  16300. 1357.01 s [nothunks] Dependency tasty-hedgehog: using tasty-hedgehog-1.4.0.2
  16301. 1357.31 s [nothunks] Source component graph:
  16302. 1357.31 s [nothunks] component lib
  16303. 1357.31 s [nothunks] component test:nothunks-test dependency lib
  16304. 1357.31 s [nothunks] Configured component graph:
  16305. 1357.31 s [nothunks] component nothunks-0.3.1-A6mvU1Z4lXoIgvXHQWXxR1
  16306. 1357.31 s [nothunks] include base-4.19.2.0-a4d2
  16307. 1357.31 s [nothunks] include bytestring-0.12.1.0-2e42
  16308. 1357.31 s [nothunks] include containers-0.6.8-1373
  16309. 1357.31 s [nothunks] include ghc-heap-9.8.4-be73
  16310. 1357.31 s [nothunks] include stm-2.5.3.1-cf40
  16311. 1357.31 s [nothunks] include text-2.1.1-dac7
  16312. 1357.31 s [nothunks] include time-1.12.2-84c3
  16313. 1357.31 s [nothunks] include vector-0.13.2.0-91VeWMtvsgACG7wykjdBs
  16314. 1357.31 s [nothunks] include wherefrom-compat-0.1.1.1-KT44rjpMLEj5X9zrMJkRBr
  16315. 1357.31 s [nothunks] component nothunks-0.3.1-CxzC0Tp1uXIAiLM3u0LBsh-nothunks-test
  16316. 1357.31 s [nothunks] include base-4.19.2.0-a4d2
  16317. 1357.31 s [nothunks] include containers-0.6.8-1373
  16318. 1357.31 s [nothunks] include ghc-prim-0.11.0-c959
  16319. 1357.31 s [nothunks] include hedgehog-1.5-I61WWSEyWWs9b1Ow8jewYT
  16320. 1357.31 s [nothunks] include nothunks-0.3.1-A6mvU1Z4lXoIgvXHQWXxR1
  16321. 1357.31 s [nothunks] include random-1.2.1.3-jboRdLLnYgxZ05UNY3Mp
  16322. 1357.31 s [nothunks] include stm-2.5.3.1-cf40
  16323. 1357.31 s [nothunks] include tasty-1.5.3-KEgV0Lf2f7EJ3jK2Y7VIf6
  16324. 1357.31 s [nothunks] include tasty-hedgehog-1.4.0.2-14erXFMVRESHTcD2MA1X1Y
  16325. 1357.31 s [nothunks] Linked component graph:
  16326. 1357.31 s [nothunks] unit nothunks-0.3.1-A6mvU1Z4lXoIgvXHQWXxR1
  16327. 1357.31 s [nothunks] include base-4.19.2.0-a4d2
  16328. 1357.31 s [nothunks] include bytestring-0.12.1.0-2e42
  16329. 1357.31 s [nothunks] include containers-0.6.8-1373
  16330. 1357.31 s [nothunks] include ghc-heap-9.8.4-be73
  16331. 1357.31 s [nothunks] include stm-2.5.3.1-cf40
  16332. 1357.31 s [nothunks] include text-2.1.1-dac7
  16333. 1357.31 s [nothunks] include time-1.12.2-84c3
  16334. 1357.31 s [nothunks] include vector-0.13.2.0-91VeWMtvsgACG7wykjdBs
  16335. 1357.31 s [nothunks] include wherefrom-compat-0.1.1.1-KT44rjpMLEj5X9zrMJkRBr
  16336. 1357.31 s [nothunks] NoThunks.Class=nothunks-0.3.1-A6mvU1Z4lXoIgvXHQWXxR1:NoThunks.Class
  16337. 1357.31 s [nothunks] unit nothunks-0.3.1-CxzC0Tp1uXIAiLM3u0LBsh-nothunks-test
  16338. 1357.31 s [nothunks] include base-4.19.2.0-a4d2
  16339. 1357.31 s [nothunks] include containers-0.6.8-1373
  16340. 1357.31 s [nothunks] include ghc-prim-0.11.0-c959
  16341. 1357.31 s [nothunks] include hedgehog-1.5-I61WWSEyWWs9b1Ow8jewYT
  16342. 1357.31 s [nothunks] include nothunks-0.3.1-A6mvU1Z4lXoIgvXHQWXxR1
  16343. 1357.31 s [nothunks] include random-1.2.1.3-jboRdLLnYgxZ05UNY3Mp
  16344. 1357.31 s [nothunks] include stm-2.5.3.1-cf40
  16345. 1357.31 s [nothunks] include tasty-1.5.3-KEgV0Lf2f7EJ3jK2Y7VIf6
  16346. 1357.31 s [nothunks] include tasty-hedgehog-1.4.0.2-14erXFMVRESHTcD2MA1X1Y
  16347. 1357.31 s [nothunks] Ready component graph:
  16348. 1357.31 s [nothunks] definite nothunks-0.3.1-A6mvU1Z4lXoIgvXHQWXxR1
  16349. 1357.31 s [nothunks] depends base-4.19.2.0-a4d2
  16350. 1357.31 s [nothunks] depends bytestring-0.12.1.0-2e42
  16351. 1357.31 s [nothunks] depends containers-0.6.8-1373
  16352. 1357.31 s [nothunks] depends ghc-heap-9.8.4-be73
  16353. 1357.31 s [nothunks] depends stm-2.5.3.1-cf40
  16354. 1357.31 s [nothunks] depends text-2.1.1-dac7
  16355. 1357.31 s [nothunks] depends time-1.12.2-84c3
  16356. 1357.31 s [nothunks] depends vector-0.13.2.0-91VeWMtvsgACG7wykjdBs
  16357. 1357.31 s [nothunks] depends wherefrom-compat-0.1.1.1-KT44rjpMLEj5X9zrMJkRBr
  16358. 1357.31 s [nothunks] definite nothunks-0.3.1-CxzC0Tp1uXIAiLM3u0LBsh-nothunks-test
  16359. 1357.31 s [nothunks] depends base-4.19.2.0-a4d2
  16360. 1357.31 s [nothunks] depends containers-0.6.8-1373
  16361. 1357.32 s [nothunks] depends ghc-prim-0.11.0-c959
  16362. 1357.32 s [nothunks] depends hedgehog-1.5-I61WWSEyWWs9b1Ow8jewYT
  16363. 1357.32 s [nothunks] depends nothunks-0.3.1-A6mvU1Z4lXoIgvXHQWXxR1
  16364. 1357.32 s [nothunks] depends random-1.2.1.3-jboRdLLnYgxZ05UNY3Mp
  16365. 1357.32 s [nothunks] depends stm-2.5.3.1-cf40
  16366. 1357.32 s [nothunks] depends tasty-1.5.3-KEgV0Lf2f7EJ3jK2Y7VIf6
  16367. 1357.32 s [nothunks] depends tasty-hedgehog-1.4.0.2-14erXFMVRESHTcD2MA1X1Y
  16368. 1357.32 s [nothunks] Using Cabal-3.10.3.0 compiled by ghc-9.8
  16369. 1357.32 s [nothunks] Using compiler: ghc-9.8.4
  16370. 1357.32 s [nothunks] Using install prefix:
  16371. 1357.32 s [nothunks] /nix/store/x3cv0507h6hrbfqxfsgm0x6b5hcfi7qk-nothunks-0.3.1
  16372. 1357.32 s [nothunks] Executables installed in:
  16373. 1357.32 s [nothunks] /nix/store/x3cv0507h6hrbfqxfsgm0x6b5hcfi7qk-nothunks-0.3.1/bin
  16374. 1357.32 s [nothunks] Libraries installed in:
  16375. 1357.32 s [nothunks] /nix/store/x3cv0507h6hrbfqxfsgm0x6b5hcfi7qk-nothunks-0.3.1/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/nothunks-0.3.1-A6mvU1Z4lXoIgvXHQWXxR1
  16376. 1357.32 s [nothunks] Dynamic Libraries installed in:
  16377. 1357.32 s [nothunks] /nix/store/x3cv0507h6hrbfqxfsgm0x6b5hcfi7qk-nothunks-0.3.1/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4
  16378. 1357.32 s [nothunks] Private executables installed in:
  16379. 1357.32 s [nothunks] /nix/store/x3cv0507h6hrbfqxfsgm0x6b5hcfi7qk-nothunks-0.3.1/libexec/x86_64-linux-ghc-9.8.4/nothunks-0.3.1
  16380. 1357.32 s [nothunks] Data files installed in:
  16381. 1357.32 s [nothunks] /nix/store/x3cv0507h6hrbfqxfsgm0x6b5hcfi7qk-nothunks-0.3.1/share/x86_64-linux-ghc-9.8.4/nothunks-0.3.1
  16382. 1357.32 s [nothunks] Documentation installed in:
  16383. 1357.32 s [nothunks] /nix/store/ia7gkx1fbywqls30ah8jzvvjdpqz3pir-nothunks-0.3.1-doc/share/doc/nothunks-0.3.1
  16384. 1357.32 s [nothunks] Configuration files installed in:
  16385. 1357.32 s [nothunks] /nix/store/x3cv0507h6hrbfqxfsgm0x6b5hcfi7qk-nothunks-0.3.1/etc
  16386. 1357.32 s [nothunks] No alex found
  16387. 1357.32 s [nothunks] Using ar found on system at:
  16388. 1357.32 s [nothunks] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
  16389. 1357.32 s [nothunks] No c2hs found
  16390. 1357.32 s [nothunks] No cpphs found
  16391. 1357.32 s [nothunks] No doctest found
  16392. 1357.32 s [nothunks] Using gcc version 14.3.0 given by user at:
  16393. 1357.32 s [nothunks] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
  16394. 1357.32 s [nothunks] Using ghc version 9.8.4 found on system at:
  16395. 1357.32 s [nothunks] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/ghc
  16396. 1357.32 s [nothunks] Using ghc-pkg version 9.8.4 found on system at:
  16397. 1357.32 s [nothunks] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/ghc-pkg-9.8.4
  16398. 1357.32 s [nothunks] No ghcjs found
  16399. 1357.32 s [nothunks] No ghcjs-pkg found
  16400. 1357.32 s [nothunks] No greencard found
  16401. 1357.32 s [nothunks] Using haddock version 2.30.0 found on system at:
  16402. 1357.32 s [nothunks] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/haddock-ghc-9.8.4
  16403. 1357.32 s [nothunks] No happy found
  16404. 1357.32 s [nothunks] Using haskell-suite found on system at: haskell-suite-dummy-location
  16405. 1357.32 s [nothunks] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  16406. 1357.32 s [nothunks] No hmake found
  16407. 1357.32 s [nothunks] Using hpc version 0.69 found on system at:
  16408. 1357.32 s [nothunks] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/hpc-ghc-9.8.4
  16409. 1357.32 s [nothunks] Using hsc2hs version 0.68.10 found on system at:
  16410. 1357.32 s [nothunks] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/hsc2hs-ghc-9.8.4
  16411. 1357.32 s [nothunks] Using hscolour version 1.25 found on system at:
  16412. 1357.32 s [nothunks] /nix/store/vl14mqkz7z183r6sq9qz932j3pix6v5c-hscolour-1.25/bin/HsColour
  16413. 1357.32 s [nothunks] No jhc found
  16414. 1357.32 s [nothunks] Using ld found on system at:
  16415. 1357.32 s [nothunks] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ld.gold
  16416. 1357.32 s [nothunks] No pkg-config found
  16417. 1357.32 s [nothunks] Using runghc version 9.8.4 found on system at:
  16418. 1357.32 s [nothunks] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/runghc-9.8.4
  16419. 1357.32 s [nothunks] Using strip version 2.44 found on system at:
  16420. 1357.32 s [nothunks] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
  16421. 1357.32 s [nothunks] Using tar found on system at:
  16422. 1357.32 s [nothunks] /nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
  16423. 1357.32 s [nothunks] No uhc found
  16424. 1357.47 s [nothunks] Phase: buildPhase
  16425. 1357.55 s [nothunks] Preprocessing library for nothunks-0.3.1..
  16426. 1357.55 s [nothunks] Building library for nothunks-0.3.1..
  16427. 1357.66 s [nothunks] [1 of 1] Compiling NoThunks.Class ( src/NoThunks/Class.hs, dist/build/NoThunks/Class.o, dist/build/NoThunks/Class.dyn_o )
  16428. 1361.00 s [nothunks] [1 of 1] Compiling NoThunks.Class ( src/NoThunks/Class.hs, dist/build/NoThunks/Class.p_o )
  16429. 1366.22 s [nothunks] Preprocessing test suite 'nothunks-test' for nothunks-0.3.1..
  16430. 1366.22 s [nothunks] Building test suite 'nothunks-test' for nothunks-0.3.1..
  16431. 1366.45 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 )
  16432. 1370.30 s [nothunks] [2 of 2] Compiling Main ( test/Main.hs, dist/build/nothunks-test/nothunks-test-tmp/Main.o )
  16433. 1370.91 s [nothunks] [3 of 3] Linking dist/build/nothunks-test/nothunks-test
  16434. 1372.31 s [nothunks] Phase: checkPhase
  16435. 1372.43 s [nothunks] Running 1 test suites...
  16436. 1372.43 s [nothunks] Test suite nothunks-test: RUNNING...
  16437. 1372.44 s [nothunks] Tests
  16438. 1372.47 s [nothunks] NoThunks.Class
  16439. 1372.47 s [nothunks] Sanity
  16440. 1372.48 s [nothunks] IntNotNF: OK
  16441. 1372.48 s [nothunks] ✓ <interactive> passed 1 test.
  16442. 1372.48 s [nothunks] IntIsNF: OK
  16443. 1372.48 s [nothunks] ✓ <interactive> passed 1 test.
  16444. 1372.48 s [nothunks] Pair: OK
  16445. 1372.48 s [nothunks] ✓ <interactive> passed 1 test.
  16446. 1372.48 s [nothunks] Sum: OK
  16447. 1372.48 s [nothunks] ✓ <interactive> passed 1 test.
  16448. 1372.48 s [nothunks] Fn: OK
  16449. 1372.48 s [nothunks] ✓ <interactive> passed 1 test.
  16450. 1372.48 s [nothunks] IO: OK
  16451. 1372.48 s [nothunks] ✓ <interactive> passed 1 test.
  16452. 1372.48 s [nothunks] InspectHeap
  16453. 1372.48 s [nothunks] Int: OK (0.02s)
  16454. 1372.48 s [nothunks] ✓ <interactive> passed 1000 tests.
  16455. 1372.48 s [nothunks] Just ["Int"] 52% ██████████▎·········
  16456. 1372.48 s [nothunks] Nothing 48% █████████▋··········
  16457. 1372.48 s [nothunks] IntInt: OK (0.02s)
  16458. 1372.48 s [nothunks] ✓ <interactive> passed 1000 tests.
  16459. 1372.48 s [nothunks] Just ["Int","Tuple2"] 38% ███████▌············
  16460. 1372.48 s [nothunks] Just ["Tuple2"] 49% █████████▊··········
  16461. 1372.49 s [nothunks] Nothing 13% ██▌·················
  16462. 1372.51 s [nothunks] SumInt: OK (0.02s)
  16463. 1372.51 s [nothunks] ✓ <interactive> passed 1000 tests.
  16464. 1372.51 s [nothunks] Just ["Either"] 34% ██████▉·············
  16465. 1372.51 s [nothunks] Just ["Int","Either"] 31% ██████▏·············
  16466. 1372.51 s [nothunks] Nothing 35% ██████▉·············
  16467. 1372.53 s [nothunks] ListInt: OK (0.02s)
  16468. 1372.53 s [nothunks] ✓ <interactive> passed 1000 tests.
  16469. 1372.53 s [nothunks] Just ["Int","List"] 21% ████▎···············
  16470. 1372.53 s [nothunks] Just ["List"] 44% ████████▊···········
  16471. 1372.53 s [nothunks] Nothing 35% ██████▉·············
  16472. 1372.56 s [nothunks] IntListInt: OK (0.04s)
  16473. 1372.56 s [nothunks] ✓ <interactive> passed 1000 tests.
  16474. 1372.56 s [nothunks] Just ["Int","List","Tuple2"] 7% █▍··················
  16475. 1372.56 s [nothunks] Just ["Int","Tuple2"] 24% ████▊···············
  16476. 1372.56 s [nothunks] Just ["List","Tuple2"] 11% ██··················
  16477. 1372.56 s [nothunks] Just ["Tuple2"] 50% █████████▉··········
  16478. 1372.56 s [nothunks] Nothing 9% █▋··················
  16479. 1372.58 s [nothunks] SeqInt: ✗ EXPECTED FAILURE failed at test/Test/NoThunks/Class.hs:179:7
  16480. 1372.58 s [nothunks] after 11 tests and 1 shrink.
  16481. 1372.58 s [nothunks] shrink path: 11:c
  16482. 1372.58 s [nothunks] Just ["Int","Seq"] 27% █████▍··············
  16483. 1372.58 s [nothunks] Nothing 64% ████████████▋·······
  16484. 1372.58 s [nothunks]
  16485. 1372.58 s [nothunks] ┏━━ test/Test/NoThunks/Class.hs ━━━
  16486. 1372.58 s [nothunks] 166 ┃ testWithModel :: forall a. FromModel a
  16487. 1372.58 s [nothunks] 167 ┃ => (Maybe ThunkInfo -> Maybe [String] -> Bool)
  16488. 1372.59 s [nothunks] 168 ┃ -> Proxy a
  16489. 1372.59 s [nothunks] 169 ┃ -- ^ Compare @ThunkInfo@. When we use 'noThunks' this
  16490. 1372.59 s [nothunks] 170 ┃ -- can just be @(==)@; however, when we use 'isNormalForm', the
  16491. 1372.59 s [nothunks] 171 ┃ -- context we will get from the model will be too detailed.
  16492. 1372.59 s [nothunks] 172 ┃ -> Property
  16493. 1372.59 s [nothunks] 173 ┃ testWithModel compareInfo _proxy = withTests 1000 $ property $ do
  16494. 1372.59 s [nothunks] 174 ┃ m :: Model a <- forAll genModel
  16495. 1372.59 s [nothunks] ┃ │ Wrap
  16496. 1372.59 s [nothunks] ┃ │ { unwrap =
  16497. 1372.59 s [nothunks] ┃ │ SeqEnqueue
  16498. 1372.59 s [nothunks] ┃ │ (IntValue 0)
  16499. 1372.59 s [nothunks] ┃ │ (SeqEnqueue
  16500. 1372.59 s [nothunks] ┃ │ (IntValue 0)
  16501. 1372.59 s [nothunks] ┃ │ (SeqEnqueue
  16502. 1372.59 s [nothunks] ┃ │ (IntValue 0)
  16503. 1372.59 s [nothunks] ┃ │ (SeqEnqueue
  16504. 1372.59 s [nothunks] ┃ │ (IntValue 0)
  16505. 1372.59 s [nothunks] ┃ │ (SeqEnqueue (IntValue 0) (SeqEnqueue (IntValue 0) SeqEmpty)))))
  16506. 1372.59 s [nothunks] ┃ │ }
  16507. 1372.59 s [nothunks] 175 ┃ collect $ modelUnexpected [] m
  16508. 1372.59 s [nothunks] 176 ┃ fromModel m $ \a -> do
  16509. 1372.59 s [nothunks] 177 ┃ annotate $ show $ modelIsNF [] m
  16510. 1372.59 s [nothunks] ┃ │ IsNF
  16511. 1372.59 s [nothunks] 178 ┃ isNF <- liftIO $ noThunks [] a
  16512. 1372.59 s [nothunks] 179 ┃ Hedgehog.diff isNF compareInfo (modelUnexpected [] m)
  16513. 1372.59 s [nothunks] ┃ ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  16514. 1372.59 s [nothunks] ┃ │ ━━━ Failed (- lhs) (+ rhs) ━━━
  16515. 1372.59 s [nothunks] ┃ │ - Just
  16516. 1372.59 s [nothunks] ┃ │ - ThunkInfo
  16517. 1372.59 s [nothunks] ┃ │ - { thunkContext = [ "..." , "Seq Int" ] , thunkInfo = Nothing }
  16518. 1372.59 s [nothunks] ┃ │ + Nothing
  16519. 1372.59 s [nothunks]
  16520. 1372.59 s [nothunks] This failure can be reproduced by running:
  16521. 1372.59 s [nothunks] > recheckAt (Seed 2179802806533288916 10285925031908096193) "11:c" EXPECTED FAILURE
  16522. 1372.59 s [nothunks]
  16523. 1372.60 s [nothunks] OK (0.03s)
  16524. 1372.60 s [nothunks] ✓ <interactive> passed 1 test.
  16525. 1372.60 s [nothunks] Model
  16526. 1372.60 s [nothunks] Int: OK (0.01s)
  16527. 1372.60 s [nothunks] ✓ <interactive> passed 1000 tests.
  16528. 1372.60 s [nothunks] Just ["Int"] 51% ██████████▏·········
  16529. 1372.60 s [nothunks] Nothing 49% █████████▊··········
  16530. 1372.62 s [nothunks] IntInt: OK (0.02s)
  16531. 1372.62 s [nothunks] ✓ <interactive> passed 1000 tests.
  16532. 1372.62 s [nothunks] Just ["Int","Tuple2"] 40% ███████▉············
  16533. 1372.62 s [nothunks] Just ["Tuple2"] 47% █████████▎··········
  16534. 1372.62 s [nothunks] Nothing 14% ██▊·················
  16535. 1372.64 s [nothunks] SumInt: OK (0.02s)
  16536. 1372.64 s [nothunks] ✓ <interactive> passed 1000 tests.
  16537. 1372.64 s [nothunks] Just ["Either"] 32% ██████▌·············
  16538. 1372.64 s [nothunks] Just ["Int","Either"] 33% ██████▌·············
  16539. 1372.64 s [nothunks] Nothing 35% ██████▉·············
  16540. 1372.66 s [nothunks] ListInt: OK (0.02s)
  16541. 1372.66 s [nothunks] ✓ <interactive> passed 1000 tests.
  16542. 1372.66 s [nothunks] Just ["Int","List"] 22% ████▍···············
  16543. 1372.66 s [nothunks] Just ["List"] 43% ████████▋···········
  16544. 1372.66 s [nothunks] Nothing 34% ██████▉·············
  16545. 1372.68 s [nothunks] IntListInt: OK (0.03s)
  16546. 1372.68 s [nothunks] ✓ <interactive> passed 1000 tests.
  16547. 1372.68 s [nothunks] Just ["Int","List","Tuple2"] 5% ▉···················
  16548. 1372.68 s [nothunks] Just ["Int","Tuple2"] 23% ████▋···············
  16549. 1372.68 s [nothunks] Just ["List","Tuple2"] 12% ██▍·················
  16550. 1372.68 s [nothunks] Just ["Tuple2"] 51% ██████████▎·········
  16551. 1372.68 s [nothunks] Nothing 8% █▋··················
  16552. 1372.76 s [nothunks] SeqInt: OK (0.07s)
  16553. 1372.76 s [nothunks] ✓ <interactive> passed 1000 tests.
  16554. 1372.76 s [nothunks] Just ["Int","Seq"] 46% █████████▏··········
  16555. 1372.76 s [nothunks] Nothing 54% ██████████▊·········
  16556. 1372.78 s [nothunks] AllowThunksIn: OK (0.02s)
  16557. 1372.79 s [nothunks] ✓ <interactive> passed 1000 tests.
  16558. 1372.79 s [nothunks] Just ["Int","field2","Record"] 25% █████···············
  16559. 1372.79 s [nothunks] Just ["Record"] 49% █████████▉··········
  16560. 1372.79 s [nothunks] Nothing 25% █████···············
  16561. 1372.80 s [nothunks] Fn: OK (0.01s)
  16562. 1372.80 s [nothunks] ✓ <interactive> passed 1000 tests.
  16563. 1372.80 s [nothunks] Just ["->"] 24% ████▉···············
  16564. 1372.80 s [nothunks] Nothing 76% ███████████████·····
  16565. 1372.80 s [nothunks] IO: OK (0.01s)
  16566. 1372.80 s [nothunks] ✓ <interactive> passed 1000 tests.
  16567. 1372.80 s [nothunks] Just ["IO"] 22% ████▌···············
  16568. 1372.80 s [nothunks] Nothing 78% ███████████████▌····
  16569. 1372.82 s [nothunks] ThunkFreeFn: OK (0.01s)
  16570. 1372.82 s [nothunks] ✓ <interactive> passed 1000 tests.
  16571. 1372.82 s [nothunks] Just ["->"] 24% ████▋···············
  16572. 1372.82 s [nothunks] Just ["...","->"] 38% ███████▌············
  16573. 1372.82 s [nothunks] Nothing 39% ███████▋············
  16574. 1372.82 s [nothunks] ThunkFreeIO: OK (0.01s)
  16575. 1372.82 s [nothunks] ✓ <interactive> passed 1000 tests.
  16576. 1372.82 s [nothunks] Just ["...","IO"] 37% ███████▍············
  16577. 1372.82 s [nothunks] Just ["IO"] 26% █████···············
  16578. 1372.82 s [nothunks] Nothing 37% ███████▍············
  16579. 1372.82 s [nothunks] MutableVars
  16580. 1372.82 s [nothunks] IORef
  16581. 1372.82 s [nothunks] NotNF: OK
  16582. 1372.82 s [nothunks] ✓ <interactive> passed 1 test.
  16583. 1372.82 s [nothunks] NF: OK
  16584. 1372.82 s [nothunks] ✓ <interactive> passed 1 test.
  16585. 1372.82 s [nothunks] NotNFPure: OK
  16586. 1372.82 s [nothunks] ✓ <interactive> passed 1 test.
  16587. 1372.82 s [nothunks] NFPure: OK
  16588. 1372.82 s [nothunks] ✓ <interactive> passed 1 test.
  16589. 1372.82 s [nothunks] NotNFAtomically: OK
  16590. 1372.82 s [nothunks] ✓ <interactive> passed 1 test.
  16591. 1372.82 s [nothunks] NFAtomically: OK
  16592. 1372.82 s [nothunks] ✓ <interactive> passed 1 test.
  16593. 1372.82 s [nothunks] MVar
  16594. 1372.82 s [nothunks] NotNF: OK
  16595. 1372.82 s [nothunks] ✓ <interactive> passed 1 test.
  16596. 1372.82 s [nothunks] NF: OK
  16597. 1372.82 s [nothunks] ✓ <interactive> passed 1 test.
  16598. 1372.82 s [nothunks] NotNFPure: OK
  16599. 1372.82 s [nothunks] ✓ <interactive> passed 1 test.
  16600. 1372.82 s [nothunks] NFPure: OK
  16601. 1372.82 s [nothunks] ✓ <interactive> passed 1 test.
  16602. 1372.82 s [nothunks] NotNFAtomically: OK
  16603. 1372.82 s [nothunks] ✓ <interactive> passed 1 test.
  16604. 1372.82 s [nothunks] NFAtomically: OK
  16605. 1372.82 s [nothunks] ✓ <interactive> passed 1 test.
  16606. 1372.82 s [nothunks] TVar
  16607. 1372.82 s [nothunks] NotNF: OK
  16608. 1372.82 s [nothunks] ✓ <interactive> passed 1 test.
  16609. 1372.82 s [nothunks] NF: OK
  16610. 1372.82 s [nothunks] ✓ <interactive> passed 1 test.
  16611. 1372.82 s [nothunks] NotNFPure: OK
  16612. 1372.82 s [nothunks] ✓ <interactive> passed 1 test.
  16613. 1372.82 s [nothunks] NFPure: OK
  16614. 1372.82 s [nothunks] ✓ <interactive> passed 1 test.
  16615. 1372.82 s [nothunks] NotNFAtomically: OK
  16616. 1372.82 s [nothunks] ✓ <interactive> passed 1 test.
  16617. 1372.82 s [nothunks] NFAtomically: OK
  16618. 1372.82 s [nothunks] ✓ <interactive> passed 1 test.
  16619. 1372.82 s [nothunks]
  16620. 1372.82 s [nothunks] All 41 tests passed (0.38s)
  16621. 1372.82 s [nothunks] Test suite nothunks-test: PASS
  16622. 1372.82 s [nothunks] Test suite logged to: dist/test/nothunks-0.3.1-nothunks-test.log
  16623. 1372.82 s [nothunks] 1 of 1 test suites (1 of 1 test cases) passed.
  16624. 1372.83 s [nothunks] Phase: haddockPhase
  16625. 1373.05 s [nothunks] Preprocessing library for nothunks-0.3.1..
  16626. 1373.05 s [nothunks] Running Haddock on library for nothunks-0.3.1..
  16627. 1373.05 s [nothunks] Warning: The documentation for the following packages are not installed. No
  16628. 1373.05 s [nothunks] links will be generated to these packages: vector-0.13.2.0
  16629. 1373.10 s [nothunks] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
  16630. 1373.30 s [nothunks] [1 of 1] Compiling NoThunks.Class ( src/NoThunks/Class.hs, nothing )
  16631. 1374.08 s [nothunks] Haddock coverage:
  16632. 1374.08 s [nothunks] Warning: 'AllowThunksIn' is ambiguous. It is defined
  16633. 1374.08 s [nothunks] * at src/NoThunks/Class.hs:334:48
  16634. 1374.08 s [nothunks] * at src/NoThunks/Class.hs:334:1
  16635. 1374.08 s [nothunks] You may be able to disambiguate the identifier by qualifying it or
  16636. 1374.08 s [nothunks] by specifying the type/value namespace explicitly.
  16637. 1374.08 s [nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:334:1
  16638. 1374.08 s [nothunks] Warning: 'InspectHeap' is ambiguous. It is defined
  16639. 1374.08 s [nothunks] * at src/NoThunks/Class.hs:353:25
  16640. 1374.08 s [nothunks] * at src/NoThunks/Class.hs:353:1
  16641. 1374.08 s [nothunks] You may be able to disambiguate the identifier by qualifying it or
  16642. 1374.08 s [nothunks] by specifying the type/value namespace explicitly.
  16643. 1374.08 s [nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:353:1
  16644. 1374.08 s [nothunks] Warning: 'InspectHeapNamed' is ambiguous. It is defined
  16645. 1374.08 s [nothunks] * at src/NoThunks/Class.hs:358:47
  16646. 1374.08 s [nothunks] * at src/NoThunks/Class.hs:358:1
  16647. 1374.08 s [nothunks] You may be able to disambiguate the identifier by qualifying it or
  16648. 1374.08 s [nothunks] by specifying the type/value namespace explicitly.
  16649. 1374.08 s [nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:358:1
  16650. 1374.08 s [nothunks] Warning: 'OnlyCheckWhnf' is ambiguous. It is defined
  16651. 1374.08 s [nothunks] * at src/NoThunks/Class.hs:308:27
  16652. 1374.08 s [nothunks] * at src/NoThunks/Class.hs:308:1
  16653. 1374.08 s [nothunks] You may be able to disambiguate the identifier by qualifying it or
  16654. 1374.08 s [nothunks] by specifying the type/value namespace explicitly.
  16655. 1374.08 s [nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:308:1
  16656. 1374.09 s [nothunks] Warning: 'ThunkInfo' is ambiguous. It is defined
  16657. 1374.09 s [nothunks] * at src/NoThunks/Class.hs:230:18
  16658. 1374.09 s [nothunks] * at src/NoThunks/Class.hs:230:1
  16659. 1374.09 s [nothunks] You may be able to disambiguate the identifier by qualifying it or
  16660. 1374.09 s [nothunks] by specifying the type/value namespace explicitly.
  16661. 1374.09 s [nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:230:1
  16662. 1374.09 s [nothunks] Warning: 'GHC' is out of scope.
  16663. 1374.09 s [nothunks] If you qualify the identifier, haddock can try to link it anyway.
  16664. 1374.09 s [nothunks] Warning: 'a' is out of scope.
  16665. 1374.09 s [nothunks] If you qualify the identifier, haddock can try to link it anyway.
  16666. 1374.10 s [nothunks] 95% ( 20 / 21) in 'NoThunks.Class'
  16667. 1374.10 s [nothunks] Missing documentation for:
  16668. 1374.10 s [nothunks] Module header
  16669. 1374.85 s [nothunks] Warning: NoThunks.Class: could not find link destinations for:
  16670. 1374.85 s [nothunks] - Data.Vector.Vector
  16671. 1374.85 s [nothunks] - Data.Vector.Unboxed.Base.Vector
  16672. 1374.85 s [nothunks] - NoThunks.Class.HasFields
  16673. 1374.85 s [nothunks] - NoThunks.Class.Elem
  16674. 1374.85 s [nothunks] - NoThunks.Class.GShowTypeOf
  16675. 1374.85 s [nothunks] - NoThunks.Class.GWRecordField
  16676. 1374.85 s [nothunks] - NoThunks.Class.checkContainsThunks
  16677. 1378.58 s [nothunks] Documentation created: dist/doc/html/nothunks/,
  16678. 1378.66 s [nothunks] dist/doc/html/nothunks/nothunks.txt
  16679. 1378.66 s [nothunks] Preprocessing test suite 'nothunks-test' for nothunks-0.3.1..
  16680. 1378.66 s [nothunks] Phase: installPhase
  16681. 1378.76 s [nothunks] Installing library in /nix/store/x3cv0507h6hrbfqxfsgm0x6b5hcfi7qk-nothunks-0.3.1/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/nothunks-0.3.1-A6mvU1Z4lXoIgvXHQWXxR1
  16682. 1379.13 s [nothunks] Phase: fixupPhase
  16683. 1379.15 s [nothunks] shrinking RPATHs of ELF executables and libraries in /nix/store/x3cv0507h6hrbfqxfsgm0x6b5hcfi7qk-nothunks-0.3.1
  16684. 1379.16 s [nothunks] shrinking /nix/store/x3cv0507h6hrbfqxfsgm0x6b5hcfi7qk-nothunks-0.3.1/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/libHSnothunks-0.3.1-A6mvU1Z4lXoIgvXHQWXxR1-ghc9.8.4.so
  16685. 1379.17 s [nothunks] checking for references to /build/ in /nix/store/x3cv0507h6hrbfqxfsgm0x6b5hcfi7qk-nothunks-0.3.1...
  16686. 1379.20 s [nothunks] patching script interpreter paths in /nix/store/x3cv0507h6hrbfqxfsgm0x6b5hcfi7qk-nothunks-0.3.1
  16687. 1379.21 s [nothunks] stripping (with command strip and flags -S -p) in /nix/store/x3cv0507h6hrbfqxfsgm0x6b5hcfi7qk-nothunks-0.3.1/lib
  16688. 1379.30 s [nothunks] shrinking RPATHs of ELF executables and libraries in /nix/store/ia7gkx1fbywqls30ah8jzvvjdpqz3pir-nothunks-0.3.1-doc
  16689. 1379.31 s [nothunks] checking for references to /build/ in /nix/store/ia7gkx1fbywqls30ah8jzvvjdpqz3pir-nothunks-0.3.1-doc...
  16690. 1379.32 s [nothunks] patching script interpreter paths in /nix/store/ia7gkx1fbywqls30ah8jzvvjdpqz3pir-nothunks-0.3.1-doc
  16691. 1379.44 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/ia7gkx1fbywqls30ah8jzvvjdpqz3pir-nothunks-0.3.1-doc /nix/store/x3cv0507h6hrbfqxfsgm0x6b5hcfi7qk-nothunks-0.3.1
  16692. 1379.94 s [post-build-hook] Nothing to push - all store paths are already on Cachix.
  16693. 1379.99 s [post-build-hook] Uploading to the NixCI cache: /nix/store/ia7gkx1fbywqls30ah8jzvvjdpqz3pir-nothunks-0.3.1-doc /nix/store/x3cv0507h6hrbfqxfsgm0x6b5hcfi7qk-nothunks-0.3.1
  16694. 1380.08 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  16695. 1380.19 s [post-build-hook] copying 1 paths...
  16696. 1380.19 s [post-build-hook] copying path '/nix/store/x3cv0507h6hrbfqxfsgm0x6b5hcfi7qk-nothunks-0.3.1' to 'https://cache.nix-ci.com'...
  16697. 1381.25 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  16698. 1381.39 s [post-build-hook] copying 0 paths...
  16699. 1381.43 s Progress: 10 of 19 built, 160 of 160 downloaded from cache
  16700. 1381.51 s Building unordered-containers
  16701. 1381.65 s [unordered-containers] Phase: setupCompilerEnvironmentPhase
  16702. 1381.68 s [unordered-containers] Build with /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4.
  16703. 1381.90 s [unordered-containers] Phase: unpackPhase
  16704. 1381.91 s [unordered-containers] unpacking source archive /nix/store/3jhrx7bdq3fc4fyqvqr344f82lb9n9iv-unordered-containers-0.2.20.1.tar.gz
  16705. 1381.91 s [unordered-containers] source root is unordered-containers-0.2.20.1
  16706. 1381.92 s [unordered-containers] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "unordered-containers-0.2.20.1/unordered-containers.cabal"
  16707. 1381.93 s [unordered-containers] Phase: patchPhase
  16708. 1382.00 s [unordered-containers] Phase: compileBuildDriverPhase
  16709. 1382.00 s [unordered-containers] setupCompileFlags: -package-db=/build/tmp.TWMfsEfPiO/setup-package.conf.d -threaded
  16710. 1382.06 s [unordered-containers] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.TWMfsEfPiO/Main.o )
  16711. 1382.16 s [unordered-containers] [2 of 2] Linking Setup
  16712. 1383.77 s [unordered-containers] Phase: updateAutotoolsGnuConfigScriptsPhase
  16713. 1383.88 s [unordered-containers] Phase: configurePhase
  16714. 1383.89 s [unordered-containers] configureFlags: --verbose --prefix=/nix/store/iri9gy5dns30dwfdqmcjpy61jzl7hc9s-unordered-containers-0.2.20.1 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/p6rbrfq031rssl5q8yvfyabd0l5p5v1n-unordered-containers-0.2.20.1-doc/share/doc/unordered-containers-0.2.20.1 --with-gcc=gcc --package-db=/build/tmp.TWMfsEfPiO/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/xp8g8298vbm4k9ipj14xf1r4rh899hr4-ncurses-6.5/lib --extra-lib-dirs=/nix/store/wxm6pczq28ppr7ffwclsl6njbzzr48zf-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/3f0hp921ncxr249f5lmspc8silkqr8f7-elfutils-0.194/lib --extra-lib-dirs=/nix/store/km81slwkcc82dbwywl10gpffjb78g6ni-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/fvsl0b39y6ns2z66gfvc2raca3b5wr18-numactl-2.0.18/lib
  16715. 1383.93 s [unordered-containers] Using Parsec parser
  16716. 1383.93 s [unordered-containers] Configuring unordered-containers-0.2.20.1...
  16717. 1384.35 s [unordered-containers] Flags chosen: debug=False
  16718. 1384.35 s [unordered-containers] Dependency base >=4.10 && <5: using base-4.19.2.0
  16719. 1384.35 s [unordered-containers] Dependency deepseq >=1.4.3: using deepseq-1.5.1.0
  16720. 1384.35 s [unordered-containers] Dependency hashable >=1.4 && <1.6: using hashable-1.5.0.0
  16721. 1384.35 s [unordered-containers] Dependency template-haskell <2.24: using template-haskell-2.21.0.0
  16722. 1384.35 s [unordered-containers] Dependency ChasingBottoms: using ChasingBottoms-1.3.1.17
  16723. 1384.35 s [unordered-containers] Dependency HUnit: using HUnit-1.6.2.0
  16724. 1384.35 s [unordered-containers] Dependency QuickCheck >=2.4.0.1: using QuickCheck-2.15.0.1
  16725. 1384.35 s [unordered-containers] Dependency base: using base-4.19.2.0
  16726. 1384.35 s [unordered-containers] Dependency containers >=0.5.8: using containers-0.6.8
  16727. 1384.35 s [unordered-containers] Dependency hashable: using hashable-1.5.0.0
  16728. 1384.35 s [unordered-containers] Dependency nothunks >=0.1.3: using nothunks-0.3.1
  16729. 1384.35 s [unordered-containers] Dependency random: using random-1.2.1.3
  16730. 1384.35 s [unordered-containers] Dependency tasty >=1.4.0.3: using tasty-1.5.3
  16731. 1384.35 s [unordered-containers] Dependency tasty-hunit >=0.10.0.3: using tasty-hunit-0.10.2
  16732. 1384.35 s [unordered-containers] Dependency tasty-quickcheck >=0.10.1.2: using tasty-quickcheck-0.11.1
  16733. 1384.35 s [unordered-containers] Dependency unordered-containers: using unordered-containers-0.2.20.1
  16734. 1384.80 s [unordered-containers] Source component graph:
  16735. 1384.80 s [unordered-containers] component lib
  16736. 1384.80 s [unordered-containers] component test:unordered-containers-tests dependency lib
  16737. 1384.80 s [unordered-containers] Configured component graph:
  16738. 1384.80 s [unordered-containers] component unordered-containers-0.2.20.1-Cbq0HfNXyUe8yCdjkMHJvy
  16739. 1384.80 s [unordered-containers] include base-4.19.2.0-a4d2
  16740. 1384.80 s [unordered-containers] include deepseq-1.5.1.0-2184
  16741. 1384.80 s [unordered-containers] include hashable-1.5.0.0-ATau4StKspC7PbUmDqJvq1
  16742. 1384.80 s [unordered-containers] include template-haskell-2.21.0.0-cf26
  16743. 1384.80 s [unordered-containers] component unordered-containers-0.2.20.1-HM98DEfccw0CwjXoFVJeUj-unordered-containers-tests
  16744. 1384.80 s [unordered-containers] include ChasingBottoms-1.3.1.17-Ah3Z9oBVFKW5JdxqlMZrV4
  16745. 1384.80 s [unordered-containers] include HUnit-1.6.2.0-3JXxihbFbfoB9MlN5UzWLe
  16746. 1384.80 s [unordered-containers] include QuickCheck-2.15.0.1-2BdQuHKQVeZ1bFh8DuLq55
  16747. 1384.80 s [unordered-containers] include base-4.19.2.0-a4d2
  16748. 1384.80 s [unordered-containers] include containers-0.6.8-1373
  16749. 1384.80 s [unordered-containers] include hashable-1.5.0.0-ATau4StKspC7PbUmDqJvq1
  16750. 1384.80 s [unordered-containers] include nothunks-0.3.1-A6mvU1Z4lXoIgvXHQWXxR1
  16751. 1384.80 s [unordered-containers] include random-1.2.1.3-jboRdLLnYgxZ05UNY3Mp
  16752. 1384.80 s [unordered-containers] include tasty-1.5.3-KEgV0Lf2f7EJ3jK2Y7VIf6
  16753. 1384.80 s [unordered-containers] include tasty-hunit-0.10.2-JS3cbCHWyhEKpg2zmj91qe
  16754. 1384.80 s [unordered-containers] include tasty-quickcheck-0.11.1-DHhHz1LjT4W7Z49DpnNAd3
  16755. 1384.80 s [unordered-containers] include unordered-containers-0.2.20.1-Cbq0HfNXyUe8yCdjkMHJvy
  16756. 1384.80 s [unordered-containers] Linked component graph:
  16757. 1384.80 s [unordered-containers] unit unordered-containers-0.2.20.1-Cbq0HfNXyUe8yCdjkMHJvy
  16758. 1384.80 s [unordered-containers] include base-4.19.2.0-a4d2
  16759. 1384.80 s [unordered-containers] include deepseq-1.5.1.0-2184
  16760. 1384.80 s [unordered-containers] include hashable-1.5.0.0-ATau4StKspC7PbUmDqJvq1
  16761. 1384.80 s [unordered-containers] include template-haskell-2.21.0.0-cf26
  16762. 1384.80 s [unordered-containers] Data.HashMap.Internal=unordered-containers-0.2.20.1-Cbq0HfNXyUe8yCdjkMHJvy:Data.HashMap.Internal,Data.HashMap.Internal.Array=unordered-containers-0.2.20.1-Cbq0HfNXyUe8yCdjkMHJvy:Data.HashMap.Internal.Array,Data.HashMap.Internal.Debug=unordered-containers-0.2.20.1-Cbq0HfNXyUe8yCdjkMHJvy:Data.HashMap.Internal.Debug,Data.HashMap.Internal.List=unordered-containers-0.2.20.1-Cbq0HfNXyUe8yCdjkMHJvy:Data.HashMap.Internal.List,Data.HashMap.Internal.Strict=unordered-containers-0.2.20.1-Cbq0HfNXyUe8yCdjkMHJvy:Data.HashMap.Internal.Strict,Data.HashMap.Lazy=unordered-containers-0.2.20.1-Cbq0HfNXyUe8yCdjkMHJvy:Data.HashMap.Lazy,Data.HashMap.Strict=unordered-containers-0.2.20.1-Cbq0HfNXyUe8yCdjkMHJvy:Data.HashMap.Strict,Data.HashSet=unordered-containers-0.2.20.1-Cbq0HfNXyUe8yCdjkMHJvy:Data.HashSet,Data.HashSet.Internal=unordered-containers-0.2.20.1-Cbq0HfNXyUe8yCdjkMHJvy:Data.HashSet.Internal
  16763. 1384.80 s [unordered-containers] unit unordered-containers-0.2.20.1-HM98DEfccw0CwjXoFVJeUj-unordered-containers-tests
  16764. 1384.80 s [unordered-containers] include ChasingBottoms-1.3.1.17-Ah3Z9oBVFKW5JdxqlMZrV4
  16765. 1384.80 s [unordered-containers] include HUnit-1.6.2.0-3JXxihbFbfoB9MlN5UzWLe
  16766. 1384.80 s [unordered-containers] include QuickCheck-2.15.0.1-2BdQuHKQVeZ1bFh8DuLq55
  16767. 1384.80 s [unordered-containers] include base-4.19.2.0-a4d2
  16768. 1384.80 s [unordered-containers] include containers-0.6.8-1373
  16769. 1384.80 s [unordered-containers] include hashable-1.5.0.0-ATau4StKspC7PbUmDqJvq1
  16770. 1384.80 s [unordered-containers] include nothunks-0.3.1-A6mvU1Z4lXoIgvXHQWXxR1
  16771. 1384.80 s [unordered-containers] include random-1.2.1.3-jboRdLLnYgxZ05UNY3Mp
  16772. 1384.80 s [unordered-containers] include tasty-1.5.3-KEgV0Lf2f7EJ3jK2Y7VIf6
  16773. 1384.80 s [unordered-containers] include tasty-hunit-0.10.2-JS3cbCHWyhEKpg2zmj91qe
  16774. 1384.80 s [unordered-containers] include tasty-quickcheck-0.11.1-DHhHz1LjT4W7Z49DpnNAd3
  16775. 1384.80 s [unordered-containers] include unordered-containers-0.2.20.1-Cbq0HfNXyUe8yCdjkMHJvy
  16776. 1384.80 s [unordered-containers] Ready component graph:
  16777. 1384.80 s [unordered-containers] definite unordered-containers-0.2.20.1-Cbq0HfNXyUe8yCdjkMHJvy
  16778. 1384.80 s [unordered-containers] depends base-4.19.2.0-a4d2
  16779. 1384.80 s [unordered-containers] depends deepseq-1.5.1.0-2184
  16780. 1384.80 s [unordered-containers] depends hashable-1.5.0.0-ATau4StKspC7PbUmDqJvq1
  16781. 1384.80 s [unordered-containers] depends template-haskell-2.21.0.0-cf26
  16782. 1384.80 s [unordered-containers] definite unordered-containers-0.2.20.1-HM98DEfccw0CwjXoFVJeUj-unordered-containers-tests
  16783. 1384.80 s [unordered-containers] depends ChasingBottoms-1.3.1.17-Ah3Z9oBVFKW5JdxqlMZrV4
  16784. 1384.80 s [unordered-containers] depends HUnit-1.6.2.0-3JXxihbFbfoB9MlN5UzWLe
  16785. 1384.80 s [unordered-containers] depends QuickCheck-2.15.0.1-2BdQuHKQVeZ1bFh8DuLq55
  16786. 1384.80 s [unordered-containers] depends base-4.19.2.0-a4d2
  16787. 1384.80 s [unordered-containers] depends containers-0.6.8-1373
  16788. 1384.80 s [unordered-containers] depends hashable-1.5.0.0-ATau4StKspC7PbUmDqJvq1
  16789. 1384.80 s [unordered-containers] depends nothunks-0.3.1-A6mvU1Z4lXoIgvXHQWXxR1
  16790. 1384.80 s [unordered-containers] depends random-1.2.1.3-jboRdLLnYgxZ05UNY3Mp
  16791. 1384.80 s [unordered-containers] depends tasty-1.5.3-KEgV0Lf2f7EJ3jK2Y7VIf6
  16792. 1384.80 s [unordered-containers] depends tasty-hunit-0.10.2-JS3cbCHWyhEKpg2zmj91qe
  16793. 1384.80 s [unordered-containers] depends tasty-quickcheck-0.11.1-DHhHz1LjT4W7Z49DpnNAd3
  16794. 1384.80 s [unordered-containers] depends unordered-containers-0.2.20.1-Cbq0HfNXyUe8yCdjkMHJvy
  16795. 1384.80 s [unordered-containers] Using Cabal-3.10.3.0 compiled by ghc-9.8
  16796. 1384.80 s [unordered-containers] Using compiler: ghc-9.8.4
  16797. 1384.80 s [unordered-containers] Using install prefix:
  16798. 1384.80 s [unordered-containers] /nix/store/iri9gy5dns30dwfdqmcjpy61jzl7hc9s-unordered-containers-0.2.20.1
  16799. 1384.80 s [unordered-containers] Executables installed in:
  16800. 1384.80 s [unordered-containers] /nix/store/iri9gy5dns30dwfdqmcjpy61jzl7hc9s-unordered-containers-0.2.20.1/bin
  16801. 1384.80 s [unordered-containers] Libraries installed in:
  16802. 1384.80 s [unordered-containers] /nix/store/iri9gy5dns30dwfdqmcjpy61jzl7hc9s-unordered-containers-0.2.20.1/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/unordered-containers-0.2.20.1-Cbq0HfNXyUe8yCdjkMHJvy
  16803. 1384.80 s [unordered-containers] Dynamic Libraries installed in:
  16804. 1384.80 s [unordered-containers] /nix/store/iri9gy5dns30dwfdqmcjpy61jzl7hc9s-unordered-containers-0.2.20.1/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4
  16805. 1384.80 s [unordered-containers] Private executables installed in:
  16806. 1384.80 s [unordered-containers] /nix/store/iri9gy5dns30dwfdqmcjpy61jzl7hc9s-unordered-containers-0.2.20.1/libexec/x86_64-linux-ghc-9.8.4/unordered-containers-0.2.20.1
  16807. 1384.80 s [unordered-containers] Data files installed in:
  16808. 1384.80 s [unordered-containers] /nix/store/iri9gy5dns30dwfdqmcjpy61jzl7hc9s-unordered-containers-0.2.20.1/share/x86_64-linux-ghc-9.8.4/unordered-containers-0.2.20.1
  16809. 1384.80 s [unordered-containers] Documentation installed in:
  16810. 1384.80 s [unordered-containers] /nix/store/p6rbrfq031rssl5q8yvfyabd0l5p5v1n-unordered-containers-0.2.20.1-doc/share/doc/unordered-containers-0.2.20.1
  16811. 1384.80 s [unordered-containers] Configuration files installed in:
  16812. 1384.80 s [unordered-containers] /nix/store/iri9gy5dns30dwfdqmcjpy61jzl7hc9s-unordered-containers-0.2.20.1/etc
  16813. 1384.80 s [unordered-containers] No alex found
  16814. 1384.80 s [unordered-containers] Using ar found on system at:
  16815. 1384.80 s [unordered-containers] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
  16816. 1384.80 s [unordered-containers] No c2hs found
  16817. 1384.80 s [unordered-containers] No cpphs found
  16818. 1384.80 s [unordered-containers] No doctest found
  16819. 1384.80 s [unordered-containers] Using gcc version 14.3.0 given by user at:
  16820. 1384.80 s [unordered-containers] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
  16821. 1384.80 s [unordered-containers] Using ghc version 9.8.4 found on system at:
  16822. 1384.80 s [unordered-containers] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/ghc
  16823. 1384.80 s [unordered-containers] Using ghc-pkg version 9.8.4 found on system at:
  16824. 1384.80 s [unordered-containers] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/ghc-pkg-9.8.4
  16825. 1384.80 s [unordered-containers] No ghcjs found
  16826. 1384.80 s [unordered-containers] No ghcjs-pkg found
  16827. 1384.80 s [unordered-containers] No greencard found
  16828. 1384.80 s [unordered-containers] Using haddock version 2.30.0 found on system at:
  16829. 1384.80 s [unordered-containers] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/haddock-ghc-9.8.4
  16830. 1384.80 s [unordered-containers] No happy found
  16831. 1384.80 s [unordered-containers] Using haskell-suite found on system at: haskell-suite-dummy-location
  16832. 1384.80 s [unordered-containers] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  16833. 1384.80 s [unordered-containers] No hmake found
  16834. 1384.80 s [unordered-containers] Using hpc version 0.69 found on system at:
  16835. 1384.80 s [unordered-containers] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/hpc-ghc-9.8.4
  16836. 1384.80 s [unordered-containers] Using hsc2hs version 0.68.10 found on system at:
  16837. 1384.80 s [unordered-containers] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/hsc2hs-ghc-9.8.4
  16838. 1384.80 s [unordered-containers] Using hscolour version 1.25 found on system at:
  16839. 1384.80 s [unordered-containers] /nix/store/vl14mqkz7z183r6sq9qz932j3pix6v5c-hscolour-1.25/bin/HsColour
  16840. 1384.80 s [unordered-containers] No jhc found
  16841. 1384.80 s [unordered-containers] Using ld found on system at:
  16842. 1384.80 s [unordered-containers] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ld.gold
  16843. 1384.80 s [unordered-containers] No pkg-config found
  16844. 1384.80 s [unordered-containers] Using runghc version 9.8.4 found on system at:
  16845. 1384.80 s [unordered-containers] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/runghc-9.8.4
  16846. 1384.80 s [unordered-containers] Using strip version 2.44 found on system at:
  16847. 1384.80 s [unordered-containers] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
  16848. 1384.80 s [unordered-containers] Using tar found on system at:
  16849. 1384.80 s [unordered-containers] /nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
  16850. 1384.80 s [unordered-containers] No uhc found
  16851. 1385.10 s [unordered-containers] Phase: buildPhase
  16852. 1385.24 s [unordered-containers] Preprocessing library for unordered-containers-0.2.20.1..
  16853. 1385.27 s [unordered-containers] Building library for unordered-containers-0.2.20.1..
  16854. 1385.43 s [unordered-containers]
  16855. 1385.43 s [unordered-containers] Data/HashMap/Internal.hs:12:14-23: warning: [GHC-53692] [-Wdeprecated-flags]
  16856. 1385.43 s [unordered-containers] -XTypeInType is deprecated: use -XDataKinds and -XPolyKinds instead
  16857. 1385.43 s [unordered-containers] |
  16858. 1385.43 s [unordered-containers] 12 | {-# LANGUAGE TypeInType #-}
  16859. 1385.43 s [unordered-containers] | ^^^^^^^^^^
  16860. 1385.71 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 )
  16861. 1385.99 s [unordered-containers]
  16862. 1385.99 s [unordered-containers] Data/HashMap/Internal/Array.hs:83:1-35: warning: [GHC-66111] [-Wunused-imports]
  16863. 1385.99 s [unordered-containers] The import of ‘Control.Applicative’ is redundant
  16864. 1385.99 s [unordered-containers] except perhaps to import instances from ‘Control.Applicative’
  16865. 1385.99 s [unordered-containers] To import instances alone, use: import Control.Applicative()
  16866. 1385.99 s [unordered-containers] |
  16867. 1385.99 s [unordered-containers] 83 | import Control.Applicative (liftA2)
  16868. 1385.99 s [unordered-containers] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  16869. 1386.80 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 )
  16870. 1386.80 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 )
  16871. 1395.34 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 )
  16872. 1395.67 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 )
  16873. 1398.27 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 )
  16874. 1398.27 s [unordered-containers] [7 of 9] Compiling Data.HashSet ( Data/HashSet.hs, dist/build/Data/HashSet.o, dist/build/Data/HashSet.dyn_o )
  16875. 1398.27 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 )
  16876. 1398.30 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 )
  16877. 1398.61 s [unordered-containers]
  16878. 1398.61 s [unordered-containers] Data/HashMap/Internal.hs:12:14-23: warning: [GHC-53692] [-Wdeprecated-flags]
  16879. 1398.62 s [unordered-containers] -XTypeInType is deprecated: use -XDataKinds and -XPolyKinds instead
  16880. 1398.62 s [unordered-containers] |
  16881. 1398.62 s [unordered-containers] 12 | {-# LANGUAGE TypeInType #-}
  16882. 1398.62 s [unordered-containers] | ^^^^^^^^^^
  16883. 1398.96 s [unordered-containers] [1 of 9] Compiling Data.HashMap.Internal.Array ( Data/HashMap/Internal/Array.hs, dist/build/Data/HashMap/Internal/Array.p_o )
  16884. 1399.16 s [unordered-containers]
  16885. 1399.16 s [unordered-containers] Data/HashMap/Internal/Array.hs:83:1-35: warning: [GHC-66111] [-Wunused-imports]
  16886. 1399.16 s [unordered-containers] The import of ‘Control.Applicative’ is redundant
  16887. 1399.16 s [unordered-containers] except perhaps to import instances from ‘Control.Applicative’
  16888. 1399.16 s [unordered-containers] To import instances alone, use: import Control.Applicative()
  16889. 1399.16 s [unordered-containers] |
  16890. 1399.16 s [unordered-containers] 83 | import Control.Applicative (liftA2)
  16891. 1399.16 s [unordered-containers] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  16892. 1400.00 s [unordered-containers] [2 of 9] Compiling Data.HashMap.Internal.List ( Data/HashMap/Internal/List.hs, dist/build/Data/HashMap/Internal/List.p_o )
  16893. 1400.00 s [unordered-containers] [3 of 9] Compiling Data.HashMap.Internal ( Data/HashMap/Internal.hs, dist/build/Data/HashMap/Internal.p_o )
  16894. 1409.45 s [unordered-containers] [4 of 9] Compiling Data.HashMap.Internal.Debug ( Data/HashMap/Internal/Debug.hs, dist/build/Data/HashMap/Internal/Debug.p_o )
  16895. 1410.05 s [unordered-containers] [5 of 9] Compiling Data.HashMap.Internal.Strict ( Data/HashMap/Internal/Strict.hs, dist/build/Data/HashMap/Internal/Strict.p_o )
  16896. 1412.65 s [unordered-containers] [6 of 9] Compiling Data.HashSet.Internal ( Data/HashSet/Internal.hs, dist/build/Data/HashSet/Internal.p_o )
  16897. 1412.65 s [unordered-containers] [7 of 9] Compiling Data.HashSet ( Data/HashSet.hs, dist/build/Data/HashSet.p_o )
  16898. 1412.65 s [unordered-containers] [8 of 9] Compiling Data.HashMap.Strict ( Data/HashMap/Strict.hs, dist/build/Data/HashMap/Strict.p_o )
  16899. 1412.86 s [unordered-containers] [9 of 9] Compiling Data.HashMap.Lazy ( Data/HashMap/Lazy.hs, dist/build/Data/HashMap/Lazy.p_o )
  16900. 1414.72 s [unordered-containers] Preprocessing test suite 'unordered-containers-tests' for unordered-containers-0.2.20.1..
  16901. 1414.72 s [unordered-containers] Building test suite 'unordered-containers-tests' for unordered-containers-0.2.20.1..
  16902. 1415.11 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 )
  16903. 1415.51 s [unordered-containers] [2 of 9] Compiling Regressions ( tests/Regressions.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Regressions.o )
  16904. 1415.60 s [unordered-containers]
  16905. 1415.61 s [unordered-containers] tests/Regressions.hs:93:16: warning: [GHC-63394] [-Wx-partial]
  16906. 1415.61 s [unordered-containers] In the use of ‘head’
  16907. 1415.61 s [unordered-containers] (imported from Prelude, but defined in GHC.List):
  16908. 1415.61 s [unordered-containers] "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
  16909. 1415.61 s [unordered-containers] |
  16910. 1415.61 s [unordered-containers] 93 | k = head keys
  16911. 1415.61 s [unordered-containers] | ^^^^
  16912. 1419.31 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 )
  16913. 1419.31 s [unordered-containers] [4 of 9] Compiling Strictness ( tests/Strictness.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Strictness.o )
  16914. 1419.31 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 )
  16915. 1419.31 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 )
  16916. 1427.34 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 )
  16917. 1427.38 s [unordered-containers] [8 of 9] Compiling Properties ( tests/Properties.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Properties.o )
  16918. 1427.38 s [unordered-containers] [9 of 9] Compiling Main ( tests/Main.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Main.o )
  16919. 1427.99 s [unordered-containers] [10 of 10] Linking dist/build/unordered-containers-tests/unordered-containers-tests
  16920. 1429.15 s [unordered-containers] buildPhase completed in 44 seconds
  16921. 1429.15 s [unordered-containers] Phase: checkPhase
  16922. 1429.19 s [unordered-containers] Running 1 test suites...
  16923. 1429.19 s [unordered-containers] Test suite unordered-containers-tests: RUNNING...
  16924. 1429.21 s [unordered-containers] All
  16925. 1429.21 s [unordered-containers] Properties
  16926. 1429.21 s [unordered-containers] Data.HashMap.Lazy
  16927. 1429.21 s [unordered-containers] instances
  16928. 1429.21 s [unordered-containers] Eq
  16929. 1429.28 s [unordered-containers] ==: OK (0.02s)
  16930. 1429.28 s [unordered-containers] +++ OK, passed 100 tests.
  16931. 1429.28 s [unordered-containers] /=: OK (0.02s)
  16932. 1429.28 s [unordered-containers] +++ OK, passed 100 tests.
  16933. 1429.28 s [unordered-containers] Ord
  16934. 1429.28 s [unordered-containers] compare reflexive: OK (0.01s)
  16935. 1429.28 s [unordered-containers] +++ OK, passed 100 tests.
  16936. 1429.28 s [unordered-containers] compare transitive: OK (0.02s)
  16937. 1429.28 s [unordered-containers] +++ OK, passed 100 tests.
  16938. 1429.28 s [unordered-containers] compare antisymmetric: OK (0.02s)
  16939. 1429.28 s [unordered-containers] +++ OK, passed 100 tests.
  16940. 1429.28 s [unordered-containers] Ord => Eq: OK (0.01s)
  16941. 1429.28 s [unordered-containers] +++ OK, passed 100 tests.
  16942. 1429.40 s [unordered-containers] Read/Show: OK (0.17s)
  16943. 1429.40 s [unordered-containers] +++ OK, passed 100 tests.
  16944. 1429.40 s [unordered-containers] Functor: OK (0.04s)
  16945. 1429.40 s [unordered-containers] +++ OK, passed 100 tests.
  16946. 1429.40 s [unordered-containers] Foldable: OK (0.02s)
  16947. 1429.40 s [unordered-containers] +++ OK, passed 100 tests.
  16948. 1429.40 s [unordered-containers] Bifoldable
  16949. 1429.40 s [unordered-containers] bifoldMap: OK (0.01s)
  16950. 1429.40 s [unordered-containers] +++ OK, passed 100 tests.
  16951. 1429.40 s [unordered-containers] bifoldr: OK (0.02s)
  16952. 1429.40 s [unordered-containers] +++ OK, passed 100 tests.
  16953. 1429.40 s [unordered-containers] bifoldl: OK (0.03s)
  16954. 1429.40 s [unordered-containers] +++ OK, passed 100 tests.
  16955. 1429.40 s [unordered-containers] Hashable: OK (0.03s)
  16956. 1429.40 s [unordered-containers] +++ OK, passed 100 tests.
  16957. 1429.40 s [unordered-containers] empty
  16958. 1429.40 s [unordered-containers] valid: OK
  16959. 1429.40 s [unordered-containers] +++ OK, passed 1 test.
  16960. 1429.40 s [unordered-containers] singleton
  16961. 1429.40 s [unordered-containers] valid: OK
  16962. 1429.40 s [unordered-containers] +++ OK, passed 100 tests.
  16963. 1429.40 s [unordered-containers] size: OK (0.01s)
  16964. 1429.40 s [unordered-containers] +++ OK, passed 100 tests.
  16965. 1429.40 s [unordered-containers] member: OK (0.02s)
  16966. 1429.40 s [unordered-containers] +++ OK, passed 100 tests.
  16967. 1429.40 s [unordered-containers] lookup: OK (0.01s)
  16968. 1429.40 s [unordered-containers] +++ OK, passed 100 tests.
  16969. 1429.40 s [unordered-containers] !?: OK
  16970. 1429.40 s [unordered-containers] +++ OK, passed 100 tests.
  16971. 1429.40 s [unordered-containers] insert
  16972. 1429.40 s [unordered-containers] model: OK (0.02s)
  16973. 1429.40 s [unordered-containers] +++ OK, passed 100 tests.
  16974. 1429.40 s [unordered-containers] valid: OK
  16975. 1429.41 s [unordered-containers] +++ OK, passed 100 tests.
  16976. 1429.41 s [unordered-containers] insertWith
  16977. 1429.41 s [unordered-containers] insertWith: OK
  16978. 1429.41 s [unordered-containers] +++ OK, passed 100 tests.
  16979. 1429.41 s [unordered-containers] valid: OK
  16980. 1429.41 s [unordered-containers] +++ OK, passed 100 tests.
  16981. 1429.41 s [unordered-containers] delete
  16982. 1429.41 s [unordered-containers] model: OK
  16983. 1429.41 s [unordered-containers] +++ OK, passed 100 tests.
  16984. 1429.41 s [unordered-containers] valid: OK
  16985. 1429.41 s [unordered-containers] +++ OK, passed 100 tests.
  16986. 1429.41 s [unordered-containers] adjust
  16987. 1429.41 s [unordered-containers] model: OK (0.02s)
  16988. 1429.41 s [unordered-containers] +++ OK, passed 100 tests.
  16989. 1429.41 s [unordered-containers] valid: OK
  16990. 1429.41 s [unordered-containers] +++ OK, passed 100 tests.
  16991. 1429.41 s [unordered-containers] update
  16992. 1429.41 s [unordered-containers] model: OK
  16993. 1429.41 s [unordered-containers] +++ OK, passed 100 tests.
  16994. 1429.41 s [unordered-containers] valid: OK
  16995. 1429.41 s [unordered-containers] +++ OK, passed 100 tests.
  16996. 1429.41 s [unordered-containers] alter
  16997. 1429.41 s [unordered-containers] model: OK
  16998. 1429.41 s [unordered-containers] +++ OK, passed 100 tests.
  16999. 1429.41 s [unordered-containers] valid: OK
  17000. 1429.41 s [unordered-containers] +++ OK, passed 100 tests.
  17001. 1429.41 s [unordered-containers] alterF
  17002. 1429.41 s [unordered-containers] model
  17003. 1429.41 s [unordered-containers] []: OK (0.14s)
  17004. 1429.41 s [unordered-containers] +++ OK, passed 100 tests.
  17005. 1429.41 s [unordered-containers] adjust: OK (0.01s)
  17006. 1429.41 s [unordered-containers] +++ OK, passed 100 tests.
  17007. 1429.41 s [unordered-containers] insert: OK
  17008. 1429.41 s [unordered-containers] +++ OK, passed 100 tests.
  17009. 1429.41 s [unordered-containers] insertWith: OK
  17010. 1429.41 s [unordered-containers] +++ OK, passed 100 tests.
  17011. 1429.41 s [unordered-containers] delete: OK
  17012. 1429.41 s [unordered-containers] +++ OK, passed 100 tests.
  17013. 1429.41 s [unordered-containers] lookup: OK
  17014. 1429.41 s [unordered-containers] +++ OK, passed 100 tests.
  17015. 1429.41 s [unordered-containers] valid: OK (0.02s)
  17016. 1429.41 s [unordered-containers] +++ OK, passed 100 tests.
  17017. 1429.41 s [unordered-containers] isSubmapOf
  17018. 1429.41 s [unordered-containers] model: OK (0.02s)
  17019. 1429.41 s [unordered-containers] +++ OK, passed 100 tests.
  17020. 1429.41 s [unordered-containers] m ⊆ m: OK
  17021. 1429.41 s [unordered-containers] +++ OK, passed 100 tests.
  17022. 1429.41 s [unordered-containers] m1 ⊆ m1 ∪ m2: OK (0.01s)
  17023. 1429.41 s [unordered-containers] +++ OK, passed 100 tests.
  17024. 1429.41 s [unordered-containers] m1\m2 ⊆ m1: OK
  17025. 1429.41 s [unordered-containers] +++ OK, passed 100 tests.
  17026. 1429.41 s [unordered-containers] m1 ∩ m2 ≠ ∅ ⇒ m1 ⊈ m1\m2 : OK
  17027. 1429.41 s [unordered-containers] +++ OK, passed 100 tests; 204 discarded.
  17028. 1429.41 s [unordered-containers] delete k m ⊆ m: OK
  17029. 1429.41 s [unordered-containers] +++ OK, passed 100 tests; 19 discarded.
  17030. 1429.41 s [unordered-containers] m ⊈ delete k m : OK
  17031. 1429.41 s [unordered-containers] +++ OK, passed 100 tests; 13 discarded.
  17032. 1429.41 s [unordered-containers] k ∉ m ⇒ m ⊆ insert k v m: OK (0.03s)
  17033. 1429.41 s [unordered-containers] +++ OK, passed 100 tests; 15 discarded.
  17034. 1429.41 s [unordered-containers] k ∉ m ⇒ insert k v m ⊈ m: OK (0.02s)
  17035. 1429.41 s [unordered-containers] +++ OK, passed 100 tests; 14 discarded.
  17036. 1429.41 s [unordered-containers] union
  17037. 1429.41 s [unordered-containers] model: OK (0.03s)
  17038. 1429.41 s [unordered-containers] +++ OK, passed 100 tests.
  17039. 1429.41 s [unordered-containers] valid: OK
  17040. 1429.41 s [unordered-containers] +++ OK, passed 100 tests.
  17041. 1429.41 s [unordered-containers] unionWith
  17042. 1429.41 s [unordered-containers] model: OK (0.02s)
  17043. 1429.41 s [unordered-containers] +++ OK, passed 100 tests.
  17044. 1429.41 s [unordered-containers] valid: OK
  17045. 1429.41 s [unordered-containers] +++ OK, passed 100 tests.
  17046. 1429.41 s [unordered-containers] unionWithKey
  17047. 1429.41 s [unordered-containers] model: OK (0.03s)
  17048. 1429.41 s [unordered-containers] +++ OK, passed 100 tests.
  17049. 1429.41 s [unordered-containers] valid: OK
  17050. 1429.41 s [unordered-containers] +++ OK, passed 100 tests.
  17051. 1429.41 s [unordered-containers] unions
  17052. 1430.15 s [unordered-containers] model: OK (0.90s)
  17053. 1430.15 s [unordered-containers] +++ OK, passed 100 tests.
  17054. 1430.15 s [unordered-containers] valid: OK (0.36s)
  17055. 1430.15 s [unordered-containers] +++ OK, passed 100 tests.
  17056. 1430.15 s [unordered-containers] difference
  17057. 1430.15 s [unordered-containers] model: OK (0.02s)
  17058. 1430.15 s [unordered-containers] +++ OK, passed 100 tests.
  17059. 1430.15 s [unordered-containers] valid: OK (0.01s)
  17060. 1430.15 s [unordered-containers] +++ OK, passed 100 tests.
  17061. 1430.15 s [unordered-containers] differenceWith
  17062. 1430.15 s [unordered-containers] model: OK (0.07s)
  17063. 1430.15 s [unordered-containers] +++ OK, passed 100 tests.
  17064. 1430.15 s [unordered-containers] valid: OK (0.02s)
  17065. 1430.15 s [unordered-containers] +++ OK, passed 100 tests.
  17066. 1430.15 s [unordered-containers] intersection
  17067. 1430.15 s [unordered-containers] model: OK (0.01s)
  17068. 1430.15 s [unordered-containers] +++ OK, passed 100 tests.
  17069. 1430.15 s [unordered-containers] valid: OK (0.01s)
  17070. 1430.15 s [unordered-containers] +++ OK, passed 100 tests.
  17071. 1430.15 s [unordered-containers] intersectionWith
  17072. 1430.15 s [unordered-containers] model: OK (0.04s)
  17073. 1430.15 s [unordered-containers] +++ OK, passed 100 tests.
  17074. 1430.15 s [unordered-containers] valid: OK (0.08s)
  17075. 1430.15 s [unordered-containers] +++ OK, passed 100 tests.
  17076. 1430.15 s [unordered-containers] intersectionWithKey
  17077. 1430.15 s [unordered-containers] model: OK (0.10s)
  17078. 1430.15 s [unordered-containers] +++ OK, passed 100 tests.
  17079. 1430.15 s [unordered-containers] valid: OK
  17080. 1430.15 s [unordered-containers] +++ OK, passed 100 tests.
  17081. 1430.15 s [unordered-containers] compose
  17082. 1430.15 s [unordered-containers] valid: OK (0.03s)
  17083. 1430.15 s [unordered-containers] +++ OK, passed 100 tests.
  17084. 1430.15 s [unordered-containers] map
  17085. 1430.15 s [unordered-containers] model: OK (0.07s)
  17086. 1430.15 s [unordered-containers] +++ OK, passed 100 tests.
  17087. 1430.15 s [unordered-containers] valid: OK
  17088. 1430.15 s [unordered-containers] +++ OK, passed 100 tests.
  17089. 1430.15 s [unordered-containers] traverseWithKey
  17090. 1430.15 s [unordered-containers] model: OK (0.22s)
  17091. 1430.15 s [unordered-containers] +++ OK, passed 100 tests.
  17092. 1430.15 s [unordered-containers] valid: OK (0.05s)
  17093. 1430.15 s [unordered-containers] +++ OK, passed 100 tests.
  17094. 1430.15 s [unordered-containers] mapKeys
  17095. 1430.15 s [unordered-containers] model: OK (0.02s)
  17096. 1430.15 s [unordered-containers] +++ OK, passed 100 tests.
  17097. 1430.15 s [unordered-containers] valid: OK (0.37s)
  17098. 1430.15 s [unordered-containers] +++ OK, passed 100 tests.
  17099. 1430.15 s [unordered-containers] foldr: OK (0.04s)
  17100. 1430.15 s [unordered-containers] +++ OK, passed 100 tests.
  17101. 1430.15 s [unordered-containers] foldl: OK (0.05s)
  17102. 1430.15 s [unordered-containers] +++ OK, passed 100 tests.
  17103. 1430.15 s [unordered-containers] foldrWithKey: OK (0.03s)
  17104. 1430.15 s [unordered-containers] +++ OK, passed 100 tests.
  17105. 1430.15 s [unordered-containers] foldlWithKey: OK (0.03s)
  17106. 1430.15 s [unordered-containers] +++ OK, passed 100 tests.
  17107. 1430.15 s [unordered-containers] foldrWithKey': OK (0.04s)
  17108. 1430.15 s [unordered-containers] +++ OK, passed 100 tests.
  17109. 1430.15 s [unordered-containers] foldlWithKey': OK
  17110. 1430.15 s [unordered-containers] +++ OK, passed 100 tests.
  17111. 1430.15 s [unordered-containers] foldl': OK
  17112. 1430.15 s [unordered-containers] +++ OK, passed 100 tests.
  17113. 1430.15 s [unordered-containers] foldr': OK (0.04s)
  17114. 1430.15 s [unordered-containers] +++ OK, passed 100 tests.
  17115. 1430.15 s [unordered-containers] foldMapWithKey: OK
  17116. 1430.15 s [unordered-containers] +++ OK, passed 100 tests.
  17117. 1430.15 s [unordered-containers] filter
  17118. 1430.15 s [unordered-containers] model: OK (0.04s)
  17119. 1430.15 s [unordered-containers] +++ OK, passed 100 tests.
  17120. 1430.15 s [unordered-containers] valid: OK (0.02s)
  17121. 1430.15 s [unordered-containers] +++ OK, passed 100 tests.
  17122. 1430.15 s [unordered-containers] filterWithKey
  17123. 1430.49 s [unordered-containers] model: OK (1.16s)
  17124. 1430.49 s [unordered-containers] +++ OK, passed 100 tests.
  17125. 1430.50 s [unordered-containers] valid: OK (0.34s)
  17126. 1430.50 s [unordered-containers] +++ OK, passed 100 tests.
  17127. 1430.50 s [unordered-containers] mapMaybe
  17128. 1430.50 s [unordered-containers] model: OK (0.06s)
  17129. 1430.50 s [unordered-containers] +++ OK, passed 100 tests.
  17130. 1430.50 s [unordered-containers] valid: OK (0.03s)
  17131. 1430.50 s [unordered-containers] +++ OK, passed 100 tests.
  17132. 1430.50 s [unordered-containers] mapMaybeWithKey
  17133. 1430.63 s [unordered-containers] model: OK (1.30s)
  17134. 1430.63 s [unordered-containers] +++ OK, passed 100 tests.
  17135. 1430.63 s [unordered-containers] valid: OK (0.41s)
  17136. 1430.63 s [unordered-containers] +++ OK, passed 100 tests.
  17137. 1430.64 s [unordered-containers] elems: OK (0.01s)
  17138. 1430.64 s [unordered-containers] +++ OK, passed 100 tests.
  17139. 1430.64 s [unordered-containers] keys: OK (0.02s)
  17140. 1430.64 s [unordered-containers] +++ OK, passed 100 tests.
  17141. 1430.64 s [unordered-containers] fromList
  17142. 1430.64 s [unordered-containers] model: OK (0.01s)
  17143. 1430.64 s [unordered-containers] +++ OK, passed 100 tests.
  17144. 1430.64 s [unordered-containers] valid: OK
  17145. 1430.64 s [unordered-containers] +++ OK, passed 100 tests.
  17146. 1430.64 s [unordered-containers] fromListWith
  17147. 1430.64 s [unordered-containers] model: OK (0.01s)
  17148. 1430.64 s [unordered-containers] +++ OK, passed 100 tests.
  17149. 1430.64 s [unordered-containers] valid: OK (0.01s)
  17150. 1430.64 s [unordered-containers] +++ OK, passed 100 tests.
  17151. 1430.64 s [unordered-containers] fromListWithKey
  17152. 1430.64 s [unordered-containers] model: OK (0.03s)
  17153. 1430.64 s [unordered-containers] +++ OK, passed 100 tests.
  17154. 1430.64 s [unordered-containers] valid: OK
  17155. 1430.64 s [unordered-containers] +++ OK, passed 100 tests.
  17156. 1430.64 s [unordered-containers] toList: OK (0.02s)
  17157. 1430.64 s [unordered-containers] +++ OK, passed 100 tests.
  17158. 1430.64 s [unordered-containers] Data.HashMap.Strict
  17159. 1430.64 s [unordered-containers] instances
  17160. 1430.64 s [unordered-containers] Eq
  17161. 1430.64 s [unordered-containers] ==: OK (0.03s)
  17162. 1430.64 s [unordered-containers] +++ OK, passed 100 tests.
  17163. 1430.64 s [unordered-containers] /=: OK (0.02s)
  17164. 1430.64 s [unordered-containers] +++ OK, passed 100 tests.
  17165. 1430.64 s [unordered-containers] Ord
  17166. 1430.64 s [unordered-containers] compare reflexive: OK (0.01s)
  17167. 1430.64 s [unordered-containers] +++ OK, passed 100 tests.
  17168. 1430.64 s [unordered-containers] compare transitive: OK (0.03s)
  17169. 1430.64 s [unordered-containers] +++ OK, passed 100 tests.
  17170. 1430.64 s [unordered-containers] compare antisymmetric: OK (0.04s)
  17171. 1430.64 s [unordered-containers] +++ OK, passed 100 tests.
  17172. 1430.64 s [unordered-containers] Ord => Eq: OK (0.03s)
  17173. 1430.64 s [unordered-containers] +++ OK, passed 100 tests.
  17174. 1430.64 s [unordered-containers] Read/Show: OK (0.33s)
  17175. 1430.64 s [unordered-containers] +++ OK, passed 100 tests.
  17176. 1430.64 s [unordered-containers] Functor: OK (0.07s)
  17177. 1430.64 s [unordered-containers] +++ OK, passed 100 tests.
  17178. 1430.64 s [unordered-containers] Foldable: OK (0.02s)
  17179. 1430.64 s [unordered-containers] +++ OK, passed 100 tests.
  17180. 1430.64 s [unordered-containers] Bifoldable
  17181. 1430.64 s [unordered-containers] bifoldMap: OK (0.03s)
  17182. 1430.64 s [unordered-containers] +++ OK, passed 100 tests.
  17183. 1430.64 s [unordered-containers] bifoldr: OK (0.02s)
  17184. 1430.64 s [unordered-containers] +++ OK, passed 100 tests.
  17185. 1430.64 s [unordered-containers] bifoldl: OK (0.02s)
  17186. 1430.64 s [unordered-containers] +++ OK, passed 100 tests.
  17187. 1430.64 s [unordered-containers] Hashable: OK (0.04s)
  17188. 1430.64 s [unordered-containers] +++ OK, passed 100 tests.
  17189. 1430.64 s [unordered-containers] empty
  17190. 1430.64 s [unordered-containers] valid: OK
  17191. 1430.64 s [unordered-containers] +++ OK, passed 1 test.
  17192. 1430.64 s [unordered-containers] singleton
  17193. 1430.64 s [unordered-containers] valid: OK
  17194. 1430.64 s [unordered-containers] +++ OK, passed 100 tests.
  17195. 1430.64 s [unordered-containers] size: OK (0.02s)
  17196. 1430.64 s [unordered-containers] +++ OK, passed 100 tests.
  17197. 1430.64 s [unordered-containers] member: OK (0.02s)
  17198. 1430.64 s [unordered-containers] +++ OK, passed 100 tests.
  17199. 1430.64 s [unordered-containers] lookup: OK (0.02s)
  17200. 1430.64 s [unordered-containers] +++ OK, passed 100 tests.
  17201. 1430.65 s [unordered-containers] !?: OK (0.02s)
  17202. 1430.65 s [unordered-containers] +++ OK, passed 100 tests.
  17203. 1430.65 s [unordered-containers] insert
  17204. 1430.65 s [unordered-containers] model: OK (0.02s)
  17205. 1430.65 s [unordered-containers] +++ OK, passed 100 tests.
  17206. 1430.65 s [unordered-containers] valid: OK (0.02s)
  17207. 1430.65 s [unordered-containers] +++ OK, passed 100 tests.
  17208. 1430.65 s [unordered-containers] insertWith
  17209. 1430.65 s [unordered-containers] insertWith: OK (0.01s)
  17210. 1430.65 s [unordered-containers] +++ OK, passed 100 tests.
  17211. 1430.65 s [unordered-containers] valid: OK
  17212. 1430.65 s [unordered-containers] +++ OK, passed 100 tests.
  17213. 1430.65 s [unordered-containers] delete
  17214. 1430.65 s [unordered-containers] model: OK (0.02s)
  17215. 1430.65 s [unordered-containers] +++ OK, passed 100 tests.
  17216. 1430.65 s [unordered-containers] valid: OK
  17217. 1430.65 s [unordered-containers] +++ OK, passed 100 tests.
  17218. 1430.65 s [unordered-containers] adjust
  17219. 1430.65 s [unordered-containers] model: OK (0.02s)
  17220. 1430.65 s [unordered-containers] +++ OK, passed 100 tests.
  17221. 1430.65 s [unordered-containers] valid: OK
  17222. 1430.65 s [unordered-containers] +++ OK, passed 100 tests.
  17223. 1430.65 s [unordered-containers] update
  17224. 1430.65 s [unordered-containers] model: OK (0.02s)
  17225. 1430.65 s [unordered-containers] +++ OK, passed 100 tests.
  17226. 1430.65 s [unordered-containers] valid: OK (0.02s)
  17227. 1430.65 s [unordered-containers] +++ OK, passed 100 tests.
  17228. 1430.65 s [unordered-containers] alter
  17229. 1430.65 s [unordered-containers] model: OK (0.02s)
  17230. 1430.65 s [unordered-containers] +++ OK, passed 100 tests.
  17231. 1430.65 s [unordered-containers] valid: OK
  17232. 1430.65 s [unordered-containers] +++ OK, passed 100 tests.
  17233. 1430.65 s [unordered-containers] alterF
  17234. 1430.65 s [unordered-containers] model
  17235. 1430.65 s [unordered-containers] []: OK (0.18s)
  17236. 1430.65 s [unordered-containers] +++ OK, passed 100 tests.
  17237. 1430.65 s [unordered-containers] adjust: OK (0.02s)
  17238. 1430.65 s [unordered-containers] +++ OK, passed 100 tests.
  17239. 1430.65 s [unordered-containers] insert: OK (0.04s)
  17240. 1430.65 s [unordered-containers] +++ OK, passed 100 tests.
  17241. 1430.65 s [unordered-containers] insertWith: OK (0.04s)
  17242. 1430.65 s [unordered-containers] +++ OK, passed 100 tests.
  17243. 1430.65 s [unordered-containers] delete: OK (0.02s)
  17244. 1430.65 s [unordered-containers] +++ OK, passed 100 tests.
  17245. 1430.65 s [unordered-containers] lookup: OK (0.02s)
  17246. 1430.65 s [unordered-containers] +++ OK, passed 100 tests.
  17247. 1430.65 s [unordered-containers] valid: OK (0.13s)
  17248. 1430.65 s [unordered-containers] +++ OK, passed 100 tests.
  17249. 1430.65 s [unordered-containers] isSubmapOf
  17250. 1430.65 s [unordered-containers] model: OK (0.08s)
  17251. 1430.65 s [unordered-containers] +++ OK, passed 100 tests.
  17252. 1430.65 s [unordered-containers] m ⊆ m: OK (0.08s)
  17253. 1430.65 s [unordered-containers] +++ OK, passed 100 tests.
  17254. 1430.65 s [unordered-containers] m1 ⊆ m1 ∪ m2: OK (0.07s)
  17255. 1430.65 s [unordered-containers] +++ OK, passed 100 tests.
  17256. 1430.65 s [unordered-containers] m1\m2 ⊆ m1: OK (0.07s)
  17257. 1430.65 s [unordered-containers] +++ OK, passed 100 tests.
  17258. 1430.65 s [unordered-containers] m1 ∩ m2 ≠ ∅ ⇒ m1 ⊈ m1\m2 : OK (0.07s)
  17259. 1430.65 s [unordered-containers] +++ OK, passed 100 tests; 157 discarded.
  17260. 1430.65 s [unordered-containers] delete k m ⊆ m: OK (0.07s)
  17261. 1430.65 s [unordered-containers] +++ OK, passed 100 tests; 13 discarded.
  17262. 1430.65 s [unordered-containers] m ⊈ delete k m : OK
  17263. 1430.65 s [unordered-containers] +++ OK, passed 100 tests; 14 discarded.
  17264. 1430.65 s [unordered-containers] k ∉ m ⇒ m ⊆ insert k v m: OK (0.03s)
  17265. 1430.65 s [unordered-containers] +++ OK, passed 100 tests; 12 discarded.
  17266. 1430.65 s [unordered-containers] k ∉ m ⇒ insert k v m ⊈ m: OK (0.02s)
  17267. 1430.65 s [unordered-containers] +++ OK, passed 100 tests; 11 discarded.
  17268. 1430.65 s [unordered-containers] union
  17269. 1430.65 s [unordered-containers] model: OK (0.02s)
  17270. 1430.65 s [unordered-containers] +++ OK, passed 100 tests.
  17271. 1430.65 s [unordered-containers] valid: OK (0.02s)
  17272. 1430.65 s [unordered-containers] +++ OK, passed 100 tests.
  17273. 1430.65 s [unordered-containers] unionWith
  17274. 1430.65 s [unordered-containers] model: OK (0.08s)
  17275. 1430.65 s [unordered-containers] +++ OK, passed 100 tests.
  17276. 1430.65 s [unordered-containers] valid: OK (0.04s)
  17277. 1430.65 s [unordered-containers] +++ OK, passed 100 tests.
  17278. 1430.65 s [unordered-containers] unionWithKey
  17279. 1430.65 s [unordered-containers] model: OK (0.11s)
  17280. 1430.65 s [unordered-containers] +++ OK, passed 100 tests.
  17281. 1430.65 s [unordered-containers] valid: OK (0.06s)
  17282. 1430.66 s [unordered-containers] +++ OK, passed 100 tests.
  17283. 1430.66 s [unordered-containers] unions
  17284. 1430.66 s [unordered-containers] model: OK (1.05s)
  17285. 1430.66 s [unordered-containers] +++ OK, passed 100 tests.
  17286. 1430.66 s [unordered-containers] valid: OK (0.66s)
  17287. 1430.66 s [unordered-containers] +++ OK, passed 100 tests.
  17288. 1430.66 s [unordered-containers] difference
  17289. 1430.66 s [unordered-containers] model: OK (0.05s)
  17290. 1430.66 s [unordered-containers] +++ OK, passed 100 tests.
  17291. 1430.66 s [unordered-containers] valid: OK (0.03s)
  17292. 1430.66 s [unordered-containers] +++ OK, passed 100 tests.
  17293. 1430.66 s [unordered-containers] differenceWith
  17294. 1430.66 s [unordered-containers] model: OK (0.06s)
  17295. 1430.66 s [unordered-containers] +++ OK, passed 100 tests.
  17296. 1430.66 s [unordered-containers] valid: OK (0.03s)
  17297. 1430.66 s [unordered-containers] +++ OK, passed 100 tests.
  17298. 1430.66 s [unordered-containers] intersection
  17299. 1430.66 s [unordered-containers] model: OK (0.02s)
  17300. 1430.66 s [unordered-containers] +++ OK, passed 100 tests.
  17301. 1430.66 s [unordered-containers] valid: OK (0.02s)
  17302. 1430.66 s [unordered-containers] +++ OK, passed 100 tests.
  17303. 1430.66 s [unordered-containers] intersectionWith
  17304. 1430.66 s [unordered-containers] model: OK (0.07s)
  17305. 1430.66 s [unordered-containers] +++ OK, passed 100 tests.
  17306. 1430.66 s [unordered-containers] valid: OK (0.05s)
  17307. 1430.66 s [unordered-containers] +++ OK, passed 100 tests.
  17308. 1430.66 s [unordered-containers] intersectionWithKey
  17309. 1430.66 s [unordered-containers] model: OK (0.19s)
  17310. 1430.66 s [unordered-containers] +++ OK, passed 100 tests.
  17311. 1430.66 s [unordered-containers] valid: OK (0.05s)
  17312. 1430.66 s [unordered-containers] +++ OK, passed 100 tests.
  17313. 1430.66 s [unordered-containers] compose
  17314. 1430.66 s [unordered-containers] valid: OK (0.05s)
  17315. 1430.66 s [unordered-containers] +++ OK, passed 100 tests.
  17316. 1430.66 s [unordered-containers] map
  17317. 1430.66 s [unordered-containers] model: OK (0.10s)
  17318. 1430.66 s [unordered-containers] +++ OK, passed 100 tests.
  17319. 1430.66 s [unordered-containers] valid: OK (0.03s)
  17320. 1430.66 s [unordered-containers] +++ OK, passed 100 tests.
  17321. 1430.66 s [unordered-containers] traverseWithKey
  17322. 1430.66 s [unordered-containers] model: OK (0.20s)
  17323. 1430.66 s [unordered-containers] +++ OK, passed 100 tests.
  17324. 1430.66 s [unordered-containers] valid: OK (0.11s)
  17325. 1430.66 s [unordered-containers] +++ OK, passed 100 tests.
  17326. 1430.66 s [unordered-containers] mapKeys
  17327. 1430.66 s [unordered-containers] model: OK (0.05s)
  17328. 1430.66 s [unordered-containers] +++ OK, passed 100 tests.
  17329. 1430.66 s [unordered-containers] valid: OK (0.37s)
  17330. 1430.66 s [unordered-containers] +++ OK, passed 100 tests.
  17331. 1430.66 s [unordered-containers] foldr: OK (0.06s)
  17332. 1430.66 s [unordered-containers] +++ OK, passed 100 tests.
  17333. 1430.66 s [unordered-containers] foldl: OK (0.05s)
  17334. 1430.66 s [unordered-containers] +++ OK, passed 100 tests.
  17335. 1430.66 s [unordered-containers] foldrWithKey: OK (0.04s)
  17336. 1430.66 s [unordered-containers] +++ OK, passed 100 tests.
  17337. 1430.66 s [unordered-containers] foldlWithKey: OK
  17338. 1430.66 s [unordered-containers] +++ OK, passed 100 tests.
  17339. 1430.66 s [unordered-containers] foldrWithKey': OK (0.04s)
  17340. 1430.66 s [unordered-containers] +++ OK, passed 100 tests.
  17341. 1430.66 s [unordered-containers] foldlWithKey': OK (0.07s)
  17342. 1430.66 s [unordered-containers] +++ OK, passed 100 tests.
  17343. 1430.66 s [unordered-containers] foldl': OK (0.03s)
  17344. 1430.66 s [unordered-containers] +++ OK, passed 100 tests.
  17345. 1430.66 s [unordered-containers] foldr': OK (0.06s)
  17346. 1430.66 s [unordered-containers] +++ OK, passed 100 tests.
  17347. 1430.66 s [unordered-containers] foldMapWithKey: OK (0.07s)
  17348. 1430.66 s [unordered-containers] +++ OK, passed 100 tests.
  17349. 1430.66 s [unordered-containers] filter
  17350. 1430.66 s [unordered-containers] model: OK (0.13s)
  17351. 1430.66 s [unordered-containers] +++ OK, passed 100 tests.
  17352. 1430.66 s [unordered-containers] valid: OK (0.07s)
  17353. 1430.66 s [unordered-containers] +++ OK, passed 100 tests.
  17354. 1430.66 s [unordered-containers] filterWithKey
  17355. 1430.81 s [unordered-containers] model: OK (1.02s)
  17356. 1430.81 s [unordered-containers] +++ OK, passed 100 tests.
  17357. 1430.81 s [unordered-containers] valid: OK (0.51s)
  17358. 1430.81 s [unordered-containers] +++ OK, passed 100 tests.
  17359. 1430.81 s [unordered-containers] mapMaybe
  17360. 1430.81 s [unordered-containers] model: OK (0.13s)
  17361. 1430.81 s [unordered-containers] +++ OK, passed 100 tests.
  17362. 1430.81 s [unordered-containers] valid: OK (0.07s)
  17363. 1430.81 s [unordered-containers] +++ OK, passed 100 tests.
  17364. 1430.81 s [unordered-containers] mapMaybeWithKey
  17365. 1430.83 s [unordered-containers] model: OK (1.00s)
  17366. 1430.83 s [unordered-containers] +++ OK, passed 100 tests.
  17367. 1430.83 s [unordered-containers] valid: OK (0.56s)
  17368. 1430.83 s [unordered-containers] +++ OK, passed 100 tests.
  17369. 1430.83 s [unordered-containers] elems: OK (0.03s)
  17370. 1430.83 s [unordered-containers] +++ OK, passed 100 tests.
  17371. 1430.83 s [unordered-containers] keys: OK (0.02s)
  17372. 1430.83 s [unordered-containers] +++ OK, passed 100 tests.
  17373. 1430.83 s [unordered-containers] fromList
  17374. 1430.83 s [unordered-containers] model: OK (0.01s)
  17375. 1430.83 s [unordered-containers] +++ OK, passed 100 tests.
  17376. 1430.83 s [unordered-containers] valid: OK
  17377. 1430.83 s [unordered-containers] +++ OK, passed 100 tests.
  17378. 1430.83 s [unordered-containers] fromListWith
  17379. 1430.83 s [unordered-containers] model: OK (0.02s)
  17380. 1430.83 s [unordered-containers] +++ OK, passed 100 tests.
  17381. 1430.83 s [unordered-containers] valid: OK (0.02s)
  17382. 1430.83 s [unordered-containers] +++ OK, passed 100 tests.
  17383. 1430.83 s [unordered-containers] fromListWithKey
  17384. 1430.83 s [unordered-containers] model: OK (0.02s)
  17385. 1430.83 s [unordered-containers] +++ OK, passed 100 tests.
  17386. 1430.83 s [unordered-containers] valid: OK (0.10s)
  17387. 1430.83 s [unordered-containers] +++ OK, passed 100 tests.
  17388. 1430.83 s [unordered-containers] toList: OK (0.04s)
  17389. 1430.83 s [unordered-containers] +++ OK, passed 100 tests.
  17390. 1430.83 s [unordered-containers] Data.HashSet
  17391. 1430.83 s [unordered-containers] instances
  17392. 1430.83 s [unordered-containers] Eq
  17393. 1430.83 s [unordered-containers] ==: OK (0.04s)
  17394. 1430.83 s [unordered-containers] +++ OK, passed 100 tests.
  17395. 1430.83 s [unordered-containers] == permutations: OK (0.07s)
  17396. 1430.83 s [unordered-containers] +++ OK, passed 100 tests.
  17397. 1430.83 s [unordered-containers] /=: OK (0.05s)
  17398. 1430.83 s [unordered-containers] +++ OK, passed 100 tests.
  17399. 1430.83 s [unordered-containers] Ord
  17400. 1430.83 s [unordered-containers] compare reflexive: OK (0.01s)
  17401. 1430.83 s [unordered-containers] +++ OK, passed 100 tests.
  17402. 1430.83 s [unordered-containers] compare transitive: OK (0.03s)
  17403. 1430.83 s [unordered-containers] +++ OK, passed 100 tests.
  17404. 1430.83 s [unordered-containers] compare antisymmetric: OK (0.01s)
  17405. 1430.83 s [unordered-containers] +++ OK, passed 100 tests.
  17406. 1430.83 s [unordered-containers] Ord => Eq: OK (0.02s)
  17407. 1430.83 s [unordered-containers] +++ OK, passed 100 tests.
  17408. 1430.83 s [unordered-containers] Read/Show: OK (0.32s)
  17409. 1430.83 s [unordered-containers] +++ OK, passed 100 tests.
  17410. 1430.83 s [unordered-containers] Foldable: OK (0.02s)
  17411. 1430.83 s [unordered-containers] +++ OK, passed 100 tests.
  17412. 1430.83 s [unordered-containers] Hashable: OK
  17413. 1430.83 s [unordered-containers] +++ OK, passed 100 tests.
  17414. 1430.83 s [unordered-containers] size: OK (0.02s)
  17415. 1430.83 s [unordered-containers] +++ OK, passed 100 tests.
  17416. 1430.83 s [unordered-containers] member: OK (0.01s)
  17417. 1430.83 s [unordered-containers] +++ OK, passed 100 tests.
  17418. 1430.83 s [unordered-containers] insert: OK (0.01s)
  17419. 1430.83 s [unordered-containers] +++ OK, passed 100 tests.
  17420. 1430.83 s [unordered-containers] delete: OK (0.01s)
  17421. 1430.83 s [unordered-containers] +++ OK, passed 100 tests.
  17422. 1430.83 s [unordered-containers] union: OK (0.03s)
  17423. 1430.83 s [unordered-containers] +++ OK, passed 100 tests.
  17424. 1430.83 s [unordered-containers] map: OK (0.76s)
  17425. 1430.83 s [unordered-containers] +++ OK, passed 100 tests.
  17426. 1430.83 s [unordered-containers] foldr: OK (0.02s)
  17427. 1430.83 s [unordered-containers] +++ OK, passed 100 tests.
  17428. 1430.83 s [unordered-containers] foldl': OK (0.01s)
  17429. 1430.83 s [unordered-containers] +++ OK, passed 100 tests.
  17430. 1430.83 s [unordered-containers] filter: OK (0.78s)
  17431. 1430.83 s [unordered-containers] +++ OK, passed 100 tests.
  17432. 1430.83 s [unordered-containers] toList: OK (0.03s)
  17433. 1430.83 s [unordered-containers] +++ OK, passed 100 tests.
  17434. 1430.83 s [unordered-containers] Data.HashMap.Internal.List
  17435. 1430.83 s [unordered-containers] isPermutationBy: OK (0.04s)
  17436. 1430.83 s [unordered-containers] +++ OK, passed 100 tests.
  17437. 1430.83 s [unordered-containers] isPermutationBy of different length: OK
  17438. 1430.83 s [unordered-containers] +++ OK, passed 100 tests; 18 discarded.
  17439. 1430.83 s [unordered-containers] pUnorderedCompare: OK (0.05s)
  17440. 1430.83 s [unordered-containers] +++ OK, passed 100 tests.
  17441. 1430.83 s [unordered-containers] modelUnorderedCompare
  17442. 1430.83 s [unordered-containers] reflexive: OK (0.01s)
  17443. 1430.83 s [unordered-containers] +++ OK, passed 100 tests.
  17444. 1430.83 s [unordered-containers] anti-symmetric: OK (0.02s)
  17445. 1430.83 s [unordered-containers] +++ OK, passed 100 tests.
  17446. 1430.83 s [unordered-containers] transitive: OK (0.02s)
  17447. 1430.83 s [unordered-containers] +++ OK, passed 100 tests.
  17448. 1430.83 s [unordered-containers] Regression tests
  17449. 1430.83 s [unordered-containers] issue32: OK
  17450. 1430.83 s [unordered-containers] issue39a: OK
  17451. 1430.83 s [unordered-containers] issue39b: OK (0.01s)
  17452. 1430.83 s [unordered-containers] +++ OK, passed 100 tests.
  17453. 1430.83 s [unordered-containers] issue254 lazy: OK
  17454. 1430.83 s [unordered-containers] issue254 strict: OK
  17455. 1430.83 s [unordered-containers] issue379
  17456. 1430.83 s [unordered-containers] Lazy.unionWith: OK
  17457. 1430.83 s [unordered-containers] union: OK
  17458. 1430.83 s [unordered-containers] Strict.unionWith: OK
  17459. 1430.83 s [unordered-containers] Strict.unionWithKey: OK
  17460. 1430.83 s [unordered-containers] issue381
  17461. 1430.83 s [unordered-containers] mapMaybe: OK
  17462. 1430.83 s [unordered-containers] mapMaybeWithKey: OK
  17463. 1430.83 s [unordered-containers] issue382: OK
  17464. 1430.83 s [unordered-containers] issue383: OK
  17465. 1430.83 s [unordered-containers] issue420: OK
  17466. 1430.83 s [unordered-containers] issue491
  17467. 1430.83 s [unordered-containers] 1: OK
  17468. 1430.83 s [unordered-containers] 2: OK
  17469. 1430.83 s [unordered-containers] 3: OK
  17470. 1430.83 s [unordered-containers] Strictness
  17471. 1430.83 s [unordered-containers] HashMap.Strict
  17472. 1430.83 s [unordered-containers] singleton is key-strict: OK
  17473. 1430.83 s [unordered-containers] +++ OK, passed 100 tests.
  17474. 1430.83 s [unordered-containers] singleton is value-strict: OK
  17475. 1430.83 s [unordered-containers] +++ OK, passed 100 tests.
  17476. 1430.83 s [unordered-containers] member is key-strict: OK (0.01s)
  17477. 1430.83 s [unordered-containers] +++ OK, passed 100 tests.
  17478. 1430.83 s [unordered-containers] lookup is key-strict: OK
  17479. 1430.83 s [unordered-containers] +++ OK, passed 100 tests.
  17480. 1430.83 s [unordered-containers] lookupDefault is key-strict: OK
  17481. 1430.83 s [unordered-containers] +++ OK, passed 100 tests.
  17482. 1430.83 s [unordered-containers] findWithDefault is key-strict: OK
  17483. 1430.83 s [unordered-containers] +++ OK, passed 100 tests.
  17484. 1430.83 s [unordered-containers] ! is key-strict: OK
  17485. 1430.83 s [unordered-containers] +++ OK, passed 100 tests.
  17486. 1430.83 s [unordered-containers] delete is key-strict: OK
  17487. 1430.83 s [unordered-containers] +++ OK, passed 100 tests.
  17488. 1430.83 s [unordered-containers] adjust is key-strict: OK
  17489. 1430.83 s [unordered-containers] +++ OK, passed 100 tests.
  17490. 1430.83 s [unordered-containers] adjust is value-strict: OK
  17491. 1430.83 s [unordered-containers] +++ OK, passed 100 tests.
  17492. 1430.83 s [unordered-containers] insert is key-strict: OK
  17493. 1430.83 s [unordered-containers] +++ OK, passed 100 tests.
  17494. 1430.83 s [unordered-containers] insert is value-strict: OK
  17495. 1430.83 s [unordered-containers] +++ OK, passed 100 tests.
  17496. 1430.83 s [unordered-containers] insertWith is key-strict: OK
  17497. 1430.83 s [unordered-containers] +++ OK, passed 100 tests.
  17498. 1430.83 s [unordered-containers] insertWith is value-strict: OK (0.02s)
  17499. 1430.83 s [unordered-containers] +++ OK, passed 100 tests.
  17500. 1430.83 s [unordered-containers] fromList is key-strict: OK
  17501. 1430.83 s [unordered-containers] +++ OK, passed 100 tests.
  17502. 1430.83 s [unordered-containers] fromList is value-strict: OK
  17503. 1430.83 s [unordered-containers] +++ OK, passed 100 tests.
  17504. 1430.83 s [unordered-containers] fromListWith is key-strict: OK
  17505. 1430.83 s [unordered-containers] +++ OK, passed 100 tests.
  17506. 1430.83 s [unordered-containers] fromListWith is value-strict: OK
  17507. 1430.83 s [unordered-containers] +++ OK, passed 100 tests.
  17508. 1430.83 s [unordered-containers]
  17509. 1430.84 s [unordered-containers] All 257 tests passed (1.62s)
  17510. 1430.85 s [unordered-containers] Test suite unordered-containers-tests: PASS
  17511. 1430.85 s [unordered-containers] Test suite logged to:
  17512. 1430.85 s [unordered-containers] dist/test/unordered-containers-0.2.20.1-unordered-containers-tests.log
  17513. 1430.85 s [unordered-containers] 1 of 1 test suites (1 of 1 test cases) passed.
  17514. 1430.86 s [unordered-containers] Phase: haddockPhase
  17515. 1431.16 s [unordered-containers] Preprocessing library for unordered-containers-0.2.20.1..
  17516. 1431.16 s [unordered-containers] Running Haddock on library for unordered-containers-0.2.20.1..
  17517. 1431.24 s [unordered-containers] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
  17518. 1431.54 s [unordered-containers]
  17519. 1431.55 s [unordered-containers] Data/HashMap/Internal.hs:12:14-23: warning: [GHC-53692] [-Wdeprecated-flags]
  17520. 1431.55 s [unordered-containers] -XTypeInType is deprecated: use -XDataKinds and -XPolyKinds instead
  17521. 1431.55 s [unordered-containers] |
  17522. 1431.55 s [unordered-containers] 12 | {-# LANGUAGE TypeInType #-}
  17523. 1431.55 s [unordered-containers] | ^^^^^^^^^^
  17524. 1431.78 s [unordered-containers] [1 of 9] Compiling Data.HashMap.Internal.Array ( Data/HashMap/Internal/Array.hs, nothing )
  17525. 1432.23 s [unordered-containers]
  17526. 1432.23 s [unordered-containers] Data/HashMap/Internal/Array.hs:83:1-35: warning: [GHC-66111] [-Wunused-imports]
  17527. 1432.23 s [unordered-containers] The import of ‘Control.Applicative’ is redundant
  17528. 1432.23 s [unordered-containers] except perhaps to import instances from ‘Control.Applicative’
  17529. 1432.23 s [unordered-containers] To import instances alone, use: import Control.Applicative()
  17530. 1432.23 s [unordered-containers] |
  17531. 1432.23 s [unordered-containers] 83 | import Control.Applicative (liftA2)
  17532. 1432.23 s [unordered-containers] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  17533. 1432.24 s [unordered-containers] [2 of 9] Compiling Data.HashMap.Internal.List ( Data/HashMap/Internal/List.hs, nothing )
  17534. 1432.26 s [unordered-containers] [3 of 9] Compiling Data.HashMap.Internal ( Data/HashMap/Internal.hs, nothing )
  17535. 1433.35 s [unordered-containers] [4 of 9] Compiling Data.HashMap.Internal.Debug ( Data/HashMap/Internal/Debug.hs, nothing )
  17536. 1433.46 s [unordered-containers] [5 of 9] Compiling Data.HashMap.Internal.Strict ( Data/HashMap/Internal/Strict.hs, nothing )
  17537. 1433.62 s [unordered-containers] [6 of 9] Compiling Data.HashSet.Internal ( Data/HashSet/Internal.hs, nothing )
  17538. 1433.69 s [unordered-containers] [7 of 9] Compiling Data.HashSet ( Data/HashSet.hs, nothing )
  17539. 1433.69 s [unordered-containers] [8 of 9] Compiling Data.HashMap.Strict ( Data/HashMap/Strict.hs, nothing )
  17540. 1433.69 s [unordered-containers] [9 of 9] Compiling Data.HashMap.Lazy ( Data/HashMap/Lazy.hs, nothing )
  17541. 1433.69 s [unordered-containers] Haddock coverage:
  17542. 1433.70 s [unordered-containers] 33% ( 16 / 48) in 'Data.HashMap.Internal.Array'
  17543. 1433.70 s [unordered-containers] Missing documentation for:
  17544. 1433.70 s [unordered-containers] Array (Data/HashMap/Internal/Array.hs:125)
  17545. 1433.70 s [unordered-containers] MArray (Data/HashMap/Internal/Array.hs:157)
  17546. 1433.70 s [unordered-containers] new_ (Data/HashMap/Internal/Array.hs:208)
  17547. 1433.70 s [unordered-containers] singleton (Data/HashMap/Internal/Array.hs:225)
  17548. 1433.70 s [unordered-containers] singletonM (Data/HashMap/Internal/Array.hs:229)
  17549. 1433.70 s [unordered-containers] snoc (Data/HashMap/Internal/Array.hs:233)
  17550. 1433.70 s [unordered-containers] pair (Data/HashMap/Internal/Array.hs:242)
  17551. 1433.70 s [unordered-containers] length (Data/HashMap/Internal/Array.hs:154)
  17552. 1433.70 s [unordered-containers] lengthM (Data/HashMap/Internal/Array.hs:162)
  17553. 1433.70 s [unordered-containers] read (Data/HashMap/Internal/Array.hs:249)
  17554. 1433.70 s [unordered-containers] write (Data/HashMap/Internal/Array.hs:255)
  17555. 1433.70 s [unordered-containers] index (Data/HashMap/Internal/Array.hs:262)
  17556. 1433.70 s [unordered-containers] indexM (Data/HashMap/Internal/Array.hs:274)
  17557. 1433.70 s [unordered-containers] index# (Data/HashMap/Internal/Array.hs:268)
  17558. 1433.70 s [unordered-containers] sameArray1 (Data/HashMap/Internal/Array.hs:140)
  17559. 1433.70 s [unordered-containers] unsafeFreeze (Data/HashMap/Internal/Array.hs:280)
  17560. 1433.70 s [unordered-containers] unsafeThaw (Data/HashMap/Internal/Array.hs:286)
  17561. 1433.70 s [unordered-containers] unsafeSameArray (Data/HashMap/Internal/Array.hs:136)
  17562. 1433.70 s [unordered-containers] run (Data/HashMap/Internal/Array.hs:292)
  17563. 1433.70 s [unordered-containers] cloneM (Data/HashMap/Internal/Array.hs:314)
  17564. 1433.70 s [unordered-containers] foldl (Data/HashMap/Internal/Array.hs:404)
  17565. 1433.70 s [unordered-containers] foldl' (Data/HashMap/Internal/Array.hs:375)
  17566. 1433.70 s [unordered-containers] foldr (Data/HashMap/Internal/Array.hs:394)
  17567. 1433.70 s [unordered-containers] foldr' (Data/HashMap/Internal/Array.hs:385)
  17568. 1433.70 s [unordered-containers] foldMap (Data/HashMap/Internal/Array.hs:417)
  17569. 1433.70 s [unordered-containers] thaw (Data/HashMap/Internal/Array.hs:436)
  17570. 1433.70 s [unordered-containers] map (Data/HashMap/Internal/Array.hs:461)
  17571. 1433.70 s [unordered-containers] traverse (Data/HashMap/Internal/Array.hs:537)
  17572. 1433.70 s [unordered-containers] traverse' (Data/HashMap/Internal/Array.hs:553)
  17573. 1433.70 s [unordered-containers] toList (Data/HashMap/Internal/Array.hs:529)
  17574. 1433.70 s [unordered-containers] fromList (Data/HashMap/Internal/Array.hs:494)
  17575. 1433.70 s [unordered-containers] fromList' (Data/HashMap/Internal/Array.hs:506)
  17576. 1433.70 s [unordered-containers] 25% ( 1 / 4) in 'Data.HashMap.Internal.List'
  17577. 1433.70 s [unordered-containers] Missing documentation for:
  17578. 1433.70 s [unordered-containers] isPermutationBy (Data/HashMap/Internal/List.hs:40)
  17579. 1433.70 s [unordered-containers] deleteBy (Data/HashMap/Internal/List.hs:83)
  17580. 1433.70 s [unordered-containers] unorderedCompare (Data/HashMap/Internal/List.hs:68)
  17581. 1433.70 s [unordered-containers] Warning: 'Leaf' is ambiguous. It is defined
  17582. 1433.70 s [unordered-containers] * at Data/HashMap/Internal.hs:227:7
  17583. 1433.70 s [unordered-containers] * at Data/HashMap/Internal.hs:187:1
  17584. 1433.70 s [unordered-containers] You may be able to disambiguate the identifier by qualifying it or
  17585. 1433.70 s [unordered-containers] by specifying the type/value namespace explicitly.
  17586. 1433.70 s [unordered-containers] Defaulting to the one defined at Data/HashMap/Internal.hs:187:1
  17587. 1433.71 s [unordered-containers] Warning: 'at' is out of scope.
  17588. 1433.71 s [unordered-containers] If you qualify the identifier, haddock can try to link it anyway.
  17589. 1433.72 s [unordered-containers] 88% ( 93 /105) in 'Data.HashMap.Internal'
  17590. 1433.72 s [unordered-containers] Missing documentation for:
  17591. 1433.72 s [unordered-containers] Leaf (Data/HashMap/Internal.hs:187)
  17592. 1433.72 s [unordered-containers] intersectionWithKey# (Data/HashMap/Internal.hs:1859)
  17593. 1433.72 s [unordered-containers] updateOrConcatWithKey (Data/HashMap/Internal.hs:2373)
  17594. 1433.72 s [unordered-containers] equalKeys (Data/HashMap/Internal.hs:513)
  17595. 1433.72 s [unordered-containers] equalKeys1 (Data/HashMap/Internal.hs:497)
  17596. 1433.72 s [unordered-containers] lookupRecordCollision (Data/HashMap/Internal.hs:680)
  17597. 1433.72 s [unordered-containers] LookupRes (Data/HashMap/Internal.hs:659)
  17598. 1433.72 s [unordered-containers] lookupResToMaybe (Data/HashMap/Internal.hs:662)
  17599. 1433.72 s [unordered-containers] insert' (Data/HashMap/Internal.hs:808)
  17600. 1433.72 s [unordered-containers] delete' (Data/HashMap/Internal.hs:1126)
  17601. 1433.72 s [unordered-containers] insertNewKey (Data/HashMap/Internal.hs:850)
  17602. 1433.72 s [unordered-containers] insertKeyExists (Data/HashMap/Internal.hs:885)
  17603. 1433.72 s [unordered-containers] 50% ( 3 / 6) in 'Data.HashMap.Internal.Debug'
  17604. 1433.72 s [unordered-containers] Missing documentation for:
  17605. 1433.72 s [unordered-containers] valid (Data/HashMap/Internal/Debug.hs:98)
  17606. 1433.72 s [unordered-containers] Validity (Data/HashMap/Internal/Debug.hs:43)
  17607. 1433.72 s [unordered-containers] SubHashPath (Data/HashMap/Internal/Debug.hs:75)
  17608. 1433.73 s [unordered-containers] Warning: 'lookup' is out of scope.
  17609. 1433.73 s [unordered-containers] If you qualify the identifier, haddock can try to link it anyway.
  17610. 1433.73 s [unordered-containers] Warning: 'at' is out of scope.
  17611. 1433.73 s [unordered-containers] If you qualify the identifier, haddock can try to link it anyway.
  17612. 1433.73 s [unordered-containers] 100% ( 67 / 67) in 'Data.HashMap.Internal.Strict'
  17613. 1433.73 s [unordered-containers] Warning: 'HashSet' is ambiguous. It is defined
  17614. 1433.73 s [unordered-containers] * at Data/HashSet/Internal.hs:112:21
  17615. 1433.73 s [unordered-containers] * at Data/HashSet/Internal.hs:112:1
  17616. 1433.73 s [unordered-containers] You may be able to disambiguate the identifier by qualifying it or
  17617. 1433.73 s [unordered-containers] by specifying the type/value namespace explicitly.
  17618. 1433.73 s [unordered-containers] Defaulting to the one defined at Data/HashSet/Internal.hs:112:1
  17619. 1433.74 s [unordered-containers] 100% ( 35 / 35) in 'Data.HashSet.Internal'
  17620. 1433.74 s [unordered-containers] Warning: 'HashSet' is ambiguous. It is defined
  17621. 1433.74 s [unordered-containers] * at Data/HashSet/Internal.hs:112:21
  17622. 1433.74 s [unordered-containers] * at Data/HashSet/Internal.hs:112:1
  17623. 1433.74 s [unordered-containers] You may be able to disambiguate the identifier by qualifying it or
  17624. 1433.74 s [unordered-containers] by specifying the type/value namespace explicitly.
  17625. 1433.74 s [unordered-containers] Defaulting to the one defined at Data/HashSet/Internal.hs:112:1
  17626. 1433.74 s [unordered-containers] 100% ( 32 / 32) in 'Data.HashSet'
  17627. 1433.74 s [unordered-containers] 100% ( 69 / 69) in 'Data.HashMap.Strict'
  17628. 1433.74 s [unordered-containers] 100% ( 69 / 69) in 'Data.HashMap.Lazy'
  17629. 1433.99 s [unordered-containers] Warning: Data.HashMap.Internal: could not find link destinations for:
  17630. 1433.99 s [unordered-containers] - Data.HashMap.Internal.D:R:ItemHashMap
  17631. 1434.00 s [unordered-containers] Warning: Data.HashMap.Internal.Strict: could not find link destinations for:
  17632. 1434.00 s [unordered-containers] - Data.HashMap.Internal.D:R:ItemHashMap
  17633. 1434.00 s [unordered-containers] Warning: Data.HashSet.Internal: could not find link destinations for:
  17634. 1434.00 s [unordered-containers] - Data.HashSet.Internal.D:R:ItemHashSet
  17635. 1434.00 s [unordered-containers] Warning: Data.HashSet: could not find link destinations for:
  17636. 1434.00 s [unordered-containers] - Data.HashSet.Internal.D:R:ItemHashSet
  17637. 1434.00 s [unordered-containers] Warning: Data.HashMap.Strict: could not find link destinations for:
  17638. 1434.00 s [unordered-containers] - Data.HashMap.Internal.D:R:ItemHashMap
  17639. 1434.01 s [unordered-containers] Warning: Data.HashMap.Lazy: could not find link destinations for:
  17640. 1434.01 s [unordered-containers] - Data.HashMap.Internal.D:R:ItemHashMap
  17641. 1438.24 s [unordered-containers] Documentation created: dist/doc/html/unordered-containers/,
  17642. 1438.24 s [unordered-containers] dist/doc/html/unordered-containers/unordered-containers.txt
  17643. 1438.30 s [unordered-containers] Preprocessing test suite 'unordered-containers-tests' for unordered-containers-0.2.20.1..
  17644. 1438.31 s [unordered-containers] Phase: installPhase
  17645. 1438.40 s [unordered-containers] Installing library in /nix/store/iri9gy5dns30dwfdqmcjpy61jzl7hc9s-unordered-containers-0.2.20.1/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/unordered-containers-0.2.20.1-Cbq0HfNXyUe8yCdjkMHJvy
  17646. 1438.75 s [unordered-containers] Phase: fixupPhase
  17647. 1438.77 s [unordered-containers] shrinking RPATHs of ELF executables and libraries in /nix/store/iri9gy5dns30dwfdqmcjpy61jzl7hc9s-unordered-containers-0.2.20.1
  17648. 1438.84 s [unordered-containers] shrinking /nix/store/iri9gy5dns30dwfdqmcjpy61jzl7hc9s-unordered-containers-0.2.20.1/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/libHSunordered-containers-0.2.20.1-Cbq0HfNXyUe8yCdjkMHJvy-ghc9.8.4.so
  17649. 1438.84 s [unordered-containers] checking for references to /build/ in /nix/store/iri9gy5dns30dwfdqmcjpy61jzl7hc9s-unordered-containers-0.2.20.1...
  17650. 1438.84 s [unordered-containers] patching script interpreter paths in /nix/store/iri9gy5dns30dwfdqmcjpy61jzl7hc9s-unordered-containers-0.2.20.1
  17651. 1438.84 s [unordered-containers] stripping (with command strip and flags -S -p) in /nix/store/iri9gy5dns30dwfdqmcjpy61jzl7hc9s-unordered-containers-0.2.20.1/lib
  17652. 1438.98 s [unordered-containers] shrinking RPATHs of ELF executables and libraries in /nix/store/p6rbrfq031rssl5q8yvfyabd0l5p5v1n-unordered-containers-0.2.20.1-doc
  17653. 1438.99 s [unordered-containers] checking for references to /build/ in /nix/store/p6rbrfq031rssl5q8yvfyabd0l5p5v1n-unordered-containers-0.2.20.1-doc...
  17654. 1439.01 s [unordered-containers] patching script interpreter paths in /nix/store/p6rbrfq031rssl5q8yvfyabd0l5p5v1n-unordered-containers-0.2.20.1-doc
  17655. 1439.13 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/iri9gy5dns30dwfdqmcjpy61jzl7hc9s-unordered-containers-0.2.20.1 /nix/store/p6rbrfq031rssl5q8yvfyabd0l5p5v1n-unordered-containers-0.2.20.1-doc
  17656. 1439.59 s [post-build-hook] Nothing to push - all store paths are already on Cachix.
  17657. 1439.61 s [post-build-hook] Uploading to the NixCI cache: /nix/store/iri9gy5dns30dwfdqmcjpy61jzl7hc9s-unordered-containers-0.2.20.1 /nix/store/p6rbrfq031rssl5q8yvfyabd0l5p5v1n-unordered-containers-0.2.20.1-doc
  17658. 1439.66 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  17659. 1439.84 s [post-build-hook] copying 1 paths...
  17660. 1439.84 s [post-build-hook] copying path '/nix/store/iri9gy5dns30dwfdqmcjpy61jzl7hc9s-unordered-containers-0.2.20.1' to 'https://cache.nix-ci.com'...
  17661. 1442.67 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  17662. 1442.80 s [post-build-hook] copying 0 paths...
  17663. 1442.84 s Progress: 11 of 19 built, 160 of 160 downloaded from cache
  17664. 1442.90 s Building quickcheck-instances
  17665. 1443.07 s [quickcheck-instances] Phase: setupCompilerEnvironmentPhase
  17666. 1443.08 s [quickcheck-instances] Build with /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4.
  17667. 1443.39 s [quickcheck-instances] Phase: unpackPhase
  17668. 1443.39 s [quickcheck-instances] unpacking source archive /nix/store/ix9xgbag8470whifn4mzlsji4yz8vrc1-quickcheck-instances-0.3.33.tar.gz
  17669. 1443.40 s [quickcheck-instances] source root is quickcheck-instances-0.3.33
  17670. 1443.41 s [quickcheck-instances] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "quickcheck-instances-0.3.33/test/Tests.hs"
  17671. 1443.41 s [quickcheck-instances] Phase: patchPhase
  17672. 1443.42 s [quickcheck-instances] Replace Cabal file with edited version from mirror://hackage/quickcheck-instances-0.3.33/revision/1.cabal.
  17673. 1443.42 s [quickcheck-instances] Phase: compileBuildDriverPhase
  17674. 1443.43 s [quickcheck-instances] setupCompileFlags: -package-db=/build/tmp.14LsRCbhF4/setup-package.conf.d -threaded
  17675. 1443.51 s [quickcheck-instances] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.14LsRCbhF4/Main.o )
  17676. 1443.60 s [quickcheck-instances] [2 of 2] Linking Setup
  17677. 1445.27 s [quickcheck-instances] Phase: updateAutotoolsGnuConfigScriptsPhase
  17678. 1445.28 s [quickcheck-instances] Phase: configurePhase
  17679. 1445.33 s [quickcheck-instances] configureFlags: --verbose --prefix=/nix/store/cz5x71dcrcnnrmissxwqw4mphdfqxrzi-quickcheck-instances-0.3.33 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/33kp2xn41s32yjf1gdr63vd0p7cxly8w-quickcheck-instances-0.3.33-doc/share/doc/quickcheck-instances-0.3.33 --with-gcc=gcc --package-db=/build/tmp.14LsRCbhF4/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/xp8g8298vbm4k9ipj14xf1r4rh899hr4-ncurses-6.5/lib --extra-lib-dirs=/nix/store/wxm6pczq28ppr7ffwclsl6njbzzr48zf-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/3f0hp921ncxr249f5lmspc8silkqr8f7-elfutils-0.194/lib --extra-lib-dirs=/nix/store/km81slwkcc82dbwywl10gpffjb78g6ni-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/fvsl0b39y6ns2z66gfvc2raca3b5wr18-numactl-2.0.18/lib
  17680. 1445.33 s [quickcheck-instances] Using Parsec parser
  17681. 1445.33 s [quickcheck-instances] Configuring quickcheck-instances-0.3.33...
  17682. 1445.77 s [quickcheck-instances] Dependency OneTuple >=0.4.2 && <0.5: using OneTuple-0.4.2
  17683. 1445.77 s [quickcheck-instances] Dependency QuickCheck >=2.14.2 && <2.16.1: using QuickCheck-2.15.0.1
  17684. 1445.77 s [quickcheck-instances] Dependency array >=0.5.3.0 && <0.6: using array-0.5.8.0
  17685. 1445.77 s [quickcheck-instances] Dependency base >=4.12.0.0 && <4.22: using base-4.19.2.0
  17686. 1445.77 s [quickcheck-instances] Dependency bytestring >=0.10.8.2 && <0.13: using bytestring-0.12.1.0
  17687. 1445.77 s [quickcheck-instances] Dependency case-insensitive >=1.2.0.11 && <1.3: using case-insensitive-1.2.1.0
  17688. 1445.77 s [quickcheck-instances] Dependency containers >=0.6.0.1 && <0.8: using containers-0.6.8
  17689. 1445.77 s [quickcheck-instances] Dependency data-fix >=0.3 && <0.4: using data-fix-0.3.4
  17690. 1445.77 s [quickcheck-instances] Dependency hashable >=1.4.4.0 && <1.6: using hashable-1.5.0.0
  17691. 1445.77 s [quickcheck-instances] Dependency integer-logarithms >=1.0.3.1 && <1.1: using
  17692. 1445.77 s [quickcheck-instances] integer-logarithms-1.0.4
  17693. 1445.77 s [quickcheck-instances] Dependency old-time >=1.1.0.0 && <1.2: using old-time-1.1.0.4
  17694. 1445.77 s [quickcheck-instances] Dependency primitive >=0.9.0.0 && <0.10: using primitive-0.9.1.0
  17695. 1445.77 s [quickcheck-instances] Dependency scientific >=0.3.8.0 && <0.4: using scientific-0.3.8.0
  17696. 1445.77 s [quickcheck-instances] Dependency splitmix >=0.1.0.5 && <0.2: using splitmix-0.1.3.1
  17697. 1445.77 s [quickcheck-instances] Dependency strict >=0.5 && <0.6: using strict-0.5.1
  17698. 1445.77 s [quickcheck-instances] Dependency tagged >=0.8.8 && <0.9: using tagged-0.8.9
  17699. 1445.77 s [quickcheck-instances] Dependency text >=1.2.3.0 && <1.3 || >=2.0 && <2.2: using text-2.1.1
  17700. 1445.77 s [quickcheck-instances] Dependency text-short >=0.1.4 && <0.2: using text-short-0.1.6
  17701. 1445.77 s [quickcheck-instances] Dependency these >=1.2.1 && <1.3: using these-1.2.1
  17702. 1445.77 s [quickcheck-instances] Dependency time-compat >=1.9.4 && <1.10: using time-compat-1.9.8
  17703. 1445.77 s [quickcheck-instances] Dependency transformers >=0.5.6.2 && <0.7: using transformers-0.6.1.0
  17704. 1445.77 s [quickcheck-instances] Dependency unordered-containers >=0.2.20 && <0.3: using
  17705. 1445.77 s [quickcheck-instances] unordered-containers-0.2.20.1
  17706. 1445.77 s [quickcheck-instances] Dependency uuid-types >=1.0.6 && <1.1: using uuid-types-1.0.6
  17707. 1445.77 s [quickcheck-instances] Dependency vector >=0.13.2.0 && <0.14: using vector-0.13.2.0
  17708. 1445.77 s [quickcheck-instances] Dependency QuickCheck: using QuickCheck-2.15.0.1
  17709. 1445.77 s [quickcheck-instances] Dependency base: using base-4.19.2.0
  17710. 1445.77 s [quickcheck-instances] Dependency containers: using containers-0.6.8
  17711. 1445.77 s [quickcheck-instances] Dependency primitive: using primitive-0.9.1.0
  17712. 1445.77 s [quickcheck-instances] Dependency quickcheck-instances: using quickcheck-instances-0.3.33
  17713. 1445.77 s [quickcheck-instances] Dependency tagged: using tagged-0.8.9
  17714. 1445.77 s [quickcheck-instances] Dependency uuid-types: using uuid-types-1.0.6
  17715. 1446.10 s [quickcheck-instances] Source component graph:
  17716. 1446.10 s [quickcheck-instances] component lib
  17717. 1446.10 s [quickcheck-instances] component test:self-test dependency lib
  17718. 1446.10 s [quickcheck-instances] Configured component graph:
  17719. 1446.10 s [quickcheck-instances] component quickcheck-instances-0.3.33-FuvSeuaegfABHQpmAYykU5
  17720. 1446.10 s [quickcheck-instances] include OneTuple-0.4.2-2twkKhRPLeXLIafa3e1gFR
  17721. 1446.10 s [quickcheck-instances] include QuickCheck-2.15.0.1-2BdQuHKQVeZ1bFh8DuLq55
  17722. 1446.10 s [quickcheck-instances] include array-0.5.8.0-34d4
  17723. 1446.10 s [quickcheck-instances] include base-4.19.2.0-a4d2
  17724. 1446.10 s [quickcheck-instances] include bytestring-0.12.1.0-2e42
  17725. 1446.10 s [quickcheck-instances] include case-insensitive-1.2.1.0-1eJ8GCD3Bf2Fit5GdtX14I
  17726. 1446.10 s [quickcheck-instances] include containers-0.6.8-1373
  17727. 1446.10 s [quickcheck-instances] include data-fix-0.3.4-69wx8VhswtfHtDDV24Bd60
  17728. 1446.10 s [quickcheck-instances] include hashable-1.5.0.0-ATau4StKspC7PbUmDqJvq1
  17729. 1446.10 s [quickcheck-instances] include integer-logarithms-1.0.4-9xTIq7fiLFg4wArpIOSvx4
  17730. 1446.10 s [quickcheck-instances] include old-time-1.1.0.4-2I5C0NkCOQM5Eg7JcM2HwM
  17731. 1446.10 s [quickcheck-instances] include primitive-0.9.1.0-1Z9etogBUXA7BaLw7HCIll
  17732. 1446.10 s [quickcheck-instances] include scientific-0.3.8.0-2VxeuGyRd827ZcY3deHC9I
  17733. 1446.10 s [quickcheck-instances] include splitmix-0.1.3.1-3qTd6of2FRwGkDAmkUYKCO
  17734. 1446.10 s [quickcheck-instances] include strict-0.5.1-EvRK1i421VG1dCQdyRtK1b
  17735. 1446.10 s [quickcheck-instances] include tagged-0.8.9-3CU7GBcvQ475FDP8UXqJzJ
  17736. 1446.10 s [quickcheck-instances] include text-2.1.1-dac7
  17737. 1446.10 s [quickcheck-instances] include text-short-0.1.6-Hpxa9sY8XXJEhLyzFuNDST
  17738. 1446.10 s [quickcheck-instances] include these-1.2.1-4HbU8b9AhfHKNakGjWTrg
  17739. 1446.10 s [quickcheck-instances] include time-compat-1.9.8-7CgQitk7nY9AfgzuKgTRG4
  17740. 1446.10 s [quickcheck-instances] include transformers-0.6.1.0-8f1d
  17741. 1446.10 s [quickcheck-instances] include unordered-containers-0.2.20.1-Cbq0HfNXyUe8yCdjkMHJvy
  17742. 1446.10 s [quickcheck-instances] include uuid-types-1.0.6-LUA0XHLHpgx6PTF6BwbZ8J
  17743. 1446.10 s [quickcheck-instances] include vector-0.13.2.0-91VeWMtvsgACG7wykjdBs
  17744. 1446.10 s [quickcheck-instances] component quickcheck-instances-0.3.33-D0NKyMnU9okDoY0YriyBxJ-self-test
  17745. 1446.10 s [quickcheck-instances] include QuickCheck-2.15.0.1-2BdQuHKQVeZ1bFh8DuLq55
  17746. 1446.10 s [quickcheck-instances] include base-4.19.2.0-a4d2
  17747. 1446.10 s [quickcheck-instances] include containers-0.6.8-1373
  17748. 1446.10 s [quickcheck-instances] include primitive-0.9.1.0-1Z9etogBUXA7BaLw7HCIll
  17749. 1446.10 s [quickcheck-instances] include quickcheck-instances-0.3.33-FuvSeuaegfABHQpmAYykU5
  17750. 1446.10 s [quickcheck-instances] include tagged-0.8.9-3CU7GBcvQ475FDP8UXqJzJ
  17751. 1446.10 s [quickcheck-instances] include uuid-types-1.0.6-LUA0XHLHpgx6PTF6BwbZ8J
  17752. 1446.10 s [quickcheck-instances] Linked component graph:
  17753. 1446.10 s [quickcheck-instances] unit quickcheck-instances-0.3.33-FuvSeuaegfABHQpmAYykU5
  17754. 1446.10 s [quickcheck-instances] include OneTuple-0.4.2-2twkKhRPLeXLIafa3e1gFR
  17755. 1446.10 s [quickcheck-instances] include QuickCheck-2.15.0.1-2BdQuHKQVeZ1bFh8DuLq55
  17756. 1446.10 s [quickcheck-instances] include array-0.5.8.0-34d4
  17757. 1446.10 s [quickcheck-instances] include base-4.19.2.0-a4d2
  17758. 1446.10 s [quickcheck-instances] include bytestring-0.12.1.0-2e42
  17759. 1446.10 s [quickcheck-instances] include case-insensitive-1.2.1.0-1eJ8GCD3Bf2Fit5GdtX14I
  17760. 1446.10 s [quickcheck-instances] include containers-0.6.8-1373
  17761. 1446.10 s [quickcheck-instances] include data-fix-0.3.4-69wx8VhswtfHtDDV24Bd60
  17762. 1446.10 s [quickcheck-instances] include hashable-1.5.0.0-ATau4StKspC7PbUmDqJvq1
  17763. 1446.10 s [quickcheck-instances] include integer-logarithms-1.0.4-9xTIq7fiLFg4wArpIOSvx4
  17764. 1446.10 s [quickcheck-instances] include old-time-1.1.0.4-2I5C0NkCOQM5Eg7JcM2HwM
  17765. 1446.10 s [quickcheck-instances] include primitive-0.9.1.0-1Z9etogBUXA7BaLw7HCIll
  17766. 1446.10 s [quickcheck-instances] include scientific-0.3.8.0-2VxeuGyRd827ZcY3deHC9I
  17767. 1446.10 s [quickcheck-instances] include splitmix-0.1.3.1-3qTd6of2FRwGkDAmkUYKCO
  17768. 1446.10 s [quickcheck-instances] include strict-0.5.1-EvRK1i421VG1dCQdyRtK1b
  17769. 1446.10 s [quickcheck-instances] include tagged-0.8.9-3CU7GBcvQ475FDP8UXqJzJ
  17770. 1446.10 s [quickcheck-instances] include text-2.1.1-dac7
  17771. 1446.10 s [quickcheck-instances] include text-short-0.1.6-Hpxa9sY8XXJEhLyzFuNDST
  17772. 1446.10 s [quickcheck-instances] include these-1.2.1-4HbU8b9AhfHKNakGjWTrg
  17773. 1446.10 s [quickcheck-instances] include time-compat-1.9.8-7CgQitk7nY9AfgzuKgTRG4
  17774. 1446.10 s [quickcheck-instances] include transformers-0.6.1.0-8f1d
  17775. 1446.10 s [quickcheck-instances] include unordered-containers-0.2.20.1-Cbq0HfNXyUe8yCdjkMHJvy
  17776. 1446.10 s [quickcheck-instances] include uuid-types-1.0.6-LUA0XHLHpgx6PTF6BwbZ8J
  17777. 1446.10 s [quickcheck-instances] include vector-0.13.2.0-91VeWMtvsgACG7wykjdBs
  17778. 1446.10 s [quickcheck-instances] Test.QuickCheck.Instances=quickcheck-instances-0.3.33-FuvSeuaegfABHQpmAYykU5:Test.QuickCheck.Instances,Test.QuickCheck.Instances.Array=quickcheck-instances-0.3.33-FuvSeuaegfABHQpmAYykU5:Test.QuickCheck.Instances.Array,Test.QuickCheck.Instances.Array.Byte=quickcheck-instances-0.3.33-FuvSeuaegfABHQpmAYykU5:Test.QuickCheck.Instances.Array.Byte,Test.QuickCheck.Instances.ByteString=quickcheck-instances-0.3.33-FuvSeuaegfABHQpmAYykU5:Test.QuickCheck.Instances.ByteString,Test.QuickCheck.Instances.CaseInsensitive=quickcheck-instances-0.3.33-FuvSeuaegfABHQpmAYykU5:Test.QuickCheck.Instances.CaseInsensitive,Test.QuickCheck.Instances.Containers=quickcheck-instances-0.3.33-FuvSeuaegfABHQpmAYykU5:Test.QuickCheck.Instances.Containers,Test.QuickCheck.Instances.DataFix=quickcheck-instances-0.3.33-FuvSeuaegfABHQpmAYykU5:Test.QuickCheck.Instances.DataFix,Test.QuickCheck.Instances.Hashable=quickcheck-instances-0.3.33-FuvSeuaegfABHQpmAYykU5:Test.QuickCheck.Instances.Hashable,Test.QuickCheck.Instances.Natural=quickcheck-instances-0.3.33-FuvSeuaegfABHQpmAYykU5:Test.QuickCheck.Instances.Natural,Test.QuickCheck.Instances.OldTime=quickcheck-instances-0.3.33-FuvSeuaegfABHQpmAYykU5:Test.QuickCheck.Instances.OldTime,Test.QuickCheck.Instances.Primitive=quickcheck-instances-0.3.33-FuvSeuaegfABHQpmAYykU5:Test.QuickCheck.Instances.Primitive,Test.QuickCheck.Instances.Scientific=quickcheck-instances-0.3.33-FuvSeuaegfABHQpmAYykU5:Test.QuickCheck.Instances.Scientific,Test.QuickCheck.Instances.Semigroup=quickcheck-instances-0.3.33-FuvSeuaegfABHQpmAYykU5:Test.QuickCheck.Instances.Semigroup,Test.QuickCheck.Instances.Solo=quickcheck-instances-0.3.33-FuvSeuaegfABHQpmAYykU5:Test.QuickCheck.Instances.Solo,Test.QuickCheck.Instances.Strict=quickcheck-instances-0.3.33-FuvSeuaegfABHQpmAYykU5:Test.QuickCheck.Instances.Strict,Test.QuickCheck.Instances.Tagged=quickcheck-instances-0.3.33-FuvSeuaegfABHQpmAYykU5:Test.QuickCheck.Instances.Tagged,Test.QuickCheck.Instances.Text=quickcheck-instances-0.3.33-FuvSeuaegfABHQpmAYykU5:Test.QuickCheck.Instances.Text,Test.QuickCheck.Instances.Text.Short=quickcheck-instances-0.3.33-FuvSeuaegfABHQpmAYykU5:Test.QuickCheck.Instances.Text.Short,Test.QuickCheck.Instances.These=quickcheck-instances-0.3.33-FuvSeuaegfABHQpmAYykU5:Test.QuickCheck.Instances.These,Test.QuickCheck.Instances.Time=quickcheck-instances-0.3.33-FuvSeuaegfABHQpmAYykU5:Test.QuickCheck.Instances.Time,Test.QuickCheck.Instances.Transformer=quickcheck-instances-0.3.33-FuvSeuaegfABHQpmAYykU5:Test.QuickCheck.Instances.Transformer,Test.QuickCheck.Instances.UUID=quickcheck-instances-0.3.33-FuvSeuaegfABHQpmAYykU5:Test.QuickCheck.Instances.UUID,Test.QuickCheck.Instances.UnorderedContainers=quickcheck-instances-0.3.33-FuvSeuaegfABHQpmAYykU5:Test.QuickCheck.Instances.UnorderedContainers,Test.QuickCheck.Instances.Vector=quickcheck-instances-0.3.33-FuvSeuaegfABHQpmAYykU5:Test.QuickCheck.Instances.Vector,Test.QuickCheck.Instances.Void=quickcheck-instances-0.3.33-FuvSeuaegfABHQpmAYykU5:Test.QuickCheck.Instances.Void
  17779. 1446.10 s [quickcheck-instances] unit quickcheck-instances-0.3.33-D0NKyMnU9okDoY0YriyBxJ-self-test
  17780. 1446.10 s [quickcheck-instances] include QuickCheck-2.15.0.1-2BdQuHKQVeZ1bFh8DuLq55
  17781. 1446.10 s [quickcheck-instances] include base-4.19.2.0-a4d2
  17782. 1446.10 s [quickcheck-instances] include containers-0.6.8-1373
  17783. 1446.10 s [quickcheck-instances] include primitive-0.9.1.0-1Z9etogBUXA7BaLw7HCIll
  17784. 1446.10 s [quickcheck-instances] include quickcheck-instances-0.3.33-FuvSeuaegfABHQpmAYykU5
  17785. 1446.10 s [quickcheck-instances] include tagged-0.8.9-3CU7GBcvQ475FDP8UXqJzJ
  17786. 1446.10 s [quickcheck-instances] include uuid-types-1.0.6-LUA0XHLHpgx6PTF6BwbZ8J
  17787. 1446.10 s [quickcheck-instances] Ready component graph:
  17788. 1446.10 s [quickcheck-instances] definite quickcheck-instances-0.3.33-FuvSeuaegfABHQpmAYykU5
  17789. 1446.10 s [quickcheck-instances] depends OneTuple-0.4.2-2twkKhRPLeXLIafa3e1gFR
  17790. 1446.10 s [quickcheck-instances] depends QuickCheck-2.15.0.1-2BdQuHKQVeZ1bFh8DuLq55
  17791. 1446.10 s [quickcheck-instances] depends array-0.5.8.0-34d4
  17792. 1446.10 s [quickcheck-instances] depends base-4.19.2.0-a4d2
  17793. 1446.10 s [quickcheck-instances] depends bytestring-0.12.1.0-2e42
  17794. 1446.10 s [quickcheck-instances] depends case-insensitive-1.2.1.0-1eJ8GCD3Bf2Fit5GdtX14I
  17795. 1446.10 s [quickcheck-instances] depends containers-0.6.8-1373
  17796. 1446.10 s [quickcheck-instances] depends data-fix-0.3.4-69wx8VhswtfHtDDV24Bd60
  17797. 1446.10 s [quickcheck-instances] depends hashable-1.5.0.0-ATau4StKspC7PbUmDqJvq1
  17798. 1446.10 s [quickcheck-instances] depends integer-logarithms-1.0.4-9xTIq7fiLFg4wArpIOSvx4
  17799. 1446.10 s [quickcheck-instances] depends old-time-1.1.0.4-2I5C0NkCOQM5Eg7JcM2HwM
  17800. 1446.10 s [quickcheck-instances] depends primitive-0.9.1.0-1Z9etogBUXA7BaLw7HCIll
  17801. 1446.10 s [quickcheck-instances] depends scientific-0.3.8.0-2VxeuGyRd827ZcY3deHC9I
  17802. 1446.10 s [quickcheck-instances] depends splitmix-0.1.3.1-3qTd6of2FRwGkDAmkUYKCO
  17803. 1446.10 s [quickcheck-instances] depends strict-0.5.1-EvRK1i421VG1dCQdyRtK1b
  17804. 1446.10 s [quickcheck-instances] depends tagged-0.8.9-3CU7GBcvQ475FDP8UXqJzJ
  17805. 1446.10 s [quickcheck-instances] depends text-2.1.1-dac7
  17806. 1446.10 s [quickcheck-instances] depends text-short-0.1.6-Hpxa9sY8XXJEhLyzFuNDST
  17807. 1446.10 s [quickcheck-instances] depends these-1.2.1-4HbU8b9AhfHKNakGjWTrg
  17808. 1446.10 s [quickcheck-instances] depends time-compat-1.9.8-7CgQitk7nY9AfgzuKgTRG4
  17809. 1446.10 s [quickcheck-instances] depends transformers-0.6.1.0-8f1d
  17810. 1446.10 s [quickcheck-instances] depends unordered-containers-0.2.20.1-Cbq0HfNXyUe8yCdjkMHJvy
  17811. 1446.10 s [quickcheck-instances] depends uuid-types-1.0.6-LUA0XHLHpgx6PTF6BwbZ8J
  17812. 1446.10 s [quickcheck-instances] depends vector-0.13.2.0-91VeWMtvsgACG7wykjdBs
  17813. 1446.10 s [quickcheck-instances] definite quickcheck-instances-0.3.33-D0NKyMnU9okDoY0YriyBxJ-self-test
  17814. 1446.10 s [quickcheck-instances] depends QuickCheck-2.15.0.1-2BdQuHKQVeZ1bFh8DuLq55
  17815. 1446.10 s [quickcheck-instances] depends base-4.19.2.0-a4d2
  17816. 1446.10 s [quickcheck-instances] depends containers-0.6.8-1373
  17817. 1446.11 s [quickcheck-instances] depends primitive-0.9.1.0-1Z9etogBUXA7BaLw7HCIll
  17818. 1446.11 s [quickcheck-instances] depends quickcheck-instances-0.3.33-FuvSeuaegfABHQpmAYykU5
  17819. 1446.11 s [quickcheck-instances] depends tagged-0.8.9-3CU7GBcvQ475FDP8UXqJzJ
  17820. 1446.12 s [quickcheck-instances] depends uuid-types-1.0.6-LUA0XHLHpgx6PTF6BwbZ8J
  17821. 1446.12 s [quickcheck-instances] Using Cabal-3.10.3.0 compiled by ghc-9.8
  17822. 1446.12 s [quickcheck-instances] Using compiler: ghc-9.8.4
  17823. 1446.12 s [quickcheck-instances] Using install prefix:
  17824. 1446.12 s [quickcheck-instances] /nix/store/cz5x71dcrcnnrmissxwqw4mphdfqxrzi-quickcheck-instances-0.3.33
  17825. 1446.12 s [quickcheck-instances] Executables installed in:
  17826. 1446.12 s [quickcheck-instances] /nix/store/cz5x71dcrcnnrmissxwqw4mphdfqxrzi-quickcheck-instances-0.3.33/bin
  17827. 1446.12 s [quickcheck-instances] Libraries installed in:
  17828. 1446.12 s [quickcheck-instances] /nix/store/cz5x71dcrcnnrmissxwqw4mphdfqxrzi-quickcheck-instances-0.3.33/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/quickcheck-instances-0.3.33-FuvSeuaegfABHQpmAYykU5
  17829. 1446.12 s [quickcheck-instances] Dynamic Libraries installed in:
  17830. 1446.12 s [quickcheck-instances] /nix/store/cz5x71dcrcnnrmissxwqw4mphdfqxrzi-quickcheck-instances-0.3.33/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4
  17831. 1446.12 s [quickcheck-instances] Private executables installed in:
  17832. 1446.12 s [quickcheck-instances] /nix/store/cz5x71dcrcnnrmissxwqw4mphdfqxrzi-quickcheck-instances-0.3.33/libexec/x86_64-linux-ghc-9.8.4/quickcheck-instances-0.3.33
  17833. 1446.12 s [quickcheck-instances] Data files installed in:
  17834. 1446.12 s [quickcheck-instances] /nix/store/cz5x71dcrcnnrmissxwqw4mphdfqxrzi-quickcheck-instances-0.3.33/share/x86_64-linux-ghc-9.8.4/quickcheck-instances-0.3.33
  17835. 1446.12 s [quickcheck-instances] Documentation installed in:
  17836. 1446.12 s [quickcheck-instances] /nix/store/33kp2xn41s32yjf1gdr63vd0p7cxly8w-quickcheck-instances-0.3.33-doc/share/doc/quickcheck-instances-0.3.33
  17837. 1446.12 s [quickcheck-instances] Configuration files installed in:
  17838. 1446.12 s [quickcheck-instances] /nix/store/cz5x71dcrcnnrmissxwqw4mphdfqxrzi-quickcheck-instances-0.3.33/etc
  17839. 1446.12 s [quickcheck-instances] No alex found
  17840. 1446.12 s [quickcheck-instances] Using ar found on system at:
  17841. 1446.12 s [quickcheck-instances] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
  17842. 1446.12 s [quickcheck-instances] No c2hs found
  17843. 1446.12 s [quickcheck-instances] No cpphs found
  17844. 1446.12 s [quickcheck-instances] No doctest found
  17845. 1446.12 s [quickcheck-instances] Using gcc version 14.3.0 given by user at:
  17846. 1446.12 s [quickcheck-instances] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
  17847. 1446.12 s [quickcheck-instances] Using ghc version 9.8.4 found on system at:
  17848. 1446.12 s [quickcheck-instances] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/ghc
  17849. 1446.12 s [quickcheck-instances] Using ghc-pkg version 9.8.4 found on system at:
  17850. 1446.12 s [quickcheck-instances] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/ghc-pkg-9.8.4
  17851. 1446.12 s [quickcheck-instances] No ghcjs found
  17852. 1446.12 s [quickcheck-instances] No ghcjs-pkg found
  17853. 1446.12 s [quickcheck-instances] No greencard found
  17854. 1446.12 s [quickcheck-instances] Using haddock version 2.30.0 found on system at:
  17855. 1446.12 s [quickcheck-instances] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/haddock-ghc-9.8.4
  17856. 1446.12 s [quickcheck-instances] No happy found
  17857. 1446.12 s [quickcheck-instances] Using haskell-suite found on system at: haskell-suite-dummy-location
  17858. 1446.12 s [quickcheck-instances] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  17859. 1446.12 s [quickcheck-instances] No hmake found
  17860. 1446.12 s [quickcheck-instances] Using hpc version 0.69 found on system at:
  17861. 1446.12 s [quickcheck-instances] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/hpc-ghc-9.8.4
  17862. 1446.12 s [quickcheck-instances] Using hsc2hs version 0.68.10 found on system at:
  17863. 1446.12 s [quickcheck-instances] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/hsc2hs-ghc-9.8.4
  17864. 1446.12 s [quickcheck-instances] Using hscolour version 1.25 found on system at:
  17865. 1446.12 s [quickcheck-instances] /nix/store/vl14mqkz7z183r6sq9qz932j3pix6v5c-hscolour-1.25/bin/HsColour
  17866. 1446.12 s [quickcheck-instances] No jhc found
  17867. 1446.12 s [quickcheck-instances] Using ld found on system at:
  17868. 1446.12 s [quickcheck-instances] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ld.gold
  17869. 1446.12 s [quickcheck-instances] No pkg-config found
  17870. 1446.12 s [quickcheck-instances] Using runghc version 9.8.4 found on system at:
  17871. 1446.12 s [quickcheck-instances] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/runghc-9.8.4
  17872. 1446.12 s [quickcheck-instances] Using strip version 2.44 found on system at:
  17873. 1446.12 s [quickcheck-instances] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
  17874. 1446.12 s [quickcheck-instances] Using tar found on system at:
  17875. 1446.12 s [quickcheck-instances] /nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
  17876. 1446.12 s [quickcheck-instances] No uhc found
  17877. 1446.26 s [quickcheck-instances] Phase: buildPhase
  17878. 1446.33 s [quickcheck-instances] Preprocessing library for quickcheck-instances-0.3.33..
  17879. 1446.34 s [quickcheck-instances] Building library for quickcheck-instances-0.3.33..
  17880. 1446.47 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 )
  17881. 1446.53 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 )
  17882. 1446.54 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 )
  17883. 1446.93 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 )
  17884. 1447.18 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 )
  17885. 1447.25 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 )
  17886. 1447.25 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 )
  17887. 1447.25 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 )
  17888. 1447.25 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 )
  17889. 1447.25 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 )
  17890. 1447.25 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 )
  17891. 1447.25 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 )
  17892. 1447.25 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 )
  17893. 1447.25 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 )
  17894. 1447.25 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 )
  17895. 1447.41 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 )
  17896. 1447.41 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 )
  17897. 1447.41 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 )
  17898. 1447.41 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 )
  17899. 1447.41 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 )
  17900. 1447.99 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 )
  17901. 1447.99 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 )
  17902. 1447.99 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 )
  17903. 1447.99 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 )
  17904. 1447.99 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 )
  17905. 1447.99 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 )
  17906. 1448.37 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 )
  17907. 1448.53 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 )
  17908. 1448.98 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 )
  17909. 1449.38 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 )
  17910. 1449.38 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 )
  17911. 1449.38 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 )
  17912. 1449.39 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 )
  17913. 1449.48 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 )
  17914. 1449.48 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 )
  17915. 1449.48 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 )
  17916. 1449.48 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 )
  17917. 1449.61 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 )
  17918. 1449.61 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 )
  17919. 1449.61 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 )
  17920. 1449.61 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 )
  17921. 1449.61 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 )
  17922. 1449.62 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 )
  17923. 1449.62 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 )
  17924. 1449.62 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 )
  17925. 1449.75 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 )
  17926. 1450.25 s [quickcheck-instances] [21 of 26] Compiling Test.QuickCheck.Instances.Transformer ( src/Test/QuickCheck/Instances/Transformer.hs, dist/build/Test/QuickCheck/Instances/Transformer.p_o )
  17927. 1450.25 s [quickcheck-instances] [22 of 26] Compiling Test.QuickCheck.Instances.UUID ( src/Test/QuickCheck/Instances/UUID.hs, dist/build/Test/QuickCheck/Instances/UUID.p_o )
  17928. 1450.25 s [quickcheck-instances] [23 of 26] Compiling Test.QuickCheck.Instances.UnorderedContainers ( src/Test/QuickCheck/Instances/UnorderedContainers.hs, dist/build/Test/QuickCheck/Instances/UnorderedContainers.p_o )
  17929. 1450.25 s [quickcheck-instances] [24 of 26] Compiling Test.QuickCheck.Instances.Vector ( src/Test/QuickCheck/Instances/Vector.hs, dist/build/Test/QuickCheck/Instances/Vector.p_o )
  17930. 1450.25 s [quickcheck-instances] [25 of 26] Compiling Test.QuickCheck.Instances.Void ( src/Test/QuickCheck/Instances/Void.hs, dist/build/Test/QuickCheck/Instances/Void.p_o )
  17931. 1450.25 s [quickcheck-instances] [26 of 26] Compiling Test.QuickCheck.Instances ( src/Test/QuickCheck/Instances.hs, dist/build/Test/QuickCheck/Instances.p_o )
  17932. 1452.62 s [quickcheck-instances] Preprocessing test suite 'self-test' for quickcheck-instances-0.3.33..
  17933. 1452.62 s [quickcheck-instances] Building test suite 'self-test' for quickcheck-instances-0.3.33..
  17934. 1452.71 s [quickcheck-instances] [1 of 1] Compiling Main ( test/Tests.hs, dist/build/self-test/self-test-tmp/Main.o )
  17935. 1453.16 s [quickcheck-instances] [2 of 2] Linking dist/build/self-test/self-test
  17936. 1453.92 s [quickcheck-instances] Phase: checkPhase
  17937. 1453.95 s [quickcheck-instances] Running 1 test suites...
  17938. 1453.95 s [quickcheck-instances] Test suite self-test: RUNNING...
  17939. 1453.96 s [quickcheck-instances] +++ OK, passed 100 tests.
  17940. 1453.96 s [quickcheck-instances] +++ OK, passed 100 tests.
  17941. 1453.96 s [quickcheck-instances] +++ OK, passed 100 tests.
  17942. 1453.96 s [quickcheck-instances] +++ OK, passed 100 tests.
  17943. 1453.96 s [quickcheck-instances] +++ OK, passed 100 tests.
  17944. 1453.96 s [quickcheck-instances] Test suite self-test: PASS
  17945. 1453.96 s [quickcheck-instances] Test suite logged to: dist/test/quickcheck-instances-0.3.33-self-test.log
  17946. 1453.96 s [quickcheck-instances] 1 of 1 test suites (1 of 1 test cases) passed.
  17947. 1453.97 s [quickcheck-instances] Phase: haddockPhase
  17948. 1454.11 s [quickcheck-instances] Preprocessing library for quickcheck-instances-0.3.33..
  17949. 1454.13 s [quickcheck-instances] Running Haddock on library for quickcheck-instances-0.3.33..
  17950. 1454.13 s [quickcheck-instances] Warning: The documentation for the following packages are not installed. No
  17951. 1454.13 s [quickcheck-instances] links will be generated to these packages: vector-0.13.2.0
  17952. 1454.21 s [quickcheck-instances] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
  17953. 1454.44 s [quickcheck-instances] [ 1 of 26] Compiling Test.QuickCheck.Instances.Containers ( src/Test/QuickCheck/Instances/Containers.hs, nothing )
  17954. 1454.46 s [quickcheck-instances] [ 2 of 26] Compiling Test.QuickCheck.Instances.CustomPrelude ( src/Test/QuickCheck/Instances/CustomPrelude.hs, nothing )
  17955. 1454.49 s [quickcheck-instances] [ 3 of 26] Compiling Test.QuickCheck.Instances.CaseInsensitive ( src/Test/QuickCheck/Instances/CaseInsensitive.hs, nothing )
  17956. 1454.66 s [quickcheck-instances] [ 4 of 26] Compiling Test.QuickCheck.Instances.ByteString ( src/Test/QuickCheck/Instances/ByteString.hs, nothing )
  17957. 1454.68 s [quickcheck-instances] [ 5 of 26] Compiling Test.QuickCheck.Instances.Array ( src/Test/QuickCheck/Instances/Array.hs, nothing )
  17958. 1454.70 s [quickcheck-instances] [ 6 of 26] Compiling Test.QuickCheck.Instances.DataFix ( src/Test/QuickCheck/Instances/DataFix.hs, nothing )
  17959. 1454.71 s [quickcheck-instances] [ 7 of 26] Compiling Test.QuickCheck.Instances.Hashable ( src/Test/QuickCheck/Instances/Hashable.hs, nothing )
  17960. 1454.72 s [quickcheck-instances] [ 8 of 26] Compiling Test.QuickCheck.Instances.Natural ( src/Test/QuickCheck/Instances/Natural.hs, nothing )
  17961. 1454.73 s [quickcheck-instances] [ 9 of 26] Compiling Test.QuickCheck.Instances.OldTime ( src/Test/QuickCheck/Instances/OldTime.hs, nothing )
  17962. 1454.75 s [quickcheck-instances] [10 of 26] Compiling Test.QuickCheck.Instances.Primitive ( src/Test/QuickCheck/Instances/Primitive.hs, nothing )
  17963. 1454.80 s [quickcheck-instances] [11 of 26] Compiling Test.QuickCheck.Instances.Array.Byte ( src/Test/QuickCheck/Instances/Array/Byte.hs, nothing )
  17964. 1454.80 s [quickcheck-instances] [12 of 26] Compiling Test.QuickCheck.Instances.Scientific ( src/Test/QuickCheck/Instances/Scientific.hs, nothing )
  17965. 1454.81 s [quickcheck-instances] [13 of 26] Compiling Test.QuickCheck.Instances.Semigroup ( src/Test/QuickCheck/Instances/Semigroup.hs, nothing )
  17966. 1454.91 s [quickcheck-instances] [14 of 26] Compiling Test.QuickCheck.Instances.Solo ( src/Test/QuickCheck/Instances/Solo.hs, nothing )
  17967. 1454.92 s [quickcheck-instances] [15 of 26] Compiling Test.QuickCheck.Instances.Strict ( src/Test/QuickCheck/Instances/Strict.hs, nothing )
  17968. 1454.95 s [quickcheck-instances] [16 of 26] Compiling Test.QuickCheck.Instances.Tagged ( src/Test/QuickCheck/Instances/Tagged.hs, nothing )
  17969. 1454.98 s [quickcheck-instances] [17 of 26] Compiling Test.QuickCheck.Instances.Text ( src/Test/QuickCheck/Instances/Text.hs, nothing )
  17970. 1454.98 s [quickcheck-instances] [18 of 26] Compiling Test.QuickCheck.Instances.Text.Short ( src/Test/QuickCheck/Instances/Text/Short.hs, nothing )
  17971. 1454.99 s [quickcheck-instances] [19 of 26] Compiling Test.QuickCheck.Instances.These ( src/Test/QuickCheck/Instances/These.hs, nothing )
  17972. 1455.00 s [quickcheck-instances] [20 of 26] Compiling Test.QuickCheck.Instances.Time ( src/Test/QuickCheck/Instances/Time.hs, nothing )
  17973. 1455.07 s [quickcheck-instances] [21 of 26] Compiling Test.QuickCheck.Instances.Transformer ( src/Test/QuickCheck/Instances/Transformer.hs, nothing )
  17974. 1455.09 s [quickcheck-instances] [22 of 26] Compiling Test.QuickCheck.Instances.UUID ( src/Test/QuickCheck/Instances/UUID.hs, nothing )
  17975. 1455.10 s [quickcheck-instances] [23 of 26] Compiling Test.QuickCheck.Instances.UnorderedContainers ( src/Test/QuickCheck/Instances/UnorderedContainers.hs, nothing )
  17976. 1455.12 s [quickcheck-instances] [24 of 26] Compiling Test.QuickCheck.Instances.Vector ( src/Test/QuickCheck/Instances/Vector.hs, nothing )
  17977. 1455.28 s [quickcheck-instances] [25 of 26] Compiling Test.QuickCheck.Instances.Void ( src/Test/QuickCheck/Instances/Void.hs, nothing )
  17978. 1455.29 s [quickcheck-instances] [26 of 26] Compiling Test.QuickCheck.Instances ( src/Test/QuickCheck/Instances.hs, nothing )
  17979. 1455.29 s [quickcheck-instances] Haddock coverage:
  17980. 1455.29 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Containers'
  17981. 1455.29 s [quickcheck-instances] Missing documentation for:
  17982. 1455.29 s [quickcheck-instances] Module header
  17983. 1455.30 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.CaseInsensitive'
  17984. 1455.30 s [quickcheck-instances] Missing documentation for:
  17985. 1455.30 s [quickcheck-instances] Module header
  17986. 1455.30 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.ByteString'
  17987. 1455.30 s [quickcheck-instances] Missing documentation for:
  17988. 1455.30 s [quickcheck-instances] Module header
  17989. 1455.30 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Array'
  17990. 1455.30 s [quickcheck-instances] Missing documentation for:
  17991. 1455.30 s [quickcheck-instances] Module header
  17992. 1455.30 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.DataFix'
  17993. 1455.30 s [quickcheck-instances] Missing documentation for:
  17994. 1455.30 s [quickcheck-instances] Module header
  17995. 1455.30 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Hashable'
  17996. 1455.30 s [quickcheck-instances] Missing documentation for:
  17997. 1455.30 s [quickcheck-instances] Module header
  17998. 1455.30 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Natural'
  17999. 1455.30 s [quickcheck-instances] Missing documentation for:
  18000. 1455.30 s [quickcheck-instances] Module header
  18001. 1455.30 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.OldTime'
  18002. 1455.30 s [quickcheck-instances] Missing documentation for:
  18003. 1455.30 s [quickcheck-instances] Module header
  18004. 1455.30 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Primitive'
  18005. 1455.30 s [quickcheck-instances] Missing documentation for:
  18006. 1455.30 s [quickcheck-instances] Module header
  18007. 1455.30 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Array.Byte'
  18008. 1455.30 s [quickcheck-instances] Missing documentation for:
  18009. 1455.30 s [quickcheck-instances] Module header
  18010. 1455.30 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Scientific'
  18011. 1455.30 s [quickcheck-instances] Missing documentation for:
  18012. 1455.30 s [quickcheck-instances] Module header
  18013. 1455.30 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Semigroup'
  18014. 1455.30 s [quickcheck-instances] Missing documentation for:
  18015. 1455.30 s [quickcheck-instances] Module header
  18016. 1455.30 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Solo'
  18017. 1455.30 s [quickcheck-instances] Missing documentation for:
  18018. 1455.30 s [quickcheck-instances] Module header
  18019. 1455.31 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Strict'
  18020. 1455.31 s [quickcheck-instances] Missing documentation for:
  18021. 1455.31 s [quickcheck-instances] Module header
  18022. 1455.31 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Tagged'
  18023. 1455.31 s [quickcheck-instances] Missing documentation for:
  18024. 1455.31 s [quickcheck-instances] Module header
  18025. 1455.31 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Text'
  18026. 1455.31 s [quickcheck-instances] Missing documentation for:
  18027. 1455.31 s [quickcheck-instances] Module header
  18028. 1455.31 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Text.Short'
  18029. 1455.31 s [quickcheck-instances] Missing documentation for:
  18030. 1455.31 s [quickcheck-instances] Module header
  18031. 1455.31 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.These'
  18032. 1455.31 s [quickcheck-instances] Missing documentation for:
  18033. 1455.31 s [quickcheck-instances] Module header
  18034. 1455.31 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Time'
  18035. 1455.31 s [quickcheck-instances] Missing documentation for:
  18036. 1455.31 s [quickcheck-instances] Module header
  18037. 1455.31 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Transformer'
  18038. 1455.31 s [quickcheck-instances] Missing documentation for:
  18039. 1455.31 s [quickcheck-instances] Module header
  18040. 1455.31 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.UUID'
  18041. 1455.31 s [quickcheck-instances] Missing documentation for:
  18042. 1455.31 s [quickcheck-instances] Module header
  18043. 1455.31 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.UnorderedContainers'
  18044. 1455.31 s [quickcheck-instances] Missing documentation for:
  18045. 1455.31 s [quickcheck-instances] Module header
  18046. 1455.31 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Vector'
  18047. 1455.31 s [quickcheck-instances] Missing documentation for:
  18048. 1455.31 s [quickcheck-instances] Module header
  18049. 1455.31 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Void'
  18050. 1455.31 s [quickcheck-instances] Missing documentation for:
  18051. 1455.31 s [quickcheck-instances] Module header
  18052. 1455.31 s [quickcheck-instances] 100% ( 1 / 1) in 'Test.QuickCheck.Instances'
  18053. 1456.05 s [quickcheck-instances] Warning: Test.QuickCheck.Instances.Vector: could not find link destinations for:
  18054. 1456.05 s [quickcheck-instances] - Data.Vector.Vector
  18055. 1456.05 s [quickcheck-instances] - Data.Vector.Primitive.Vector
  18056. 1456.05 s [quickcheck-instances] - Data.Vector.Storable.Vector
  18057. 1456.05 s [quickcheck-instances] - Data.Vector.Unboxed.Base.Unbox
  18058. 1456.05 s [quickcheck-instances] - Data.Vector.Unboxed.Base.Vector
  18059. 1456.05 s [quickcheck-instances] - Data.Vector.Strict.Vector
  18060. 1460.76 s [quickcheck-instances] Documentation created: dist/doc/html/quickcheck-instances/,
  18061. 1460.76 s [quickcheck-instances] dist/doc/html/quickcheck-instances/quickcheck-instances.txt
  18062. 1460.84 s [quickcheck-instances] Preprocessing test suite 'self-test' for quickcheck-instances-0.3.33..
  18063. 1460.84 s [quickcheck-instances] Phase: installPhase
  18064. 1460.91 s [quickcheck-instances] Installing library in /nix/store/cz5x71dcrcnnrmissxwqw4mphdfqxrzi-quickcheck-instances-0.3.33/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/quickcheck-instances-0.3.33-FuvSeuaegfABHQpmAYykU5
  18065. 1461.42 s [quickcheck-instances] Phase: fixupPhase
  18066. 1461.45 s [quickcheck-instances] shrinking RPATHs of ELF executables and libraries in /nix/store/cz5x71dcrcnnrmissxwqw4mphdfqxrzi-quickcheck-instances-0.3.33
  18067. 1461.45 s [quickcheck-instances] shrinking /nix/store/cz5x71dcrcnnrmissxwqw4mphdfqxrzi-quickcheck-instances-0.3.33/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/libHSquickcheck-instances-0.3.33-FuvSeuaegfABHQpmAYykU5-ghc9.8.4.so
  18068. 1461.47 s [quickcheck-instances] checking for references to /build/ in /nix/store/cz5x71dcrcnnrmissxwqw4mphdfqxrzi-quickcheck-instances-0.3.33...
  18069. 1461.51 s [quickcheck-instances] patching script interpreter paths in /nix/store/cz5x71dcrcnnrmissxwqw4mphdfqxrzi-quickcheck-instances-0.3.33
  18070. 1461.52 s [quickcheck-instances] stripping (with command strip and flags -S -p) in /nix/store/cz5x71dcrcnnrmissxwqw4mphdfqxrzi-quickcheck-instances-0.3.33/lib
  18071. 1461.65 s [quickcheck-instances] shrinking RPATHs of ELF executables and libraries in /nix/store/33kp2xn41s32yjf1gdr63vd0p7cxly8w-quickcheck-instances-0.3.33-doc
  18072. 1461.66 s [quickcheck-instances] checking for references to /build/ in /nix/store/33kp2xn41s32yjf1gdr63vd0p7cxly8w-quickcheck-instances-0.3.33-doc...
  18073. 1461.70 s [quickcheck-instances] patching script interpreter paths in /nix/store/33kp2xn41s32yjf1gdr63vd0p7cxly8w-quickcheck-instances-0.3.33-doc
  18074. 1461.84 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/33kp2xn41s32yjf1gdr63vd0p7cxly8w-quickcheck-instances-0.3.33-doc /nix/store/cz5x71dcrcnnrmissxwqw4mphdfqxrzi-quickcheck-instances-0.3.33
  18075. 1462.34 s [post-build-hook] Nothing to push - all store paths are already on Cachix.
  18076. 1462.36 s [post-build-hook] Uploading to the NixCI cache: /nix/store/33kp2xn41s32yjf1gdr63vd0p7cxly8w-quickcheck-instances-0.3.33-doc /nix/store/cz5x71dcrcnnrmissxwqw4mphdfqxrzi-quickcheck-instances-0.3.33
  18077. 1462.41 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  18078. 1462.52 s [post-build-hook] copying 1 paths...
  18079. 1462.52 s [post-build-hook] copying path '/nix/store/cz5x71dcrcnnrmissxwqw4mphdfqxrzi-quickcheck-instances-0.3.33' to 'https://cache.nix-ci.com'...
  18080. 1464.07 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  18081. 1464.25 s [post-build-hook] copying 0 paths...
  18082. 1464.27 s Progress: 12 of 19 built, 160 of 160 downloaded from cache
  18083. 1464.31 s Building extra
  18084. 1464.45 s [extra] Phase: setupCompilerEnvironmentPhase
  18085. 1464.45 s [extra] Build with /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4.
  18086. 1464.67 s [extra] Phase: unpackPhase
  18087. 1464.67 s [extra] unpacking source archive /nix/store/3nprda3kdyhj8zkmv2z32yi6n0gwc966-extra-1.8.1.tar.gz
  18088. 1464.68 s [extra] source root is extra-1.8.1
  18089. 1464.69 s [extra] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "extra-1.8.1/test/TestUtil.hs"
  18090. 1464.69 s [extra] Phase: patchPhase
  18091. 1464.70 s [extra] Phase: compileBuildDriverPhase
  18092. 1464.71 s [extra] setupCompileFlags: -package-db=/build/tmp.ACACpZHl9b/setup-package.conf.d -threaded
  18093. 1464.75 s [extra] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.ACACpZHl9b/Main.o )
  18094. 1464.82 s [extra] [2 of 2] Linking Setup
  18095. 1466.10 s [extra] Phase: updateAutotoolsGnuConfigScriptsPhase
  18096. 1466.15 s [extra] Phase: configurePhase
  18097. 1466.15 s [extra] configureFlags: --verbose --prefix=/nix/store/irwq1wrpxjvkjsg6d6xjnxpdkaw5qpwc-extra-1.8.1 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/iy9fydmmljmkxvxmdqdg966r0isvhhq2-extra-1.8.1-doc/share/doc/extra-1.8.1 --with-gcc=gcc --package-db=/build/tmp.ACACpZHl9b/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/xp8g8298vbm4k9ipj14xf1r4rh899hr4-ncurses-6.5/lib --extra-lib-dirs=/nix/store/wxm6pczq28ppr7ffwclsl6njbzzr48zf-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/3f0hp921ncxr249f5lmspc8silkqr8f7-elfutils-0.194/lib --extra-lib-dirs=/nix/store/km81slwkcc82dbwywl10gpffjb78g6ni-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/fvsl0b39y6ns2z66gfvc2raca3b5wr18-numactl-2.0.18/lib
  18098. 1466.15 s [extra] Using Parsec parser
  18099. 1466.15 s [extra] Configuring extra-1.8.1...
  18100. 1466.48 s [extra] Dependency base >=4.9 && <5: using base-4.19.2.0
  18101. 1466.48 s [extra] Dependency clock >=0.7: using clock-0.8.4
  18102. 1466.48 s [extra] Dependency directory: using directory-1.3.8.5
  18103. 1466.48 s [extra] Dependency filepath: using filepath-1.4.301.0
  18104. 1466.48 s [extra] Dependency process: using process-1.6.25.0
  18105. 1466.48 s [extra] Dependency time: using time-1.12.2
  18106. 1466.48 s [extra] Dependency unix: using unix-2.8.6.0
  18107. 1466.48 s [extra] Dependency QuickCheck >=2.10: using QuickCheck-2.15.0.1
  18108. 1466.48 s [extra] Dependency base >=4 && <5: using base-4.19.2.0
  18109. 1466.48 s [extra] Dependency directory: using directory-1.3.8.5
  18110. 1466.48 s [extra] Dependency extra: using extra-1.8.1
  18111. 1466.48 s [extra] Dependency filepath: using filepath-1.4.301.0
  18112. 1466.48 s [extra] Dependency quickcheck-instances >=0.3.17: using quickcheck-instances-0.3.33
  18113. 1466.48 s [extra] Dependency unix: using unix-2.8.6.0
  18114. 1466.79 s [extra] Source component graph:
  18115. 1466.79 s [extra] component lib
  18116. 1466.79 s [extra] component test:extra-test dependency lib
  18117. 1466.79 s [extra] Configured component graph:
  18118. 1466.79 s [extra] component extra-1.8.1-CYkQRzu1AaDDqBLND76rc2
  18119. 1466.79 s [extra] include base-4.19.2.0-a4d2
  18120. 1466.79 s [extra] include clock-0.8.4-CxAW1ib2HH22y55Hvl745i
  18121. 1466.79 s [extra] include directory-1.3.8.5-fa66
  18122. 1466.79 s [extra] include filepath-1.4.301.0-5f33
  18123. 1466.79 s [extra] include process-1.6.25.0-8170
  18124. 1466.79 s [extra] include time-1.12.2-84c3
  18125. 1466.79 s [extra] include unix-2.8.6.0-c2f8
  18126. 1466.79 s [extra] component extra-1.8.1-BvqFbED1W6q2244RvTLt4F-extra-test
  18127. 1466.79 s [extra] include QuickCheck-2.15.0.1-2BdQuHKQVeZ1bFh8DuLq55
  18128. 1466.79 s [extra] include base-4.19.2.0-a4d2
  18129. 1466.79 s [extra] include directory-1.3.8.5-fa66
  18130. 1466.79 s [extra] include extra-1.8.1-CYkQRzu1AaDDqBLND76rc2
  18131. 1466.79 s [extra] include filepath-1.4.301.0-5f33
  18132. 1466.79 s [extra] include quickcheck-instances-0.3.33-FuvSeuaegfABHQpmAYykU5
  18133. 1466.79 s [extra] include unix-2.8.6.0-c2f8
  18134. 1466.79 s [extra] Linked component graph:
  18135. 1466.79 s [extra] unit extra-1.8.1-CYkQRzu1AaDDqBLND76rc2
  18136. 1466.79 s [extra] include base-4.19.2.0-a4d2
  18137. 1466.79 s [extra] include clock-0.8.4-CxAW1ib2HH22y55Hvl745i
  18138. 1466.79 s [extra] include directory-1.3.8.5-fa66
  18139. 1466.79 s [extra] include filepath-1.4.301.0-5f33
  18140. 1466.79 s [extra] include process-1.6.25.0-8170
  18141. 1466.79 s [extra] include time-1.12.2-84c3
  18142. 1466.79 s [extra] include unix-2.8.6.0-c2f8
  18143. 1466.79 s [extra] Control.Concurrent.Extra=extra-1.8.1-CYkQRzu1AaDDqBLND76rc2:Control.Concurrent.Extra,Control.Exception.Extra=extra-1.8.1-CYkQRzu1AaDDqBLND76rc2:Control.Exception.Extra,Control.Monad.Extra=extra-1.8.1-CYkQRzu1AaDDqBLND76rc2:Control.Monad.Extra,Data.Either.Extra=extra-1.8.1-CYkQRzu1AaDDqBLND76rc2:Data.Either.Extra,Data.Foldable.Extra=extra-1.8.1-CYkQRzu1AaDDqBLND76rc2:Data.Foldable.Extra,Data.IORef.Extra=extra-1.8.1-CYkQRzu1AaDDqBLND76rc2:Data.IORef.Extra,Data.List.Extra=extra-1.8.1-CYkQRzu1AaDDqBLND76rc2:Data.List.Extra,Data.List.NonEmpty.Extra=extra-1.8.1-CYkQRzu1AaDDqBLND76rc2:Data.List.NonEmpty.Extra,Data.Monoid.Extra=extra-1.8.1-CYkQRzu1AaDDqBLND76rc2:Data.Monoid.Extra,Data.Tuple.Extra=extra-1.8.1-CYkQRzu1AaDDqBLND76rc2:Data.Tuple.Extra,Data.Typeable.Extra=extra-1.8.1-CYkQRzu1AaDDqBLND76rc2:Data.Typeable.Extra,Data.Version.Extra=extra-1.8.1-CYkQRzu1AaDDqBLND76rc2:Data.Version.Extra,Extra=extra-1.8.1-CYkQRzu1AaDDqBLND76rc2:Extra,Numeric.Extra=extra-1.8.1-CYkQRzu1AaDDqBLND76rc2:Numeric.Extra,System.Directory.Extra=extra-1.8.1-CYkQRzu1AaDDqBLND76rc2:System.Directory.Extra,System.Environment.Extra=extra-1.8.1-CYkQRzu1AaDDqBLND76rc2:System.Environment.Extra,System.IO.Extra=extra-1.8.1-CYkQRzu1AaDDqBLND76rc2:System.IO.Extra,System.Info.Extra=extra-1.8.1-CYkQRzu1AaDDqBLND76rc2:System.Info.Extra,System.Process.Extra=extra-1.8.1-CYkQRzu1AaDDqBLND76rc2:System.Process.Extra,System.Time.Extra=extra-1.8.1-CYkQRzu1AaDDqBLND76rc2:System.Time.Extra,Text.Read.Extra=extra-1.8.1-CYkQRzu1AaDDqBLND76rc2:Text.Read.Extra
  18144. 1466.79 s [extra] unit extra-1.8.1-BvqFbED1W6q2244RvTLt4F-extra-test
  18145. 1466.79 s [extra] include QuickCheck-2.15.0.1-2BdQuHKQVeZ1bFh8DuLq55
  18146. 1466.79 s [extra] include base-4.19.2.0-a4d2
  18147. 1466.79 s [extra] include directory-1.3.8.5-fa66
  18148. 1466.79 s [extra] include extra-1.8.1-CYkQRzu1AaDDqBLND76rc2
  18149. 1466.79 s [extra] include filepath-1.4.301.0-5f33
  18150. 1466.79 s [extra] include quickcheck-instances-0.3.33-FuvSeuaegfABHQpmAYykU5
  18151. 1466.79 s [extra] include unix-2.8.6.0-c2f8
  18152. 1466.79 s [extra] Ready component graph:
  18153. 1466.79 s [extra] definite extra-1.8.1-CYkQRzu1AaDDqBLND76rc2
  18154. 1466.79 s [extra] depends base-4.19.2.0-a4d2
  18155. 1466.79 s [extra] depends clock-0.8.4-CxAW1ib2HH22y55Hvl745i
  18156. 1466.79 s [extra] depends directory-1.3.8.5-fa66
  18157. 1466.79 s [extra] depends filepath-1.4.301.0-5f33
  18158. 1466.79 s [extra] depends process-1.6.25.0-8170
  18159. 1466.79 s [extra] depends time-1.12.2-84c3
  18160. 1466.79 s [extra] depends unix-2.8.6.0-c2f8
  18161. 1466.79 s [extra] definite extra-1.8.1-BvqFbED1W6q2244RvTLt4F-extra-test
  18162. 1466.79 s [extra] depends QuickCheck-2.15.0.1-2BdQuHKQVeZ1bFh8DuLq55
  18163. 1466.79 s [extra] depends base-4.19.2.0-a4d2
  18164. 1466.79 s [extra] depends directory-1.3.8.5-fa66
  18165. 1466.79 s [extra] depends extra-1.8.1-CYkQRzu1AaDDqBLND76rc2
  18166. 1466.79 s [extra] depends filepath-1.4.301.0-5f33
  18167. 1466.79 s [extra] depends quickcheck-instances-0.3.33-FuvSeuaegfABHQpmAYykU5
  18168. 1466.79 s [extra] depends unix-2.8.6.0-c2f8
  18169. 1466.79 s [extra] Using Cabal-3.10.3.0 compiled by ghc-9.8
  18170. 1466.79 s [extra] Using compiler: ghc-9.8.4
  18171. 1466.79 s [extra] Using install prefix: /nix/store/irwq1wrpxjvkjsg6d6xjnxpdkaw5qpwc-extra-1.8.1
  18172. 1466.79 s [extra] Executables installed in:
  18173. 1466.79 s [extra] /nix/store/irwq1wrpxjvkjsg6d6xjnxpdkaw5qpwc-extra-1.8.1/bin
  18174. 1466.79 s [extra] Libraries installed in:
  18175. 1466.79 s [extra] /nix/store/irwq1wrpxjvkjsg6d6xjnxpdkaw5qpwc-extra-1.8.1/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/extra-1.8.1-CYkQRzu1AaDDqBLND76rc2
  18176. 1466.79 s [extra] Dynamic Libraries installed in:
  18177. 1466.79 s [extra] /nix/store/irwq1wrpxjvkjsg6d6xjnxpdkaw5qpwc-extra-1.8.1/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4
  18178. 1466.79 s [extra] Private executables installed in:
  18179. 1466.79 s [extra] /nix/store/irwq1wrpxjvkjsg6d6xjnxpdkaw5qpwc-extra-1.8.1/libexec/x86_64-linux-ghc-9.8.4/extra-1.8.1
  18180. 1466.79 s [extra] Data files installed in:
  18181. 1466.79 s [extra] /nix/store/irwq1wrpxjvkjsg6d6xjnxpdkaw5qpwc-extra-1.8.1/share/x86_64-linux-ghc-9.8.4/extra-1.8.1
  18182. 1466.79 s [extra] Documentation installed in:
  18183. 1466.79 s [extra] /nix/store/iy9fydmmljmkxvxmdqdg966r0isvhhq2-extra-1.8.1-doc/share/doc/extra-1.8.1
  18184. 1466.79 s [extra] Configuration files installed in:
  18185. 1466.79 s [extra] /nix/store/irwq1wrpxjvkjsg6d6xjnxpdkaw5qpwc-extra-1.8.1/etc
  18186. 1466.79 s [extra] No alex found
  18187. 1466.79 s [extra] Using ar found on system at:
  18188. 1466.79 s [extra] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
  18189. 1466.79 s [extra] No c2hs found
  18190. 1466.79 s [extra] No cpphs found
  18191. 1466.79 s [extra] No doctest found
  18192. 1466.79 s [extra] Using gcc version 14.3.0 given by user at:
  18193. 1466.79 s [extra] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
  18194. 1466.79 s [extra] Using ghc version 9.8.4 found on system at:
  18195. 1466.79 s [extra] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/ghc
  18196. 1466.79 s [extra] Using ghc-pkg version 9.8.4 found on system at:
  18197. 1466.79 s [extra] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/ghc-pkg-9.8.4
  18198. 1466.79 s [extra] No ghcjs found
  18199. 1466.79 s [extra] No ghcjs-pkg found
  18200. 1466.79 s [extra] No greencard found
  18201. 1466.79 s [extra] Using haddock version 2.30.0 found on system at:
  18202. 1466.79 s [extra] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/haddock-ghc-9.8.4
  18203. 1466.79 s [extra] No happy found
  18204. 1466.79 s [extra] Using haskell-suite found on system at: haskell-suite-dummy-location
  18205. 1466.79 s [extra] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  18206. 1466.79 s [extra] No hmake found
  18207. 1466.79 s [extra] Using hpc version 0.69 found on system at:
  18208. 1466.79 s [extra] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/hpc-ghc-9.8.4
  18209. 1466.79 s [extra] Using hsc2hs version 0.68.10 found on system at:
  18210. 1466.79 s [extra] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/hsc2hs-ghc-9.8.4
  18211. 1466.79 s [extra] Using hscolour version 1.25 found on system at:
  18212. 1466.79 s [extra] /nix/store/vl14mqkz7z183r6sq9qz932j3pix6v5c-hscolour-1.25/bin/HsColour
  18213. 1466.79 s [extra] No jhc found
  18214. 1466.79 s [extra] Using ld found on system at:
  18215. 1466.79 s [extra] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ld.gold
  18216. 1466.79 s [extra] No pkg-config found
  18217. 1466.79 s [extra] Using runghc version 9.8.4 found on system at:
  18218. 1466.79 s [extra] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/runghc-9.8.4
  18219. 1466.79 s [extra] Using strip version 2.44 found on system at:
  18220. 1466.79 s [extra] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
  18221. 1466.79 s [extra] Using tar found on system at:
  18222. 1466.79 s [extra] /nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
  18223. 1466.79 s [extra] No uhc found
  18224. 1466.93 s [extra] Phase: buildPhase
  18225. 1466.99 s [extra] Preprocessing library for extra-1.8.1..
  18226. 1467.00 s [extra] Building library for extra-1.8.1..
  18227. 1467.29 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 )
  18228. 1467.38 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 )
  18229. 1467.38 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 )
  18230. 1467.39 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 )
  18231. 1467.39 s [extra] [ 5 of 22] Compiling Numeric.Extra ( src/Numeric/Extra.hs, dist/build/Numeric/Extra.o, dist/build/Numeric/Extra.dyn_o )
  18232. 1467.39 s [extra] [ 6 of 22] Compiling Partial ( src/Partial.hs, dist/build/Partial.o, dist/build/Partial.dyn_o )
  18233. 1467.39 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 )
  18234. 1468.41 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 )
  18235. 1468.82 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 )
  18236. 1468.95 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 )
  18237. 1468.95 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 )
  18238. 1468.95 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 )
  18239. 1469.26 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 )
  18240. 1469.50 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 )
  18241. 1469.61 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 )
  18242. 1469.61 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 )
  18243. 1469.61 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 )
  18244. 1469.79 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 )
  18245. 1469.79 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 )
  18246. 1469.84 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 )
  18247. 1469.84 s [extra] [21 of 22] Compiling Extra ( src/Extra.hs, dist/build/Extra.o, dist/build/Extra.dyn_o )
  18248. 1469.91 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 )
  18249. 1470.67 s [extra] [ 1 of 22] Compiling Data.IORef.Extra ( src/Data/IORef/Extra.hs, dist/build/Data/IORef/Extra.p_o )
  18250. 1470.94 s [extra] [ 2 of 22] Compiling Data.Monoid.Extra ( src/Data/Monoid/Extra.hs, dist/build/Data/Monoid/Extra.p_o )
  18251. 1470.94 s [extra] [ 3 of 22] Compiling Data.Tuple.Extra ( src/Data/Tuple/Extra.hs, dist/build/Data/Tuple/Extra.p_o )
  18252. 1471.05 s [extra] [ 4 of 22] Compiling Data.Typeable.Extra ( src/Data/Typeable/Extra.hs, dist/build/Data/Typeable/Extra.p_o )
  18253. 1471.05 s [extra] [ 5 of 22] Compiling Numeric.Extra ( src/Numeric/Extra.hs, dist/build/Numeric/Extra.p_o )
  18254. 1471.05 s [extra] [ 6 of 22] Compiling Partial ( src/Partial.hs, dist/build/Partial.p_o )
  18255. 1471.05 s [extra] [ 7 of 22] Compiling Data.List.Extra ( src/Data/List/Extra.hs, dist/build/Data/List/Extra.p_o )
  18256. 1472.32 s [extra] [ 8 of 22] Compiling Data.Version.Extra ( src/Data/Version/Extra.hs, dist/build/Data/Version/Extra.p_o )
  18257. 1472.53 s [extra] [ 9 of 22] Compiling Data.List.NonEmpty.Extra ( src/Data/List/NonEmpty/Extra.hs, dist/build/Data/List/NonEmpty/Extra.p_o )
  18258. 1472.58 s [extra] [10 of 22] Compiling Data.Either.Extra ( src/Data/Either/Extra.hs, dist/build/Data/Either/Extra.p_o )
  18259. 1472.58 s [extra] [11 of 22] Compiling Control.Exception.Extra ( src/Control/Exception/Extra.hs, dist/build/Control/Exception/Extra.p_o )
  18260. 1472.58 s [extra] [12 of 22] Compiling Control.Monad.Extra ( src/Control/Monad/Extra.hs, dist/build/Control/Monad/Extra.p_o )
  18261. 1472.91 s [extra] [13 of 22] Compiling Data.Foldable.Extra ( src/Data/Foldable/Extra.hs, dist/build/Data/Foldable/Extra.p_o )
  18262. 1473.17 s [extra] [14 of 22] Compiling Control.Concurrent.Extra ( src/Control/Concurrent/Extra.hs, dist/build/Control/Concurrent/Extra.p_o )
  18263. 1473.30 s [extra] [15 of 22] Compiling System.Directory.Extra ( src/System/Directory/Extra.hs, dist/build/System/Directory/Extra.p_o )
  18264. 1473.30 s [extra] [16 of 22] Compiling System.Environment.Extra ( src/System/Environment/Extra.hs, dist/build/System/Environment/Extra.p_o )
  18265. 1473.30 s [extra] [17 of 22] Compiling System.IO.Extra ( src/System/IO/Extra.hs, dist/build/System/IO/Extra.p_o )
  18266. 1473.55 s [extra] [18 of 22] Compiling System.Info.Extra ( src/System/Info/Extra.hs, dist/build/System/Info/Extra.p_o )
  18267. 1473.55 s [extra] [19 of 22] Compiling System.Process.Extra ( src/System/Process/Extra.hs, dist/build/System/Process/Extra.p_o )
  18268. 1473.71 s [extra] [20 of 22] Compiling System.Time.Extra ( src/System/Time/Extra.hs, dist/build/System/Time/Extra.p_o )
  18269. 1473.71 s [extra] [21 of 22] Compiling Extra ( src/Extra.hs, dist/build/Extra.p_o )
  18270. 1473.90 s [extra] [22 of 22] Compiling Text.Read.Extra ( src/Text/Read/Extra.hs, dist/build/Text/Read/Extra.p_o )
  18271. 1475.66 s [extra] Preprocessing test suite 'extra-test' for extra-1.8.1..
  18272. 1475.66 s [extra] Building test suite 'extra-test' for extra-1.8.1..
  18273. 1475.73 s [extra] [1 of 4] Compiling TestUtil ( test/TestUtil.hs, dist/build/extra-test/extra-test-tmp/TestUtil.o )
  18274. 1476.11 s [extra] [2 of 4] Compiling TestGen ( test/TestGen.hs, dist/build/extra-test/extra-test-tmp/TestGen.o )
  18275. 1478.11 s [extra] [3 of 4] Compiling TestCustom ( test/TestCustom.hs, dist/build/extra-test/extra-test-tmp/TestCustom.o )
  18276. 1478.15 s [extra] [4 of 4] Compiling Test ( test/Test.hs, dist/build/extra-test/extra-test-tmp/Test.o )
  18277. 1478.45 s [extra] [5 of 5] Linking dist/build/extra-test/extra-test
  18278. 1479.42 s [extra] Phase: checkPhase
  18279. 1479.46 s [extra] Running 1 test suites...
  18280. 1479.47 s [extra] Test suite extra-test: RUNNING...
  18281. 1479.47 s [extra] withTempFile
  18282. 1479.48 s [extra] +++ OK, passed 100 tests.
  18283. 1479.48 s [extra] captureOutput
  18284. 1479.48 s [extra] +++ OK, passed 100 tests.
  18285. 1479.48 s [extra] \(x :: IO Int) -> void (once x) == pure ()
  18286. 1479.51 s [extra] +++ OK, passed 100 tests.
  18287. 1479.51 s [extra] \(x :: IO Int) -> join (once x) == x
  18288. 1479.54 s [extra] +++ OK, passed 100 tests.
  18289. 1479.54 s [extra] \(x :: IO Int) -> (do y <- once x; y; y) == x
  18290. 1479.57 s [extra] +++ OK, passed 100 tests.
  18291. 1479.57 s [extra] \(x :: IO Int) -> (do y <- once x; y ||| y) == x
  18292. 1479.63 s [extra] +++ OK, passed 100 tests.
  18293. 1479.63 s [extra] \(x :: IO Int) -> join (onceFork x) == x
  18294. 1479.69 s [extra] +++ OK, passed 100 tests.
  18295. 1479.69 s [extra] \(x :: IO Int) -> (do a <- onceFork x; a; a) == x
  18296. 1479.72 s [extra] +++ OK, passed 100 tests.
  18297. 1479.72 s [extra] stringException "test" == pure "test"
  18298. 1479.72 s [extra] +++ OK, passed 100 tests.
  18299. 1479.72 s [extra] stringException ("test" ++ undefined) == pure "test<Exception>"
  18300. 1479.72 s [extra] +++ OK, passed 100 tests.
  18301. 1479.72 s [extra] stringException ("test" ++ undefined ++ "hello") == pure "test<Exception>"
  18302. 1479.72 s [extra] +++ OK, passed 100 tests.
  18303. 1479.72 s [extra] stringException ['t','e','s','t',undefined] == pure "test<Exception>"
  18304. 1479.72 s [extra] +++ OK, passed 100 tests.
  18305. 1479.72 s [extra] ignore (print 1) == print 1
  18306. 1479.72 s [extra] +++ OK, passed 100 tests.
  18307. 1479.72 s [extra] ignore (fail "die") == pure ()
  18308. 1479.72 s [extra] +++ OK, passed 100 tests.
  18309. 1479.72 s [extra] catch (errorIO "Hello") (\(ErrorCall x) -> pure x) == pure "Hello"
  18310. 1479.72 s [extra] +++ OK, passed 100 tests.
  18311. 1479.72 s [extra] seq (errorIO "foo") (print 1) == print 1
  18312. 1479.72 s [extra] +++ OK, passed 100 tests.
  18313. 1479.72 s [extra] catch (assertIO True >> pure 1) (\(x :: AssertionFailed) -> pure 2) == pure 1
  18314. 1479.72 s [extra] +++ OK, passed 100 tests.
  18315. 1479.72 s [extra] seq (assertIO False) (print 1) == print 1
  18316. 1479.72 s [extra] +++ OK, passed 100 tests.
  18317. 1479.72 s [extra] retry 1 (print "x") == print "x"
  18318. 1479.72 s [extra] +++ OK, passed 100 tests.
  18319. 1479.72 s [extra] retry 3 (fail "die") == fail "die"
  18320. 1479.72 s [extra] +++ OK, passed 100 tests.
  18321. 1479.72 s [extra] whenJust Nothing print == pure ()
  18322. 1479.72 s [extra] +++ OK, passed 100 tests.
  18323. 1479.72 s [extra] whenJust (Just 1) print == print 1
  18324. 1479.72 s [extra] +++ OK, passed 100 tests.
  18325. 1479.72 s [extra] pureIf @Maybe True 5 == Just 5
  18326. 1479.72 s [extra] +++ OK, passed 100 tests.
  18327. 1479.72 s [extra] pureIf @Maybe False 5 == Nothing
  18328. 1479.72 s [extra] +++ OK, passed 100 tests.
  18329. 1479.72 s [extra] pureIf @[] True 5 == [5]
  18330. 1479.72 s [extra] +++ OK, passed 100 tests.
  18331. 1479.72 s [extra] pureIf @[] False 5 == []
  18332. 1479.72 s [extra] +++ OK, passed 100 tests.
  18333. 1479.73 s [extra] whenMaybe True (print 1) == fmap Just (print 1)
  18334. 1479.73 s [extra] +++ OK, passed 100 tests.
  18335. 1479.73 s [extra] whenMaybe False (print 1) == pure Nothing
  18336. 1479.73 s [extra] +++ OK, passed 100 tests.
  18337. 1479.73 s [extra] \(x :: Maybe ()) -> unit x == x
  18338. 1479.73 s [extra] +++ OK, passed 100 tests.
  18339. 1479.73 s [extra] guarded even 2 == [2]
  18340. 1479.73 s [extra] +++ OK, passed 100 tests.
  18341. 1479.73 s [extra] guarded odd 2 == Nothing
  18342. 1479.73 s [extra] +++ OK, passed 100 tests.
  18343. 1479.73 s [extra] guarded (not.null) "My Name" == Just "My Name"
  18344. 1479.73 s [extra] +++ OK, passed 100 tests.
  18345. 1479.73 s [extra] guardedA (return . even) 42 == Just [42]
  18346. 1479.73 s [extra] +++ OK, passed 100 tests.
  18347. 1479.73 s [extra] guardedA (return . odd) 42 == Just []
  18348. 1479.73 s [extra] +++ OK, passed 100 tests.
  18349. 1479.73 s [extra] guardedA (const Nothing) 42 == (Nothing :: Maybe [Int])
  18350. 1479.73 s [extra] +++ OK, passed 100 tests.
  18351. 1479.73 s [extra] fold1M (\x y -> Just x) [] == undefined
  18352. 1479.73 s [extra] +++ OK, passed 100 tests.
  18353. 1479.73 s [extra] fold1M (\x y -> Just $ x + y) [1, 2, 3] == Just 6
  18354. 1479.73 s [extra] +++ OK, passed 100 tests.
  18355. 1479.73 s [extra] partitionM (Just . even) [1,2,3] == Just ([2], [1,3])
  18356. 1479.73 s [extra] +++ OK, passed 100 tests.
  18357. 1479.73 s [extra] partitionM (const Nothing) [1,2,3] == Nothing
  18358. 1479.73 s [extra] +++ OK, passed 100 tests.
  18359. 1479.73 s [extra] loop (\x -> if x < 10 then Left $ x * 2 else Right $ show x) 1 == "16"
  18360. 1479.73 s [extra] +++ OK, passed 100 tests.
  18361. 1479.73 s [extra] Just True ||^ undefined == Just True
  18362. 1479.73 s [extra] +++ OK, passed 100 tests.
  18363. 1479.74 s [extra] Just False ||^ Just True == Just True
  18364. 1479.74 s [extra] +++ OK, passed 100 tests.
  18365. 1479.74 s [extra] Just False ||^ Just False == Just False
  18366. 1479.74 s [extra] +++ OK, passed 100 tests.
  18367. 1479.74 s [extra] Just False &&^ undefined == Just False
  18368. 1479.74 s [extra] +++ OK, passed 100 tests.
  18369. 1479.74 s [extra] Just True &&^ Just True == Just True
  18370. 1479.74 s [extra] +++ OK, passed 100 tests.
  18371. 1479.74 s [extra] Just True &&^ Just False == Just False
  18372. 1479.74 s [extra] +++ OK, passed 100 tests.
  18373. 1479.74 s [extra] anyM Just [False,True ,undefined] == Just True
  18374. 1479.74 s [extra] +++ OK, passed 100 tests.
  18375. 1479.74 s [extra] anyM Just [False,False,undefined] == undefined
  18376. 1479.74 s [extra] +++ OK, passed 100 tests.
  18377. 1479.74 s [extra] \(f :: Int -> Maybe Bool) xs -> anyM f xs == orM (map f xs)
  18378. 1479.74 s [extra] +++ OK, passed 100 tests.
  18379. 1479.74 s [extra] allM Just [True,False,undefined] == Just False
  18380. 1479.74 s [extra] +++ OK, passed 100 tests.
  18381. 1479.74 s [extra] allM Just [True,True ,undefined] == undefined
  18382. 1479.74 s [extra] +++ OK, passed 100 tests.
  18383. 1479.74 s [extra] \(f :: Int -> Maybe Bool) xs -> anyM f xs == orM (map f xs)
  18384. 1479.74 s [extra] +++ OK, passed 100 tests.
  18385. 1479.74 s [extra] orM [Just False,Just True ,undefined] == Just True
  18386. 1479.74 s [extra] +++ OK, passed 100 tests.
  18387. 1479.74 s [extra] orM [Just False,Just False,undefined] == undefined
  18388. 1479.74 s [extra] +++ OK, passed 100 tests.
  18389. 1479.74 s [extra] \xs -> Just (or xs) == orM (map Just xs)
  18390. 1479.74 s [extra] +++ OK, passed 100 tests.
  18391. 1479.74 s [extra] andM [Just True,Just False,undefined] == Just False
  18392. 1479.74 s [extra] +++ OK, passed 100 tests.
  18393. 1479.74 s [extra] andM [Just True,Just True ,undefined] == undefined
  18394. 1479.74 s [extra] +++ OK, passed 100 tests.
  18395. 1479.74 s [extra] \xs -> Just (and xs) == andM (map Just xs)
  18396. 1479.74 s [extra] +++ OK, passed 100 tests.
  18397. 1479.74 s [extra] findM (Just . isUpper) "teST" == Just (Just 'S')
  18398. 1479.74 s [extra] +++ OK, passed 100 tests.
  18399. 1479.74 s [extra] findM (Just . isUpper) "test" == Just Nothing
  18400. 1479.74 s [extra] +++ OK, passed 100 tests.
  18401. 1479.74 s [extra] findM (Just . const True) ["x",undefined] == Just (Just "x")
  18402. 1479.74 s [extra] +++ OK, passed 100 tests.
  18403. 1479.74 s [extra] fromLeft 1 (Left 3) == 3
  18404. 1479.74 s [extra] +++ OK, passed 100 tests.
  18405. 1479.74 s [extra] fromLeft 1 (Right "foo") == 1
  18406. 1479.74 s [extra] +++ OK, passed 100 tests.
  18407. 1479.74 s [extra] fromRight 1 (Right 3) == 3
  18408. 1479.74 s [extra] +++ OK, passed 100 tests.
  18409. 1479.74 s [extra] fromRight 1 (Left "foo") == 1
  18410. 1479.74 s [extra] +++ OK, passed 100 tests.
  18411. 1479.74 s [extra] \x -> fromLeft' (Left x) == x
  18412. 1479.74 s [extra] +++ OK, passed 100 tests.
  18413. 1479.74 s [extra] \x -> fromLeft' (Right x) == undefined
  18414. 1479.74 s [extra] +++ OK, passed 100 tests.
  18415. 1479.74 s [extra] \x -> fromRight' (Right x) == x
  18416. 1479.74 s [extra] +++ OK, passed 100 tests.
  18417. 1479.74 s [extra] \x -> fromRight' (Left x) == undefined
  18418. 1479.74 s [extra] +++ OK, passed 100 tests.
  18419. 1479.74 s [extra] \x -> fromEither (Left x ) == x
  18420. 1479.74 s [extra] +++ OK, passed 100 tests.
  18421. 1479.74 s [extra] \x -> fromEither (Right x) == x
  18422. 1479.74 s [extra] +++ OK, passed 100 tests.
  18423. 1479.74 s [extra] \a b -> maybeToEither a (Just b) == Right b
  18424. 1479.74 s [extra] +++ OK, passed 100 tests.
  18425. 1479.74 s [extra] \a -> maybeToEither a Nothing == Left a
  18426. 1479.74 s [extra] +++ OK, passed 100 tests.
  18427. 1479.74 s [extra] \x -> eitherToMaybe (Left x) == Nothing
  18428. 1479.74 s [extra] +++ OK, passed 100 tests.
  18429. 1479.74 s [extra] \x -> eitherToMaybe (Right x) == Just x
  18430. 1479.74 s [extra] +++ OK, passed 100 tests.
  18431. 1479.74 s [extra] mapLeft show (Left 1) == Left "1"
  18432. 1479.74 s [extra] +++ OK, passed 100 tests.
  18433. 1479.74 s [extra] mapLeft show (Right True) == Right True
  18434. 1479.74 s [extra] +++ OK, passed 100 tests.
  18435. 1479.74 s [extra] mapRight show (Left 1) == Left 1
  18436. 1479.74 s [extra] +++ OK, passed 100 tests.
  18437. 1479.74 s [extra] mapRight show (Right True) == Right "True"
  18438. 1479.74 s [extra] +++ OK, passed 100 tests.
  18439. 1479.74 s [extra] \xs -> repeatedly (splitAt 3) xs == chunksOf 3 xs
  18440. 1479.74 s [extra] +++ OK, passed 100 tests.
  18441. 1479.74 s [extra] \xs -> repeatedly word1 (trim xs) == words xs
  18442. 1479.74 s [extra] +++ OK, passed 100 tests.
  18443. 1479.74 s [extra] \xs -> repeatedly line1 xs == lines xs
  18444. 1479.74 s [extra] +++ OK, passed 100 tests.
  18445. 1479.74 s [extra] disjoint [1,2,3] [4,5] == True
  18446. 1479.74 s [extra] +++ OK, passed 100 tests.
  18447. 1479.74 s [extra] disjoint [1,2,3] [4,1] == False
  18448. 1479.74 s [extra] +++ OK, passed 100 tests.
  18449. 1479.74 s [extra] disjointOrd [1,2,3] [4,5] == True
  18450. 1479.74 s [extra] +++ OK, passed 100 tests.
  18451. 1479.74 s [extra] disjointOrd [1,2,3] [4,1] == False
  18452. 1479.74 s [extra] +++ OK, passed 100 tests.
  18453. 1479.74 s [extra] disjointOrdBy (compare `on` (`mod` 7)) [1,2,3] [4,5] == True
  18454. 1479.74 s [extra] +++ OK, passed 100 tests.
  18455. 1479.74 s [extra] disjointOrdBy (compare `on` (`mod` 7)) [1,2,3] [4,8] == False
  18456. 1479.74 s [extra] +++ OK, passed 100 tests.
  18457. 1479.74 s [extra] anySame [1,1,2] == True
  18458. 1479.74 s [extra] +++ OK, passed 100 tests.
  18459. 1479.74 s [extra] anySame [1,2,3] == False
  18460. 1479.74 s [extra] +++ OK, passed 100 tests.
  18461. 1479.74 s [extra] anySame (1:2:1:undefined) == True
  18462. 1479.74 s [extra] +++ OK, passed 100 tests.
  18463. 1479.74 s [extra] anySame [] == False
  18464. 1479.74 s [extra] +++ OK, passed 100 tests.
  18465. 1479.74 s [extra] \xs -> anySame xs == (length (nub xs) < length xs)
  18466. 1479.74 s [extra] +++ OK, passed 100 tests.
  18467. 1479.74 s [extra] allSame [1,1,2] == False
  18468. 1479.74 s [extra] +++ OK, passed 100 tests.
  18469. 1479.74 s [extra] allSame [1,1,1] == True
  18470. 1479.74 s [extra] +++ OK, passed 100 tests.
  18471. 1479.74 s [extra] allSame [1] == True
  18472. 1479.74 s [extra] +++ OK, passed 100 tests.
  18473. 1479.74 s [extra] allSame [] == True
  18474. 1479.74 s [extra] +++ OK, passed 100 tests.
  18475. 1479.75 s [extra] allSame (1:1:2:undefined) == False
  18476. 1479.75 s [extra] +++ OK, passed 100 tests.
  18477. 1479.75 s [extra] \xs -> allSame xs == (length (nub xs) <= 1)
  18478. 1479.75 s [extra] +++ OK, passed 100 tests.
  18479. 1479.75 s [extra] headDef 1 [] == 1
  18480. 1479.75 s [extra] +++ OK, passed 100 tests.
  18481. 1479.75 s [extra] headDef 1 [2,3,4] == 2
  18482. 1479.75 s [extra] +++ OK, passed 100 tests.
  18483. 1479.75 s [extra] \x xs -> headDef x xs == fromMaybe x (listToMaybe xs)
  18484. 1479.75 s [extra] +++ OK, passed 100 tests.
  18485. 1479.75 s [extra] lastDef 1 [] == 1
  18486. 1479.75 s [extra] +++ OK, passed 100 tests.
  18487. 1479.75 s [extra] lastDef 1 [2,3,4] == 4
  18488. 1479.75 s [extra] +++ OK, passed 100 tests.
  18489. 1479.75 s [extra] \x xs -> lastDef x xs == last (x:xs)
  18490. 1479.75 s [extra] +++ OK, passed 100 tests.
  18491. 1479.75 s [extra] [2,3,4] !? 1 == Just 3
  18492. 1479.75 s [extra] +++ OK, passed 100 tests.
  18493. 1479.75 s [extra] [2,3,4] !? (-1) == Nothing
  18494. 1479.75 s [extra] +++ OK, passed 100 tests.
  18495. 1479.75 s [extra] [] !? 0 == Nothing
  18496. 1479.75 s [extra] +++ OK, passed 100 tests.
  18497. 1479.75 s [extra] notNull [] == False
  18498. 1479.75 s [extra] +++ OK, passed 100 tests.
  18499. 1479.75 s [extra] notNull [1] == True
  18500. 1479.75 s [extra] +++ OK, passed 100 tests.
  18501. 1479.75 s [extra] \xs -> notNull xs == not (null xs)
  18502. 1479.75 s [extra] +++ OK, passed 100 tests.
  18503. 1479.75 s [extra] list 1 (\v _ -> v - 2) [5,6,7] == 3
  18504. 1479.75 s [extra] +++ OK, passed 100 tests.
  18505. 1479.75 s [extra] list 1 (\v _ -> v - 2) [] == 1
  18506. 1479.75 s [extra] +++ OK, passed 100 tests.
  18507. 1479.75 s [extra] \nil cons xs -> maybe nil (uncurry cons) (uncons xs) == list nil cons xs
  18508. 1479.75 s [extra] +++ OK, passed 100 tests.
  18509. 1479.75 s [extra] unsnoc "test" == Just ("tes",'t')
  18510. 1479.75 s [extra] +++ OK, passed 100 tests.
  18511. 1479.75 s [extra] unsnoc "" == Nothing
  18512. 1479.75 s [extra] +++ OK, passed 100 tests.
  18513. 1479.75 s [extra] \xs -> unsnoc xs == if null xs then Nothing else Just (init xs, last xs)
  18514. 1479.75 s [extra] +++ OK, passed 100 tests.
  18515. 1479.75 s [extra] cons 't' "est" == "test"
  18516. 1479.75 s [extra] +++ OK, passed 100 tests.
  18517. 1479.75 s [extra] \x xs -> uncons (cons x xs) == Just (x,xs)
  18518. 1479.75 s [extra] +++ OK, passed 100 tests.
  18519. 1479.75 s [extra] snoc "tes" 't' == "test"
  18520. 1479.75 s [extra] +++ OK, passed 100 tests.
  18521. 1479.75 s [extra] \xs x -> unsnoc (snoc xs x) == Just (xs,x)
  18522. 1479.75 s [extra] +++ OK, passed 100 tests.
  18523. 1479.75 s [extra] enumerate == [False, True]
  18524. 1479.75 s [extra] +++ OK, passed 100 tests.
  18525. 1479.75 s [extra] takeEnd 3 "hello" == "llo"
  18526. 1479.75 s [extra] +++ OK, passed 100 tests.
  18527. 1479.75 s [extra] takeEnd 5 "bye" == "bye"
  18528. 1479.75 s [extra] +++ OK, passed 100 tests.
  18529. 1479.75 s [extra] takeEnd (-1) "bye" == ""
  18530. 1479.75 s [extra] +++ OK, passed 100 tests.
  18531. 1479.75 s [extra] \i xs -> takeEnd i xs `isSuffixOf` xs
  18532. 1479.75 s [extra] +++ OK, passed 100 tests.
  18533. 1479.75 s [extra] \i xs -> length (takeEnd i xs) == min (max 0 i) (length xs)
  18534. 1479.75 s [extra] +++ OK, passed 100 tests.
  18535. 1479.75 s [extra] dropEnd 3 "hello" == "he"
  18536. 1479.75 s [extra] +++ OK, passed 100 tests.
  18537. 1479.75 s [extra] dropEnd 5 "bye" == ""
  18538. 1479.75 s [extra] +++ OK, passed 100 tests.
  18539. 1479.75 s [extra] dropEnd (-1) "bye" == "bye"
  18540. 1479.75 s [extra] +++ OK, passed 100 tests.
  18541. 1479.75 s [extra] \i xs -> dropEnd i xs `isPrefixOf` xs
  18542. 1479.75 s [extra] +++ OK, passed 100 tests.
  18543. 1479.75 s [extra] \i xs -> length (dropEnd i xs) == max 0 (length xs - max 0 i)
  18544. 1479.75 s [extra] +++ OK, passed 100 tests.
  18545. 1479.75 s [extra] \i -> take 3 (dropEnd 5 [i..]) == take 3 [i..]
  18546. 1479.75 s [extra] +++ OK, passed 100 tests.
  18547. 1479.75 s [extra] splitAtEnd 3 "hello" == ("he","llo")
  18548. 1479.75 s [extra] +++ OK, passed 100 tests.
  18549. 1479.75 s [extra] splitAtEnd 3 "he" == ("", "he")
  18550. 1479.75 s [extra] +++ OK, passed 100 tests.
  18551. 1479.75 s [extra] \i xs -> uncurry (++) (splitAt i xs) == xs
  18552. 1479.75 s [extra] +++ OK, passed 100 tests.
  18553. 1479.75 s [extra] \i xs -> splitAtEnd i xs == (dropEnd i xs, takeEnd i xs)
  18554. 1479.76 s [extra] +++ OK, passed 100 tests.
  18555. 1479.76 s [extra] \i xs -> zip [i..] xs == zipFrom i xs
  18556. 1479.76 s [extra] +++ OK, passed 100 tests.
  18557. 1479.76 s [extra] zipFrom False [1..3] == [(False,1),(True, 2)]
  18558. 1479.76 s [extra] +++ OK, passed 100 tests.
  18559. 1479.76 s [extra] \i xs -> zipWithFrom (,) i xs == zipFrom i xs
  18560. 1479.76 s [extra] +++ OK, passed 100 tests.
  18561. 1479.76 s [extra] concatUnzip [("a","AB"),("bc","C")] == ("abc","ABC")
  18562. 1479.76 s [extra] +++ OK, passed 100 tests.
  18563. 1479.76 s [extra] concatUnzip3 [("a","AB",""),("bc","C","123")] == ("abc","ABC","123")
  18564. 1479.76 s [extra] +++ OK, passed 100 tests.
  18565. 1479.76 s [extra] takeWhileEnd even [2,3,4,6] == [4,6]
  18566. 1479.76 s [extra] +++ OK, passed 100 tests.
  18567. 1479.76 s [extra] trim " hello " == "hello"
  18568. 1479.76 s [extra] +++ OK, passed 100 tests.
  18569. 1479.76 s [extra] trimStart " hello " == "hello "
  18570. 1479.76 s [extra] +++ OK, passed 100 tests.
  18571. 1479.76 s [extra] trimEnd " hello " == " hello"
  18572. 1479.76 s [extra] +++ OK, passed 100 tests.
  18573. 1479.76 s [extra] \s -> trim s == trimEnd (trimStart s)
  18574. 1479.76 s [extra] +++ OK, passed 100 tests.
  18575. 1479.76 s [extra] lower "This is A TEST" == "this is a test"
  18576. 1479.76 s [extra] +++ OK, passed 100 tests.
  18577. 1479.76 s [extra] lower "" == ""
  18578. 1479.76 s [extra] +++ OK, passed 100 tests.
  18579. 1479.76 s [extra] upper "This is A TEST" == "THIS IS A TEST"
  18580. 1479.76 s [extra] +++ OK, passed 100 tests.
  18581. 1479.76 s [extra] upper "" == ""
  18582. 1479.76 s [extra] +++ OK, passed 100 tests.
  18583. 1479.76 s [extra] word1 "" == ("", "")
  18584. 1479.76 s [extra] +++ OK, passed 100 tests.
  18585. 1479.76 s [extra] word1 "keyword rest of string" == ("keyword","rest of string")
  18586. 1479.76 s [extra] +++ OK, passed 100 tests.
  18587. 1479.76 s [extra] word1 " keyword\n rest of string" == ("keyword","rest of string")
  18588. 1479.76 s [extra] +++ OK, passed 100 tests.
  18589. 1479.76 s [extra] \s -> fst (word1 s) == concat (take 1 $ words s)
  18590. 1479.76 s [extra] +++ OK, passed 100 tests.
  18591. 1479.76 s [extra] \s -> words (snd $ word1 s) == drop 1 (words s)
  18592. 1479.76 s [extra] +++ OK, passed 100 tests.
  18593. 1479.76 s [extra] line1 "" == ("", "")
  18594. 1479.76 s [extra] +++ OK, passed 100 tests.
  18595. 1479.76 s [extra] line1 "test" == ("test","")
  18596. 1479.76 s [extra] +++ OK, passed 100 tests.
  18597. 1479.76 s [extra] line1 "test\n" == ("test","")
  18598. 1479.76 s [extra] +++ OK, passed 100 tests.
  18599. 1479.76 s [extra] line1 "test\nrest" == ("test","rest")
  18600. 1479.76 s [extra] +++ OK, passed 100 tests.
  18601. 1479.76 s [extra] line1 "test\nrest\nmore" == ("test","rest\nmore")
  18602. 1479.76 s [extra] +++ OK, passed 100 tests.
  18603. 1479.76 s [extra] escapeHTML "this is a test" == "this is a test"
  18604. 1479.76 s [extra] +++ OK, passed 100 tests.
  18605. 1479.76 s [extra] escapeHTML "<b>\"g&t\"</n>" == "&lt;b&gt;&quot;g&amp;t&quot;&lt;/n&gt;"
  18606. 1479.76 s [extra] +++ OK, passed 100 tests.
  18607. 1479.76 s [extra] escapeHTML "t'was another test" == "t&#39;was another test"
  18608. 1479.76 s [extra] +++ OK, passed 100 tests.
  18609. 1479.76 s [extra] \xs -> unescapeHTML (escapeHTML xs) == xs
  18610. 1479.76 s [extra] +++ OK, passed 100 tests.
  18611. 1479.76 s [extra] escapeJSON "this is a test" == "this is a test"
  18612. 1479.76 s [extra] +++ OK, passed 100 tests.
  18613. 1479.76 s [extra] escapeJSON "\ttab\nnewline\\" == "\\ttab\\nnewline\\\\"
  18614. 1479.76 s [extra] +++ OK, passed 100 tests.
  18615. 1479.76 s [extra] escapeJSON "\ESC[0mHello" == "\\u001b[0mHello"
  18616. 1479.76 s [extra] +++ OK, passed 100 tests.
  18617. 1479.76 s [extra] \xs -> unescapeJSON (escapeJSON xs) == xs
  18618. 1479.76 s [extra] +++ OK, passed 100 tests.
  18619. 1479.76 s [extra] groupOn abs [1,-1,2] == [[1,-1], [2]]
  18620. 1479.76 s [extra] +++ OK, passed 100 tests.
  18621. 1479.76 s [extra] groupOnKey abs [1,-1,2] == [(1, [1,-1]), (2, [2])]
  18622. 1479.76 s [extra] +++ OK, passed 100 tests.
  18623. 1479.76 s [extra] maximumOn id [] == undefined
  18624. 1479.76 s [extra] +++ OK, passed 100 tests.
  18625. 1479.76 s [extra] maximumOn length ["test","extra","a"] == "extra"
  18626. 1479.76 s [extra] +++ OK, passed 100 tests.
  18627. 1479.76 s [extra] minimumOn id [] == undefined
  18628. 1479.76 s [extra] +++ OK, passed 100 tests.
  18629. 1479.76 s [extra] minimumOn length ["test","extra","a"] == "a"
  18630. 1479.76 s [extra] +++ OK, passed 100 tests.
  18631. 1479.76 s [extra] groupSort [(1,'t'),(3,'t'),(2,'e'),(2,'s')] == [(1,"t"),(2,"es"),(3,"t")]
  18632. 1479.76 s [extra] +++ OK, passed 100 tests.
  18633. 1479.76 s [extra] \xs -> map fst (groupSort xs) == sort (nub (map fst xs))
  18634. 1479.77 s [extra] +++ OK, passed 100 tests.
  18635. 1479.77 s [extra] \xs -> concatMap snd (groupSort xs) == map snd (sortOn fst xs)
  18636. 1479.77 s [extra] +++ OK, passed 100 tests.
  18637. 1479.77 s [extra] groupSortOn length ["test","of","sized","item"] == [["of"],["test","item"],["sized"]]
  18638. 1479.77 s [extra] +++ OK, passed 100 tests.
  18639. 1479.77 s [extra] groupSortBy (compare `on` length) ["test","of","sized","item"] == [["of"],["test","item"],["sized"]]
  18640. 1479.77 s [extra] +++ OK, passed 100 tests.
  18641. 1479.77 s [extra] sum' [1, 2, 3] == 6
  18642. 1479.77 s [extra] +++ OK, passed 100 tests.
  18643. 1479.77 s [extra] sumOn' read ["1", "2", "3"] == 6
  18644. 1479.77 s [extra] +++ OK, passed 100 tests.
  18645. 1479.77 s [extra] product' [1, 2, 4] == 8
  18646. 1479.77 s [extra] +++ OK, passed 100 tests.
  18647. 1479.77 s [extra] productOn' read ["1", "2", "4"] == 8
  18648. 1479.77 s [extra] +++ OK, passed 100 tests.
  18649. 1479.77 s [extra] merge "ace" "bd" == "abcde"
  18650. 1479.77 s [extra] +++ OK, passed 100 tests.
  18651. 1479.77 s [extra] \xs ys -> merge (sort xs) (sort ys) == sort (xs ++ ys)
  18652. 1479.77 s [extra] +++ OK, passed 100 tests.
  18653. 1479.77 s [extra] replace "el" "_" "Hello Bella" == "H_lo B_la"
  18654. 1479.77 s [extra] +++ OK, passed 100 tests.
  18655. 1479.77 s [extra] replace "el" "e" "Hello" == "Helo"
  18656. 1479.77 s [extra] +++ OK, passed 100 tests.
  18657. 1479.77 s [extra] replace "" "x" "Hello" == "xHxexlxlxox"
  18658. 1479.77 s [extra] +++ OK, passed 100 tests.
  18659. 1479.77 s [extra] replace "" "x" "" == "x"
  18660. 1479.77 s [extra] +++ OK, passed 100 tests.
  18661. 1479.77 s [extra] \xs ys -> replace xs xs ys == ys
  18662. 1479.77 s [extra] +++ OK, passed 100 tests.
  18663. 1479.77 s [extra] breakEnd isLower "youRE" == ("you","RE")
  18664. 1479.77 s [extra] +++ OK, passed 100 tests.
  18665. 1479.77 s [extra] breakEnd isLower "youre" == ("youre","")
  18666. 1479.77 s [extra] +++ OK, passed 100 tests.
  18667. 1479.77 s [extra] breakEnd isLower "YOURE" == ("","YOURE")
  18668. 1479.77 s [extra] +++ OK, passed 100 tests.
  18669. 1479.77 s [extra] \f xs -> breakEnd (not . f) xs == spanEnd f xs
  18670. 1479.77 s [extra] +++ OK, passed 100 tests.
  18671. 1479.77 s [extra] spanEnd isUpper "youRE" == ("you","RE")
  18672. 1479.77 s [extra] +++ OK, passed 100 tests.
  18673. 1479.77 s [extra] spanEnd (not . isSpace) "x y z" == ("x y ","z")
  18674. 1479.77 s [extra] +++ OK, passed 100 tests.
  18675. 1479.77 s [extra] \f xs -> uncurry (++) (spanEnd f xs) == xs
  18676. 1479.77 s [extra] +++ OK, passed 100 tests.
  18677. 1479.77 s [extra] \f xs -> spanEnd f xs == swap (both reverse (span f (reverse xs)))
  18678. 1479.77 s [extra] +++ OK, passed 100 tests.
  18679. 1479.77 s [extra] wordsBy (== ':') "::xyz:abc::123::" == ["xyz","abc","123"]
  18680. 1479.77 s [extra] +++ OK, passed 100 tests.
  18681. 1479.77 s [extra] \s -> wordsBy isSpace s == words s
  18682. 1479.77 s [extra] +++ OK, passed 100 tests.
  18683. 1479.77 s [extra] linesBy (== ':') "::xyz:abc::123::" == ["","","xyz","abc","","123",""]
  18684. 1479.77 s [extra] +++ OK, passed 100 tests.
  18685. 1479.77 s [extra] \s -> linesBy (== '\n') s == lines s
  18686. 1479.78 s [extra] +++ OK, passed 100 tests.
  18687. 1479.78 s [extra] linesBy (== ';') "my;list;here;" == ["my","list","here"]
  18688. 1479.78 s [extra] +++ OK, passed 100 tests.
  18689. 1479.78 s [extra] firstJust id [Nothing,Just 3] == Just 3
  18690. 1479.78 s [extra] +++ OK, passed 100 tests.
  18691. 1479.78 s [extra] firstJust id [Nothing,Nothing] == Nothing
  18692. 1479.78 s [extra] +++ OK, passed 100 tests.
  18693. 1479.78 s [extra] drop1 "" == ""
  18694. 1479.78 s [extra] +++ OK, passed 100 tests.
  18695. 1479.78 s [extra] drop1 "test" == "est"
  18696. 1479.78 s [extra] +++ OK, passed 100 tests.
  18697. 1479.78 s [extra] \xs -> drop 1 xs == drop1 xs
  18698. 1479.78 s [extra] +++ OK, passed 100 tests.
  18699. 1479.78 s [extra] dropEnd1 "" == ""
  18700. 1479.78 s [extra] +++ OK, passed 100 tests.
  18701. 1479.78 s [extra] dropEnd1 "test" == "tes"
  18702. 1479.78 s [extra] +++ OK, passed 100 tests.
  18703. 1479.78 s [extra] \xs -> dropEnd 1 xs == dropEnd1 xs
  18704. 1479.78 s [extra] +++ OK, passed 100 tests.
  18705. 1479.78 s [extra] mconcatMap Sum [1,2,3] == Sum 6
  18706. 1479.78 s [extra] +++ OK, passed 100 tests.
  18707. 1479.78 s [extra] \f xs -> mconcatMap f xs == concatMap f xs
  18708. 1479.79 s [extra] +++ OK, passed 100 tests.
  18709. 1479.79 s [extra] breakOn "::" "a::b::c" == ("a", "::b::c")
  18710. 1479.79 s [extra] +++ OK, passed 100 tests.
  18711. 1479.79 s [extra] breakOn "/" "foobar" == ("foobar", "")
  18712. 1479.79 s [extra] +++ OK, passed 100 tests.
  18713. 1479.79 s [extra] \needle haystack -> let (prefix,match) = breakOn needle haystack in prefix ++ match == haystack
  18714. 1479.79 s [extra] +++ OK, passed 100 tests.
  18715. 1479.79 s [extra] breakOnEnd "::" "a::b::c" == ("a::b::", "c")
  18716. 1479.79 s [extra] +++ OK, passed 100 tests.
  18717. 1479.79 s [extra] splitOn "\r\n" "a\r\nb\r\nd\r\ne" == ["a","b","d","e"]
  18718. 1479.79 s [extra] +++ OK, passed 100 tests.
  18719. 1479.79 s [extra] splitOn "aaa" "aaaXaaaXaaaXaaa" == ["","X","X","X",""]
  18720. 1479.79 s [extra] +++ OK, passed 100 tests.
  18721. 1479.79 s [extra] splitOn "x" "x" == ["",""]
  18722. 1479.79 s [extra] +++ OK, passed 100 tests.
  18723. 1479.79 s [extra] splitOn "x" "" == [""]
  18724. 1479.79 s [extra] +++ OK, passed 100 tests.
  18725. 1479.79 s [extra] \s x -> s /= "" ==> intercalate s (splitOn s x) == x
  18726. 1479.79 s [extra] +++ OK, passed 100 tests; 17 discarded.
  18727. 1479.79 s [extra] \c x -> splitOn [c] x == split (==c) x
  18728. 1479.79 s [extra] +++ OK, passed 100 tests.
  18729. 1479.79 s [extra] split (== 'a') "aabbaca" == ["","","bb","c",""]
  18730. 1479.79 s [extra] +++ OK, passed 100 tests.
  18731. 1479.79 s [extra] split (== 'a') "" == [""]
  18732. 1479.79 s [extra] +++ OK, passed 100 tests.
  18733. 1479.79 s [extra] split (== ':') "::xyz:abc::123::" == ["","","xyz","abc","","123","",""]
  18734. 1479.79 s [extra] +++ OK, passed 100 tests.
  18735. 1479.79 s [extra] split (== ',') "my,list,here" == ["my","list","here"]
  18736. 1479.79 s [extra] +++ OK, passed 100 tests.
  18737. 1479.79 s [extra] dropWhileEnd isSpace "ab cde " == "ab cde"
  18738. 1479.79 s [extra] +++ OK, passed 100 tests.
  18739. 1479.79 s [extra] dropWhileEnd' isSpace "ab cde " == "ab cde"
  18740. 1479.79 s [extra] +++ OK, passed 100 tests.
  18741. 1479.79 s [extra] last (dropWhileEnd even [undefined,3]) == undefined
  18742. 1479.79 s [extra] +++ OK, passed 100 tests.
  18743. 1479.79 s [extra] last (dropWhileEnd' even [undefined,3]) == 3
  18744. 1479.79 s [extra] +++ OK, passed 100 tests.
  18745. 1479.79 s [extra] head (dropWhileEnd even (3:undefined)) == 3
  18746. 1479.79 s [extra] +++ OK, passed 100 tests.
  18747. 1479.79 s [extra] head (dropWhileEnd' even (3:undefined)) == undefined
  18748. 1479.79 s [extra] +++ OK, passed 100 tests.
  18749. 1479.79 s [extra] dropPrefix "Mr. " "Mr. Men" == "Men"
  18750. 1479.79 s [extra] +++ OK, passed 100 tests.
  18751. 1479.79 s [extra] dropPrefix "Mr. " "Dr. Men" == "Dr. Men"
  18752. 1479.79 s [extra] +++ OK, passed 100 tests.
  18753. 1479.79 s [extra] dropSuffix "!" "Hello World!" == "Hello World"
  18754. 1479.79 s [extra] +++ OK, passed 100 tests.
  18755. 1479.79 s [extra] dropSuffix "!" "Hello World!!" == "Hello World!"
  18756. 1479.79 s [extra] +++ OK, passed 100 tests.
  18757. 1479.79 s [extra] dropSuffix "!" "Hello World." == "Hello World."
  18758. 1479.79 s [extra] +++ OK, passed 100 tests.
  18759. 1479.79 s [extra] stripSuffix "bar" "foobar" == Just "foo"
  18760. 1479.79 s [extra] +++ OK, passed 100 tests.
  18761. 1479.79 s [extra] stripSuffix "" "baz" == Just "baz"
  18762. 1479.79 s [extra] +++ OK, passed 100 tests.
  18763. 1479.79 s [extra] stripSuffix "foo" "quux" == Nothing
  18764. 1479.79 s [extra] +++ OK, passed 100 tests.
  18765. 1479.79 s [extra] stripInfix "::" "a::b::c" == Just ("a", "b::c")
  18766. 1479.79 s [extra] +++ OK, passed 100 tests.
  18767. 1479.79 s [extra] stripInfix "/" "foobar" == Nothing
  18768. 1479.79 s [extra] +++ OK, passed 100 tests.
  18769. 1479.79 s [extra] stripInfixEnd "::" "a::b::c" == Just ("a::b", "c")
  18770. 1479.79 s [extra] +++ OK, passed 100 tests.
  18771. 1479.79 s [extra] chunksOf 3 "my test" == ["my ","tes","t"]
  18772. 1479.79 s [extra] +++ OK, passed 100 tests.
  18773. 1479.79 s [extra] chunksOf 3 "mytest" == ["myt","est"]
  18774. 1479.79 s [extra] +++ OK, passed 100 tests.
  18775. 1479.79 s [extra] chunksOf 8 "" == []
  18776. 1479.79 s [extra] +++ OK, passed 100 tests.
  18777. 1479.79 s [extra] chunksOf 0 "test" == undefined
  18778. 1479.79 s [extra] +++ OK, passed 100 tests.
  18779. 1479.79 s [extra] nubSort "this is a test" == " aehist"
  18780. 1479.79 s [extra] +++ OK, passed 100 tests.
  18781. 1479.79 s [extra] \xs -> nubSort xs == nub (sort xs)
  18782. 1479.80 s [extra] +++ OK, passed 100 tests.
  18783. 1479.80 s [extra] nubSortOn length ["a","test","of","this"] == ["a","of","test"]
  18784. 1479.80 s [extra] +++ OK, passed 100 tests.
  18785. 1479.80 s [extra] nubSortBy (compare `on` length) ["a","test","of","this"] == ["a","of","test"]
  18786. 1479.80 s [extra] +++ OK, passed 100 tests.
  18787. 1479.80 s [extra] nubOrd "this is a test" == "this ae"
  18788. 1479.80 s [extra] +++ OK, passed 100 tests.
  18789. 1479.80 s [extra] nubOrd (take 4 ("this" ++ undefined)) == "this"
  18790. 1479.80 s [extra] +++ OK, passed 100 tests.
  18791. 1479.80 s [extra] \xs -> nubOrd xs == nub xs
  18792. 1479.80 s [extra] +++ OK, passed 100 tests.
  18793. 1479.80 s [extra] nubOrdOn length ["a","test","of","this"] == ["a","test","of"]
  18794. 1479.80 s [extra] +++ OK, passed 100 tests.
  18795. 1479.80 s [extra] nubOrdBy (compare `on` length) ["a","test","of","this"] == ["a","test","of"]
  18796. 1479.80 s [extra] +++ OK, passed 100 tests.
  18797. 1479.80 s [extra] zipWithLongest (,) "a" "xyz" == [(Just 'a', Just 'x'), (Nothing, Just 'y'), (Nothing, Just 'z')]
  18798. 1479.80 s [extra] +++ OK, passed 100 tests.
  18799. 1479.80 s [extra] zipWithLongest (,) "a" "x" == [(Just 'a', Just 'x')]
  18800. 1479.80 s [extra] +++ OK, passed 100 tests.
  18801. 1479.80 s [extra] zipWithLongest (,) "" "x" == [(Nothing, Just 'x')]
  18802. 1479.80 s [extra] +++ OK, passed 100 tests.
  18803. 1479.80 s [extra] comparingLength [1,2,3] [False] == GT
  18804. 1479.80 s [extra] +++ OK, passed 100 tests.
  18805. 1479.80 s [extra] comparingLength [1,2] "ab" == EQ
  18806. 1479.80 s [extra] +++ OK, passed 100 tests.
  18807. 1479.80 s [extra] \(xs :: [Int]) (ys :: [Int]) -> comparingLength xs ys == Data.Ord.comparing length xs ys
  18808. 1479.80 s [extra] +++ OK, passed 100 tests.
  18809. 1479.80 s [extra] comparingLength [1,2] (1:2:3:undefined) == LT
  18810. 1479.80 s [extra] +++ OK, passed 100 tests.
  18811. 1479.80 s [extra] comparingLength (1:2:3:undefined) [1,2] == GT
  18812. 1479.80 s [extra] +++ OK, passed 100 tests.
  18813. 1479.80 s [extra] mwhen True "test" == "test"
  18814. 1479.80 s [extra] +++ OK, passed 100 tests.
  18815. 1479.80 s [extra] mwhen False "test" == ""
  18816. 1479.80 s [extra] +++ OK, passed 100 tests.
  18817. 1479.80 s [extra] first succ (1,"test") == (2,"test")
  18818. 1479.80 s [extra] +++ OK, passed 100 tests.
  18819. 1479.80 s [extra] second reverse (1,"test") == (1,"tset")
  18820. 1479.80 s [extra] +++ OK, passed 100 tests.
  18821. 1479.80 s [extra] firstM (\x -> [x-1, x+1]) (1,"test") == [(0,"test"),(2,"test")]
  18822. 1479.80 s [extra] +++ OK, passed 100 tests.
  18823. 1479.80 s [extra] secondM (\x -> [reverse x, x]) (1,"test") == [(1,"tset"),(1,"test")]
  18824. 1479.80 s [extra] +++ OK, passed 100 tests.
  18825. 1479.80 s [extra] (succ *** reverse) (1,"test") == (2,"tset")
  18826. 1479.80 s [extra] +++ OK, passed 100 tests.
  18827. 1479.80 s [extra] (succ &&& pred) 1 == (2,0)
  18828. 1479.80 s [extra] +++ OK, passed 100 tests.
  18829. 1479.80 s [extra] dupe 12 == (12, 12)
  18830. 1479.80 s [extra] +++ OK, passed 100 tests.
  18831. 1479.80 s [extra] both succ (1,2) == (2,3)
  18832. 1479.80 s [extra] +++ OK, passed 100 tests.
  18833. 1479.80 s [extra] first3 succ (1,1,1) == (2,1,1)
  18834. 1479.80 s [extra] +++ OK, passed 100 tests.
  18835. 1479.80 s [extra] second3 succ (1,1,1) == (1,2,1)
  18836. 1479.80 s [extra] +++ OK, passed 100 tests.
  18837. 1479.80 s [extra] third3 succ (1,1,1) == (1,1,2)
  18838. 1479.80 s [extra] +++ OK, passed 100 tests.
  18839. 1479.80 s [extra] \x -> readVersion (showVersion x) == x
  18840. 1479.80 s [extra] +++ OK, passed 100 tests.
  18841. 1479.80 s [extra] readVersion "hello" == undefined
  18842. 1479.80 s [extra] +++ OK, passed 100 tests.
  18843. 1479.80 s [extra] showDP 4 pi == "3.1416"
  18844. 1479.80 s [extra] +++ OK, passed 100 tests.
  18845. 1479.80 s [extra] showDP 0 pi == "3"
  18846. 1479.80 s [extra] +++ OK, passed 100 tests.
  18847. 1479.80 s [extra] showDP 2 3 == "3.00"
  18848. 1479.80 s [extra] +++ OK, passed 100 tests.
  18849. 1479.80 s [extra] withTempDir $ \dir -> do writeFile (dir </> "foo.txt") ""; withCurrentDirectory dir $ doesFileExist "foo.txt"
  18850. 1479.80 s [extra] +++ OK, passed 100 tests.
  18851. 1479.80 s [extra] withTempDir $ \dir -> do writeFile (dir </> "test.txt") ""; (== [dir </> "test.txt"]) <$> listContents dir
  18852. 1479.80 s [extra] +++ OK, passed 100 tests.
  18853. 1479.80 s [extra] listTest listContents ["bar.txt","foo/baz.txt","zoo"] ["bar.txt","foo","zoo"]
  18854. 1479.80 s [extra] +++ OK, passed 100 tests.
  18855. 1479.80 s [extra] listTest listDirectories ["bar.txt","foo/baz.txt","zoo"] ["foo"]
  18856. 1479.80 s [extra] +++ OK, passed 100 tests.
  18857. 1479.80 s [extra] listTest listFiles ["bar.txt","foo/baz.txt","zoo"] ["bar.txt","zoo"]
  18858. 1479.80 s [extra] +++ OK, passed 100 tests.
  18859. 1479.80 s [extra] listTest listFilesRecursive ["bar.txt","zoo","foo" </> "baz.txt"] ["bar.txt","zoo","foo" </> "baz.txt"]
  18860. 1479.80 s [extra] +++ OK, passed 100 tests.
  18861. 1479.80 s [extra] listTest (listFilesInside $ pure . not . isPrefixOf "." . takeFileName) ["bar.txt","foo" </> "baz.txt",".foo" </> "baz2.txt", "zoo"] ["bar.txt","zoo","foo" </> "baz.txt"]
  18862. 1479.80 s [extra] +++ OK, passed 100 tests.
  18863. 1479.80 s [extra] listTest (listFilesInside $ const $ pure False) ["bar.txt"] []
  18864. 1479.81 s [extra] +++ OK, passed 100 tests.
  18865. 1479.81 s [extra] isWindows == (os == "mingw32")
  18866. 1479.81 s [extra] +++ OK, passed 100 tests.
  18867. 1479.81 s [extra] \(filter isHexDigit -> s) -> fmap (== s) $ withTempFile $ \file -> do writeFile file s; readFile' file
  18868. 1479.82 s [extra] +++ OK, passed 100 tests.
  18869. 1479.82 s [extra] \s -> withTempFile $ \file -> do writeFileUTF8 file s; fmap (== s) $ readFileUTF8' file
  18870. 1479.84 s [extra] +++ OK, passed 100 tests.
  18871. 1479.84 s [extra] \(ASCIIString s) -> withTempFile $ \file -> do writeFileBinary file s; fmap (== s) $ readFileBinary' file
  18872. 1479.86 s [extra] +++ OK, passed 100 tests.
  18873. 1479.86 s [extra] captureOutput (print 1) == pure ("1\n",())
  18874. 1479.86 s [extra] +++ OK, passed 100 tests.
  18875. 1479.86 s [extra] withTempFile doesFileExist == pure True
  18876. 1479.86 s [extra] +++ OK, passed 100 tests.
  18877. 1479.86 s [extra] (doesFileExist =<< withTempFile pure) == pure False
  18878. 1479.86 s [extra] +++ OK, passed 100 tests.
  18879. 1479.86 s [extra] withTempFile readFile' == pure ""
  18880. 1479.86 s [extra] +++ OK, passed 100 tests.
  18881. 1479.86 s [extra] withTempDir doesDirectoryExist == pure True
  18882. 1479.86 s [extra] +++ OK, passed 100 tests.
  18883. 1479.86 s [extra] (doesDirectoryExist =<< withTempDir pure) == pure False
  18884. 1479.86 s [extra] +++ OK, passed 100 tests.
  18885. 1479.86 s [extra] withTempDir listFiles == pure []
  18886. 1479.86 s [extra] +++ OK, passed 100 tests.
  18887. 1479.86 s [extra] fileEq "does_not_exist1" "does_not_exist2" == undefined
  18888. 1479.86 s [extra] +++ OK, passed 100 tests.
  18889. 1479.86 s [extra] fileEq "does_not_exist" "does_not_exist" == undefined
  18890. 1479.86 s [extra] +++ OK, passed 100 tests.
  18891. 1479.86 s [extra] withTempFile $ \f1 -> fileEq "does_not_exist" f1 == undefined
  18892. 1479.86 s [extra] +++ OK, passed 100 tests.
  18893. 1479.86 s [extra] withTempFile $ \f1 -> withTempFile $ \f2 -> fileEq f1 f2
  18894. 1479.86 s [extra] +++ OK, passed 100 tests.
  18895. 1479.86 s [extra] withTempFile $ \f1 -> withTempFile $ \f2 -> writeFile f1 "a" >> writeFile f2 "a" >> fileEq f1 f2
  18896. 1479.86 s [extra] +++ OK, passed 100 tests.
  18897. 1479.86 s [extra] withTempFile $ \f1 -> withTempFile $ \f2 -> writeFile f1 "a" >> writeFile f2 "b" >> notM (fileEq f1 f2)
  18898. 1479.86 s [extra] +++ OK, passed 100 tests.
  18899. 1479.86 s [extra] fmap (round . fst) (duration $ sleep 1) == pure 1
  18900. 1480.86 s [extra] +++ OK, passed 100 tests.
  18901. 1480.86 s [extra] timeout (-3) (print 1) == pure Nothing
  18902. 1480.86 s [extra] +++ OK, passed 100 tests.
  18903. 1480.86 s [extra] timeout 0.1 (print 1) == fmap Just (print 1)
  18904. 1480.86 s [extra] +++ OK, passed 100 tests.
  18905. 1480.86 s [extra] do (t, _) <- duration $ timeout 0.1 $ sleep 1000; print t; pure $ t < 1
  18906. 1480.96 s [extra] 0.10025806300000001
  18907. 1480.96 s [extra] +++ OK, passed 100 tests.
  18908. 1480.96 s [extra] timeout 0.1 (sleep 2 >> print 1) == pure Nothing
  18909. 1481.07 s [extra] +++ OK, passed 100 tests.
  18910. 1481.07 s [extra] showDuration 3.435 == "3.44s"
  18911. 1481.07 s [extra] +++ OK, passed 100 tests.
  18912. 1481.07 s [extra] showDuration 623.8 == "10m24s"
  18913. 1481.07 s [extra] +++ OK, passed 100 tests.
  18914. 1481.07 s [extra] showDuration 62003.8 == "17h13m"
  18915. 1481.07 s [extra] +++ OK, passed 100 tests.
  18916. 1481.07 s [extra] showDuration 1e8 == "27777h47m"
  18917. 1481.07 s [extra] +++ OK, passed 100 tests.
  18918. 1481.07 s [extra] do f <- offsetTime; xs <- replicateM 10 f; pure $ xs == sort xs
  18919. 1481.07 s [extra] +++ OK, passed 100 tests.
  18920. 1481.07 s [extra] do (a,_) <- duration $ sleep 1; pure $ a >= 1 && a <= 1.5
  18921. 1482.07 s [extra] +++ OK, passed 100 tests.
  18922. 1482.07 s [extra] Extra export
  18923. 1482.07 s [extra] +++ OK, passed 100 tests.
  18924. 1482.07 s [extra] withTempFile
  18925. 1482.08 s [extra] ....done
  18926. 1482.08 s [extra] withTempDir
  18927. 1482.10 s [extra] ....done
  18928. 1482.10 s [extra] retry
  18929. 1482.10 s [extra] +++ OK, passed 100 tests.
  18930. 1482.10 s [extra] barrier
  18931. 1482.10 s [extra] Success (325 tests)
  18932. 1482.13 s [extra] Test suite extra-test: PASS
  18933. 1482.13 s [extra] Test suite logged to: dist/test/extra-1.8.1-extra-test.log
  18934. 1482.13 s [extra] 1 of 1 test suites (1 of 1 test cases) passed.
  18935. 1482.13 s [extra] Phase: haddockPhase
  18936. 1482.32 s [extra] Preprocessing library for extra-1.8.1..
  18937. 1482.32 s [extra] Running Haddock on library for extra-1.8.1..
  18938. 1482.38 s [extra] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
  18939. 1482.73 s [extra] [ 1 of 22] Compiling Data.IORef.Extra ( src/Data/IORef/Extra.hs, nothing )
  18940. 1482.75 s [extra] [ 2 of 22] Compiling Data.Monoid.Extra ( src/Data/Monoid/Extra.hs, nothing )
  18941. 1482.75 s [extra] [ 3 of 22] Compiling Data.Tuple.Extra ( src/Data/Tuple/Extra.hs, nothing )
  18942. 1482.77 s [extra] [ 4 of 22] Compiling Data.Typeable.Extra ( src/Data/Typeable/Extra.hs, nothing )
  18943. 1482.77 s [extra] [ 5 of 22] Compiling Numeric.Extra ( src/Numeric/Extra.hs, nothing )
  18944. 1482.78 s [extra] [ 6 of 22] Compiling Partial ( src/Partial.hs, nothing )
  18945. 1482.78 s [extra] [ 7 of 22] Compiling Data.List.Extra ( src/Data/List/Extra.hs, nothing )
  18946. 1483.00 s [extra] [ 8 of 22] Compiling Data.Version.Extra ( src/Data/Version/Extra.hs, nothing )
  18947. 1483.01 s [extra] [ 9 of 22] Compiling Data.List.NonEmpty.Extra ( src/Data/List/NonEmpty/Extra.hs, nothing )
  18948. 1483.02 s [extra] [10 of 22] Compiling Data.Either.Extra ( src/Data/Either/Extra.hs, nothing )
  18949. 1483.03 s [extra] [11 of 22] Compiling Control.Exception.Extra ( src/Control/Exception/Extra.hs, nothing )
  18950. 1483.05 s [extra] [12 of 22] Compiling Control.Monad.Extra ( src/Control/Monad/Extra.hs, nothing )
  18951. 1483.08 s [extra] [13 of 22] Compiling Data.Foldable.Extra ( src/Data/Foldable/Extra.hs, nothing )
  18952. 1483.09 s [extra] [14 of 22] Compiling Control.Concurrent.Extra ( src/Control/Concurrent/Extra.hs, nothing )
  18953. 1483.12 s [extra] [15 of 22] Compiling System.Directory.Extra ( src/System/Directory/Extra.hs, nothing )
  18954. 1483.29 s [extra] [16 of 22] Compiling System.Environment.Extra ( src/System/Environment/Extra.hs, nothing )
  18955. 1483.29 s [extra] [17 of 22] Compiling System.IO.Extra ( src/System/IO/Extra.hs, nothing )
  18956. 1483.29 s [extra] [18 of 22] Compiling System.Info.Extra ( src/System/Info/Extra.hs, nothing )
  18957. 1483.29 s [extra] [19 of 22] Compiling System.Process.Extra ( src/System/Process/Extra.hs, nothing )
  18958. 1483.29 s [extra] [20 of 22] Compiling System.Time.Extra ( src/System/Time/Extra.hs, nothing )
  18959. 1483.29 s [extra] [21 of 22] Compiling Extra ( src/Extra.hs, nothing )
  18960. 1483.35 s [extra] [22 of 22] Compiling Text.Read.Extra ( src/Text/Read/Extra.hs, nothing )
  18961. 1483.35 s [extra] Haddock coverage:
  18962. 1483.35 s [extra] 100% ( 6 / 6) in 'Data.IORef.Extra'
  18963. 1483.35 s [extra] 100% ( 4 / 4) in 'Data.Monoid.Extra'
  18964. 1483.35 s [extra] Warning: 'Arrow' is out of scope.
  18965. 1483.35 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  18966. 1483.35 s [extra] 100% ( 28 / 28) in 'Data.Tuple.Extra'
  18967. 1483.35 s [extra] 100% ( 2 / 2) in 'Data.Typeable.Extra'
  18968. 1483.36 s [extra] 100% ( 7 / 7) in 'Numeric.Extra'
  18969. 1483.36 s [extra] Warning: '(:)' is out of scope.
  18970. 1483.36 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  18971. 1483.36 s [extra] Warning: 'unzip' is ambiguous. It is defined
  18972. 1483.36 s [extra] * in ‘Data.Functor’
  18973. 1483.36 s [extra] * in ‘GHC.List’
  18974. 1483.36 s [extra] You may be able to disambiguate the identifier by qualifying it or
  18975. 1483.36 s [extra] by specifying the type/value namespace explicitly.
  18976. 1483.36 s [extra] Defaulting to the one defined in ‘GHC.List’
  18977. 1483.36 s [extra] Warning: 'firstJustM' is out of scope.
  18978. 1483.36 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  18979. 1483.37 s [extra] 100% ( 85 / 85) in 'Data.List.Extra'
  18980. 1483.37 s [extra] Warning: 'Version' is ambiguous. It is defined
  18981. 1483.37 s [extra] * in ‘Data.Version’
  18982. 1483.37 s [extra] * in ‘Data.Version’
  18983. 1483.37 s [extra] You may be able to disambiguate the identifier by qualifying it or
  18984. 1483.37 s [extra] by specifying the type/value namespace explicitly.
  18985. 1483.37 s [extra] Defaulting to the one defined in ‘Data.Version’
  18986. 1483.37 s [extra] 100% ( 3 / 3) in 'Data.Version.Extra'
  18987. 1483.37 s [extra] Warning: 'length' is ambiguous. It is defined
  18988. 1483.37 s [extra] * in ‘Data.Foldable’
  18989. 1483.37 s [extra] * in ‘Data.List.NonEmpty’
  18990. 1483.37 s [extra] You may be able to disambiguate the identifier by qualifying it or
  18991. 1483.37 s [extra] by specifying the type/value namespace explicitly.
  18992. 1483.37 s [extra] Defaulting to the one defined in ‘Data.List.NonEmpty’
  18993. 1483.37 s [extra] 100% ( 23 / 23) in 'Data.List.NonEmpty.Extra'
  18994. 1483.37 s [extra] Warning: 'fromJust' is out of scope.
  18995. 1483.37 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  18996. 1483.37 s [extra] 100% ( 11 / 11) in 'Data.Either.Extra'
  18997. 1483.37 s [extra] Warning: 'ErrorCall' is ambiguous. It is defined
  18998. 1483.37 s [extra] * in ‘GHC.Exception’
  18999. 1483.37 s [extra] * in ‘GHC.Exception’
  19000. 1483.37 s [extra] You may be able to disambiguate the identifier by qualifying it or
  19001. 1483.37 s [extra] by specifying the type/value namespace explicitly.
  19002. 1483.37 s [extra] Defaulting to the one defined in ‘GHC.Exception’
  19003. 1483.37 s [extra] Warning: 'AssertionFailed' is ambiguous. It is defined
  19004. 1483.37 s [extra] * in ‘GHC.IO.Exception’
  19005. 1483.37 s [extra] * in ‘GHC.IO.Exception’
  19006. 1483.37 s [extra] You may be able to disambiguate the identifier by qualifying it or
  19007. 1483.38 s [extra] by specifying the type/value namespace explicitly.
  19008. 1483.38 s [extra] Defaulting to the one defined in ‘GHC.IO.Exception’
  19009. 1483.38 s [extra] Warning: 'SomeException' is ambiguous. It is defined
  19010. 1483.38 s [extra] * in ‘GHC.Exception.Type’
  19011. 1483.38 s [extra] * in ‘GHC.Exception.Type’
  19012. 1483.38 s [extra] You may be able to disambiguate the identifier by qualifying it or
  19013. 1483.38 s [extra] by specifying the type/value namespace explicitly.
  19014. 1483.38 s [extra] Defaulting to the one defined in ‘GHC.Exception.Type’
  19015. 1483.38 s [extra] 100% ( 21 / 21) in 'Control.Exception.Extra'
  19016. 1483.38 s [extra] Warning: 'partition' is out of scope.
  19017. 1483.38 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  19018. 1483.38 s [extra] Warning: 'mconcatMap' is out of scope.
  19019. 1483.38 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  19020. 1483.38 s [extra] Warning: 'find' is out of scope.
  19021. 1483.38 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  19022. 1483.38 s [extra] 100% ( 40 / 40) in 'Control.Monad.Extra'
  19023. 1483.38 s [extra] 92% ( 13 / 14) in 'Data.Foldable.Extra'
  19024. 1483.38 s [extra] Missing documentation for:
  19025. 1483.38 s [extra] Module header
  19026. 1483.38 s [extra] Warning: 'Lock' is ambiguous. It is defined
  19027. 1483.38 s [extra] * at src/Control/Concurrent/Extra.hs:106:16
  19028. 1483.38 s [extra] * at src/Control/Concurrent/Extra.hs:106:1
  19029. 1483.38 s [extra] You may be able to disambiguate the identifier by qualifying it or
  19030. 1483.38 s [extra] by specifying the type/value namespace explicitly.
  19031. 1483.38 s [extra] Defaulting to the one defined at src/Control/Concurrent/Extra.hs:106:1
  19032. 1483.38 s [extra] Warning: 'Var' is ambiguous. It is defined
  19033. 1483.38 s [extra] * at src/Control/Concurrent/Extra.hs:146:17
  19034. 1483.38 s [extra] * at src/Control/Concurrent/Extra.hs:146:1
  19035. 1483.38 s [extra] You may be able to disambiguate the identifier by qualifying it or
  19036. 1483.38 s [extra] by specifying the type/value namespace explicitly.
  19037. 1483.38 s [extra] Defaulting to the one defined at src/Control/Concurrent/Extra.hs:146:1
  19038. 1483.38 s [extra] Warning: 'Barrier' is ambiguous. It is defined
  19039. 1483.38 s [extra] * at src/Control/Concurrent/Extra.hs:210:21
  19040. 1483.38 s [extra] * at src/Control/Concurrent/Extra.hs:210:1
  19041. 1483.38 s [extra] You may be able to disambiguate the identifier by qualifying it or
  19042. 1483.38 s [extra] by specifying the type/value namespace explicitly.
  19043. 1483.38 s [extra] Defaulting to the one defined at src/Control/Concurrent/Extra.hs:210:1
  19044. 1483.39 s [extra] 100% ( 27 / 27) in 'Control.Concurrent.Extra'
  19045. 1483.39 s [extra] 100% ( 8 / 8) in 'System.Directory.Extra'
  19046. 1483.39 s [extra] 100% ( 2 / 2) in 'System.Environment.Extra'
  19047. 1483.39 s [extra] 100% ( 26 / 26) in 'System.IO.Extra'
  19048. 1483.39 s [extra] 100% ( 4 / 4) in 'System.Info.Extra'
  19049. 1483.39 s [extra] 100% ( 5 / 5) in 'System.Process.Extra'
  19050. 1483.39 s [extra] 100% ( 8 / 8) in 'System.Time.Extra'
  19051. 1483.40 s [extra] 100% (270 /270) in 'Extra'
  19052. 1483.40 s [extra] 100% ( 2 / 2) in 'Text.Read.Extra'
  19053. 1483.77 s [extra] Warning: Data.Tuple.Extra: could not find link destinations for:
  19054. 1483.77 s [extra] - GHC.Generics.Rep1_Solo
  19055. 1483.77 s [extra] - GHC.Generics.Rep_Solo
  19056. 1487.52 s [extra] Documentation created: dist/doc/html/extra/, dist/doc/html/extra/extra.txt
  19057. 1487.58 s [extra] Preprocessing test suite 'extra-test' for extra-1.8.1..
  19058. 1487.59 s [extra] Phase: installPhase
  19059. 1487.66 s [extra] Installing library in /nix/store/irwq1wrpxjvkjsg6d6xjnxpdkaw5qpwc-extra-1.8.1/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/extra-1.8.1-CYkQRzu1AaDDqBLND76rc2
  19060. 1488.13 s [extra] Phase: fixupPhase
  19061. 1488.15 s [extra] shrinking RPATHs of ELF executables and libraries in /nix/store/irwq1wrpxjvkjsg6d6xjnxpdkaw5qpwc-extra-1.8.1
  19062. 1488.22 s [extra] shrinking /nix/store/irwq1wrpxjvkjsg6d6xjnxpdkaw5qpwc-extra-1.8.1/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/libHSextra-1.8.1-CYkQRzu1AaDDqBLND76rc2-ghc9.8.4.so
  19063. 1488.22 s [extra] checking for references to /build/ in /nix/store/irwq1wrpxjvkjsg6d6xjnxpdkaw5qpwc-extra-1.8.1...
  19064. 1488.22 s [extra] patching script interpreter paths in /nix/store/irwq1wrpxjvkjsg6d6xjnxpdkaw5qpwc-extra-1.8.1
  19065. 1488.22 s [extra] stripping (with command strip and flags -S -p) in /nix/store/irwq1wrpxjvkjsg6d6xjnxpdkaw5qpwc-extra-1.8.1/lib
  19066. 1488.51 s [extra] shrinking RPATHs of ELF executables and libraries in /nix/store/iy9fydmmljmkxvxmdqdg966r0isvhhq2-extra-1.8.1-doc
  19067. 1488.52 s [extra] checking for references to /build/ in /nix/store/iy9fydmmljmkxvxmdqdg966r0isvhhq2-extra-1.8.1-doc...
  19068. 1488.56 s [extra] patching script interpreter paths in /nix/store/iy9fydmmljmkxvxmdqdg966r0isvhhq2-extra-1.8.1-doc
  19069. 1488.69 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/irwq1wrpxjvkjsg6d6xjnxpdkaw5qpwc-extra-1.8.1 /nix/store/iy9fydmmljmkxvxmdqdg966r0isvhhq2-extra-1.8.1-doc
  19070. 1489.15 s [post-build-hook] Nothing to push - all store paths are already on Cachix.
  19071. 1489.17 s [post-build-hook] Uploading to the NixCI cache: /nix/store/irwq1wrpxjvkjsg6d6xjnxpdkaw5qpwc-extra-1.8.1 /nix/store/iy9fydmmljmkxvxmdqdg966r0isvhhq2-extra-1.8.1-doc
  19072. 1489.22 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  19073. 1489.32 s [post-build-hook] copying 1 paths...
  19074. 1489.32 s [post-build-hook] copying path '/nix/store/irwq1wrpxjvkjsg6d6xjnxpdkaw5qpwc-extra-1.8.1' to 'https://cache.nix-ci.com'...
  19075. 1490.79 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  19076. 1490.93 s [post-build-hook] copying 0 paths...
  19077. 1490.95 s Progress: 13 of 19 built, 160 of 160 downloaded from cache
  19078. 1491.03 s Building algebraic-graphs
  19079. 1491.13 s [algebraic-graphs] Phase: setupCompilerEnvironmentPhase
  19080. 1491.13 s [algebraic-graphs] Build with /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4.
  19081. 1491.30 s [algebraic-graphs] Phase: unpackPhase
  19082. 1491.30 s [algebraic-graphs] unpacking source archive /nix/store/gfjyfw1hcshbfclk91difmkphwib8nbd-algebraic-graphs-0.7.tar.gz
  19083. 1491.32 s [algebraic-graphs] source root is algebraic-graphs-0.7
  19084. 1491.33 s [algebraic-graphs] setting SOURCE_DATE_EPOCH to timestamp 1655769405 of file "algebraic-graphs-0.7/test/Data/Graph/Test/Typed.hs"
  19085. 1491.34 s [algebraic-graphs] Phase: patchPhase
  19086. 1491.34 s [algebraic-graphs] Replace Cabal file with edited version from mirror://hackage/algebraic-graphs-0.7/revision/3.cabal.
  19087. 1491.35 s [algebraic-graphs] applying patch /nix/store/fgaciccwb2z0jmfhs30a1vq03azpd9qd-algebraic-graphs-0.7-allow-inspection-testing-0.6.patch
  19088. 1491.35 s [algebraic-graphs] patching file algebraic-graphs.cabal
  19089. 1491.35 s [algebraic-graphs] Phase: compileBuildDriverPhase
  19090. 1491.36 s [algebraic-graphs] setupCompileFlags: -package-db=/build/tmp.wro33Wut9L/setup-package.conf.d -threaded
  19091. 1491.39 s [algebraic-graphs] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.wro33Wut9L/Main.o )
  19092. 1491.46 s [algebraic-graphs] [2 of 2] Linking Setup
  19093. 1492.69 s [algebraic-graphs] Phase: updateAutotoolsGnuConfigScriptsPhase
  19094. 1492.71 s [algebraic-graphs] Phase: configurePhase
  19095. 1492.71 s [algebraic-graphs] configureFlags: --verbose --prefix=/nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/791bmb2szx0fs4lnydlqh9rsmp0r0fgb-algebraic-graphs-0.7-doc/share/doc/algebraic-graphs-0.7 --with-gcc=gcc --package-db=/build/tmp.wro33Wut9L/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/xp8g8298vbm4k9ipj14xf1r4rh899hr4-ncurses-6.5/lib --extra-lib-dirs=/nix/store/wxm6pczq28ppr7ffwclsl6njbzzr48zf-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/3f0hp921ncxr249f5lmspc8silkqr8f7-elfutils-0.194/lib --extra-lib-dirs=/nix/store/km81slwkcc82dbwywl10gpffjb78g6ni-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/fvsl0b39y6ns2z66gfvc2raca3b5wr18-numactl-2.0.18/lib --extra-lib-dirs=/nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/lib
  19096. 1492.72 s [algebraic-graphs] Using Parsec parser
  19097. 1492.72 s [algebraic-graphs] Configuring algebraic-graphs-0.7...
  19098. 1493.03 s [algebraic-graphs] Dependency array >=0.4 && <0.6: using array-0.5.8.0
  19099. 1493.03 s [algebraic-graphs] Dependency base >=4.11 && <5: using base-4.19.2.0
  19100. 1493.03 s [algebraic-graphs] Dependency containers >=0.5.5.1 && <0.8: using containers-0.6.8
  19101. 1493.03 s [algebraic-graphs] Dependency deepseq >=1.3.0.1 && <1.6: using deepseq-1.5.1.0
  19102. 1493.03 s [algebraic-graphs] Dependency transformers >=0.4 && <0.7: using transformers-0.6.1.0
  19103. 1493.03 s [algebraic-graphs] Dependency QuickCheck >=2.14 && <2.16: using QuickCheck-2.15.0.1
  19104. 1493.03 s [algebraic-graphs] Dependency algebraic-graphs: using algebraic-graphs-0.7
  19105. 1493.03 s [algebraic-graphs] Dependency array >=0.4 && <0.6: using array-0.5.8.0
  19106. 1493.03 s [algebraic-graphs] Dependency base >=4.11 && <5: using base-4.19.2.0
  19107. 1493.03 s [algebraic-graphs] Dependency containers >=0.5.5.1 && <0.8: using containers-0.6.8
  19108. 1493.03 s [algebraic-graphs] Dependency deepseq >=1.3.0.1 && <1.6: using deepseq-1.5.1.0
  19109. 1493.03 s [algebraic-graphs] Dependency extra >=1.4 && <2: using extra-1.8.1
  19110. 1493.03 s [algebraic-graphs] Dependency inspection-testing >=0.4.2.2 && <0.7: using
  19111. 1493.03 s [algebraic-graphs] inspection-testing-0.6.2
  19112. 1493.03 s [algebraic-graphs] Dependency transformers >=0.4 && <0.7: using transformers-0.6.1.0
  19113. 1493.27 s [algebraic-graphs] Source component graph:
  19114. 1493.32 s [algebraic-graphs] component lib
  19115. 1493.32 s [algebraic-graphs] component test:main dependency lib
  19116. 1493.32 s [algebraic-graphs] Configured component graph:
  19117. 1493.32 s [algebraic-graphs] component algebraic-graphs-0.7-FivNbIKLMvMFivhqM96Qyy
  19118. 1493.32 s [algebraic-graphs] include array-0.5.8.0-34d4
  19119. 1493.32 s [algebraic-graphs] include base-4.19.2.0-a4d2
  19120. 1493.32 s [algebraic-graphs] include containers-0.6.8-1373
  19121. 1493.32 s [algebraic-graphs] include deepseq-1.5.1.0-2184
  19122. 1493.32 s [algebraic-graphs] include transformers-0.6.1.0-8f1d
  19123. 1493.32 s [algebraic-graphs] component algebraic-graphs-0.7-HvC9ceAArYk6dSETtUgAEo-main
  19124. 1493.32 s [algebraic-graphs] include QuickCheck-2.15.0.1-2BdQuHKQVeZ1bFh8DuLq55
  19125. 1493.32 s [algebraic-graphs] include algebraic-graphs-0.7-FivNbIKLMvMFivhqM96Qyy
  19126. 1493.32 s [algebraic-graphs] include array-0.5.8.0-34d4
  19127. 1493.32 s [algebraic-graphs] include base-4.19.2.0-a4d2
  19128. 1493.32 s [algebraic-graphs] include containers-0.6.8-1373
  19129. 1493.32 s [algebraic-graphs] include deepseq-1.5.1.0-2184
  19130. 1493.32 s [algebraic-graphs] include extra-1.8.1-CYkQRzu1AaDDqBLND76rc2
  19131. 1493.32 s [algebraic-graphs] include inspection-testing-0.6.2-8SAwNUls9Z1FYZ1VNS58RS
  19132. 1493.32 s [algebraic-graphs] include transformers-0.6.1.0-8f1d
  19133. 1493.32 s [algebraic-graphs] Linked component graph:
  19134. 1493.32 s [algebraic-graphs] unit algebraic-graphs-0.7-FivNbIKLMvMFivhqM96Qyy
  19135. 1493.32 s [algebraic-graphs] include array-0.5.8.0-34d4
  19136. 1493.32 s [algebraic-graphs] include base-4.19.2.0-a4d2
  19137. 1493.32 s [algebraic-graphs] include containers-0.6.8-1373
  19138. 1493.32 s [algebraic-graphs] include deepseq-1.5.1.0-2184
  19139. 1493.32 s [algebraic-graphs] include transformers-0.6.1.0-8f1d
  19140. 1493.32 s [algebraic-graphs] Algebra.Graph=algebraic-graphs-0.7-FivNbIKLMvMFivhqM96Qyy:Algebra.Graph,Algebra.Graph.Acyclic.AdjacencyMap=algebraic-graphs-0.7-FivNbIKLMvMFivhqM96Qyy:Algebra.Graph.Acyclic.AdjacencyMap,Algebra.Graph.AdjacencyIntMap=algebraic-graphs-0.7-FivNbIKLMvMFivhqM96Qyy:Algebra.Graph.AdjacencyIntMap,Algebra.Graph.AdjacencyIntMap.Algorithm=algebraic-graphs-0.7-FivNbIKLMvMFivhqM96Qyy:Algebra.Graph.AdjacencyIntMap.Algorithm,Algebra.Graph.AdjacencyMap=algebraic-graphs-0.7-FivNbIKLMvMFivhqM96Qyy:Algebra.Graph.AdjacencyMap,Algebra.Graph.AdjacencyMap.Algorithm=algebraic-graphs-0.7-FivNbIKLMvMFivhqM96Qyy:Algebra.Graph.AdjacencyMap.Algorithm,Algebra.Graph.Bipartite.AdjacencyMap=algebraic-graphs-0.7-FivNbIKLMvMFivhqM96Qyy:Algebra.Graph.Bipartite.AdjacencyMap,Algebra.Graph.Bipartite.AdjacencyMap.Algorithm=algebraic-graphs-0.7-FivNbIKLMvMFivhqM96Qyy:Algebra.Graph.Bipartite.AdjacencyMap.Algorithm,Algebra.Graph.Class=algebraic-graphs-0.7-FivNbIKLMvMFivhqM96Qyy:Algebra.Graph.Class,Algebra.Graph.Example.Todo=algebraic-graphs-0.7-FivNbIKLMvMFivhqM96Qyy:Algebra.Graph.Example.Todo,Algebra.Graph.Export=algebraic-graphs-0.7-FivNbIKLMvMFivhqM96Qyy:Algebra.Graph.Export,Algebra.Graph.Export.Dot=algebraic-graphs-0.7-FivNbIKLMvMFivhqM96Qyy:Algebra.Graph.Export.Dot,Algebra.Graph.HigherKinded.Class=algebraic-graphs-0.7-FivNbIKLMvMFivhqM96Qyy:Algebra.Graph.HigherKinded.Class,Algebra.Graph.Internal=algebraic-graphs-0.7-FivNbIKLMvMFivhqM96Qyy:Algebra.Graph.Internal,Algebra.Graph.Label=algebraic-graphs-0.7-FivNbIKLMvMFivhqM96Qyy:Algebra.Graph.Label,Algebra.Graph.Labelled=algebraic-graphs-0.7-FivNbIKLMvMFivhqM96Qyy:Algebra.Graph.Labelled,Algebra.Graph.Labelled.AdjacencyMap=algebraic-graphs-0.7-FivNbIKLMvMFivhqM96Qyy:Algebra.Graph.Labelled.AdjacencyMap,Algebra.Graph.Labelled.Example.Automaton=algebraic-graphs-0.7-FivNbIKLMvMFivhqM96Qyy:Algebra.Graph.Labelled.Example.Automaton,Algebra.Graph.Labelled.Example.Network=algebraic-graphs-0.7-FivNbIKLMvMFivhqM96Qyy:Algebra.Graph.Labelled.Example.Network,Algebra.Graph.NonEmpty=algebraic-graphs-0.7-FivNbIKLMvMFivhqM96Qyy:Algebra.Graph.NonEmpty,Algebra.Graph.NonEmpty.AdjacencyMap=algebraic-graphs-0.7-FivNbIKLMvMFivhqM96Qyy:Algebra.Graph.NonEmpty.AdjacencyMap,Algebra.Graph.Relation=algebraic-graphs-0.7-FivNbIKLMvMFivhqM96Qyy:Algebra.Graph.Relation,Algebra.Graph.Relation.Preorder=algebraic-graphs-0.7-FivNbIKLMvMFivhqM96Qyy:Algebra.Graph.Relation.Preorder,Algebra.Graph.Relation.Reflexive=algebraic-graphs-0.7-FivNbIKLMvMFivhqM96Qyy:Algebra.Graph.Relation.Reflexive,Algebra.Graph.Relation.Symmetric=algebraic-graphs-0.7-FivNbIKLMvMFivhqM96Qyy:Algebra.Graph.Relation.Symmetric,Algebra.Graph.Relation.Transitive=algebraic-graphs-0.7-FivNbIKLMvMFivhqM96Qyy:Algebra.Graph.Relation.Transitive,Algebra.Graph.ToGraph=algebraic-graphs-0.7-FivNbIKLMvMFivhqM96Qyy:Algebra.Graph.ToGraph,Algebra.Graph.Undirected=algebraic-graphs-0.7-FivNbIKLMvMFivhqM96Qyy:Algebra.Graph.Undirected,Data.Graph.Typed=algebraic-graphs-0.7-FivNbIKLMvMFivhqM96Qyy:Data.Graph.Typed
  19141. 1493.32 s [algebraic-graphs] unit algebraic-graphs-0.7-HvC9ceAArYk6dSETtUgAEo-main
  19142. 1493.32 s [algebraic-graphs] include QuickCheck-2.15.0.1-2BdQuHKQVeZ1bFh8DuLq55
  19143. 1493.32 s [algebraic-graphs] include algebraic-graphs-0.7-FivNbIKLMvMFivhqM96Qyy
  19144. 1493.32 s [algebraic-graphs] include array-0.5.8.0-34d4
  19145. 1493.32 s [algebraic-graphs] include base-4.19.2.0-a4d2
  19146. 1493.32 s [algebraic-graphs] include containers-0.6.8-1373
  19147. 1493.32 s [algebraic-graphs] include deepseq-1.5.1.0-2184
  19148. 1493.32 s [algebraic-graphs] include extra-1.8.1-CYkQRzu1AaDDqBLND76rc2
  19149. 1493.32 s [algebraic-graphs] include inspection-testing-0.6.2-8SAwNUls9Z1FYZ1VNS58RS
  19150. 1493.32 s [algebraic-graphs] include transformers-0.6.1.0-8f1d
  19151. 1493.32 s [algebraic-graphs] Ready component graph:
  19152. 1493.32 s [algebraic-graphs] definite algebraic-graphs-0.7-FivNbIKLMvMFivhqM96Qyy
  19153. 1493.32 s [algebraic-graphs] depends array-0.5.8.0-34d4
  19154. 1493.32 s [algebraic-graphs] depends base-4.19.2.0-a4d2
  19155. 1493.32 s [algebraic-graphs] depends containers-0.6.8-1373
  19156. 1493.32 s [algebraic-graphs] depends deepseq-1.5.1.0-2184
  19157. 1493.32 s [algebraic-graphs] depends transformers-0.6.1.0-8f1d
  19158. 1493.32 s [algebraic-graphs] definite algebraic-graphs-0.7-HvC9ceAArYk6dSETtUgAEo-main
  19159. 1493.32 s [algebraic-graphs] depends QuickCheck-2.15.0.1-2BdQuHKQVeZ1bFh8DuLq55
  19160. 1493.32 s [algebraic-graphs] depends algebraic-graphs-0.7-FivNbIKLMvMFivhqM96Qyy
  19161. 1493.32 s [algebraic-graphs] depends array-0.5.8.0-34d4
  19162. 1493.32 s [algebraic-graphs] depends base-4.19.2.0-a4d2
  19163. 1493.32 s [algebraic-graphs] depends containers-0.6.8-1373
  19164. 1493.32 s [algebraic-graphs] depends deepseq-1.5.1.0-2184
  19165. 1493.32 s [algebraic-graphs] depends extra-1.8.1-CYkQRzu1AaDDqBLND76rc2
  19166. 1493.32 s [algebraic-graphs] depends inspection-testing-0.6.2-8SAwNUls9Z1FYZ1VNS58RS
  19167. 1493.32 s [algebraic-graphs] depends transformers-0.6.1.0-8f1d
  19168. 1493.32 s [algebraic-graphs] Using Cabal-3.10.3.0 compiled by ghc-9.8
  19169. 1493.32 s [algebraic-graphs] Using compiler: ghc-9.8.4
  19170. 1493.32 s [algebraic-graphs] Using install prefix:
  19171. 1493.32 s [algebraic-graphs] /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7
  19172. 1493.32 s [algebraic-graphs] Executables installed in:
  19173. 1493.32 s [algebraic-graphs] /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7/bin
  19174. 1493.32 s [algebraic-graphs] Libraries installed in:
  19175. 1493.32 s [algebraic-graphs] /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/algebraic-graphs-0.7-FivNbIKLMvMFivhqM96Qyy
  19176. 1493.32 s [algebraic-graphs] Dynamic Libraries installed in:
  19177. 1493.32 s [algebraic-graphs] /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4
  19178. 1493.32 s [algebraic-graphs] Private executables installed in:
  19179. 1493.32 s [algebraic-graphs] /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7/libexec/x86_64-linux-ghc-9.8.4/algebraic-graphs-0.7
  19180. 1493.32 s [algebraic-graphs] Data files installed in:
  19181. 1493.32 s [algebraic-graphs] /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7/share/x86_64-linux-ghc-9.8.4/algebraic-graphs-0.7
  19182. 1493.32 s [algebraic-graphs] Documentation installed in:
  19183. 1493.32 s [algebraic-graphs] /nix/store/791bmb2szx0fs4lnydlqh9rsmp0r0fgb-algebraic-graphs-0.7-doc/share/doc/algebraic-graphs-0.7
  19184. 1493.32 s [algebraic-graphs] Configuration files installed in:
  19185. 1493.32 s [algebraic-graphs] /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7/etc
  19186. 1493.32 s [algebraic-graphs] No alex found
  19187. 1493.32 s [algebraic-graphs] Using ar found on system at:
  19188. 1493.32 s [algebraic-graphs] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
  19189. 1493.32 s [algebraic-graphs] No c2hs found
  19190. 1493.32 s [algebraic-graphs] No cpphs found
  19191. 1493.32 s [algebraic-graphs] No doctest found
  19192. 1493.32 s [algebraic-graphs] Using gcc version 14.3.0 given by user at:
  19193. 1493.32 s [algebraic-graphs] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
  19194. 1493.32 s [algebraic-graphs] Using ghc version 9.8.4 found on system at:
  19195. 1493.32 s [algebraic-graphs] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/ghc
  19196. 1493.32 s [algebraic-graphs] Using ghc-pkg version 9.8.4 found on system at:
  19197. 1493.32 s [algebraic-graphs] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/ghc-pkg-9.8.4
  19198. 1493.32 s [algebraic-graphs] No ghcjs found
  19199. 1493.32 s [algebraic-graphs] No ghcjs-pkg found
  19200. 1493.32 s [algebraic-graphs] No greencard found
  19201. 1493.32 s [algebraic-graphs] Using haddock version 2.30.0 found on system at:
  19202. 1493.32 s [algebraic-graphs] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/haddock-ghc-9.8.4
  19203. 1493.32 s [algebraic-graphs] No happy found
  19204. 1493.32 s [algebraic-graphs] Using haskell-suite found on system at: haskell-suite-dummy-location
  19205. 1493.32 s [algebraic-graphs] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  19206. 1493.33 s [algebraic-graphs] No hmake found
  19207. 1493.33 s [algebraic-graphs] Using hpc version 0.69 found on system at:
  19208. 1493.33 s [algebraic-graphs] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/hpc-ghc-9.8.4
  19209. 1493.33 s [algebraic-graphs] Using hsc2hs version 0.68.10 found on system at:
  19210. 1493.33 s [algebraic-graphs] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/hsc2hs-ghc-9.8.4
  19211. 1493.33 s [algebraic-graphs] Using hscolour version 1.25 found on system at:
  19212. 1493.33 s [algebraic-graphs] /nix/store/vl14mqkz7z183r6sq9qz932j3pix6v5c-hscolour-1.25/bin/HsColour
  19213. 1493.33 s [algebraic-graphs] No jhc found
  19214. 1493.33 s [algebraic-graphs] Using ld found on system at:
  19215. 1493.33 s [algebraic-graphs] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ld.gold
  19216. 1493.33 s [algebraic-graphs] No pkg-config found
  19217. 1493.33 s [algebraic-graphs] Using runghc version 9.8.4 found on system at:
  19218. 1493.33 s [algebraic-graphs] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/runghc-9.8.4
  19219. 1493.33 s [algebraic-graphs] Using strip version 2.44 found on system at:
  19220. 1493.33 s [algebraic-graphs] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
  19221. 1493.33 s [algebraic-graphs] Using tar found on system at:
  19222. 1493.33 s [algebraic-graphs] /nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
  19223. 1493.33 s [algebraic-graphs] No uhc found
  19224. 1493.42 s [algebraic-graphs] Phase: buildPhase
  19225. 1493.47 s [algebraic-graphs] Preprocessing library for algebraic-graphs-0.7..
  19226. 1493.47 s [algebraic-graphs] Building library for algebraic-graphs-0.7..
  19227. 1493.58 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 )
  19228. 1494.59 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 )
  19229. 1495.30 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 )
  19230. 1495.64 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 )
  19231. 1495.64 s [algebraic-graphs] [ 5 of 29] Compiling Algebra.Graph ( src/Algebra/Graph.hs, dist/build/Algebra/Graph.o, dist/build/Algebra/Graph.dyn_o )
  19232. 1496.89 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 )
  19233. 1497.16 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 )
  19234. 1497.69 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 )
  19235. 1498.33 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 )
  19236. 1498.40 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 )
  19237. 1498.40 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 )
  19238. 1498.40 s [algebraic-graphs]
  19239. 1498.40 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:384:43: warning: [GHC-63394] [-Wx-partial]
  19240. 1498.40 s [algebraic-graphs] In the use of ‘head’
  19241. 1498.40 s [algebraic-graphs] (imported from Prelude, but defined in GHC.List):
  19242. 1498.40 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
  19243. 1498.40 s [algebraic-graphs] |
  19244. 1498.40 s [algebraic-graphs] 384 | exit v = do newComponent <- (v==).snd.head <$> gets boundaryStack
  19245. 1498.40 s [algebraic-graphs] | ^^^^
  19246. 1498.40 s [algebraic-graphs]
  19247. 1498.40 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:391:21: warning: [GHC-63394] [-Wx-partial]
  19248. 1498.40 s [algebraic-graphs] In the use of ‘tail’
  19249. 1498.40 s [algebraic-graphs] (imported from Prelude, but defined in GHC.List):
  19250. 1498.40 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
  19251. 1498.40 s [algebraic-graphs] |
  19252. 1498.40 s [algebraic-graphs] 391 | pth' = tail v_pth' -- Here we know that v_pth' starts with v
  19253. 1498.40 s [algebraic-graphs] | ^^^^
  19254. 1498.40 s [algebraic-graphs]
  19255. 1498.40 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:395:26: warning: [GHC-63394] [-Wx-partial]
  19256. 1498.40 s [algebraic-graphs] In the use of ‘head’
  19257. 1498.40 s [algebraic-graphs] (imported from Prelude, but defined in GHC.List):
  19258. 1498.40 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
  19259. 1498.41 s [algebraic-graphs] |
  19260. 1498.41 s [algebraic-graphs] 395 | p_v = fst $ head bnd
  19261. 1498.41 s [algebraic-graphs] | ^^^^
  19262. 1498.41 s [algebraic-graphs]
  19263. 1498.41 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:397:21: warning: [GHC-63394] [-Wx-partial]
  19264. 1498.41 s [algebraic-graphs] In the use of ‘tail’
  19265. 1498.41 s [algebraic-graphs] (imported from Prelude, but defined in GHC.List):
  19266. 1498.41 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
  19267. 1498.41 s [algebraic-graphs] |
  19268. 1498.41 s [algebraic-graphs] 397 | bnd' = tail bnd
  19269. 1498.41 s [algebraic-graphs] | ^^^^
  19270. 1498.41 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 )
  19271. 1498.41 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 )
  19272. 1498.41 s [algebraic-graphs]
  19273. 1498.41 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:171:32: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19274. 1498.41 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19275. 1498.41 s [algebraic-graphs] will become an error in a future GHC release.
  19276. 1498.41 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19277. 1498.41 s [algebraic-graphs] |
  19278. 1498.41 s [algebraic-graphs] 171 | vertexIntSet :: ToVertex t ~ Int => t -> IntSet
  19279. 1498.41 s [algebraic-graphs] | ^
  19280. 1498.41 s [algebraic-graphs]
  19281. 1498.41 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:197:29: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19282. 1498.41 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19283. 1498.41 s [algebraic-graphs] will become an error in a future GHC release.
  19284. 1498.41 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19285. 1498.41 s [algebraic-graphs] |
  19286. 1498.41 s [algebraic-graphs] 197 | preIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  19287. 1498.41 s [algebraic-graphs] | ^
  19288. 1498.41 s [algebraic-graphs]
  19289. 1498.41 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:215:30: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19290. 1498.41 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19291. 1498.41 s [algebraic-graphs] will become an error in a future GHC release.
  19292. 1498.41 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19293. 1498.41 s [algebraic-graphs] |
  19294. 1498.41 s [algebraic-graphs] 215 | postIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  19295. 1498.41 s [algebraic-graphs] | ^
  19296. 1498.41 s [algebraic-graphs]
  19297. 1498.41 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:303:37: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19298. 1498.41 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19299. 1498.41 s [algebraic-graphs] will become an error in a future GHC release.
  19300. 1498.41 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19301. 1498.41 s [algebraic-graphs] |
  19302. 1498.41 s [algebraic-graphs] 303 | toAdjacencyIntMap :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  19303. 1498.41 s [algebraic-graphs] | ^
  19304. 1498.41 s [algebraic-graphs]
  19305. 1498.41 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:312:46: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19306. 1498.41 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19307. 1498.41 s [algebraic-graphs] will become an error in a future GHC release.
  19308. 1498.41 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19309. 1498.41 s [algebraic-graphs] |
  19310. 1498.41 s [algebraic-graphs] 312 | toAdjacencyIntMapTranspose :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  19311. 1498.41 s [algebraic-graphs] | ^
  19312. 1498.41 s [algebraic-graphs]
  19313. 1498.41 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:452:43: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19314. 1498.41 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19315. 1498.41 s [algebraic-graphs] will become an error in a future GHC release.
  19316. 1498.41 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19317. 1498.41 s [algebraic-graphs] |
  19318. 1498.41 s [algebraic-graphs] 452 | adjacencyIntMap :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  19319. 1498.41 s [algebraic-graphs] | ^
  19320. 1498.41 s [algebraic-graphs]
  19321. 1498.41 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:471:52: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19322. 1498.41 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19323. 1498.41 s [algebraic-graphs] will become an error in a future GHC release.
  19324. 1498.41 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19325. 1498.41 s [algebraic-graphs] |
  19326. 1498.41 s [algebraic-graphs] 471 | adjacencyIntMapTranspose :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  19327. 1498.41 s [algebraic-graphs] | ^
  19328. 1498.41 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 )
  19329. 1498.62 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 )
  19330. 1498.94 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 )
  19331. 1498.95 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 )
  19332. 1498.95 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 )
  19333. 1499.74 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 )
  19334. 1499.98 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 )
  19335. 1500.14 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 )
  19336. 1500.14 s [algebraic-graphs]
  19337. 1500.14 s [algebraic-graphs] src/Algebra/Graph/Export.hs:185:41: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19338. 1500.14 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19339. 1500.14 s [algebraic-graphs] will become an error in a future GHC release.
  19340. 1500.14 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19341. 1500.14 s [algebraic-graphs] |
  19342. 1500.14 s [algebraic-graphs] 185 | export :: (Ord a, ToGraph g, ToVertex g ~ a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
  19343. 1500.14 s [algebraic-graphs] | ^
  19344. 1500.14 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 )
  19345. 1500.14 s [algebraic-graphs]
  19346. 1500.14 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:121:63: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19347. 1500.14 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19348. 1500.14 s [algebraic-graphs] will become an error in a future GHC release.
  19349. 1500.14 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19350. 1500.14 s [algebraic-graphs] |
  19351. 1500.14 s [algebraic-graphs] 121 | export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g ~ a) => Style a s -> g -> s
  19352. 1500.14 s [algebraic-graphs] | ^
  19353. 1500.14 s [algebraic-graphs]
  19354. 1500.14 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:165:78: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19355. 1500.14 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19356. 1500.14 s [algebraic-graphs] will become an error in a future GHC release.
  19357. 1500.14 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19358. 1500.14 s [algebraic-graphs] |
  19359. 1500.14 s [algebraic-graphs] 165 | exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g ~ s) => g -> s
  19360. 1500.14 s [algebraic-graphs] | ^
  19361. 1500.14 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 )
  19362. 1500.14 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 )
  19363. 1500.14 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 )
  19364. 1500.85 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 )
  19365. 1500.85 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 )
  19366. 1500.85 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 )
  19367. 1500.85 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 )
  19368. 1501.11 s [algebraic-graphs] [ 1 of 29] Compiling Algebra.Graph.AdjacencyMap ( src/Algebra/Graph/AdjacencyMap.hs, dist/build/Algebra/Graph/AdjacencyMap.p_o )
  19369. 1502.11 s [algebraic-graphs] [ 2 of 29] Compiling Algebra.Graph.AdjacencyIntMap ( src/Algebra/Graph/AdjacencyIntMap.hs, dist/build/Algebra/Graph/AdjacencyIntMap.p_o )
  19370. 1503.01 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 )
  19371. 1503.44 s [algebraic-graphs] [ 4 of 29] Compiling Algebra.Graph.Internal ( src/Algebra/Graph/Internal.hs, dist/build/Algebra/Graph/Internal.p_o )
  19372. 1503.44 s [algebraic-graphs] [ 5 of 29] Compiling Algebra.Graph ( src/Algebra/Graph.hs, dist/build/Algebra/Graph.p_o )
  19373. 1504.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 )
  19374. 1505.48 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 )
  19375. 1506.06 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 )
  19376. 1507.02 s [algebraic-graphs] [ 9 of 29] Compiling Algebra.Graph.Label ( src/Algebra/Graph/Label.hs, dist/build/Algebra/Graph/Label.p_o )
  19377. 1507.02 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 )
  19378. 1507.02 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 )
  19379. 1507.02 s [algebraic-graphs]
  19380. 1507.02 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:384:43: warning: [GHC-63394] [-Wx-partial]
  19381. 1507.02 s [algebraic-graphs] In the use of ‘head’
  19382. 1507.02 s [algebraic-graphs] (imported from Prelude, but defined in GHC.List):
  19383. 1507.02 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
  19384. 1507.02 s [algebraic-graphs] |
  19385. 1507.02 s [algebraic-graphs] 384 | exit v = do newComponent <- (v==).snd.head <$> gets boundaryStack
  19386. 1507.02 s [algebraic-graphs] | ^^^^
  19387. 1507.02 s [algebraic-graphs]
  19388. 1507.02 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:391:21: warning: [GHC-63394] [-Wx-partial]
  19389. 1507.02 s [algebraic-graphs] In the use of ‘tail’
  19390. 1507.02 s [algebraic-graphs] (imported from Prelude, but defined in GHC.List):
  19391. 1507.02 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
  19392. 1507.02 s [algebraic-graphs] |
  19393. 1507.02 s [algebraic-graphs] 391 | pth' = tail v_pth' -- Here we know that v_pth' starts with v
  19394. 1507.02 s [algebraic-graphs] | ^^^^
  19395. 1507.02 s [algebraic-graphs]
  19396. 1507.02 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:395:26: warning: [GHC-63394] [-Wx-partial]
  19397. 1507.02 s [algebraic-graphs] In the use of ‘head’
  19398. 1507.02 s [algebraic-graphs] (imported from Prelude, but defined in GHC.List):
  19399. 1507.02 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
  19400. 1507.02 s [algebraic-graphs] |
  19401. 1507.02 s [algebraic-graphs] 395 | p_v = fst $ head bnd
  19402. 1507.02 s [algebraic-graphs] | ^^^^
  19403. 1507.02 s [algebraic-graphs]
  19404. 1507.02 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:397:21: warning: [GHC-63394] [-Wx-partial]
  19405. 1507.02 s [algebraic-graphs] In the use of ‘tail’
  19406. 1507.02 s [algebraic-graphs] (imported from Prelude, but defined in GHC.List):
  19407. 1507.02 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
  19408. 1507.02 s [algebraic-graphs] |
  19409. 1507.02 s [algebraic-graphs] 397 | bnd' = tail bnd
  19410. 1507.02 s [algebraic-graphs] | ^^^^
  19411. 1507.02 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 )
  19412. 1507.02 s [algebraic-graphs] [13 of 29] Compiling Algebra.Graph.ToGraph ( src/Algebra/Graph/ToGraph.hs, dist/build/Algebra/Graph/ToGraph.p_o )
  19413. 1507.02 s [algebraic-graphs]
  19414. 1507.02 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:171:32: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19415. 1507.02 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19416. 1507.02 s [algebraic-graphs] will become an error in a future GHC release.
  19417. 1507.02 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19418. 1507.02 s [algebraic-graphs] |
  19419. 1507.02 s [algebraic-graphs] 171 | vertexIntSet :: ToVertex t ~ Int => t -> IntSet
  19420. 1507.02 s [algebraic-graphs] | ^
  19421. 1507.02 s [algebraic-graphs]
  19422. 1507.02 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:197:29: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19423. 1507.02 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19424. 1507.02 s [algebraic-graphs] will become an error in a future GHC release.
  19425. 1507.02 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19426. 1507.02 s [algebraic-graphs] |
  19427. 1507.02 s [algebraic-graphs] 197 | preIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  19428. 1507.02 s [algebraic-graphs] | ^
  19429. 1507.02 s [algebraic-graphs]
  19430. 1507.02 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:215:30: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19431. 1507.02 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19432. 1507.02 s [algebraic-graphs] will become an error in a future GHC release.
  19433. 1507.02 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19434. 1507.02 s [algebraic-graphs] |
  19435. 1507.02 s [algebraic-graphs] 215 | postIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  19436. 1507.02 s [algebraic-graphs] | ^
  19437. 1507.02 s [algebraic-graphs]
  19438. 1507.02 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:303:37: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19439. 1507.02 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19440. 1507.02 s [algebraic-graphs] will become an error in a future GHC release.
  19441. 1507.02 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19442. 1507.02 s [algebraic-graphs] |
  19443. 1507.02 s [algebraic-graphs] 303 | toAdjacencyIntMap :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  19444. 1507.02 s [algebraic-graphs] | ^
  19445. 1507.02 s [algebraic-graphs]
  19446. 1507.02 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:312:46: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19447. 1507.02 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19448. 1507.02 s [algebraic-graphs] will become an error in a future GHC release.
  19449. 1507.02 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19450. 1507.02 s [algebraic-graphs] |
  19451. 1507.02 s [algebraic-graphs] 312 | toAdjacencyIntMapTranspose :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  19452. 1507.02 s [algebraic-graphs] | ^
  19453. 1507.02 s [algebraic-graphs]
  19454. 1507.02 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:452:43: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19455. 1507.02 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19456. 1507.02 s [algebraic-graphs] will become an error in a future GHC release.
  19457. 1507.02 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19458. 1507.02 s [algebraic-graphs] |
  19459. 1507.02 s [algebraic-graphs] 452 | adjacencyIntMap :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  19460. 1507.02 s [algebraic-graphs] | ^
  19461. 1507.02 s [algebraic-graphs]
  19462. 1507.02 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:471:52: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19463. 1507.02 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19464. 1507.02 s [algebraic-graphs] will become an error in a future GHC release.
  19465. 1507.02 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19466. 1507.02 s [algebraic-graphs] |
  19467. 1507.02 s [algebraic-graphs] 471 | adjacencyIntMapTranspose :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  19468. 1507.02 s [algebraic-graphs] | ^
  19469. 1507.02 s [algebraic-graphs] [14 of 29] Compiling Algebra.Graph.Relation ( src/Algebra/Graph/Relation.hs, dist/build/Algebra/Graph/Relation.p_o )
  19470. 1507.26 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 )
  19471. 1507.72 s [algebraic-graphs] [16 of 29] Compiling Algebra.Graph.NonEmpty ( src/Algebra/Graph/NonEmpty.hs, dist/build/Algebra/Graph/NonEmpty.p_o )
  19472. 1507.72 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 )
  19473. 1507.72 s [algebraic-graphs] [18 of 29] Compiling Algebra.Graph.Labelled ( src/Algebra/Graph/Labelled.hs, dist/build/Algebra/Graph/Labelled.p_o )
  19474. 1508.31 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 )
  19475. 1508.65 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 )
  19476. 1508.85 s [algebraic-graphs] [21 of 29] Compiling Algebra.Graph.Export ( src/Algebra/Graph/Export.hs, dist/build/Algebra/Graph/Export.p_o )
  19477. 1508.85 s [algebraic-graphs]
  19478. 1508.85 s [algebraic-graphs] src/Algebra/Graph/Export.hs:185:41: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19479. 1508.85 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19480. 1508.85 s [algebraic-graphs] will become an error in a future GHC release.
  19481. 1508.85 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19482. 1508.85 s [algebraic-graphs] |
  19483. 1508.85 s [algebraic-graphs] 185 | export :: (Ord a, ToGraph g, ToVertex g ~ a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
  19484. 1508.85 s [algebraic-graphs] | ^
  19485. 1508.85 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 )
  19486. 1508.85 s [algebraic-graphs]
  19487. 1508.85 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:121:63: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19488. 1508.85 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19489. 1508.85 s [algebraic-graphs] will become an error in a future GHC release.
  19490. 1508.85 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19491. 1508.85 s [algebraic-graphs] |
  19492. 1508.85 s [algebraic-graphs] 121 | export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g ~ a) => Style a s -> g -> s
  19493. 1508.85 s [algebraic-graphs] | ^
  19494. 1508.85 s [algebraic-graphs]
  19495. 1508.85 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:165:78: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19496. 1508.85 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19497. 1508.85 s [algebraic-graphs] will become an error in a future GHC release.
  19498. 1508.85 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19499. 1508.85 s [algebraic-graphs] |
  19500. 1508.85 s [algebraic-graphs] 165 | exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g ~ s) => g -> s
  19501. 1508.85 s [algebraic-graphs] | ^
  19502. 1508.85 s [algebraic-graphs] [23 of 29] Compiling Algebra.Graph.Undirected ( src/Algebra/Graph/Undirected.hs, dist/build/Algebra/Graph/Undirected.p_o )
  19503. 1508.85 s [algebraic-graphs] [24 of 29] Compiling Algebra.Graph.Class ( src/Algebra/Graph/Class.hs, dist/build/Algebra/Graph/Class.p_o )
  19504. 1508.85 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 )
  19505. 1508.90 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 )
  19506. 1508.96 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 )
  19507. 1508.96 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 )
  19508. 1509.00 s [algebraic-graphs] [29 of 29] Compiling Data.Graph.Typed ( src/Data/Graph/Typed.hs, dist/build/Data/Graph/Typed.p_o )
  19509. 1510.50 s [algebraic-graphs] Preprocessing test suite 'main' for algebraic-graphs-0.7..
  19510. 1510.51 s [algebraic-graphs] Building test suite 'main' for algebraic-graphs-0.7..
  19511. 1510.63 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 )
  19512. 1511.80 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 )
  19513. 1515.07 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 )
  19514. 1515.12 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 )
  19515. 1515.12 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 )
  19516. 1517.92 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 )
  19517. 1517.92 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 )
  19518. 1517.92 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 )
  19519. 1522.54 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 )
  19520. 1522.78 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 )
  19521. 1522.78 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 )
  19522. 1523.92 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 )
  19523. 1523.92 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 )
  19524. 1523.92 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 )
  19525. 1525.54 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 )
  19526. 1525.54 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 )
  19527. 1525.54 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 )
  19528. 1525.54 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 )
  19529. 1525.54 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 )
  19530. 1525.54 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 )
  19531. 1525.54 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:43:1: emptyI === emptyIR passed.
  19532. 1525.54 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:49:1: vertexI === vertexIR passed.
  19533. 1525.54 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:56:1: overlayI === overlayIR passed.
  19534. 1525.54 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:63:1: connectI === connectIR passed.
  19535. 1525.54 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:69:1: overlaysC `hasNoType` GHC.Types.List passed.
  19536. 1525.54 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:76:1: overlaysP === overlaysPR passed.
  19537. 1525.54 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:82:1: verticesCP `hasNoType` GHC.Types.List passed.
  19538. 1525.54 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:83:1: verticesCP `hasNoType` Algebra.Graph.Graph passed.
  19539. 1525.54 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:89:1: connectsC `hasNoType` GHC.Types.List passed.
  19540. 1525.54 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:96:1: connectsP === connectsPR passed.
  19541. 1525.54 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:102:1: isSubgraphOfC `hasNoType` Algebra.Graph.Graph passed.
  19542. 1525.54 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:108:1: cliqueCP `hasNoType` GHC.Types.List passed.
  19543. 1525.54 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:109:1: cliqueCP `hasNoType` Algebra.Graph.Graph passed.
  19544. 1525.54 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:115:1: edgesCP `hasNoType` GHC.Types.List passed.
  19545. 1525.54 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:116:1: edgesCP `hasNoType` Algebra.Graph.Graph passed.
  19546. 1525.54 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:122:1: starCP `hasNoType` GHC.Types.List passed.
  19547. 1525.55 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:123:1: starCP `hasNoType` Algebra.Graph.Graph passed.
  19548. 1525.55 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:130:1: fmapCP `hasNoType` Algebra.Graph.Graph passed.
  19549. 1525.55 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:137:1: bindC === bindCR passed.
  19550. 1525.55 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:144:1: bindP === bindPR passed.
  19551. 1525.55 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:151:1: apC === apCR passed.
  19552. 1525.55 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:159:1: apP === apPR passed.
  19553. 1525.55 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:165:1: eqC `hasNoType` Algebra.Graph.Graph passed.
  19554. 1525.55 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:170:1: eqT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
  19555. 1525.55 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:176:1: ordC `hasNoType` Algebra.Graph.Graph passed.
  19556. 1525.55 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:181:1: ordT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
  19557. 1525.55 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:187:1: isEmptyC `hasNoType` Algebra.Graph.Graph passed.
  19558. 1525.55 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:193:1: sizeC `hasNoType` Algebra.Graph.Graph passed.
  19559. 1525.55 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:199:1: vertexSetC `hasNoType` Algebra.Graph.Graph passed.
  19560. 1525.55 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:205:1: vertexSetC `hasNoType` Algebra.Graph.Graph passed.
  19561. 1525.55 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:210:1: vertexCountT `hasNoType` Data.Set.Internal.Set passed.
  19562. 1525.55 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:216:1: edgeCountC `hasNoType` Algebra.Graph.Graph passed.
  19563. 1525.55 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:221:1: edgeCountT `hasNoType` Data.Set.Internal.Set passed.
  19564. 1525.55 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:227:1: vertexListCP `hasNoType` Algebra.Graph.Graph passed.
  19565. 1525.55 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:228:1: vertexListCP `hasNoType` GHC.Types.List passed.
  19566. 1525.55 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:233:1: vertexListT `hasNoType` Data.Set.Internal.Set passed.
  19567. 1525.55 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:239:1: edgeSetC `hasNoType` Algebra.Graph.Graph passed.
  19568. 1525.55 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:244:1: vertexListT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
  19569. 1525.55 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:250:1: edgeListCP `hasNoType` Algebra.Graph.Graph passed.
  19570. 1525.55 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:251:1: edgeListCP `hasNoType` GHC.Types.List passed.
  19571. 1525.55 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:256:1: edgeListT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
  19572. 1525.55 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:262:1: hasVertexC `hasNoType` Algebra.Graph.Graph passed.
  19573. 1525.55 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:268:1: hasEdgeC `hasNoType` Algebra.Graph.Graph passed.
  19574. 1525.55 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:274:1: adjacencyListC `hasNoType` Algebra.Graph.Graph passed.
  19575. 1525.55 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:280:1: pathP `hasNoType` Algebra.Graph.Graph passed.
  19576. 1525.55 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:286:1: circuitP `hasNoType` Algebra.Graph.Graph passed.
  19577. 1525.55 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:292:1: bicliqueCP `hasNoType` GHC.Types.List passed.
  19578. 1525.55 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:293:1: bicliqueCP `hasNoType` Algebra.Graph.Graph passed.
  19579. 1525.55 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:301:1: replaceVertexCP `hasNoType` Algebra.Graph.Graph passed.
  19580. 1525.55 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:309:1: mergeVerticesCP `hasNoType` Algebra.Graph.Graph passed.
  19581. 1525.55 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:316:1: splitVertexCP `hasNoType` GHC.Types.List passed.
  19582. 1525.55 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:317:1: splitVertexCP `hasNoType` Algebra.Graph.Graph passed.
  19583. 1525.56 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:324:1: transposeCP `hasNoType` Algebra.Graph.Graph passed.
  19584. 1525.56 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:339:1: simplifyC === simplifyCR passed.
  19585. 1525.56 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:345:1: composeCP `hasNoType` Algebra.Graph.Graph passed.
  19586. 1525.56 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:352:1: induceCP `hasNoType` Algebra.Graph.Graph passed.
  19587. 1525.56 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:359:1: induceJustCP `hasNoType` Algebra.Graph.Graph passed.
  19588. 1525.56 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:365:1: contextC `hasNoType` Algebra.Graph.Graph passed.
  19589. 1525.56 s [algebraic-graphs] inspection testing successful
  19590. 1525.56 s [algebraic-graphs] expected successes: 58
  19591. 1525.56 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 )
  19592. 1525.56 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 )
  19593. 1525.56 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 )
  19594. 1526.93 s [algebraic-graphs] [24 of 24] Linking dist/build/main/main
  19595. 1528.55 s [algebraic-graphs] buildPhase completed in 36 seconds
  19596. 1528.55 s [algebraic-graphs] Phase: checkPhase
  19597. 1528.62 s [algebraic-graphs] Running 1 test suites...
  19598. 1528.62 s [algebraic-graphs] Test suite main: RUNNING...
  19599. 1539.90 s [algebraic-graphs]
  19600. 1539.90 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.Show ============
  19601. 1539.93 s [algebraic-graphs] OK: show empty == "empty"
  19602. 1539.93 s [algebraic-graphs] OK: show (shrink 1) == "vertex 1"
  19603. 1539.93 s [algebraic-graphs] OK: show (shrink $ 1 + 2) == "vertices [1,2]"
  19604. 1539.93 s [algebraic-graphs] OK: show (shrink $ 1 * 2) == "(fromJust . toAcyclic) (edge 1 2)"
  19605. 1539.93 s [algebraic-graphs] OK: show (shrink $ 1 * 2 * 3) == "(fromJust . toAcyclic) (edges [(1,2),(1,3),(2,3)])"
  19606. 1539.93 s [algebraic-graphs] OK: show (shrink $ 1 * 2 + 3) == "(fromJust . toAcyclic) (overlay (vertex 3) (edge 1 2))"
  19607. 1539.93 s [algebraic-graphs]
  19608. 1539.93 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.fromAcyclic ============
  19609. 1539.93 s [algebraic-graphs] OK: fromAcyclic empty == empty
  19610. 1539.93 s [algebraic-graphs] OK: fromAcyclic . vertex == vertex
  19611. 1539.93 s [algebraic-graphs] OK: fromAcyclic (shrink $ 1 * 3 * 2) == star 1 [2,3]
  19612. 1539.93 s [algebraic-graphs] OK: vertexCount . fromAcyclic == vertexCount
  19613. 1539.93 s [algebraic-graphs] OK: edgeCount . fromAcyclic == edgeCount
  19614. 1539.93 s [algebraic-graphs] OK: isAcyclic . fromAcyclic == const True
  19615. 1539.93 s [algebraic-graphs]
  19616. 1539.93 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.empty ============
  19617. 1539.93 s [algebraic-graphs] OK: isEmpty empty == True
  19618. 1539.93 s [algebraic-graphs] OK: hasVertex x empty == False
  19619. 1539.93 s [algebraic-graphs] OK: vertexCount empty == 0
  19620. 1539.93 s [algebraic-graphs] OK: edgeCount empty == 0
  19621. 1539.93 s [algebraic-graphs]
  19622. 1539.93 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertex ============
  19623. 1539.93 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  19624. 1539.93 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  19625. 1539.93 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  19626. 1539.93 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  19627. 1539.93 s [algebraic-graphs]
  19628. 1539.93 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertices ============
  19629. 1539.93 s [algebraic-graphs] OK: vertices [] == empty
  19630. 1539.93 s [algebraic-graphs] OK: vertices [x] == vertex x
  19631. 1539.93 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  19632. 1539.93 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  19633. 1539.93 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  19634. 1539.93 s [algebraic-graphs]
  19635. 1539.93 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.union ============
  19636. 1539.93 s [algebraic-graphs] OK: vertexSet (union x y) == <correct result>
  19637. 1539.93 s [algebraic-graphs] OK: edgeSet (union x y) == <correct result>
  19638. 1539.93 s [algebraic-graphs]
  19639. 1539.93 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.join ============
  19640. 1539.94 s [algebraic-graphs] OK: vertexSet (join x y) == <correct result>
  19641. 1539.94 s [algebraic-graphs] OK: edgeSet (join x y) == <correct result>
  19642. 1539.94 s [algebraic-graphs]
  19643. 1539.94 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.isSubgraphOf ============
  19644. 1539.94 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  19645. 1539.94 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  19646. 1539.94 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  19647. 1539.94 s [algebraic-graphs] OK: isSubgraphOf x (transitiveClosure x) == True
  19648. 1539.94 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  19649. 1539.94 s [algebraic-graphs]
  19650. 1539.94 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.isEmpty ============
  19651. 1539.94 s [algebraic-graphs] OK: isEmpty empty == True
  19652. 1539.94 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  19653. 1539.94 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  19654. 1539.94 s [algebraic-graphs] OK: isEmpty (removeEdge 1 2 $ shrink $ 1 * 2) == False
  19655. 1539.94 s [algebraic-graphs]
  19656. 1539.94 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.hasVertex ============
  19657. 1539.94 s [algebraic-graphs] OK: hasVertex x empty == False
  19658. 1539.94 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  19659. 1539.94 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  19660. 1539.94 s [algebraic-graphs]
  19661. 1539.94 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.hasEdge ============
  19662. 1539.94 s [algebraic-graphs] OK: hasEdge x y empty == False
  19663. 1539.94 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  19664. 1539.94 s [algebraic-graphs] OK: hasEdge 1 2 (shrink $ 1 * 2) == True
  19665. 1539.94 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  19666. 1539.94 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  19667. 1539.94 s [algebraic-graphs]
  19668. 1539.94 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertexCount ============
  19669. 1539.94 s [algebraic-graphs] OK: vertexCount empty == 0
  19670. 1539.94 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  19671. 1539.94 s [algebraic-graphs] OK: vertexCount == length . vertexList
  19672. 1539.94 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  19673. 1539.94 s [algebraic-graphs]
  19674. 1539.94 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.edgeCount ============
  19675. 1539.94 s [algebraic-graphs] OK: edgeCount empty == 0
  19676. 1539.94 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  19677. 1539.94 s [algebraic-graphs] OK: edgeCount (shrink $ 1 * 2) == 1
  19678. 1539.94 s [algebraic-graphs] OK: edgeCount == length . edgeList
  19679. 1539.94 s [algebraic-graphs]
  19680. 1539.94 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertexList ============
  19681. 1539.94 s [algebraic-graphs] OK: vertexList empty == []
  19682. 1539.94 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  19683. 1539.94 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  19684. 1539.94 s [algebraic-graphs]
  19685. 1539.94 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.edgeList ============
  19686. 1539.94 s [algebraic-graphs] OK: edgeList empty == []
  19687. 1539.94 s [algebraic-graphs] OK: edgeList (vertex x) == []
  19688. 1539.94 s [algebraic-graphs] OK: edgeList (shrink $ 2 * 1) == [(2,1)]
  19689. 1539.94 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  19690. 1539.94 s [algebraic-graphs]
  19691. 1539.94 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.adjacencyList ============
  19692. 1539.94 s [algebraic-graphs] OK: adjacencyList empty == []
  19693. 1539.94 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  19694. 1539.94 s [algebraic-graphs] OK: adjacencyList (shrink $ 1 * 2) == [(1, [2]), (2, [])]
  19695. 1539.94 s [algebraic-graphs]
  19696. 1539.94 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertexSet ============
  19697. 1539.94 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  19698. 1539.94 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  19699. 1539.94 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  19700. 1539.94 s [algebraic-graphs]
  19701. 1539.94 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.edgeSet ============
  19702. 1539.94 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  19703. 1539.94 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  19704. 1539.94 s [algebraic-graphs] OK: edgeSet (shrink $ 1 * 2) == Set.singleton (1,2)
  19705. 1539.94 s [algebraic-graphs]
  19706. 1539.94 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.preSet ============
  19707. 1539.94 s [algebraic-graphs] OK: preSet x empty == Set.empty
  19708. 1539.94 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  19709. 1539.94 s [algebraic-graphs] OK: preSet 1 (shrink $ 1 * 2) == Set.empty
  19710. 1539.94 s [algebraic-graphs] OK: preSet 2 (shrink $ 1 * 2) == Set.fromList [1]
  19711. 1539.94 s [algebraic-graphs] OK: Set.member x . preSet x == const False
  19712. 1539.94 s [algebraic-graphs]
  19713. 1539.94 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.postSet ============
  19714. 1539.94 s [algebraic-graphs] OK: postSet x empty == Set.empty
  19715. 1539.94 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  19716. 1539.94 s [algebraic-graphs] OK: postSet 1 (shrink $ 1 * 2) == Set.fromList [2]
  19717. 1539.94 s [algebraic-graphs] OK: postSet 2 (shrink $ 1 * 2) == Set.empty
  19718. 1539.94 s [algebraic-graphs] OK: Set.member x . postSet x == const False
  19719. 1539.94 s [algebraic-graphs]
  19720. 1539.94 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.removeVertex ============
  19721. 1539.94 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  19722. 1539.94 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  19723. 1539.94 s [algebraic-graphs] OK: removeVertex 1 (shrink $ 1 * 2) == vertex 2
  19724. 1539.94 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  19725. 1539.94 s [algebraic-graphs]
  19726. 1539.94 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.removeEdge ============
  19727. 1539.94 s [algebraic-graphs] OK: removeEdge 1 2 (shrink $ 1 * 2) == vertices [1,2]
  19728. 1539.94 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  19729. 1539.94 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  19730. 1539.94 s [algebraic-graphs] OK: removeEdge 1 2 (shrink $ 1 * 2 * 3) == shrink ((1 + 2) * 3)
  19731. 1539.94 s [algebraic-graphs]
  19732. 1539.94 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.transpose ============
  19733. 1539.94 s [algebraic-graphs] OK: transpose empty == empty
  19734. 1539.94 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  19735. 1539.94 s [algebraic-graphs] OK: transpose . transpose == id
  19736. 1539.94 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  19737. 1539.94 s [algebraic-graphs]
  19738. 1539.94 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.induce ============
  19739. 1539.94 s [algebraic-graphs] OK: induce (const True ) x == x
  19740. 1539.94 s [algebraic-graphs] OK: induce (const False) x == empty
  19741. 1539.94 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  19742. 1539.94 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  19743. 1539.94 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  19744. 1539.94 s [algebraic-graphs]
  19745. 1539.94 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.induceJust ============
  19746. 1539.94 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  19747. 1539.94 s [algebraic-graphs] OK: induceJust . vertex . Just == vertex
  19748. 1539.94 s [algebraic-graphs]
  19749. 1539.94 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.box ============
  19750. 1539.94 s [algebraic-graphs] OK: edgeList (box (shrink $ 1 * 2) (shrink $ 10 * 20)) == <correct result>
  19751. 1539.94 s [algebraic-graphs]
  19752. 1539.94 s [algebraic-graphs] OK: box x y ~~ box y x
  19753. 1539.94 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  19754. 1539.94 s [algebraic-graphs] OK: box x empty ~~ empty
  19755. 1539.94 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  19756. 1539.94 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  19757. 1539.94 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  19758. 1539.94 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  19759. 1539.94 s [algebraic-graphs]
  19760. 1539.94 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.transitiveClosure ============
  19761. 1539.94 s [algebraic-graphs] OK: transitiveClosure empty == empty
  19762. 1539.94 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  19763. 1539.94 s [algebraic-graphs] OK: transitiveClosure (shrink $ 1 * 2 + 2 * 3) == shrink (1 * 2 + 1 * 3 + 2 * 3)
  19764. 1539.94 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  19765. 1539.94 s [algebraic-graphs]
  19766. 1539.94 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.topSort ============
  19767. 1539.94 s [algebraic-graphs] OK: topSort empty == []
  19768. 1539.94 s [algebraic-graphs] OK: topSort (vertex x) == [x]
  19769. 1539.94 s [algebraic-graphs] OK: topSort (shrink $ 1 * (2 + 4) + 3 * 4) == [1, 2, 3, 4]
  19770. 1539.94 s [algebraic-graphs] OK: topSort (join x y) == fmap Left (topSort x) ++ fmap Right (topSort y)
  19771. 1539.94 s [algebraic-graphs] OK: Right . topSort == AM.topSort . fromAcyclic
  19772. 1539.94 s [algebraic-graphs]
  19773. 1539.94 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.scc ============
  19774. 1539.94 s [algebraic-graphs] OK: scc empty == empty
  19775. 1539.94 s [algebraic-graphs] OK: scc (vertex x) == vertex (NonEmpty.vertex x)
  19776. 1539.94 s [algebraic-graphs] OK: scc (edge 1 1) == vertex (NonEmpty.edge 1 1)
  19777. 1539.94 s [algebraic-graphs] OK: edgeList $ scc (edge 1 2) == [ (NonEmpty.vertex 1, NonEmpty.vertex 2) ]
  19778. 1539.94 s [algebraic-graphs] OK: edgeList $ scc (3 * 1 * 4 * 1 * 5) == <correct result>
  19779. 1539.94 s [algebraic-graphs]
  19780. 1539.94 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.toAcyclic ============
  19781. 1539.94 s [algebraic-graphs] OK: toAcyclic (path [1,2,3]) == Just (shrink $ 1 * 2 + 2 * 3)
  19782. 1539.94 s [algebraic-graphs] OK: toAcyclic (clique [3,2,1]) == Just (transpose (shrink $ 1 * 2 * 3))
  19783. 1539.94 s [algebraic-graphs] OK: toAcyclic (circuit [1,2,3]) == Nothing
  19784. 1539.94 s [algebraic-graphs] OK: toAcyclic . fromAcyclic == Just
  19785. 1539.94 s [algebraic-graphs]
  19786. 1539.94 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.toAcyclicOrd ============
  19787. 1539.94 s [algebraic-graphs] OK: toAcyclicOrd empty == empty
  19788. 1539.94 s [algebraic-graphs] OK: toAcyclicOrd . vertex == vertex
  19789. 1539.94 s [algebraic-graphs] OK: toAcyclicOrd (1 + 2) == shrink (1 + 2)
  19790. 1539.94 s [algebraic-graphs] OK: toAcyclicOrd (1 * 2) == shrink (1 * 2)
  19791. 1539.94 s [algebraic-graphs] OK: toAcyclicOrd (2 * 1) == shrink (1 + 2)
  19792. 1539.94 s [algebraic-graphs] OK: toAcyclicOrd (1 * 2 * 1) == shrink (1 * 2)
  19793. 1543.59 s [algebraic-graphs] OK: toAcyclicOrd (1 * 2 * 3) == shrink (1 * 2 * 3)
  19794. 1543.59 s [algebraic-graphs]
  19795. 1543.59 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.shrink ============
  19796. 1543.59 s [algebraic-graphs] OK: shrink . AM.vertex == vertex
  19797. 1543.59 s [algebraic-graphs] OK: shrink . AM.vertices == vertices
  19798. 1543.59 s [algebraic-graphs] OK: shrink . fromAcyclic == id
  19799. 1543.59 s [algebraic-graphs]
  19800. 1543.59 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.consistent ============
  19801. 1543.59 s [algebraic-graphs] OK: Arbitrary
  19802. 1543.59 s [algebraic-graphs] OK: empty
  19803. 1543.59 s [algebraic-graphs] OK: vertex
  19804. 1543.59 s [algebraic-graphs] OK: vertices
  19805. 1543.59 s [algebraic-graphs] OK: union
  19806. 1543.59 s [algebraic-graphs] OK: join
  19807. 1543.59 s [algebraic-graphs] OK: transpose
  19808. 1543.59 s [algebraic-graphs] OK: box
  19809. 1543.59 s [algebraic-graphs] OK: transitiveClosure
  19810. 1543.59 s [algebraic-graphs] OK: scc
  19811. 1543.59 s [algebraic-graphs] OK: toAcyclic
  19812. 1543.59 s [algebraic-graphs] OK: toAcyclicOrd
  19813. 1543.59 s [algebraic-graphs]
  19814. 1543.59 s [algebraic-graphs] ============ AdjacencyIntMap ============
  19815. 1543.59 s [algebraic-graphs] OK: Axioms of graphs
  19816. 1543.59 s [algebraic-graphs]
  19817. 1543.59 s [algebraic-graphs] ============ AdjacencyIntMap.fromAdjacencyMap ============
  19818. 1543.59 s [algebraic-graphs] OK: fromAdjacencyMap == stars . AdjacencyMap.adjacencyList
  19819. 1543.59 s [algebraic-graphs]
  19820. 1543.59 s [algebraic-graphs] ============ AdjacencyIntMap.consistent ============
  19821. 1543.59 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  19822. 1543.59 s [algebraic-graphs]
  19823. 1543.59 s [algebraic-graphs] OK: consistent empty == True
  19824. 1543.59 s [algebraic-graphs] OK: consistent (vertex x) == True
  19825. 1543.59 s [algebraic-graphs] OK: consistent (overlay x y) == True
  19826. 1543.59 s [algebraic-graphs] OK: consistent (connect x y) == True
  19827. 1543.59 s [algebraic-graphs] OK: consistent (edge x y) == True
  19828. 1543.59 s [algebraic-graphs] OK: consistent (edges xs) == True
  19829. 1543.59 s [algebraic-graphs] OK: consistent (stars xs) == True
  19830. 1543.59 s [algebraic-graphs]
  19831. 1543.59 s [algebraic-graphs] ============ AdjacencyIntMap.Show ============
  19832. 1543.59 s [algebraic-graphs] OK: show (empty ) == "empty"
  19833. 1543.59 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  19834. 1543.59 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  19835. 1543.59 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  19836. 1543.59 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  19837. 1543.59 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  19838. 1543.59 s [algebraic-graphs]
  19839. 1543.59 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  19840. 1543.59 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  19841. 1543.59 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  19842. 1543.59 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  19843. 1543.59 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  19844. 1543.59 s [algebraic-graphs]
  19845. 1543.59 s [algebraic-graphs] ============ AdjacencyIntMap.Ord ============
  19846. 1543.59 s [algebraic-graphs] OK: vertex 1 < vertex 2
  19847. 1543.59 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  19848. 1543.59 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  19849. 1543.59 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  19850. 1543.59 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  19851. 1543.59 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  19852. 1543.59 s [algebraic-graphs] OK: x <= x + y
  19853. 1543.59 s [algebraic-graphs] OK: x + y <= x * y
  19854. 1543.59 s [algebraic-graphs]
  19855. 1543.59 s [algebraic-graphs] ============ AdjacencyIntMap.empty ============
  19856. 1543.59 s [algebraic-graphs] OK: isEmpty empty == True
  19857. 1543.59 s [algebraic-graphs] OK: hasVertex x empty == False
  19858. 1543.59 s [algebraic-graphs] OK: vertexCount empty == 0
  19859. 1543.59 s [algebraic-graphs] OK: edgeCount empty == 0
  19860. 1543.59 s [algebraic-graphs]
  19861. 1543.59 s [algebraic-graphs] ============ AdjacencyIntMap.vertex ============
  19862. 1543.59 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  19863. 1543.59 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  19864. 1543.59 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  19865. 1543.59 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  19866. 1543.59 s [algebraic-graphs]
  19867. 1543.59 s [algebraic-graphs] ============ AdjacencyIntMap.edge ============
  19868. 1543.59 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  19869. 1543.59 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  19870. 1543.59 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  19871. 1543.59 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  19872. 1543.59 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  19873. 1543.59 s [algebraic-graphs]
  19874. 1543.59 s [algebraic-graphs] ============ AdjacencyIntMap.overlay ============
  19875. 1543.59 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  19876. 1543.59 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  19877. 1543.59 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  19878. 1543.59 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  19879. 1543.59 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  19880. 1543.59 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  19881. 1543.59 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  19882. 1543.59 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  19883. 1543.59 s [algebraic-graphs]
  19884. 1543.59 s [algebraic-graphs] ============ AdjacencyIntMap.connect ============
  19885. 1543.59 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  19886. 1543.59 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  19887. 1543.59 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  19888. 1543.59 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  19889. 1543.59 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  19890. 1543.59 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  19891. 1543.59 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  19892. 1543.59 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  19893. 1543.59 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  19894. 1543.59 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  19895. 1543.59 s [algebraic-graphs]
  19896. 1543.59 s [algebraic-graphs] ============ AdjacencyIntMap.vertices ============
  19897. 1543.59 s [algebraic-graphs] OK: vertices [] == empty
  19898. 1543.59 s [algebraic-graphs] OK: vertices [x] == vertex x
  19899. 1543.59 s [algebraic-graphs] OK: vertices == overlays . map vertex
  19900. 1543.59 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  19901. 1543.59 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  19902. 1543.59 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  19903. 1543.59 s [algebraic-graphs]
  19904. 1543.59 s [algebraic-graphs] ============ AdjacencyIntMap.edges ============
  19905. 1543.59 s [algebraic-graphs] OK: edges [] == empty
  19906. 1543.59 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  19907. 1543.59 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  19908. 1543.59 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  19909. 1543.59 s [algebraic-graphs]
  19910. 1543.59 s [algebraic-graphs] ============ AdjacencyIntMap.overlays ============
  19911. 1543.59 s [algebraic-graphs] OK: overlays [] == empty
  19912. 1543.59 s [algebraic-graphs] OK: overlays [x] == x
  19913. 1543.59 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  19914. 1543.59 s [algebraic-graphs] OK: overlays == foldr overlay empty
  19915. 1543.59 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  19916. 1543.59 s [algebraic-graphs]
  19917. 1543.59 s [algebraic-graphs] ============ AdjacencyIntMap.connects ============
  19918. 1543.59 s [algebraic-graphs] OK: connects [] == empty
  19919. 1543.59 s [algebraic-graphs] OK: connects [x] == x
  19920. 1543.59 s [algebraic-graphs] OK: connects [x,y] == connect x y
  19921. 1543.59 s [algebraic-graphs] OK: connects == foldr connect empty
  19922. 1543.59 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  19923. 1543.59 s [algebraic-graphs]
  19924. 1543.59 s [algebraic-graphs] ============ AdjacencyIntMap.fromAdjacencyIntSets ============
  19925. 1543.59 s [algebraic-graphs] OK: fromAdjacencyIntSets [] == empty
  19926. 1543.59 s [algebraic-graphs] OK: fromAdjacencyIntSets [(x, IntSet.empty)] == vertex x
  19927. 1543.59 s [algebraic-graphs] OK: fromAdjacencyIntSets [(x, IntSet.singleton y)] == edge x y
  19928. 1543.59 s [algebraic-graphs] OK: fromAdjacencyIntSets . map (fmap IntSet.fromList) == stars
  19929. 1543.59 s [algebraic-graphs] OK: overlay (fromAdjacencyIntSets xs) (fromAdjacencyIntSets ys) == fromAdjacencyIntSets (xs ++ ys)
  19930. 1543.59 s [algebraic-graphs]
  19931. 1543.59 s [algebraic-graphs] ============ AdjacencyIntMap.isSubgraphOf ============
  19932. 1543.59 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  19933. 1543.59 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  19934. 1543.59 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  19935. 1543.59 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  19936. 1543.59 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  19937. 1543.59 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  19938. 1543.59 s [algebraic-graphs]
  19939. 1543.59 s [algebraic-graphs] ============ AdjacencyIntMap.toGraph et al. ============
  19940. 1543.59 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  19941. 1543.59 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  19942. 1543.59 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  19943. 1543.59 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  19944. 1543.59 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  19945. 1543.59 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  19946. 1543.59 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  19947. 1543.59 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  19948. 1543.59 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  19949. 1543.59 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  19950. 1543.59 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  19951. 1543.59 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  19952. 1543.59 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  19953. 1543.59 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  19954. 1543.59 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  19955. 1543.59 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  19956. 1543.59 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  19957. 1543.59 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  19958. 1543.59 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  19959. 1543.59 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  19960. 1543.59 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  19961. 1543.59 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  19962. 1543.59 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  19963. 1543.59 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  19964. 1543.59 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  19965. 1543.59 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  19966. 1543.59 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  19967. 1543.59 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  19968. 1543.60 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  19969. 1543.60 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  19970. 1543.60 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  19971. 1543.60 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  19972. 1543.60 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  19973. 1543.60 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  19974. 1544.47 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  19975. 1544.47 s [algebraic-graphs]
  19976. 1544.47 s [algebraic-graphs] ============ AdjacencyIntMap.foldg ============
  19977. 1544.47 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  19978. 1544.47 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  19979. 1544.47 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  19980. 1544.47 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  19981. 1544.47 s [algebraic-graphs]
  19982. 1544.47 s [algebraic-graphs] ============ AdjacencyIntMap.isEmpty ============
  19983. 1544.47 s [algebraic-graphs] OK: isEmpty empty == True
  19984. 1544.47 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  19985. 1544.47 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  19986. 1544.47 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  19987. 1544.47 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  19988. 1544.47 s [algebraic-graphs]
  19989. 1544.47 s [algebraic-graphs] ============ AdjacencyIntMap.hasVertex ============
  19990. 1544.47 s [algebraic-graphs] OK: hasVertex x empty == False
  19991. 1544.47 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  19992. 1544.47 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  19993. 1544.47 s [algebraic-graphs]
  19994. 1544.47 s [algebraic-graphs] ============ AdjacencyIntMap.hasEdge ============
  19995. 1544.47 s [algebraic-graphs] OK: hasEdge x y empty == False
  19996. 1544.47 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  19997. 1544.47 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  19998. 1544.47 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  19999. 1544.47 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  20000. 1544.47 s [algebraic-graphs]
  20001. 1544.47 s [algebraic-graphs] ============ AdjacencyIntMap.vertexCount ============
  20002. 1544.47 s [algebraic-graphs] OK: vertexCount empty == 0
  20003. 1544.47 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20004. 1544.47 s [algebraic-graphs] OK: vertexCount == length . vertexList
  20005. 1544.47 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  20006. 1544.47 s [algebraic-graphs]
  20007. 1544.47 s [algebraic-graphs] ============ AdjacencyIntMap.edgeCount ============
  20008. 1544.47 s [algebraic-graphs] OK: edgeCount empty == 0
  20009. 1544.47 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20010. 1544.47 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  20011. 1544.47 s [algebraic-graphs] OK: edgeCount == length . edgeList
  20012. 1544.47 s [algebraic-graphs]
  20013. 1544.47 s [algebraic-graphs] ============ AdjacencyIntMap.vertexList ============
  20014. 1544.47 s [algebraic-graphs] OK: vertexList empty == []
  20015. 1544.47 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  20016. 1544.47 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  20017. 1544.47 s [algebraic-graphs]
  20018. 1544.47 s [algebraic-graphs] ============ AdjacencyIntMap.vertexSet ============
  20019. 1544.47 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  20020. 1544.47 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  20021. 1544.47 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  20022. 1544.47 s [algebraic-graphs]
  20023. 1544.47 s [algebraic-graphs] ============ AdjacencyIntMap.vertexIntSet ============
  20024. 1544.47 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  20025. 1544.47 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  20026. 1544.47 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  20027. 1544.47 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  20028. 1544.47 s [algebraic-graphs]
  20029. 1544.47 s [algebraic-graphs] ============ AdjacencyIntMap.edgeList ============
  20030. 1544.47 s [algebraic-graphs] OK: edgeList empty == []
  20031. 1544.47 s [algebraic-graphs] OK: edgeList (vertex x) == []
  20032. 1544.47 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  20033. 1544.47 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  20034. 1544.47 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  20035. 1544.47 s [algebraic-graphs]
  20036. 1544.47 s [algebraic-graphs] ============ AdjacencyIntMap.edgeSet ============
  20037. 1544.47 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  20038. 1544.47 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  20039. 1544.47 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  20040. 1544.47 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  20041. 1544.47 s [algebraic-graphs]
  20042. 1544.47 s [algebraic-graphs] ============ AdjacencyIntMap.adjacencyList ============
  20043. 1544.47 s [algebraic-graphs] OK: adjacencyList empty == []
  20044. 1544.47 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  20045. 1544.47 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  20046. 1544.47 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  20047. 1544.47 s [algebraic-graphs]
  20048. 1544.47 s [algebraic-graphs] ============ AdjacencyIntMap.preSet ============
  20049. 1544.47 s [algebraic-graphs] OK: preSet x empty == Set.empty
  20050. 1544.47 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  20051. 1544.47 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  20052. 1544.47 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  20053. 1544.47 s [algebraic-graphs]
  20054. 1544.47 s [algebraic-graphs] ============ AdjacencyIntMap.preIntSet ============
  20055. 1544.47 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  20056. 1544.47 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  20057. 1544.47 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  20058. 1544.47 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  20059. 1544.47 s [algebraic-graphs]
  20060. 1544.47 s [algebraic-graphs] ============ AdjacencyIntMap.postSet ============
  20061. 1544.47 s [algebraic-graphs] OK: postSet x empty == Set.empty
  20062. 1544.47 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  20063. 1544.47 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  20064. 1544.47 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  20065. 1544.47 s [algebraic-graphs]
  20066. 1544.47 s [algebraic-graphs] ============ AdjacencyIntMap.postIntSet ============
  20067. 1544.47 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  20068. 1544.47 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  20069. 1544.47 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  20070. 1544.47 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  20071. 1544.47 s [algebraic-graphs]
  20072. 1544.47 s [algebraic-graphs] ============ AdjacencyIntMap.path ============
  20073. 1544.47 s [algebraic-graphs] OK: path [] == empty
  20074. 1544.47 s [algebraic-graphs] OK: path [x] == vertex x
  20075. 1544.47 s [algebraic-graphs] OK: path [x,y] == edge x y
  20076. 1544.47 s [algebraic-graphs]
  20077. 1544.47 s [algebraic-graphs] ============ AdjacencyIntMap.circuit ============
  20078. 1544.47 s [algebraic-graphs] OK: circuit [] == empty
  20079. 1544.47 s [algebraic-graphs] OK: circuit [x] == edge x x
  20080. 1544.47 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  20081. 1544.47 s [algebraic-graphs]
  20082. 1544.47 s [algebraic-graphs] ============ AdjacencyIntMap.clique ============
  20083. 1544.48 s [algebraic-graphs] OK: clique [] == empty
  20084. 1544.48 s [algebraic-graphs] OK: clique [x] == vertex x
  20085. 1544.48 s [algebraic-graphs] OK: clique [x,y] == edge x y
  20086. 1544.48 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  20087. 1544.48 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  20088. 1544.48 s [algebraic-graphs]
  20089. 1544.48 s [algebraic-graphs] ============ AdjacencyIntMap.biclique ============
  20090. 1544.48 s [algebraic-graphs] OK: biclique [] [] == empty
  20091. 1544.48 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  20092. 1544.48 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  20093. 1544.48 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  20094. 1544.48 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  20095. 1544.48 s [algebraic-graphs]
  20096. 1544.48 s [algebraic-graphs] ============ AdjacencyIntMap.star ============
  20097. 1544.48 s [algebraic-graphs] OK: star x [] == vertex x
  20098. 1544.48 s [algebraic-graphs] OK: star x [y] == edge x y
  20099. 1544.48 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  20100. 1544.48 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  20101. 1544.48 s [algebraic-graphs]
  20102. 1544.48 s [algebraic-graphs] ============ AdjacencyIntMap.stars ============
  20103. 1544.48 s [algebraic-graphs] OK: stars [] == empty
  20104. 1544.48 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  20105. 1544.48 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  20106. 1544.48 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  20107. 1544.48 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  20108. 1544.48 s [algebraic-graphs] OK: stars . adjacencyList == id
  20109. 1544.48 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  20110. 1544.48 s [algebraic-graphs]
  20111. 1544.48 s [algebraic-graphs] ============ AdjacencyIntMap.tree ============
  20112. 1544.48 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  20113. 1544.48 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  20114. 1544.48 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  20115. 1544.48 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  20116. 1544.48 s [algebraic-graphs]
  20117. 1544.48 s [algebraic-graphs] ============ AdjacencyIntMap.forest ============
  20118. 1544.48 s [algebraic-graphs] OK: forest [] == empty
  20119. 1544.48 s [algebraic-graphs] OK: forest [x] == tree x
  20120. 1544.48 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  20121. 1544.48 s [algebraic-graphs] OK: forest == overlays . map tree
  20122. 1544.48 s [algebraic-graphs]
  20123. 1544.48 s [algebraic-graphs] ============ AdjacencyIntMap.removeVertex ============
  20124. 1544.48 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  20125. 1544.48 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  20126. 1544.48 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  20127. 1544.48 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  20128. 1544.48 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  20129. 1544.48 s [algebraic-graphs]
  20130. 1544.48 s [algebraic-graphs] ============ AdjacencyIntMap.removeEdge ============
  20131. 1544.48 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  20132. 1544.48 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  20133. 1544.48 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  20134. 1544.48 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  20135. 1544.48 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  20136. 1544.48 s [algebraic-graphs]
  20137. 1544.48 s [algebraic-graphs] ============ AdjacencyIntMap.replaceVertex ============
  20138. 1544.48 s [algebraic-graphs] OK: replaceVertex x x == id
  20139. 1544.48 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  20140. 1544.48 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  20141. 1544.48 s [algebraic-graphs]
  20142. 1544.48 s [algebraic-graphs] ============ AdjacencyIntMap.mergeVertices ============
  20143. 1544.48 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  20144. 1544.48 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  20145. 1544.48 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  20146. 1544.48 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  20147. 1544.48 s [algebraic-graphs]
  20148. 1544.48 s [algebraic-graphs] ============ AdjacencyIntMap.transpose ============
  20149. 1544.48 s [algebraic-graphs] OK: transpose empty == empty
  20150. 1544.48 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  20151. 1544.48 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  20152. 1544.48 s [algebraic-graphs] OK: transpose . transpose == id
  20153. 1544.48 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  20154. 1544.48 s [algebraic-graphs]
  20155. 1544.48 s [algebraic-graphs] ============ AdjacencyIntMap.gmap ============
  20156. 1544.48 s [algebraic-graphs] OK: gmap f empty == empty
  20157. 1544.48 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  20158. 1544.48 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  20159. 1544.48 s [algebraic-graphs] OK: gmap id == id
  20160. 1544.48 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  20161. 1544.48 s [algebraic-graphs]
  20162. 1544.48 s [algebraic-graphs] ============ AdjacencyIntMap.induce ============
  20163. 1544.48 s [algebraic-graphs] OK: induce (const True ) x == x
  20164. 1544.48 s [algebraic-graphs] OK: induce (const False) x == empty
  20165. 1544.48 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  20166. 1544.48 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  20167. 1544.48 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  20168. 1544.48 s [algebraic-graphs]
  20169. 1544.48 s [algebraic-graphs] ============ AdjacencyIntMap.compose ============
  20170. 1544.48 s [algebraic-graphs] OK: compose empty x == empty
  20171. 1544.48 s [algebraic-graphs] OK: compose x empty == empty
  20172. 1544.48 s [algebraic-graphs] OK: compose (vertex x) y == empty
  20173. 1544.48 s [algebraic-graphs] OK: compose x (vertex y) == empty
  20174. 1544.48 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  20175. 1544.48 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  20176. 1544.73 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  20177. 1544.73 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  20178. 1544.73 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  20179. 1544.73 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  20180. 1544.73 s [algebraic-graphs]
  20181. 1544.73 s [algebraic-graphs] ============ AdjacencyIntMap.closure ============
  20182. 1544.73 s [algebraic-graphs] OK: closure empty == empty
  20183. 1544.73 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  20184. 1544.73 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  20185. 1544.73 s [algebraic-graphs] OK: closure (edge x y) == edges [(x,x), (x,y), (y,y)]
  20186. 1544.73 s [algebraic-graphs] OK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
  20187. 1544.73 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  20188. 1544.73 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  20189. 1544.73 s [algebraic-graphs] OK: closure . closure == closure
  20190. 1544.73 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  20191. 1544.73 s [algebraic-graphs]
  20192. 1544.73 s [algebraic-graphs] ============ AdjacencyIntMap.reflexiveClosure ============
  20193. 1544.73 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  20194. 1544.73 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  20195. 1544.73 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  20196. 1544.73 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges [(x,x), (x,y), (y,y)]
  20197. 1544.73 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  20198. 1544.73 s [algebraic-graphs]
  20199. 1544.73 s [algebraic-graphs] ============ AdjacencyIntMap.symmetricClosure ============
  20200. 1544.73 s [algebraic-graphs] OK: symmetricClosure empty == empty
  20201. 1544.73 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  20202. 1544.73 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges [(x,y), (y,x)]
  20203. 1544.73 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  20204. 1544.73 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  20205. 1544.73 s [algebraic-graphs]
  20206. 1544.73 s [algebraic-graphs] ============ AdjacencyIntMap.transitiveClosure ============
  20207. 1544.73 s [algebraic-graphs] OK: transitiveClosure empty == empty
  20208. 1544.73 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  20209. 1544.73 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  20210. 1544.73 s [algebraic-graphs] OK: transitiveClosure (path $ nub xs) == clique (nub $ xs)
  20211. 1544.73 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  20212. 1544.73 s [algebraic-graphs]
  20213. 1544.73 s [algebraic-graphs] ============ AdjacencyIntMap.bfsForest ============
  20214. 1544.73 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0] == empty
  20215. 1544.73 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [1] == edge 1 2
  20216. 1544.73 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2] == vertex 2
  20217. 1544.73 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0,1,2] == vertices [1,2]
  20218. 1544.73 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2,1,0] == vertices [1,2]
  20219. 1544.73 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 1) [1] == vertex 1
  20220. 1544.73 s [algebraic-graphs] OK: isSubgraphOf (forest $ bfsForest x vs) x == True
  20221. 1544.73 s [algebraic-graphs] OK: bfsForest x (vertexList x) == map ( -> Node v []) (nub $ vertexList x)
  20222. 1544.73 s [algebraic-graphs] OK: bfsForest x [] == []
  20223. 1544.73 s [algebraic-graphs] OK: bfsForest empty vs == []
  20224. 1544.73 s [algebraic-graphs] OK: bfsForest (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
  20225. 1544.73 s [algebraic-graphs] OK: forest $ bfsForest (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1] + path [3,4,5]
  20226. 1544.73 s [algebraic-graphs]
  20227. 1544.73 s [algebraic-graphs] ============ AdjacencyIntMap.bfs ============
  20228. 1544.73 s [algebraic-graphs] OK: bfs (edge 1 2) [0] == []
  20229. 1544.73 s [algebraic-graphs] OK: bfs (edge 1 2) [1] == [[1], [2]]
  20230. 1544.73 s [algebraic-graphs] OK: bfs (edge 1 2) [2] == [[2]]
  20231. 1544.73 s [algebraic-graphs] OK: bfs (edge 1 2) [1,2] == [[1,2]]
  20232. 1544.73 s [algebraic-graphs] OK: bfs (edge 1 2) [2,1] == [[2,1]]
  20233. 1544.73 s [algebraic-graphs] OK: bfs (edge 1 1) [1] == [[1]]
  20234. 1544.73 s [algebraic-graphs] OK: bfs empty vs == []
  20235. 1544.73 s [algebraic-graphs] OK: bfs x [] == []
  20236. 1544.73 s [algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,2] == [[1,2]]
  20237. 1544.73 s [algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,3] == [[1,3], [2,4]]
  20238. 1544.73 s [algebraic-graphs] OK: bfs (3 * (1 + 4) * (1 + 5)) [3] == [[3], [1,4,5]]
  20239. 1544.73 s [algebraic-graphs] OK: bfs (circuit [1..5] + circuit [5,4..1]) [2] == [[2], [1,3], [5,4]]
  20240. 1544.73 s [algebraic-graphs] OK: concat $ bfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,4,1,5]
  20241. 1544.73 s [algebraic-graphs] OK: map concat . transpose . map levels . bfsForest x == bfs x
  20242. 1544.73 s [algebraic-graphs]
  20243. 1544.73 s [algebraic-graphs] ============ AdjacencyIntMap.dfsForest ============
  20244. 1544.73 s [algebraic-graphs] OK: forest $ dfsForest empty == empty
  20245. 1544.73 s [algebraic-graphs] OK: forest $ dfsForest (edge 1 1) == vertex 1
  20246. 1544.73 s [algebraic-graphs] OK: forest $ dfsForest (edge 1 2) == edge 1 2
  20247. 1544.73 s [algebraic-graphs] OK: forest $ dfsForest (edge 2 1) == vertices [1,2]
  20248. 1544.73 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForest x) x == True
  20249. 1544.73 s [algebraic-graphs] OK: isDfsForestOf (dfsForest x) x == True
  20250. 1544.73 s [algebraic-graphs] OK: dfsForest . forest . dfsForest == dfsForest
  20251. 1544.73 s [algebraic-graphs] OK: dfsForest (vertices vs) == map (\v -> Node v []) (nub $ sort vs)
  20252. 1544.73 s [algebraic-graphs] OK: dfsForest $ 3 * (1 + 4) * (1 + 5) == <correct result>
  20253. 1544.73 s [algebraic-graphs] OK: forest (dfsForest $ circuit [1..5] + circuit [5,4..1]) == path [1,2,3,4,5]
  20254. 1544.73 s [algebraic-graphs]
  20255. 1544.73 s [algebraic-graphs] ============ AdjacencyIntMap.dfsForestFrom ============
  20256. 1544.73 s [algebraic-graphs] OK: forest $ dfsForestFrom empty vs == empty
  20257. 1544.73 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 1) [1] == vertex 1
  20258. 1544.73 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [0] == empty
  20259. 1544.73 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1] == edge 1 2
  20260. 1544.73 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2] == vertex 2
  20261. 1544.73 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1,2] == edge 1 2
  20262. 1544.73 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2,1] == vertices [1,2]
  20263. 1544.73 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForestFrom x vs) x == True
  20264. 1544.73 s [algebraic-graphs] OK: isDfsForestOf (dfsForestFrom x (vertexList x)) x == True
  20265. 1544.73 s [algebraic-graphs] OK: dfsForestFrom x (vertexList x) == dfsForest x
  20266. 1544.73 s [algebraic-graphs] OK: dfsForestFrom x [] == []
  20267. 1544.73 s [algebraic-graphs] OK: dfsForestFrom (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
  20268. 1544.73 s [algebraic-graphs] OK: forest $ dfsForestFrom (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1,5,4]
  20269. 1544.73 s [algebraic-graphs]
  20270. 1544.73 s [algebraic-graphs] ============ AdjacencyIntMap.dfs ============
  20271. 1544.73 s [algebraic-graphs] OK: dfs empty vs == []
  20272. 1544.73 s [algebraic-graphs] OK: dfs (edge 1 1) [1] == [1]
  20273. 1544.73 s [algebraic-graphs] OK: dfs (edge 1 2) [0] == []
  20274. 1544.73 s [algebraic-graphs] OK: dfs (edge 1 2) [1] == [1,2]
  20275. 1544.73 s [algebraic-graphs] OK: dfs (edge 1 2) [2] == [2]
  20276. 1544.73 s [algebraic-graphs] OK: dfs (edge 1 2) [1,2] == [1,2]
  20277. 1544.73 s [algebraic-graphs] OK: dfs (edge 1 2) [2,1] == [2,1]
  20278. 1544.73 s [algebraic-graphs] OK: dfs x [] == []
  20279. 1544.73 s [algebraic-graphs]
  20280. 1544.73 s [algebraic-graphs] OK: and [ hasVertex v x | v <- dfs x vs ] == True
  20281. 1544.73 s [algebraic-graphs] OK: dfs (3 * (1 + 4) * (1 + 5)) [1,4] == [1,5,4]
  20282. 1544.73 s [algebraic-graphs] OK: dfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,1,5,4]
  20283. 1544.73 s [algebraic-graphs]
  20284. 1544.73 s [algebraic-graphs] ============ AdjacencyIntMap.dfs ============
  20285. 1544.73 s [algebraic-graphs] OK: reachable empty x == []
  20286. 1544.73 s [algebraic-graphs] OK: reachable (vertex 1) 1 == [1]
  20287. 1544.73 s [algebraic-graphs] OK: reachable (edge 1 1) 1 == [1]
  20288. 1544.73 s [algebraic-graphs] OK: reachable (edge 1 2) 0 == []
  20289. 1544.73 s [algebraic-graphs] OK: reachable (edge 1 2) 1 == [1,2]
  20290. 1544.73 s [algebraic-graphs] OK: reachable (edge 1 2) 2 == [2]
  20291. 1544.73 s [algebraic-graphs] OK: reachable (path [1..8] ) 4 == [4..8]
  20292. 1544.73 s [algebraic-graphs] OK: reachable (circuit [1..8] ) 4 == [4..8] ++ [1..3]
  20293. 1544.73 s [algebraic-graphs] OK: reachable (clique [8,7..1]) 8 == [8] ++ [1..7]
  20294. 1544.73 s [algebraic-graphs]
  20295. 1544.73 s [algebraic-graphs] OK: and [ hasVertex v x | v <- reachable x y ] == True
  20296. 1544.73 s [algebraic-graphs]
  20297. 1544.73 s [algebraic-graphs] ============ AdjacencyIntMap.topSort ============
  20298. 1544.73 s [algebraic-graphs] OK: topSort (1 * 2 + 3 * 1) == Right [3,1,2]
  20299. 1544.73 s [algebraic-graphs] OK: topSort (path [1..5]) == Right [1..5]
  20300. 1544.73 s [algebraic-graphs] OK: topSort (3 * (1 * 4 + 2 * 5)) == Right [3,1,2,4,5]
  20301. 1544.73 s [algebraic-graphs] OK: topSort (1 * 2 + 2 * 1) == Left (2 :| [1])
  20302. 1544.73 s [algebraic-graphs] OK: topSort (path [5,4..1] + edge 2 4) == Left (4 :| [3,2])
  20303. 1544.73 s [algebraic-graphs] OK: topSort (circuit [1..5]) == Left (3 :| [1,2])
  20304. 1544.73 s [algebraic-graphs] OK: topSort (circuit [1..3] + circuit [3,2,1]) == Left (3 :| [2])
  20305. 1544.73 s [algebraic-graphs] OK: topSort (1 * 2 + (5 + 2) * 1 + 3 * 4 * 3) == Left (1 :| [2])
  20306. 1544.73 s [algebraic-graphs] OK: fmap (flip isTopSortOf x) (topSort x) /= Right False
  20307. 1544.73 s [algebraic-graphs] OK: topSort . vertices == Right . nub . sort
  20308. 1544.73 s [algebraic-graphs]
  20309. 1544.73 s [algebraic-graphs] ============ AdjacencyIntMap.testIsAcyclic ============
  20310. 1544.73 s [algebraic-graphs] OK: isAcyclic (1 * 2 + 3 * 1) == True
  20311. 1544.73 s [algebraic-graphs] OK: isAcyclic (1 * 2 + 2 * 1) == False
  20312. 1544.73 s [algebraic-graphs] OK: isAcyclic . circuit == null
  20313. 1544.73 s [algebraic-graphs] OK: isAcyclic == isRight . topSort
  20314. 1544.73 s [algebraic-graphs]
  20315. 1544.73 s [algebraic-graphs] ============ AdjacencyIntMap.isDfsForestOf ============
  20316. 1544.73 s [algebraic-graphs] OK: isDfsForestOf [] empty == True
  20317. 1544.73 s [algebraic-graphs] OK: isDfsForestOf [] (vertex 1) == False
  20318. 1544.73 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 1) == True
  20319. 1544.73 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 2) == False
  20320. 1544.73 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 1 []] (vertex 1) == False
  20321. 1544.73 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 1) == True
  20322. 1544.73 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 2) == False
  20323. 1544.73 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (edge 1 2) == False
  20324. 1544.73 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (edge 1 2) == True
  20325. 1544.73 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (edge 1 2) == True
  20326. 1544.73 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (vertices [1,2]) == True
  20327. 1544.73 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (vertices [1,2]) == True
  20328. 1544.73 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (vertices [1,2]) == False
  20329. 1550.01 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 [Node 3 []]]] (path [1,2,3]) == True
  20330. 1550.01 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 3 [Node 2 []]]] (path [1,2,3]) == False
  20331. 1550.05 s [algebraic-graphs] OK: isDfsForestOf [Node 3 [], Node 1 [Node 2 []]] (path [1,2,3]) == True
  20332. 1550.05 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [Node 3 []], Node 1 []] (path [1,2,3]) == True
  20333. 1550.05 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 [Node 3 []]] (path [1,2,3]) == False
  20334. 1550.05 s [algebraic-graphs]
  20335. 1550.05 s [algebraic-graphs] ============ AdjacencyIntMap.isTopSortOf ============
  20336. 1550.05 s [algebraic-graphs] OK: isTopSortOf [3,1,2] (1 * 2 + 3 * 1) == True
  20337. 1550.05 s [algebraic-graphs] OK: isTopSortOf [1,2,3] (1 * 2 + 3 * 1) == False
  20338. 1550.05 s [algebraic-graphs] OK: isTopSortOf [] (1 * 2 + 3 * 1) == False
  20339. 1550.05 s [algebraic-graphs] OK: isTopSortOf [] empty == True
  20340. 1550.05 s [algebraic-graphs] OK: isTopSortOf [x] (vertex x) == True
  20341. 1550.05 s [algebraic-graphs] OK: isTopSortOf [x] (edge x x) == False
  20342. 1550.05 s [algebraic-graphs]
  20343. 1550.05 s [algebraic-graphs] ============ AdjacencyMap ============
  20344. 1550.05 s [algebraic-graphs] OK: Axioms of graphs
  20345. 1550.05 s [algebraic-graphs]
  20346. 1550.05 s [algebraic-graphs] ============ AdjacencyMap.consistent ============
  20347. 1550.05 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  20348. 1550.05 s [algebraic-graphs]
  20349. 1550.05 s [algebraic-graphs] OK: consistent empty == True
  20350. 1550.05 s [algebraic-graphs] OK: consistent (vertex x) == True
  20351. 1550.05 s [algebraic-graphs] OK: consistent (overlay x y) == True
  20352. 1550.05 s [algebraic-graphs] OK: consistent (connect x y) == True
  20353. 1550.05 s [algebraic-graphs] OK: consistent (edge x y) == True
  20354. 1550.05 s [algebraic-graphs] OK: consistent (edges xs) == True
  20355. 1550.05 s [algebraic-graphs] OK: consistent (stars xs) == True
  20356. 1550.05 s [algebraic-graphs]
  20357. 1550.05 s [algebraic-graphs] ============ AdjacencyMap.Show ============
  20358. 1550.05 s [algebraic-graphs] OK: show (empty ) == "empty"
  20359. 1550.05 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  20360. 1550.05 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  20361. 1550.05 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  20362. 1550.05 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  20363. 1550.05 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  20364. 1550.05 s [algebraic-graphs]
  20365. 1550.05 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  20366. 1550.05 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  20367. 1550.05 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  20368. 1550.05 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  20369. 1550.05 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  20370. 1550.05 s [algebraic-graphs]
  20371. 1550.05 s [algebraic-graphs] ============ AdjacencyMap.Ord ============
  20372. 1550.05 s [algebraic-graphs] OK: vertex 1 < vertex 2
  20373. 1550.05 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  20374. 1550.05 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  20375. 1550.05 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  20376. 1550.05 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  20377. 1550.05 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  20378. 1550.05 s [algebraic-graphs] OK: x <= x + y
  20379. 1550.05 s [algebraic-graphs] OK: x + y <= x * y
  20380. 1550.05 s [algebraic-graphs]
  20381. 1550.05 s [algebraic-graphs] ============ AdjacencyMap.empty ============
  20382. 1550.05 s [algebraic-graphs] OK: isEmpty empty == True
  20383. 1550.05 s [algebraic-graphs] OK: hasVertex x empty == False
  20384. 1550.05 s [algebraic-graphs] OK: vertexCount empty == 0
  20385. 1550.05 s [algebraic-graphs] OK: edgeCount empty == 0
  20386. 1550.05 s [algebraic-graphs]
  20387. 1550.05 s [algebraic-graphs] ============ AdjacencyMap.vertex ============
  20388. 1550.05 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  20389. 1550.05 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20390. 1550.05 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20391. 1550.05 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20392. 1550.05 s [algebraic-graphs]
  20393. 1550.05 s [algebraic-graphs] ============ AdjacencyMap.edge ============
  20394. 1550.05 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  20395. 1550.05 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  20396. 1550.05 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  20397. 1550.05 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  20398. 1550.05 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  20399. 1550.05 s [algebraic-graphs]
  20400. 1550.05 s [algebraic-graphs] ============ AdjacencyMap.overlay ============
  20401. 1550.05 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  20402. 1550.05 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  20403. 1550.05 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  20404. 1550.05 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  20405. 1550.05 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  20406. 1550.05 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  20407. 1550.05 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  20408. 1550.05 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  20409. 1550.05 s [algebraic-graphs]
  20410. 1550.05 s [algebraic-graphs] ============ AdjacencyMap.connect ============
  20411. 1550.05 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  20412. 1550.05 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  20413. 1550.05 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  20414. 1550.05 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  20415. 1550.05 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  20416. 1550.05 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  20417. 1550.05 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  20418. 1550.05 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  20419. 1550.05 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  20420. 1550.05 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  20421. 1550.05 s [algebraic-graphs]
  20422. 1550.05 s [algebraic-graphs] ============ AdjacencyMap.vertices ============
  20423. 1550.05 s [algebraic-graphs] OK: vertices [] == empty
  20424. 1550.05 s [algebraic-graphs] OK: vertices [x] == vertex x
  20425. 1550.05 s [algebraic-graphs] OK: vertices == overlays . map vertex
  20426. 1550.05 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  20427. 1550.05 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  20428. 1550.05 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  20429. 1550.05 s [algebraic-graphs]
  20430. 1550.05 s [algebraic-graphs] ============ AdjacencyMap.edges ============
  20431. 1550.05 s [algebraic-graphs] OK: edges [] == empty
  20432. 1550.05 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  20433. 1550.05 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  20434. 1550.05 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  20435. 1550.05 s [algebraic-graphs]
  20436. 1550.05 s [algebraic-graphs] ============ AdjacencyMap.overlays ============
  20437. 1550.05 s [algebraic-graphs] OK: overlays [] == empty
  20438. 1550.05 s [algebraic-graphs] OK: overlays [x] == x
  20439. 1550.05 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  20440. 1550.05 s [algebraic-graphs] OK: overlays == foldr overlay empty
  20441. 1550.05 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  20442. 1550.05 s [algebraic-graphs]
  20443. 1550.05 s [algebraic-graphs] ============ AdjacencyMap.connects ============
  20444. 1550.05 s [algebraic-graphs] OK: connects [] == empty
  20445. 1550.05 s [algebraic-graphs] OK: connects [x] == x
  20446. 1550.05 s [algebraic-graphs] OK: connects [x,y] == connect x y
  20447. 1550.05 s [algebraic-graphs] OK: connects == foldr connect empty
  20448. 1550.05 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  20449. 1550.05 s [algebraic-graphs]
  20450. 1550.05 s [algebraic-graphs] ============ AdjacencyMap.fromAdjacencySets ============
  20451. 1550.05 s [algebraic-graphs] OK: fromAdjacencySets [] == empty
  20452. 1550.05 s [algebraic-graphs] OK: fromAdjacencySets [(x, Set.empty)] == vertex x
  20453. 1550.05 s [algebraic-graphs] OK: fromAdjacencySets [(x, Set.singleton y)] == edge x y
  20454. 1550.05 s [algebraic-graphs] OK: fromAdjacencySets . map (fmap Set.fromList) == stars
  20455. 1550.05 s [algebraic-graphs] OK: overlay (fromAdjacencySets xs) (fromAdjacencySets ys) == fromAdjacencySets (xs ++ ys)
  20456. 1550.05 s [algebraic-graphs]
  20457. 1550.05 s [algebraic-graphs] ============ AdjacencyMap.isSubgraphOf ============
  20458. 1550.05 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  20459. 1550.05 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  20460. 1550.05 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  20461. 1550.05 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  20462. 1550.05 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  20463. 1550.05 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  20464. 1550.05 s [algebraic-graphs]
  20465. 1550.05 s [algebraic-graphs] ============ AdjacencyMap.toGraph et al. ============
  20466. 1550.05 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  20467. 1550.05 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  20468. 1550.05 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  20469. 1550.05 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  20470. 1550.05 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  20471. 1550.05 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  20472. 1550.05 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  20473. 1550.05 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  20474. 1550.05 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  20475. 1550.05 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  20476. 1550.05 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  20477. 1550.05 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  20478. 1550.05 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  20479. 1550.05 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  20480. 1550.05 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  20481. 1550.05 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  20482. 1550.05 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  20483. 1550.05 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  20484. 1550.05 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  20485. 1550.05 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  20486. 1550.05 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  20487. 1550.05 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  20488. 1550.05 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  20489. 1550.05 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  20490. 1550.05 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  20491. 1550.05 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  20492. 1550.05 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  20493. 1550.05 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  20494. 1550.05 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  20495. 1550.05 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  20496. 1550.05 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  20497. 1550.05 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  20498. 1550.05 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  20499. 1551.80 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  20500. 1551.80 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  20501. 1551.80 s [algebraic-graphs]
  20502. 1551.80 s [algebraic-graphs] ============ AdjacencyMap.foldg ============
  20503. 1551.80 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  20504. 1551.80 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  20505. 1551.80 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  20506. 1551.80 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  20507. 1551.80 s [algebraic-graphs]
  20508. 1551.80 s [algebraic-graphs] ============ AdjacencyMap.isEmpty ============
  20509. 1551.80 s [algebraic-graphs] OK: isEmpty empty == True
  20510. 1551.80 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  20511. 1551.80 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  20512. 1551.80 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  20513. 1551.80 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  20514. 1551.80 s [algebraic-graphs]
  20515. 1551.80 s [algebraic-graphs] ============ AdjacencyMap.hasVertex ============
  20516. 1551.80 s [algebraic-graphs] OK: hasVertex x empty == False
  20517. 1551.80 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20518. 1551.80 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  20519. 1551.80 s [algebraic-graphs]
  20520. 1551.80 s [algebraic-graphs] ============ AdjacencyMap.hasEdge ============
  20521. 1551.80 s [algebraic-graphs] OK: hasEdge x y empty == False
  20522. 1551.80 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  20523. 1551.80 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  20524. 1551.80 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  20525. 1551.80 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  20526. 1551.80 s [algebraic-graphs]
  20527. 1551.80 s [algebraic-graphs] ============ AdjacencyMap.vertexCount ============
  20528. 1551.80 s [algebraic-graphs] OK: vertexCount empty == 0
  20529. 1551.80 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20530. 1551.80 s [algebraic-graphs] OK: vertexCount == length . vertexList
  20531. 1551.80 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  20532. 1551.80 s [algebraic-graphs]
  20533. 1551.80 s [algebraic-graphs] ============ AdjacencyMap.edgeCount ============
  20534. 1551.80 s [algebraic-graphs] OK: edgeCount empty == 0
  20535. 1551.81 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20536. 1551.81 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  20537. 1551.81 s [algebraic-graphs] OK: edgeCount == length . edgeList
  20538. 1551.81 s [algebraic-graphs]
  20539. 1551.81 s [algebraic-graphs] ============ AdjacencyMap.vertexList ============
  20540. 1551.81 s [algebraic-graphs] OK: vertexList empty == []
  20541. 1551.81 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  20542. 1551.81 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  20543. 1551.81 s [algebraic-graphs]
  20544. 1551.81 s [algebraic-graphs] ============ AdjacencyMap.vertexSet ============
  20545. 1551.81 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  20546. 1551.81 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  20547. 1551.81 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  20548. 1551.81 s [algebraic-graphs]
  20549. 1551.81 s [algebraic-graphs] ============ AdjacencyMap.vertexIntSet ============
  20550. 1551.81 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  20551. 1551.81 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  20552. 1551.81 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  20553. 1551.81 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  20554. 1551.81 s [algebraic-graphs]
  20555. 1551.81 s [algebraic-graphs] ============ AdjacencyMap.edgeList ============
  20556. 1551.81 s [algebraic-graphs] OK: edgeList empty == []
  20557. 1551.81 s [algebraic-graphs] OK: edgeList (vertex x) == []
  20558. 1551.81 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  20559. 1551.81 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  20560. 1551.81 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  20561. 1551.81 s [algebraic-graphs]
  20562. 1551.81 s [algebraic-graphs] ============ AdjacencyMap.edgeSet ============
  20563. 1551.81 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  20564. 1551.81 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  20565. 1551.81 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  20566. 1551.81 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  20567. 1551.81 s [algebraic-graphs]
  20568. 1551.81 s [algebraic-graphs] ============ AdjacencyMap.adjacencyList ============
  20569. 1551.81 s [algebraic-graphs] OK: adjacencyList empty == []
  20570. 1551.81 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  20571. 1551.81 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  20572. 1551.81 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  20573. 1551.81 s [algebraic-graphs]
  20574. 1551.81 s [algebraic-graphs] ============ AdjacencyMap.preSet ============
  20575. 1551.81 s [algebraic-graphs] OK: preSet x empty == Set.empty
  20576. 1551.81 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  20577. 1551.81 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  20578. 1551.81 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  20579. 1551.81 s [algebraic-graphs]
  20580. 1551.81 s [algebraic-graphs] ============ AdjacencyMap.preIntSet ============
  20581. 1551.81 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  20582. 1551.81 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  20583. 1551.81 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  20584. 1551.81 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  20585. 1551.81 s [algebraic-graphs]
  20586. 1551.81 s [algebraic-graphs] ============ AdjacencyMap.postSet ============
  20587. 1551.81 s [algebraic-graphs] OK: postSet x empty == Set.empty
  20588. 1551.81 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  20589. 1551.81 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  20590. 1551.81 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  20591. 1551.81 s [algebraic-graphs]
  20592. 1551.81 s [algebraic-graphs] ============ AdjacencyMap.postIntSet ============
  20593. 1551.81 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  20594. 1551.81 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  20595. 1551.81 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  20596. 1551.81 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  20597. 1551.81 s [algebraic-graphs]
  20598. 1551.81 s [algebraic-graphs] ============ AdjacencyMap.path ============
  20599. 1551.81 s [algebraic-graphs] OK: path [] == empty
  20600. 1551.81 s [algebraic-graphs] OK: path [x] == vertex x
  20601. 1551.81 s [algebraic-graphs] OK: path [x,y] == edge x y
  20602. 1551.81 s [algebraic-graphs]
  20603. 1551.81 s [algebraic-graphs] ============ AdjacencyMap.circuit ============
  20604. 1551.81 s [algebraic-graphs] OK: circuit [] == empty
  20605. 1551.81 s [algebraic-graphs] OK: circuit [x] == edge x x
  20606. 1551.81 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  20607. 1551.81 s [algebraic-graphs]
  20608. 1551.81 s [algebraic-graphs] ============ AdjacencyMap.clique ============
  20609. 1551.81 s [algebraic-graphs] OK: clique [] == empty
  20610. 1551.81 s [algebraic-graphs] OK: clique [x] == vertex x
  20611. 1551.81 s [algebraic-graphs] OK: clique [x,y] == edge x y
  20612. 1551.81 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  20613. 1551.81 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  20614. 1551.81 s [algebraic-graphs]
  20615. 1551.81 s [algebraic-graphs] ============ AdjacencyMap.biclique ============
  20616. 1551.81 s [algebraic-graphs] OK: biclique [] [] == empty
  20617. 1551.81 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  20618. 1551.81 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  20619. 1551.81 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  20620. 1551.81 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  20621. 1551.81 s [algebraic-graphs]
  20622. 1551.81 s [algebraic-graphs] ============ AdjacencyMap.star ============
  20623. 1551.81 s [algebraic-graphs] OK: star x [] == vertex x
  20624. 1551.81 s [algebraic-graphs] OK: star x [y] == edge x y
  20625. 1551.81 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  20626. 1551.81 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  20627. 1551.81 s [algebraic-graphs]
  20628. 1551.81 s [algebraic-graphs] ============ AdjacencyMap.stars ============
  20629. 1551.81 s [algebraic-graphs] OK: stars [] == empty
  20630. 1551.81 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  20631. 1551.81 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  20632. 1551.81 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  20633. 1551.81 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  20634. 1551.81 s [algebraic-graphs] OK: stars . adjacencyList == id
  20635. 1551.81 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  20636. 1551.81 s [algebraic-graphs]
  20637. 1551.81 s [algebraic-graphs] ============ AdjacencyMap.tree ============
  20638. 1551.81 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  20639. 1551.81 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  20640. 1551.81 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  20641. 1551.81 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  20642. 1551.81 s [algebraic-graphs]
  20643. 1551.81 s [algebraic-graphs] ============ AdjacencyMap.forest ============
  20644. 1551.81 s [algebraic-graphs] OK: forest [] == empty
  20645. 1551.81 s [algebraic-graphs] OK: forest [x] == tree x
  20646. 1551.81 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  20647. 1551.81 s [algebraic-graphs] OK: forest == overlays . map tree
  20648. 1551.81 s [algebraic-graphs]
  20649. 1551.81 s [algebraic-graphs] ============ AdjacencyMap.removeVertex ============
  20650. 1551.81 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  20651. 1551.81 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  20652. 1551.81 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  20653. 1551.81 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  20654. 1551.81 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  20655. 1551.81 s [algebraic-graphs]
  20656. 1551.81 s [algebraic-graphs] ============ AdjacencyMap.removeEdge ============
  20657. 1551.81 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  20658. 1551.81 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  20659. 1551.81 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  20660. 1551.81 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  20661. 1551.81 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  20662. 1551.81 s [algebraic-graphs]
  20663. 1551.81 s [algebraic-graphs] ============ AdjacencyMap.replaceVertex ============
  20664. 1551.81 s [algebraic-graphs] OK: replaceVertex x x == id
  20665. 1551.81 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  20666. 1551.81 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  20667. 1551.81 s [algebraic-graphs]
  20668. 1551.81 s [algebraic-graphs] ============ AdjacencyMap.mergeVertices ============
  20669. 1551.81 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  20670. 1551.81 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  20671. 1551.81 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  20672. 1551.81 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  20673. 1551.81 s [algebraic-graphs]
  20674. 1551.81 s [algebraic-graphs] ============ AdjacencyMap.transpose ============
  20675. 1551.81 s [algebraic-graphs] OK: transpose empty == empty
  20676. 1551.81 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  20677. 1551.81 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  20678. 1551.81 s [algebraic-graphs] OK: transpose . transpose == id
  20679. 1551.81 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  20680. 1551.81 s [algebraic-graphs]
  20681. 1551.81 s [algebraic-graphs] ============ AdjacencyMap.gmap ============
  20682. 1551.81 s [algebraic-graphs] OK: gmap f empty == empty
  20683. 1551.81 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  20684. 1551.81 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  20685. 1551.81 s [algebraic-graphs] OK: gmap id == id
  20686. 1551.81 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  20687. 1551.81 s [algebraic-graphs]
  20688. 1551.81 s [algebraic-graphs] ============ AdjacencyMap.induce ============
  20689. 1551.81 s [algebraic-graphs] OK: induce (const True ) x == x
  20690. 1551.81 s [algebraic-graphs] OK: induce (const False) x == empty
  20691. 1551.81 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  20692. 1551.81 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  20693. 1551.81 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  20694. 1551.81 s [algebraic-graphs]
  20695. 1551.81 s [algebraic-graphs] ============ AdjacencyMap.compose ============
  20696. 1551.81 s [algebraic-graphs] OK: compose empty x == empty
  20697. 1551.81 s [algebraic-graphs] OK: compose x empty == empty
  20698. 1551.81 s [algebraic-graphs] OK: compose (vertex x) y == empty
  20699. 1551.81 s [algebraic-graphs] OK: compose x (vertex y) == empty
  20700. 1551.81 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  20701. 1551.81 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  20702. 1555.60 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  20703. 1555.60 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  20704. 1555.69 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  20705. 1555.69 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  20706. 1555.70 s [algebraic-graphs]
  20707. 1555.70 s [algebraic-graphs] ============ AdjacencyMap.closure ============
  20708. 1555.70 s [algebraic-graphs] OK: closure empty == empty
  20709. 1555.70 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  20710. 1555.70 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  20711. 1555.70 s [algebraic-graphs] OK: closure (edge x y) == edges [(x,x), (x,y), (y,y)]
  20712. 1555.70 s [algebraic-graphs] OK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
  20713. 1555.70 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  20714. 1555.70 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  20715. 1555.70 s [algebraic-graphs] OK: closure . closure == closure
  20716. 1555.70 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  20717. 1555.70 s [algebraic-graphs]
  20718. 1555.70 s [algebraic-graphs] ============ AdjacencyMap.reflexiveClosure ============
  20719. 1555.70 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  20720. 1555.70 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  20721. 1555.70 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  20722. 1555.70 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges [(x,x), (x,y), (y,y)]
  20723. 1555.70 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  20724. 1555.70 s [algebraic-graphs]
  20725. 1555.70 s [algebraic-graphs] ============ AdjacencyMap.symmetricClosure ============
  20726. 1555.70 s [algebraic-graphs] OK: symmetricClosure empty == empty
  20727. 1555.70 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  20728. 1555.70 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges [(x,y), (y,x)]
  20729. 1555.70 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  20730. 1555.70 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  20731. 1555.70 s [algebraic-graphs]
  20732. 1555.70 s [algebraic-graphs] ============ AdjacencyMap.transitiveClosure ============
  20733. 1555.70 s [algebraic-graphs] OK: transitiveClosure empty == empty
  20734. 1555.70 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  20735. 1555.70 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  20736. 1555.70 s [algebraic-graphs] OK: transitiveClosure (path $ nub xs) == clique (nub $ xs)
  20737. 1555.70 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  20738. 1555.70 s [algebraic-graphs]
  20739. 1555.70 s [algebraic-graphs] ============ AdjacencyMap.box ============
  20740. 1555.70 s [algebraic-graphs] OK: box x y ~~ box y x
  20741. 1555.70 s [algebraic-graphs] OK: box x (overlay y z) == overlay (box x y) (box x z)
  20742. 1555.70 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  20743. 1555.70 s [algebraic-graphs] OK: box x empty ~~ empty
  20744. 1555.70 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  20745. 1555.70 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  20746. 1555.70 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  20747. 1555.70 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  20748. 1555.70 s [algebraic-graphs]
  20749. 1555.70 s [algebraic-graphs] ============ AdjacencyMap.bfsForest ============
  20750. 1555.70 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0] == empty
  20751. 1555.70 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [1] == edge 1 2
  20752. 1555.70 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2] == vertex 2
  20753. 1555.70 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0,1,2] == vertices [1,2]
  20754. 1555.70 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2,1,0] == vertices [1,2]
  20755. 1555.70 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 1) [1] == vertex 1
  20756. 1555.70 s [algebraic-graphs] OK: isSubgraphOf (forest $ bfsForest x vs) x == True
  20757. 1555.70 s [algebraic-graphs] OK: bfsForest x (vertexList x) == map ( -> Node v []) (nub $ vertexList x)
  20758. 1555.70 s [algebraic-graphs] OK: bfsForest x [] == []
  20759. 1555.70 s [algebraic-graphs] OK: bfsForest empty vs == []
  20760. 1555.70 s [algebraic-graphs] OK: bfsForest (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
  20761. 1555.70 s [algebraic-graphs] OK: forest $ bfsForest (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1] + path [3,4,5]
  20762. 1555.70 s [algebraic-graphs]
  20763. 1555.70 s [algebraic-graphs] ============ AdjacencyMap.bfs ============
  20764. 1555.70 s [algebraic-graphs] OK: bfs (edge 1 2) [0] == []
  20765. 1555.70 s [algebraic-graphs] OK: bfs (edge 1 2) [1] == [[1], [2]]
  20766. 1555.70 s [algebraic-graphs] OK: bfs (edge 1 2) [2] == [[2]]
  20767. 1555.70 s [algebraic-graphs] OK: bfs (edge 1 2) [1,2] == [[1,2]]
  20768. 1555.70 s [algebraic-graphs] OK: bfs (edge 1 2) [2,1] == [[2,1]]
  20769. 1555.70 s [algebraic-graphs] OK: bfs (edge 1 1) [1] == [[1]]
  20770. 1555.70 s [algebraic-graphs] OK: bfs empty vs == []
  20771. 1555.70 s [algebraic-graphs] OK: bfs x [] == []
  20772. 1555.70 s [algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,2] == [[1,2]]
  20773. 1555.70 s [algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,3] == [[1,3], [2,4]]
  20774. 1555.70 s [algebraic-graphs] OK: bfs (3 * (1 + 4) * (1 + 5)) [3] == [[3], [1,4,5]]
  20775. 1555.70 s [algebraic-graphs] OK: bfs (circuit [1..5] + circuit [5,4..1]) [2] == [[2], [1,3], [5,4]]
  20776. 1555.70 s [algebraic-graphs] OK: concat $ bfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,4,1,5]
  20777. 1555.70 s [algebraic-graphs] OK: map concat . transpose . map levels . bfsForest x == bfs x
  20778. 1555.70 s [algebraic-graphs]
  20779. 1555.70 s [algebraic-graphs] ============ AdjacencyMap.dfsForest ============
  20780. 1555.70 s [algebraic-graphs] OK: forest $ dfsForest empty == empty
  20781. 1555.70 s [algebraic-graphs] OK: forest $ dfsForest (edge 1 1) == vertex 1
  20782. 1555.70 s [algebraic-graphs] OK: forest $ dfsForest (edge 1 2) == edge 1 2
  20783. 1555.70 s [algebraic-graphs] OK: forest $ dfsForest (edge 2 1) == vertices [1,2]
  20784. 1555.70 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForest x) x == True
  20785. 1555.70 s [algebraic-graphs] OK: isDfsForestOf (dfsForest x) x == True
  20786. 1555.70 s [algebraic-graphs] OK: dfsForest . forest . dfsForest == dfsForest
  20787. 1555.70 s [algebraic-graphs] OK: dfsForest (vertices vs) == map (\v -> Node v []) (nub $ sort vs)
  20788. 1555.70 s [algebraic-graphs] OK: dfsForest $ 3 * (1 + 4) * (1 + 5) == <correct result>
  20789. 1555.70 s [algebraic-graphs] OK: forest (dfsForest $ circuit [1..5] + circuit [5,4..1]) == path [1,2,3,4,5]
  20790. 1555.70 s [algebraic-graphs]
  20791. 1555.70 s [algebraic-graphs] ============ AdjacencyMap.dfsForestFrom ============
  20792. 1555.70 s [algebraic-graphs] OK: forest $ dfsForestFrom empty vs == empty
  20793. 1555.70 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 1) [1] == vertex 1
  20794. 1555.70 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [0] == empty
  20795. 1555.70 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1] == edge 1 2
  20796. 1555.70 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2] == vertex 2
  20797. 1555.70 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1,2] == edge 1 2
  20798. 1555.70 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2,1] == vertices [1,2]
  20799. 1555.70 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForestFrom x vs) x == True
  20800. 1555.70 s [algebraic-graphs] OK: isDfsForestOf (dfsForestFrom x (vertexList x)) x == True
  20801. 1555.70 s [algebraic-graphs] OK: dfsForestFrom x (vertexList x) == dfsForest x
  20802. 1555.70 s [algebraic-graphs] OK: dfsForestFrom x [] == []
  20803. 1555.70 s [algebraic-graphs] OK: dfsForestFrom (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
  20804. 1555.70 s [algebraic-graphs] OK: forest $ dfsForestFrom (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1,5,4]
  20805. 1555.70 s [algebraic-graphs]
  20806. 1555.70 s [algebraic-graphs] ============ AdjacencyMap.dfs ============
  20807. 1555.70 s [algebraic-graphs] OK: dfs empty vs == []
  20808. 1555.70 s [algebraic-graphs] OK: dfs (edge 1 1) [1] == [1]
  20809. 1555.70 s [algebraic-graphs] OK: dfs (edge 1 2) [0] == []
  20810. 1555.70 s [algebraic-graphs] OK: dfs (edge 1 2) [1] == [1,2]
  20811. 1555.70 s [algebraic-graphs] OK: dfs (edge 1 2) [2] == [2]
  20812. 1555.70 s [algebraic-graphs] OK: dfs (edge 1 2) [1,2] == [1,2]
  20813. 1555.70 s [algebraic-graphs] OK: dfs (edge 1 2) [2,1] == [2,1]
  20814. 1555.70 s [algebraic-graphs] OK: dfs x [] == []
  20815. 1555.70 s [algebraic-graphs]
  20816. 1555.70 s [algebraic-graphs] OK: and [ hasVertex v x | v <- dfs x vs ] == True
  20817. 1555.70 s [algebraic-graphs] OK: dfs (3 * (1 + 4) * (1 + 5)) [1,4] == [1,5,4]
  20818. 1555.70 s [algebraic-graphs] OK: dfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,1,5,4]
  20819. 1555.70 s [algebraic-graphs]
  20820. 1555.70 s [algebraic-graphs] ============ AdjacencyMap.dfs ============
  20821. 1555.70 s [algebraic-graphs] OK: reachable empty x == []
  20822. 1555.70 s [algebraic-graphs] OK: reachable (vertex 1) 1 == [1]
  20823. 1555.70 s [algebraic-graphs] OK: reachable (edge 1 1) 1 == [1]
  20824. 1555.70 s [algebraic-graphs] OK: reachable (edge 1 2) 0 == []
  20825. 1555.70 s [algebraic-graphs] OK: reachable (edge 1 2) 1 == [1,2]
  20826. 1555.70 s [algebraic-graphs] OK: reachable (edge 1 2) 2 == [2]
  20827. 1555.70 s [algebraic-graphs] OK: reachable (path [1..8] ) 4 == [4..8]
  20828. 1555.70 s [algebraic-graphs] OK: reachable (circuit [1..8] ) 4 == [4..8] ++ [1..3]
  20829. 1555.70 s [algebraic-graphs] OK: reachable (clique [8,7..1]) 8 == [8] ++ [1..7]
  20830. 1555.70 s [algebraic-graphs]
  20831. 1555.70 s [algebraic-graphs] OK: and [ hasVertex v x | v <- reachable x y ] == True
  20832. 1555.70 s [algebraic-graphs]
  20833. 1555.70 s [algebraic-graphs] ============ AdjacencyMap.topSort ============
  20834. 1555.70 s [algebraic-graphs] OK: topSort (1 * 2 + 3 * 1) == Right [3,1,2]
  20835. 1555.70 s [algebraic-graphs] OK: topSort (path [1..5]) == Right [1..5]
  20836. 1555.70 s [algebraic-graphs] OK: topSort (3 * (1 * 4 + 2 * 5)) == Right [3,1,2,4,5]
  20837. 1555.70 s [algebraic-graphs] OK: topSort (1 * 2 + 2 * 1) == Left (2 :| [1])
  20838. 1555.70 s [algebraic-graphs] OK: topSort (path [5,4..1] + edge 2 4) == Left (4 :| [3,2])
  20839. 1555.70 s [algebraic-graphs] OK: topSort (circuit [1..5]) == Left (3 :| [1,2])
  20840. 1555.70 s [algebraic-graphs] OK: topSort (circuit [1..3] + circuit [3,2,1]) == Left (3 :| [2])
  20841. 1555.70 s [algebraic-graphs] OK: topSort (1 * 2 + (5 + 2) * 1 + 3 * 4 * 3) == Left (1 :| [2])
  20842. 1555.70 s [algebraic-graphs] OK: fmap (flip isTopSortOf x) (topSort x) /= Right False
  20843. 1555.70 s [algebraic-graphs] OK: topSort . vertices == Right . nub . sort
  20844. 1555.70 s [algebraic-graphs]
  20845. 1555.70 s [algebraic-graphs] ============ AdjacencyMap.testIsAcyclic ============
  20846. 1555.70 s [algebraic-graphs] OK: isAcyclic (1 * 2 + 3 * 1) == True
  20847. 1555.70 s [algebraic-graphs] OK: isAcyclic (1 * 2 + 2 * 1) == False
  20848. 1555.70 s [algebraic-graphs] OK: isAcyclic . circuit == null
  20849. 1555.70 s [algebraic-graphs] OK: isAcyclic == isRight . topSort
  20850. 1555.70 s [algebraic-graphs]
  20851. 1555.70 s [algebraic-graphs] ============ AdjacencyMap.isDfsForestOf ============
  20852. 1555.70 s [algebraic-graphs] OK: isDfsForestOf [] empty == True
  20853. 1555.70 s [algebraic-graphs] OK: isDfsForestOf [] (vertex 1) == False
  20854. 1555.70 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 1) == True
  20855. 1555.70 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 2) == False
  20856. 1555.70 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 1 []] (vertex 1) == False
  20857. 1555.70 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 1) == True
  20858. 1555.70 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 2) == False
  20859. 1562.47 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (edge 1 2) == False
  20860. 1562.47 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (edge 1 2) == True
  20861. 1562.51 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (edge 1 2) == True
  20862. 1562.51 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (vertices [1,2]) == True
  20863. 1562.51 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (vertices [1,2]) == True
  20864. 1562.51 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (vertices [1,2]) == False
  20865. 1562.51 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 [Node 3 []]]] (path [1,2,3]) == True
  20866. 1562.51 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 3 [Node 2 []]]] (path [1,2,3]) == False
  20867. 1562.51 s [algebraic-graphs] OK: isDfsForestOf [Node 3 [], Node 1 [Node 2 []]] (path [1,2,3]) == True
  20868. 1562.51 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [Node 3 []], Node 1 []] (path [1,2,3]) == True
  20869. 1562.51 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 [Node 3 []]] (path [1,2,3]) == False
  20870. 1562.51 s [algebraic-graphs]
  20871. 1562.51 s [algebraic-graphs] ============ AdjacencyMap.isTopSortOf ============
  20872. 1562.51 s [algebraic-graphs] OK: isTopSortOf [3,1,2] (1 * 2 + 3 * 1) == True
  20873. 1562.51 s [algebraic-graphs] OK: isTopSortOf [1,2,3] (1 * 2 + 3 * 1) == False
  20874. 1562.51 s [algebraic-graphs] OK: isTopSortOf [] (1 * 2 + 3 * 1) == False
  20875. 1562.51 s [algebraic-graphs] OK: isTopSortOf [] empty == True
  20876. 1562.51 s [algebraic-graphs] OK: isTopSortOf [x] (vertex x) == True
  20877. 1562.51 s [algebraic-graphs] OK: isTopSortOf [x] (edge x x) == False
  20878. 1562.51 s [algebraic-graphs]
  20879. 1562.51 s [algebraic-graphs] ============ AdjacencyMap.induceJust ============
  20880. 1562.51 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  20881. 1562.51 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  20882. 1562.51 s [algebraic-graphs] OK: induceJust . gmap Just == id
  20883. 1562.51 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  20884. 1562.51 s [algebraic-graphs]
  20885. 1562.51 s [algebraic-graphs] ============ AdjacencyMap.scc ============
  20886. 1562.51 s [algebraic-graphs] OK: scc empty == empty
  20887. 1562.51 s [algebraic-graphs] OK: scc (vertex x) == vertex (NonEmpty.vertex x)
  20888. 1562.51 s [algebraic-graphs] OK: scc (vertices xs) == vertices (map NonEmpty.vertex xs)
  20889. 1562.51 s [algebraic-graphs] OK: scc (edge 1 1) == vertex (NonEmpty.edge 1 1)
  20890. 1562.51 s [algebraic-graphs] OK: scc (edge 1 2) == edge (NonEmpty.vertex 1) (NonEmpty.vertex 2)
  20891. 1562.51 s [algebraic-graphs] OK: scc (circuit (1:xs)) == vertex (NonEmpty.circuit1 (1 :| xs))
  20892. 1562.51 s [algebraic-graphs] OK: scc (3 * 1 * 4 * 1 * 5) == <correct result>
  20893. 1562.51 s [algebraic-graphs] OK: isAcyclic . scc == const True
  20894. 1562.51 s [algebraic-graphs] OK: isAcyclic x == (scc x == gmap NonEmpty.vertex x)
  20895. 1562.51 s [algebraic-graphs] OK: scc g == KL.scc g
  20896. 1562.51 s [algebraic-graphs]
  20897. 1562.51 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Num ============
  20898. 1562.51 s [algebraic-graphs] OK: 0 == rightVertex 0
  20899. 1562.51 s [algebraic-graphs] OK: swap 1 == leftVertex 1
  20900. 1562.51 s [algebraic-graphs] OK: swap 1 + 2 == vertices [1] [2]
  20901. 1562.51 s [algebraic-graphs] OK: swap 1 * 2 == edge 1 2
  20902. 1562.51 s [algebraic-graphs] OK: swap 1 + 2 * swap 3 == overlay (leftVertex 1) (edge 3 2)
  20903. 1562.51 s [algebraic-graphs] OK: swap 1 * (2 + swap 3) == connect (leftVertex 1) (vertices [3] [2])
  20904. 1562.51 s [algebraic-graphs]
  20905. 1562.51 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Show ============
  20906. 1562.51 s [algebraic-graphs] OK: show empty == "empty"
  20907. 1562.51 s [algebraic-graphs] OK: show 1 == "rightVertex 1"
  20908. 1562.51 s [algebraic-graphs] OK: show (swap 2) == "leftVertex 2"
  20909. 1562.51 s [algebraic-graphs] OK: show 1 + 2 == "vertices [] [1,2]"
  20910. 1562.51 s [algebraic-graphs] OK: show (swap (1 + 2)) == "vertices [1,2] []"
  20911. 1562.51 s [algebraic-graphs] OK: show (swap 1 * 2) == "edge 1 2"
  20912. 1562.51 s [algebraic-graphs] OK: show (swap 1 * 2 * swap 3) == "edges [(1,2),(3,2)]"
  20913. 1562.51 s [algebraic-graphs] OK: show (swap 1 * 2 + swap 3) == "overlay (leftVertex 3) (edge 1 2)"
  20914. 1562.51 s [algebraic-graphs]
  20915. 1562.51 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Eq ============
  20916. 1562.51 s [algebraic-graphs] OK: (x == y) == (leftAdjacencyMap x == leftAdjacencyMap y && rightAdjacencyMap x == rightAdjacencyMap y)
  20917. 1562.51 s [algebraic-graphs]
  20918. 1562.51 s [algebraic-graphs] OK: x + y == y + x
  20919. 1562.51 s [algebraic-graphs] OK: x + (y + z) == (x + y) + z
  20920. 1562.51 s [algebraic-graphs] OK: x * empty == x
  20921. 1562.51 s [algebraic-graphs] OK: empty * x == x
  20922. 1562.51 s [algebraic-graphs] OK: x * y == y * x
  20923. 1562.51 s [algebraic-graphs] OK: x * (y * z) == (x * y) * z
  20924. 1562.51 s [algebraic-graphs] OK: x * (y + z) == x * y + x * z
  20925. 1562.51 s [algebraic-graphs] OK: (x + y) * z == x * z + y * z
  20926. 1562.51 s [algebraic-graphs] OK: x * y * z == x * y + x * z + y * z
  20927. 1562.51 s [algebraic-graphs] OK: x + empty == x
  20928. 1562.51 s [algebraic-graphs] OK: empty + x == x
  20929. 1562.51 s [algebraic-graphs] OK: x + x == x
  20930. 1562.51 s [algebraic-graphs] OK: x * y + x + y == x * y
  20931. 1562.51 s [algebraic-graphs] OK: x * x * x == x * x
  20932. 1562.51 s [algebraic-graphs]
  20933. 1562.51 s [algebraic-graphs] OK: leftVertex x * leftVertex y == leftVertex x + leftVertex y
  20934. 1562.51 s [algebraic-graphs] OK: rightVertex x * rightVertex y == rightVertex x + rightVertex y
  20935. 1562.51 s [algebraic-graphs]
  20936. 1562.51 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftAdjacencyMap ============
  20937. 1562.51 s [algebraic-graphs] OK: leftAdjacencyMap empty == Map.empty
  20938. 1562.51 s [algebraic-graphs] OK: leftAdjacencyMap (leftVertex x) == Map.singleton x Set.empty
  20939. 1562.51 s [algebraic-graphs] OK: leftAdjacencyMap (rightVertex x) == Map.empty
  20940. 1562.51 s [algebraic-graphs] OK: leftAdjacencyMap (edge x y) == Map.singleton x (Set.singleton y)
  20941. 1562.51 s [algebraic-graphs]
  20942. 1562.51 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightAdjacencyMap ============
  20943. 1562.51 s [algebraic-graphs] OK: rightAdjacencyMap empty == Map.empty
  20944. 1562.51 s [algebraic-graphs] OK: rightAdjacencyMap (leftVertex x) == Map.empty
  20945. 1562.51 s [algebraic-graphs] OK: rightAdjacencyMap (rightVertex x) == Map.singleton x Set.empty
  20946. 1562.51 s [algebraic-graphs] OK: rightAdjacencyMap (edge x y) == Map.singleton y (Set.singleton x)
  20947. 1562.51 s [algebraic-graphs]
  20948. 1562.51 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.empty ============
  20949. 1562.51 s [algebraic-graphs] OK: isEmpty empty == True
  20950. 1562.51 s [algebraic-graphs] OK: leftAdjacencyMap empty == Map.empty
  20951. 1562.51 s [algebraic-graphs] OK: rightAdjacencyMap empty == Map.empty
  20952. 1562.51 s [algebraic-graphs] OK: hasVertex x empty == False
  20953. 1562.51 s [algebraic-graphs]
  20954. 1562.51 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertex ============
  20955. 1562.51 s [algebraic-graphs] OK: leftAdjacencyMap (leftVertex x) == Map.singleton x Set.empty
  20956. 1562.51 s [algebraic-graphs] OK: rightAdjacencyMap (leftVertex x) == Map.empty
  20957. 1562.51 s [algebraic-graphs] OK: hasLeftVertex x (leftVertex y) == (x == y)
  20958. 1562.51 s [algebraic-graphs] OK: hasRightVertex x (leftVertex y) == False
  20959. 1562.51 s [algebraic-graphs] OK: hasEdge x y (leftVertex z) == False
  20960. 1562.51 s [algebraic-graphs]
  20961. 1562.51 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertex ============
  20962. 1562.51 s [algebraic-graphs] OK: leftAdjacencyMap (rightVertex x) == Map.empty
  20963. 1562.51 s [algebraic-graphs] OK: rightAdjacencyMap (rightVertex x) == Map.singleton x Set.empty
  20964. 1562.51 s [algebraic-graphs] OK: hasLeftVertex x (rightVertex y) == False
  20965. 1562.51 s [algebraic-graphs] OK: hasRightVertex x (rightVertex y) == (x == y)
  20966. 1562.51 s [algebraic-graphs] OK: hasEdge x y (rightVertex z) == False
  20967. 1562.51 s [algebraic-graphs]
  20968. 1562.51 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertex ============
  20969. 1562.51 s [algebraic-graphs] OK: vertex . Left == leftVertex
  20970. 1562.51 s [algebraic-graphs] OK: vertex . Right == rightVertex
  20971. 1562.51 s [algebraic-graphs]
  20972. 1562.51 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edge ============
  20973. 1562.51 s [algebraic-graphs] OK: edge x y == connect (leftVertex x) (rightVertex y)
  20974. 1562.51 s [algebraic-graphs] OK: leftAdjacencyMap (edge x y) == Map.singleton x (Set.singleton y)
  20975. 1562.51 s [algebraic-graphs] OK: rightAdjacencyMap (edge x y) == Map.singleton y (Set.singleton x)
  20976. 1562.51 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  20977. 1562.51 s [algebraic-graphs] OK: hasEdge 1 2 (edge 2 1) == False
  20978. 1562.51 s [algebraic-graphs]
  20979. 1562.51 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.overlay ============
  20980. 1562.51 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  20981. 1562.51 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  20982. 1562.51 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  20983. 1562.51 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  20984. 1562.51 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  20985. 1562.51 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  20986. 1562.51 s [algebraic-graphs]
  20987. 1562.51 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.connect ============
  20988. 1562.51 s [algebraic-graphs] OK: connect (leftVertex x) (leftVertex y) == vertices [x,y] []
  20989. 1562.51 s [algebraic-graphs] OK: connect (leftVertex x) (rightVertex y) == edge x y
  20990. 1562.51 s [algebraic-graphs] OK: connect (rightVertex x) (leftVertex y) == edge y x
  20991. 1562.51 s [algebraic-graphs] OK: connect (rightVertex x) (rightVertex y) == vertices [] [x,y]
  20992. 1562.51 s [algebraic-graphs] OK: connect (vertices xs1 ys1) (vertices xs2 ys2) == overlay (biclique xs1 ys2) (biclique xs2 ys1)
  20993. 1562.51 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  20994. 1562.51 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  20995. 1562.51 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  20996. 1562.51 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  20997. 1562.51 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  20998. 1562.51 s [algebraic-graphs] OK: edgeCount (connect x y) >= leftVertexCount x * rightVertexCount y
  20999. 1562.51 s [algebraic-graphs] OK: edgeCount (connect x y) <= leftVertexCount x * rightVertexCount y + rightVertexCount x * leftVertexCount y + edgeCount x + edgeCount y
  21000. 1562.51 s [algebraic-graphs]
  21001. 1562.51 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertices ============
  21002. 1562.51 s [algebraic-graphs] OK: vertices [] [] == empty
  21003. 1562.51 s [algebraic-graphs] OK: vertices [x] [] == leftVertex x
  21004. 1562.51 s [algebraic-graphs] OK: vertices [] [x] == rightVertex x
  21005. 1562.51 s [algebraic-graphs] OK: vertices xs ys == overlays (map leftVertex xs ++ map rightVertex ys)
  21006. 1562.51 s [algebraic-graphs] OK: hasLeftVertex x (vertices xs ys) == elem x xs
  21007. 1562.52 s [algebraic-graphs] OK: hasRightVertex y (vertices xs ys) == elem y ys
  21008. 1562.52 s [algebraic-graphs]
  21009. 1562.52 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edges ============
  21010. 1562.52 s [algebraic-graphs] OK: edges [] == empty
  21011. 1562.52 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  21012. 1562.52 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  21013. 1562.52 s [algebraic-graphs] OK: hasEdge x y . edges == elem (x,y)
  21014. 1562.52 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  21015. 1562.52 s [algebraic-graphs]
  21016. 1562.52 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.overlays ============
  21017. 1562.52 s [algebraic-graphs] OK: overlays [] == empty
  21018. 1562.52 s [algebraic-graphs] OK: overlays [x] == x
  21019. 1562.52 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  21020. 1562.52 s [algebraic-graphs] OK: overlays == foldr overlay empty
  21021. 1562.52 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  21022. 1562.52 s [algebraic-graphs]
  21023. 1562.52 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.connects ============
  21024. 1562.52 s [algebraic-graphs] OK: connects [] == empty
  21025. 1562.52 s [algebraic-graphs] OK: connects [x] == x
  21026. 1562.52 s [algebraic-graphs] OK: connects [x,y] == connect x y
  21027. 1562.52 s [algebraic-graphs] OK: connects == foldr connect empty
  21028. 1562.52 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  21029. 1562.52 s [algebraic-graphs]
  21030. 1562.52 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.swap ============
  21031. 1563.93 s [algebraic-graphs] OK: swap empty == empty
  21032. 1563.93 s [algebraic-graphs] OK: swap . leftVertex == rightVertex
  21033. 1563.93 s [algebraic-graphs] OK: swap (vertices xs ys) == vertices ys xs
  21034. 1563.93 s [algebraic-graphs] OK: swap (edge x y) == edge y x
  21035. 1563.93 s [algebraic-graphs] OK: swap . edges == edges . map Data.Tuple.swap
  21036. 1563.93 s [algebraic-graphs] OK: swap . swap == id
  21037. 1563.93 s [algebraic-graphs]
  21038. 1563.93 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.toBipartite ============
  21039. 1563.93 s [algebraic-graphs] OK: toBipartite empty == empty
  21040. 1563.93 s [algebraic-graphs] OK: toBipartite (vertex (Left x)) == leftVertex x
  21041. 1563.93 s [algebraic-graphs] OK: toBipartite (vertex (Right x)) == rightVertex x
  21042. 1563.93 s [algebraic-graphs] OK: toBipartite (edge (Left x) (Left y)) == vertices [x,y] []
  21043. 1563.93 s [algebraic-graphs] OK: toBipartite (edge (Left x) (Right y)) == edge x y
  21044. 1563.93 s [algebraic-graphs] OK: toBipartite (edge (Right x) (Left y)) == edge y x
  21045. 1563.93 s [algebraic-graphs] OK: toBipartite (edge (Right x) (Right y)) == vertices [] [x,y]
  21046. 1563.93 s [algebraic-graphs] OK: toBipartite . clique == uncurry biclique . partitionEithers
  21047. 1563.93 s [algebraic-graphs] OK: toBipartite . fromBipartite == id
  21048. 1563.93 s [algebraic-graphs]
  21049. 1563.93 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.toBipartiteWith ============
  21050. 1563.93 s [algebraic-graphs] OK: toBipartiteWith f empty == empty
  21051. 1563.93 s [algebraic-graphs] OK: toBipartiteWith Left x == vertices (vertexList x) []
  21052. 1563.93 s [algebraic-graphs] OK: toBipartiteWith Right x == vertices [] (vertexList x)
  21053. 1563.93 s [algebraic-graphs] OK: toBipartiteWith f == toBipartite . gmap f
  21054. 1563.93 s [algebraic-graphs] OK: toBipartiteWith id == toBipartite
  21055. 1563.93 s [algebraic-graphs]
  21056. 1563.93 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.fromBipartite ============
  21057. 1563.93 s [algebraic-graphs] OK: fromBipartite empty == empty
  21058. 1563.93 s [algebraic-graphs] OK: fromBipartite (leftVertex x) == vertex (Left x)
  21059. 1563.93 s [algebraic-graphs] OK: fromBipartite (edge x y) == edges [(Left x, Right y), (Right y, Left x)]
  21060. 1563.93 s [algebraic-graphs]
  21061. 1563.93 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.fromBipartiteWith ============
  21062. 1563.93 s [algebraic-graphs] OK: fromBipartiteWith Left Right == fromBipartite
  21063. 1563.93 s [algebraic-graphs] OK: fromBipartiteWith id id (vertices xs ys) == vertices (xs ++ ys)
  21064. 1563.93 s [algebraic-graphs] OK: fromBipartiteWith id id . edges == symmetricClosure . edges
  21065. 1563.93 s [algebraic-graphs]
  21066. 1563.93 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.isEmpty ============
  21067. 1563.93 s [algebraic-graphs] OK: isEmpty empty == True
  21068. 1563.93 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  21069. 1563.93 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  21070. 1563.93 s [algebraic-graphs] OK: isEmpty == (==) empty
  21071. 1563.93 s [algebraic-graphs]
  21072. 1563.93 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.hasLeftVertex ============
  21073. 1563.93 s [algebraic-graphs] OK: hasLeftVertex x empty == False
  21074. 1563.93 s [algebraic-graphs] OK: hasLeftVertex x (leftVertex y) == (x == y)
  21075. 1563.93 s [algebraic-graphs] OK: hasLeftVertex x (rightVertex y) == False
  21076. 1563.93 s [algebraic-graphs]
  21077. 1563.93 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.hasRightVertex ============
  21078. 1563.93 s [algebraic-graphs] OK: hasRightVertex x empty == False
  21079. 1563.93 s [algebraic-graphs] OK: hasRightVertex x (leftVertex y) == False
  21080. 1563.93 s [algebraic-graphs] OK: hasRightVertex x (rightVertex y) == (x == y)
  21081. 1563.93 s [algebraic-graphs]
  21082. 1563.93 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.hasVertex ============
  21083. 1563.93 s [algebraic-graphs] OK: hasVertex . Left == hasLeftVertex
  21084. 1563.93 s [algebraic-graphs] OK: hasVertex . Right == hasRightVertex
  21085. 1563.93 s [algebraic-graphs]
  21086. 1563.93 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.hasEdge ============
  21087. 1563.93 s [algebraic-graphs] OK: hasEdge x y empty == False
  21088. 1563.93 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  21089. 1563.93 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  21090. 1563.93 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  21091. 1563.93 s [algebraic-graphs]
  21092. 1563.93 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertexCount ============
  21093. 1563.93 s [algebraic-graphs] OK: leftVertexCount empty == 0
  21094. 1563.93 s [algebraic-graphs] OK: leftVertexCount (leftVertex x) == 1
  21095. 1563.93 s [algebraic-graphs] OK: leftVertexCount (rightVertex x) == 0
  21096. 1563.93 s [algebraic-graphs] OK: leftVertexCount (edge x y) == 1
  21097. 1563.93 s [algebraic-graphs] OK: leftVertexCount . edges == length . nub . map fst
  21098. 1563.93 s [algebraic-graphs]
  21099. 1563.93 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertexCount ============
  21100. 1563.93 s [algebraic-graphs] OK: rightVertexCount empty == 0
  21101. 1563.93 s [algebraic-graphs] OK: rightVertexCount (leftVertex x) == 0
  21102. 1563.93 s [algebraic-graphs] OK: rightVertexCount (rightVertex x) == 1
  21103. 1563.93 s [algebraic-graphs] OK: rightVertexCount (edge x y) == 1
  21104. 1563.93 s [algebraic-graphs] OK: rightVertexCount . edges == length . nub . map snd
  21105. 1563.93 s [algebraic-graphs]
  21106. 1563.93 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertexCount ============
  21107. 1563.93 s [algebraic-graphs] OK: vertexCount empty == 0
  21108. 1563.93 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  21109. 1563.93 s [algebraic-graphs] OK: vertexCount (edge x y) == 2
  21110. 1563.93 s [algebraic-graphs] OK: vertexCount x == leftVertexCount x + rightVertexCount x
  21111. 1563.93 s [algebraic-graphs]
  21112. 1563.93 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edgeCount ============
  21113. 1563.93 s [algebraic-graphs] OK: edgeCount empty == 0
  21114. 1563.93 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  21115. 1563.93 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  21116. 1563.93 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  21117. 1563.93 s [algebraic-graphs]
  21118. 1563.93 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertexList ============
  21119. 1563.93 s [algebraic-graphs] OK: leftVertexList empty == []
  21120. 1563.93 s [algebraic-graphs] OK: leftVertexList (leftVertex x) == [x]
  21121. 1563.93 s [algebraic-graphs] OK: leftVertexList (rightVertex x) == []
  21122. 1563.93 s [algebraic-graphs] OK: leftVertexList . flip vertices [] == nub . sort
  21123. 1563.93 s [algebraic-graphs]
  21124. 1563.93 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertexList ============
  21125. 1563.93 s [algebraic-graphs] OK: rightVertexList empty == []
  21126. 1563.93 s [algebraic-graphs] OK: rightVertexList (leftVertex x) == []
  21127. 1563.93 s [algebraic-graphs] OK: rightVertexList (rightVertex x) == [x]
  21128. 1563.93 s [algebraic-graphs] OK: rightVertexList . vertices [] == nub . sort
  21129. 1563.93 s [algebraic-graphs]
  21130. 1563.93 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertexList ============
  21131. 1563.93 s [algebraic-graphs] OK: vertexList empty == []
  21132. 1563.93 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  21133. 1563.93 s [algebraic-graphs] OK: vertexList (edge x y) == [Left x, Right y]
  21134. 1563.93 s [algebraic-graphs] OK: vertexList (vertices (lefts xs) (rights xs)) == nub (sort xs)
  21135. 1563.93 s [algebraic-graphs]
  21136. 1563.93 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edgeList ============
  21137. 1563.93 s [algebraic-graphs] OK: edgeList empty == []
  21138. 1563.93 s [algebraic-graphs] OK: edgeList (vertex x) == []
  21139. 1563.93 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  21140. 1563.93 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  21141. 1563.93 s [algebraic-graphs]
  21142. 1563.93 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertexSet ============
  21143. 1563.93 s [algebraic-graphs] OK: leftVertexSet empty == Set.empty
  21144. 1563.93 s [algebraic-graphs] OK: leftVertexSet . leftVertex == Set.singleton
  21145. 1563.93 s [algebraic-graphs] OK: leftVertexSet . rightVertex == const Set.empty
  21146. 1563.93 s [algebraic-graphs] OK: leftVertexSet . flip vertices [] == Set.fromList
  21147. 1563.93 s [algebraic-graphs]
  21148. 1563.93 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertexSet ============
  21149. 1563.93 s [algebraic-graphs] OK: rightVertexSet empty == Set.empty
  21150. 1563.93 s [algebraic-graphs] OK: rightVertexSet . leftVertex == const Set.empty
  21151. 1563.93 s [algebraic-graphs] OK: rightVertexSet . rightVertex == Set.singleton
  21152. 1563.93 s [algebraic-graphs] OK: rightVertexSet . vertices [] == Set.fromList
  21153. 1563.93 s [algebraic-graphs]
  21154. 1563.93 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertexSet ============
  21155. 1563.93 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  21156. 1563.93 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  21157. 1563.93 s [algebraic-graphs] OK: vertexSet (edge x y) == Set.fromList [Left x, Right y]
  21158. 1563.93 s [algebraic-graphs] OK: vertexSet (vertices (lefts xs) (rights xs)) == Set.fromList xs
  21159. 1563.93 s [algebraic-graphs]
  21160. 1563.93 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edgeSet ============
  21161. 1563.93 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  21162. 1563.93 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  21163. 1563.93 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  21164. 1563.93 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  21165. 1563.93 s [algebraic-graphs]
  21166. 1563.93 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftAdjacencyList ============
  21167. 1563.93 s [algebraic-graphs] OK: leftAdjacencyList empty == []
  21168. 1563.93 s [algebraic-graphs] OK: leftAdjacencyList (vertices [] xs) == []
  21169. 1563.93 s [algebraic-graphs] OK: leftAdjacencyList (vertices xs []) == []
  21170. 1563.93 s [algebraic-graphs] OK: leftAdjacencyList (edge x y) == [(x, [y])]
  21171. 1563.93 s [algebraic-graphs] OK: leftAdjacencyList (star x ys) == [(x, nub (sort ys))]
  21172. 1563.93 s [algebraic-graphs]
  21173. 1563.93 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightAdjacencyList ============
  21174. 1563.93 s [algebraic-graphs] OK: rightAdjacencyList empty == []
  21175. 1563.93 s [algebraic-graphs] OK: rightAdjacencyList (vertices [] xs) == [(x, []) | x <- nub (sort xs)]
  21176. 1563.93 s [algebraic-graphs] OK: rightAdjacencyList (vertices xs []) == []
  21177. 1563.93 s [algebraic-graphs] OK: rightAdjacencyList (edge x y) == [(y, [x])]
  21178. 1563.93 s [algebraic-graphs] OK: rightAdjacencyList (star x ys) == [(y, [x]) | y <- nub (sort ys)]
  21179. 1563.93 s [algebraic-graphs]
  21180. 1563.93 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.evenList ============
  21181. 1563.93 s [algebraic-graphs] OK: evenList [] == Nil
  21182. 1563.93 s [algebraic-graphs] OK: evenList [(1,2), (3,4)] == [1, 2, 3, 4] :: List Int Int
  21183. 1563.93 s [algebraic-graphs] OK: evenList [(1,'a'), (2,'b')] == Cons 1 (Cons 'a' (Cons 2 (Cons 'b' Nil)))
  21184. 1563.93 s [algebraic-graphs]
  21185. 1563.93 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.oddList ============
  21186. 1563.93 s [algebraic-graphs] OK: oddList 1 [] == Cons 1 Nil
  21187. 1563.93 s [algebraic-graphs] OK: oddList 1 [(2,3), (4,5)] == [1, 2, 3, 4, 5] :: List Int Int
  21188. 1563.93 s [algebraic-graphs] OK: oddList 1 [('a',2), ('b',3)] == Cons 1 (Cons 'a' (Cons 2 (Cons 'b' (Cons 3 Nil))))
  21189. 1563.93 s [algebraic-graphs]
  21190. 1563.93 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.path ============
  21191. 1563.93 s [algebraic-graphs] OK: path Nil == empty
  21192. 1563.93 s [algebraic-graphs] OK: path (Cons x Nil) == leftVertex x
  21193. 1563.93 s [algebraic-graphs] OK: path (Cons x (Cons y Nil)) == edge x y
  21194. 1563.93 s [algebraic-graphs] OK: path [1, 2, 3, 4, 5] == edges [(1,2), (3,2), (3,4), (5,4)]
  21195. 1563.93 s [algebraic-graphs]
  21196. 1563.93 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.circuit ============
  21197. 1563.93 s [algebraic-graphs] OK: circuit [] == empty
  21198. 1563.93 s [algebraic-graphs] OK: circuit [(x,y)] == edge x y
  21199. 1563.93 s [algebraic-graphs] OK: circuit [(1,2), (3,4), (5,6)] == edges [(1,2), (3,2), (3,4), (5,4), (5,6), (1,6)]
  21200. 1563.93 s [algebraic-graphs] OK: circuit . reverse == swap . circuit . map Data.Tuple.swap
  21201. 1563.93 s [algebraic-graphs]
  21202. 1563.93 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.biclique ============
  21203. 1563.93 s [algebraic-graphs] OK: biclique [] [] == empty
  21204. 1563.93 s [algebraic-graphs] OK: biclique xs [] == vertices xs []
  21205. 1563.93 s [algebraic-graphs] OK: biclique [] ys == vertices [] ys
  21206. 1563.93 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs []) (vertices [] ys)
  21207. 1563.93 s [algebraic-graphs]
  21208. 1563.93 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.star ============
  21209. 1563.93 s [algebraic-graphs] OK: star x [] == leftVertex x
  21210. 1563.93 s [algebraic-graphs] OK: star x [y] == edge x y
  21211. 1563.93 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  21212. 1563.93 s [algebraic-graphs] OK: star x ys == connect (leftVertex x) (vertices [] ys)
  21213. 1563.93 s [algebraic-graphs]
  21214. 1563.93 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.stars ============
  21215. 1563.93 s [algebraic-graphs] OK: stars [] == empty
  21216. 1563.93 s [algebraic-graphs] OK: stars [(x, [])] == leftVertex x
  21217. 1563.93 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  21218. 1563.93 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  21219. 1578.56 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  21220. 1578.60 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  21221. 1578.60 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  21222. 1578.60 s [algebraic-graphs]
  21223. 1578.60 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.mesh ============
  21224. 1578.60 s [algebraic-graphs] OK: mesh xs [] == empty
  21225. 1578.60 s [algebraic-graphs] OK: mesh [] ys == empty
  21226. 1578.60 s [algebraic-graphs] OK: mesh [x] [y] == leftVertex (x,y)
  21227. 1578.60 s [algebraic-graphs] OK: mesh [1,1] ['a','b'] == biclique [(1,'a'), (1,'b')] [(1,'a'), (1,'b')]
  21228. 1578.60 s [algebraic-graphs] OK: mesh [1,2] ['a','b'] == biclique [(1,'a'), (2,'b')] [(1,'b'), (2,'a')]
  21229. 1578.60 s [algebraic-graphs]
  21230. 1578.60 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.removeLeftVertex ============
  21231. 1578.60 s [algebraic-graphs] OK: removeLeftVertex x (leftVertex x) == empty
  21232. 1578.60 s [algebraic-graphs] OK: removeLeftVertex 1 (leftVertex 2) == leftVertex 2
  21233. 1578.60 s [algebraic-graphs] OK: removeLeftVertex x (rightVertex y) == rightVertex y
  21234. 1578.60 s [algebraic-graphs] OK: removeLeftVertex x (edge x y) == rightVertex y
  21235. 1578.60 s [algebraic-graphs] OK: removeLeftVertex x . removeLeftVertex x == removeLeftVertex x
  21236. 1578.60 s [algebraic-graphs]
  21237. 1578.60 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.removeRightVertex ============
  21238. 1578.60 s [algebraic-graphs] OK: removeRightVertex x (rightVertex x) == empty
  21239. 1578.60 s [algebraic-graphs] OK: removeRightVertex 1 (rightVertex 2) == rightVertex 2
  21240. 1578.60 s [algebraic-graphs] OK: removeRightVertex x (leftVertex y) == leftVertex y
  21241. 1578.60 s [algebraic-graphs] OK: removeRightVertex y (edge x y) == leftVertex x
  21242. 1578.60 s [algebraic-graphs] OK: removeRightVertex x . removeRightVertex x == removeRightVertex x
  21243. 1578.60 s [algebraic-graphs]
  21244. 1578.60 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.removeEdge ============
  21245. 1578.60 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x] [y]
  21246. 1578.60 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  21247. 1578.60 s [algebraic-graphs] OK: removeEdge x y . removeLeftVertex x == removeLeftVertex x
  21248. 1578.60 s [algebraic-graphs] OK: removeEdge x y . removeRightVertex y == removeRightVertex y
  21249. 1578.60 s [algebraic-graphs]
  21250. 1578.60 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.bimap ============
  21251. 1578.60 s [algebraic-graphs] OK: bimap f g empty == empty
  21252. 1578.60 s [algebraic-graphs] OK: bimap f g . vertex == vertex . Data.Bifunctor.bimap f g
  21253. 1578.60 s [algebraic-graphs] OK: bimap f g (edge x y) == edge (f x) (g y)
  21254. 1578.60 s [algebraic-graphs] OK: bimap id id == id
  21255. 1578.60 s [algebraic-graphs] OK: bimap f1 g1 . bimap f2 g2 == bimap (f1 . f2) (g1 . g2)
  21256. 1578.60 s [algebraic-graphs]
  21257. 1578.60 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.box ============
  21258. 1578.60 s [algebraic-graphs] OK: box (path [0,1]) (path ['a','b']) == <correct result>
  21259. 1578.60 s [algebraic-graphs]
  21260. 1578.60 s [algebraic-graphs] OK: box x y ~~ box y x
  21261. 1578.60 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  21262. 1578.60 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  21263. 1578.60 s [algebraic-graphs] OK: box x (leftVertex ()) ~~ x
  21264. 1578.60 s [algebraic-graphs] OK: box x (rightVertex ()) ~~ swap x
  21265. 1578.60 s [algebraic-graphs] OK: box x empty ~~ empty
  21266. 1578.60 s [algebraic-graphs] OK: vertexCount (box x y) <= vertexCount x * vertexCount y
  21267. 1578.60 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  21268. 1578.60 s [algebraic-graphs]
  21269. 1578.60 s [algebraic-graphs] OK: box == boxWith (,) (,) (,) (,)
  21270. 1578.60 s [algebraic-graphs]
  21271. 1578.60 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.consistent ============
  21272. 1578.60 s [algebraic-graphs] OK: consistent empty == True
  21273. 1578.60 s [algebraic-graphs] OK: consistent (vertex x) == True
  21274. 1578.60 s [algebraic-graphs] OK: consistent (edge x y) == True
  21275. 1578.60 s [algebraic-graphs] OK: consistent (edges x) == True
  21276. 1578.60 s [algebraic-graphs] OK: consistent (toBipartite x) == True
  21277. 1578.60 s [algebraic-graphs] OK: consistent (swap x) == True
  21278. 1578.60 s [algebraic-graphs] OK: consistent (circuit xs) == True
  21279. 1578.60 s [algebraic-graphs] OK: consistent (biclique xs ys) == True
  21280. 1578.60 s [algebraic-graphs]
  21281. 1578.60 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.detectParts ============
  21282. 1578.60 s [algebraic-graphs] OK: detectParts empty == Right empty
  21283. 1578.60 s [algebraic-graphs] OK: detectParts (vertex 1) == Right (leftVertex 1)
  21284. 1578.60 s [algebraic-graphs] OK: detectParts (edge 1 1) == Left [1]
  21285. 1578.60 s [algebraic-graphs] OK: detectParts (edge 1 2) == Right (edge 1 2)
  21286. 1578.60 s [algebraic-graphs] OK: detectParts (edge 0 (-1)) == Right (edge (-1) 0)
  21287. 1578.60 s [algebraic-graphs] OK: detectParts (1 * (2 + 3)) == Right (edges [(1, 2), (1, 3)])
  21288. 1578.60 s [algebraic-graphs] OK: detectParts ((1 + 3) * (2 + 4) + 6 * 5) == Right (swap (1 + 3) * (2 + 4) + swap 5 * 6
  21289. 1578.60 s [algebraic-graphs] OK: detectParts ((1 + 2) * (3 + 4) * (5 + 6)) == Left [1, 3, 2, 4, 5]
  21290. 1578.60 s [algebraic-graphs] OK: detectParts ((1 + 2) * (3 + 4) + (3 + 4) * 5) == Right (swap (1 + 2) * (3 + 4) + swap 5 * (3 + 4))
  21291. 1578.60 s [algebraic-graphs] OK: detectParts (1 * 2 * 3) == Left [2, 3, 1]
  21292. 1578.60 s [algebraic-graphs] OK: detectParts ((1 * 3 * 4) + 2 * (1 + 2)) == Left [2]
  21293. 1578.60 s [algebraic-graphs] OK: detectParts (clique [1..10]) == Left [1, 2, 3]
  21294. 1578.60 s [algebraic-graphs] OK: detectParts (circuit [1..11]) == Left [1..11]
  21295. 1578.60 s [algebraic-graphs] OK: detectParts (circuit [1..10]) == Right (circuit [(2 * x - 1, 2 * x) | x <- [1..5]])
  21296. 1578.60 s [algebraic-graphs] OK: detectParts (biclique [] xs) == Right (vertices xs [])
  21297. 1578.60 s [algebraic-graphs] OK: detectParts (biclique (map Left (x:xs)) (map Right ys)) == Right (biclique (map Left (x:xs)) (map Right ys))
  21298. 1578.60 s [algebraic-graphs] OK: isRight (detectParts (star x ys)) == not (elem x ys)
  21299. 1578.60 s [algebraic-graphs] OK: isRight (detectParts (fromBipartite (toBipartite x))) == True
  21300. 1578.60 s [algebraic-graphs]
  21301. 1578.60 s [algebraic-graphs] OK: ((all ((flip Set.member) $ edgeSet $ symmetricClosure x) . edgeSet) <$> detectParts x) /= Right False
  21302. 1578.60 s [algebraic-graphs] OK: (Set.map $ fromEither) <$> (vertexSet <$> (detectParts (fromBipartite (toBipartite x)))) == Right (vertexSet x)
  21303. 1578.60 s [algebraic-graphs] OK: fromEither (Bifunctor.bimap ((flip Set.isSubsetOf) (vertexSet x) . Set.fromList) (const True) (detectParts x)) == True
  21304. 1578.60 s [algebraic-graphs] OK: fromEither (Bifunctor.bimap ((flip Set.isSubsetOf) (edgeSet (symmetricClosure x)) . AM.edgeSet . circuit) (const True) (detectParts x)) == True
  21305. 1578.60 s [algebraic-graphs] OK: fromEither (Bifunctor.bimap (((==) 1) . ((flip mod) 2) . length) (const True) (detectParts x)) == True
  21306. 1578.60 s [algebraic-graphs]
  21307. 1578.60 s [algebraic-graphs] ============ Show (Bipartite.AdjacencyMap.Algorithm.Matching a b) ============
  21308. 1578.60 s [algebraic-graphs] OK: show (matching []) == "matching []"
  21309. 1578.60 s [algebraic-graphs] OK: show (matching [(2,'a'),(1,'b')]) == "matching [(1,'b'),(2,'a')]"
  21310. 1578.60 s [algebraic-graphs]
  21311. 1578.60 s [algebraic-graphs] ============ Eq (Bipartite.AdjacencyMap.Algorithm.Matching a b) ============
  21312. 1578.60 s [algebraic-graphs] OK: (x == y) == ((pairOfLeft x == pairOfLeft y) && (pairOfRight x == pairOfRight y))
  21313. 1578.60 s [algebraic-graphs]
  21314. 1578.60 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.pairOfLeft ============
  21315. 1578.60 s [algebraic-graphs] OK: pairOfLeft (matching []) == Map.empty
  21316. 1578.60 s [algebraic-graphs] OK: pairOfLeft (matching [(2,'a'), (1,'b')]) == Map.fromList [(2,'a'), (1,'b')]
  21317. 1578.60 s [algebraic-graphs] OK: Map.size . pairOfLeft == Map.size . pairOfRight
  21318. 1578.60 s [algebraic-graphs]
  21319. 1578.60 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.pairOfRight ============
  21320. 1578.60 s [algebraic-graphs] OK: pairOfRight (matching []) == Map.empty
  21321. 1578.60 s [algebraic-graphs] OK: pairOfRight (matching [(2,'a'), (1,'b')]) == Map.fromList [('a',2), ('b',1)]
  21322. 1578.60 s [algebraic-graphs] OK: Map.size . pairOfRight == Map.size . pairOfLeft
  21323. 1578.60 s [algebraic-graphs]
  21324. 1578.60 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.matching ============
  21325. 1578.60 s [algebraic-graphs] OK: matching [(1,'a'), (1,'b')] == matching [(1,'b')]
  21326. 1578.60 s [algebraic-graphs] OK: matching [(1,'a'), (1,'b'), (2,'b'), (2,'a')] == matching [(2,'a')]
  21327. 1578.60 s [algebraic-graphs]
  21328. 1578.60 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.isMatchingOf ============
  21329. 1578.60 s [algebraic-graphs] OK: isMatchingOf (matching []) x == True
  21330. 1578.60 s [algebraic-graphs] OK: isMatchingOf (matching xs) empty == null xs
  21331. 1578.60 s [algebraic-graphs] OK: isMatchingOf (matching [(x,y)]) (edge x y) == True
  21332. 1578.60 s [algebraic-graphs] OK: isMatchingOf (matching [(1,2)]) (edge 2 1) == False
  21333. 1578.60 s [algebraic-graphs]
  21334. 1578.60 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.matchingSize ============
  21335. 1578.60 s [algebraic-graphs] OK: matchingSize (matching []) == 0
  21336. 1578.60 s [algebraic-graphs] OK: matchingSize (matching [(2,'a'), (1,'b')]) == 2
  21337. 1578.60 s [algebraic-graphs] OK: matchingSize (matching [(1,'a'), (1,'b')]) == 1
  21338. 1578.60 s [algebraic-graphs] OK: matchingSize (matching xs) <= length xs
  21339. 1578.60 s [algebraic-graphs] OK: matchingSize x == Map.size . pairOfLeft
  21340. 1578.60 s [algebraic-graphs]
  21341. 1578.60 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.maxMatching ============
  21342. 1578.60 s [algebraic-graphs] OK: maxMatching empty == matching []
  21343. 1578.60 s [algebraic-graphs] OK: maxMatching (vertices xs ys) == matching []
  21344. 1578.60 s [algebraic-graphs] OK: maxMatching (path [1,2,3,4]) == matching [(1,2), (3,4)]
  21345. 1578.60 s [algebraic-graphs] OK: matchingSize (maxMatching (circuit [(1,2), (3,4), (5,6)])) == 3
  21346. 1578.60 s [algebraic-graphs] OK: matchingSize (maxMatching (star x (y:ys))) == 1
  21347. 1578.60 s [algebraic-graphs] OK: matchingSize (maxMatching (biclique xs ys)) == min (length (nub xs)) (length (nub ys))
  21348. 1578.60 s [algebraic-graphs] OK: isMatchingOf (maxMatching x) x == True
  21349. 1578.60 s [algebraic-graphs]
  21350. 1578.60 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.isVertexCoverOf ============
  21351. 1578.60 s [algebraic-graphs] OK: isVertexCoverOf (xs , ys ) empty == Set.null xs && Set.null ys
  21352. 1578.60 s [algebraic-graphs] OK: isVertexCoverOf (xs , ys ) (leftVertex x) == Set.isSubsetOf xs (Set.singleton x) && Set.null ys
  21353. 1578.60 s [algebraic-graphs] OK: isVertexCoverOf (Set.empty , Set.empty ) (edge x y) == False
  21354. 1578.60 s [algebraic-graphs] OK: isVertexCoverOf (Set.singleton x, ys ) (edge x y) == Set.isSubsetOf ys (Set.singleton y)
  21355. 1578.60 s [algebraic-graphs] OK: isVertexCoverOf (xs , Set.singleton y) (edge x y) == Set.isSubsetOf xs (Set.singleton x)
  21356. 1578.60 s [algebraic-graphs]
  21357. 1578.60 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.minVertexCover ============
  21358. 1578.60 s [algebraic-graphs] OK: minVertexCover empty == (Set.empty, Set.empty)
  21359. 1580.75 s [algebraic-graphs] OK: minVertexCover (vertices xs ys) == (Set.empty, Set.empty)
  21360. 1580.75 s [algebraic-graphs] OK: minVertexCover (path [1,2,3]) == (Set.empty, Set.singleton 2)
  21361. 1580.75 s [algebraic-graphs] OK: minVertexCover (star x (1:2:ys)) == (Set.singleton x, Set.empty)
  21362. 1580.75 s [algebraic-graphs] OK: vertexCoverSize (minVertexCover (biclique xs ys)) == min (length (nub xs)) (length (nub ys))
  21363. 1580.75 s [algebraic-graphs] OK: vertexCoverSize . minVertexCover == matchingSize . maxMatching
  21364. 1580.75 s [algebraic-graphs] OK: isVertexCoverOf (minVertexCover x) x == True
  21365. 1580.75 s [algebraic-graphs]
  21366. 1580.75 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.isIndependentSetOf ============
  21367. 1580.75 s [algebraic-graphs] OK: isIndependentSetOf (xs , ys ) empty == Set.null xs && Set.null ys
  21368. 1580.75 s [algebraic-graphs] OK: isIndependentSetOf (xs , ys ) (leftVertex x) == Set.isSubsetOf xs (Set.singleton x) && Set.null ys
  21369. 1580.75 s [algebraic-graphs] OK: isIndependentSetOf (Set.empty , Set.empty ) (edge x y) == True
  21370. 1580.75 s [algebraic-graphs] OK: isIndependentSetOf (Set.singleton x, ys ) (edge x y) == Set.null ys
  21371. 1580.75 s [algebraic-graphs] OK: isIndependentSetOf (xs , Set.singleton y) (edge x y) == Set.null xs
  21372. 1580.75 s [algebraic-graphs]
  21373. 1580.75 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.maxIndependentSet ============
  21374. 1580.75 s [algebraic-graphs] OK: maxIndependentSet empty == (Set.empty, Set.empty)
  21375. 1580.75 s [algebraic-graphs] OK: maxIndependentSet (vertices xs ys) == (Set.fromList xs, Set.fromList ys)
  21376. 1580.75 s [algebraic-graphs] OK: maxIndependentSet (path [1,2,3]) == (Set.fromList [1,3], Set.empty)
  21377. 1580.75 s [algebraic-graphs] OK: maxIndependentSet (star x (1:2:ys)) == (Set.empty, Set.fromList (1:2:ys))
  21378. 1580.75 s [algebraic-graphs] OK: independentSetSize (maxIndependentSet (biclique xs ys)) == max (length (nub xs)) (length (nub ys))
  21379. 1580.75 s [algebraic-graphs] OK: independentSetSize (maxIndependentSet x) == vertexCount x - vertexCoverSize (minVertexCover x)
  21380. 1580.75 s [algebraic-graphs] OK: isIndependentSetOf (maxIndependentSet x) x == True
  21381. 1580.75 s [algebraic-graphs]
  21382. 1580.75 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.augmentingPath ============
  21383. 1580.75 s [algebraic-graphs] OK: augmentingPath (matching []) empty == Left (Set.empty, Set.empty)
  21384. 1580.75 s [algebraic-graphs] OK: augmentingPath (matching []) (edge 1 2) == Right [1,2]
  21385. 1580.75 s [algebraic-graphs] OK: augmentingPath (matching [(1,2)]) (path [1,2,3]) == Left (Set.empty, Set.singleton 2)
  21386. 1580.75 s [algebraic-graphs] OK: augmentingPath (matching [(3,2)]) (path [1,2,3,4]) == Right [1,2,3,4]
  21387. 1580.75 s [algebraic-graphs] OK: isLeft (augmentingPath (maxMatching x) x) == True
  21388. 1580.75 s [algebraic-graphs]
  21389. 1580.76 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.consistentMatching ============
  21390. 1580.76 s [algebraic-graphs] OK: consistentMatching (matching xs) == True
  21391. 1580.76 s [algebraic-graphs] OK: consistentMatching (maxMatching x) == True
  21392. 1580.76 s [algebraic-graphs]
  21393. 1580.76 s [algebraic-graphs] ============ Export.Eq ============
  21394. 1580.76 s [algebraic-graphs] OK: mempty /= literal ""
  21395. 1580.76 s [algebraic-graphs]
  21396. 1580.76 s [algebraic-graphs] ============ Export.Ord ============
  21397. 1580.76 s [algebraic-graphs] OK: mempty < literal ""
  21398. 1580.76 s [algebraic-graphs]
  21399. 1580.76 s [algebraic-graphs] ============ Export.isEmpty ============
  21400. 1580.76 s [algebraic-graphs] OK: isEmpty mempty == True
  21401. 1580.76 s [algebraic-graphs] OK: isEmpty (literal "") == False
  21402. 1580.76 s [algebraic-graphs] OK: isEmpty x == (x == mempty)
  21403. 1580.76 s [algebraic-graphs]
  21404. 1580.76 s [algebraic-graphs] ============ Export.literal ============
  21405. 1580.76 s [algebraic-graphs] OK: literal "Hello, " <> literal "World!" == literal "Hello, World!"
  21406. 1580.76 s [algebraic-graphs] OK: literal "I am just a string literal" == "I am just a string literal"
  21407. 1580.76 s [algebraic-graphs] OK: render . literal == id
  21408. 1580.76 s [algebraic-graphs]
  21409. 1580.76 s [algebraic-graphs] ============ Export.render ============
  21410. 1580.76 s [algebraic-graphs] OK: render (literal "al" <> literal "ga") == "alga"
  21411. 1580.76 s [algebraic-graphs] OK: render mempty == mempty
  21412. 1580.76 s [algebraic-graphs]
  21413. 1580.76 s [algebraic-graphs] ============ Export.<+> ============
  21414. 1580.76 s [algebraic-graphs] OK: x <+> mempty == x
  21415. 1580.76 s [algebraic-graphs] OK: mempty <+> x == x
  21416. 1580.76 s [algebraic-graphs] OK: x <+> (y <+> z) == (x <+> y) <+> z
  21417. 1580.76 s [algebraic-graphs] OK: "name" <+> "surname" == "name surname"
  21418. 1580.76 s [algebraic-graphs]
  21419. 1580.76 s [algebraic-graphs] ============ Export.brackets ============
  21420. 1580.76 s [algebraic-graphs] OK: brackets "i" == "[i]"
  21421. 1580.76 s [algebraic-graphs] OK: brackets mempty == "[]"
  21422. 1580.76 s [algebraic-graphs]
  21423. 1580.76 s [algebraic-graphs] ============ Export.doubleQuotes ============
  21424. 1580.76 s [algebraic-graphs] OK: doubleQuotes "/path/with spaces" == "\"/path/with spaces\""
  21425. 1580.76 s [algebraic-graphs] OK: doubleQuotes (doubleQuotes mempty) == "\"\"\"\""
  21426. 1580.76 s [algebraic-graphs]
  21427. 1580.76 s [algebraic-graphs] ============ Export.indent ============
  21428. 1580.76 s [algebraic-graphs] OK: indent 0 == id
  21429. 1580.76 s [algebraic-graphs] OK: indent 1 mempty == " "
  21430. 1580.76 s [algebraic-graphs]
  21431. 1580.76 s [algebraic-graphs] ============ Export.unlines ============
  21432. 1580.76 s [algebraic-graphs] OK: unlines [] == mempty
  21433. 1580.76 s [algebraic-graphs] OK: unlines [mempty] == "\n"
  21434. 1580.76 s [algebraic-graphs] OK: unlines ["title", "subtitle"] == "title\nsubtitle\n"
  21435. 1580.76 s [algebraic-graphs]
  21436. 1580.76 s [algebraic-graphs] ============ Export.export ============
  21437. 1580.76 s [algebraic-graphs] OK: render $ export vDoc eDoc (1 + 2 * (3 + 4) :: Graph Int)
  21438. 1580.76 s [algebraic-graphs]
  21439. 1580.76 s [algebraic-graphs] ============ Export.Dot.export ============
  21440. 1580.76 s [algebraic-graphs] OK: export style (1 * 2 + 3 * 4 * 5 :: Graph Int)
  21441. 1580.76 s [algebraic-graphs]
  21442. 1580.76 s [algebraic-graphs] =========== Export.Dot.attributeQuoting ============
  21443. 1580.76 s [algebraic-graphs] OK: export style' (1 * 2 + 3 * 4 * 5 :: Graph Int)
  21444. 1580.76 s [algebraic-graphs]
  21445. 1580.76 s [algebraic-graphs] ============ Export.Dot.exportAsIs ============
  21446. 1580.76 s [algebraic-graphs] OK: exportAsIs (circuit ["a", "b", "c"] :: Graph String)
  21447. 1580.76 s [algebraic-graphs]
  21448. 1580.76 s [algebraic-graphs] ============ Export.Dot.exportViaShow ============
  21449. 1580.76 s [algebraic-graphs] OK: exportViaShow (1 + 2 * (3 + 4) :: Graph Int)
  21450. 1580.76 s [algebraic-graphs]
  21451. 1580.76 s [algebraic-graphs] ============ Graph ============
  21452. 1580.76 s [algebraic-graphs] OK: Axioms of graphs
  21453. 1580.76 s [algebraic-graphs] OK: Theorems of graphs
  21454. 1580.76 s [algebraic-graphs]
  21455. 1580.76 s [algebraic-graphs] ============ Graph.Ord ============
  21456. 1580.76 s [algebraic-graphs] OK: vertex 1 < vertex 2
  21457. 1580.76 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  21458. 1580.76 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  21459. 1580.76 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  21460. 1580.76 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  21461. 1580.76 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  21462. 1580.76 s [algebraic-graphs] OK: x <= x + y
  21463. 1580.76 s [algebraic-graphs] OK: x + y <= x * y
  21464. 1580.76 s [algebraic-graphs]
  21465. 1580.76 s [algebraic-graphs] ============ Graph.empty ============
  21466. 1580.76 s [algebraic-graphs] OK: isEmpty empty == True
  21467. 1580.76 s [algebraic-graphs] OK: hasVertex x empty == False
  21468. 1580.76 s [algebraic-graphs] OK: vertexCount empty == 0
  21469. 1580.76 s [algebraic-graphs] OK: edgeCount empty == 0
  21470. 1580.76 s [algebraic-graphs]
  21471. 1580.76 s [algebraic-graphs] ============ Graph.vertex ============
  21472. 1580.76 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  21473. 1580.76 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  21474. 1580.76 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  21475. 1580.76 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  21476. 1580.76 s [algebraic-graphs]
  21477. 1580.76 s [algebraic-graphs] ============ Graph.edge ============
  21478. 1580.76 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  21479. 1580.76 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  21480. 1580.76 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  21481. 1580.76 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  21482. 1580.76 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  21483. 1580.76 s [algebraic-graphs]
  21484. 1580.76 s [algebraic-graphs] ============ Graph.overlay ============
  21485. 1580.76 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  21486. 1580.76 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  21487. 1580.76 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  21488. 1580.76 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  21489. 1580.76 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  21490. 1580.76 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  21491. 1580.76 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  21492. 1580.76 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  21493. 1580.76 s [algebraic-graphs]
  21494. 1580.76 s [algebraic-graphs] ============ Graph.connect ============
  21495. 1580.76 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  21496. 1580.76 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  21497. 1580.76 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  21498. 1580.76 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  21499. 1580.76 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  21500. 1580.76 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  21501. 1580.76 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  21502. 1580.76 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  21503. 1580.76 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  21504. 1580.76 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  21505. 1580.76 s [algebraic-graphs]
  21506. 1580.76 s [algebraic-graphs] ============ Graph.vertices ============
  21507. 1580.76 s [algebraic-graphs] OK: vertices [] == empty
  21508. 1580.76 s [algebraic-graphs] OK: vertices [x] == vertex x
  21509. 1580.76 s [algebraic-graphs] OK: vertices == overlays . map vertex
  21510. 1580.76 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  21511. 1580.76 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  21512. 1580.76 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  21513. 1580.76 s [algebraic-graphs]
  21514. 1580.76 s [algebraic-graphs] ============ Graph.edges ============
  21515. 1580.76 s [algebraic-graphs] OK: edges [] == empty
  21516. 1580.76 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  21517. 1580.76 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  21518. 1580.76 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  21519. 1580.76 s [algebraic-graphs]
  21520. 1580.76 s [algebraic-graphs] ============ Graph.overlays ============
  21521. 1580.76 s [algebraic-graphs] OK: overlays [] == empty
  21522. 1580.76 s [algebraic-graphs] OK: overlays [x] == x
  21523. 1580.76 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  21524. 1580.76 s [algebraic-graphs] OK: overlays == foldr overlay empty
  21525. 1580.76 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  21526. 1580.76 s [algebraic-graphs]
  21527. 1580.76 s [algebraic-graphs] ============ Graph.connects ============
  21528. 1580.76 s [algebraic-graphs] OK: connects [] == empty
  21529. 1580.76 s [algebraic-graphs] OK: connects [x] == x
  21530. 1580.76 s [algebraic-graphs] OK: connects [x,y] == connect x y
  21531. 1580.76 s [algebraic-graphs] OK: connects == foldr connect empty
  21532. 1580.76 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  21533. 1580.76 s [algebraic-graphs]
  21534. 1580.76 s [algebraic-graphs] ============ Graph.isSubgraphOf ============
  21535. 1580.76 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  21536. 1580.76 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  21537. 1580.76 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  21538. 1580.76 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  21539. 1580.76 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  21540. 1580.76 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  21541. 1580.76 s [algebraic-graphs]
  21542. 1580.76 s [algebraic-graphs] ============ Graph.toGraph et al. ============
  21543. 1580.76 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  21544. 1580.76 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  21545. 1580.76 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  21546. 1580.76 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  21547. 1580.76 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  21548. 1580.76 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  21549. 1580.76 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  21550. 1580.76 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  21551. 1580.76 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  21552. 1581.48 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  21553. 1581.48 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  21554. 1581.48 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  21555. 1581.48 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  21556. 1581.48 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  21557. 1581.48 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  21558. 1581.48 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  21559. 1581.48 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  21560. 1581.48 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  21561. 1581.48 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  21562. 1581.48 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  21563. 1581.48 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  21564. 1581.48 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  21565. 1581.48 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  21566. 1581.48 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  21567. 1581.48 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  21568. 1581.48 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  21569. 1581.48 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  21570. 1581.48 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  21571. 1581.48 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  21572. 1581.48 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  21573. 1581.48 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  21574. 1581.48 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  21575. 1581.48 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  21576. 1581.48 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  21577. 1581.48 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  21578. 1581.48 s [algebraic-graphs]
  21579. 1581.48 s [algebraic-graphs] ============ Graph.foldg ============
  21580. 1581.48 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  21581. 1581.48 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  21582. 1581.48 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  21583. 1581.48 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  21584. 1581.48 s [algebraic-graphs]
  21585. 1581.48 s [algebraic-graphs] ============ Graph.isEmpty ============
  21586. 1581.48 s [algebraic-graphs] OK: isEmpty empty == True
  21587. 1581.48 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  21588. 1581.48 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  21589. 1581.48 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  21590. 1581.48 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  21591. 1581.48 s [algebraic-graphs]
  21592. 1581.48 s [algebraic-graphs] ============ Graph.hasVertex ============
  21593. 1581.48 s [algebraic-graphs] OK: hasVertex x empty == False
  21594. 1581.48 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  21595. 1581.48 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  21596. 1581.48 s [algebraic-graphs]
  21597. 1581.48 s [algebraic-graphs] ============ Graph.hasEdge ============
  21598. 1581.48 s [algebraic-graphs] OK: hasEdge x y empty == False
  21599. 1581.48 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  21600. 1581.48 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  21601. 1581.48 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  21602. 1581.48 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  21603. 1581.48 s [algebraic-graphs]
  21604. 1581.48 s [algebraic-graphs] ============ Graph.vertexCount ============
  21605. 1581.48 s [algebraic-graphs] OK: vertexCount empty == 0
  21606. 1581.48 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  21607. 1581.48 s [algebraic-graphs] OK: vertexCount == length . vertexList
  21608. 1581.48 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  21609. 1581.48 s [algebraic-graphs]
  21610. 1581.48 s [algebraic-graphs] ============ Graph.edgeCount ============
  21611. 1581.48 s [algebraic-graphs] OK: edgeCount empty == 0
  21612. 1581.48 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  21613. 1581.48 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  21614. 1581.48 s [algebraic-graphs] OK: edgeCount == length . edgeList
  21615. 1581.48 s [algebraic-graphs]
  21616. 1581.48 s [algebraic-graphs] ============ Graph.vertexList ============
  21617. 1581.48 s [algebraic-graphs] OK: vertexList empty == []
  21618. 1581.48 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  21619. 1581.48 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  21620. 1581.48 s [algebraic-graphs]
  21621. 1581.48 s [algebraic-graphs] ============ Graph.vertexSet ============
  21622. 1581.48 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  21623. 1581.48 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  21624. 1581.48 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  21625. 1581.48 s [algebraic-graphs]
  21626. 1581.48 s [algebraic-graphs] ============ Graph.vertexIntSet ============
  21627. 1581.48 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  21628. 1581.48 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  21629. 1581.48 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  21630. 1581.48 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  21631. 1581.48 s [algebraic-graphs]
  21632. 1581.48 s [algebraic-graphs] ============ Graph.edgeList ============
  21633. 1581.48 s [algebraic-graphs] OK: edgeList empty == []
  21634. 1581.48 s [algebraic-graphs] OK: edgeList (vertex x) == []
  21635. 1581.48 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  21636. 1581.48 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  21637. 1581.48 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  21638. 1581.48 s [algebraic-graphs]
  21639. 1581.48 s [algebraic-graphs] ============ Graph.edgeSet ============
  21640. 1581.48 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  21641. 1581.48 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  21642. 1581.48 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  21643. 1581.48 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  21644. 1581.48 s [algebraic-graphs]
  21645. 1581.48 s [algebraic-graphs] ============ Graph.adjacencyList ============
  21646. 1581.48 s [algebraic-graphs] OK: adjacencyList empty == []
  21647. 1581.48 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  21648. 1581.48 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  21649. 1581.48 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  21650. 1581.48 s [algebraic-graphs]
  21651. 1581.48 s [algebraic-graphs] ============ Graph.preSet ============
  21652. 1581.48 s [algebraic-graphs] OK: preSet x empty == Set.empty
  21653. 1581.48 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  21654. 1581.48 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  21655. 1581.48 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  21656. 1581.48 s [algebraic-graphs]
  21657. 1581.48 s [algebraic-graphs] ============ Graph.preIntSet ============
  21658. 1581.48 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  21659. 1581.48 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  21660. 1581.48 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  21661. 1581.48 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  21662. 1581.48 s [algebraic-graphs]
  21663. 1581.48 s [algebraic-graphs] ============ Graph.postSet ============
  21664. 1581.48 s [algebraic-graphs] OK: postSet x empty == Set.empty
  21665. 1581.48 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  21666. 1581.48 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  21667. 1581.48 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  21668. 1581.48 s [algebraic-graphs]
  21669. 1581.48 s [algebraic-graphs] ============ Graph.postIntSet ============
  21670. 1581.48 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  21671. 1581.48 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  21672. 1581.48 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  21673. 1581.48 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  21674. 1581.48 s [algebraic-graphs]
  21675. 1581.48 s [algebraic-graphs] ============ Graph.size ============
  21676. 1581.48 s [algebraic-graphs] OK: size empty == 1
  21677. 1581.48 s [algebraic-graphs] OK: size (vertex x) == 1
  21678. 1581.48 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  21679. 1581.48 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  21680. 1581.48 s [algebraic-graphs] OK: size x >= 1
  21681. 1581.48 s [algebraic-graphs] OK: size x >= vertexCount x
  21682. 1581.48 s [algebraic-graphs]
  21683. 1581.48 s [algebraic-graphs] ============ Graph.path ============
  21684. 1581.48 s [algebraic-graphs] OK: path [] == empty
  21685. 1581.48 s [algebraic-graphs] OK: path [x] == vertex x
  21686. 1581.48 s [algebraic-graphs] OK: path [x,y] == edge x y
  21687. 1581.48 s [algebraic-graphs]
  21688. 1581.48 s [algebraic-graphs] ============ Graph.circuit ============
  21689. 1581.48 s [algebraic-graphs] OK: circuit [] == empty
  21690. 1581.48 s [algebraic-graphs] OK: circuit [x] == edge x x
  21691. 1581.48 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  21692. 1581.48 s [algebraic-graphs]
  21693. 1581.48 s [algebraic-graphs] ============ Graph.clique ============
  21694. 1581.48 s [algebraic-graphs] OK: clique [] == empty
  21695. 1581.48 s [algebraic-graphs] OK: clique [x] == vertex x
  21696. 1581.48 s [algebraic-graphs] OK: clique [x,y] == edge x y
  21697. 1581.48 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  21698. 1581.48 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  21699. 1581.48 s [algebraic-graphs]
  21700. 1581.48 s [algebraic-graphs] ============ Graph.biclique ============
  21701. 1581.48 s [algebraic-graphs] OK: biclique [] [] == empty
  21702. 1581.48 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  21703. 1581.48 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  21704. 1581.48 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  21705. 1581.48 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  21706. 1581.48 s [algebraic-graphs]
  21707. 1581.48 s [algebraic-graphs] ============ Graph.star ============
  21708. 1581.48 s [algebraic-graphs] OK: star x [] == vertex x
  21709. 1581.48 s [algebraic-graphs] OK: star x [y] == edge x y
  21710. 1581.48 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  21711. 1581.48 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  21712. 1581.48 s [algebraic-graphs]
  21713. 1581.48 s [algebraic-graphs] ============ Graph.stars ============
  21714. 1581.48 s [algebraic-graphs] OK: stars [] == empty
  21715. 1581.48 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  21716. 1581.48 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  21717. 1581.48 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  21718. 1581.48 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  21719. 1581.48 s [algebraic-graphs] OK: stars . adjacencyList == id
  21720. 1581.48 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  21721. 1581.48 s [algebraic-graphs]
  21722. 1581.48 s [algebraic-graphs] ============ Graph.tree ============
  21723. 1581.48 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  21724. 1581.48 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  21725. 1581.48 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  21726. 1581.48 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  21727. 1581.48 s [algebraic-graphs]
  21728. 1581.48 s [algebraic-graphs] ============ Graph.forest ============
  21729. 1581.48 s [algebraic-graphs] OK: forest [] == empty
  21730. 1581.48 s [algebraic-graphs] OK: forest [x] == tree x
  21731. 1581.48 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  21732. 1581.48 s [algebraic-graphs] OK: forest == overlays . map tree
  21733. 1581.48 s [algebraic-graphs]
  21734. 1581.48 s [algebraic-graphs] ============ Graph.removeVertex ============
  21735. 1585.31 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  21736. 1585.31 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  21737. 1585.31 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  21738. 1585.43 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  21739. 1585.43 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  21740. 1585.43 s [algebraic-graphs]
  21741. 1585.43 s [algebraic-graphs] ============ Graph.removeEdge ============
  21742. 1585.43 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  21743. 1585.43 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  21744. 1585.43 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  21745. 1585.43 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  21746. 1585.43 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  21747. 1585.43 s [algebraic-graphs] OK: size (removeEdge x y z) <= 3 * size z
  21748. 1585.43 s [algebraic-graphs]
  21749. 1585.43 s [algebraic-graphs] ============ Graph.replaceVertex ============
  21750. 1585.43 s [algebraic-graphs] OK: replaceVertex x x == id
  21751. 1585.43 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  21752. 1585.43 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  21753. 1585.43 s [algebraic-graphs]
  21754. 1585.43 s [algebraic-graphs] ============ Graph.mergeVertices ============
  21755. 1585.43 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  21756. 1585.43 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  21757. 1585.43 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  21758. 1585.43 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  21759. 1585.43 s [algebraic-graphs]
  21760. 1585.43 s [algebraic-graphs] ============ Graph.transpose ============
  21761. 1585.43 s [algebraic-graphs] OK: transpose empty == empty
  21762. 1585.43 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  21763. 1585.43 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  21764. 1585.43 s [algebraic-graphs] OK: transpose . transpose == id
  21765. 1585.43 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  21766. 1585.43 s [algebraic-graphs]
  21767. 1585.43 s [algebraic-graphs] ============ Graph.gmap ============
  21768. 1585.43 s [algebraic-graphs] OK: gmap f empty == empty
  21769. 1585.43 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  21770. 1585.43 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  21771. 1585.43 s [algebraic-graphs] OK: gmap id == id
  21772. 1585.43 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  21773. 1585.43 s [algebraic-graphs]
  21774. 1585.43 s [algebraic-graphs] ============ Graph.induce ============
  21775. 1585.43 s [algebraic-graphs] OK: induce (const True ) x == x
  21776. 1585.43 s [algebraic-graphs] OK: induce (const False) x == empty
  21777. 1585.43 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  21778. 1585.43 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  21779. 1585.43 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  21780. 1585.43 s [algebraic-graphs]
  21781. 1585.43 s [algebraic-graphs] ============ Graph.induceJust ============
  21782. 1585.43 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  21783. 1585.43 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  21784. 1585.43 s [algebraic-graphs] OK: induceJust . gmap Just == id
  21785. 1585.43 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  21786. 1585.43 s [algebraic-graphs]
  21787. 1585.43 s [algebraic-graphs] ============ Graph.compose ============
  21788. 1585.43 s [algebraic-graphs] OK: compose empty x == empty
  21789. 1585.43 s [algebraic-graphs] OK: compose x empty == empty
  21790. 1585.43 s [algebraic-graphs] OK: compose (vertex x) y == empty
  21791. 1585.43 s [algebraic-graphs] OK: compose x (vertex y) == empty
  21792. 1585.43 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  21793. 1585.43 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  21794. 1585.43 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  21795. 1585.43 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  21796. 1585.43 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  21797. 1585.43 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  21798. 1585.43 s [algebraic-graphs] OK: size (compose x y) <= edgeCount x + edgeCount y + 1
  21799. 1585.43 s [algebraic-graphs]
  21800. 1585.43 s [algebraic-graphs] ============ Graph.(===) ============
  21801. 1585.43 s [algebraic-graphs] OK: x === x == True
  21802. 1585.43 s [algebraic-graphs] OK: x === x + empty == False
  21803. 1585.43 s [algebraic-graphs] OK: x + y === x + y == True
  21804. 1585.43 s [algebraic-graphs] OK: 1 + 2 === 2 + 1 == False
  21805. 1585.43 s [algebraic-graphs] OK: x + y === x * y == False
  21806. 1585.43 s [algebraic-graphs]
  21807. 1585.43 s [algebraic-graphs] ============ Graph.mesh ============
  21808. 1585.43 s [algebraic-graphs] OK: mesh xs [] == empty
  21809. 1585.43 s [algebraic-graphs] OK: mesh [] ys == empty
  21810. 1585.43 s [algebraic-graphs] OK: mesh [x] [y] == vertex (x, y)
  21811. 1585.43 s [algebraic-graphs] OK: mesh xs ys == box (path xs) (path ys)
  21812. 1585.43 s [algebraic-graphs] OK: mesh [1..3] "ab" == <correct result>
  21813. 1585.43 s [algebraic-graphs] OK: size (mesh xs ys) == max 1 (3 * length xs * length ys - length xs - length ys -1)
  21814. 1585.43 s [algebraic-graphs]
  21815. 1585.43 s [algebraic-graphs] ============ Graph.torus ============
  21816. 1585.43 s [algebraic-graphs] OK: torus xs [] == empty
  21817. 1585.43 s [algebraic-graphs] OK: torus [] ys == empty
  21818. 1585.43 s [algebraic-graphs] OK: torus [x] [y] == edge (x,y) (x,y)
  21819. 1585.43 s [algebraic-graphs] OK: torus xs ys == box (circuit xs) (circuit ys)
  21820. 1585.43 s [algebraic-graphs] OK: torus [1,2] "ab" == <correct result>
  21821. 1585.43 s [algebraic-graphs] OK: size (torus xs ys) == max 1 (3 * length xs * length ys)
  21822. 1585.43 s [algebraic-graphs]
  21823. 1585.43 s [algebraic-graphs] ============ Graph.deBruijn ============
  21824. 1585.43 s [algebraic-graphs] OK: deBruijn 0 xs == edge [] []
  21825. 1585.43 s [algebraic-graphs] OK: n > 0 ==> deBruijn n [] == empty
  21826. 1585.43 s [algebraic-graphs] OK: deBruijn 1 [0,1] == edges [ ([0],[0]), ([0],[1]), ([1],[0]), ([1],[1]) ]
  21827. 1585.43 s [algebraic-graphs] OK: deBruijn 2 "0" == edge "00" "00"
  21828. 1585.43 s [algebraic-graphs] OK: deBruijn 2 "01" == <correct result>
  21829. 1585.43 s [algebraic-graphs] OK: transpose (deBruijn n xs) == gmap reverse $ deBruijn n xs
  21830. 1585.43 s [algebraic-graphs] OK: vertexCount (deBruijn n xs) == (length $ nub xs)^n
  21831. 1585.43 s [algebraic-graphs] OK: n > 0 ==> edgeCount (deBruijn n xs) == (length $ nub xs)^(n + 1)
  21832. 1585.43 s [algebraic-graphs]
  21833. 1585.43 s [algebraic-graphs] ============ Graph.splitVertex ============
  21834. 1585.43 s [algebraic-graphs] OK: splitVertex x [] == removeVertex x
  21835. 1585.43 s [algebraic-graphs] OK: splitVertex x [x] == id
  21836. 1585.43 s [algebraic-graphs] OK: splitVertex x [y] == replaceVertex x y
  21837. 1585.43 s [algebraic-graphs] OK: splitVertex 1 [0, 1] $ 1 * (2 + 3) == (0 + 1) * (2 + 3)
  21838. 1585.43 s [algebraic-graphs]
  21839. 1585.43 s [algebraic-graphs] ============ Graph.bind ============
  21840. 1585.43 s [algebraic-graphs] OK: bind empty f == empty
  21841. 1585.43 s [algebraic-graphs] OK: bind (vertex x) f == f x
  21842. 1585.43 s [algebraic-graphs] OK: bind (edge x y) f == connect (f x) (f y)
  21843. 1585.43 s [algebraic-graphs] OK: bind (vertices xs) f == overlays (map f xs)
  21844. 1585.43 s [algebraic-graphs] OK: bind x (const empty) == empty
  21845. 1585.43 s [algebraic-graphs] OK: bind x vertex == x
  21846. 1585.43 s [algebraic-graphs] OK: bind (bind x f) g == bind x (\y -> bind (f y) g)
  21847. 1585.43 s [algebraic-graphs]
  21848. 1585.43 s [algebraic-graphs] ============ Graph.simplify ============
  21849. 1585.43 s [algebraic-graphs] OK: simplify == id
  21850. 1585.43 s [algebraic-graphs] OK: size (simplify x) <= size x
  21851. 1585.43 s [algebraic-graphs]
  21852. 1585.43 s [algebraic-graphs] ============ Graph.box ============
  21853. 1585.43 s [algebraic-graphs] OK: box x y ~~ box y x
  21854. 1585.44 s [algebraic-graphs] OK: box x (overlay y z) == overlay (box x y) (box x z)
  21855. 1585.44 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  21856. 1585.44 s [algebraic-graphs] OK: box x empty ~~ empty
  21857. 1585.44 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  21858. 1585.44 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  21859. 1585.44 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  21860. 1585.44 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  21861. 1585.44 s [algebraic-graphs]
  21862. 1585.44 s [algebraic-graphs] ============ Graph.sparsify ============
  21863. 1585.44 s [algebraic-graphs] OK: sort . reachable x == sort . rights . reachable (sparsify x) . Right
  21864. 1585.44 s [algebraic-graphs] OK: vertexCount (sparsify x) <= vertexCount x + size x + 1
  21865. 1585.44 s [algebraic-graphs] OK: edgeCount (sparsify x) <= 3 * size x
  21866. 1585.44 s [algebraic-graphs] OK: size (sparsify x) <= 3 * size x
  21867. 1585.44 s [algebraic-graphs]
  21868. 1585.44 s [algebraic-graphs] ============ Graph.sparsifyKL ============
  21869. 1585.44 s [algebraic-graphs] OK: sort . reachable x == sort . filter (<= n) . reachable (sparsifyKL n x)
  21870. 1585.44 s [algebraic-graphs] OK: length (vertices $ sparsifyKL n x) <= vertexCount x + size x + 1
  21871. 1585.44 s [algebraic-graphs] OK: length (edges $ sparsifyKL n x) <= 3 * size x
  21872. 1585.44 s [algebraic-graphs]
  21873. 1585.44 s [algebraic-graphs] ============ Graph.context ============
  21874. 1585.44 s [algebraic-graphs] OK: context (const False) x == Nothing
  21875. 1585.44 s [algebraic-graphs] OK: context (== 1) (edge 1 2) == Just (Context [ ] [2 ])
  21876. 1585.44 s [algebraic-graphs] OK: context (== 2) (edge 1 2) == Just (Context [1 ] [ ])
  21877. 1585.44 s [algebraic-graphs] OK: context (const True ) (edge 1 2) == Just (Context [1 ] [2 ])
  21878. 1585.44 s [algebraic-graphs] OK: context (== 4) (3 * 1 * 4 * 1 * 5) == Just (Context [3,1] [1,5])
  21879. 1585.44 s [algebraic-graphs]
  21880. 1585.44 s [algebraic-graphs] ============ Graph.buildg ============
  21881. 1585.44 s [algebraic-graphs] OK: buildg (\e _ _ _ -> e) == empty
  21882. 1585.44 s [algebraic-graphs] OK: buildg (\_ v _ _ -> v x) == vertex x
  21883. 1585.44 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
  21884. 1585.44 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
  21885. 1585.44 s [algebraic-graphs] OK: buildg (\e v o _ -> foldr o e (map v xs)) == vertices xs
  21886. 1585.44 s [algebraic-graphs] OK: buildg (\e v o c -> foldg e v o (flip c) g) == transpose g
  21887. 1585.44 s [algebraic-graphs]
  21888. 1585.44 s [algebraic-graphs] ============ Internal.List ============
  21889. 1585.44 s [algebraic-graphs] OK: pure 1 <> pure 4 == [1, 4]
  21890. 1585.44 s [algebraic-graphs]
  21891. 1585.44 s [algebraic-graphs] ============ Graph.Label ============
  21892. 1585.44 s [algebraic-graphs]
  21893. 1585.44 s [algebraic-graphs] ============ Any: instances ============
  21894. 1585.44 s [algebraic-graphs] OK: Semiring
  21895. 1585.44 s [algebraic-graphs] OK: StarSemiring
  21896. 1585.44 s [algebraic-graphs] OK: Dioid
  21897. 1585.44 s [algebraic-graphs]
  21898. 1585.44 s [algebraic-graphs] ============ Distance Int: instances ============
  21899. 1585.44 s [algebraic-graphs] OK: Semiring
  21900. 1585.44 s [algebraic-graphs] OK: StarSemiring
  21901. 1585.44 s [algebraic-graphs] OK: Dioid
  21902. 1585.44 s [algebraic-graphs]
  21903. 1585.44 s [algebraic-graphs] ============ Capacity Int: instances ============
  21904. 1585.44 s [algebraic-graphs] OK: Semiring
  21905. 1585.44 s [algebraic-graphs] OK: StarSemiring
  21906. 1585.44 s [algebraic-graphs] OK: Dioid
  21907. 1585.44 s [algebraic-graphs]
  21908. 1585.44 s [algebraic-graphs] ============ Minimum (Path Int): instances ============
  21909. 1585.44 s [algebraic-graphs] OK: LeftNearRing
  21910. 1585.44 s [algebraic-graphs]
  21911. 1585.44 s [algebraic-graphs] ============ PowerSet (Path Int): instances ============
  21912. 1585.44 s [algebraic-graphs] OK: Semiring
  21913. 1585.44 s [algebraic-graphs] OK: Dioid
  21914. 1585.44 s [algebraic-graphs]
  21915. 1585.44 s [algebraic-graphs] ============ Count Int: instances ============
  21916. 1585.44 s [algebraic-graphs] OK: Semiring
  21917. 1585.44 s [algebraic-graphs] OK: StarSemiring
  21918. 1585.44 s [algebraic-graphs]
  21919. 1585.44 s [algebraic-graphs] ============ Labelled.AdjacencyMap.consistent ============
  21920. 1585.44 s [algebraic-graphs] OK: arbitraryLabelledAdjacencyMap
  21921. 1585.44 s [algebraic-graphs] OK: empty
  21922. 1585.44 s [algebraic-graphs] OK: vertex
  21923. 1585.44 s [algebraic-graphs] OK: edge
  21924. 1585.44 s [algebraic-graphs] OK: overlay
  21925. 1585.44 s [algebraic-graphs] OK: connect
  21926. 1585.44 s [algebraic-graphs] OK: vertices
  21927. 1585.44 s [algebraic-graphs] OK: edges
  21928. 1585.44 s [algebraic-graphs] OK: overlays
  21929. 1585.44 s [algebraic-graphs] OK: fromAdjacencyMaps
  21930. 1585.44 s [algebraic-graphs] OK: removeVertex
  21931. 1585.44 s [algebraic-graphs] OK: removeEdge
  21932. 1585.44 s [algebraic-graphs] OK: replaceVertex
  21933. 1585.44 s [algebraic-graphs] OK: replaceEdge
  21934. 1585.44 s [algebraic-graphs] OK: transpose
  21935. 1585.44 s [algebraic-graphs] OK: gmap
  21936. 1585.44 s [algebraic-graphs] OK: emap
  21937. 1585.44 s [algebraic-graphs] OK: induce
  21938. 1585.44 s [algebraic-graphs] OK: closure
  21939. 1585.44 s [algebraic-graphs] OK: reflexiveClosure
  21940. 1585.44 s [algebraic-graphs] OK: symmetricClosure
  21941. 1585.44 s [algebraic-graphs] OK: transitiveClosure
  21942. 1585.44 s [algebraic-graphs]
  21943. 1585.44 s [algebraic-graphs] ============ Labelled.AdjacencyMap.empty ============
  21944. 1585.44 s [algebraic-graphs] OK: isEmpty empty == True
  21945. 1585.44 s [algebraic-graphs] OK: hasVertex x empty == False
  21946. 1585.44 s [algebraic-graphs] OK: vertexCount empty == 0
  21947. 1585.44 s [algebraic-graphs] OK: edgeCount empty == 0
  21948. 1585.44 s [algebraic-graphs]
  21949. 1585.44 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertex ============
  21950. 1585.44 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  21951. 1585.44 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  21952. 1585.44 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  21953. 1585.44 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  21954. 1585.44 s [algebraic-graphs]
  21955. 1588.19 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edge ============
  21956. 1588.19 s [algebraic-graphs] OK: edge e x y == connect e (vertex x) (vertex y)
  21957. 1588.19 s [algebraic-graphs] OK: edge zero x y == vertices [x,y]
  21958. 1588.19 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= mempty)
  21959. 1588.19 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  21960. 1588.19 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == mempty then 0 else 1
  21961. 1588.19 s [algebraic-graphs] OK: vertexCount (edge e 1 1) == 1
  21962. 1588.19 s [algebraic-graphs] OK: vertexCount (edge e 1 2) == 2
  21963. 1588.19 s [algebraic-graphs] OK: x -<e>- y == edge e x y
  21964. 1588.19 s [algebraic-graphs]
  21965. 1588.19 s [algebraic-graphs] ============ Labelled.AdjacencyMap.overlay ============
  21966. 1588.19 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  21967. 1588.19 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  21968. 1588.19 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  21969. 1588.19 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  21970. 1588.19 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  21971. 1588.19 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  21972. 1588.19 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  21973. 1588.19 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  21974. 1588.19 s [algebraic-graphs]
  21975. 1588.19 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge zero x y) == e
  21976. 1588.19 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge f x y) == e <+> f
  21977. 1588.19 s [algebraic-graphs]
  21978. 1588.19 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge one 2 3)) == e
  21979. 1588.19 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge f 2 3)) == e <.> f
  21980. 1588.19 s [algebraic-graphs]
  21981. 1588.19 s [algebraic-graphs] ============ Labelled.AdjacencyMap.connect ============
  21982. 1588.19 s [algebraic-graphs] OK: isEmpty (connect e x y) == isEmpty x && isEmpty y
  21983. 1588.19 s [algebraic-graphs] OK: hasVertex z (connect e x y) == hasVertex z x || hasVertex z y
  21984. 1588.19 s [algebraic-graphs] OK: vertexCount (connect e x y) >= vertexCount x
  21985. 1588.19 s [algebraic-graphs] OK: vertexCount (connect e x y) <= vertexCount x + vertexCount y
  21986. 1588.19 s [algebraic-graphs] OK: edgeCount (connect e x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  21987. 1588.19 s [algebraic-graphs] OK: vertexCount (connect e 1 2) == 2
  21988. 1588.19 s [algebraic-graphs] OK: edgeCount (connect e 1 2) == if e == zero then 0 else 1
  21989. 1588.19 s [algebraic-graphs]
  21990. 1588.19 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertices ============
  21991. 1588.19 s [algebraic-graphs] OK: vertices [] == empty
  21992. 1588.19 s [algebraic-graphs] OK: vertices [x] == vertex x
  21993. 1588.19 s [algebraic-graphs] OK: vertices == overlays . map vertex
  21994. 1588.19 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  21995. 1588.19 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  21996. 1588.19 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  21997. 1588.19 s [algebraic-graphs]
  21998. 1588.19 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edges ============
  21999. 1588.19 s [algebraic-graphs] OK: edges [] == empty
  22000. 1588.19 s [algebraic-graphs] OK: edges [(e,x,y)] == edge e x y
  22001. 1588.19 s [algebraic-graphs] OK: edges == overlays . map (\(e, x, y) -> edge e x y)
  22002. 1588.19 s [algebraic-graphs]
  22003. 1588.19 s [algebraic-graphs] ============ Labelled.AdjacencyMap.overlays ============
  22004. 1588.19 s [algebraic-graphs] OK: overlays [] == empty
  22005. 1588.19 s [algebraic-graphs] OK: overlays [x] == x
  22006. 1588.19 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  22007. 1588.19 s [algebraic-graphs] OK: overlays == foldr overlay empty
  22008. 1588.19 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  22009. 1588.19 s [algebraic-graphs]
  22010. 1588.19 s [algebraic-graphs] ============ Labelled.AdjacencyMap.fromAdjacencyMaps ============
  22011. 1588.19 s [algebraic-graphs] OK: fromAdjacencyMaps [] == empty
  22012. 1588.19 s [algebraic-graphs] OK: fromAdjacencyMaps [(x, Map.empty)] == vertex x
  22013. 1588.19 s [algebraic-graphs] OK: fromAdjacencyMaps [(x, Map.singleton y e)] == if e == zero then vertices [x,y] else edge e x y
  22014. 1588.19 s [algebraic-graphs] OK: overlay (fromAdjacencyMaps xs) (fromAdjacencyMaps ys) == fromAdjacencyMaps (xs ++ ys)
  22015. 1588.19 s [algebraic-graphs]
  22016. 1588.19 s [algebraic-graphs] ============ Labelled.AdjacencyMap.isSubgraphOf ============
  22017. 1588.19 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  22018. 1588.19 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  22019. 1588.19 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  22020. 1588.19 s [algebraic-graphs]
  22021. 1588.19 s [algebraic-graphs] ============ Labelled.AdjacencyMap.isEmpty ============
  22022. 1588.19 s [algebraic-graphs] OK: isEmpty empty == True
  22023. 1588.19 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  22024. 1588.19 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  22025. 1588.19 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  22026. 1588.19 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge e x y) == False
  22027. 1588.19 s [algebraic-graphs]
  22028. 1588.19 s [algebraic-graphs] ============ Labelled.AdjacencyMap.hasVertex ============
  22029. 1588.19 s [algebraic-graphs] OK: hasVertex x empty == False
  22030. 1588.19 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  22031. 1588.19 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  22032. 1588.19 s [algebraic-graphs]
  22033. 1588.19 s [algebraic-graphs] ============ Labelled.AdjacencyMap.hasEdge ============
  22034. 1588.19 s [algebraic-graphs] OK: hasEdge x y empty == False
  22035. 1588.19 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  22036. 1588.19 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= zero)
  22037. 1588.19 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  22038. 1588.19 s [algebraic-graphs] OK: hasEdge x y == not . null . filter (\(_,ex,ey) -> ex == x && ey == y) . edgeList
  22039. 1588.19 s [algebraic-graphs]
  22040. 1588.19 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edgeLabel ============
  22041. 1588.19 s [algebraic-graphs] OK: edgeLabel x y empty == zero
  22042. 1588.19 s [algebraic-graphs] OK: edgeLabel x y (vertex z) == zero
  22043. 1588.19 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  22044. 1588.19 s [algebraic-graphs] OK: edgeLabel s t (overlay x y) == edgeLabel s t x + edgeLabel s t y
  22045. 1588.19 s [algebraic-graphs]
  22046. 1588.19 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertexCount ============
  22047. 1588.19 s [algebraic-graphs] OK: vertexCount empty == 0
  22048. 1588.19 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  22049. 1588.19 s [algebraic-graphs] OK: vertexCount == length . vertexList
  22050. 1588.19 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  22051. 1588.19 s [algebraic-graphs]
  22052. 1588.19 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edgeCount ============
  22053. 1588.19 s [algebraic-graphs] OK: edgeCount empty == 0
  22054. 1588.19 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  22055. 1588.19 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == zero then 0 else 1
  22056. 1588.19 s [algebraic-graphs] OK: edgeCount == length . edgeList
  22057. 1588.19 s [algebraic-graphs]
  22058. 1588.19 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertexList ============
  22059. 1588.19 s [algebraic-graphs] OK: vertexList empty == []
  22060. 1588.19 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  22061. 1588.19 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  22062. 1588.19 s [algebraic-graphs]
  22063. 1588.19 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edgeList ============
  22064. 1588.19 s [algebraic-graphs] OK: edgeList empty == []
  22065. 1588.19 s [algebraic-graphs] OK: edgeList (vertex x) == []
  22066. 1588.19 s [algebraic-graphs] OK: edgeList (edge e x y) == if e == zero then [] else [(e,x,y)]
  22067. 1588.19 s [algebraic-graphs]
  22068. 1588.19 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertexSet ============
  22069. 1588.19 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  22070. 1588.19 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  22071. 1588.19 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  22072. 1588.19 s [algebraic-graphs]
  22073. 1588.19 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edgeSet ============
  22074. 1588.19 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  22075. 1588.19 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  22076. 1588.19 s [algebraic-graphs] OK: edgeSet (edge e x y) == if e == zero then Set.empty else Set.singleton (e,x,y)
  22077. 1588.19 s [algebraic-graphs]
  22078. 1588.19 s [algebraic-graphs] ============ Labelled.AdjacencyMap.preSet ============
  22079. 1588.19 s [algebraic-graphs] OK: preSet x empty == Set.empty
  22080. 1588.19 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  22081. 1588.19 s [algebraic-graphs] OK: preSet 1 (edge e 1 2) == Set.empty
  22082. 1588.19 s [algebraic-graphs] OK: preSet y (edge e x y) == if e == zero then Set.empty else Set.fromList [x]
  22083. 1588.19 s [algebraic-graphs]
  22084. 1588.19 s [algebraic-graphs] ============ Labelled.AdjacencyMap.postSet ============
  22085. 1588.19 s [algebraic-graphs] OK: postSet x empty == Set.empty
  22086. 1588.19 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  22087. 1588.19 s [algebraic-graphs] OK: postSet x (edge e x y) == if e == zero then Set.empty else Set.fromList [y]
  22088. 1588.19 s [algebraic-graphs] OK: postSet 2 (edge e 1 2) == Set.empty
  22089. 1588.19 s [algebraic-graphs]
  22090. 1588.19 s [algebraic-graphs] ============ Labelled.AdjacencyMap.skeleton ============
  22091. 1588.19 s [algebraic-graphs] OK: hasEdge x y == hasEdge x y . skeleton
  22092. 1588.19 s [algebraic-graphs]
  22093. 1588.19 s [algebraic-graphs] ============ Labelled.AdjacencyMap.removeVertex ============
  22094. 1588.19 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  22095. 1588.19 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  22096. 1588.19 s [algebraic-graphs] OK: removeVertex x (edge e x x) == empty
  22097. 1588.20 s [algebraic-graphs] OK: removeVertex 1 (edge e 1 2) == vertex 2
  22098. 1588.20 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  22099. 1588.20 s [algebraic-graphs]
  22100. 1588.20 s [algebraic-graphs] ============ Labelled.AdjacencyMap.removeEdge ============
  22101. 1588.20 s [algebraic-graphs] OK: removeEdge x y (edge e x y) == vertices [x,y]
  22102. 1588.20 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  22103. 1588.20 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  22104. 1588.20 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  22105. 1588.20 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  22106. 1588.20 s [algebraic-graphs]
  22107. 1588.20 s [algebraic-graphs] ============ Labelled.AdjacencyMap.replaceVertex ============
  22108. 1588.20 s [algebraic-graphs] OK: replaceVertex x x == id
  22109. 1588.20 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  22110. 1588.20 s [algebraic-graphs] OK: replaceVertex x y == gmap (\v -> if v == x then y else v)
  22111. 1588.20 s [algebraic-graphs]
  22112. 1588.20 s [algebraic-graphs] ============ Labelled.AdjacencyMap.replaceEdge ============
  22113. 1588.20 s [algebraic-graphs] OK: replaceEdge e x y z == overlay (removeEdge x y z) (edge e x y)
  22114. 1588.20 s [algebraic-graphs] OK: replaceEdge e x y (edge f x y) == edge e x y
  22115. 1588.20 s [algebraic-graphs] OK: edgeLabel x y (replaceEdge e x y z) == e
  22116. 1588.20 s [algebraic-graphs]
  22117. 1588.20 s [algebraic-graphs] ============ Labelled.AdjacencyMap.transpose ============
  22118. 1588.20 s [algebraic-graphs] OK: transpose empty == empty
  22119. 1588.20 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  22120. 1588.20 s [algebraic-graphs] OK: transpose (edge e x y) == edge e y x
  22121. 1588.20 s [algebraic-graphs] OK: transpose . transpose == id
  22122. 1588.20 s [algebraic-graphs]
  22123. 1588.20 s [algebraic-graphs] ============ Labelled.AdjacencyMap.gmap ============
  22124. 1588.20 s [algebraic-graphs] OK: gmap f empty == empty
  22125. 1588.20 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  22126. 1588.20 s [algebraic-graphs] OK: gmap f (edge e x y) == edge e (f x) (f y)
  22127. 1588.20 s [algebraic-graphs] OK: gmap id == id
  22128. 1588.20 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  22129. 1588.20 s [algebraic-graphs]
  22130. 1588.20 s [algebraic-graphs] ============ Labelled.AdjacencyMap.emap ============
  22131. 1588.20 s [algebraic-graphs] OK: emap h empty == empty
  22132. 1588.20 s [algebraic-graphs] OK: emap h (vertex x) == vertex x
  22133. 1588.20 s [algebraic-graphs] OK: emap h (edge e x y) == edge (h e) x y
  22134. 1588.20 s [algebraic-graphs] OK: emap h (overlay x y) == overlay (emap h x) (emap h y)
  22135. 1588.20 s [algebraic-graphs] OK: emap h (connect e x y) == connect (h e) (emap h x) (emap h y)
  22136. 1588.20 s [algebraic-graphs] OK: emap id == id
  22137. 1588.20 s [algebraic-graphs] OK: emap g . emap h == emap (g . h)
  22138. 1588.20 s [algebraic-graphs]
  22139. 1588.20 s [algebraic-graphs] ============ Labelled.AdjacencyMap.induce ============
  22140. 1588.20 s [algebraic-graphs] OK: induce (const True ) x == x
  22141. 1588.20 s [algebraic-graphs] OK: induce (const False) x == empty
  22142. 1588.20 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  22143. 1588.20 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  22144. 1588.20 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  22145. 1588.20 s [algebraic-graphs]
  22146. 1588.20 s [algebraic-graphs] ============ Labelled.AdjacencyMap.induceJust ============
  22147. 1589.46 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  22148. 1589.46 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  22149. 1589.46 s [algebraic-graphs] OK: induceJust . gmap Just == id
  22150. 1589.46 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  22151. 1589.46 s [algebraic-graphs]
  22152. 1589.46 s [algebraic-graphs] ============ Labelled.AdjacencyMap.closure ============
  22153. 1589.46 s [algebraic-graphs] OK: closure empty == empty
  22154. 1589.46 s [algebraic-graphs] OK: closure (vertex x) == edge one x x
  22155. 1589.46 s [algebraic-graphs] OK: closure (edge e x x) == edge one x x
  22156. 1589.46 s [algebraic-graphs] OK: closure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  22157. 1589.46 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  22158. 1589.46 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  22159. 1589.46 s [algebraic-graphs] OK: closure . closure == closure
  22160. 1589.46 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  22161. 1589.46 s [algebraic-graphs]
  22162. 1589.46 s [algebraic-graphs] ============ Labelled.AdjacencyMap.reflexiveClosure ============
  22163. 1589.46 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  22164. 1589.46 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge one x x
  22165. 1589.46 s [algebraic-graphs] OK: reflexiveClosure (edge e x x) == edge one x x
  22166. 1589.46 s [algebraic-graphs] OK: reflexiveClosure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  22167. 1589.46 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  22168. 1589.46 s [algebraic-graphs]
  22169. 1589.46 s [algebraic-graphs] ============ Labelled.AdjacencyMap.symmetricClosure ============
  22170. 1589.46 s [algebraic-graphs] OK: symmetricClosure empty == empty
  22171. 1589.46 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  22172. 1589.46 s [algebraic-graphs] OK: symmetricClosure (edge e x y) == edges [(e,x,y), (e,y,x)]
  22173. 1589.46 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  22174. 1589.46 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  22175. 1589.46 s [algebraic-graphs]
  22176. 1589.46 s [algebraic-graphs] ============ Labelled.AdjacencyMap.transitiveClosure ============
  22177. 1589.46 s [algebraic-graphs] OK: transitiveClosure empty == empty
  22178. 1589.46 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  22179. 1589.46 s [algebraic-graphs] OK: transitiveClosure (edge e x y) == edge e x y
  22180. 1589.46 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  22181. 1589.46 s [algebraic-graphs]
  22182. 1589.46 s [algebraic-graphs] ============ Labelled.Graph.empty ============
  22183. 1589.46 s [algebraic-graphs] OK: isEmpty empty == True
  22184. 1589.46 s [algebraic-graphs] OK: hasVertex x empty == False
  22185. 1589.46 s [algebraic-graphs] OK: vertexCount empty == 0
  22186. 1589.46 s [algebraic-graphs] OK: edgeCount empty == 0
  22187. 1589.46 s [algebraic-graphs]
  22188. 1589.46 s [algebraic-graphs] ============ Labelled.Graph.vertex ============
  22189. 1589.46 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  22190. 1589.46 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  22191. 1589.46 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  22192. 1589.46 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  22193. 1589.46 s [algebraic-graphs]
  22194. 1589.46 s [algebraic-graphs] ============ Labelled.Graph.edge ============
  22195. 1589.46 s [algebraic-graphs] OK: edge e x y == connect e (vertex x) (vertex y)
  22196. 1589.46 s [algebraic-graphs] OK: edge zero x y == vertices [x,y]
  22197. 1589.46 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= mempty)
  22198. 1589.46 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  22199. 1589.46 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == mempty then 0 else 1
  22200. 1589.46 s [algebraic-graphs] OK: vertexCount (edge e 1 1) == 1
  22201. 1589.46 s [algebraic-graphs] OK: vertexCount (edge e 1 2) == 2
  22202. 1589.46 s [algebraic-graphs] OK: x -<e>- y == edge e x y
  22203. 1589.46 s [algebraic-graphs]
  22204. 1589.46 s [algebraic-graphs] ============ Labelled.Graph.overlay ============
  22205. 1589.46 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  22206. 1589.46 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  22207. 1589.46 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  22208. 1589.46 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  22209. 1589.46 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  22210. 1589.46 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  22211. 1589.46 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  22212. 1589.46 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  22213. 1589.46 s [algebraic-graphs]
  22214. 1589.46 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge zero x y) == e
  22215. 1589.46 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge f x y) == e <+> f
  22216. 1589.46 s [algebraic-graphs]
  22217. 1589.46 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge one 2 3)) == e
  22218. 1589.46 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge f 2 3)) == e <.> f
  22219. 1589.46 s [algebraic-graphs]
  22220. 1589.46 s [algebraic-graphs] ============ Labelled.Graph.connect ============
  22221. 1589.46 s [algebraic-graphs] OK: isEmpty (connect e x y) == isEmpty x && isEmpty y
  22222. 1589.46 s [algebraic-graphs] OK: hasVertex z (connect e x y) == hasVertex z x || hasVertex z y
  22223. 1589.46 s [algebraic-graphs] OK: vertexCount (connect e x y) >= vertexCount x
  22224. 1589.46 s [algebraic-graphs] OK: vertexCount (connect e x y) <= vertexCount x + vertexCount y
  22225. 1589.46 s [algebraic-graphs] OK: edgeCount (connect e x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  22226. 1589.46 s [algebraic-graphs] OK: vertexCount (connect e 1 2) == 2
  22227. 1589.46 s [algebraic-graphs] OK: edgeCount (connect e 1 2) == if e == zero then 0 else 1
  22228. 1589.46 s [algebraic-graphs]
  22229. 1589.46 s [algebraic-graphs] ============ Labelled.Graph.vertices ============
  22230. 1589.46 s [algebraic-graphs] OK: vertices [] == empty
  22231. 1589.46 s [algebraic-graphs] OK: vertices [x] == vertex x
  22232. 1589.46 s [algebraic-graphs] OK: vertices == overlays . map vertex
  22233. 1589.46 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  22234. 1589.46 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  22235. 1589.46 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  22236. 1589.46 s [algebraic-graphs]
  22237. 1589.46 s [algebraic-graphs] ============ Labelled.Graph.edges ============
  22238. 1589.46 s [algebraic-graphs] OK: edges [] == empty
  22239. 1589.46 s [algebraic-graphs] OK: edges [(e,x,y)] == edge e x y
  22240. 1589.46 s [algebraic-graphs] OK: edges == overlays . map (\(e, x, y) -> edge e x y)
  22241. 1589.46 s [algebraic-graphs]
  22242. 1589.46 s [algebraic-graphs] ============ Labelled.Graph.overlays ============
  22243. 1589.46 s [algebraic-graphs] OK: overlays [] == empty
  22244. 1589.46 s [algebraic-graphs] OK: overlays [x] == x
  22245. 1589.46 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  22246. 1589.46 s [algebraic-graphs] OK: overlays == foldr overlay empty
  22247. 1589.46 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  22248. 1589.46 s [algebraic-graphs]
  22249. 1589.46 s [algebraic-graphs] ============ Labelled.Graph.foldg ============
  22250. 1589.46 s [algebraic-graphs] OK: foldg empty vertex connect == id
  22251. 1589.46 s [algebraic-graphs] OK: foldg empty vertex (fmap flip connect) == transpose
  22252. 1589.46 s [algebraic-graphs] OK: foldg 1 (const 1) (const (+)) == size
  22253. 1589.46 s [algebraic-graphs] OK: foldg True (const False) (const (&&)) == isEmpty
  22254. 1589.46 s [algebraic-graphs] OK: foldg False (== x) (const (||)) == hasVertex x
  22255. 1589.46 s [algebraic-graphs] OK: foldg Set.empty Set.singleton (const Set.union) == vertexSet
  22256. 1589.46 s [algebraic-graphs]
  22257. 1589.46 s [algebraic-graphs] ============ Labelled.Graph.buildg ============
  22258. 1589.46 s [algebraic-graphs] OK: buildg (\e _ _ -> e) == empty
  22259. 1589.46 s [algebraic-graphs] OK: buildg (\_ v _ -> v x) == vertex x
  22260. 1589.46 s [algebraic-graphs] OK: buildg (\e v c -> c l (foldg e v c x) (foldg e v c y)) == connect l x y
  22261. 1589.46 s [algebraic-graphs] OK: buildg (\e v c -> foldr (c zero) e (map v xs)) == vertices xs
  22262. 1589.46 s [algebraic-graphs] OK: buildg (\e v c -> foldg e v (flip c) g) == transpose g
  22263. 1589.46 s [algebraic-graphs]
  22264. 1589.46 s [algebraic-graphs] ============ Labelled.Graph.isSubgraphOf ============
  22265. 1589.46 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  22266. 1589.46 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  22267. 1589.46 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  22268. 1589.46 s [algebraic-graphs]
  22269. 1589.46 s [algebraic-graphs] ============ Labelled.Graph.isEmpty ============
  22270. 1589.46 s [algebraic-graphs] OK: isEmpty empty == True
  22271. 1589.46 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  22272. 1589.46 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  22273. 1589.46 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  22274. 1589.46 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge e x y) == False
  22275. 1589.46 s [algebraic-graphs]
  22276. 1589.46 s [algebraic-graphs] ============ Labelled.Graph.size ============
  22277. 1589.46 s [algebraic-graphs] OK: size empty == 1
  22278. 1589.46 s [algebraic-graphs] OK: size (vertex x) == 1
  22279. 1589.46 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  22280. 1589.46 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  22281. 1589.46 s [algebraic-graphs] OK: size x >= 1
  22282. 1589.46 s [algebraic-graphs] OK: size x >= vertexCount x
  22283. 1589.46 s [algebraic-graphs]
  22284. 1589.46 s [algebraic-graphs] ============ Labelled.Graph.hasVertex ============
  22285. 1589.46 s [algebraic-graphs] OK: hasVertex x empty == False
  22286. 1589.46 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  22287. 1589.46 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  22288. 1589.46 s [algebraic-graphs]
  22289. 1589.46 s [algebraic-graphs] ============ Labelled.Graph.hasEdge ============
  22290. 1589.46 s [algebraic-graphs] OK: hasEdge x y empty == False
  22291. 1589.46 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  22292. 1589.46 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= zero)
  22293. 1589.46 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  22294. 1589.46 s [algebraic-graphs] OK: hasEdge x y == not . null . filter (\(_,ex,ey) -> ex == x && ey == y) . edgeList
  22295. 1589.46 s [algebraic-graphs]
  22296. 1589.46 s [algebraic-graphs] ============ Labelled.Graph.edgeLabel ============
  22297. 1589.46 s [algebraic-graphs] OK: edgeLabel x y empty == zero
  22298. 1589.46 s [algebraic-graphs] OK: edgeLabel x y (vertex z) == zero
  22299. 1589.47 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  22300. 1589.47 s [algebraic-graphs] OK: edgeLabel s t (overlay x y) == edgeLabel s t x + edgeLabel s t y
  22301. 1589.47 s [algebraic-graphs]
  22302. 1589.47 s [algebraic-graphs] ============ Labelled.Graph.vertexCount ============
  22303. 1589.47 s [algebraic-graphs] OK: vertexCount empty == 0
  22304. 1589.47 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  22305. 1589.47 s [algebraic-graphs] OK: vertexCount == length . vertexList
  22306. 1589.47 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  22307. 1589.47 s [algebraic-graphs]
  22308. 1589.47 s [algebraic-graphs] ============ Labelled.Graph.edgeCount ============
  22309. 1589.47 s [algebraic-graphs] OK: edgeCount empty == 0
  22310. 1589.47 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  22311. 1589.47 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == zero then 0 else 1
  22312. 1589.47 s [algebraic-graphs] OK: edgeCount == length . edgeList
  22313. 1589.47 s [algebraic-graphs]
  22314. 1589.47 s [algebraic-graphs] ============ Labelled.Graph.vertexList ============
  22315. 1589.47 s [algebraic-graphs] OK: vertexList empty == []
  22316. 1589.47 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  22317. 1589.47 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  22318. 1589.47 s [algebraic-graphs]
  22319. 1589.47 s [algebraic-graphs] ============ Labelled.Graph.edgeList ============
  22320. 1589.47 s [algebraic-graphs] OK: edgeList empty == []
  22321. 1589.47 s [algebraic-graphs] OK: edgeList (vertex x) == []
  22322. 1589.47 s [algebraic-graphs] OK: edgeList (edge e x y) == if e == zero then [] else [(e,x,y)]
  22323. 1589.47 s [algebraic-graphs]
  22324. 1589.47 s [algebraic-graphs] ============ Labelled.Graph.vertexSet ============
  22325. 1589.47 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  22326. 1589.47 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  22327. 1589.47 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  22328. 1589.47 s [algebraic-graphs]
  22329. 1589.47 s [algebraic-graphs] ============ Labelled.Graph.edgeSet ============
  22330. 1589.47 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  22331. 1589.47 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  22332. 1589.47 s [algebraic-graphs] OK: edgeSet (edge e x y) == if e == zero then Set.empty else Set.singleton (e,x,y)
  22333. 1589.47 s [algebraic-graphs]
  22334. 1589.47 s [algebraic-graphs] ============ Labelled.Graph.preSet ============
  22335. 1589.47 s [algebraic-graphs] OK: preSet x empty == Set.empty
  22336. 1589.47 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  22337. 1592.95 s [algebraic-graphs] OK: preSet 1 (edge e 1 2) == Set.empty
  22338. 1593.09 s [algebraic-graphs] OK: preSet y (edge e x y) == if e == zero then Set.empty else Set.fromList [x]
  22339. 1593.09 s [algebraic-graphs]
  22340. 1593.09 s [algebraic-graphs] ============ Labelled.Graph.postSet ============
  22341. 1593.09 s [algebraic-graphs] OK: postSet x empty == Set.empty
  22342. 1593.09 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  22343. 1593.09 s [algebraic-graphs] OK: postSet x (edge e x y) == if e == zero then Set.empty else Set.fromList [y]
  22344. 1593.09 s [algebraic-graphs] OK: postSet 2 (edge e 1 2) == Set.empty
  22345. 1593.09 s [algebraic-graphs]
  22346. 1593.09 s [algebraic-graphs] ============ Labelled.Graph.removeVertex ============
  22347. 1593.09 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  22348. 1593.09 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  22349. 1593.09 s [algebraic-graphs] OK: removeVertex x (edge e x x) == empty
  22350. 1593.09 s [algebraic-graphs] OK: removeVertex 1 (edge e 1 2) == vertex 2
  22351. 1593.09 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  22352. 1593.09 s [algebraic-graphs]
  22353. 1593.09 s [algebraic-graphs] ============ Labelled.Graph.removeEdge ============
  22354. 1593.09 s [algebraic-graphs] OK: removeEdge x y (edge e x y) == vertices [x,y]
  22355. 1593.09 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  22356. 1593.09 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  22357. 1593.09 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  22358. 1593.09 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  22359. 1593.09 s [algebraic-graphs]
  22360. 1593.09 s [algebraic-graphs] ============ Labelled.Graph.replaceVertex ============
  22361. 1593.09 s [algebraic-graphs] OK: replaceVertex x x == id
  22362. 1593.09 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  22363. 1593.09 s [algebraic-graphs] OK: replaceVertex x y == fmap (\v -> if v == x then y else v)
  22364. 1593.09 s [algebraic-graphs]
  22365. 1593.09 s [algebraic-graphs] ============ Labelled.Graph.replaceEdge ============
  22366. 1593.09 s [algebraic-graphs] OK: replaceEdge e x y z == overlay (removeEdge x y z) (edge e x y)
  22367. 1593.09 s [algebraic-graphs] OK: replaceEdge e x y (edge f x y) == edge e x y
  22368. 1593.09 s [algebraic-graphs] OK: edgeLabel x y (replaceEdge e x y z) == e
  22369. 1593.09 s [algebraic-graphs]
  22370. 1593.09 s [algebraic-graphs] ============ Labelled.Graph.transpose ============
  22371. 1593.09 s [algebraic-graphs] OK: transpose empty == empty
  22372. 1593.09 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  22373. 1593.09 s [algebraic-graphs] OK: transpose (edge e x y) == edge e y x
  22374. 1593.09 s [algebraic-graphs] OK: transpose . transpose == id
  22375. 1593.09 s [algebraic-graphs]
  22376. 1593.09 s [algebraic-graphs] ============ Labelled.Graph.fmap ============
  22377. 1593.09 s [algebraic-graphs] OK: fmap f empty == empty
  22378. 1593.09 s [algebraic-graphs] OK: fmap f (vertex x) == vertex (f x)
  22379. 1593.09 s [algebraic-graphs] OK: fmap f (edge e x y) == edge e (f x) (f y)
  22380. 1593.09 s [algebraic-graphs] OK: fmap id == id
  22381. 1593.09 s [algebraic-graphs] OK: fmap f . fmap g == fmap (f . g)
  22382. 1593.09 s [algebraic-graphs]
  22383. 1593.09 s [algebraic-graphs] ============ Labelled.Graph.emap ============
  22384. 1593.09 s [algebraic-graphs] OK: emap h empty == empty
  22385. 1593.09 s [algebraic-graphs] OK: emap h (vertex x) == vertex x
  22386. 1593.09 s [algebraic-graphs] OK: emap h (edge e x y) == edge (h e) x y
  22387. 1593.09 s [algebraic-graphs] OK: emap h (overlay x y) == overlay (emap h x) (emap h y)
  22388. 1593.09 s [algebraic-graphs] OK: emap h (connect e x y) == connect (h e) (emap h x) (emap h y)
  22389. 1593.09 s [algebraic-graphs] OK: emap id == id
  22390. 1593.09 s [algebraic-graphs] OK: emap g . emap h == emap (g . h)
  22391. 1593.09 s [algebraic-graphs]
  22392. 1593.09 s [algebraic-graphs] ============ Labelled.Graph.induce ============
  22393. 1593.09 s [algebraic-graphs] OK: induce (const True ) x == x
  22394. 1593.09 s [algebraic-graphs] OK: induce (const False) x == empty
  22395. 1593.09 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  22396. 1593.09 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  22397. 1593.09 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  22398. 1593.09 s [algebraic-graphs]
  22399. 1593.09 s [algebraic-graphs] ============ Labelled.Graph.induceJust ============
  22400. 1593.09 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  22401. 1593.09 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  22402. 1593.09 s [algebraic-graphs] OK: induceJust . gmap Just == id
  22403. 1593.09 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  22404. 1593.09 s [algebraic-graphs]
  22405. 1593.09 s [algebraic-graphs] ============ Labelled.Graph.closure ============
  22406. 1593.09 s [algebraic-graphs] OK: closure empty == empty
  22407. 1593.09 s [algebraic-graphs] OK: closure (vertex x) == edge one x x
  22408. 1593.09 s [algebraic-graphs] OK: closure (edge e x x) == edge one x x
  22409. 1593.09 s [algebraic-graphs] OK: closure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  22410. 1593.09 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  22411. 1593.09 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  22412. 1593.09 s [algebraic-graphs] OK: closure . closure == closure
  22413. 1593.09 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  22414. 1593.09 s [algebraic-graphs]
  22415. 1593.09 s [algebraic-graphs] ============ Labelled.Graph.reflexiveClosure ============
  22416. 1593.09 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  22417. 1593.09 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge one x x
  22418. 1593.09 s [algebraic-graphs] OK: reflexiveClosure (edge e x x) == edge one x x
  22419. 1593.09 s [algebraic-graphs] OK: reflexiveClosure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  22420. 1593.09 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  22421. 1593.09 s [algebraic-graphs]
  22422. 1593.09 s [algebraic-graphs] ============ Labelled.Graph.symmetricClosure ============
  22423. 1593.09 s [algebraic-graphs] OK: symmetricClosure empty == empty
  22424. 1593.09 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  22425. 1593.09 s [algebraic-graphs] OK: symmetricClosure (edge e x y) == edges [(e,x,y), (e,y,x)]
  22426. 1593.09 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  22427. 1593.09 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  22428. 1593.09 s [algebraic-graphs]
  22429. 1593.09 s [algebraic-graphs] ============ Labelled.Graph.transitiveClosure ============
  22430. 1593.09 s [algebraic-graphs] OK: transitiveClosure empty == empty
  22431. 1593.09 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  22432. 1593.09 s [algebraic-graphs] OK: transitiveClosure (edge e x y) == edge e x y
  22433. 1593.09 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  22434. 1593.09 s [algebraic-graphs]
  22435. 1593.09 s [algebraic-graphs] ============ Labelled.Graph.context ============
  22436. 1593.09 s [algebraic-graphs] OK: context (const False) x == Nothing
  22437. 1593.10 s [algebraic-graphs] OK: context (== 1) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [] [(e,2)])
  22438. 1593.10 s [algebraic-graphs] OK: context (== 2) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [(e,1)] [] )
  22439. 1593.10 s [algebraic-graphs] OK: context (const True ) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [(e,1)] [(e,2)])
  22440. 1593.10 s [algebraic-graphs] OK: context (== 4) (3 * 1 * 4 * 1 * 5) == Just (Context [(one,3), (one,1)] [(one,1), (one,5)])
  22441. 1593.10 s [algebraic-graphs]
  22442. 1593.10 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap ============
  22443. 1593.10 s [algebraic-graphs] OK: Axioms of non-empty graphs
  22444. 1593.10 s [algebraic-graphs] OK: Theorems of non-empty graphs
  22445. 1593.10 s [algebraic-graphs]
  22446. 1593.10 s [algebraic-graphs] ============ Ord (NonEmpty.AdjacencyMap a) ============
  22447. 1593.10 s [algebraic-graphs] OK: vertex 1 < vertex 2
  22448. 1593.10 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  22449. 1593.10 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  22450. 1593.10 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  22451. 1593.10 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  22452. 1593.10 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  22453. 1593.10 s [algebraic-graphs] OK: x <= x + y
  22454. 1593.10 s [algebraic-graphs] OK: x + y <= x * y
  22455. 1593.10 s [algebraic-graphs]
  22456. 1593.10 s [algebraic-graphs] ============ Show (NonEmpty.AdjacencyMap a) ============
  22457. 1593.10 s [algebraic-graphs] OK: show (1 :: AdjacencyMap Int) == "vertex 1"
  22458. 1593.10 s [algebraic-graphs] OK: show (1 + 2 :: AdjacencyMap Int) == "vertices1 [1,2]"
  22459. 1593.10 s [algebraic-graphs] OK: show (1 * 2 :: AdjacencyMap Int) == "edge 1 2"
  22460. 1593.10 s [algebraic-graphs] OK: show (1 * 2 * 3 :: AdjacencyMap Int) == "edges1 [(1,2),(1,3),(2,3)]"
  22461. 1593.10 s [algebraic-graphs] OK: show (1 * 2 + 3 :: AdjacencyMap Int) == "overlay (vertex 3) (edge 1 2)"
  22462. 1593.10 s [algebraic-graphs] OK: show (vertex (-1) :: AdjacencyMap Int) == "vertex (-1)"
  22463. 1593.10 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) :: AdjacencyMap Int) == "vertices1 [-2,-1]"
  22464. 1593.10 s [algebraic-graphs] OK: show (vertex (-1) * vertex (-2) :: AdjacencyMap Int) == "edge (-1) (-2)"
  22465. 1593.10 s [algebraic-graphs] OK: show (vertex (-1) * vertex (-2) * vertex (-3) :: AdjacencyMap Int) == "edges1 [(-2,-3),(-1,-3),(-1,-2)]"
  22466. 1593.10 s [algebraic-graphs] OK: show (vertex (-1) * vertex (-2) + vertex (-3) :: AdjacencyMap Int) == "overlay (vertex (-3)) (edge (-1) (-2))"
  22467. 1593.10 s [algebraic-graphs]
  22468. 1593.10 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.toNonEmpty ============
  22469. 1593.10 s [algebraic-graphs] OK: toNonEmpty empty == Nothing
  22470. 1593.10 s [algebraic-graphs] OK: toNonEmpty . fromNonEmpty == Just
  22471. 1593.10 s [algebraic-graphs]
  22472. 1593.10 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.fromNonEmpty ============
  22473. 1593.10 s [algebraic-graphs] OK: isEmpty . fromNonEmpty == const False
  22474. 1593.10 s [algebraic-graphs]
  22475. 1593.10 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertex ============
  22476. 1593.10 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  22477. 1593.10 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  22478. 1593.10 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  22479. 1593.10 s [algebraic-graphs]
  22480. 1593.10 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edge ============
  22481. 1593.10 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  22482. 1593.10 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  22483. 1593.10 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  22484. 1593.10 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  22485. 1593.10 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  22486. 1593.10 s [algebraic-graphs]
  22487. 1593.10 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.overlay ============
  22488. 1593.10 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  22489. 1593.10 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  22490. 1593.10 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  22491. 1593.10 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  22492. 1593.10 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  22493. 1593.10 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  22494. 1593.10 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  22495. 1593.10 s [algebraic-graphs]
  22496. 1593.10 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.connect ============
  22497. 1593.10 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  22498. 1593.10 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  22499. 1593.10 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  22500. 1593.10 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  22501. 1593.10 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  22502. 1593.10 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  22503. 1593.10 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  22504. 1593.10 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  22505. 1593.10 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  22506. 1593.10 s [algebraic-graphs]
  22507. 1593.10 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertices1 ============
  22508. 1593.10 s [algebraic-graphs] OK: vertices1 [x] == vertex x
  22509. 1593.10 s [algebraic-graphs] OK: hasVertex x . vertices1 == elem x
  22510. 1593.10 s [algebraic-graphs] OK: vertexCount . vertices1 == length . nub
  22511. 1593.10 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  22512. 1593.10 s [algebraic-graphs]
  22513. 1593.10 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edges1 ============
  22514. 1593.10 s [algebraic-graphs] OK: edges1 [(x,y)] == edge x y
  22515. 1593.10 s [algebraic-graphs] OK: edges1 == overlays1 . fmap (uncurry edge)
  22516. 1593.10 s [algebraic-graphs] OK: edgeCount . edges1 == length . nub
  22517. 1593.10 s [algebraic-graphs]
  22518. 1596.06 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.overlays1 ============
  22519. 1596.06 s [algebraic-graphs] OK: overlays1 [x] == x
  22520. 1596.06 s [algebraic-graphs] OK: overlays1 [x,y] == overlay x y
  22521. 1596.06 s [algebraic-graphs]
  22522. 1596.06 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.connects1 ============
  22523. 1596.06 s [algebraic-graphs] OK: connects1 [x] == x
  22524. 1596.06 s [algebraic-graphs] OK: connects1 [x,y] == connect x y
  22525. 1596.06 s [algebraic-graphs]
  22526. 1596.06 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.isSubgraphOf ============
  22527. 1596.06 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  22528. 1596.06 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  22529. 1596.06 s [algebraic-graphs] OK: isSubgraphOf (path1 xs) (circuit1 xs) == True
  22530. 1596.06 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  22531. 1596.06 s [algebraic-graphs]
  22532. 1596.06 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.hasVertex ============
  22533. 1596.06 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  22534. 1596.06 s [algebraic-graphs]
  22535. 1596.06 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.hasEdge ============
  22536. 1596.06 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  22537. 1596.06 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  22538. 1596.06 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  22539. 1596.06 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  22540. 1596.06 s [algebraic-graphs]
  22541. 1596.06 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexCount ============
  22542. 1596.06 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  22543. 1596.06 s [algebraic-graphs] OK: vertexCount x >= 1
  22544. 1596.06 s [algebraic-graphs] OK: vertexCount == length . vertexList1
  22545. 1596.06 s [algebraic-graphs]
  22546. 1596.06 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeCount ============
  22547. 1596.06 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  22548. 1596.06 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  22549. 1596.06 s [algebraic-graphs] OK: edgeCount == length . edgeList
  22550. 1596.06 s [algebraic-graphs]
  22551. 1596.06 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexList1 ============
  22552. 1596.06 s [algebraic-graphs] OK: vertexList1 (vertex x) == [x]
  22553. 1596.06 s [algebraic-graphs] OK: vertexList1 . vertices1 == nub . sort
  22554. 1596.06 s [algebraic-graphs]
  22555. 1596.06 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeList ============
  22556. 1596.06 s [algebraic-graphs] OK: edgeList (vertex x) == []
  22557. 1596.06 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  22558. 1596.06 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  22559. 1596.06 s [algebraic-graphs] OK: edgeList . edges1 == nub . sort . toList
  22560. 1596.06 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  22561. 1596.06 s [algebraic-graphs]
  22562. 1596.06 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexSet ============
  22563. 1596.06 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  22564. 1596.06 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  22565. 1596.06 s [algebraic-graphs] OK: vertexSet . clique1 == Set.fromList . toList
  22566. 1596.06 s [algebraic-graphs]
  22567. 1596.06 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeSet ============
  22568. 1596.06 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  22569. 1596.06 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  22570. 1596.06 s [algebraic-graphs] OK: edgeSet . edges1 == Set.fromList . toList
  22571. 1596.06 s [algebraic-graphs]
  22572. 1596.06 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.preSet ============
  22573. 1596.06 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  22574. 1596.06 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  22575. 1596.06 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  22576. 1596.06 s [algebraic-graphs]
  22577. 1596.06 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.postSet ============
  22578. 1596.06 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  22579. 1596.06 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  22580. 1596.06 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  22581. 1596.06 s [algebraic-graphs]
  22582. 1596.06 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.path1 ============
  22583. 1596.06 s [algebraic-graphs] OK: path1 [x] == vertex x
  22584. 1596.06 s [algebraic-graphs] OK: path1 [x,y] == edge x y
  22585. 1596.06 s [algebraic-graphs] OK: path1 . reverse == transpose . path1
  22586. 1596.06 s [algebraic-graphs]
  22587. 1596.06 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.circuit1 ============
  22588. 1596.06 s [algebraic-graphs] OK: circuit1 [x] == edge x x
  22589. 1596.06 s [algebraic-graphs] OK: circuit1 [x,y] == edges1 [(x,y), (y,x)]
  22590. 1596.06 s [algebraic-graphs] OK: circuit1 . reverse == transpose . circuit1
  22591. 1596.06 s [algebraic-graphs]
  22592. 1596.06 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.clique1 ============
  22593. 1596.06 s [algebraic-graphs] OK: clique1 [x] == vertex x
  22594. 1596.06 s [algebraic-graphs] OK: clique1 [x,y] == edge x y
  22595. 1596.06 s [algebraic-graphs] OK: clique1 [x,y,z] == edges1 [(x,y), (x,z), (y,z)]
  22596. 1596.06 s [algebraic-graphs] OK: clique1 (xs <> ys) == connect (clique1 xs) (clique1 ys)
  22597. 1596.06 s [algebraic-graphs] OK: clique1 . reverse == transpose . clique1
  22598. 1596.06 s [algebraic-graphs]
  22599. 1596.06 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.biclique1 ============
  22600. 1596.06 s [algebraic-graphs] OK: biclique1 [x1,x2] [y1,y2] == edges1 [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  22601. 1596.06 s [algebraic-graphs] OK: biclique1 xs ys == connect (vertices1 xs) (vertices1 ys)
  22602. 1596.06 s [algebraic-graphs]
  22603. 1596.06 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.star ============
  22604. 1596.06 s [algebraic-graphs] OK: star x [] == vertex x
  22605. 1596.06 s [algebraic-graphs] OK: star x [y] == edge x y
  22606. 1596.06 s [algebraic-graphs] OK: star x [y,z] == edges1 [(x,y), (x,z)]
  22607. 1596.06 s [algebraic-graphs]
  22608. 1596.06 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.stars1 ============
  22609. 1596.06 s [algebraic-graphs] OK: stars1 [(x, [] )] == vertex x
  22610. 1596.06 s [algebraic-graphs] OK: stars1 [(x, [y])] == edge x y
  22611. 1596.06 s [algebraic-graphs] OK: stars1 [(x, ys )] == star x ys
  22612. 1596.06 s [algebraic-graphs] OK: stars1 == overlays1 . fmap (uncurry star)
  22613. 1596.06 s [algebraic-graphs] OK: overlay (stars1 xs) (stars1 ys) == stars1 (xs <> ys)
  22614. 1596.06 s [algebraic-graphs]
  22615. 1596.06 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.tree ============
  22616. 1596.06 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  22617. 1596.06 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path1 [x,y,z]
  22618. 1596.06 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  22619. 1596.06 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges1 [(1,2), (1,3), (3,4), (3,5)]
  22620. 1596.06 s [algebraic-graphs]
  22621. 1596.06 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.removeVertex1 ============
  22622. 1596.06 s [algebraic-graphs] OK: removeVertex1 x (vertex x) == Nothing
  22623. 1596.06 s [algebraic-graphs] OK: removeVertex1 1 (vertex 2) == Just (vertex 2)
  22624. 1596.06 s [algebraic-graphs] OK: removeVertex1 x (edge x x) == Nothing
  22625. 1596.06 s [algebraic-graphs] OK: removeVertex1 1 (edge 1 2) == Just (vertex 2)
  22626. 1596.06 s [algebraic-graphs] OK: removeVertex1 x >=> removeVertex1 x == removeVertex1 x
  22627. 1596.06 s [algebraic-graphs]
  22628. 1596.06 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.removeEdge ============
  22629. 1596.06 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices1 [x,y]
  22630. 1596.06 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  22631. 1596.06 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  22632. 1596.06 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  22633. 1596.06 s [algebraic-graphs]
  22634. 1596.06 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.replaceVertex ============
  22635. 1596.06 s [algebraic-graphs] OK: replaceVertex x x == id
  22636. 1596.06 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  22637. 1596.06 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  22638. 1596.06 s [algebraic-graphs]
  22639. 1596.06 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.mergeVertices ============
  22640. 1596.06 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  22641. 1596.06 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  22642. 1596.06 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  22643. 1596.06 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  22644. 1596.06 s [algebraic-graphs]
  22645. 1596.06 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.transpose ============
  22646. 1596.06 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  22647. 1596.06 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  22648. 1596.06 s [algebraic-graphs] OK: transpose . transpose == id
  22649. 1596.06 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  22650. 1596.06 s [algebraic-graphs]
  22651. 1596.06 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.gmap ============
  22652. 1596.06 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  22653. 1596.06 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  22654. 1596.06 s [algebraic-graphs] OK: gmap id == id
  22655. 1596.06 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  22656. 1596.06 s [algebraic-graphs]
  22657. 1596.06 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.induce1 ============
  22658. 1596.06 s [algebraic-graphs] OK: induce1 (const True ) x == Just x
  22659. 1596.06 s [algebraic-graphs] OK: induce1 (const False) x == Nothing
  22660. 1596.06 s [algebraic-graphs] OK: induce1 (/= x) == removeVertex1 x
  22661. 1596.06 s [algebraic-graphs] OK: induce1 p >=> induce1 q == induce1 (\x -> p x && q x)
  22662. 1596.06 s [algebraic-graphs]
  22663. 1596.06 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.induceJust1 ============
  22664. 1596.06 s [algebraic-graphs] OK: induceJust1 (vertex Nothing) == Nothing
  22665. 1596.06 s [algebraic-graphs] OK: induceJust1 (edge (Just x) Nothing) == Just (vertex x)
  22666. 1596.06 s [algebraic-graphs] OK: induceJust1 . gmap Just == Just
  22667. 1596.06 s [algebraic-graphs] OK: induceJust1 . gmap (\x -> if p x then Just x else Nothing) == induce1 p
  22668. 1596.06 s [algebraic-graphs]
  22669. 1596.06 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.closure ============
  22670. 1596.06 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  22671. 1596.06 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  22672. 1596.06 s [algebraic-graphs] OK: closure (edge x y) == edges1 [(x,x), (x,y), (y,y)]
  22673. 1596.06 s [algebraic-graphs] OK: closure (path1 $ nub xs) == reflexiveClosure (clique1 $ nub xs)
  22674. 1596.06 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  22675. 1596.06 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  22676. 1596.06 s [algebraic-graphs] OK: closure . closure == closure
  22677. 1596.06 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  22678. 1596.06 s [algebraic-graphs]
  22679. 1596.06 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.reflexiveClosure ============
  22680. 1596.06 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  22681. 1596.06 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  22682. 1596.06 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges1 [(x,x), (x,y), (y,y)]
  22683. 1596.06 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  22684. 1596.06 s [algebraic-graphs]
  22685. 1596.06 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.symmetricClosure ============
  22686. 1596.06 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  22687. 1596.06 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges1 [(x,y), (y,x)]
  22688. 1596.06 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  22689. 1596.06 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  22690. 1596.06 s [algebraic-graphs]
  22691. 1596.06 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.transitiveClosure ============
  22692. 1596.06 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  22693. 1596.06 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  22694. 1596.06 s [algebraic-graphs] OK: transitiveClosure (path1 $ nub xs) == clique1 (nub $ xs)
  22695. 1596.06 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  22696. 1596.06 s [algebraic-graphs]
  22697. 1596.06 s [algebraic-graphs] ============ NonEmpty.Graph.============
  22698. 1596.06 s [algebraic-graphs] OK: Axioms of non-empty graphs
  22699. 1596.06 s [algebraic-graphs] OK: Theorems of non-empty graphs
  22700. 1596.06 s [algebraic-graphs]
  22701. 1596.06 s [algebraic-graphs] ============ Ord (NonEmpty.Graph a) ============
  22702. 1596.06 s [algebraic-graphs] OK: vertex 1 < vertex 2
  22703. 1596.06 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  22704. 1596.06 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  22705. 1596.06 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  22706. 1596.06 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  22707. 1596.06 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  22708. 1596.06 s [algebraic-graphs] OK: x <= x + y
  22709. 1596.06 s [algebraic-graphs] OK: x + y <= x * y
  22710. 1596.06 s [algebraic-graphs]
  22711. 1596.06 s [algebraic-graphs] ============ Functor (NonEmpty.Graph a) ============
  22712. 1596.06 s [algebraic-graphs] OK: fmap f (vertex x) == vertex (f x)
  22713. 1596.06 s [algebraic-graphs] OK: fmap f (edge x y) == edge (f x) (f y)
  22714. 1596.06 s [algebraic-graphs] OK: fmap id == id
  22715. 1596.06 s [algebraic-graphs] OK: fmap f . fmap g == fmap (f . g)
  22716. 1596.06 s [algebraic-graphs]
  22717. 1596.06 s [algebraic-graphs] ============ Monad (NonEmpty.Graph a) ============
  22718. 1596.06 s [algebraic-graphs] OK: (vertex x >>= f) == f x
  22719. 1597.39 s [algebraic-graphs] OK: (edge x y >>= f) == connect (f x) (f y)
  22720. 1597.39 s [algebraic-graphs] OK: (vertices1 xs >>= f) == overlays1 (fmap f xs)
  22721. 1597.39 s [algebraic-graphs] OK: (x >>= vertex) == x
  22722. 1597.39 s [algebraic-graphs] OK: ((x >>= f) >>= g) == (x >>= (\y -> (f y) >>= g))
  22723. 1597.39 s [algebraic-graphs]
  22724. 1597.39 s [algebraic-graphs] ============ NonEmpty.Graph.toNonEmpty ============
  22725. 1597.39 s [algebraic-graphs] OK: toNonEmpty empty == Nothing
  22726. 1597.39 s [algebraic-graphs] OK: toNonEmpty (toGraph x) == Just (x :: NonEmpty.Graph a)
  22727. 1597.39 s [algebraic-graphs]
  22728. 1597.39 s [algebraic-graphs] ============ NonEmpty.Graph.vertex ============
  22729. 1597.39 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  22730. 1597.39 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  22731. 1597.39 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  22732. 1597.39 s [algebraic-graphs] OK: size (vertex x) == 1
  22733. 1597.39 s [algebraic-graphs]
  22734. 1597.39 s [algebraic-graphs] ============ NonEmpty.Graph.edge ============
  22735. 1597.39 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  22736. 1597.39 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  22737. 1597.39 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  22738. 1597.39 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  22739. 1597.39 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  22740. 1597.39 s [algebraic-graphs]
  22741. 1597.39 s [algebraic-graphs] ============ NonEmpty.Graph.overlay ============
  22742. 1597.39 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  22743. 1597.39 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  22744. 1597.39 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  22745. 1597.39 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  22746. 1597.39 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  22747. 1597.39 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  22748. 1597.39 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  22749. 1597.39 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  22750. 1597.39 s [algebraic-graphs]
  22751. 1597.39 s [algebraic-graphs] ============ NonEmpty.Graph.overlay1 ============
  22752. 1597.39 s [algebraic-graphs] OK: overlay1 empty x == x
  22753. 1597.39 s [algebraic-graphs] OK: x /= empty ==> overlay1 x y == overlay (fromJust $ toNonEmpty x) y
  22754. 1597.39 s [algebraic-graphs]
  22755. 1597.39 s [algebraic-graphs] ============ NonEmpty.Graph.connect ============
  22756. 1597.39 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  22757. 1597.39 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  22758. 1597.39 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  22759. 1597.39 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  22760. 1597.39 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  22761. 1597.39 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  22762. 1597.39 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  22763. 1597.39 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  22764. 1597.39 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  22765. 1597.39 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  22766. 1597.39 s [algebraic-graphs]
  22767. 1597.39 s [algebraic-graphs] ============ NonEmpty.Graph.vertices1 ============
  22768. 1597.39 s [algebraic-graphs] OK: vertices1 [x] == vertex x
  22769. 1597.39 s [algebraic-graphs] OK: hasVertex x . vertices1 == elem x
  22770. 1597.39 s [algebraic-graphs] OK: vertexCount . vertices1 == length . nub
  22771. 1597.39 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  22772. 1597.39 s [algebraic-graphs]
  22773. 1597.39 s [algebraic-graphs] ============ NonEmpty.Graph.edges1 ============
  22774. 1597.39 s [algebraic-graphs] OK: edges1 [(x,y)] == edge x y
  22775. 1597.39 s [algebraic-graphs] OK: edges1 == overlays1 . fmap (uncurry edge)
  22776. 1597.39 s [algebraic-graphs] OK: edgeCount . edges1 == length . nub
  22777. 1597.39 s [algebraic-graphs]
  22778. 1597.39 s [algebraic-graphs] ============ NonEmpty.Graph.overlays1 ============
  22779. 1597.39 s [algebraic-graphs] OK: overlays1 [x] == x
  22780. 1597.39 s [algebraic-graphs] OK: overlays1 [x,y] == overlay x y
  22781. 1597.39 s [algebraic-graphs]
  22782. 1597.39 s [algebraic-graphs] ============ NonEmpty.Graph.connects1 ============
  22783. 1597.39 s [algebraic-graphs] OK: connects1 [x] == x
  22784. 1597.39 s [algebraic-graphs] OK: connects1 [x,y] == connect x y
  22785. 1597.39 s [algebraic-graphs]
  22786. 1597.39 s [algebraic-graphs] ============ NonEmpty.Graph.foldg1 ============
  22787. 1597.39 s [algebraic-graphs] OK: foldg1 vertex overlay connect == id
  22788. 1597.39 s [algebraic-graphs] OK: foldg1 vertex overlay (flip connect) == transpose
  22789. 1597.39 s [algebraic-graphs] OK: foldg1 (const 1) (+) (+) == size
  22790. 1597.39 s [algebraic-graphs] OK: foldg1 (== x) (||) (||) == hasVertex x
  22791. 1597.39 s [algebraic-graphs]
  22792. 1597.39 s [algebraic-graphs] ============ NonEmpty.Graph.isSubgraphOf ============
  22793. 1597.39 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  22794. 1597.39 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  22795. 1597.39 s [algebraic-graphs] OK: isSubgraphOf (path1 xs) (circuit1 xs) == True
  22796. 1597.39 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  22797. 1597.39 s [algebraic-graphs]
  22798. 1597.39 s [algebraic-graphs] ============ NonEmpty.Graph.(===) ============
  22799. 1597.39 s [algebraic-graphs] OK: x === x == True
  22800. 1597.39 s [algebraic-graphs] OK: x + y === x + y == True
  22801. 1597.39 s [algebraic-graphs] OK: 1 + 2 === 2 + 1 == False
  22802. 1597.39 s [algebraic-graphs] OK: x + y === x * y == False
  22803. 1597.39 s [algebraic-graphs]
  22804. 1597.39 s [algebraic-graphs] ============ NonEmpty.Graph.size ============
  22805. 1597.39 s [algebraic-graphs] OK: size (vertex x) == 1
  22806. 1597.39 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  22807. 1597.39 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  22808. 1597.39 s [algebraic-graphs] OK: size x >= 1
  22809. 1597.39 s [algebraic-graphs] OK: size x >= vertexCount x
  22810. 1597.39 s [algebraic-graphs]
  22811. 1597.39 s [algebraic-graphs] ============ NonEmpty.Graph.hasVertex ============
  22812. 1597.39 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  22813. 1597.39 s [algebraic-graphs]
  22814. 1597.39 s [algebraic-graphs] ============ NonEmpty.Graph.hasEdge ============
  22815. 1597.39 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  22816. 1597.39 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  22817. 1597.39 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  22818. 1597.39 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  22819. 1597.39 s [algebraic-graphs]
  22820. 1597.39 s [algebraic-graphs] ============ NonEmpty.Graph.vertexCount ============
  22821. 1597.39 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  22822. 1597.39 s [algebraic-graphs] OK: vertexCount x >= 1
  22823. 1597.39 s [algebraic-graphs] OK: vertexCount == length . vertexList1
  22824. 1597.39 s [algebraic-graphs]
  22825. 1597.39 s [algebraic-graphs] ============ NonEmpty.Graph.edgeCount ============
  22826. 1597.39 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  22827. 1597.39 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  22828. 1597.39 s [algebraic-graphs] OK: edgeCount == length . edgeList
  22829. 1597.39 s [algebraic-graphs]
  22830. 1597.39 s [algebraic-graphs] ============ NonEmpty.Graph.vertexList1 ============
  22831. 1597.39 s [algebraic-graphs] OK: vertexList1 (vertex x) == [x]
  22832. 1597.39 s [algebraic-graphs] OK: vertexList1 . vertices1 == nub . sort
  22833. 1597.39 s [algebraic-graphs]
  22834. 1597.39 s [algebraic-graphs] ============ NonEmpty.Graph.edgeList ============
  22835. 1597.39 s [algebraic-graphs] OK: edgeList (vertex x) == []
  22836. 1597.39 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  22837. 1597.39 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  22838. 1597.39 s [algebraic-graphs] OK: edgeList . edges1 == nub . sort . toList
  22839. 1597.39 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  22840. 1597.39 s [algebraic-graphs]
  22841. 1597.39 s [algebraic-graphs] ============ NonEmpty.Graph.vertexSet ============
  22842. 1597.39 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  22843. 1597.39 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  22844. 1597.39 s [algebraic-graphs] OK: vertexSet . clique1 == Set.fromList . toList
  22845. 1597.39 s [algebraic-graphs]
  22846. 1597.39 s [algebraic-graphs] ============ NonEmpty.Graph.edgeSet ============
  22847. 1597.39 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  22848. 1597.39 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  22849. 1597.39 s [algebraic-graphs] OK: edgeSet . edges1 == Set.fromList . toList
  22850. 1597.39 s [algebraic-graphs]
  22851. 1597.39 s [algebraic-graphs] ============ NonEmpty.Graph.path1 ============
  22852. 1597.39 s [algebraic-graphs] OK: path1 [x] == vertex x
  22853. 1597.39 s [algebraic-graphs] OK: path1 [x,y] == edge x y
  22854. 1597.39 s [algebraic-graphs] OK: path1 . reverse == transpose . path1
  22855. 1597.39 s [algebraic-graphs]
  22856. 1597.39 s [algebraic-graphs] ============ NonEmpty.Graph.circuit1 ============
  22857. 1597.39 s [algebraic-graphs] OK: circuit1 [x] == edge x x
  22858. 1597.39 s [algebraic-graphs] OK: circuit1 [x,y] == edges1 [(x,y), (y,x)]
  22859. 1597.39 s [algebraic-graphs] OK: circuit1 . reverse == transpose . circuit1
  22860. 1597.39 s [algebraic-graphs]
  22861. 1597.39 s [algebraic-graphs] ============ NonEmpty.Graph.clique1 ============
  22862. 1597.39 s [algebraic-graphs] OK: clique1 [x] == vertex x
  22863. 1597.39 s [algebraic-graphs] OK: clique1 [x,y] == edge x y
  22864. 1597.39 s [algebraic-graphs] OK: clique1 [x,y,z] == edges1 [(x,y), (x,z), (y,z)]
  22865. 1597.39 s [algebraic-graphs] OK: clique1 (xs <> ys) == connect (clique1 xs) (clique1 ys)
  22866. 1597.39 s [algebraic-graphs] OK: clique1 . reverse == transpose . clique1
  22867. 1597.39 s [algebraic-graphs]
  22868. 1597.39 s [algebraic-graphs] ============ NonEmpty.Graph.biclique1 ============
  22869. 1597.39 s [algebraic-graphs] OK: biclique1 [x1,x2] [y1,y2] == edges1 [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  22870. 1597.39 s [algebraic-graphs] OK: biclique1 xs ys == connect (vertices1 xs) (vertices1 ys)
  22871. 1597.39 s [algebraic-graphs]
  22872. 1597.39 s [algebraic-graphs] ============ NonEmpty.Graph.star ============
  22873. 1597.39 s [algebraic-graphs] OK: star x [] == vertex x
  22874. 1597.39 s [algebraic-graphs] OK: star x [y] == edge x y
  22875. 1597.39 s [algebraic-graphs] OK: star x [y,z] == edges1 [(x,y), (x,z)]
  22876. 1597.39 s [algebraic-graphs]
  22877. 1597.39 s [algebraic-graphs] ============ NonEmpty.Graph.stars1 ============
  22878. 1597.39 s [algebraic-graphs] OK: stars1 [(x, [] )] == vertex x
  22879. 1597.39 s [algebraic-graphs] OK: stars1 [(x, [y])] == edge x y
  22880. 1597.39 s [algebraic-graphs] OK: stars1 [(x, ys )] == star x ys
  22881. 1597.39 s [algebraic-graphs] OK: stars1 == overlays1 . fmap (uncurry star)
  22882. 1597.39 s [algebraic-graphs] OK: overlay (stars1 xs) (stars1 ys) == stars1 (xs <> ys)
  22883. 1597.39 s [algebraic-graphs]
  22884. 1597.39 s [algebraic-graphs] ============ NonEmpty.Graph.tree ============
  22885. 1597.39 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  22886. 1597.39 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path1 [x,y,z]
  22887. 1597.39 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  22888. 1597.39 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges1 [(1,2), (1,3), (3,4), (3,5)]
  22889. 1597.39 s [algebraic-graphs]
  22890. 1597.39 s [algebraic-graphs] ============ NonEmpty.Graph.mesh1 ============
  22891. 1597.39 s [algebraic-graphs] OK: mesh1 [x] [y] == vertex (x, y)
  22892. 1597.39 s [algebraic-graphs] OK: mesh1 xs ys == box (path1 xs) (path1 ys)
  22893. 1597.39 s [algebraic-graphs] OK: mesh1 [1,2,3] ['a', 'b'] == <correct result>
  22894. 1597.39 s [algebraic-graphs] OK: size (mesh xs ys) == max 1 (3 * length xs * length ys - length xs - length ys -1)
  22895. 1597.39 s [algebraic-graphs]
  22896. 1597.39 s [algebraic-graphs] ============ NonEmpty.Graph.torus1 ============
  22897. 1597.39 s [algebraic-graphs] OK: torus1 [x] [y] == edge (x,y) (x,y)
  22898. 1597.39 s [algebraic-graphs] OK: torus1 xs ys == box (circuit1 xs) (circuit1 ys)
  22899. 1597.39 s [algebraic-graphs] OK: torus1 [1,2] ['a', 'b'] == <correct result>
  22900. 1597.39 s [algebraic-graphs] OK: size (torus1 xs ys) == max 1 (3 * length xs * length ys)
  22901. 1597.39 s [algebraic-graphs]
  22902. 1597.39 s [algebraic-graphs] ============ NonEmpty.Graph.removeVertex1 ============
  22903. 1597.39 s [algebraic-graphs] OK: removeVertex1 x (vertex x) == Nothing
  22904. 1597.39 s [algebraic-graphs] OK: removeVertex1 1 (vertex 2) == Just (vertex 2)
  22905. 1597.39 s [algebraic-graphs] OK: removeVertex1 x (edge x x) == Nothing
  22906. 1597.39 s [algebraic-graphs] OK: removeVertex1 1 (edge 1 2) == Just (vertex 2)
  22907. 1597.39 s [algebraic-graphs] OK: removeVertex1 x >=> removeVertex1 x == removeVertex1 x
  22908. 1597.39 s [algebraic-graphs]
  22909. 1597.39 s [algebraic-graphs] ============ NonEmpty.Graph.removeEdge ============
  22910. 1597.39 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices1 [x,y]
  22911. 1597.39 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  22912. 1597.39 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  22913. 1597.39 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  22914. 1597.39 s [algebraic-graphs] OK: size (removeEdge x y z) <= 3 * size z
  22915. 1597.39 s [algebraic-graphs]
  22916. 1597.39 s [algebraic-graphs] ============ NonEmpty.Graph.replaceVertex ============
  22917. 1597.39 s [algebraic-graphs] OK: replaceVertex x x == id
  22918. 1597.39 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  22919. 1597.39 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  22920. 1597.39 s [algebraic-graphs]
  22921. 1597.39 s [algebraic-graphs] ============ NonEmpty.Graph.mergeVertices ============
  22922. 1597.39 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  22923. 1603.91 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  22924. 1603.91 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  22925. 1603.95 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  22926. 1603.95 s [algebraic-graphs]
  22927. 1603.95 s [algebraic-graphs] ============ NonEmpty.Graph.splitVertex1 ============
  22928. 1603.95 s [algebraic-graphs] OK: splitVertex1 x [x] == id
  22929. 1603.95 s [algebraic-graphs] OK: splitVertex1 x [y] == replaceVertex x y
  22930. 1603.95 s [algebraic-graphs] OK: splitVertex1 1 [0,1] $ 1 * (2 + 3) == (0 + 1) * (2 + 3)
  22931. 1603.95 s [algebraic-graphs]
  22932. 1603.95 s [algebraic-graphs] ============ NonEmpty.Graph.transpose ============
  22933. 1603.95 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  22934. 1603.95 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  22935. 1603.95 s [algebraic-graphs] OK: transpose . transpose == id
  22936. 1603.95 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  22937. 1603.95 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  22938. 1603.95 s [algebraic-graphs]
  22939. 1603.95 s [algebraic-graphs] ============ NonEmpty.Graph.induce1 ============
  22940. 1603.95 s [algebraic-graphs] OK: induce1 (const True ) x == Just x
  22941. 1603.95 s [algebraic-graphs] OK: induce1 (const False) x == Nothing
  22942. 1603.95 s [algebraic-graphs] OK: induce1 (/= x) == removeVertex1 x
  22943. 1603.95 s [algebraic-graphs] OK: induce1 p >=> induce1 q == induce1 (\x -> p x && q x)
  22944. 1603.95 s [algebraic-graphs]
  22945. 1603.95 s [algebraic-graphs] ============ NonEmpty.Graph.induceJust1 ============
  22946. 1603.95 s [algebraic-graphs] OK: induceJust1 (vertex Nothing) == Nothing
  22947. 1603.95 s [algebraic-graphs] OK: induceJust1 (edge (Just x) Nothing) == Just (vertex x)
  22948. 1603.95 s [algebraic-graphs] OK: induceJust1 . fmap Just == Just
  22949. 1603.95 s [algebraic-graphs] OK: induceJust1 . fmap (\x -> if p x then Just x else Nothing) == induce1 p
  22950. 1603.95 s [algebraic-graphs]
  22951. 1603.95 s [algebraic-graphs] ============ NonEmpty.Graph.simplify ============
  22952. 1603.95 s [algebraic-graphs] OK: simplify == id
  22953. 1603.95 s [algebraic-graphs] OK: size (simplify x) <= size x
  22954. 1603.95 s [algebraic-graphs] OK: simplify 1 === 1
  22955. 1603.95 s [algebraic-graphs] OK: simplify (1 + 1) === 1
  22956. 1603.95 s [algebraic-graphs] OK: simplify (1 + 2 + 1) === 1 + 2
  22957. 1603.95 s [algebraic-graphs] OK: simplify (1 * 1 * 1) === 1 * 1
  22958. 1603.95 s [algebraic-graphs]
  22959. 1603.95 s [algebraic-graphs] ============ NonEmpty.Graph.sparsify ============
  22960. 1603.95 s [algebraic-graphs] OK: sort . reachable x == sort . rights . reachable (sparsify x) . Right
  22961. 1603.95 s [algebraic-graphs] OK: vertexCount (sparsify x) <= vertexCount x + size x + 1
  22962. 1603.95 s [algebraic-graphs] OK: edgeCount (sparsify x) <= 3 * size x
  22963. 1603.95 s [algebraic-graphs] OK: size (sparsify x) <= 3 * size x
  22964. 1603.95 s [algebraic-graphs]
  22965. 1603.95 s [algebraic-graphs] ============ NonEmpty.Graph.sparsifyKL ============
  22966. 1603.95 s [algebraic-graphs] OK: sort . reachable x == sort . filter (<= n) . reachable (sparsifyKL n x)
  22967. 1603.95 s [algebraic-graphs] OK: length (vertices $ sparsifyKL n x) <= vertexCount x + size x + 1
  22968. 1603.95 s [algebraic-graphs] OK: length (edges $ sparsifyKL n x) <= 3 * size x
  22969. 1603.95 s [algebraic-graphs]
  22970. 1603.95 s [algebraic-graphs] ============ NonEmpty.Graph.box ============
  22971. 1603.95 s [algebraic-graphs] OK: box (path1 [0,1]) (path1 ['a','b']) == <correct result>
  22972. 1603.95 s [algebraic-graphs] OK: box x y ~~ box y x
  22973. 1603.95 s [algebraic-graphs] OK: box x (overlay y z) == overlay (box x y) (box x z)
  22974. 1603.95 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  22975. 1603.95 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  22976. 1603.95 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  22977. 1603.95 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  22978. 1603.95 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  22979. 1603.95 s [algebraic-graphs]
  22980. 1603.95 s [algebraic-graphs] ============ Relation ============
  22981. 1603.95 s [algebraic-graphs] OK: Axioms of graphs
  22982. 1603.95 s [algebraic-graphs]
  22983. 1603.95 s [algebraic-graphs] ============ Relation.consistent ============
  22984. 1603.95 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  22985. 1603.95 s [algebraic-graphs]
  22986. 1603.95 s [algebraic-graphs] OK: consistent empty == True
  22987. 1603.95 s [algebraic-graphs] OK: consistent (vertex x) == True
  22988. 1603.95 s [algebraic-graphs] OK: consistent (overlay x y) == True
  22989. 1603.95 s [algebraic-graphs] OK: consistent (connect x y) == True
  22990. 1603.95 s [algebraic-graphs] OK: consistent (edge x y) == True
  22991. 1603.95 s [algebraic-graphs] OK: consistent (edges xs) == True
  22992. 1603.95 s [algebraic-graphs] OK: consistent (stars xs) == True
  22993. 1603.95 s [algebraic-graphs]
  22994. 1603.95 s [algebraic-graphs] ============ Relation.Show ============
  22995. 1603.95 s [algebraic-graphs] OK: show (empty ) == "empty"
  22996. 1603.95 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  22997. 1603.95 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  22998. 1603.95 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  22999. 1603.95 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  23000. 1603.95 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  23001. 1603.95 s [algebraic-graphs]
  23002. 1603.95 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  23003. 1603.95 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  23004. 1603.95 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  23005. 1603.95 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  23006. 1603.95 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  23007. 1603.95 s [algebraic-graphs]
  23008. 1603.95 s [algebraic-graphs] ============ Relation.Ord ============
  23009. 1603.95 s [algebraic-graphs] OK: vertex 1 < vertex 2
  23010. 1603.95 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  23011. 1603.95 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  23012. 1603.95 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  23013. 1603.95 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  23014. 1603.95 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  23015. 1603.95 s [algebraic-graphs] OK: x <= x + y
  23016. 1603.95 s [algebraic-graphs] OK: x + y <= x * y
  23017. 1603.95 s [algebraic-graphs]
  23018. 1603.95 s [algebraic-graphs] ============ Relation.empty ============
  23019. 1603.95 s [algebraic-graphs] OK: isEmpty empty == True
  23020. 1603.95 s [algebraic-graphs] OK: hasVertex x empty == False
  23021. 1603.95 s [algebraic-graphs] OK: vertexCount empty == 0
  23022. 1603.95 s [algebraic-graphs] OK: edgeCount empty == 0
  23023. 1603.95 s [algebraic-graphs]
  23024. 1603.95 s [algebraic-graphs] ============ Relation.vertex ============
  23025. 1603.95 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  23026. 1603.95 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  23027. 1603.95 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  23028. 1603.95 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  23029. 1603.95 s [algebraic-graphs]
  23030. 1603.95 s [algebraic-graphs] ============ Relation.edge ============
  23031. 1603.95 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  23032. 1603.95 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  23033. 1603.95 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  23034. 1603.95 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  23035. 1603.95 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  23036. 1603.95 s [algebraic-graphs]
  23037. 1603.95 s [algebraic-graphs] ============ Relation.overlay ============
  23038. 1603.95 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  23039. 1603.95 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  23040. 1603.95 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  23041. 1603.95 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  23042. 1603.95 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  23043. 1603.95 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  23044. 1603.95 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  23045. 1603.95 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  23046. 1603.95 s [algebraic-graphs]
  23047. 1603.95 s [algebraic-graphs] ============ Relation.connect ============
  23048. 1603.95 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  23049. 1603.95 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  23050. 1603.95 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  23051. 1603.95 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  23052. 1603.95 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  23053. 1603.95 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  23054. 1603.95 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  23055. 1603.95 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  23056. 1603.95 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  23057. 1603.95 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  23058. 1603.95 s [algebraic-graphs]
  23059. 1603.95 s [algebraic-graphs] ============ Relation.vertices ============
  23060. 1603.95 s [algebraic-graphs] OK: vertices [] == empty
  23061. 1603.95 s [algebraic-graphs] OK: vertices [x] == vertex x
  23062. 1603.95 s [algebraic-graphs] OK: vertices == overlays . map vertex
  23063. 1603.95 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  23064. 1603.95 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  23065. 1603.95 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  23066. 1603.95 s [algebraic-graphs]
  23067. 1603.95 s [algebraic-graphs] ============ Relation.edges ============
  23068. 1603.95 s [algebraic-graphs] OK: edges [] == empty
  23069. 1603.95 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  23070. 1603.95 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  23071. 1603.95 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  23072. 1603.95 s [algebraic-graphs]
  23073. 1603.95 s [algebraic-graphs] ============ Relation.overlays ============
  23074. 1603.95 s [algebraic-graphs] OK: overlays [] == empty
  23075. 1603.95 s [algebraic-graphs] OK: overlays [x] == x
  23076. 1603.95 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  23077. 1603.95 s [algebraic-graphs] OK: overlays == foldr overlay empty
  23078. 1603.95 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  23079. 1603.95 s [algebraic-graphs]
  23080. 1603.95 s [algebraic-graphs] ============ Relation.connects ============
  23081. 1603.95 s [algebraic-graphs] OK: connects [] == empty
  23082. 1603.95 s [algebraic-graphs] OK: connects [x] == x
  23083. 1603.95 s [algebraic-graphs] OK: connects [x,y] == connect x y
  23084. 1603.95 s [algebraic-graphs] OK: connects == foldr connect empty
  23085. 1603.95 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  23086. 1603.95 s [algebraic-graphs]
  23087. 1603.95 s [algebraic-graphs] ============ Relation.isSubgraphOf ============
  23088. 1603.95 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  23089. 1603.95 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  23090. 1603.95 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  23091. 1603.95 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  23092. 1603.95 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  23093. 1603.95 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  23094. 1603.95 s [algebraic-graphs]
  23095. 1603.95 s [algebraic-graphs] ============ Relation.toGraph et al. ============
  23096. 1603.95 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  23097. 1603.95 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  23098. 1603.95 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  23099. 1603.95 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  23100. 1603.95 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  23101. 1603.95 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  23102. 1603.95 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  23103. 1603.95 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  23104. 1603.95 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  23105. 1603.95 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  23106. 1603.95 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  23107. 1603.95 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  23108. 1603.95 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  23109. 1603.95 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  23110. 1603.95 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  23111. 1603.95 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  23112. 1603.95 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  23113. 1607.55 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  23114. 1607.55 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  23115. 1607.55 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  23116. 1607.55 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  23117. 1607.55 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  23118. 1607.55 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  23119. 1607.55 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  23120. 1607.55 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  23121. 1607.55 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  23122. 1607.55 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  23123. 1607.55 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  23124. 1607.55 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  23125. 1607.55 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  23126. 1607.55 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  23127. 1607.55 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  23128. 1607.55 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  23129. 1607.55 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  23130. 1607.55 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  23131. 1607.55 s [algebraic-graphs]
  23132. 1607.55 s [algebraic-graphs] ============ Relation.foldg ============
  23133. 1607.55 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  23134. 1607.55 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  23135. 1607.55 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  23136. 1607.55 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  23137. 1607.55 s [algebraic-graphs]
  23138. 1607.55 s [algebraic-graphs] ============ Relation.isEmpty ============
  23139. 1607.55 s [algebraic-graphs] OK: isEmpty empty == True
  23140. 1607.55 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  23141. 1607.55 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  23142. 1607.55 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  23143. 1607.55 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  23144. 1607.55 s [algebraic-graphs]
  23145. 1607.55 s [algebraic-graphs] ============ Relation.hasVertex ============
  23146. 1607.55 s [algebraic-graphs] OK: hasVertex x empty == False
  23147. 1607.55 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  23148. 1607.55 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  23149. 1607.55 s [algebraic-graphs]
  23150. 1607.55 s [algebraic-graphs] ============ Relation.hasEdge ============
  23151. 1607.55 s [algebraic-graphs] OK: hasEdge x y empty == False
  23152. 1607.55 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  23153. 1607.55 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  23154. 1607.55 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  23155. 1607.55 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  23156. 1607.55 s [algebraic-graphs]
  23157. 1607.55 s [algebraic-graphs] ============ Relation.vertexCount ============
  23158. 1607.55 s [algebraic-graphs] OK: vertexCount empty == 0
  23159. 1607.55 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  23160. 1607.55 s [algebraic-graphs] OK: vertexCount == length . vertexList
  23161. 1607.55 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  23162. 1607.55 s [algebraic-graphs]
  23163. 1607.55 s [algebraic-graphs] ============ Relation.edgeCount ============
  23164. 1607.55 s [algebraic-graphs] OK: edgeCount empty == 0
  23165. 1607.55 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  23166. 1607.55 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  23167. 1607.55 s [algebraic-graphs] OK: edgeCount == length . edgeList
  23168. 1607.55 s [algebraic-graphs]
  23169. 1607.55 s [algebraic-graphs] ============ Relation.vertexList ============
  23170. 1607.55 s [algebraic-graphs] OK: vertexList empty == []
  23171. 1607.55 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  23172. 1607.55 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  23173. 1607.55 s [algebraic-graphs]
  23174. 1607.55 s [algebraic-graphs] ============ Relation.vertexSet ============
  23175. 1607.55 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  23176. 1607.55 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  23177. 1607.55 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  23178. 1607.55 s [algebraic-graphs]
  23179. 1607.55 s [algebraic-graphs] ============ Relation.vertexIntSet ============
  23180. 1607.55 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  23181. 1607.55 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  23182. 1607.55 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  23183. 1607.55 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  23184. 1607.55 s [algebraic-graphs]
  23185. 1607.55 s [algebraic-graphs] ============ Relation.edgeList ============
  23186. 1607.55 s [algebraic-graphs] OK: edgeList empty == []
  23187. 1607.55 s [algebraic-graphs] OK: edgeList (vertex x) == []
  23188. 1607.55 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  23189. 1607.55 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  23190. 1607.55 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  23191. 1607.55 s [algebraic-graphs]
  23192. 1607.55 s [algebraic-graphs] ============ Relation.edgeSet ============
  23193. 1607.55 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  23194. 1607.55 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  23195. 1607.55 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  23196. 1607.55 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  23197. 1607.55 s [algebraic-graphs]
  23198. 1607.55 s [algebraic-graphs] ============ Relation.adjacencyList ============
  23199. 1607.55 s [algebraic-graphs] OK: adjacencyList empty == []
  23200. 1607.55 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  23201. 1607.55 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  23202. 1607.55 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  23203. 1607.55 s [algebraic-graphs]
  23204. 1607.55 s [algebraic-graphs] ============ Relation.preSet ============
  23205. 1607.55 s [algebraic-graphs] OK: preSet x empty == Set.empty
  23206. 1607.55 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  23207. 1607.55 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  23208. 1607.55 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  23209. 1607.55 s [algebraic-graphs]
  23210. 1607.55 s [algebraic-graphs] ============ Relation.preIntSet ============
  23211. 1607.55 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  23212. 1607.55 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  23213. 1607.55 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  23214. 1607.55 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  23215. 1607.55 s [algebraic-graphs]
  23216. 1607.55 s [algebraic-graphs] ============ Relation.postSet ============
  23217. 1607.55 s [algebraic-graphs] OK: postSet x empty == Set.empty
  23218. 1607.55 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  23219. 1607.55 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  23220. 1607.55 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  23221. 1607.55 s [algebraic-graphs]
  23222. 1607.55 s [algebraic-graphs] ============ Relation.postIntSet ============
  23223. 1607.55 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  23224. 1607.55 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  23225. 1607.55 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  23226. 1607.55 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  23227. 1607.55 s [algebraic-graphs]
  23228. 1607.55 s [algebraic-graphs] ============ Relation.path ============
  23229. 1607.55 s [algebraic-graphs] OK: path [] == empty
  23230. 1607.55 s [algebraic-graphs] OK: path [x] == vertex x
  23231. 1607.55 s [algebraic-graphs] OK: path [x,y] == edge x y
  23232. 1607.55 s [algebraic-graphs]
  23233. 1607.55 s [algebraic-graphs] ============ Relation.circuit ============
  23234. 1607.55 s [algebraic-graphs] OK: circuit [] == empty
  23235. 1607.55 s [algebraic-graphs] OK: circuit [x] == edge x x
  23236. 1607.55 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  23237. 1607.55 s [algebraic-graphs]
  23238. 1607.55 s [algebraic-graphs] ============ Relation.clique ============
  23239. 1607.55 s [algebraic-graphs] OK: clique [] == empty
  23240. 1607.55 s [algebraic-graphs] OK: clique [x] == vertex x
  23241. 1607.55 s [algebraic-graphs] OK: clique [x,y] == edge x y
  23242. 1607.55 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  23243. 1607.55 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  23244. 1607.55 s [algebraic-graphs]
  23245. 1607.55 s [algebraic-graphs] ============ Relation.biclique ============
  23246. 1607.55 s [algebraic-graphs] OK: biclique [] [] == empty
  23247. 1607.55 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  23248. 1607.55 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  23249. 1607.55 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  23250. 1607.55 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  23251. 1607.55 s [algebraic-graphs]
  23252. 1607.55 s [algebraic-graphs] ============ Relation.star ============
  23253. 1607.55 s [algebraic-graphs] OK: star x [] == vertex x
  23254. 1607.55 s [algebraic-graphs] OK: star x [y] == edge x y
  23255. 1607.55 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  23256. 1607.55 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  23257. 1607.55 s [algebraic-graphs]
  23258. 1607.55 s [algebraic-graphs] ============ Relation.stars ============
  23259. 1607.55 s [algebraic-graphs] OK: stars [] == empty
  23260. 1607.55 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  23261. 1607.55 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  23262. 1607.55 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  23263. 1607.55 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  23264. 1607.55 s [algebraic-graphs] OK: stars . adjacencyList == id
  23265. 1607.55 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  23266. 1607.55 s [algebraic-graphs]
  23267. 1607.55 s [algebraic-graphs] ============ Relation.tree ============
  23268. 1607.55 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  23269. 1607.55 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  23270. 1607.55 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  23271. 1607.55 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  23272. 1607.55 s [algebraic-graphs]
  23273. 1607.55 s [algebraic-graphs] ============ Relation.forest ============
  23274. 1607.55 s [algebraic-graphs] OK: forest [] == empty
  23275. 1607.55 s [algebraic-graphs] OK: forest [x] == tree x
  23276. 1607.55 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  23277. 1607.55 s [algebraic-graphs] OK: forest == overlays . map tree
  23278. 1607.55 s [algebraic-graphs]
  23279. 1607.55 s [algebraic-graphs] ============ Relation.removeVertex ============
  23280. 1607.55 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  23281. 1607.55 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  23282. 1607.55 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  23283. 1607.55 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  23284. 1607.55 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  23285. 1607.55 s [algebraic-graphs]
  23286. 1607.55 s [algebraic-graphs] ============ Relation.removeEdge ============
  23287. 1607.55 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  23288. 1607.55 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  23289. 1607.55 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  23290. 1607.55 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  23291. 1607.55 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  23292. 1607.55 s [algebraic-graphs]
  23293. 1607.55 s [algebraic-graphs] ============ Relation.replaceVertex ============
  23294. 1607.55 s [algebraic-graphs] OK: replaceVertex x x == id
  23295. 1607.55 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  23296. 1607.55 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  23297. 1607.55 s [algebraic-graphs]
  23298. 1607.55 s [algebraic-graphs] ============ Relation.mergeVertices ============
  23299. 1607.55 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  23300. 1632.36 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  23301. 1632.36 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  23302. 1632.40 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  23303. 1632.40 s [algebraic-graphs]
  23304. 1632.40 s [algebraic-graphs] ============ Relation.transpose ============
  23305. 1632.40 s [algebraic-graphs] OK: transpose empty == empty
  23306. 1632.40 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  23307. 1632.40 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  23308. 1632.40 s [algebraic-graphs] OK: transpose . transpose == id
  23309. 1632.40 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  23310. 1632.40 s [algebraic-graphs]
  23311. 1632.40 s [algebraic-graphs] ============ Relation.gmap ============
  23312. 1632.40 s [algebraic-graphs] OK: gmap f empty == empty
  23313. 1632.40 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  23314. 1632.40 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  23315. 1632.40 s [algebraic-graphs] OK: gmap id == id
  23316. 1632.40 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  23317. 1632.40 s [algebraic-graphs]
  23318. 1632.40 s [algebraic-graphs] ============ Relation.induce ============
  23319. 1632.40 s [algebraic-graphs] OK: induce (const True ) x == x
  23320. 1632.40 s [algebraic-graphs] OK: induce (const False) x == empty
  23321. 1632.40 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  23322. 1632.40 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  23323. 1632.40 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  23324. 1632.40 s [algebraic-graphs]
  23325. 1632.40 s [algebraic-graphs] ============ Relation.compose ============
  23326. 1632.40 s [algebraic-graphs] OK: compose empty x == empty
  23327. 1632.40 s [algebraic-graphs] OK: compose x empty == empty
  23328. 1632.40 s [algebraic-graphs] OK: compose (vertex x) y == empty
  23329. 1632.40 s [algebraic-graphs] OK: compose x (vertex y) == empty
  23330. 1632.40 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  23331. 1632.40 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  23332. 1632.40 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  23333. 1632.40 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  23334. 1632.40 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  23335. 1632.40 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  23336. 1632.40 s [algebraic-graphs]
  23337. 1632.40 s [algebraic-graphs] ============ Relation.closure ============
  23338. 1632.40 s [algebraic-graphs] OK: closure empty == empty
  23339. 1632.40 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  23340. 1632.40 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  23341. 1632.40 s [algebraic-graphs] OK: closure (edge x y) == edges [(x,x), (x,y), (y,y)]
  23342. 1632.40 s [algebraic-graphs] OK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
  23343. 1632.40 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  23344. 1632.40 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  23345. 1632.40 s [algebraic-graphs] OK: closure . closure == closure
  23346. 1632.40 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  23347. 1632.40 s [algebraic-graphs]
  23348. 1632.40 s [algebraic-graphs] ============ Relation.reflexiveClosure ============
  23349. 1632.40 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  23350. 1632.40 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  23351. 1632.40 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  23352. 1632.40 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges [(x,x), (x,y), (y,y)]
  23353. 1632.40 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  23354. 1632.40 s [algebraic-graphs]
  23355. 1632.40 s [algebraic-graphs] ============ Relation.symmetricClosure ============
  23356. 1632.40 s [algebraic-graphs] OK: symmetricClosure empty == empty
  23357. 1632.40 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  23358. 1632.40 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges [(x,y), (y,x)]
  23359. 1632.40 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  23360. 1632.40 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  23361. 1632.40 s [algebraic-graphs]
  23362. 1632.40 s [algebraic-graphs] ============ Relation.transitiveClosure ============
  23363. 1632.40 s [algebraic-graphs] OK: transitiveClosure empty == empty
  23364. 1632.40 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  23365. 1632.40 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  23366. 1632.40 s [algebraic-graphs] OK: transitiveClosure (path $ nub xs) == clique (nub $ xs)
  23367. 1632.40 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  23368. 1632.40 s [algebraic-graphs]
  23369. 1632.40 s [algebraic-graphs] ============ Relation.induceJust ============
  23370. 1632.40 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  23371. 1632.40 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  23372. 1632.40 s [algebraic-graphs] OK: induceJust . gmap Just == id
  23373. 1632.40 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  23374. 1632.40 s [algebraic-graphs]
  23375. 1632.40 s [algebraic-graphs] ============ ReflexiveRelation ============
  23376. 1632.40 s [algebraic-graphs] OK: Axioms of reflexive graphs
  23377. 1632.40 s [algebraic-graphs]
  23378. 1632.40 s [algebraic-graphs] ============ TransitiveRelation ============
  23379. 1632.40 s [algebraic-graphs] OK: Axioms of transitive graphs
  23380. 1632.40 s [algebraic-graphs] OK: path xs == (clique xs :: TransitiveRelation Int)
  23381. 1632.40 s [algebraic-graphs]
  23382. 1632.40 s [algebraic-graphs] ============ PreorderRelation ============
  23383. 1632.40 s [algebraic-graphs] OK: Axioms of preorder graphs
  23384. 1632.40 s [algebraic-graphs] OK: path xs == (clique xs :: PreorderRelation Int)
  23385. 1632.40 s [algebraic-graphs]
  23386. 1632.40 s [algebraic-graphs] ============ Symmetric.Relation ============
  23387. 1632.40 s [algebraic-graphs] OK: Axioms of undirected graphs
  23388. 1632.40 s [algebraic-graphs]
  23389. 1632.40 s [algebraic-graphs] ============ Symmetric.Relation.consistent ============
  23390. 1632.40 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  23391. 1632.40 s [algebraic-graphs]
  23392. 1632.40 s [algebraic-graphs] OK: consistent empty == True
  23393. 1632.40 s [algebraic-graphs] OK: consistent (vertex x) == True
  23394. 1632.40 s [algebraic-graphs] OK: consistent (overlay x y) == True
  23395. 1632.40 s [algebraic-graphs] OK: consistent (connect x y) == True
  23396. 1632.40 s [algebraic-graphs] OK: consistent (edge x y) == True
  23397. 1632.40 s [algebraic-graphs] OK: consistent (edges xs) == True
  23398. 1632.40 s [algebraic-graphs] OK: consistent (stars xs) == True
  23399. 1632.40 s [algebraic-graphs]
  23400. 1632.40 s [algebraic-graphs] ============ Symmetric.Relation.Show ============
  23401. 1632.40 s [algebraic-graphs] OK: show (empty ) == "empty"
  23402. 1632.40 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  23403. 1632.40 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  23404. 1632.40 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  23405. 1632.40 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  23406. 1632.40 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  23407. 1632.40 s [algebraic-graphs]
  23408. 1632.40 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  23409. 1632.40 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  23410. 1632.40 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  23411. 1632.40 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  23412. 1632.40 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  23413. 1632.40 s [algebraic-graphs]
  23414. 1632.40 s [algebraic-graphs] OK: show (2 * 1 ) == "edge 1 2"
  23415. 1632.40 s [algebraic-graphs] OK: show (1 * 2 * 1) == "edges [(1,1),(1,2)]"
  23416. 1632.40 s [algebraic-graphs] OK: show (3 * 2 * 1) == "edges [(1,2),(1,3),(2,3)]"
  23417. 1632.40 s [algebraic-graphs]
  23418. 1632.40 s [algebraic-graphs] ============ Symmetric.Relation.toSymmetric ============
  23419. 1632.40 s [algebraic-graphs] OK: toSymmetric (edge 1 2) == edge 1 2
  23420. 1632.40 s [algebraic-graphs] OK: toSymmetric . fromSymmetric == id
  23421. 1632.40 s [algebraic-graphs] OK: fromSymmetric . toSymmetric == symmetricClosure
  23422. 1632.40 s [algebraic-graphs] OK: vertexCount . toSymmetric == vertexCount
  23423. 1632.40 s [algebraic-graphs] OK: (*2) . edgeCount . toSymmetric >= edgeCount
  23424. 1632.40 s [algebraic-graphs]
  23425. 1632.40 s [algebraic-graphs] ============ Symmetric.Relation.fromSymmetric ============
  23426. 1632.40 s [algebraic-graphs] OK: fromSymmetric (edge 1 2) == edges [(1,2), (2,1)]
  23427. 1632.40 s [algebraic-graphs] OK: vertexCount . fromSymmetric == vertexCount
  23428. 1632.40 s [algebraic-graphs] OK: edgeCount . fromSymmetric <= (*2) . edgeCount
  23429. 1632.40 s [algebraic-graphs]
  23430. 1632.40 s [algebraic-graphs] ============ Symmetric.Relation.Ord ============
  23431. 1632.40 s [algebraic-graphs] OK: vertex 1 < vertex 2
  23432. 1632.40 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  23433. 1632.40 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  23434. 1632.40 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  23435. 1632.40 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  23436. 1632.40 s [algebraic-graphs] OK: edge 2 1 < edge 1 3
  23437. 1632.40 s [algebraic-graphs] OK: edge 1 2 == edge 2 1
  23438. 1632.40 s [algebraic-graphs] OK: x <= x + y
  23439. 1632.40 s [algebraic-graphs] OK: x + y <= x * y
  23440. 1632.40 s [algebraic-graphs]
  23441. 1632.40 s [algebraic-graphs] ============ Symmetric.Relation.empty ============
  23442. 1632.40 s [algebraic-graphs] OK: isEmpty empty == True
  23443. 1632.40 s [algebraic-graphs] OK: hasVertex x empty == False
  23444. 1632.40 s [algebraic-graphs] OK: vertexCount empty == 0
  23445. 1632.40 s [algebraic-graphs] OK: edgeCount empty == 0
  23446. 1632.40 s [algebraic-graphs]
  23447. 1632.40 s [algebraic-graphs] ============ Symmetric.Relation.vertex ============
  23448. 1632.40 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  23449. 1632.40 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  23450. 1632.40 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  23451. 1632.40 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  23452. 1632.40 s [algebraic-graphs]
  23453. 1632.40 s [algebraic-graphs] ============ Symmetric.Relation.edge ============
  23454. 1632.40 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  23455. 1632.40 s [algebraic-graphs] OK: edge x y == edge y x
  23456. 1632.40 s [algebraic-graphs] OK: edge x y == edges [(x,y), (y,x)]
  23457. 1632.40 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  23458. 1632.40 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  23459. 1632.40 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  23460. 1632.40 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  23461. 1632.40 s [algebraic-graphs]
  23462. 1632.40 s [algebraic-graphs] ============ Symmetric.Relation.overlay ============
  23463. 1632.40 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  23464. 1632.40 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  23465. 1632.40 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  23466. 1632.40 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  23467. 1632.40 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  23468. 1632.40 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  23469. 1632.40 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  23470. 1632.40 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  23471. 1632.40 s [algebraic-graphs]
  23472. 1632.40 s [algebraic-graphs] ============ Symmetric.Relation.connect ============
  23473. 1632.40 s [algebraic-graphs] OK: connect x y == connect y x
  23474. 1632.40 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  23475. 1632.40 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  23476. 1632.40 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  23477. 1632.40 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  23478. 1632.40 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  23479. 1632.40 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  23480. 1632.40 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y `div` 2
  23481. 1632.40 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  23482. 1632.40 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  23483. 1632.40 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  23484. 1632.40 s [algebraic-graphs]
  23485. 1632.40 s [algebraic-graphs] ============ Symmetric.Relation.vertices ============
  23486. 1632.40 s [algebraic-graphs] OK: vertices [] == empty
  23487. 1632.40 s [algebraic-graphs] OK: vertices [x] == vertex x
  23488. 1632.40 s [algebraic-graphs] OK: vertices == overlays . map vertex
  23489. 1632.40 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  23490. 1632.40 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  23491. 1632.40 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  23492. 1632.40 s [algebraic-graphs]
  23493. 1632.40 s [algebraic-graphs] ============ Symmetric.Relation.edges ============
  23494. 1632.40 s [algebraic-graphs] OK: edges [] == empty
  23495. 1632.40 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  23496. 1632.40 s [algebraic-graphs] OK: edges [(x,y), (y,x)] == edge x y
  23497. 1632.40 s [algebraic-graphs]
  23498. 1632.40 s [algebraic-graphs] ============ Symmetric.Relation.overlays ============
  23499. 1632.40 s [algebraic-graphs] OK: overlays [] == empty
  23500. 1644.62 s [algebraic-graphs] OK: overlays [x] == x
  23501. 1644.65 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  23502. 1644.65 s [algebraic-graphs] OK: overlays == foldr overlay empty
  23503. 1644.65 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  23504. 1644.65 s [algebraic-graphs]
  23505. 1644.65 s [algebraic-graphs] ============ Symmetric.Relation.connects ============
  23506. 1644.65 s [algebraic-graphs] OK: connects [] == empty
  23507. 1644.65 s [algebraic-graphs] OK: connects [x] == x
  23508. 1644.65 s [algebraic-graphs] OK: connects [x,y] == connect x y
  23509. 1644.65 s [algebraic-graphs] OK: connects == foldr connect empty
  23510. 1644.65 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  23511. 1644.65 s [algebraic-graphs] OK: connects == connects . reverse
  23512. 1644.65 s [algebraic-graphs]
  23513. 1644.65 s [algebraic-graphs] ============ Symmetric.Relation.isSubgraphOf ============
  23514. 1644.65 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  23515. 1644.65 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  23516. 1644.65 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  23517. 1644.65 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  23518. 1644.65 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  23519. 1644.65 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  23520. 1644.65 s [algebraic-graphs] OK: isSubgraphOf (edge x y) (edge y x) == True
  23521. 1644.65 s [algebraic-graphs]
  23522. 1644.65 s [algebraic-graphs] ============ Symmetric.Relation.toGraph et al. ============
  23523. 1644.65 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  23524. 1644.65 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  23525. 1644.65 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  23526. 1644.65 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  23527. 1644.65 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  23528. 1644.65 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  23529. 1644.65 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  23530. 1644.65 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  23531. 1644.65 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  23532. 1644.65 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  23533. 1644.65 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  23534. 1644.66 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  23535. 1644.66 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  23536. 1644.66 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  23537. 1644.66 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  23538. 1644.66 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  23539. 1644.66 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  23540. 1644.66 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  23541. 1644.66 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  23542. 1644.66 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  23543. 1644.66 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  23544. 1644.66 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  23545. 1644.66 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  23546. 1644.66 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  23547. 1644.66 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  23548. 1644.66 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  23549. 1644.66 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  23550. 1644.66 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  23551. 1644.66 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  23552. 1644.66 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  23553. 1644.66 s [algebraic-graphs]
  23554. 1644.66 s [algebraic-graphs] ============ Symmetric.Relation.isEmpty ============
  23555. 1644.66 s [algebraic-graphs] OK: isEmpty empty == True
  23556. 1644.66 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  23557. 1644.66 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  23558. 1644.66 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  23559. 1644.66 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  23560. 1644.66 s [algebraic-graphs]
  23561. 1644.66 s [algebraic-graphs] ============ Symmetric.Relation.hasVertex ============
  23562. 1644.66 s [algebraic-graphs] OK: hasVertex x empty == False
  23563. 1644.66 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  23564. 1644.66 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  23565. 1644.66 s [algebraic-graphs]
  23566. 1644.66 s [algebraic-graphs] ============ Symmetric.Relation.hasEdge ============
  23567. 1644.66 s [algebraic-graphs] OK: hasEdge x y empty == False
  23568. 1644.66 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  23569. 1644.66 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  23570. 1644.66 s [algebraic-graphs] OK: hasEdge x y (edge y x) == True
  23571. 1644.66 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  23572. 1644.66 s [algebraic-graphs] OK: hasEdge x y == elem (min x y, max x y) . edgeList
  23573. 1644.66 s [algebraic-graphs]
  23574. 1644.66 s [algebraic-graphs] ============ Symmetric.Relation.vertexCount ============
  23575. 1644.66 s [algebraic-graphs] OK: vertexCount empty == 0
  23576. 1644.66 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  23577. 1644.66 s [algebraic-graphs] OK: vertexCount == length . vertexList
  23578. 1644.66 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  23579. 1644.66 s [algebraic-graphs]
  23580. 1644.66 s [algebraic-graphs] ============ Symmetric.Relation.edgeCount ============
  23581. 1644.66 s [algebraic-graphs] OK: edgeCount empty == 0
  23582. 1644.66 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  23583. 1644.66 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  23584. 1644.66 s [algebraic-graphs] OK: edgeCount == length . edgeList
  23585. 1644.66 s [algebraic-graphs]
  23586. 1644.66 s [algebraic-graphs] ============ Symmetric.Relation.vertexList ============
  23587. 1644.66 s [algebraic-graphs] OK: vertexList empty == []
  23588. 1644.66 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  23589. 1644.66 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  23590. 1644.66 s [algebraic-graphs]
  23591. 1644.66 s [algebraic-graphs] ============ Symmetric.Relation.vertexSet ============
  23592. 1644.66 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  23593. 1644.66 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  23594. 1644.66 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  23595. 1644.66 s [algebraic-graphs]
  23596. 1644.66 s [algebraic-graphs] ============ Symmetric.Relation.vertexIntSet ============
  23597. 1644.66 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  23598. 1644.66 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  23599. 1644.66 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  23600. 1644.66 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  23601. 1644.66 s [algebraic-graphs]
  23602. 1644.66 s [algebraic-graphs] ============ Symmetric.Relation.edgeList ============
  23603. 1644.66 s [algebraic-graphs] OK: edgeList empty == []
  23604. 1644.66 s [algebraic-graphs] OK: edgeList (vertex x) == []
  23605. 1644.66 s [algebraic-graphs] OK: edgeList (edge x y) == [(min x y, max y x)]
  23606. 1644.66 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(1,2), (2,3)]
  23607. 1644.66 s [algebraic-graphs]
  23608. 1644.66 s [algebraic-graphs] ============ Symmetric.Relation.edgeSet ============
  23609. 1644.66 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  23610. 1644.66 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  23611. 1644.66 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (min x y, max x y)
  23612. 1644.66 s [algebraic-graphs]
  23613. 1644.66 s [algebraic-graphs] ============ Symmetric.Relation.adjacencyList ============
  23614. 1644.66 s [algebraic-graphs] OK: adjacencyList empty == []
  23615. 1644.66 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  23616. 1644.66 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [1])]
  23617. 1644.66 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, [2]), (2, [1,3]), (3, [2])]
  23618. 1644.66 s [algebraic-graphs]
  23619. 1644.66 s [algebraic-graphs] ============ Symmetric.Relation.neighbours ============
  23620. 1644.66 s [algebraic-graphs] OK: neighbours x empty == Set.empty
  23621. 1644.66 s [algebraic-graphs] OK: neighbours x (vertex x) == Set.empty
  23622. 1644.66 s [algebraic-graphs] OK: neighbours x (edge x y) == Set.fromList [y]
  23623. 1644.66 s [algebraic-graphs] OK: neighbours y (edge x y) == Set.fromList [x]
  23624. 1644.66 s [algebraic-graphs]
  23625. 1644.66 s [algebraic-graphs] ============ Symmetric.Relation.path ============
  23626. 1644.66 s [algebraic-graphs] OK: path [] == empty
  23627. 1644.66 s [algebraic-graphs] OK: path [x] == vertex x
  23628. 1644.66 s [algebraic-graphs] OK: path [x,y] == edge x y
  23629. 1644.66 s [algebraic-graphs] OK: path == path . reverse
  23630. 1644.66 s [algebraic-graphs]
  23631. 1644.66 s [algebraic-graphs] ============ Symmetric.Relation.circuit ============
  23632. 1644.66 s [algebraic-graphs] OK: circuit [] == empty
  23633. 1644.66 s [algebraic-graphs] OK: circuit [x] == edge x x
  23634. 1644.66 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  23635. 1644.66 s [algebraic-graphs] OK: circuit == circuit . reverse
  23636. 1644.66 s [algebraic-graphs]
  23637. 1644.66 s [algebraic-graphs] ============ Symmetric.Relation.clique ============
  23638. 1644.66 s [algebraic-graphs] OK: clique [] == empty
  23639. 1644.66 s [algebraic-graphs] OK: clique [x] == vertex x
  23640. 1644.66 s [algebraic-graphs] OK: clique [x,y] == edge x y
  23641. 1644.66 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  23642. 1644.66 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  23643. 1644.66 s [algebraic-graphs] OK: clique == clique . reverse
  23644. 1644.66 s [algebraic-graphs]
  23645. 1644.66 s [algebraic-graphs] ============ Symmetric.Relation.biclique ============
  23646. 1644.66 s [algebraic-graphs] OK: biclique [] [] == empty
  23647. 1644.66 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  23648. 1644.66 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  23649. 1644.66 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  23650. 1644.66 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  23651. 1644.66 s [algebraic-graphs]
  23652. 1644.66 s [algebraic-graphs] ============ Symmetric.Relation.star ============
  23653. 1644.66 s [algebraic-graphs] OK: star x [] == vertex x
  23654. 1644.66 s [algebraic-graphs] OK: star x [y] == edge x y
  23655. 1644.66 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  23656. 1644.66 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  23657. 1644.66 s [algebraic-graphs]
  23658. 1644.66 s [algebraic-graphs] ============ Symmetric.Relation.stars ============
  23659. 1644.66 s [algebraic-graphs] OK: stars [] == empty
  23660. 1644.66 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  23661. 1644.66 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  23662. 1644.66 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  23663. 1644.66 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  23664. 1644.66 s [algebraic-graphs] OK: stars . adjacencyList == id
  23665. 1644.66 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  23666. 1644.66 s [algebraic-graphs]
  23667. 1644.66 s [algebraic-graphs] ============ Symmetric.Relation.tree ============
  23668. 1644.66 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  23669. 1644.66 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  23670. 1644.66 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  23671. 1644.66 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  23672. 1644.66 s [algebraic-graphs]
  23673. 1644.66 s [algebraic-graphs] ============ Symmetric.Relation.forest ============
  23674. 1644.66 s [algebraic-graphs] OK: forest [] == empty
  23675. 1650.88 s [algebraic-graphs] OK: forest [x] == tree x
  23676. 1650.88 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  23677. 1650.92 s [algebraic-graphs] OK: forest == overlays . map tree
  23678. 1650.92 s [algebraic-graphs]
  23679. 1650.92 s [algebraic-graphs] ============ Symmetric.Relation.removeVertex ============
  23680. 1650.92 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  23681. 1650.92 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  23682. 1650.92 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  23683. 1650.92 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  23684. 1650.92 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  23685. 1650.92 s [algebraic-graphs]
  23686. 1650.92 s [algebraic-graphs] ============ Symmetric.Relation.removeEdge ============
  23687. 1650.92 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  23688. 1650.92 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  23689. 1650.92 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  23690. 1650.92 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  23691. 1650.92 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  23692. 1650.92 s [algebraic-graphs] OK: removeEdge x y == removeEdge y x
  23693. 1650.92 s [algebraic-graphs]
  23694. 1650.92 s [algebraic-graphs] ============ Symmetric.Relation.replaceVertex ============
  23695. 1650.92 s [algebraic-graphs] OK: replaceVertex x x == id
  23696. 1650.92 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  23697. 1650.92 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  23698. 1650.92 s [algebraic-graphs]
  23699. 1650.92 s [algebraic-graphs] ============ Symmetric.Relation.mergeVertices ============
  23700. 1650.92 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  23701. 1650.92 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  23702. 1650.92 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  23703. 1650.92 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  23704. 1650.92 s [algebraic-graphs]
  23705. 1650.92 s [algebraic-graphs] ============ Symmetric.Relation.gmap ============
  23706. 1650.92 s [algebraic-graphs] OK: gmap f empty == empty
  23707. 1650.92 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  23708. 1650.92 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  23709. 1650.92 s [algebraic-graphs] OK: gmap id == id
  23710. 1650.92 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  23711. 1650.92 s [algebraic-graphs]
  23712. 1650.92 s [algebraic-graphs] ============ Symmetric.Relation.induce ============
  23713. 1650.92 s [algebraic-graphs] OK: induce (const True ) x == x
  23714. 1650.92 s [algebraic-graphs] OK: induce (const False) x == empty
  23715. 1650.92 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  23716. 1650.92 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  23717. 1650.92 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  23718. 1650.92 s [algebraic-graphs]
  23719. 1650.92 s [algebraic-graphs] ============ Symmetric.Relation.induceJust ============
  23720. 1650.92 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  23721. 1650.92 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  23722. 1650.92 s [algebraic-graphs] OK: induceJust . gmap Just == id
  23723. 1650.92 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  23724. 1650.92 s [algebraic-graphs]
  23725. 1650.92 s [algebraic-graphs] ============ Example.Todo (Holiday) ============
  23726. 1650.92 s [algebraic-graphs] OK: A todo list is semantically Maybe [a]
  23727. 1650.92 s [algebraic-graphs] OK: The overlay operator (+) adds non-dependent items to the todo list
  23728. 1650.92 s [algebraic-graphs] OK: The connect operator (*) adds dependency between items
  23729. 1650.92 s [algebraic-graphs] OK: Contradictory constraints make the todo list impossible to schedule
  23730. 1650.92 s [algebraic-graphs] OK: Introduce item priority to schedule the todo list
  23731. 1650.92 s [algebraic-graphs] OK: Custom connect operators pull/repel arguments during scheduling
  23732. 1650.92 s [algebraic-graphs]
  23733. 1650.92 s [algebraic-graphs] ============ Example.Todo (Commandline) ============
  23734. 1650.92 s [algebraic-graphs] OK: The pull connect operator maintains command line semantics
  23735. 1650.92 s [algebraic-graphs] OK: Swapping flags are allowed by the commutative overlay opeartor
  23736. 1650.92 s [algebraic-graphs] OK: The usual connect operator breaks semantics
  23737. 1650.92 s [algebraic-graphs] OK: Transform command lines by adding optimisation flag
  23738. 1650.92 s [algebraic-graphs]
  23739. 1650.92 s [algebraic-graphs] ============ Typed ============
  23740. 1650.92 s [algebraic-graphs]
  23741. 1650.92 s [algebraic-graphs] ============ Typed.fromAdjacencyMap ============
  23742. 1650.92 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyMap (1 * 2 + 3 * 1)) == array (0,2) [(0,[1]), (1,[]), (2,[0])]
  23743. 1650.92 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyMap (1 * 2 + 2 * 1)) == array (0,1) [(0,[1]), (1,[0])]
  23744. 1650.92 s [algebraic-graphs] OK: map (fromVertexKL h) (vertices $ toGraphKL h) == vertexList g
  23745. 1650.92 s [algebraic-graphs] OK: map (\(x, y) -> (fromVertexKL h x, fromVertexKL h y)) (edges $ toGraphKL h) == edgeList g
  23746. 1650.92 s [algebraic-graphs]
  23747. 1650.92 s [algebraic-graphs] ============ Typed.fromAdjacencyIntMap ============
  23748. 1650.92 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyIntMap (1 * 2 + 3 * 1)) == array (0,2) [(0,[1]), (1,[]), (2,[0])]
  23749. 1650.92 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyIntMap (1 * 2 + 2 * 1)) == array (0,1) [(0,[1]), (1,[0])]
  23750. 1650.92 s [algebraic-graphs] OK: map (fromVertexKL h) (vertices $ toGraphKL h) == IntSet.toAscList (vertexIntSet g)
  23751. 1650.92 s [algebraic-graphs] OK: map (\(x, y) -> (fromVertexKL h x, fromVertexKL h y)) (edges $ toGraphKL h) == edgeList g
  23752. 1650.92 s [algebraic-graphs]
  23753. 1650.92 s [algebraic-graphs] ============ Typed.dfsForest ============
  23754. 1650.92 s [algebraic-graphs] OK: forest (dfsForest % edge 1 1) == vertex 1
  23755. 1650.92 s [algebraic-graphs] OK: forest (dfsForest % edge 1 2) == edge 1 2
  23756. 1650.92 s [algebraic-graphs] OK: forest (dfsForest % edge 2 1) == vertices [1, 2]
  23757. 1650.92 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForest % x) x == True
  23758. 1650.92 s [algebraic-graphs] OK: dfsForest % forest (dfsForest % x) == dfsForest % x
  23759. 1650.92 s [algebraic-graphs] OK: dfsForest % vertices vs == map (\v -> Node v []) (nub $ sort vs)
  23760. 1650.92 s [algebraic-graphs] OK: dfsForest % (3 * (1 + 4) * (1 + 5)) == <correct result>
  23761. 1650.92 s [algebraic-graphs]
  23762. 1650.92 s [algebraic-graphs] ============ Typed.dfsForestFrom ============
  23763. 1650.92 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 1) [1] == vertex 1
  23764. 1650.92 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [0] == empty
  23765. 1650.92 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [1] == edge 1 2
  23766. 1650.92 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [2] == vertex 2
  23767. 1650.92 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [2,1] == vertices [1,2]
  23768. 1650.92 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForestFrom % x $ vs) x == True
  23769. 1650.92 s [algebraic-graphs] OK: dfsForestFrom % x $ vertexList x == dfsForest % x
  23770. 1650.92 s [algebraic-graphs] OK: dfsForestFrom % vertices vs $ vs == map (\v -> Node v []) (nub vs)
  23771. 1650.92 s [algebraic-graphs] OK: dfsForestFrom % x $ [] == []
  23772. 1650.92 s [algebraic-graphs] OK: dfsForestFrom % (3 * (1 + 4) * (1 + 5)) $ [1,4] == <correct result>
  23773. 1650.92 s [algebraic-graphs]
  23774. 1650.92 s [algebraic-graphs] ============ Typed.dfs ============
  23775. 1650.92 s [algebraic-graphs] OK: dfs % edge 1 1 $ [1] == [1]
  23776. 1650.92 s [algebraic-graphs] OK: dfs % edge 1 2 $ [0] == []
  23777. 1650.92 s [algebraic-graphs] OK: dfs % edge 1 2 $ [1] == [1,2]
  23778. 1650.92 s [algebraic-graphs] OK: dfs % edge 1 2 $ [2] == [2]
  23779. 1650.92 s [algebraic-graphs] OK: dfs % edge 1 2 $ [1,2] == [1,2]
  23780. 1650.92 s [algebraic-graphs] OK: dfs % edge 1 2 $ [2,1] == [2,1]
  23781. 1650.92 s [algebraic-graphs] OK: dfs % x $ [] == []
  23782. 1650.92 s [algebraic-graphs]
  23783. 1650.92 s [algebraic-graphs] OK: dfs % (3 * (1 + 4) * (1 + 5)) $ [1,4] == [1,5,4]
  23784. 1650.92 s [algebraic-graphs] OK: and [ hasVertex v x | v <- dfs % x $ vs ] == True
  23785. 1650.92 s [algebraic-graphs]
  23786. 1650.92 s [algebraic-graphs] ============ Typed.topSort ============
  23787. 1650.92 s [algebraic-graphs] OK: topSort % (1 * 2 + 3 * 1) == [3,1,2]
  23788. 1650.92 s [algebraic-graphs] OK: topSort % (1 * 2 + 2 * 1) == [1,2]
  23789. 1650.92 s [algebraic-graphs]
  23790. 1650.92 s [algebraic-graphs] ============ Graph.Undirected ============
  23791. 1650.92 s [algebraic-graphs] OK: Axioms of undirected graphs
  23792. 1650.92 s [algebraic-graphs]
  23793. 1650.92 s [algebraic-graphs] ============ Graph.Undirected.Show ============
  23794. 1650.92 s [algebraic-graphs] OK: show (empty ) == "empty"
  23795. 1650.92 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  23796. 1650.92 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  23797. 1650.92 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  23798. 1650.92 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  23799. 1650.92 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  23800. 1650.92 s [algebraic-graphs]
  23801. 1650.92 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  23802. 1650.92 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  23803. 1650.92 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  23804. 1650.92 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  23805. 1650.92 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  23806. 1650.92 s [algebraic-graphs]
  23807. 1650.92 s [algebraic-graphs] OK: show (2 * 1 ) == "edge 1 2"
  23808. 1650.92 s [algebraic-graphs] OK: show (1 * 2 * 1) == "edges [(1,1),(1,2)]"
  23809. 1650.92 s [algebraic-graphs] OK: show (3 * 2 * 1) == "edges [(1,2),(1,3),(2,3)]"
  23810. 1650.92 s [algebraic-graphs]
  23811. 1650.92 s [algebraic-graphs] ============ Graph.Undirected.toUndirected ============
  23812. 1650.92 s [algebraic-graphs] OK: toUndirected (edge 1 2) == edge 1 2
  23813. 1650.92 s [algebraic-graphs] OK: toUndirected . fromUndirected == id
  23814. 1650.92 s [algebraic-graphs] OK: vertexCount . toUndirected == vertexCount
  23815. 1650.92 s [algebraic-graphs] OK: (*2) . edgeCount . toUndirected >= edgeCount
  23816. 1650.92 s [algebraic-graphs]
  23817. 1650.92 s [algebraic-graphs] ============ Graph.Undirected.fromUndirected ============
  23818. 1650.92 s [algebraic-graphs] OK: fromUndirected (edge 1 2) == edges [(1,2),(2,1)]
  23819. 1650.92 s [algebraic-graphs] OK: toUndirected . fromUndirected == id
  23820. 1650.92 s [algebraic-graphs] OK: vertexCount . fromUndirected == vertexCount
  23821. 1650.92 s [algebraic-graphs] OK: edgeCount . fromUndirected <= (*2) . edgeCount
  23822. 1650.92 s [algebraic-graphs]
  23823. 1650.92 s [algebraic-graphs] ============ Graph.Undirected.complement ================
  23824. 1650.92 s [algebraic-graphs] OK: complement empty == empty
  23825. 1650.92 s [algebraic-graphs] OK: complement (vertex x) == vertex x
  23826. 1650.92 s [algebraic-graphs] OK: complement (edge 1 1) == edge 1 1
  23827. 1650.92 s [algebraic-graphs] OK: complement (edge 1 2) == vertices [1, 2]
  23828. 1650.92 s [algebraic-graphs] OK: complement (star 1 [2, 3]) == overlay (vertex 1) (edge 2 3)
  23829. 1650.92 s [algebraic-graphs] OK: complement . complement == id
  23830. 1650.92 s [algebraic-graphs]
  23831. 1650.92 s [algebraic-graphs] ============ Graph.Undirected.Ord ============
  23832. 1650.92 s [algebraic-graphs] OK: vertex 1 < vertex 2
  23833. 1650.92 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  23834. 1650.92 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  23835. 1650.92 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  23836. 1650.92 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  23837. 1650.92 s [algebraic-graphs] OK: edge 2 1 < edge 1 3
  23838. 1650.92 s [algebraic-graphs] OK: edge 1 2 == edge 2 1
  23839. 1650.92 s [algebraic-graphs] OK: x <= x + y
  23840. 1650.92 s [algebraic-graphs] OK: x + y <= x * y
  23841. 1650.92 s [algebraic-graphs]
  23842. 1650.92 s [algebraic-graphs] ============ Graph.Undirected.empty ============
  23843. 1650.92 s [algebraic-graphs] OK: isEmpty empty == True
  23844. 1650.92 s [algebraic-graphs] OK: hasVertex x empty == False
  23845. 1650.92 s [algebraic-graphs] OK: vertexCount empty == 0
  23846. 1650.92 s [algebraic-graphs] OK: edgeCount empty == 0
  23847. 1650.92 s [algebraic-graphs]
  23848. 1650.92 s [algebraic-graphs] ============ Graph.Undirected.vertex ============
  23849. 1650.92 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  23850. 1650.92 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  23851. 1650.92 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  23852. 1650.92 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  23853. 1650.92 s [algebraic-graphs]
  23854. 1650.92 s [algebraic-graphs] ============ Graph.Undirected.edge ============
  23855. 1650.92 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  23856. 1650.92 s [algebraic-graphs] OK: edge x y == edge y x
  23857. 1659.14 s [algebraic-graphs] OK: edge x y == edges [(x,y), (y,x)]
  23858. 1659.14 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  23859. 1659.14 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  23860. 1659.18 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  23861. 1659.18 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  23862. 1659.18 s [algebraic-graphs]
  23863. 1659.18 s [algebraic-graphs] ============ Graph.Undirected.overlay ============
  23864. 1659.18 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  23865. 1659.18 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  23866. 1659.18 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  23867. 1659.18 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  23868. 1659.18 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  23869. 1659.18 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  23870. 1659.18 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  23871. 1659.18 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  23872. 1659.18 s [algebraic-graphs]
  23873. 1659.18 s [algebraic-graphs] ============ Graph.Undirected.connect ============
  23874. 1659.18 s [algebraic-graphs] OK: connect x y == connect y x
  23875. 1659.18 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  23876. 1659.18 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  23877. 1659.18 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  23878. 1659.18 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  23879. 1659.18 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  23880. 1659.18 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  23881. 1659.18 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y `div` 2
  23882. 1659.18 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  23883. 1659.18 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  23884. 1659.18 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  23885. 1659.18 s [algebraic-graphs]
  23886. 1659.18 s [algebraic-graphs] ============ Graph.Undirected.vertices ============
  23887. 1659.18 s [algebraic-graphs] OK: vertices [] == empty
  23888. 1659.18 s [algebraic-graphs] OK: vertices [x] == vertex x
  23889. 1659.18 s [algebraic-graphs] OK: vertices == overlays . map vertex
  23890. 1659.18 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  23891. 1659.18 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  23892. 1659.18 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  23893. 1659.18 s [algebraic-graphs]
  23894. 1659.18 s [algebraic-graphs] ============ Graph.Undirected.edges ============
  23895. 1659.18 s [algebraic-graphs] OK: edges [] == empty
  23896. 1659.18 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  23897. 1659.18 s [algebraic-graphs] OK: edges [(x,y), (y,x)] == edge x y
  23898. 1659.18 s [algebraic-graphs]
  23899. 1659.18 s [algebraic-graphs] ============ Graph.Undirected.overlays ============
  23900. 1659.18 s [algebraic-graphs] OK: overlays [] == empty
  23901. 1659.18 s [algebraic-graphs] OK: overlays [x] == x
  23902. 1659.18 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  23903. 1659.18 s [algebraic-graphs] OK: overlays == foldr overlay empty
  23904. 1659.18 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  23905. 1659.18 s [algebraic-graphs]
  23906. 1659.18 s [algebraic-graphs] ============ Graph.Undirected.connects ============
  23907. 1659.18 s [algebraic-graphs] OK: connects [] == empty
  23908. 1659.18 s [algebraic-graphs] OK: connects [x] == x
  23909. 1659.18 s [algebraic-graphs] OK: connects [x,y] == connect x y
  23910. 1659.18 s [algebraic-graphs] OK: connects == foldr connect empty
  23911. 1659.18 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  23912. 1659.18 s [algebraic-graphs] OK: connects == connects . reverse
  23913. 1659.18 s [algebraic-graphs]
  23914. 1659.18 s [algebraic-graphs] ============ Graph.Undirected.isSubgraphOf ============
  23915. 1659.18 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  23916. 1659.18 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  23917. 1659.18 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  23918. 1659.18 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  23919. 1659.18 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  23920. 1659.18 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  23921. 1659.18 s [algebraic-graphs] OK: isSubgraphOf (edge x y) (edge y x) == True
  23922. 1659.18 s [algebraic-graphs]
  23923. 1659.18 s [algebraic-graphs] ============ Graph.Undirected.path ============
  23924. 1659.18 s [algebraic-graphs] OK: path [] == empty
  23925. 1659.18 s [algebraic-graphs] OK: path [x] == vertex x
  23926. 1659.18 s [algebraic-graphs] OK: path [x,y] == edge x y
  23927. 1659.18 s [algebraic-graphs] OK: path == path . reverse
  23928. 1659.18 s [algebraic-graphs]
  23929. 1659.18 s [algebraic-graphs] ============ Graph.Undirected.circuit ============
  23930. 1659.18 s [algebraic-graphs] OK: circuit [] == empty
  23931. 1659.18 s [algebraic-graphs] OK: circuit [x] == edge x x
  23932. 1659.18 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  23933. 1659.18 s [algebraic-graphs] OK: circuit == circuit . reverse
  23934. 1659.18 s [algebraic-graphs]
  23935. 1659.18 s [algebraic-graphs] ============ Graph.Undirected.clique ============
  23936. 1659.18 s [algebraic-graphs] OK: clique [] == empty
  23937. 1659.18 s [algebraic-graphs] OK: clique [x] == vertex x
  23938. 1659.18 s [algebraic-graphs] OK: clique [x,y] == edge x y
  23939. 1659.18 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  23940. 1659.18 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  23941. 1659.18 s [algebraic-graphs] OK: clique == clique . reverse
  23942. 1659.18 s [algebraic-graphs]
  23943. 1659.18 s [algebraic-graphs] ============ Graph.Undirected.biclique ============
  23944. 1659.18 s [algebraic-graphs] OK: biclique [] [] == empty
  23945. 1659.18 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  23946. 1659.18 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  23947. 1659.18 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  23948. 1659.18 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  23949. 1659.18 s [algebraic-graphs]
  23950. 1659.18 s [algebraic-graphs] ============ Graph.Undirected.star ============
  23951. 1659.18 s [algebraic-graphs] OK: star x [] == vertex x
  23952. 1659.18 s [algebraic-graphs] OK: star x [y] == edge x y
  23953. 1659.18 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  23954. 1659.18 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  23955. 1659.18 s [algebraic-graphs]
  23956. 1659.18 s [algebraic-graphs] ============ Graph.Undirected.stars ============
  23957. 1659.18 s [algebraic-graphs] OK: stars [] == empty
  23958. 1659.18 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  23959. 1659.18 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  23960. 1659.18 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  23961. 1659.18 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  23962. 1659.18 s [algebraic-graphs] OK: stars . adjacencyList == id
  23963. 1659.18 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  23964. 1659.18 s [algebraic-graphs]
  23965. 1659.18 s [algebraic-graphs] ============ Graph.Undirected.tree ============
  23966. 1659.18 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  23967. 1659.18 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  23968. 1659.18 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  23969. 1659.18 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  23970. 1659.18 s [algebraic-graphs]
  23971. 1659.18 s [algebraic-graphs] ============ Graph.Undirected.forest ============
  23972. 1659.18 s [algebraic-graphs] OK: forest [] == empty
  23973. 1659.18 s [algebraic-graphs] OK: forest [x] == tree x
  23974. 1659.18 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  23975. 1659.18 s [algebraic-graphs] OK: forest == overlays . map tree
  23976. 1659.18 s [algebraic-graphs]
  23977. 1659.18 s [algebraic-graphs] ============ Graph.Undirected.removeVertex ============
  23978. 1659.18 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  23979. 1659.18 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  23980. 1659.18 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  23981. 1659.18 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  23982. 1659.18 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  23983. 1659.18 s [algebraic-graphs]
  23984. 1659.18 s [algebraic-graphs] ============ Graph.Undirected.removeEdge ============
  23985. 1659.18 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  23986. 1659.18 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  23987. 1659.18 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  23988. 1659.18 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  23989. 1659.18 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  23990. 1659.18 s [algebraic-graphs] OK: removeEdge x y == removeEdge y x
  23991. 1659.18 s [algebraic-graphs]
  23992. 1659.18 s [algebraic-graphs] ============ Graph.Undirected.replaceVertex ============
  23993. 1659.18 s [algebraic-graphs] OK: replaceVertex x x == id
  23994. 1659.18 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  23995. 1659.18 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  23996. 1659.18 s [algebraic-graphs]
  23997. 1659.18 s [algebraic-graphs] ============ Graph.Undirected.mergeVertices ============
  23998. 1659.18 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  23999. 1659.18 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  24000. 1659.18 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  24001. 1659.18 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  24002. 1659.18 s [algebraic-graphs]
  24003. 1659.18 s [algebraic-graphs] ============ Graph.Undirected.gmap ============
  24004. 1659.18 s [algebraic-graphs] OK: gmap f empty == empty
  24005. 1659.18 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  24006. 1659.18 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  24007. 1659.18 s [algebraic-graphs] OK: gmap id == id
  24008. 1659.18 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  24009. 1659.18 s [algebraic-graphs]
  24010. 1659.18 s [algebraic-graphs] ============ Graph.Undirected.induce ============
  24011. 1659.18 s [algebraic-graphs] OK: induce (const True ) x == x
  24012. 1659.18 s [algebraic-graphs] OK: induce (const False) x == empty
  24013. 1659.18 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  24014. 1659.18 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  24015. 1659.18 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  24016. 1659.18 s [algebraic-graphs]
  24017. 1659.18 s [algebraic-graphs] ============ Graph.Undirected.induceJust ============
  24018. 1659.18 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  24019. 1659.18 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  24020. 1659.18 s [algebraic-graphs] OK: induceJust . gmap Just == id
  24021. 1659.18 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  24022. 1659.18 s [algebraic-graphs] Test suite main: PASS
  24023. 1659.18 s [algebraic-graphs] Test suite logged to: dist/test/algebraic-graphs-0.7-main.log
  24024. 1659.18 s [algebraic-graphs] 1 of 1 test suites (1 of 1 test cases) passed.
  24025. 1659.18 s [algebraic-graphs] checkPhase completed in 2 minutes 10 seconds
  24026. 1659.18 s [algebraic-graphs] Phase: haddockPhase
  24027. 1659.29 s [algebraic-graphs] Preprocessing library for algebraic-graphs-0.7..
  24028. 1659.30 s [algebraic-graphs] Running Haddock on library for algebraic-graphs-0.7..
  24029. 1659.33 s [algebraic-graphs] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
  24030. 1659.46 s [algebraic-graphs] [ 1 of 29] Compiling Algebra.Graph.AdjacencyMap ( src/Algebra/Graph/AdjacencyMap.hs, nothing )
  24031. 1659.70 s [algebraic-graphs] [ 2 of 29] Compiling Algebra.Graph.AdjacencyIntMap ( src/Algebra/Graph/AdjacencyIntMap.hs, nothing )
  24032. 1659.75 s [algebraic-graphs] [ 3 of 29] Compiling Algebra.Graph.AdjacencyIntMap.Algorithm ( src/Algebra/Graph/AdjacencyIntMap/Algorithm.hs, nothing )
  24033. 1659.78 s [algebraic-graphs] [ 4 of 29] Compiling Algebra.Graph.Internal ( src/Algebra/Graph/Internal.hs, nothing )
  24034. 1659.81 s [algebraic-graphs] [ 5 of 29] Compiling Algebra.Graph ( src/Algebra/Graph.hs, nothing )
  24035. 1660.00 s [algebraic-graphs] [ 6 of 29] Compiling Algebra.Graph.HigherKinded.Class ( src/Algebra/Graph/HigherKinded/Class.hs, nothing )
  24036. 1660.03 s [algebraic-graphs] [ 7 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap ( src/Algebra/Graph/Bipartite/AdjacencyMap.hs, nothing )
  24037. 1660.17 s [algebraic-graphs] [ 8 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap.Algorithm ( src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs, nothing )
  24038. 1660.23 s [algebraic-graphs] [ 9 of 29] Compiling Algebra.Graph.Label ( src/Algebra/Graph/Label.hs, nothing )
  24039. 1660.42 s [algebraic-graphs] [10 of 29] Compiling Algebra.Graph.NonEmpty.AdjacencyMap ( src/Algebra/Graph/NonEmpty/AdjacencyMap.hs, nothing )
  24040. 1660.46 s [algebraic-graphs] [11 of 29] Compiling Algebra.Graph.AdjacencyMap.Algorithm ( src/Algebra/Graph/AdjacencyMap/Algorithm.hs, nothing )
  24041. 1660.69 s [algebraic-graphs]
  24042. 1660.69 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:384:43: warning: [GHC-63394] [-Wx-partial]
  24043. 1660.69 s [algebraic-graphs] In the use of ‘head’
  24044. 1660.69 s [algebraic-graphs] (imported from Prelude, but defined in GHC.List):
  24045. 1660.69 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
  24046. 1660.69 s [algebraic-graphs] |
  24047. 1660.69 s [algebraic-graphs] 384 | exit v = do newComponent <- (v==).snd.head <$> gets boundaryStack
  24048. 1660.69 s [algebraic-graphs] | ^^^^
  24049. 1660.69 s [algebraic-graphs]
  24050. 1660.69 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:391:21: warning: [GHC-63394] [-Wx-partial]
  24051. 1660.69 s [algebraic-graphs] In the use of ‘tail’
  24052. 1660.70 s [algebraic-graphs] (imported from Prelude, but defined in GHC.List):
  24053. 1660.70 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
  24054. 1660.70 s [algebraic-graphs] |
  24055. 1660.70 s [algebraic-graphs] 391 | pth' = tail v_pth' -- Here we know that v_pth' starts with v
  24056. 1660.70 s [algebraic-graphs] | ^^^^
  24057. 1660.70 s [algebraic-graphs]
  24058. 1660.70 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:395:26: warning: [GHC-63394] [-Wx-partial]
  24059. 1660.70 s [algebraic-graphs] In the use of ‘head’
  24060. 1660.70 s [algebraic-graphs] (imported from Prelude, but defined in GHC.List):
  24061. 1660.70 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
  24062. 1660.70 s [algebraic-graphs] |
  24063. 1660.70 s [algebraic-graphs] 395 | p_v = fst $ head bnd
  24064. 1660.70 s [algebraic-graphs] | ^^^^
  24065. 1660.70 s [algebraic-graphs]
  24066. 1660.70 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:397:21: warning: [GHC-63394] [-Wx-partial]
  24067. 1660.70 s [algebraic-graphs] In the use of ‘tail’
  24068. 1660.70 s [algebraic-graphs] (imported from Prelude, but defined in GHC.List):
  24069. 1660.70 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
  24070. 1660.70 s [algebraic-graphs] |
  24071. 1660.70 s [algebraic-graphs] 397 | bnd' = tail bnd
  24072. 1660.70 s [algebraic-graphs] | ^^^^
  24073. 1660.70 s [algebraic-graphs] [12 of 29] Compiling Algebra.Graph.Acyclic.AdjacencyMap ( src/Algebra/Graph/Acyclic/AdjacencyMap.hs, nothing )
  24074. 1660.73 s [algebraic-graphs] [13 of 29] Compiling Algebra.Graph.ToGraph ( src/Algebra/Graph/ToGraph.hs, nothing )
  24075. 1660.84 s [algebraic-graphs]
  24076. 1660.84 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:171:32: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24077. 1660.84 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24078. 1660.84 s [algebraic-graphs] will become an error in a future GHC release.
  24079. 1660.84 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24080. 1660.84 s [algebraic-graphs] |
  24081. 1660.84 s [algebraic-graphs] 171 | vertexIntSet :: ToVertex t ~ Int => t -> IntSet
  24082. 1660.84 s [algebraic-graphs] | ^
  24083. 1660.84 s [algebraic-graphs]
  24084. 1660.84 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:197:29: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24085. 1660.84 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24086. 1660.84 s [algebraic-graphs] will become an error in a future GHC release.
  24087. 1660.84 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24088. 1660.84 s [algebraic-graphs] |
  24089. 1660.84 s [algebraic-graphs] 197 | preIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  24090. 1660.84 s [algebraic-graphs] | ^
  24091. 1660.84 s [algebraic-graphs]
  24092. 1660.84 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:215:30: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24093. 1660.84 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24094. 1660.84 s [algebraic-graphs] will become an error in a future GHC release.
  24095. 1660.84 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24096. 1660.84 s [algebraic-graphs] |
  24097. 1660.84 s [algebraic-graphs] 215 | postIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  24098. 1660.84 s [algebraic-graphs] | ^
  24099. 1660.84 s [algebraic-graphs]
  24100. 1660.84 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:303:37: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24101. 1660.84 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24102. 1660.84 s [algebraic-graphs] will become an error in a future GHC release.
  24103. 1660.84 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24104. 1660.84 s [algebraic-graphs] |
  24105. 1660.84 s [algebraic-graphs] 303 | toAdjacencyIntMap :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  24106. 1660.84 s [algebraic-graphs] | ^
  24107. 1660.84 s [algebraic-graphs]
  24108. 1660.84 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:312:46: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24109. 1660.84 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24110. 1660.84 s [algebraic-graphs] will become an error in a future GHC release.
  24111. 1660.84 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24112. 1660.84 s [algebraic-graphs] |
  24113. 1660.84 s [algebraic-graphs] 312 | toAdjacencyIntMapTranspose :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  24114. 1660.85 s [algebraic-graphs] | ^
  24115. 1660.85 s [algebraic-graphs]
  24116. 1660.85 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:452:43: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24117. 1660.85 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24118. 1660.85 s [algebraic-graphs] will become an error in a future GHC release.
  24119. 1660.85 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24120. 1660.85 s [algebraic-graphs] |
  24121. 1660.85 s [algebraic-graphs] 452 | adjacencyIntMap :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  24122. 1660.85 s [algebraic-graphs] | ^
  24123. 1660.85 s [algebraic-graphs]
  24124. 1660.85 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:471:52: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24125. 1660.85 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24126. 1660.85 s [algebraic-graphs] will become an error in a future GHC release.
  24127. 1660.85 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24128. 1660.85 s [algebraic-graphs] |
  24129. 1660.85 s [algebraic-graphs] 471 | adjacencyIntMapTranspose :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  24130. 1660.85 s [algebraic-graphs] | ^
  24131. 1660.85 s [algebraic-graphs] [14 of 29] Compiling Algebra.Graph.Relation ( src/Algebra/Graph/Relation.hs, nothing )
  24132. 1660.92 s [algebraic-graphs] [15 of 29] Compiling Algebra.Graph.Relation.Symmetric ( src/Algebra/Graph/Relation/Symmetric.hs, nothing )
  24133. 1660.96 s [algebraic-graphs] [16 of 29] Compiling Algebra.Graph.NonEmpty ( src/Algebra/Graph/NonEmpty.hs, nothing )
  24134. 1661.10 s [algebraic-graphs] [17 of 29] Compiling Algebra.Graph.Labelled.AdjacencyMap ( src/Algebra/Graph/Labelled/AdjacencyMap.hs, nothing )
  24135. 1661.18 s [algebraic-graphs] [18 of 29] Compiling Algebra.Graph.Labelled ( src/Algebra/Graph/Labelled.hs, nothing )
  24136. 1661.25 s [algebraic-graphs] [19 of 29] Compiling Algebra.Graph.Labelled.Example.Network ( src/Algebra/Graph/Labelled/Example/Network.hs, nothing )
  24137. 1661.26 s [algebraic-graphs] [20 of 29] Compiling Algebra.Graph.Labelled.Example.Automaton ( src/Algebra/Graph/Labelled/Example/Automaton.hs, nothing )
  24138. 1661.27 s [algebraic-graphs] [21 of 29] Compiling Algebra.Graph.Export ( src/Algebra/Graph/Export.hs, nothing )
  24139. 1661.29 s [algebraic-graphs]
  24140. 1661.29 s [algebraic-graphs] src/Algebra/Graph/Export.hs:185:41: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24141. 1661.29 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24142. 1661.29 s [algebraic-graphs] will become an error in a future GHC release.
  24143. 1661.29 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24144. 1661.29 s [algebraic-graphs] |
  24145. 1661.29 s [algebraic-graphs] 185 | export :: (Ord a, ToGraph g, ToVertex g ~ a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
  24146. 1661.29 s [algebraic-graphs] | ^
  24147. 1661.29 s [algebraic-graphs] [22 of 29] Compiling Algebra.Graph.Export.Dot ( src/Algebra/Graph/Export/Dot.hs, nothing )
  24148. 1661.39 s [algebraic-graphs]
  24149. 1661.39 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:121:63: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24150. 1661.39 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24151. 1661.39 s [algebraic-graphs] will become an error in a future GHC release.
  24152. 1661.39 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24153. 1661.39 s [algebraic-graphs] |
  24154. 1661.39 s [algebraic-graphs] 121 | export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g ~ a) => Style a s -> g -> s
  24155. 1661.39 s [algebraic-graphs] | ^
  24156. 1661.39 s [algebraic-graphs]
  24157. 1661.39 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:165:78: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24158. 1661.39 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24159. 1661.39 s [algebraic-graphs] will become an error in a future GHC release.
  24160. 1661.39 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24161. 1661.39 s [algebraic-graphs] |
  24162. 1661.39 s [algebraic-graphs] 165 | exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g ~ s) => g -> s
  24163. 1661.39 s [algebraic-graphs] | ^
  24164. 1661.39 s [algebraic-graphs] [23 of 29] Compiling Algebra.Graph.Undirected ( src/Algebra/Graph/Undirected.hs, nothing )
  24165. 1661.45 s [algebraic-graphs] [24 of 29] Compiling Algebra.Graph.Class ( src/Algebra/Graph/Class.hs, nothing )
  24166. 1661.49 s [algebraic-graphs] [25 of 29] Compiling Algebra.Graph.Relation.Transitive ( src/Algebra/Graph/Relation/Transitive.hs, nothing )
  24167. 1661.50 s [algebraic-graphs] [26 of 29] Compiling Algebra.Graph.Relation.Reflexive ( src/Algebra/Graph/Relation/Reflexive.hs, nothing )
  24168. 1661.51 s [algebraic-graphs] [27 of 29] Compiling Algebra.Graph.Relation.Preorder ( src/Algebra/Graph/Relation/Preorder.hs, nothing )
  24169. 1661.52 s [algebraic-graphs] [28 of 29] Compiling Algebra.Graph.Example.Todo ( src/Algebra/Graph/Example/Todo.hs, nothing )
  24170. 1661.54 s [algebraic-graphs] [29 of 29] Compiling Data.Graph.Typed ( src/Data/Graph/Typed.hs, nothing )
  24171. 1661.55 s [algebraic-graphs] Haddock coverage:
  24172. 1661.56 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  24173. 1661.56 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:227:1
  24174. 1661.56 s [algebraic-graphs] * in ‘Data.Map.Internal’
  24175. 1661.56 s [algebraic-graphs] * in ‘Data.Set.Internal’
  24176. 1661.56 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24177. 1661.56 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24178. 1661.56 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:227:1
  24179. 1661.58 s [algebraic-graphs] 100% ( 58 / 58) in 'Algebra.Graph.AdjacencyMap'
  24180. 1661.58 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  24181. 1661.58 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:237:1
  24182. 1661.58 s [algebraic-graphs] * in ‘Data.IntMap.Internal’
  24183. 1661.58 s [algebraic-graphs] * in ‘Data.IntSet.Internal’
  24184. 1661.58 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24185. 1661.58 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24186. 1661.58 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyIntMap.hs:237:1
  24187. 1661.59 s [algebraic-graphs] 100% ( 56 / 56) in 'Algebra.Graph.AdjacencyIntMap'
  24188. 1661.60 s [algebraic-graphs] Warning: 'nub' is out of scope.
  24189. 1661.60 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24190. 1661.60 s [algebraic-graphs] Warning: 'sort' is out of scope.
  24191. 1661.60 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24192. 1661.60 s [algebraic-graphs] 93% ( 14 / 15) in 'Algebra.Graph.AdjacencyIntMap.Algorithm'
  24193. 1661.60 s [algebraic-graphs] Missing documentation for:
  24194. 1661.60 s [algebraic-graphs] Cycle (src/Algebra/Graph/AdjacencyIntMap/Algorithm.hs:227)
  24195. 1661.61 s [algebraic-graphs] Warning: 'List' is ambiguous. It is defined
  24196. 1661.61 s [algebraic-graphs] * at src/Algebra/Graph/Internal.hs:50:18
  24197. 1661.61 s [algebraic-graphs] * at src/Algebra/Graph/Internal.hs:50:1
  24198. 1661.61 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24199. 1661.61 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24200. 1661.61 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Internal.hs:50:1
  24201. 1661.61 s [algebraic-graphs] Warning: 'IsList' is out of scope.
  24202. 1661.61 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24203. 1661.61 s [algebraic-graphs] 100% ( 19 / 19) in 'Algebra.Graph.Internal'
  24204. 1661.61 s [algebraic-graphs] Warning: 'Context' is ambiguous. It is defined
  24205. 1661.61 s [algebraic-graphs] * at src/Algebra/Graph.hs:1400:18
  24206. 1661.61 s [algebraic-graphs] * at src/Algebra/Graph.hs:1400:1
  24207. 1661.61 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24208. 1661.61 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24209. 1661.61 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph.hs:1400:1
  24210. 1661.62 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  24211. 1661.62 s [algebraic-graphs] * at src/Algebra/Graph.hs:316:1
  24212. 1661.62 s [algebraic-graphs] * in ‘Data.Set.Internal’
  24213. 1661.62 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24214. 1661.62 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24215. 1661.62 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph.hs:316:1
  24216. 1661.63 s [algebraic-graphs] 100% ( 61 / 61) in 'Algebra.Graph'
  24217. 1661.63 s [algebraic-graphs] Warning: 'mplus' is out of scope.
  24218. 1661.63 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24219. 1661.63 s [algebraic-graphs] Warning: 'vertexCount' is out of scope.
  24220. 1661.63 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24221. 1661.63 s [algebraic-graphs] Warning: 'hasVertex' is out of scope.
  24222. 1661.63 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24223. 1661.63 s [algebraic-graphs] Warning: 'vertexSet' is out of scope.
  24224. 1661.63 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24225. 1661.63 s [algebraic-graphs] Warning: 'isEmpty' is out of scope.
  24226. 1661.63 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24227. 1661.64 s [algebraic-graphs] Warning: 'edgeList' is out of scope.
  24228. 1661.64 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24229. 1661.64 s [algebraic-graphs] Warning: 'adjacencyList' is out of scope.
  24230. 1661.64 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24231. 1661.64 s [algebraic-graphs] Warning: 'box' is out of scope.
  24232. 1661.64 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24233. 1661.64 s [algebraic-graphs] Warning: 'edgeCount' is out of scope.
  24234. 1661.64 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24235. 1661.64 s [algebraic-graphs] 100% ( 42 / 42) in 'Algebra.Graph.HigherKinded.Class'
  24236. 1661.65 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  24237. 1661.65 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
  24238. 1661.65 s [algebraic-graphs] * in ‘Data.Map.Internal’
  24239. 1661.65 s [algebraic-graphs] * in ‘Data.Set.Internal’
  24240. 1661.65 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24241. 1661.65 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24242. 1661.65 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
  24243. 1661.65 s [algebraic-graphs] Warning: 'nub' is out of scope.
  24244. 1661.65 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24245. 1661.66 s [algebraic-graphs] Warning: 'swap' is ambiguous. It is defined
  24246. 1661.66 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:418:1
  24247. 1661.66 s [algebraic-graphs] * in ‘Data.Tuple’
  24248. 1661.66 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24249. 1661.66 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24250. 1661.66 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:418:1
  24251. 1661.66 s [algebraic-graphs] 100% ( 63 / 63) in 'Algebra.Graph.Bipartite.AdjacencyMap'
  24252. 1661.67 s [algebraic-graphs] Warning: 'isRight' is out of scope.
  24253. 1661.67 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24254. 1661.72 s [algebraic-graphs] Warning: 'Matching' is ambiguous. It is defined
  24255. 1661.72 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs:169:21
  24256. 1661.72 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs:169:1
  24257. 1661.72 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24258. 1661.72 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24259. 1661.72 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs:169:1
  24260. 1661.72 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  24261. 1661.72 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
  24262. 1661.72 s [algebraic-graphs] * in ‘Data.Set.Internal’
  24263. 1661.72 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24264. 1661.72 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24265. 1661.72 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
  24266. 1661.73 s [algebraic-graphs] 100% ( 25 / 25) in 'Algebra.Graph.Bipartite.AdjacencyMap.Algorithm'
  24267. 1661.73 s [algebraic-graphs] Warning: 'Optimum' is ambiguous. It is defined
  24268. 1661.73 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:442:20
  24269. 1661.73 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:442:1
  24270. 1661.73 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24271. 1661.73 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24272. 1661.73 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:442:1
  24273. 1661.73 s [algebraic-graphs] Warning: 'Distance' is ambiguous. It is defined
  24274. 1661.73 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:241:22
  24275. 1661.73 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:241:1
  24276. 1661.73 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24277. 1661.73 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24278. 1661.73 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:241:1
  24279. 1661.73 s [algebraic-graphs] Warning: 'Minimum' is ambiguous. It is defined
  24280. 1661.73 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:314:21
  24281. 1661.73 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:314:1
  24282. 1661.73 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24283. 1661.73 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24284. 1661.73 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:314:1
  24285. 1661.73 s [algebraic-graphs] Warning: 'Capacity' is ambiguous. It is defined
  24286. 1661.73 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:176:22
  24287. 1661.73 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:176:1
  24288. 1661.73 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24289. 1661.73 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24290. 1661.73 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:176:1
  24291. 1661.73 s [algebraic-graphs] Warning: 'Count' is ambiguous. It is defined
  24292. 1661.73 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:209:19
  24293. 1661.73 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:209:1
  24294. 1661.73 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24295. 1661.73 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24296. 1661.73 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:209:1
  24297. 1661.73 s [algebraic-graphs] 100% ( 37 / 37) in 'Algebra.Graph.Label'
  24298. 1661.74 s [algebraic-graphs] Warning: 'AdjacencyMap' is ambiguous. It is defined
  24299. 1661.74 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:157:1
  24300. 1661.74 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:152:1
  24301. 1661.74 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24302. 1661.74 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24303. 1661.74 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:152:1
  24304. 1661.74 s [algebraic-graphs] Warning: 'isEmpty' is out of scope.
  24305. 1661.74 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24306. 1661.74 s [algebraic-graphs] Warning: 'empty' is out of scope.
  24307. 1661.74 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24308. 1661.74 s [algebraic-graphs] Warning: 'vertexList' is out of scope.
  24309. 1661.74 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24310. 1661.74 s [algebraic-graphs] Warning: 'edges' is out of scope.
  24311. 1661.74 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24312. 1661.74 s [algebraic-graphs] Warning: 'adjacencyList' is out of scope.
  24313. 1661.74 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24314. 1661.75 s [algebraic-graphs] Warning: 'stars' is out of scope.
  24315. 1661.75 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24316. 1661.75 s [algebraic-graphs] 100% ( 51 / 51) in 'Algebra.Graph.NonEmpty.AdjacencyMap'
  24317. 1661.75 s [algebraic-graphs] Warning: 'nub' is out of scope.
  24318. 1661.75 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24319. 1661.75 s [algebraic-graphs] Warning: 'sort' is out of scope.
  24320. 1661.75 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24321. 1661.76 s [algebraic-graphs] Warning: 'vertex' is ambiguous. It is defined
  24322. 1661.76 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:239:1
  24323. 1661.76 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:224:1
  24324. 1661.76 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24325. 1661.76 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24326. 1661.76 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:224:1
  24327. 1661.76 s [algebraic-graphs] Warning: 'edge' is ambiguous. It is defined
  24328. 1661.76 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:252:1
  24329. 1661.76 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:237:1
  24330. 1661.76 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24331. 1661.76 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24332. 1661.76 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:237:1
  24333. 1661.76 s [algebraic-graphs] 93% ( 15 / 16) in 'Algebra.Graph.AdjacencyMap.Algorithm'
  24334. 1661.76 s [algebraic-graphs] Missing documentation for:
  24335. 1661.76 s [algebraic-graphs] Cycle (src/Algebra/Graph/AdjacencyMap/Algorithm.hs:228)
  24336. 1661.76 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  24337. 1661.76 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:132:1
  24338. 1661.76 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:227:1
  24339. 1661.76 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24340. 1661.76 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24341. 1661.76 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:227:1
  24342. 1661.76 s [algebraic-graphs] Warning: 'vertex' is ambiguous. It is defined
  24343. 1661.76 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:143:1
  24344. 1661.76 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:239:1
  24345. 1661.76 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24346. 1661.76 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24347. 1661.76 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:239:1
  24348. 1661.76 s [algebraic-graphs] Warning: 'vertexCount' is ambiguous. It is defined
  24349. 1661.76 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:246:1
  24350. 1661.76 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:417:1
  24351. 1661.76 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24352. 1661.76 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24353. 1661.76 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:417:1
  24354. 1661.76 s [algebraic-graphs] Warning: 'edgeCount' is ambiguous. It is defined
  24355. 1661.76 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:258:1
  24356. 1661.76 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:429:1
  24357. 1661.76 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24358. 1661.76 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24359. 1661.76 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:429:1
  24360. 1661.77 s [algebraic-graphs] Warning: 'vertices' is ambiguous. It is defined
  24361. 1661.77 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:157:1
  24362. 1661.77 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:309:1
  24363. 1661.77 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24364. 1661.77 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24365. 1661.77 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:309:1
  24366. 1661.77 s [algebraic-graphs] 100% ( 44 / 44) in 'Algebra.Graph.Acyclic.AdjacencyMap'
  24367. 1661.77 s [algebraic-graphs] Warning: 'foldg' is ambiguous. It is defined
  24368. 1661.77 s [algebraic-graphs] * at src/Algebra/Graph.hs:482:1
  24369. 1661.77 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:98:5
  24370. 1661.77 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24371. 1661.77 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24372. 1661.77 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:98:5
  24373. 1661.78 s [algebraic-graphs] 100% ( 8 / 8) in 'Algebra.Graph.ToGraph'
  24374. 1661.78 s [algebraic-graphs] Warning: 'Relation' is ambiguous. It is defined
  24375. 1661.78 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:157:19
  24376. 1661.78 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:157:1
  24377. 1661.78 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24378. 1661.78 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24379. 1661.78 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:157:1
  24380. 1661.78 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  24381. 1661.78 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:243:1
  24382. 1661.78 s [algebraic-graphs] * in ‘Data.Set.Internal’
  24383. 1661.78 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24384. 1661.78 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24385. 1661.78 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:243:1
  24386. 1661.79 s [algebraic-graphs] Warning: 'AdjacencyMap' is out of scope.
  24387. 1661.79 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24388. 1661.79 s [algebraic-graphs] 100% ( 56 / 56) in 'Algebra.Graph.Relation'
  24389. 1661.79 s [algebraic-graphs] Warning: 'vertexCount' is ambiguous. It is defined
  24390. 1661.79 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:423:1
  24391. 1661.79 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:372:1
  24392. 1661.79 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24393. 1661.79 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24394. 1661.79 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:372:1
  24395. 1661.79 s [algebraic-graphs] Warning: 'edgeCount' is ambiguous. It is defined
  24396. 1661.79 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:435:1
  24397. 1661.79 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:384:1
  24398. 1661.79 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24399. 1661.79 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24400. 1661.79 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:384:1
  24401. 1661.80 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  24402. 1661.80 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:188:1
  24403. 1661.80 s [algebraic-graphs] * in ‘Data.Set.Internal’
  24404. 1661.80 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24405. 1661.80 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24406. 1661.80 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:188:1
  24407. 1661.81 s [algebraic-graphs] 100% ( 48 / 48) in 'Algebra.Graph.Relation.Symmetric'
  24408. 1661.81 s [algebraic-graphs] Warning: 'vertexList' is out of scope.
  24409. 1661.81 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24410. 1661.82 s [algebraic-graphs] 100% ( 53 / 53) in 'Algebra.Graph.NonEmpty'
  24411. 1661.83 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  24412. 1661.83 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:160:1
  24413. 1661.83 s [algebraic-graphs] * in ‘Data.Map.Internal’
  24414. 1661.83 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24415. 1661.83 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24416. 1661.83 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:160:1
  24417. 1661.83 s [algebraic-graphs] Warning: 'hasEdge' is ambiguous. It is defined
  24418. 1661.83 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:403:1
  24419. 1661.83 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:379:1
  24420. 1661.83 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24421. 1661.83 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24422. 1661.83 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:379:1
  24423. 1661.84 s [algebraic-graphs] 100% ( 49 / 49) in 'Algebra.Graph.Labelled.AdjacencyMap'
  24424. 1661.84 s [algebraic-graphs] Warning: 'Context' is ambiguous. It is defined
  24425. 1661.84 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:675:20
  24426. 1661.84 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:675:1
  24427. 1661.84 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24428. 1661.84 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24429. 1661.84 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled.hs:675:1
  24430. 1661.84 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  24431. 1661.84 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:191:1
  24432. 1661.84 s [algebraic-graphs] * in ‘Data.Set.Internal’
  24433. 1661.84 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24434. 1661.84 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24435. 1661.84 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled.hs:191:1
  24436. 1661.85 s [algebraic-graphs] Warning: 'Focus' is ambiguous. It is defined
  24437. 1661.85 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:642:18
  24438. 1661.85 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:642:1
  24439. 1661.85 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24440. 1661.85 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24441. 1661.85 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled.hs:642:1
  24442. 1661.85 s [algebraic-graphs] 100% ( 49 / 49) in 'Algebra.Graph.Labelled'
  24443. 1661.85 s [algebraic-graphs] 100% ( 6 / 6) in 'Algebra.Graph.Labelled.Example.Network'
  24444. 1661.85 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Labelled.Example.Automaton'
  24445. 1661.85 s [algebraic-graphs] Warning: 'Doc' is ambiguous. It is defined
  24446. 1661.85 s [algebraic-graphs] * at src/Algebra/Graph/Export.hs:57:17
  24447. 1661.85 s [algebraic-graphs] * at src/Algebra/Graph/Export.hs:57:1
  24448. 1661.85 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24449. 1661.85 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24450. 1661.85 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Export.hs:57:1
  24451. 1661.86 s [algebraic-graphs] 100% ( 14 / 14) in 'Algebra.Graph.Export'
  24452. 1661.86 s [algebraic-graphs] Warning: 'Style' is ambiguous. It is defined
  24453. 1661.86 s [algebraic-graphs] * at src/Algebra/Graph/Export/Dot.hs:49:18
  24454. 1661.86 s [algebraic-graphs] * at src/Algebra/Graph/Export/Dot.hs:49:1
  24455. 1661.86 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24456. 1661.86 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24457. 1661.86 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Export/Dot.hs:49:1
  24458. 1661.86 s [algebraic-graphs] Warning: 'Graph' is out of scope.
  24459. 1661.86 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24460. 1661.86 s [algebraic-graphs] 100% ( 11 / 11) in 'Algebra.Graph.Export.Dot'
  24461. 1661.87 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  24462. 1661.87 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:253:1
  24463. 1661.87 s [algebraic-graphs] * in ‘Data.Set.Internal’
  24464. 1661.87 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24465. 1661.87 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24466. 1661.87 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:253:1
  24467. 1661.88 s [algebraic-graphs] 100% ( 50 / 50) in 'Algebra.Graph.Undirected'
  24468. 1661.88 s [algebraic-graphs] 100% ( 27 / 27) in 'Algebra.Graph.Class'
  24469. 1661.88 s [algebraic-graphs] Warning: 'TransitiveRelation' is ambiguous. It is defined
  24470. 1661.88 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Transitive.hs:39:32
  24471. 1661.88 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Transitive.hs:39:1
  24472. 1661.88 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24473. 1661.88 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24474. 1661.88 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Transitive.hs:39:1
  24475. 1661.88 s [algebraic-graphs] Warning: 'Transitive' is out of scope.
  24476. 1661.88 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24477. 1661.88 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Transitive'
  24478. 1661.88 s [algebraic-graphs] Warning: 'ReflexiveRelation' is ambiguous. It is defined
  24479. 1661.88 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Reflexive.hs:34:31
  24480. 1661.88 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Reflexive.hs:34:1
  24481. 1661.88 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24482. 1661.88 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24483. 1661.88 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Reflexive.hs:34:1
  24484. 1661.88 s [algebraic-graphs] Warning: 'Reflexive' is out of scope.
  24485. 1661.88 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24486. 1661.89 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Reflexive'
  24487. 1661.89 s [algebraic-graphs] Warning: 'PreorderRelation' is ambiguous. It is defined
  24488. 1661.89 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Preorder.hs:44:30
  24489. 1661.89 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Preorder.hs:44:1
  24490. 1661.89 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24491. 1661.89 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24492. 1661.89 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Preorder.hs:44:1
  24493. 1661.89 s [algebraic-graphs] Warning: 'Preorder' is out of scope.
  24494. 1661.89 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24495. 1661.89 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Preorder'
  24496. 1661.89 s [algebraic-graphs] 0% ( 0 / 8) in 'Algebra.Graph.Example.Todo'
  24497. 1661.89 s [algebraic-graphs] Missing documentation for:
  24498. 1661.89 s [algebraic-graphs] Module header
  24499. 1661.89 s [algebraic-graphs] Todo (src/Algebra/Graph/Example/Todo.hs:13)
  24500. 1661.89 s [algebraic-graphs] todo (src/Algebra/Graph/Example/Todo.hs:42)
  24501. 1661.89 s [algebraic-graphs] low (src/Algebra/Graph/Example/Todo.hs:23)
  24502. 1661.89 s [algebraic-graphs] high (src/Algebra/Graph/Example/Todo.hs:27)
  24503. 1661.89 s [algebraic-graphs] ~*~ (src/Algebra/Graph/Example/Todo.hs:35)
  24504. 1661.89 s [algebraic-graphs] >*< (src/Algebra/Graph/Example/Todo.hs:39)
  24505. 1661.89 s [algebraic-graphs] priority (src/Algebra/Graph/Example/Todo.hs:31)
  24506. 1661.89 s [algebraic-graphs] Warning: 'GraphKL' is ambiguous. It is defined
  24507. 1661.89 s [algebraic-graphs] * at src/Data/Graph/Typed.hs:40:18
  24508. 1661.89 s [algebraic-graphs] * at src/Data/Graph/Typed.hs:40:1
  24509. 1661.89 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24510. 1661.89 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24511. 1661.89 s [algebraic-graphs] Defaulting to the one defined at src/Data/Graph/Typed.hs:40:1
  24512. 1661.89 s [algebraic-graphs] Warning: 'array' is out of scope.
  24513. 1661.89 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24514. 1661.89 s [algebraic-graphs] 90% ( 10 / 11) in 'Data.Graph.Typed'
  24515. 1661.89 s [algebraic-graphs] Missing documentation for:
  24516. 1661.89 s [algebraic-graphs] scc (src/Data/Graph/Typed.hs:192)
  24517. 1662.26 s [algebraic-graphs] Warning: Algebra.Graph.AdjacencyMap: could not find link destinations for:
  24518. 1662.26 s [algebraic-graphs] - Algebra.Graph.AdjacencyMap.Rep_AdjacencyMap
  24519. 1662.26 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap0
  24520. 1662.26 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyMap0
  24521. 1662.26 s [algebraic-graphs] Warning: Algebra.Graph.AdjacencyIntMap: could not find link destinations for:
  24522. 1662.26 s [algebraic-graphs] - Algebra.Graph.AdjacencyIntMap.Rep_AdjacencyIntMap
  24523. 1662.26 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyIntMap
  24524. 1662.26 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyIntMap
  24525. 1662.26 s [algebraic-graphs] Warning: Algebra.Graph.Internal: could not find link destinations for:
  24526. 1662.26 s [algebraic-graphs] - Algebra.Graph.Internal.D:R:ItemList
  24527. 1662.27 s [algebraic-graphs] Warning: Algebra.Graph: could not find link destinations for:
  24528. 1662.27 s [algebraic-graphs] - Algebra.Graph.Rep_Graph
  24529. 1662.27 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexGraph
  24530. 1662.27 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph1
  24531. 1662.28 s [algebraic-graphs] Warning: Algebra.Graph.Bipartite.AdjacencyMap: could not find link destinations for:
  24532. 1662.28 s [algebraic-graphs] - Algebra.Graph.Bipartite.AdjacencyMap.D:R:ItemList
  24533. 1662.28 s [algebraic-graphs] - Algebra.Graph.Bipartite.AdjacencyMap.Rep_List
  24534. 1662.28 s [algebraic-graphs] - Algebra.Graph.Bipartite.AdjacencyMap.Rep_AdjacencyMap
  24535. 1662.28 s [algebraic-graphs] Warning: Algebra.Graph.Bipartite.AdjacencyMap.Algorithm: could not find link destinations for:
  24536. 1662.28 s [algebraic-graphs] - Algebra.Graph.Bipartite.AdjacencyMap.Algorithm.Rep_Matching
  24537. 1662.29 s [algebraic-graphs] Warning: Algebra.Graph.Label: could not find link destinations for:
  24538. 1662.29 s [algebraic-graphs] - Algebra.Graph.Label.D:R:ItemMinimum
  24539. 1662.29 s [algebraic-graphs] - Algebra.Graph.Label.D:R:ItemLabel
  24540. 1662.29 s [algebraic-graphs] Warning: Algebra.Graph.NonEmpty.AdjacencyMap: could not find link destinations for:
  24541. 1662.29 s [algebraic-graphs] - Algebra.Graph.NonEmpty.AdjacencyMap.Rep_AdjacencyMap
  24542. 1662.29 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap
  24543. 1662.30 s [algebraic-graphs] Warning: Algebra.Graph.ToGraph: could not find link destinations for:
  24544. 1662.30 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap
  24545. 1662.30 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyIntMap
  24546. 1662.30 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap0
  24547. 1662.30 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexGraph
  24548. 1662.30 s [algebraic-graphs] - Algebra.Graph.Relation.D:R:ToVertexRelation
  24549. 1662.30 s [algebraic-graphs] - Algebra.Graph.Relation.Symmetric.D:R:ToVertexRelation
  24550. 1662.30 s [algebraic-graphs] - Algebra.Graph.NonEmpty.D:R:ToVertexGraph
  24551. 1662.30 s [algebraic-graphs] - Algebra.Graph.Labelled.AdjacencyMap.D:R:ToVertexAdjacencyMap
  24552. 1662.30 s [algebraic-graphs] - Algebra.Graph.Labelled.D:R:ToVertexGraph
  24553. 1662.30 s [algebraic-graphs] Warning: Algebra.Graph.Relation: could not find link destinations for:
  24554. 1662.31 s [algebraic-graphs] - Algebra.Graph.Relation.D:R:ToVertexRelation
  24555. 1662.31 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexRelation0
  24556. 1662.31 s [algebraic-graphs] Warning: Algebra.Graph.Relation.Symmetric: could not find link destinations for:
  24557. 1662.31 s [algebraic-graphs] - Algebra.Graph.Relation.Symmetric.D:R:ToVertexRelation
  24558. 1662.31 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexRelation
  24559. 1662.31 s [algebraic-graphs] Warning: Algebra.Graph.NonEmpty: could not find link destinations for:
  24560. 1662.31 s [algebraic-graphs] - Algebra.Graph.NonEmpty.D:R:ToVertexGraph
  24561. 1662.32 s [algebraic-graphs] Warning: Algebra.Graph.Labelled.AdjacencyMap: could not find link destinations for:
  24562. 1662.32 s [algebraic-graphs] - Algebra.Graph.Labelled.AdjacencyMap.D:R:ToVertexAdjacencyMap
  24563. 1662.32 s [algebraic-graphs] - Algebra.Graph.Labelled.AdjacencyMap.Rep_AdjacencyMap
  24564. 1662.32 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyMap
  24565. 1662.32 s [algebraic-graphs] Warning: Algebra.Graph.Labelled: could not find link destinations for:
  24566. 1662.32 s [algebraic-graphs] - Algebra.Graph.Labelled.D:R:ToVertexGraph
  24567. 1662.32 s [algebraic-graphs] - Algebra.Graph.Labelled.Rep_Graph
  24568. 1662.32 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph
  24569. 1662.33 s [algebraic-graphs] Warning: Algebra.Graph.Undirected: could not find link destinations for:
  24570. 1662.33 s [algebraic-graphs] - Algebra.Graph.Undirected.Rep_Graph
  24571. 1662.33 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph0
  24572. 1662.33 s [algebraic-graphs] Warning: Algebra.Graph.Class: could not find link destinations for:
  24573. 1662.33 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexTuple3
  24574. 1662.33 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexTuple2
  24575. 1662.33 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexFUN
  24576. 1662.33 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexMaybe
  24577. 1662.33 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexUnit
  24578. 1662.33 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexRelation
  24579. 1662.33 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexRelation0
  24580. 1662.33 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyMap
  24581. 1662.33 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph
  24582. 1662.33 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyIntMap
  24583. 1662.33 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyMap0
  24584. 1662.33 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph0
  24585. 1662.33 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph1
  24586. 1662.33 s [algebraic-graphs] - Algebra.Graph.Relation.Transitive.D:R:VertexTransitiveRelation
  24587. 1662.33 s [algebraic-graphs] - Algebra.Graph.Relation.Reflexive.D:R:VertexReflexiveRelation
  24588. 1662.33 s [algebraic-graphs] - Algebra.Graph.Relation.Preorder.D:R:VertexPreorderRelation
  24589. 1662.33 s [algebraic-graphs] - Algebra.Graph.Example.Todo.D:R:VertexTodo
  24590. 1662.33 s [algebraic-graphs] Warning: Algebra.Graph.Relation.Transitive: could not find link destinations for:
  24591. 1662.33 s [algebraic-graphs] - Algebra.Graph.Relation.Transitive.D:R:VertexTransitiveRelation
  24592. 1662.33 s [algebraic-graphs] Warning: Algebra.Graph.Relation.Reflexive: could not find link destinations for:
  24593. 1662.33 s [algebraic-graphs] - Algebra.Graph.Relation.Reflexive.D:R:VertexReflexiveRelation
  24594. 1662.33 s [algebraic-graphs] Warning: Algebra.Graph.Relation.Preorder: could not find link destinations for:
  24595. 1662.33 s [algebraic-graphs] - Algebra.Graph.Relation.Preorder.D:R:VertexPreorderRelation
  24596. 1662.33 s [algebraic-graphs] Warning: Algebra.Graph.Example.Todo: could not find link destinations for:
  24597. 1662.33 s [algebraic-graphs] - Algebra.Graph.Example.Todo.D:R:VertexTodo
  24598. 1665.33 s [algebraic-graphs] Documentation created: dist/doc/html/algebraic-graphs/,
  24599. 1665.48 s [algebraic-graphs] dist/doc/html/algebraic-graphs/algebraic-graphs.txt
  24600. 1665.48 s [algebraic-graphs] Preprocessing test suite 'main' for algebraic-graphs-0.7..
  24601. 1665.48 s [algebraic-graphs] Phase: installPhase
  24602. 1665.48 s [algebraic-graphs] Installing library in /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/algebraic-graphs-0.7-FivNbIKLMvMFivhqM96Qyy
  24603. 1666.20 s [algebraic-graphs] Phase: fixupPhase
  24604. 1666.22 s [algebraic-graphs] shrinking RPATHs of ELF executables and libraries in /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7
  24605. 1666.25 s [algebraic-graphs] shrinking /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/libHSalgebraic-graphs-0.7-FivNbIKLMvMFivhqM96Qyy-ghc9.8.4.so
  24606. 1666.25 s [algebraic-graphs] checking for references to /build/ in /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7...
  24607. 1666.29 s [algebraic-graphs] patching script interpreter paths in /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7
  24608. 1666.30 s [algebraic-graphs] stripping (with command strip and flags -S -p) in /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7/lib
  24609. 1666.58 s [algebraic-graphs] shrinking RPATHs of ELF executables and libraries in /nix/store/791bmb2szx0fs4lnydlqh9rsmp0r0fgb-algebraic-graphs-0.7-doc
  24610. 1666.61 s [algebraic-graphs] checking for references to /build/ in /nix/store/791bmb2szx0fs4lnydlqh9rsmp0r0fgb-algebraic-graphs-0.7-doc...
  24611. 1666.64 s [algebraic-graphs] patching script interpreter paths in /nix/store/791bmb2szx0fs4lnydlqh9rsmp0r0fgb-algebraic-graphs-0.7-doc
  24612. 1666.81 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/791bmb2szx0fs4lnydlqh9rsmp0r0fgb-algebraic-graphs-0.7-doc /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7
  24613. 1667.36 s [post-build-hook] Nothing to push - all store paths are already on Cachix.
  24614. 1667.38 s [post-build-hook] Uploading to the NixCI cache: /nix/store/791bmb2szx0fs4lnydlqh9rsmp0r0fgb-algebraic-graphs-0.7-doc /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7
  24615. 1667.42 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24616. 1667.54 s [post-build-hook] copying 1 paths...
  24617. 1667.54 s [post-build-hook] copying path '/nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7' to 'https://cache.nix-ci.com'...
  24618. 1673.46 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24619. 1673.60 s [post-build-hook] copying 0 paths...
  24620. 1673.62 s Progress: 14 of 19 built, 160 of 160 downloaded from cache
  24621. 1673.68 s Building algebraic-graph-duoids
  24622. 1673.85 s [algebraic-graph-duoids] Phase: setupCompilerEnvironmentPhase
  24623. 1673.85 s [algebraic-graph-duoids] Build with /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4.
  24624. 1674.10 s [algebraic-graph-duoids] Phase: unpackPhase
  24625. 1674.10 s [algebraic-graph-duoids] unpacking source archive /nix/store/hwhxlh4aq4w3fvrlk65js3cdkm3in22k-5y8mzl3igbd7qyrpb010fqiak50k5q01-source/./algebraic-graphs
  24626. 1674.11 s [algebraic-graph-duoids] source root is algebraic-graphs
  24627. 1674.12 s [algebraic-graph-duoids] Phase: patchPhase
  24628. 1674.13 s [algebraic-graph-duoids] Phase: compileBuildDriverPhase
  24629. 1674.13 s [algebraic-graph-duoids] setupCompileFlags: -package-db=/build/tmp.CQ5eI9DDnW/setup-package.conf.d -threaded
  24630. 1674.19 s [algebraic-graph-duoids] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.CQ5eI9DDnW/Main.o )
  24631. 1674.31 s [algebraic-graph-duoids] [2 of 2] Linking Setup
  24632. 1675.99 s [algebraic-graph-duoids] Phase: updateAutotoolsGnuConfigScriptsPhase
  24633. 1676.00 s [algebraic-graph-duoids] Phase: configurePhase
  24634. 1676.01 s [algebraic-graph-duoids] configureFlags: --verbose --prefix=/nix/store/x02gyjl787h1z297zj6pfagvbxsmwry7-algebraic-graph-duoids-0.0.1.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/25291ab39v3ik1scwrx3w793zap6ph9m-algebraic-graph-duoids-0.0.1.0-doc/share/doc/algebraic-graph-duoids-0.0.1.0 --with-gcc=gcc --package-db=/build/tmp.CQ5eI9DDnW/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --ghc-options=-Werror --extra-lib-dirs=/nix/store/xp8g8298vbm4k9ipj14xf1r4rh899hr4-ncurses-6.5/lib --extra-lib-dirs=/nix/store/wxm6pczq28ppr7ffwclsl6njbzzr48zf-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/3f0hp921ncxr249f5lmspc8silkqr8f7-elfutils-0.194/lib --extra-lib-dirs=/nix/store/km81slwkcc82dbwywl10gpffjb78g6ni-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/fvsl0b39y6ns2z66gfvc2raca3b5wr18-numactl-2.0.18/lib --extra-lib-dirs=/nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/lib
  24635. 1676.02 s [algebraic-graph-duoids] Using Parsec parser
  24636. 1676.02 s [algebraic-graph-duoids] Configuring algebraic-graph-duoids-0.0.1.0...
  24637. 1676.34 s [algebraic-graph-duoids] Flags chosen: lint=False, noisy-deprecations=True
  24638. 1676.60 s [algebraic-graph-duoids] Dependency algebraic-graphs >=0.6.1 && <0.8: using algebraic-graphs-0.7
  24639. 1676.60 s [algebraic-graph-duoids] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  24640. 1676.60 s [algebraic-graph-duoids] >=4.21.0 && <4.22 || >=4.22.0 && <4.23: using base-4.19.2.0
  24641. 1676.60 s [algebraic-graph-duoids] Dependency duoids >=0.0.1 && <0.1: using duoids-0.0.1.0
  24642. 1676.60 s [algebraic-graph-duoids] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  24643. 1676.60 s [algebraic-graph-duoids] Dependency algebraic-graph-duoids: using algebraic-graph-duoids-0.0.1.0
  24644. 1676.60 s [algebraic-graph-duoids] Dependency algebraic-graphs >=0.6.1 && <0.8: using algebraic-graphs-0.7
  24645. 1676.60 s [algebraic-graph-duoids] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  24646. 1676.60 s [algebraic-graph-duoids] >=4.21.0 && <4.22 || >=4.22.0 && <4.23: using base-4.19.2.0
  24647. 1676.60 s [algebraic-graph-duoids] Dependency duoids-hedgehog >=0.0.1 && <0.1: using duoids-hedgehog-0.0.1.0
  24648. 1676.60 s [algebraic-graph-duoids] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  24649. 1676.60 s [algebraic-graph-duoids] Dependency hedgehog >=1.2 && <1.3 || >=1.4 && <1.6 || >=1.7 && <1.8: using
  24650. 1676.60 s [algebraic-graph-duoids] hedgehog-1.5
  24651. 1676.60 s [algebraic-graph-duoids] Dependency algebraic-graph-duoids: using algebraic-graph-duoids-0.0.1.0
  24652. 1676.60 s [algebraic-graph-duoids] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  24653. 1676.60 s [algebraic-graph-duoids] >=4.21.0 && <4.22 || >=4.22.0 && <4.23: using base-4.19.2.0
  24654. 1676.60 s [algebraic-graph-duoids] Dependency doctest >=0.21.1 && <0.22 || >=0.22.6 && <0.23 || >=0.24.0 &&
  24655. 1676.60 s [algebraic-graph-duoids] <0.25: using doctest-0.24.2
  24656. 1676.60 s [algebraic-graph-duoids] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  24657. 1676.60 s [algebraic-graph-duoids] Source component graph:
  24658. 1676.60 s [algebraic-graph-duoids] component lib
  24659. 1676.60 s [algebraic-graph-duoids] component test:doctests dependency lib
  24660. 1676.60 s [algebraic-graph-duoids] component test:laws dependency lib
  24661. 1676.60 s [algebraic-graph-duoids] Configured component graph:
  24662. 1676.60 s [algebraic-graph-duoids] component algebraic-graph-duoids-0.0.1.0-BzWqxFjHi74EdmthmWG9bk
  24663. 1676.60 s [algebraic-graph-duoids] include algebraic-graphs-0.7-FivNbIKLMvMFivhqM96Qyy
  24664. 1676.60 s [algebraic-graph-duoids] include base-4.19.2.0-a4d2
  24665. 1676.60 s [algebraic-graph-duoids] include duoids-0.0.1.0-HGVxlGiTGubJau1PjiOPQY
  24666. 1676.60 s [algebraic-graph-duoids] include ghc-compat-plugin-0.1.0.1-7MjAExeaX6DEMyHCY8avBD
  24667. 1676.60 s [algebraic-graph-duoids] component algebraic-graph-duoids-0.0.1.0-5WoiHTqiIOs9Z7wGzt8lv4-doctests
  24668. 1676.60 s [algebraic-graph-duoids] include algebraic-graph-duoids-0.0.1.0-BzWqxFjHi74EdmthmWG9bk
  24669. 1676.60 s [algebraic-graph-duoids] include base-4.19.2.0-a4d2
  24670. 1676.60 s [algebraic-graph-duoids] include doctest-0.24.2-7CW3VAqweMx6JNSdbfXAyp
  24671. 1676.60 s [algebraic-graph-duoids] include ghc-compat-plugin-0.1.0.1-7MjAExeaX6DEMyHCY8avBD
  24672. 1676.60 s [algebraic-graph-duoids] component algebraic-graph-duoids-0.0.1.0-7pLfsqOJOmU4EVefsbEW2Z-laws
  24673. 1676.60 s [algebraic-graph-duoids] include algebraic-graph-duoids-0.0.1.0-BzWqxFjHi74EdmthmWG9bk
  24674. 1676.60 s [algebraic-graph-duoids] include algebraic-graphs-0.7-FivNbIKLMvMFivhqM96Qyy
  24675. 1676.60 s [algebraic-graph-duoids] include base-4.19.2.0-a4d2
  24676. 1676.60 s [algebraic-graph-duoids] include duoids-hedgehog-0.0.1.0-DNfhlYCCG6pCyVz8JVxsPH
  24677. 1676.60 s [algebraic-graph-duoids] include ghc-compat-plugin-0.1.0.1-7MjAExeaX6DEMyHCY8avBD
  24678. 1676.60 s [algebraic-graph-duoids] include hedgehog-1.5-I61WWSEyWWs9b1Ow8jewYT
  24679. 1676.60 s [algebraic-graph-duoids] Linked component graph:
  24680. 1676.60 s [algebraic-graph-duoids] unit algebraic-graph-duoids-0.0.1.0-BzWqxFjHi74EdmthmWG9bk
  24681. 1676.60 s [algebraic-graph-duoids] include algebraic-graphs-0.7-FivNbIKLMvMFivhqM96Qyy
  24682. 1676.60 s [algebraic-graph-duoids] include base-4.19.2.0-a4d2
  24683. 1676.60 s [algebraic-graph-duoids] include duoids-0.0.1.0-HGVxlGiTGubJau1PjiOPQY
  24684. 1676.60 s [algebraic-graph-duoids] include ghc-compat-plugin-0.1.0.1-7MjAExeaX6DEMyHCY8avBD
  24685. 1676.60 s [algebraic-graph-duoids] Algebra.Graph.Duoid=algebraic-graph-duoids-0.0.1.0-BzWqxFjHi74EdmthmWG9bk:Algebra.Graph.Duoid,Algebra.Graph.Duoid.Orphans=algebraic-graph-duoids-0.0.1.0-BzWqxFjHi74EdmthmWG9bk:Algebra.Graph.Duoid.Orphans
  24686. 1676.60 s [algebraic-graph-duoids] unit algebraic-graph-duoids-0.0.1.0-5WoiHTqiIOs9Z7wGzt8lv4-doctests
  24687. 1676.60 s [algebraic-graph-duoids] include algebraic-graph-duoids-0.0.1.0-BzWqxFjHi74EdmthmWG9bk
  24688. 1676.60 s [algebraic-graph-duoids] include base-4.19.2.0-a4d2
  24689. 1676.60 s [algebraic-graph-duoids] include doctest-0.24.2-7CW3VAqweMx6JNSdbfXAyp
  24690. 1676.60 s [algebraic-graph-duoids] include ghc-compat-plugin-0.1.0.1-7MjAExeaX6DEMyHCY8avBD
  24691. 1676.60 s [algebraic-graph-duoids] unit algebraic-graph-duoids-0.0.1.0-7pLfsqOJOmU4EVefsbEW2Z-laws
  24692. 1676.60 s [algebraic-graph-duoids] include algebraic-graph-duoids-0.0.1.0-BzWqxFjHi74EdmthmWG9bk
  24693. 1676.60 s [algebraic-graph-duoids] include algebraic-graphs-0.7-FivNbIKLMvMFivhqM96Qyy
  24694. 1676.60 s [algebraic-graph-duoids] include base-4.19.2.0-a4d2
  24695. 1676.60 s [algebraic-graph-duoids] include duoids-hedgehog-0.0.1.0-DNfhlYCCG6pCyVz8JVxsPH
  24696. 1676.60 s [algebraic-graph-duoids] include ghc-compat-plugin-0.1.0.1-7MjAExeaX6DEMyHCY8avBD
  24697. 1676.60 s [algebraic-graph-duoids] include hedgehog-1.5-I61WWSEyWWs9b1Ow8jewYT
  24698. 1676.60 s [algebraic-graph-duoids] Ready component graph:
  24699. 1676.60 s [algebraic-graph-duoids] definite algebraic-graph-duoids-0.0.1.0-BzWqxFjHi74EdmthmWG9bk
  24700. 1676.60 s [algebraic-graph-duoids] depends algebraic-graphs-0.7-FivNbIKLMvMFivhqM96Qyy
  24701. 1676.60 s [algebraic-graph-duoids] depends base-4.19.2.0-a4d2
  24702. 1676.60 s [algebraic-graph-duoids] depends duoids-0.0.1.0-HGVxlGiTGubJau1PjiOPQY
  24703. 1676.60 s [algebraic-graph-duoids] depends ghc-compat-plugin-0.1.0.1-7MjAExeaX6DEMyHCY8avBD
  24704. 1676.60 s [algebraic-graph-duoids] definite algebraic-graph-duoids-0.0.1.0-7pLfsqOJOmU4EVefsbEW2Z-laws
  24705. 1676.60 s [algebraic-graph-duoids] depends algebraic-graph-duoids-0.0.1.0-BzWqxFjHi74EdmthmWG9bk
  24706. 1676.60 s [algebraic-graph-duoids] depends algebraic-graphs-0.7-FivNbIKLMvMFivhqM96Qyy
  24707. 1676.60 s [algebraic-graph-duoids] depends base-4.19.2.0-a4d2
  24708. 1676.60 s [algebraic-graph-duoids] depends duoids-hedgehog-0.0.1.0-DNfhlYCCG6pCyVz8JVxsPH
  24709. 1676.60 s [algebraic-graph-duoids] depends ghc-compat-plugin-0.1.0.1-7MjAExeaX6DEMyHCY8avBD
  24710. 1676.60 s [algebraic-graph-duoids] depends hedgehog-1.5-I61WWSEyWWs9b1Ow8jewYT
  24711. 1676.60 s [algebraic-graph-duoids] definite algebraic-graph-duoids-0.0.1.0-5WoiHTqiIOs9Z7wGzt8lv4-doctests
  24712. 1676.60 s [algebraic-graph-duoids] depends algebraic-graph-duoids-0.0.1.0-BzWqxFjHi74EdmthmWG9bk
  24713. 1676.60 s [algebraic-graph-duoids] depends base-4.19.2.0-a4d2
  24714. 1676.60 s [algebraic-graph-duoids] depends doctest-0.24.2-7CW3VAqweMx6JNSdbfXAyp
  24715. 1676.60 s [algebraic-graph-duoids] depends ghc-compat-plugin-0.1.0.1-7MjAExeaX6DEMyHCY8avBD
  24716. 1676.60 s [algebraic-graph-duoids] Using Cabal-3.12.1.0 compiled by ghc-9.8
  24717. 1676.60 s [algebraic-graph-duoids] Using compiler: ghc-9.8.4
  24718. 1676.60 s [algebraic-graph-duoids] Using install prefix:
  24719. 1676.60 s [algebraic-graph-duoids] /nix/store/x02gyjl787h1z297zj6pfagvbxsmwry7-algebraic-graph-duoids-0.0.1.0
  24720. 1676.60 s [algebraic-graph-duoids] Executables installed in:
  24721. 1676.60 s [algebraic-graph-duoids] /nix/store/x02gyjl787h1z297zj6pfagvbxsmwry7-algebraic-graph-duoids-0.0.1.0/bin
  24722. 1676.60 s [algebraic-graph-duoids] Libraries installed in:
  24723. 1676.60 s [algebraic-graph-duoids] /nix/store/x02gyjl787h1z297zj6pfagvbxsmwry7-algebraic-graph-duoids-0.0.1.0/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4-952d/algebraic-graph-duoids-0.0.1.0-BzWqxFjHi74EdmthmWG9bk
  24724. 1676.60 s [algebraic-graph-duoids] Dynamic Libraries installed in:
  24725. 1676.60 s [algebraic-graph-duoids] /nix/store/x02gyjl787h1z297zj6pfagvbxsmwry7-algebraic-graph-duoids-0.0.1.0/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4-952d
  24726. 1676.60 s [algebraic-graph-duoids] Private executables installed in:
  24727. 1676.60 s [algebraic-graph-duoids] /nix/store/x02gyjl787h1z297zj6pfagvbxsmwry7-algebraic-graph-duoids-0.0.1.0/libexec/x86_64-linux-ghc-9.8.4-952d/algebraic-graph-duoids-0.0.1.0
  24728. 1676.60 s [algebraic-graph-duoids] Data files installed in:
  24729. 1676.60 s [algebraic-graph-duoids] /nix/store/x02gyjl787h1z297zj6pfagvbxsmwry7-algebraic-graph-duoids-0.0.1.0/share/x86_64-linux-ghc-9.8.4-952d/algebraic-graph-duoids-0.0.1.0
  24730. 1676.60 s [algebraic-graph-duoids] Documentation installed in:
  24731. 1676.60 s [algebraic-graph-duoids] /nix/store/25291ab39v3ik1scwrx3w793zap6ph9m-algebraic-graph-duoids-0.0.1.0-doc/share/doc/algebraic-graph-duoids-0.0.1.0
  24732. 1676.60 s [algebraic-graph-duoids] Configuration files installed in:
  24733. 1676.60 s [algebraic-graph-duoids] /nix/store/x02gyjl787h1z297zj6pfagvbxsmwry7-algebraic-graph-duoids-0.0.1.0/etc
  24734. 1676.60 s [algebraic-graph-duoids] No alex found
  24735. 1676.60 s [algebraic-graph-duoids] Using ar found on system at:
  24736. 1676.60 s [algebraic-graph-duoids] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
  24737. 1676.60 s [algebraic-graph-duoids] No c2hs found
  24738. 1676.60 s [algebraic-graph-duoids] No cpphs found
  24739. 1676.60 s [algebraic-graph-duoids] Using doctest version 0.24.2 found on system at:
  24740. 1676.60 s [algebraic-graph-duoids] /nix/store/njpw8hiwdi4abvh8g8yavys2ykkm6gmp-doctest-0.24.2/bin/doctest
  24741. 1676.60 s [algebraic-graph-duoids] Using gcc version 14.3.0 given by user at:
  24742. 1676.60 s [algebraic-graph-duoids] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
  24743. 1676.60 s [algebraic-graph-duoids] Using ghc version 9.8.4 found on system at:
  24744. 1676.60 s [algebraic-graph-duoids] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/ghc
  24745. 1676.60 s [algebraic-graph-duoids] Using ghc-pkg version 9.8.4 found on system at:
  24746. 1676.60 s [algebraic-graph-duoids] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/ghc-pkg-9.8.4
  24747. 1676.60 s [algebraic-graph-duoids] No ghcjs found
  24748. 1676.60 s [algebraic-graph-duoids] No ghcjs-pkg found
  24749. 1676.60 s [algebraic-graph-duoids] No greencard found
  24750. 1676.60 s [algebraic-graph-duoids] Using haddock version 2.30.0 found on system at:
  24751. 1676.60 s [algebraic-graph-duoids] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/haddock-ghc-9.8.4
  24752. 1676.60 s [algebraic-graph-duoids] No happy found
  24753. 1676.60 s [algebraic-graph-duoids] Using haskell-suite found on system at: haskell-suite-dummy-location
  24754. 1676.60 s [algebraic-graph-duoids] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  24755. 1676.60 s [algebraic-graph-duoids] No hmake found
  24756. 1676.60 s [algebraic-graph-duoids] Using hpc version 0.69 found on system at:
  24757. 1676.60 s [algebraic-graph-duoids] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/hpc-ghc-9.8.4
  24758. 1676.60 s [algebraic-graph-duoids] Using hsc2hs version 0.68.10 found on system at:
  24759. 1676.60 s [algebraic-graph-duoids] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/hsc2hs-ghc-9.8.4
  24760. 1676.60 s [algebraic-graph-duoids] Using hscolour version 1.25 found on system at:
  24761. 1676.60 s [algebraic-graph-duoids] /nix/store/vl14mqkz7z183r6sq9qz932j3pix6v5c-hscolour-1.25/bin/HsColour
  24762. 1676.60 s [algebraic-graph-duoids] No jhc found
  24763. 1676.60 s [algebraic-graph-duoids] Using ld found on system at:
  24764. 1676.60 s [algebraic-graph-duoids] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ld.gold
  24765. 1676.60 s [algebraic-graph-duoids] No pkg-config found
  24766. 1676.60 s [algebraic-graph-duoids] Using runghc version 9.8.4 found on system at:
  24767. 1676.60 s [algebraic-graph-duoids] /nix/store/f802g02kq4gg69r7w2xbn2b35lmj24nv-ghc-9.8.4/bin/runghc-9.8.4
  24768. 1676.60 s [algebraic-graph-duoids] Using strip version 2.44 found on system at:
  24769. 1676.60 s [algebraic-graph-duoids] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
  24770. 1676.60 s [algebraic-graph-duoids] Using tar found on system at:
  24771. 1676.60 s [algebraic-graph-duoids] /nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
  24772. 1676.60 s [algebraic-graph-duoids] No uhc found
  24773. 1676.78 s [algebraic-graph-duoids] Phase: buildPhase
  24774. 1676.86 s [algebraic-graph-duoids] Preprocessing library for algebraic-graph-duoids-0.0.1.0...
  24775. 1676.86 s [algebraic-graph-duoids] Building library for algebraic-graph-duoids-0.0.1.0...
  24776. 1676.97 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 )
  24777. 1677.44 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 )
  24778. 1678.33 s [algebraic-graph-duoids] [1 of 2] Compiling Algebra.Graph.Duoid ( src/Algebra/Graph/Duoid.hs, dist/build/Algebra/Graph/Duoid.p_o )
  24779. 1678.80 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 )
  24780. 1683.32 s [algebraic-graph-duoids] Preprocessing test suite 'laws' for algebraic-graph-duoids-0.0.1.0...
  24781. 1683.32 s [algebraic-graph-duoids] Building test suite 'laws' for algebraic-graph-duoids-0.0.1.0...
  24782. 1683.43 s [algebraic-graph-duoids] [1 of 1] Compiling Main ( tests/laws.hs, dist/build/laws/laws-tmp/Main.o )
  24783. 1684.31 s [algebraic-graph-duoids] [2 of 2] Linking dist/build/laws/laws
  24784. 1685.26 s [algebraic-graph-duoids] Preprocessing test suite 'doctests' for algebraic-graph-duoids-0.0.1.0...
  24785. 1685.26 s [algebraic-graph-duoids] Building test suite 'doctests' for algebraic-graph-duoids-0.0.1.0...
  24786. 1685.36 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 )
  24787. 1685.80 s [algebraic-graph-duoids] [2 of 2] Compiling Main ( tests/doctests.hs, dist/build/doctests/doctests-tmp/Main.o )
  24788. 1686.54 s [algebraic-graph-duoids] [3 of 3] Linking dist/build/doctests/doctests
  24789. 1689.89 s [algebraic-graph-duoids] Phase: checkPhase
  24790. 1690.15 s [algebraic-graph-duoids] Running 2 test suites...
  24791. 1690.15 s [algebraic-graph-duoids] Test suite laws: RUNNING...
  24792. 1690.20 s [algebraic-graph-duoids] ━━━ Duoid.Normal (Graph Word8) ━━━
  24793. 1690.20 s [algebraic-graph-duoids] ✓ unswapUnit passed 100 tests.
  24794. 1690.20 s [algebraic-graph-duoids] ✓ interchange passed 100 tests.
  24795. 1690.20 s [algebraic-graph-duoids] ✓ splitUnit passed 100 tests.
  24796. 1690.20 s [algebraic-graph-duoids] ✓ joinUnit passed 100 tests.
  24797. 1690.20 s [algebraic-graph-duoids] ✓ swapUnit passed 100 tests.
  24798. 1690.20 s [algebraic-graph-duoids] ✓ 5 succeeded.
  24799. 1690.20 s [algebraic-graph-duoids] Test suite laws: PASS
  24800. 1690.20 s [algebraic-graph-duoids] Test suite logged to: dist/test/algebraic-graph-duoids-0.0.1.0-laws.log
  24801. 1690.20 s [algebraic-graph-duoids] Test suite doctests: RUNNING...
  24802. 1690.65 s [algebraic-graph-duoids] Examples: 0 Tried: 0 Errors: 0 Failures: 0
  24803. 1690.69 s [algebraic-graph-duoids] NameLib Nothing
  24804. 1690.69 s [algebraic-graph-duoids] ----------------------------------------
  24805. 1690.70 s [algebraic-graph-duoids] Test suite doctests: PASS
  24806. 1690.70 s [algebraic-graph-duoids] Test suite logged to: dist/test/algebraic-graph-duoids-0.0.1.0-doctests.log
  24807. 1690.70 s [algebraic-graph-duoids] 2 of 2 test suites (2 of 2 test cases) passed.
  24808. 1690.71 s [algebraic-graph-duoids] Phase: haddockPhase
  24809. 1690.82 s [algebraic-graph-duoids] Preprocessing library for algebraic-graph-duoids-0.0.1.0...
  24810. 1690.82 s [algebraic-graph-duoids] Running Haddock on library for algebraic-graph-duoids-0.0.1.0...
  24811. 1691.11 s [algebraic-graph-duoids] [1 of 2] Compiling Algebra.Graph.Duoid ( src/Algebra/Graph/Duoid.hs, nothing )
  24812. 1691.47 s [algebraic-graph-duoids] [2 of 2] Compiling Algebra.Graph.Duoid.Orphans ( src/Algebra/Graph/Duoid/Orphans.hs, nothing )
  24813. 1691.64 s [algebraic-graph-duoids] Haddock coverage:
  24814. 1691.64 s [algebraic-graph-duoids] 100% ( 5 / 5) in 'Algebra.Graph.Duoid'
  24815. 1691.64 s [algebraic-graph-duoids] 100% ( 1 / 1) in 'Algebra.Graph.Duoid.Orphans'
  24816. 1698.50 s [algebraic-graph-duoids] Documentation created: dist/doc/html/algebraic-graph-duoids/,
  24817. 1698.50 s [algebraic-graph-duoids] dist/doc/html/algebraic-graph-duoids/algebraic-graph-duoids.txt
  24818. 1698.57 s [algebraic-graph-duoids] Preprocessing test suite 'laws' for algebraic-graph-duoids-0.0.1.0...
  24819. 1698.57 s [algebraic-graph-duoids] Preprocessing test suite 'doctests' for algebraic-graph-duoids-0.0.1.0...
  24820. 1698.58 s [algebraic-graph-duoids] Phase: installPhase
  24821. 1698.69 s [algebraic-graph-duoids] Installing library in /nix/store/x02gyjl787h1z297zj6pfagvbxsmwry7-algebraic-graph-duoids-0.0.1.0/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4-952d/algebraic-graph-duoids-0.0.1.0-BzWqxFjHi74EdmthmWG9bk
  24822. 1699.02 s [algebraic-graph-duoids] Phase: fixupPhase
  24823. 1699.04 s [algebraic-graph-duoids] shrinking RPATHs of ELF executables and libraries in /nix/store/x02gyjl787h1z297zj6pfagvbxsmwry7-algebraic-graph-duoids-0.0.1.0
  24824. 1699.05 s [algebraic-graph-duoids] shrinking /nix/store/x02gyjl787h1z297zj6pfagvbxsmwry7-algebraic-graph-duoids-0.0.1.0/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4-952d/libHSalgebraic-graph-duoids-0.0.1.0-BzWqxFjHi74EdmthmWG9bk-ghc9.8.4.so
  24825. 1699.05 s [algebraic-graph-duoids] checking for references to /build/ in /nix/store/x02gyjl787h1z297zj6pfagvbxsmwry7-algebraic-graph-duoids-0.0.1.0...
  24826. 1699.08 s [algebraic-graph-duoids] patching script interpreter paths in /nix/store/x02gyjl787h1z297zj6pfagvbxsmwry7-algebraic-graph-duoids-0.0.1.0
  24827. 1699.08 s [algebraic-graph-duoids] stripping (with command strip and flags -S -p) in /nix/store/x02gyjl787h1z297zj6pfagvbxsmwry7-algebraic-graph-duoids-0.0.1.0/lib
  24828. 1699.13 s [algebraic-graph-duoids] shrinking RPATHs of ELF executables and libraries in /nix/store/25291ab39v3ik1scwrx3w793zap6ph9m-algebraic-graph-duoids-0.0.1.0-doc
  24829. 1699.15 s [algebraic-graph-duoids] checking for references to /build/ in /nix/store/25291ab39v3ik1scwrx3w793zap6ph9m-algebraic-graph-duoids-0.0.1.0-doc...
  24830. 1699.17 s [algebraic-graph-duoids] patching script interpreter paths in /nix/store/25291ab39v3ik1scwrx3w793zap6ph9m-algebraic-graph-duoids-0.0.1.0-doc
  24831. 1699.37 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/25291ab39v3ik1scwrx3w793zap6ph9m-algebraic-graph-duoids-0.0.1.0-doc /nix/store/x02gyjl787h1z297zj6pfagvbxsmwry7-algebraic-graph-duoids-0.0.1.0
  24832. 1700.01 s [post-build-hook] Pushing 2 paths (76 are already present) using zstd to cache sellout ⏳
  24833. 1700.01 s [post-build-hook]
  24834. 1700.42 s [post-build-hook] Pushing /nix/store/25291ab39v3ik1scwrx3w793zap6ph9m-algebraic-graph-duoids-0.0.1.0-doc (539.69 KiB)
  24835. 1700.45 s [post-build-hook] Pushing /nix/store/x02gyjl787h1z297zj6pfagvbxsmwry7-algebraic-graph-duoids-0.0.1.0 (1.21 MiB)
  24836. 1701.49 s [post-build-hook]
  24837. 1701.49 s [post-build-hook] All done.
  24838. 1701.52 s [post-build-hook] Uploading to the NixCI cache: /nix/store/25291ab39v3ik1scwrx3w793zap6ph9m-algebraic-graph-duoids-0.0.1.0-doc /nix/store/x02gyjl787h1z297zj6pfagvbxsmwry7-algebraic-graph-duoids-0.0.1.0
  24839. 1701.55 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24840. 1701.57 s [post-build-hook] copying 2 paths...
  24841. 1701.57 s [post-build-hook] copying path '/nix/store/25291ab39v3ik1scwrx3w793zap6ph9m-algebraic-graph-duoids-0.0.1.0-doc' to 'https://cache.nix-ci.com'...
  24842. 1701.95 s [post-build-hook] copying path '/nix/store/x02gyjl787h1z297zj6pfagvbxsmwry7-algebraic-graph-duoids-0.0.1.0' to 'https://cache.nix-ci.com'...
  24843. 1702.46 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24844. 1702.70 s [post-build-hook] copying 1 paths...
  24845. 1702.70 s [post-build-hook] copying path '/nix/store/2y6pfpk3ahiwdiizrjcr1x2vfb8c8s3v-algebraic-graph-duoids-0.0.1.0.drv' to 'https://cache.nix-ci.com'...
  24846. 1702.93 s Progress: 15 of 19 built, 160 of 160 downloaded from cache
  24847. 1702.98 s Building ghc-9.8.4-with-packages
  24848. 1703.04 s [ghc-9.8.4-with-packages] /nix/store/aj1wphvkxd5d6385fmiixhm34np0amm5-duoidal-transformers-0.0.1.0/nix-support:
  24849. 1703.04 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/x02gyjl787h1z297zj6pfagvbxsmwry7-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24850. 1703.05 s [ghc-9.8.4-with-packages] /nix/store/m49xks76j1h3wsvdilf50skd80j6wchy-duoids-0.0.1.0/nix-support:
  24851. 1703.05 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/x02gyjl787h1z297zj6pfagvbxsmwry7-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24852. 1703.05 s [ghc-9.8.4-with-packages] /nix/store/vm5i94j0k512cw26vxh9slszby68s1aw-duoids-hedgehog-0.0.1.0/nix-support:
  24853. 1703.05 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/x02gyjl787h1z297zj6pfagvbxsmwry7-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24854. 1703.06 s [ghc-9.8.4-with-packages] /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7/nix-support:
  24855. 1703.06 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/x02gyjl787h1z297zj6pfagvbxsmwry7-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24856. 1703.06 s [ghc-9.8.4-with-packages] /nix/store/l4phbxhkhm90wv21kqhv1za6i7qcb0xr-algebraic-graphs-0.7/nix-support:
  24857. 1703.06 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/x02gyjl787h1z297zj6pfagvbxsmwry7-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24858. 1703.06 s [ghc-9.8.4-with-packages] /nix/store/kz6rjig02ilxg6pingy2i9bwc922mpj8-ghc-compat-plugin-0.1.0.1/nix-support:
  24859. 1703.06 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/x02gyjl787h1z297zj6pfagvbxsmwry7-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24860. 1703.07 s [ghc-9.8.4-with-packages] /nix/store/kz6rjig02ilxg6pingy2i9bwc922mpj8-ghc-compat-plugin-0.1.0.1/nix-support:
  24861. 1703.07 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/x02gyjl787h1z297zj6pfagvbxsmwry7-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24862. 1703.07 s [ghc-9.8.4-with-packages] /nix/store/brj4qf8vdmj7spncza7z460973g4k8d1-hedgehog-1.5/nix-support:
  24863. 1703.07 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/x02gyjl787h1z297zj6pfagvbxsmwry7-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24864. 1703.07 s [ghc-9.8.4-with-packages] /nix/store/brj4qf8vdmj7spncza7z460973g4k8d1-hedgehog-1.5/nix-support:
  24865. 1703.07 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/x02gyjl787h1z297zj6pfagvbxsmwry7-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24866. 1703.08 s [ghc-9.8.4-with-packages] /nix/store/6iclwl0rlh1kk822k56r744jzjdl29yx-ansi-terminal-1.1.3/nix-support:
  24867. 1703.08 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/x02gyjl787h1z297zj6pfagvbxsmwry7-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24868. 1703.08 s [ghc-9.8.4-with-packages] /nix/store/6iclwl0rlh1kk822k56r744jzjdl29yx-ansi-terminal-1.1.3/nix-support:
  24869. 1703.08 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/x02gyjl787h1z297zj6pfagvbxsmwry7-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24870. 1703.08 s [ghc-9.8.4-with-packages] /nix/store/37ii3d70vq73cxiq03b88d3yrskjbnh0-async-2.2.5/nix-support:
  24871. 1703.08 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/x02gyjl787h1z297zj6pfagvbxsmwry7-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24872. 1703.08 s [ghc-9.8.4-with-packages] /nix/store/37ii3d70vq73cxiq03b88d3yrskjbnh0-async-2.2.5/nix-support:
  24873. 1703.08 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/x02gyjl787h1z297zj6pfagvbxsmwry7-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24874. 1703.08 s [ghc-9.8.4-with-packages] /nix/store/w4z3vda339lhgdlja4x3z8q1cp1l9mi1-barbies-2.1.1.0/nix-support:
  24875. 1703.08 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/x02gyjl787h1z297zj6pfagvbxsmwry7-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24876. 1703.09 s [ghc-9.8.4-with-packages] /nix/store/w4z3vda339lhgdlja4x3z8q1cp1l9mi1-barbies-2.1.1.0/nix-support:
  24877. 1703.09 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/x02gyjl787h1z297zj6pfagvbxsmwry7-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24878. 1703.09 s [ghc-9.8.4-with-packages] /nix/store/ih5q3f5hi5v38hrw0vk8hyzlp82c6m2b-concurrent-output-1.10.21/nix-support:
  24879. 1703.09 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/x02gyjl787h1z297zj6pfagvbxsmwry7-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24880. 1703.09 s [ghc-9.8.4-with-packages] /nix/store/ih5q3f5hi5v38hrw0vk8hyzlp82c6m2b-concurrent-output-1.10.21/nix-support:
  24881. 1703.09 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/x02gyjl787h1z297zj6pfagvbxsmwry7-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24882. 1703.10 s [ghc-9.8.4-with-packages] /nix/store/7dxnsc4zh61lfaq4yqkb14cs9j0il00v-lifted-async-0.10.2.7/nix-support:
  24883. 1703.10 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/x02gyjl787h1z297zj6pfagvbxsmwry7-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24884. 1703.10 s [ghc-9.8.4-with-packages] /nix/store/7dxnsc4zh61lfaq4yqkb14cs9j0il00v-lifted-async-0.10.2.7/nix-support:
  24885. 1703.10 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/x02gyjl787h1z297zj6pfagvbxsmwry7-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24886. 1703.10 s [ghc-9.8.4-with-packages] /nix/store/vr8f1x98zcmfm5iq6z43yykp2mavc3zn-mmorph-1.2.1/nix-support:
  24887. 1703.10 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/x02gyjl787h1z297zj6pfagvbxsmwry7-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24888. 1703.10 s [ghc-9.8.4-with-packages] /nix/store/vr8f1x98zcmfm5iq6z43yykp2mavc3zn-mmorph-1.2.1/nix-support:
  24889. 1703.10 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/x02gyjl787h1z297zj6pfagvbxsmwry7-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24890. 1703.11 s [ghc-9.8.4-with-packages] /nix/store/s1z0b4ripxaibcbjg8b0kq727agp4bf5-monad-control-1.0.3.1/nix-support:
  24891. 1703.11 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/x02gyjl787h1z297zj6pfagvbxsmwry7-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24892. 1703.11 s [ghc-9.8.4-with-packages] /nix/store/s1z0b4ripxaibcbjg8b0kq727agp4bf5-monad-control-1.0.3.1/nix-support:
  24893. 1703.11 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/x02gyjl787h1z297zj6pfagvbxsmwry7-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24894. 1703.11 s [ghc-9.8.4-with-packages] /nix/store/59j0bw5x2b4qr5g5qygfyd9ldc7winzy-pretty-show-1.10/nix-support:
  24895. 1703.11 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/x02gyjl787h1z297zj6pfagvbxsmwry7-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24896. 1703.11 s [ghc-9.8.4-with-packages] /nix/store/59j0bw5x2b4qr5g5qygfyd9ldc7winzy-pretty-show-1.10/nix-support:
  24897. 1703.11 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/x02gyjl787h1z297zj6pfagvbxsmwry7-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24898. 1703.11 s [ghc-9.8.4-with-packages] /nix/store/d05v3j9vbx9wmhyxvfqg38gi85gqw9qb-primitive-0.9.1.0/nix-support:
  24899. 1703.11 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/x02gyjl787h1z297zj6pfagvbxsmwry7-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24900. 1703.12 s [ghc-9.8.4-with-packages] /nix/store/d05v3j9vbx9wmhyxvfqg38gi85gqw9qb-primitive-0.9.1.0/nix-support:
  24901. 1703.12 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/x02gyjl787h1z297zj6pfagvbxsmwry7-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24902. 1703.12 s [ghc-9.8.4-with-packages] /nix/store/rb3x326m38l05vvxp1yvjgmf8bsxviw2-random-1.2.1.3/nix-support:
  24903. 1703.12 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/x02gyjl787h1z297zj6pfagvbxsmwry7-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24904. 1703.12 s [ghc-9.8.4-with-packages] /nix/store/rb3x326m38l05vvxp1yvjgmf8bsxviw2-random-1.2.1.3/nix-support:
  24905. 1703.12 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/x02gyjl787h1z297zj6pfagvbxsmwry7-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24906. 1703.12 s [ghc-9.8.4-with-packages] /nix/store/mrjrznagfjx3hfidymraaj2hcj9hdgg3-resourcet-1.3.0/nix-support:
  24907. 1703.12 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/x02gyjl787h1z297zj6pfagvbxsmwry7-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24908. 1703.13 s [ghc-9.8.4-with-packages] /nix/store/mrjrznagfjx3hfidymraaj2hcj9hdgg3-resourcet-1.3.0/nix-support:
  24909. 1703.13 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/x02gyjl787h1z297zj6pfagvbxsmwry7-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24910. 1703.13 s [ghc-9.8.4-with-packages] /nix/store/vb5xrkg5w86rs98l5zvj8pm2gq03989c-safe-exceptions-0.1.7.4/nix-support:
  24911. 1703.13 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/x02gyjl787h1z297zj6pfagvbxsmwry7-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24912. 1703.13 s [ghc-9.8.4-with-packages] /nix/store/vb5xrkg5w86rs98l5zvj8pm2gq03989c-safe-exceptions-0.1.7.4/nix-support:
  24913. 1703.13 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/x02gyjl787h1z297zj6pfagvbxsmwry7-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24914. 1703.13 s [ghc-9.8.4-with-packages] /nix/store/rjrip1qdcl1scs6b0hkcc4p9xy5ng4q7-transformers-base-0.4.6/nix-support:
  24915. 1703.13 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/x02gyjl787h1z297zj6pfagvbxsmwry7-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24916. 1703.13 s [ghc-9.8.4-with-packages] /nix/store/rjrip1qdcl1scs6b0hkcc4p9xy5ng4q7-transformers-base-0.4.6/nix-support:
  24917. 1703.13 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/x02gyjl787h1z297zj6pfagvbxsmwry7-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24918. 1703.13 s [ghc-9.8.4-with-packages] /nix/store/9aa9qaibricg5j6s9n99jpaq30xlqclb-wl-pprint-annotated-0.1.0.1/nix-support:
  24919. 1703.13 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/x02gyjl787h1z297zj6pfagvbxsmwry7-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24920. 1703.14 s [ghc-9.8.4-with-packages] /nix/store/9aa9qaibricg5j6s9n99jpaq30xlqclb-wl-pprint-annotated-0.1.0.1/nix-support:
  24921. 1703.14 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/x02gyjl787h1z297zj6pfagvbxsmwry7-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24922. 1703.14 s [ghc-9.8.4-with-packages] /nix/store/1nhn1pmdh6rynrwg64wa6jyg05r1w8i2-ansi-terminal-types-1.1.3/nix-support:
  24923. 1703.14 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/x02gyjl787h1z297zj6pfagvbxsmwry7-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24924. 1703.14 s [ghc-9.8.4-with-packages] /nix/store/1nhn1pmdh6rynrwg64wa6jyg05r1w8i2-ansi-terminal-types-1.1.3/nix-support:
  24925. 1703.14 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/x02gyjl787h1z297zj6pfagvbxsmwry7-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24926. 1703.15 s [ghc-9.8.4-with-packages] /nix/store/accjj1a7s58f9csn4533s5y10v7i5ayr-hashable-1.5.0.0/nix-support:
  24927. 1703.15 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/x02gyjl787h1z297zj6pfagvbxsmwry7-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24928. 1703.15 s [ghc-9.8.4-with-packages] /nix/store/accjj1a7s58f9csn4533s5y10v7i5ayr-hashable-1.5.0.0/nix-support:
  24929. 1703.15 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/x02gyjl787h1z297zj6pfagvbxsmwry7-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24930. 1703.15 s [ghc-9.8.4-with-packages] /nix/store/qxdzqhj867c1d36953knff37mw83ficf-distributive-0.6.2.1/nix-support:
  24931. 1703.15 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/x02gyjl787h1z297zj6pfagvbxsmwry7-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24932. 1703.15 s [ghc-9.8.4-with-packages] /nix/store/qxdzqhj867c1d36953knff37mw83ficf-distributive-0.6.2.1/nix-support:
  24933. 1703.15 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/x02gyjl787h1z297zj6pfagvbxsmwry7-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24934. 1703.16 s [ghc-9.8.4-with-packages] /nix/store/mirzq3yfg5wbl8wsna9b3qvxrp4nmb6z-constraints-0.14.2/nix-support:
  24935. 1703.16 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/x02gyjl787h1z297zj6pfagvbxsmwry7-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24936. 1703.16 s [ghc-9.8.4-with-packages] /nix/store/mirzq3yfg5wbl8wsna9b3qvxrp4nmb6z-constraints-0.14.2/nix-support:
  24937. 1703.16 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/x02gyjl787h1z297zj6pfagvbxsmwry7-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24938. 1703.16 s [ghc-9.8.4-with-packages] /nix/store/cr7zciv2q01j4xja03w3bjm4xr65rfv8-lifted-base-0.2.3.12/nix-support:
  24939. 1703.16 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/x02gyjl787h1z297zj6pfagvbxsmwry7-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24940. 1703.17 s [ghc-9.8.4-with-packages] /nix/store/cr7zciv2q01j4xja03w3bjm4xr65rfv8-lifted-base-0.2.3.12/nix-support:
  24941. 1703.17 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/x02gyjl787h1z297zj6pfagvbxsmwry7-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24942. 1703.17 s [ghc-9.8.4-with-packages] /nix/store/99zq1gil5hgnklr8zzijqnw501q4rw5s-transformers-compat-0.7.2/nix-support:
  24943. 1703.17 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/x02gyjl787h1z297zj6pfagvbxsmwry7-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24944. 1703.17 s [ghc-9.8.4-with-packages] /nix/store/99zq1gil5hgnklr8zzijqnw501q4rw5s-transformers-compat-0.7.2/nix-support:
  24945. 1703.17 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/x02gyjl787h1z297zj6pfagvbxsmwry7-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24946. 1703.18 s [ghc-9.8.4-with-packages] /nix/store/s8ar36hx1qjsj73pgvppnl6dqm18l69w-splitmix-0.1.3.1/nix-support:
  24947. 1703.18 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/x02gyjl787h1z297zj6pfagvbxsmwry7-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24948. 1703.18 s [ghc-9.8.4-with-packages] /nix/store/s8ar36hx1qjsj73pgvppnl6dqm18l69w-splitmix-0.1.3.1/nix-support:
  24949. 1703.18 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/x02gyjl787h1z297zj6pfagvbxsmwry7-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24950. 1703.18 s [ghc-9.8.4-with-packages] /nix/store/yvar5jgnrvkz1qa6vzv18830lpa2jwyl-unliftio-core-0.2.1.0/nix-support:
  24951. 1703.18 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/x02gyjl787h1z297zj6pfagvbxsmwry7-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24952. 1703.18 s [ghc-9.8.4-with-packages] /nix/store/yvar5jgnrvkz1qa6vzv18830lpa2jwyl-unliftio-core-0.2.1.0/nix-support:
  24953. 1703.18 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/x02gyjl787h1z297zj6pfagvbxsmwry7-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24954. 1703.18 s [ghc-9.8.4-with-packages] /nix/store/qlvsmyiaz3ib75d4q3wm7wnjwzb59dnh-base-orphans-0.9.3/nix-support:
  24955. 1703.18 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/x02gyjl787h1z297zj6pfagvbxsmwry7-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24956. 1703.19 s [ghc-9.8.4-with-packages] /nix/store/qlvsmyiaz3ib75d4q3wm7wnjwzb59dnh-base-orphans-0.9.3/nix-support:
  24957. 1703.19 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/x02gyjl787h1z297zj6pfagvbxsmwry7-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24958. 1703.19 s [ghc-9.8.4-with-packages] /nix/store/p7324fxikqvxaql2mrmhlz6cby1qc8lc-os-string-2.0.8/nix-support:
  24959. 1703.19 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/x02gyjl787h1z297zj6pfagvbxsmwry7-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24960. 1703.19 s [ghc-9.8.4-with-packages] /nix/store/p7324fxikqvxaql2mrmhlz6cby1qc8lc-os-string-2.0.8/nix-support:
  24961. 1703.19 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/x02gyjl787h1z297zj6pfagvbxsmwry7-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24962. 1703.19 s [ghc-9.8.4-with-packages] /nix/store/zpq343jdivqaml3qfsfz174hif76ndan-tagged-0.8.9/nix-support:
  24963. 1703.19 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/x02gyjl787h1z297zj6pfagvbxsmwry7-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24964. 1703.19 s [ghc-9.8.4-with-packages] /nix/store/zpq343jdivqaml3qfsfz174hif76ndan-tagged-0.8.9/nix-support:
  24965. 1703.19 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/x02gyjl787h1z297zj6pfagvbxsmwry7-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24966. 1703.20 s [ghc-9.8.4-with-packages] /nix/store/390smls5rl93m23ijffn4h64ak09s7gw-boring-0.2.2/nix-support:
  24967. 1703.20 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/x02gyjl787h1z297zj6pfagvbxsmwry7-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24968. 1703.20 s [ghc-9.8.4-with-packages] /nix/store/390smls5rl93m23ijffn4h64ak09s7gw-boring-0.2.2/nix-support:
  24969. 1703.20 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/x02gyjl787h1z297zj6pfagvbxsmwry7-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24970. 1703.89 s [ghc-9.8.4-with-packages] Warning: include-dirs: /nix/store/y2lvd774l2rarp3kwdkl20mcr8p68fhm-ghc-9.8.4-with-packages/lib/ghc-9.8.4/lib/../lib/x86_64-linux-ghc-9.8.4/directory-1.3.8.5-fa66/include doesn't exist or isn't a directory
  24971. 1704.91 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/y2lvd774l2rarp3kwdkl20mcr8p68fhm-ghc-9.8.4-with-packages
  24972. 1705.62 s [post-build-hook] Pushing 1 paths (146 are already present) using zstd to cache sellout ⏳
  24973. 1705.62 s [post-build-hook]
  24974. 1706.02 s [post-build-hook] Pushing /nix/store/y2lvd774l2rarp3kwdkl20mcr8p68fhm-ghc-9.8.4-with-packages (4.39 MiB)
  24975. 1708.10 s [post-build-hook]
  24976. 1708.10 s [post-build-hook] All done.
  24977. 1708.12 s [post-build-hook] Uploading to the NixCI cache: /nix/store/y2lvd774l2rarp3kwdkl20mcr8p68fhm-ghc-9.8.4-with-packages
  24978. 1708.16 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24979. 1708.37 s [post-build-hook] copying 1 paths...
  24980. 1708.37 s [post-build-hook] copying path '/nix/store/y2lvd774l2rarp3kwdkl20mcr8p68fhm-ghc-9.8.4-with-packages' to 'https://cache.nix-ci.com'...
  24981. 1709.43 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24982. 1709.73 s [post-build-hook] copying 1 paths...
  24983. 1709.73 s [post-build-hook] copying path '/nix/store/n5xmf411avqm871g69a13fc0vp7dzbfg-ghc-9.8.4-with-packages.drv' to 'https://cache.nix-ci.com'...
  24984. 1709.95 s Progress: 16 of 18 built, 160 of 160 downloaded from cache
  24985. 1710.01 s Building all-packages
  24986. 1710.09 s [all-packages] created 3 symlinks in user environment
  24987. 1710.13 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/m4xzk830dzzqhj68q9cicdy1q4rqx2vx-all-packages
  24988. 1710.75 s [post-build-hook] Pushing 1 paths (147 are already present) using zstd to cache sellout ⏳
  24989. 1710.75 s [post-build-hook]
  24990. 1711.15 s [post-build-hook] Pushing /nix/store/m4xzk830dzzqhj68q9cicdy1q4rqx2vx-all-packages (872.00 B)
  24991. 1712.22 s [post-build-hook]
  24992. 1712.22 s [post-build-hook] All done.
  24993. 1712.24 s [post-build-hook] Uploading to the NixCI cache: /nix/store/m4xzk830dzzqhj68q9cicdy1q4rqx2vx-all-packages
  24994. 1712.29 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24995. 1712.51 s [post-build-hook] copying 1 paths...
  24996. 1712.51 s [post-build-hook] copying path '/nix/store/m4xzk830dzzqhj68q9cicdy1q4rqx2vx-all-packages' to 'https://cache.nix-ci.com'...
  24997. 1712.76 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24998. 1713.00 s [post-build-hook] copying 1 paths...
  24999. 1713.00 s [post-build-hook] copying path '/nix/store/90m92d3q2xb4qmkvd59dnz3x6l2l2dk3-all-packages.drv' to 'https://cache.nix-ci.com'...
  25000. 1713.25 s Progress: 17 of 18 built, 160 of 160 downloaded from cache
Tail Raw Logs