1. 223.33 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  2. 223.33 s [Cabal-syntax] - Distribution.Types.Library.Rep_Library
  3. 223.34 s [Cabal-syntax] Warning: Distribution.Types.Library.Lens: could not find link destinations for:
  4. 223.34 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  5. 223.34 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  6. 223.34 s [Cabal-syntax] - Distribution.Types.Library.Rep_Library
  7. 223.35 s [Cabal-syntax] Warning: Distribution.Types.ForeignLib: could not find link destinations for:
  8. 223.35 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  9. 223.35 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  10. 223.35 s [Cabal-syntax] - Distribution.Types.ForeignLib.Rep_ForeignLib
  11. 223.35 s [Cabal-syntax] - Distribution.Types.ForeignLib.Rep_LibVersionInfo
  12. 223.35 s [Cabal-syntax] Warning: Distribution.Types.ForeignLib.Lens: could not find link destinations for:
  13. 223.35 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  14. 223.35 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  15. 223.35 s [Cabal-syntax] - Distribution.Types.ForeignLib.Rep_ForeignLib
  16. 223.35 s [Cabal-syntax] Warning: Distribution.Types.Executable: could not find link destinations for:
  17. 223.35 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  18. 223.35 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  19. 223.35 s [Cabal-syntax] - Distribution.Types.Executable.Rep_Executable
  20. 223.36 s [Cabal-syntax] Warning: Distribution.Types.Executable.Lens: could not find link destinations for:
  21. 223.36 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  22. 223.36 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  23. 223.36 s [Cabal-syntax] - Distribution.Types.Executable.Rep_Executable
  24. 223.37 s [Cabal-syntax] Warning: Distribution.Types.Benchmark: could not find link destinations for:
  25. 223.37 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  26. 223.37 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  27. 223.37 s [Cabal-syntax] - Distribution.Types.Benchmark.Rep_Benchmark
  28. 223.37 s [Cabal-syntax] Warning: Distribution.Types.Component: could not find link destinations for:
  29. 223.37 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  30. 223.37 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  31. 223.37 s [Cabal-syntax] - Distribution.Types.Component.Rep_Component
  32. 223.37 s [Cabal-syntax] Warning: Distribution.Types.ComponentRequestedSpec: could not find link destinations for:
  33. 223.37 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  34. 223.37 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  35. 223.37 s [Cabal-syntax] - Distribution.Types.ComponentRequestedSpec.Rep_ComponentRequestedSpec
  36. 223.39 s [Cabal-syntax] Warning: Distribution.Types.PackageDescription: could not find link destinations for:
  37. 223.39 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  38. 223.39 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  39. 223.39 s [Cabal-syntax] - Distribution.Types.PackageDescription.Rep_PackageDescription
  40. 223.39 s [Cabal-syntax] Warning: Distribution.Types.GenericPackageDescription: could not find link destinations for:
  41. 223.39 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  42. 223.39 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  43. 223.39 s [Cabal-syntax] - Distribution.Types.GenericPackageDescription.Rep_GenericPackageDescription
  44. 223.41 s [Cabal-syntax] Warning: Distribution.Types.GenericPackageDescription.Lens: could not find link destinations for:
  45. 223.41 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  46. 223.41 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  47. 223.41 s [Cabal-syntax] - Distribution.Types.Flag.Rep_PackageFlag
  48. 223.41 s [Cabal-syntax] - Distribution.Types.Flag.Rep_FlagName
  49. 223.41 s [Cabal-syntax] - Distribution.Types.ConfVar.Rep_ConfVar
  50. 223.41 s [Cabal-syntax] - Distribution.Types.GenericPackageDescription.Rep_GenericPackageDescription
  51. 223.41 s [Cabal-syntax] Warning: Distribution.Types.Benchmark.Lens: could not find link destinations for:
  52. 223.41 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  53. 223.41 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  54. 223.41 s [Cabal-syntax] - Distribution.Types.Benchmark.Rep_Benchmark
  55. 223.42 s [Cabal-syntax] Warning: Distribution.Types.PackageDescription.Lens: could not find link destinations for:
  56. 223.42 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  57. 223.42 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  58. 223.42 s [Cabal-syntax] - Distribution.Types.PackageDescription.Rep_PackageDescription
  59. 223.49 s [Cabal-syntax] Warning: Distribution.Types.InstalledPackageInfo.FieldGrammar: could not find link destinations for:
  60. 223.49 s [Cabal-syntax] - Distribution.Types.InstalledPackageInfo.FieldGrammar.Basic
  61. 223.67 s [Cabal-syntax] - Distribution.Types.InstalledPackageInfo.FieldGrammar.SpecLicenseLenient
  62. 223.67 s [Cabal-syntax] - Distribution.Types.InstalledPackageInfo.FieldGrammar.InstWith
  63. 223.67 s [Cabal-syntax] - Distribution.Types.InstalledPackageInfo.FieldGrammar.CompatPackageKey
  64. 223.67 s [Cabal-syntax] - Distribution.Types.InstalledPackageInfo.FieldGrammar.ExposedModules
  65. 223.67 s [Cabal-syntax] Warning: Distribution.InstalledPackageInfo: could not find link destinations for:
  66. 223.67 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  67. 223.67 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  68. 223.67 s [Cabal-syntax] - Distribution.Types.ExposedModule.Rep_ExposedModule
  69. 223.67 s [Cabal-syntax] - Distribution.Types.AbiDependency.Rep_AbiDependency
  70. 223.67 s [Cabal-syntax] - Distribution.Types.InstalledPackageInfo.D:R:KeyInstalledPackageInfo
  71. 223.67 s [Cabal-syntax] - Distribution.Types.InstalledPackageInfo.Rep_InstalledPackageInfo
  72. 257.08 s [Cabal-syntax] Documentation created: dist/doc/html/Cabal-syntax/,
  73. 257.08 s [Cabal-syntax] dist/doc/html/Cabal-syntax/Cabal-syntax.txt
  74. 257.21 s [Cabal-syntax] haddockPhase completed in 1 minutes 12 seconds
  75. 257.22 s [Cabal-syntax] Phase: installPhase
  76. 257.52 s [Cabal-syntax] Installing library in /nix/store/bim6lzs2av5ky70yixr25sjb18j6v3h9-Cabal-syntax-3.12.1.0/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-1e2a/Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK
  77. 263.97 s [Cabal-syntax] Phase: fixupPhase
  78. 264.02 s [Cabal-syntax] shrinking RPATHs of ELF executables and libraries in /nix/store/bim6lzs2av5ky70yixr25sjb18j6v3h9-Cabal-syntax-3.12.1.0
  79. 264.18 s [Cabal-syntax] shrinking /nix/store/bim6lzs2av5ky70yixr25sjb18j6v3h9-Cabal-syntax-3.12.1.0/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-1e2a/libHSCabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK-ghc9.10.2.so
  80. 264.27 s [Cabal-syntax] checking for references to /build/ in /nix/store/bim6lzs2av5ky70yixr25sjb18j6v3h9-Cabal-syntax-3.12.1.0...
  81. 264.54 s [Cabal-syntax] patching script interpreter paths in /nix/store/bim6lzs2av5ky70yixr25sjb18j6v3h9-Cabal-syntax-3.12.1.0
  82. 264.56 s [Cabal-syntax] stripping (with command strip and flags -S -p) in /nix/store/bim6lzs2av5ky70yixr25sjb18j6v3h9-Cabal-syntax-3.12.1.0/lib
  83. 268.12 s [Cabal-syntax] shrinking RPATHs of ELF executables and libraries in /nix/store/0ggivcc6vyvzpgjragw8alnvlyzxrh37-Cabal-syntax-3.12.1.0-doc
  84. 268.20 s [Cabal-syntax] checking for references to /build/ in /nix/store/0ggivcc6vyvzpgjragw8alnvlyzxrh37-Cabal-syntax-3.12.1.0-doc...
  85. 268.33 s [Cabal-syntax] patching script interpreter paths in /nix/store/0ggivcc6vyvzpgjragw8alnvlyzxrh37-Cabal-syntax-3.12.1.0-doc
  86. 269.03 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/0ggivcc6vyvzpgjragw8alnvlyzxrh37-Cabal-syntax-3.12.1.0-doc /nix/store/bim6lzs2av5ky70yixr25sjb18j6v3h9-Cabal-syntax-3.12.1.0
  87. 269.76 s [post-build-hook] Pushing 2 paths (70 are already present) using zstd to cache sellout ⏳
  88. 269.76 s [post-build-hook]
  89. 270.19 s [post-build-hook] Pushing /nix/store/bim6lzs2av5ky70yixr25sjb18j6v3h9-Cabal-syntax-3.12.1.0 (183.00 MiB)
  90. 270.20 s [post-build-hook] Pushing /nix/store/0ggivcc6vyvzpgjragw8alnvlyzxrh37-Cabal-syntax-3.12.1.0-doc (47.46 MiB)
  91. 273.15 s [post-build-hook]
  92. 273.15 s [post-build-hook] All done.
  93. 273.18 s [post-build-hook] Uploading to the NixCI cache: /nix/store/0ggivcc6vyvzpgjragw8alnvlyzxrh37-Cabal-syntax-3.12.1.0-doc /nix/store/bim6lzs2av5ky70yixr25sjb18j6v3h9-Cabal-syntax-3.12.1.0
  94. 273.26 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  95. 273.43 s [post-build-hook] copying 2 paths...
  96. 273.43 s [post-build-hook] copying path '/nix/store/0ggivcc6vyvzpgjragw8alnvlyzxrh37-Cabal-syntax-3.12.1.0-doc' to 'https://cache.nix-ci.com'...
  97. 279.81 s [post-build-hook] copying path '/nix/store/bim6lzs2av5ky70yixr25sjb18j6v3h9-Cabal-syntax-3.12.1.0' to 'https://cache.nix-ci.com'...
  98. 342.67 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  99. 342.87 s [post-build-hook] copying 1 paths...
  100. 342.87 s [post-build-hook] copying path '/nix/store/19ajga6m5hvcnflzl56b63aza7kxlkgx-Cabal-syntax-3.12.1.0.drv' to 'https://cache.nix-ci.com'...
  101. 343.02 s Progress: 1 of 22 built, 177 of 177 downloaded from cache
  102. 343.06 s Building Cabal
  103. 343.14 s [Cabal] Phase: setupCompilerEnvironmentPhase
  104. 343.14 s [Cabal] Build with /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2.
  105. 343.29 s [Cabal] Phase: unpackPhase
  106. 343.29 s [Cabal] unpacking source archive /nix/store/i3lr7fx8fqyzvck858q213704kxk29dd-Cabal-3.12.1.0.tar.gz
  107. 343.30 s [Cabal] source root is Cabal-3.12.1.0
  108. 343.31 s [Cabal] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "Cabal-3.12.1.0/src/Distribution/ZinzaPrelude.hs"
  109. 343.32 s [Cabal] Phase: patchPhase
  110. 343.33 s [Cabal] Phase: compileBuildDriverPhase
  111. 343.33 s [Cabal] setupCompileFlags: -package-db=/build/tmp.t8dmQsXjbO/setup-package.conf.d -threaded
  112. 343.39 s [Cabal] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.t8dmQsXjbO/Main.o )
  113. 343.46 s [Cabal] [2 of 2] Linking Setup
  114. 344.96 s [Cabal] Phase: updateAutotoolsGnuConfigScriptsPhase
  115. 344.97 s [Cabal] Phase: configurePhase
  116. 344.98 s [Cabal] configureFlags: --verbose --prefix=/nix/store/na0m63ls6daw8iirfn81fr5z72c2333q-Cabal-3.12.1.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/s7ffg172jj99gyhhv10ydsm2j0lrhddy-Cabal-3.12.1.0-doc/share/doc/Cabal-3.12.1.0 --with-gcc=gcc --package-db=/build/tmp.t8dmQsXjbO/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
  117. 344.99 s [Cabal] Using Parsec parser
  118. 344.99 s [Cabal] Configuring Cabal-3.12.1.0...
  119. 345.63 s [Cabal] Dependency Cabal-syntax >=3.12.1.0 && <3.13: using Cabal-syntax-3.12.1.0
  120. 345.63 s [Cabal] Dependency array >=0.4.0.1 && <0.6: using array-0.5.8.0
  121. 345.63 s [Cabal] Dependency base >=4.11 && <5: using base-4.20.1.0
  122. 345.63 s [Cabal] Dependency bytestring >=0.10.0.0 && <0.13: using bytestring-0.12.2.0
  123. 345.63 s [Cabal] Dependency containers >=0.5.0.0 && <0.8: using containers-0.7
  124. 345.63 s [Cabal] Dependency deepseq >=1.3.0.1 && <1.6: using deepseq-1.5.0.0
  125. 345.63 s [Cabal] Dependency directory >=1.2 && <1.4: using directory-1.3.8.5
  126. 345.63 s [Cabal] Dependency filepath >=1.3.0.1 && <1.6: using filepath-1.5.4.0
  127. 345.63 s [Cabal] Dependency mtl >=2.1 && <2.4: using mtl-2.3.1
  128. 345.63 s [Cabal] Dependency parsec >=3.1.13.0 && <3.2: using parsec-3.1.18.0
  129. 345.63 s [Cabal] Dependency pretty >=1.1.1 && <1.2: using pretty-1.1.3.6
  130. 345.63 s [Cabal] Dependency process >=1.2.1.0 && <1.7: using process-1.6.25.0
  131. 345.63 s [Cabal] Dependency time >=1.4.0.1 && <1.15: using time-1.12.2
  132. 345.63 s [Cabal] Dependency transformers >=0.3 && <0.4 || >=0.4.1.0 && <0.7: using
  133. 345.63 s [Cabal] transformers-0.6.1.1
  134. 345.63 s [Cabal] Dependency unix >=2.6.0.0 && <2.9: using unix-2.8.6.0
  135. 345.63 s [Cabal] Source component graph: component lib
  136. 345.63 s [Cabal] Configured component graph:
  137. 345.63 s [Cabal] component Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt
  138. 345.63 s [Cabal] include Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK
  139. 345.63 s [Cabal] include array-0.5.8.0-e5b8
  140. 345.63 s [Cabal] include base-4.20.1.0-2277
  141. 345.63 s [Cabal] include bytestring-0.12.2.0-5835
  142. 345.63 s [Cabal] include containers-0.7-dff9
  143. 345.63 s [Cabal] include deepseq-1.5.0.0-f20c
  144. 345.63 s [Cabal] include directory-1.3.8.5-ad1a
  145. 345.63 s [Cabal] include filepath-1.5.4.0-590e
  146. 345.63 s [Cabal] include mtl-2.3.1-5ae5
  147. 345.63 s [Cabal] include parsec-3.1.18.0-2564
  148. 345.63 s [Cabal] include pretty-1.1.3.6-413e
  149. 345.63 s [Cabal] include process-1.6.25.0-d21a
  150. 345.63 s [Cabal] include time-1.12.2-18ff
  151. 345.63 s [Cabal] include transformers-0.6.1.1-407f
  152. 345.63 s [Cabal] include unix-2.8.6.0-bc28
  153. 345.63 s [Cabal] Linked component graph:
  154. 345.63 s [Cabal] unit Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt
  155. 345.63 s [Cabal] include Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK
  156. 345.63 s [Cabal] include array-0.5.8.0-e5b8
  157. 345.63 s [Cabal] include base-4.20.1.0-2277
  158. 345.63 s [Cabal] include bytestring-0.12.2.0-5835
  159. 345.63 s [Cabal] include containers-0.7-dff9
  160. 345.63 s [Cabal] include deepseq-1.5.0.0-f20c
  161. 345.63 s [Cabal] include directory-1.3.8.5-ad1a
  162. 345.63 s [Cabal] include filepath-1.5.4.0-590e
  163. 345.63 s [Cabal] include mtl-2.3.1-5ae5
  164. 345.63 s [Cabal] include parsec-3.1.18.0-2564
  165. 345.63 s [Cabal] include pretty-1.1.3.6-413e
  166. 345.63 s [Cabal] include process-1.6.25.0-d21a
  167. 345.63 s [Cabal] include time-1.12.2-18ff
  168. 345.63 s [Cabal] include transformers-0.6.1.1-407f
  169. 345.63 s [Cabal] include unix-2.8.6.0-bc28
  170. 345.64 s [Cabal] Distribution.Backpack=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Backpack,Distribution.Backpack.ComponentsGraph=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Backpack.ComponentsGraph,Distribution.Backpack.Configure=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Backpack.Configure,Distribution.Backpack.ConfiguredComponent=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Backpack.ConfiguredComponent,Distribution.Backpack.DescribeUnitId=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Backpack.DescribeUnitId,Distribution.Backpack.FullUnitId=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Backpack.FullUnitId,Distribution.Backpack.LinkedComponent=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Backpack.LinkedComponent,Distribution.Backpack.ModSubst=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Backpack.ModSubst,Distribution.Backpack.ModuleShape=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Backpack.ModuleShape,Distribution.Backpack.PreModuleShape=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Backpack.PreModuleShape,Distribution.CabalSpecVersion=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.CabalSpecVersion,Distribution.Compat.Binary=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Compat.Binary,Distribution.Compat.CharParsing=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Compat.CharParsing,Distribution.Compat.CreatePipe=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Compat.CreatePipe,Distribution.Compat.DList=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Compat.DList,Distribution.Compat.Directory=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Compat.Directory,Distribution.Compat.Environment=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Compat.Environment,Distribution.Compat.Exception=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Compat.Exception,Distribution.Compat.FilePath=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Compat.FilePath,Distribution.Compat.Graph=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Compat.Graph,Distribution.Compat.Internal.TempFile=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Compat.Internal.TempFile,Distribution.Compat.Lens=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Compat.Lens,Distribution.Compat.MonadFail=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Compat.MonadFail,Distribution.Compat.Newtype=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Compat.Newtype,Distribution.Compat.NonEmptySet=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Compat.NonEmptySet,Distribution.Compat.Parsing=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Compat.Parsing,Distribution.Compat.Prelude=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Compat.Prelude,Distribution.Compat.Prelude.Internal=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Compat.Prelude.Internal,Distribution.Compat.Process=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Compat.Process,Distribution.Compat.ResponseFile=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Compat.ResponseFile,Distribution.Compat.Semigroup=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Compat.Semigroup,Distribution.Compat.Stack=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Compat.Stack,Distribution.Compat.Time=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Compat.Time,Distribution.Compat.Typeable=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Compat.Typeable,Distribution.Compiler=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Compiler,Distribution.FieldGrammar=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.FieldGrammar,Distribution.FieldGrammar.Class=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.FieldGrammar.Class,Distribution.FieldGrammar.FieldDescrs=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.FieldGrammar.FieldDescrs,Distribution.FieldGrammar.Newtypes=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.FieldGrammar.Newtypes,Distribution.FieldGrammar.Parsec=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.FieldGrammar.Parsec,Distribution.FieldGrammar.Pretty=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.FieldGrammar.Pretty,Distribution.Fields=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Fields,Distribution.Fields.ConfVar=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Fields.ConfVar,Distribution.Fields.Field=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Fields.Field,Distribution.Fields.Lexer=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Fields.Lexer,Distribution.Fields.LexerMonad=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Fields.LexerMonad,Distribution.Fields.ParseResult=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Fields.ParseResult,Distribution.Fields.Parser=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Fields.Parser,Distribution.Fields.Pretty=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Fields.Pretty,Distribution.InstalledPackageInfo=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.InstalledPackageInfo,Distribution.License=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.License,Distribution.Make=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Make,Distribution.ModuleName=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.ModuleName,Distribution.Package=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Package,Distribution.PackageDescription=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.PackageDescription,Distribution.PackageDescription.Check=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.PackageDescription.Check,Distribution.PackageDescription.Configuration=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.PackageDescription.Configuration,Distribution.PackageDescription.FieldGrammar=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.PackageDescription.FieldGrammar,Distribution.PackageDescription.Parsec=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.PackageDescription.Parsec,Distribution.PackageDescription.PrettyPrint=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.PackageDescription.PrettyPrint,Distribution.PackageDescription.Quirks=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.PackageDescription.Quirks,Distribution.PackageDescription.Utils=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.PackageDescription.Utils,Distribution.Parsec=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Parsec,Distribution.Parsec.Error=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Parsec.Error,Distribution.Parsec.FieldLineStream=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Parsec.FieldLineStream,Distribution.Parsec.Position=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Parsec.Position,Distribution.Parsec.Warning=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Parsec.Warning,Distribution.Pretty=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Pretty,Distribution.ReadE=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.ReadE,Distribution.SPDX=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.SPDX,Distribution.SPDX.License=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.SPDX.License,Distribution.SPDX.LicenseExceptionId=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.SPDX.LicenseExceptionId,Distribution.SPDX.LicenseExpression=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.SPDX.LicenseExpression,Distribution.SPDX.LicenseId=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.SPDX.LicenseId,Distribution.SPDX.LicenseListVersion=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.SPDX.LicenseListVersion,Distribution.SPDX.LicenseReference=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.SPDX.LicenseReference,Distribution.Simple=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Simple,Distribution.Simple.Bench=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Simple.Bench,Distribution.Simple.Build=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Simple.Build,Distribution.Simple.Build.Inputs=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Simple.Build.Inputs,Distribution.Simple.Build.Macros=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Simple.Build.Macros,Distribution.Simple.Build.PackageInfoModule=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Simple.Build.PackageInfoModule,Distribution.Simple.Build.PathsModule=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Simple.Build.PathsModule,Distribution.Simple.BuildPaths=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Simple.BuildPaths,Distribution.Simple.BuildTarget=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Simple.BuildTarget,Distribution.Simple.BuildToolDepends=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Simple.BuildToolDepends,Distribution.Simple.CCompiler=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Simple.CCompiler,Distribution.Simple.Command=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Simple.Command,Distribution.Simple.Compiler=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Simple.Compiler,Distribution.Simple.Configure=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Simple.Configure,Distribution.Simple.Errors=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Simple.Errors,Distribution.Simple.Flag=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Simple.Flag,Distribution.Simple.GHC=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Simple.GHC,Distribution.Simple.GHCJS=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Simple.GHCJS,Distribution.Simple.Glob=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Simple.Glob,Distribution.Simple.Glob.Internal=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Simple.Glob.Internal,Distribution.Simple.Haddock=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Simple.Haddock,Distribution.Simple.HaskellSuite=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Simple.HaskellSuite,Distribution.Simple.Hpc=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Simple.Hpc,Distribution.Simple.Install=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Simple.Install,Distribution.Simple.InstallDirs=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Simple.InstallDirs,Distribution.Simple.InstallDirs.Internal=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Simple.InstallDirs.Internal,Distribution.Simple.LocalBuildInfo=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Simple.LocalBuildInfo,Distribution.Simple.PackageDescription=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Simple.PackageDescription,Distribution.Simple.PackageIndex=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Simple.PackageIndex,Distribution.Simple.PreProcess=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Simple.PreProcess,Distribution.Simple.PreProcess.Types=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Simple.PreProcess.Types,Distribution.Simple.PreProcess.Unlit=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Simple.PreProcess.Unlit,Distribution.Simple.Program=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Simple.Program,Distribution.Simple.Program.Ar=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Simple.Program.Ar,Distribution.Simple.Program.Builtin=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Simple.Program.Builtin,Distribution.Simple.Program.Db=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Simple.Program.Db,Distribution.Simple.Program.Find=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Simple.Program.Find,Distribution.Simple.Program.GHC=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Simple.Program.GHC,Distribution.Simple.Program.HcPkg=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Simple.Program.HcPkg,Distribution.Simple.Program.Hpc=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Simple.Program.Hpc,Distribution.Simple.Program.Internal=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Simple.Program.Internal,Distribution.Simple.Program.Ld=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Simple.Program.Ld,Distribution.Simple.Program.ResponseFile=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Simple.Program.ResponseFile,Distribution.Simple.Program.Run=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Simple.Program.Run,Distribution.Simple.Program.Script=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Simple.Program.Script,Distribution.Simple.Program.Strip=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Simple.Program.Strip,Distribution.Simple.Program.Types=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Simple.Program.Types,Distribution.Simple.Register=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Simple.Register,Distribution.Simple.Setup=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Simple.Setup,Distribution.Simple.ShowBuildInfo=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Simple.ShowBuildInfo,Distribution.Simple.SrcDist=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Simple.SrcDist,Distribution.Simple.Test=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Simple.Test,Distribution.Simple.Test.ExeV10=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Simple.Test.ExeV10,Distribution.Simple.Test.LibV09=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Simple.Test.LibV09,Distribution.Simple.Test.Log=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Simple.Test.Log,Distribution.Simple.UHC=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Simple.UHC,Distribution.Simple.UserHooks=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Simple.UserHooks,Distribution.Simple.Utils=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Simple.Utils,Distribution.System=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.System,Distribution.TestSuite=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.TestSuite,Distribution.Text=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Text,Distribution.Types.AbiDependency=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Types.AbiDependency,Distribution.Types.AbiHash=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Types.AbiHash,Distribution.Types.AnnotatedId=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Types.AnnotatedId,Distribution.Types.Benchmark=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Types.Benchmark,Distribution.Types.Benchmark.Lens=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Types.Benchmark.Lens,Distribution.Types.BenchmarkInterface=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Types.BenchmarkInterface,Distribution.Types.BenchmarkType=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Types.BenchmarkType,Distribution.Types.BuildInfo=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Types.BuildInfo,Distribution.Types.BuildInfo.Lens=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Types.BuildInfo.Lens,Distribution.Types.BuildType=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Types.BuildType,Distribution.Types.Component=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Types.Component,Distribution.Types.ComponentId=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Types.ComponentId,Distribution.Types.ComponentInclude=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Types.ComponentInclude,Distribution.Types.ComponentLocalBuildInfo=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Types.ComponentLocalBuildInfo,Distribution.Types.ComponentName=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Types.ComponentName,Distribution.Types.ComponentRequestedSpec=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Types.ComponentRequestedSpec,Distribution.Types.CondTree=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Types.CondTree,Distribution.Types.Condition=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Types.Condition,Distribution.Types.ConfVar=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Types.ConfVar,Distribution.Types.Dependency=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Types.Dependency,Distribution.Types.DependencyMap=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Types.DependencyMap,Distribution.Types.DumpBuildInfo=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Types.DumpBuildInfo,Distribution.Types.ExeDependency=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Types.ExeDependency,Distribution.Types.Executable=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Types.Executable,Distribution.Types.Executable.Lens=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Types.Executable.Lens,Distribution.Types.ExecutableScope=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Types.ExecutableScope,Distribution.Types.ExposedModule=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Types.ExposedModule,Distribution.Types.Flag=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Types.Flag,Distribution.Types.ForeignLib=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Types.ForeignLib,Distribution.Types.ForeignLib.Lens=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Types.ForeignLib.Lens,Distribution.Types.ForeignLibOption=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Types.ForeignLibOption,Distribution.Types.ForeignLibType=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Types.ForeignLibType,Distribution.Types.GenericPackageDescription=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Types.GenericPackageDescription,Distribution.Types.GenericPackageDescription.Lens=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Types.GenericPackageDescription.Lens,Distribution.Types.GivenComponent=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Types.GivenComponent,Distribution.Types.HookedBuildInfo=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Types.HookedBuildInfo,Distribution.Types.IncludeRenaming=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Types.IncludeRenaming,Distribution.Types.InstalledPackageInfo=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Types.InstalledPackageInfo,Distribution.Types.InstalledPackageInfo.FieldGrammar=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Types.InstalledPackageInfo.FieldGrammar,Distribution.Types.InstalledPackageInfo.Lens=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Types.InstalledPackageInfo.Lens,Distribution.Types.LegacyExeDependency=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Types.LegacyExeDependency,Distribution.Types.Lens=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Types.Lens,Distribution.Types.Library=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Types.Library,Distribution.Types.Library.Lens=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Types.Library.Lens,Distribution.Types.LibraryName=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Types.LibraryName,Distribution.Types.LibraryVisibility=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Types.LibraryVisibility,Distribution.Types.LocalBuildConfig=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Types.LocalBuildConfig,Distribution.Types.LocalBuildInfo=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Types.LocalBuildInfo,Distribution.Types.Mixin=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Types.Mixin,Distribution.Types.Module=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Types.Module,Distribution.Types.ModuleReexport=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Types.ModuleReexport,Distribution.Types.ModuleRenaming=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Types.ModuleRenaming,Distribution.Types.MungedPackageId=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Types.MungedPackageId,Distribution.Types.MungedPackageName=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Types.MungedPackageName,Distribution.Types.PackageDescription=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Types.PackageDescription,Distribution.Types.PackageDescription.Lens=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Types.PackageDescription.Lens,Distribution.Types.PackageId=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Types.PackageId,Distribution.Types.PackageId.Lens=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Types.PackageId.Lens,Distribution.Types.PackageName=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Types.PackageName,Distribution.Types.PackageName.Magic=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Types.PackageName.Magic,Distribution.Types.PackageVersionConstraint=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Types.PackageVersionConstraint,Distribution.Types.ParStrat=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Types.ParStrat,Distribution.Types.PkgconfigDependency=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Types.PkgconfigDependency,Distribution.Types.PkgconfigName=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Types.PkgconfigName,Distribution.Types.PkgconfigVersion=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Types.PkgconfigVersion,Distribution.Types.PkgconfigVersionRange=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Types.PkgconfigVersionRange,Distribution.Types.SetupBuildInfo=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Types.SetupBuildInfo,Distribution.Types.SetupBuildInfo.Lens=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Types.SetupBuildInfo.Lens,Distribution.Types.SourceRepo=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Types.SourceRepo,Distribution.Types.SourceRepo.Lens=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Types.SourceRepo.Lens,Distribution.Types.TargetInfo=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Types.TargetInfo,Distribution.Types.TestSuite=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Types.TestSuite,Distribution.Types.TestSuite.Lens=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Types.TestSuite.Lens,Distribution.Types.TestSuiteInterface=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Types.TestSuiteInterface,Distribution.Types.TestType=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Types.TestType,Distribution.Types.UnitId=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Types.UnitId,Distribution.Types.UnqualComponentName=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Types.UnqualComponentName,Distribution.Types.Version=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Types.Version,Distribution.Types.VersionInterval=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Types.VersionInterval,Distribution.Types.VersionInterval.Legacy=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Types.VersionInterval.Legacy,Distribution.Types.VersionRange=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Types.VersionRange,Distribution.Types.VersionRange.Internal=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Types.VersionRange.Internal,Distribution.Utils.Base62=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Utils.Base62,Distribution.Utils.Generic=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Utils.Generic,Distribution.Utils.IOData=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Utils.IOData,Distribution.Utils.Json=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Utils.Json,Distribution.Utils.LogProgress=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Utils.LogProgress,Distribution.Utils.MD5=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Utils.MD5,Distribution.Utils.MapAccum=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Utils.MapAccum,Distribution.Utils.NubList=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Utils.NubList,Distribution.Utils.Path=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Utils.Path,Distribution.Utils.Progress=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Utils.Progress,Distribution.Utils.ShortText=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Utils.ShortText,Distribution.Utils.String=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Utils.String,Distribution.Utils.Structured=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Utils.Structured,Distribution.Verbosity=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Verbosity,Distribution.Verbosity.Internal=Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt:Distribution.Verbosity.Internal,Distribution.Version=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Distribution.Version,Language.Haskell.Extension=Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK:Language.Haskell.Extension
  171. 345.64 s [Cabal] Ready component graph:
  172. 345.64 s [Cabal] definite Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt
  173. 345.64 s [Cabal] depends Cabal-syntax-3.12.1.0-FtRyXPc0SUc94lPiMNhreK
  174. 345.64 s [Cabal] depends array-0.5.8.0-e5b8
  175. 345.64 s [Cabal] depends base-4.20.1.0-2277
  176. 345.64 s [Cabal] depends bytestring-0.12.2.0-5835
  177. 345.64 s [Cabal] depends containers-0.7-dff9
  178. 345.64 s [Cabal] depends deepseq-1.5.0.0-f20c
  179. 345.64 s [Cabal] depends directory-1.3.8.5-ad1a
  180. 345.64 s [Cabal] depends filepath-1.5.4.0-590e
  181. 345.64 s [Cabal] depends mtl-2.3.1-5ae5
  182. 345.64 s [Cabal] depends parsec-3.1.18.0-2564
  183. 345.64 s [Cabal] depends pretty-1.1.3.6-413e
  184. 345.64 s [Cabal] depends process-1.6.25.0-d21a
  185. 345.64 s [Cabal] depends time-1.12.2-18ff
  186. 345.64 s [Cabal] depends transformers-0.6.1.1-407f
  187. 345.64 s [Cabal] depends unix-2.8.6.0-bc28
  188. 345.64 s [Cabal] Using Cabal-3.12.1.0 compiled by ghc-9.10
  189. 345.64 s [Cabal] Using compiler: ghc-9.10.2
  190. 345.64 s [Cabal] Using install prefix:
  191. 345.64 s [Cabal] /nix/store/na0m63ls6daw8iirfn81fr5z72c2333q-Cabal-3.12.1.0
  192. 345.64 s [Cabal] Executables installed in:
  193. 345.64 s [Cabal] /nix/store/na0m63ls6daw8iirfn81fr5z72c2333q-Cabal-3.12.1.0/bin
  194. 345.64 s [Cabal] Libraries installed in:
  195. 345.64 s [Cabal] /nix/store/na0m63ls6daw8iirfn81fr5z72c2333q-Cabal-3.12.1.0/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-1e2a/Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt
  196. 345.64 s [Cabal] Dynamic Libraries installed in:
  197. 345.64 s [Cabal] /nix/store/na0m63ls6daw8iirfn81fr5z72c2333q-Cabal-3.12.1.0/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-1e2a
  198. 345.64 s [Cabal] Private executables installed in:
  199. 345.64 s [Cabal] /nix/store/na0m63ls6daw8iirfn81fr5z72c2333q-Cabal-3.12.1.0/libexec/x86_64-linux-ghc-9.10.2-1e2a/Cabal-3.12.1.0
  200. 345.64 s [Cabal] Data files installed in:
  201. 345.64 s [Cabal] /nix/store/na0m63ls6daw8iirfn81fr5z72c2333q-Cabal-3.12.1.0/share/x86_64-linux-ghc-9.10.2-1e2a/Cabal-3.12.1.0
  202. 345.64 s [Cabal] Documentation installed in:
  203. 345.64 s [Cabal] /nix/store/s7ffg172jj99gyhhv10ydsm2j0lrhddy-Cabal-3.12.1.0-doc/share/doc/Cabal-3.12.1.0
  204. 345.64 s [Cabal] Configuration files installed in:
  205. 345.64 s [Cabal] /nix/store/na0m63ls6daw8iirfn81fr5z72c2333q-Cabal-3.12.1.0/etc
  206. 345.64 s [Cabal] No alex found
  207. 345.64 s [Cabal] Using ar found on system at:
  208. 345.64 s [Cabal] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
  209. 345.64 s [Cabal] No c2hs found
  210. 345.64 s [Cabal] No cpphs found
  211. 345.64 s [Cabal] No doctest found
  212. 345.64 s [Cabal] Using gcc version 14.3.0 given by user at:
  213. 345.64 s [Cabal] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
  214. 345.64 s [Cabal] Using ghc version 9.10.2 found on system at:
  215. 345.64 s [Cabal] /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/bin/ghc
  216. 345.64 s [Cabal] Using ghc-pkg version 9.10.2 found on system at:
  217. 345.64 s [Cabal] /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/bin/ghc-pkg-9.10.2
  218. 345.64 s [Cabal] No ghcjs found
  219. 345.64 s [Cabal] No ghcjs-pkg found
  220. 345.64 s [Cabal] No greencard found
  221. 345.64 s [Cabal] Using haddock version 2.31.0 found on system at:
  222. 345.64 s [Cabal] /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/bin/haddock-ghc-9.10.2
  223. 345.64 s [Cabal] No happy found
  224. 345.64 s [Cabal] Using haskell-suite found on system at: haskell-suite-dummy-location
  225. 345.64 s [Cabal] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  226. 345.64 s [Cabal] No hmake found
  227. 345.64 s [Cabal] Using hpc version 0.69 found on system at:
  228. 345.64 s [Cabal] /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/bin/hpc-ghc-9.10.2
  229. 345.64 s [Cabal] Using hsc2hs version 0.68.10 found on system at:
  230. 345.64 s [Cabal] /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/bin/hsc2hs-ghc-9.10.2
  231. 345.64 s [Cabal] Using hscolour version 1.25 found on system at:
  232. 345.64 s [Cabal] /nix/store/kb4afndnwdxxc5ps9k8xv0jzd0a9y8n5-hscolour-1.25/bin/HsColour
  233. 345.64 s [Cabal] No jhc found
  234. 345.64 s [Cabal] Using ld found on system at:
  235. 345.64 s [Cabal] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/ld
  236. 345.64 s [Cabal] No pkg-config found
  237. 345.64 s [Cabal] Using runghc version 9.10.2 found on system at:
  238. 345.64 s [Cabal] /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/bin/runghc-9.10.2
  239. 345.64 s [Cabal] Using strip version 2.44 found on system at:
  240. 345.64 s [Cabal] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
  241. 345.64 s [Cabal] Using tar found on system at:
  242. 345.64 s [Cabal] /nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
  243. 345.64 s [Cabal] No uhc found
  244. 345.77 s [Cabal] Phase: buildPhase
  245. 345.82 s [Cabal] Preprocessing library for Cabal-3.12.1.0...
  246. 345.84 s [Cabal] Building library for Cabal-3.12.1.0...
  247. 346.83 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 )
  248. 347.77 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 )
  249. 347.80 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 )
  250. 347.93 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 )
  251. 348.24 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 )
  252. 348.56 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 )
  253. 348.56 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 )
  254. 348.56 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 )
  255. 348.56 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 )
  256. 348.56 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 )
  257. 348.56 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 )
  258. 348.56 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 )
  259. 348.56 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 )
  260. 348.56 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 )
  261. 348.56 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 )
  262. 348.56 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 )
  263. 348.56 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 )
  264. 348.56 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 )
  265. 348.56 s [Cabal] [ 19 of 146] Compiling Distribution.GetOpt ( src/Distribution/GetOpt.hs, dist/build/Distribution/GetOpt.o, dist/build/Distribution/GetOpt.dyn_o )
  266. 348.56 s [Cabal] [ 20 of 146] Compiling Distribution.Lex ( src/Distribution/Lex.hs, dist/build/Distribution/Lex.o, dist/build/Distribution/Lex.dyn_o )
  267. 348.56 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 )
  268. 352.44 s [Cabal] [ 22 of 146] Compiling Distribution.ReadE ( src/Distribution/ReadE.hs, dist/build/Distribution/ReadE.o, dist/build/Distribution/ReadE.dyn_o )
  269. 352.44 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 )
  270. 352.44 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 )
  271. 352.44 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 )
  272. 352.44 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 )
  273. 352.44 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 )
  274. 352.44 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 )
  275. 352.44 s [Cabal] [ 29 of 146] Compiling Distribution.TestSuite ( src/Distribution/TestSuite.hs, dist/build/Distribution/TestSuite.o, dist/build/Distribution/TestSuite.dyn_o )
  276. 352.44 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 )
  277. 352.44 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 )
  278. 352.44 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 )
  279. 352.44 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 )
  280. 352.44 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 )
  281. 352.44 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 )
  282. 352.44 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 )
  283. 352.44 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 )
  284. 352.44 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 )
  285. 352.44 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 )
  286. 352.44 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 )
  287. 352.44 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 )
  288. 352.44 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 )
  289. 352.44 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 )
  290. 352.44 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 )
  291. 352.44 s [Cabal] [ 45 of 146] Compiling Distribution.Verbosity ( src/Distribution/Verbosity.hs, dist/build/Distribution/Verbosity.o, dist/build/Distribution/Verbosity.dyn_o )
  292. 352.44 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 )
  293. 352.44 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 )
  294. 352.44 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 )
  295. 353.14 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 )
  296. 353.32 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 )
  297. 353.32 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 )
  298. 353.32 s [Cabal] [ 52 of 146] Compiling Distribution.ZinzaPrelude ( src/Distribution/ZinzaPrelude.hs, dist/build/Distribution/ZinzaPrelude.o, dist/build/Distribution/ZinzaPrelude.dyn_o )
  299. 353.32 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 )
  300. 353.32 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 )
  301. 353.32 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 )
  302. 353.32 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 )
  303. 353.32 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 )
  304. 354.74 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 )
  305. 355.16 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 )
  306. 355.17 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 )
  307. 355.26 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 )
  308. 355.44 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 )
  309. 355.44 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 )
  310. 355.44 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 )
  311. 355.44 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 )
  312. 357.30 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 )
  313. 357.31 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 )
  314. 357.31 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 )
  315. 357.31 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 )
  316. 357.31 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 )
  317. 357.31 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 )
  318. 357.31 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 )
  319. 357.31 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 )
  320. 357.36 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 )
  321. 357.36 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 )
  322. 359.27 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 )
  323. 359.48 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 )
  324. 359.95 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 )
  325. 360.02 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 )
  326. 360.13 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 )
  327. 360.13 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 )
  328. 360.30 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 )
  329. 362.67 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 )
  330. 362.67 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 )
  331. 362.67 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 )
  332. 362.67 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 )
  333. 362.67 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 )
  334. 362.67 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 )
  335. 363.63 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 )
  336. 363.63 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 )
  337. 363.63 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 )
  338. 367.01 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 )
  339. 368.85 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 )
  340. 369.66 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 )
  341. 370.01 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 )
  342. 371.14 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 )
  343. 371.14 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 )
  344. 371.14 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 )
  345. 371.15 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 )
  346. 371.15 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 )
  347. 371.75 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 )
  348. 373.22 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 )
  349. 373.23 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 )
  350. 373.23 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 )
  351. 373.23 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 )
  352. 373.23 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 )
  353. 373.23 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 )
  354. 373.23 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 )
  355. 373.23 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 )
  356. 373.23 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 )
  357. 373.23 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 )
  358. 373.81 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 )
  359. 373.81 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 )
  360. 373.81 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 )
  361. 373.81 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 )
  362. 373.81 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 )
  363. 373.81 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 )
  364. 375.97 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 )
  365. 375.97 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 )
  366. 375.97 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 )
  367. 375.97 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 )
  368. 375.97 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 )
  369. 375.97 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 )
  370. 376.27 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 )
  371. 376.50 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 )
  372. 376.69 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 )
  373. 376.69 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 )
  374. 376.69 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 )
  375. 376.69 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 )
  376. 376.69 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 )
  377. 376.69 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 )
  378. 377.16 s [Cabal] [132 of 146] Compiling Distribution.Make ( src/Distribution/Make.hs, dist/build/Distribution/Make.o, dist/build/Distribution/Make.dyn_o )
  379. 377.16 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 )
  380. 377.16 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 )
  381. 377.16 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 )
  382. 377.16 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 )
  383. 377.16 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 )
  384. 377.16 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 )
  385. 377.16 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 )
  386. 377.16 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 )
  387. 377.16 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 )
  388. 381.71 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 )
  389. 381.96 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 )
  390. 382.27 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 )
  391. 382.84 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 )
  392. 384.48 s [Cabal] [146 of 146] Compiling Distribution.Simple ( src/Distribution/Simple.hs, dist/build/Distribution/Simple.o, dist/build/Distribution/Simple.dyn_o )
  393. 386.53 s [Cabal] [ 1 of 146] Compiling Distribution.Backpack.FullUnitId ( src/Distribution/Backpack/FullUnitId.hs, dist/build/Distribution/Backpack/FullUnitId.p_o )
  394. 387.39 s [Cabal] [ 2 of 146] Compiling Distribution.Backpack.ModSubst ( src/Distribution/Backpack/ModSubst.hs, dist/build/Distribution/Backpack/ModSubst.p_o )
  395. 387.40 s [Cabal] [ 3 of 146] Compiling Distribution.Backpack.ModuleScope ( src/Distribution/Backpack/ModuleScope.hs, dist/build/Distribution/Backpack/ModuleScope.p_o )
  396. 387.86 s [Cabal] [ 4 of 146] Compiling Distribution.Backpack.ModuleShape ( src/Distribution/Backpack/ModuleShape.hs, dist/build/Distribution/Backpack/ModuleShape.p_o )
  397. 387.97 s [Cabal] [ 5 of 146] Compiling Distribution.Backpack.PreModuleShape ( src/Distribution/Backpack/PreModuleShape.hs, dist/build/Distribution/Backpack/PreModuleShape.p_o )
  398. 388.32 s [Cabal] [ 6 of 146] Compiling Distribution.Compat.Async ( src/Distribution/Compat/Async.hs, dist/build/Distribution/Compat/Async.p_o )
  399. 388.32 s [Cabal] [ 7 of 146] Compiling Distribution.Compat.CreatePipe ( src/Distribution/Compat/CreatePipe.hs, dist/build/Distribution/Compat/CreatePipe.p_o )
  400. 388.32 s [Cabal] [ 8 of 146] Compiling Distribution.Compat.Directory ( src/Distribution/Compat/Directory.hs, dist/build/Distribution/Compat/Directory.p_o )
  401. 388.32 s [Cabal] [ 9 of 146] Compiling Distribution.Compat.FilePath ( src/Distribution/Compat/FilePath.hs, dist/build/Distribution/Compat/FilePath.p_o )
  402. 388.32 s [Cabal] [ 10 of 146] Compiling Distribution.Compat.GetShortPathName ( src/Distribution/Compat/GetShortPathName.hs, dist/build/Distribution/Compat/GetShortPathName.p_o )
  403. 388.32 s [Cabal] [ 11 of 146] Compiling Distribution.Compat.Internal.TempFile ( src/Distribution/Compat/Internal/TempFile.hs, dist/build/Distribution/Compat/Internal/TempFile.p_o )
  404. 388.32 s [Cabal] [ 12 of 146] Compiling Distribution.Compat.CopyFile ( src/Distribution/Compat/CopyFile.hs, dist/build/Distribution/Compat/CopyFile.p_o )
  405. 388.32 s [Cabal] [ 13 of 146] Compiling Distribution.Compat.Prelude.Internal ( src/Distribution/Compat/Prelude/Internal.hs, dist/build/Distribution/Compat/Prelude/Internal.p_o )
  406. 388.32 s [Cabal] [ 14 of 146] Compiling Distribution.Compat.Process ( src/Distribution/Compat/Process.hs, dist/build/Distribution/Compat/Process.p_o )
  407. 388.32 s [Cabal] [ 15 of 146] Compiling Distribution.Compat.ResponseFile ( src/Distribution/Compat/ResponseFile.hs, dist/build/Distribution/Compat/ResponseFile.p_o )
  408. 388.32 s [Cabal] [ 16 of 146] Compiling Distribution.Compat.SnocList ( src/Distribution/Compat/SnocList.hs, dist/build/Distribution/Compat/SnocList.p_o )
  409. 388.32 s [Cabal] [ 17 of 146] Compiling Distribution.Compat.Stack ( src/Distribution/Compat/Stack.hs, dist/build/Distribution/Compat/Stack.p_o )
  410. 388.32 s [Cabal] [ 18 of 146] Compiling Distribution.Compat.Environment ( src/Distribution/Compat/Environment.hs, dist/build/Distribution/Compat/Environment.p_o )
  411. 388.32 s [Cabal] [ 19 of 146] Compiling Distribution.GetOpt ( src/Distribution/GetOpt.hs, dist/build/Distribution/GetOpt.p_o )
  412. 388.32 s [Cabal] [ 20 of 146] Compiling Distribution.Lex ( src/Distribution/Lex.hs, dist/build/Distribution/Lex.p_o )
  413. 388.32 s [Cabal] [ 21 of 146] Compiling Distribution.PackageDescription.Check.Warning ( src/Distribution/PackageDescription/Check/Warning.hs, dist/build/Distribution/PackageDescription/Check/Warning.p_o )
  414. 390.40 s [Cabal] [ 22 of 146] Compiling Distribution.ReadE ( src/Distribution/ReadE.hs, dist/build/Distribution/ReadE.p_o )
  415. 390.40 s [Cabal] [ 23 of 146] Compiling Distribution.Simple.BuildToolDepends ( src/Distribution/Simple/BuildToolDepends.hs, dist/build/Distribution/Simple/BuildToolDepends.p_o )
  416. 390.40 s [Cabal] [ 24 of 146] Compiling Distribution.Simple.CCompiler ( src/Distribution/Simple/CCompiler.hs, dist/build/Distribution/Simple/CCompiler.p_o )
  417. 390.40 s [Cabal] [ 25 of 146] Compiling Distribution.Simple.Flag ( src/Distribution/Simple/Flag.hs, dist/build/Distribution/Simple/Flag.p_o )
  418. 390.40 s [Cabal] [ 26 of 146] Compiling Distribution.Simple.InstallDirs.Internal ( src/Distribution/Simple/InstallDirs/Internal.hs, dist/build/Distribution/Simple/InstallDirs/Internal.p_o )
  419. 390.40 s [Cabal] [ 27 of 146] Compiling Distribution.Simple.InstallDirs ( src/Distribution/Simple/InstallDirs.hs, dist/build/Distribution/Simple/InstallDirs.p_o )
  420. 390.40 s [Cabal] [ 28 of 146] Compiling Distribution.Simple.Program.Internal ( src/Distribution/Simple/Program/Internal.hs, dist/build/Distribution/Simple/Program/Internal.p_o )
  421. 390.40 s [Cabal] [ 29 of 146] Compiling Distribution.TestSuite ( src/Distribution/TestSuite.hs, dist/build/Distribution/TestSuite.p_o )
  422. 390.40 s [Cabal] [ 30 of 146] Compiling Distribution.Types.AnnotatedId ( src/Distribution/Types/AnnotatedId.hs, dist/build/Distribution/Types/AnnotatedId.p_o )
  423. 390.40 s [Cabal] [ 31 of 146] Compiling Distribution.Backpack.PreExistingComponent ( src/Distribution/Backpack/PreExistingComponent.hs, dist/build/Distribution/Backpack/PreExistingComponent.p_o )
  424. 390.40 s [Cabal] [ 32 of 146] Compiling Distribution.Types.ComponentInclude ( src/Distribution/Types/ComponentInclude.hs, dist/build/Distribution/Types/ComponentInclude.p_o )
  425. 390.40 s [Cabal] [ 33 of 146] Compiling Distribution.Types.ComponentLocalBuildInfo ( src/Distribution/Types/ComponentLocalBuildInfo.hs, dist/build/Distribution/Types/ComponentLocalBuildInfo.p_o )
  426. 390.40 s [Cabal] [ 34 of 146] Compiling Distribution.Types.DumpBuildInfo ( src/Distribution/Types/DumpBuildInfo.hs, dist/build/Distribution/Types/DumpBuildInfo.p_o )
  427. 390.40 s [Cabal] [ 35 of 146] Compiling Distribution.Types.GivenComponent ( src/Distribution/Types/GivenComponent.hs, dist/build/Distribution/Types/GivenComponent.p_o )
  428. 390.40 s [Cabal] [ 36 of 146] Compiling Distribution.Types.PackageName.Magic ( src/Distribution/Types/PackageName/Magic.hs, dist/build/Distribution/Types/PackageName/Magic.p_o )
  429. 390.40 s [Cabal] [ 37 of 146] Compiling Distribution.Types.ParStrat ( src/Distribution/Types/ParStrat.hs, dist/build/Distribution/Types/ParStrat.p_o )
  430. 390.40 s [Cabal] [ 38 of 146] Compiling Distribution.Types.TargetInfo ( src/Distribution/Types/TargetInfo.hs, dist/build/Distribution/Types/TargetInfo.p_o )
  431. 390.40 s [Cabal] [ 39 of 146] Compiling Distribution.Utils.IOData ( src/Distribution/Utils/IOData.hs, dist/build/Distribution/Utils/IOData.p_o )
  432. 390.40 s [Cabal] [ 40 of 146] Compiling Distribution.Utils.Json ( src/Distribution/Utils/Json.hs, dist/build/Distribution/Utils/Json.p_o )
  433. 390.40 s [Cabal] [ 41 of 146] Compiling Distribution.Utils.MapAccum ( src/Distribution/Utils/MapAccum.hs, dist/build/Distribution/Utils/MapAccum.p_o )
  434. 390.40 s [Cabal] [ 42 of 146] Compiling Distribution.Utils.Progress ( src/Distribution/Utils/Progress.hs, dist/build/Distribution/Utils/Progress.p_o )
  435. 390.40 s [Cabal] [ 43 of 146] Compiling Distribution.Utils.UnionFind ( src/Distribution/Utils/UnionFind.hs, dist/build/Distribution/Utils/UnionFind.p_o )
  436. 390.40 s [Cabal] [ 44 of 146] Compiling Distribution.Verbosity.Internal ( src/Distribution/Verbosity/Internal.hs, dist/build/Distribution/Verbosity/Internal.p_o )
  437. 390.40 s [Cabal] [ 45 of 146] Compiling Distribution.Verbosity ( src/Distribution/Verbosity.hs, dist/build/Distribution/Verbosity.p_o )
  438. 390.40 s [Cabal] [ 46 of 146] Compiling Distribution.Simple.Program.Types ( src/Distribution/Simple/Program/Types.hs, dist/build/Distribution/Simple/Program/Types.p_o )
  439. 390.40 s [Cabal] [ 47 of 146] Compiling Distribution.Simple.PreProcess.Types ( src/Distribution/Simple/PreProcess/Types.hs, dist/build/Distribution/Simple/PreProcess/Types.p_o )
  440. 390.40 s [Cabal] [ 48 of 146] Compiling Distribution.Simple.Errors ( src/Distribution/Simple/Errors.hs, dist/build/Distribution/Simple/Errors.p_o )
  441. 391.53 s [Cabal] [ 49 of 146] Compiling Distribution.Simple.PreProcess.Unlit ( src/Distribution/Simple/PreProcess/Unlit.hs, dist/build/Distribution/Simple/PreProcess/Unlit.p_o )
  442. 391.76 s [Cabal] [ 50 of 146] Compiling Distribution.Backpack.UnifyM ( src/Distribution/Backpack/UnifyM.hs, dist/build/Distribution/Backpack/UnifyM.p_o )
  443. 391.76 s [Cabal] [ 51 of 146] Compiling Distribution.Backpack.MixLink ( src/Distribution/Backpack/MixLink.hs, dist/build/Distribution/Backpack/MixLink.p_o )
  444. 391.76 s [Cabal] [ 52 of 146] Compiling Distribution.ZinzaPrelude ( src/Distribution/ZinzaPrelude.hs, dist/build/Distribution/ZinzaPrelude.p_o )
  445. 391.76 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 )
  446. 391.76 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 )
  447. 391.76 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 )
  448. 391.76 s [Cabal] [ 56 of 146] Compiling Paths_Cabal ( dist/build/autogen/Paths_Cabal.hs, dist/build/Paths_Cabal.p_o )
  449. 391.76 s [Cabal] [ 57 of 146] Compiling Distribution.Simple.Utils ( src/Distribution/Simple/Utils.hs, dist/build/Distribution/Simple/Utils.p_o )
  450. 392.87 s [Cabal] [ 58 of 146] Compiling Distribution.Utils.NubList ( src/Distribution/Utils/NubList.hs, dist/build/Distribution/Utils/NubList.p_o )
  451. 393.31 s [Cabal] [ 59 of 146] Compiling Distribution.Utils.LogProgress ( src/Distribution/Utils/LogProgress.hs, dist/build/Distribution/Utils/LogProgress.p_o )
  452. 393.32 s [Cabal] [ 60 of 146] Compiling Distribution.Simple.Program.Run ( src/Distribution/Simple/Program/Run.hs, dist/build/Distribution/Simple/Program/Run.p_o )
  453. 393.41 s [Cabal] [ 61 of 146] Compiling Distribution.Simple.Program.Script ( src/Distribution/Simple/Program/Script.hs, dist/build/Distribution/Simple/Program/Script.p_o )
  454. 393.62 s [Cabal] [ 62 of 146] Compiling Distribution.Simple.Program.ResponseFile ( src/Distribution/Simple/Program/ResponseFile.hs, dist/build/Distribution/Simple/Program/ResponseFile.p_o )
  455. 393.62 s [Cabal] [ 63 of 146] Compiling Distribution.Simple.Program.Hpc ( src/Distribution/Simple/Program/Hpc.hs, dist/build/Distribution/Simple/Program/Hpc.p_o )
  456. 393.62 s [Cabal] [ 64 of 146] Compiling Distribution.Simple.Program.Find ( src/Distribution/Simple/Program/Find.hs, dist/build/Distribution/Simple/Program/Find.p_o )
  457. 393.63 s [Cabal] [ 65 of 146] Compiling Distribution.Simple.PackageIndex ( src/Distribution/Simple/PackageIndex.hs, dist/build/Distribution/Simple/PackageIndex.p_o )
  458. 395.13 s [Cabal] [ 66 of 146] Compiling Distribution.Simple.PackageDescription ( src/Distribution/Simple/PackageDescription.hs, dist/build/Distribution/Simple/PackageDescription.p_o )
  459. 395.13 s [Cabal] [ 67 of 146] Compiling Distribution.Simple.Glob.Internal ( src/Distribution/Simple/Glob/Internal.hs, dist/build/Distribution/Simple/Glob/Internal.p_o )
  460. 395.13 s [Cabal] [ 68 of 146] Compiling Distribution.Simple.Glob ( src/Distribution/Simple/Glob.hs, dist/build/Distribution/Simple/Glob.p_o )
  461. 395.13 s [Cabal] [ 69 of 146] Compiling Distribution.PackageDescription.Check.Monad ( src/Distribution/PackageDescription/Check/Monad.hs, dist/build/Distribution/PackageDescription/Check/Monad.p_o )
  462. 395.13 s [Cabal] [ 70 of 146] Compiling Distribution.PackageDescription.Check.Conditional ( src/Distribution/PackageDescription/Check/Conditional.hs, dist/build/Distribution/PackageDescription/Check/Conditional.p_o )
  463. 395.13 s [Cabal] [ 71 of 146] Compiling Distribution.PackageDescription.Check.Common ( src/Distribution/PackageDescription/Check/Common.hs, dist/build/Distribution/PackageDescription/Check/Common.p_o )
  464. 395.13 s [Cabal] [ 72 of 146] Compiling Distribution.Simple.Compiler ( src/Distribution/Simple/Compiler.hs, dist/build/Distribution/Simple/Compiler.p_o )
  465. 395.13 s [Cabal] [ 73 of 146] Compiling Distribution.Simple.Program.HcPkg ( src/Distribution/Simple/Program/HcPkg.hs, dist/build/Distribution/Simple/Program/HcPkg.p_o )
  466. 395.30 s [Cabal] [ 74 of 146] Compiling Distribution.Simple.GHC.ImplInfo ( src/Distribution/Simple/GHC/ImplInfo.hs, dist/build/Distribution/Simple/GHC/ImplInfo.p_o )
  467. 395.30 s [Cabal] [ 75 of 146] Compiling Distribution.Simple.Program.GHC ( src/Distribution/Simple/Program/GHC.hs, dist/build/Distribution/Simple/Program/GHC.p_o )
  468. 396.86 s [Cabal] [ 76 of 146] Compiling Distribution.Simple.Program.Builtin ( src/Distribution/Simple/Program/Builtin.hs, dist/build/Distribution/Simple/Program/Builtin.p_o )
  469. 397.11 s [Cabal] [ 77 of 146] Compiling Distribution.Simple.Program.Db ( src/Distribution/Simple/Program/Db.hs, dist/build/Distribution/Simple/Program/Db.p_o )
  470. 397.51 s [Cabal] [ 78 of 146] Compiling Distribution.Simple.Program ( src/Distribution/Simple/Program.hs, dist/build/Distribution/Simple/Program.p_o )
  471. 397.64 s [Cabal] [ 79 of 146] Compiling Distribution.Simple.Program.Strip ( src/Distribution/Simple/Program/Strip.hs, dist/build/Distribution/Simple/Program/Strip.p_o )
  472. 397.77 s [Cabal] [ 80 of 146] Compiling Distribution.Simple.Command ( src/Distribution/Simple/Command.hs, dist/build/Distribution/Simple/Command.p_o )
  473. 397.77 s [Cabal] [ 81 of 146] Compiling Distribution.Simple.Setup.Common ( src/Distribution/Simple/Setup/Common.hs, dist/build/Distribution/Simple/Setup/Common.p_o )
  474. 397.91 s [Cabal] [ 82 of 146] Compiling Distribution.Simple.Setup.Test ( src/Distribution/Simple/Setup/Test.hs, dist/build/Distribution/Simple/Setup/Test.p_o )
  475. 398.97 s [Cabal] [ 83 of 146] Compiling Distribution.Simple.Setup.SDist ( src/Distribution/Simple/Setup/SDist.hs, dist/build/Distribution/Simple/Setup/SDist.p_o )
  476. 398.99 s [Cabal] [ 84 of 146] Compiling Distribution.Simple.Setup.Repl ( src/Distribution/Simple/Setup/Repl.hs, dist/build/Distribution/Simple/Setup/Repl.p_o )
  477. 398.99 s [Cabal] [ 85 of 146] Compiling Distribution.Simple.Setup.Register ( src/Distribution/Simple/Setup/Register.hs, dist/build/Distribution/Simple/Setup/Register.p_o )
  478. 398.99 s [Cabal] [ 86 of 146] Compiling Distribution.Simple.Setup.Install ( src/Distribution/Simple/Setup/Install.hs, dist/build/Distribution/Simple/Setup/Install.p_o )
  479. 398.99 s [Cabal] [ 87 of 146] Compiling Distribution.Simple.Setup.Hscolour ( src/Distribution/Simple/Setup/Hscolour.hs, dist/build/Distribution/Simple/Setup/Hscolour.p_o )
  480. 398.99 s [Cabal] [ 88 of 146] Compiling Distribution.Simple.Setup.Haddock ( src/Distribution/Simple/Setup/Haddock.hs, dist/build/Distribution/Simple/Setup/Haddock.p_o )
  481. 399.52 s [Cabal] [ 89 of 146] Compiling Distribution.Simple.Setup.Global ( src/Distribution/Simple/Setup/Global.hs, dist/build/Distribution/Simple/Setup/Global.p_o )
  482. 399.52 s [Cabal] [ 90 of 146] Compiling Distribution.Simple.Setup.Copy ( src/Distribution/Simple/Setup/Copy.hs, dist/build/Distribution/Simple/Setup/Copy.p_o )
  483. 399.52 s [Cabal] [ 91 of 146] Compiling Distribution.Simple.Setup.Config ( src/Distribution/Simple/Setup/Config.hs, dist/build/Distribution/Simple/Setup/Config.p_o )
  484. 401.98 s [Cabal] [ 92 of 146] Compiling Distribution.Types.LocalBuildConfig ( src/Distribution/Types/LocalBuildConfig.hs, dist/build/Distribution/Types/LocalBuildConfig.p_o )
  485. 403.59 s [Cabal] [ 93 of 146] Compiling Distribution.Types.LocalBuildInfo ( src/Distribution/Types/LocalBuildInfo.hs, dist/build/Distribution/Types/LocalBuildInfo.p_o )
  486. 404.22 s [Cabal] [ 94 of 146] Compiling Distribution.Simple.LocalBuildInfo ( src/Distribution/Simple/LocalBuildInfo.hs, dist/build/Distribution/Simple/LocalBuildInfo.p_o )
  487. 404.61 s [Cabal] [ 95 of 146] Compiling Distribution.Simple.Test.Log ( src/Distribution/Simple/Test/Log.hs, dist/build/Distribution/Simple/Test/Log.p_o )
  488. 405.47 s [Cabal] [ 96 of 146] Compiling Distribution.Simple.Hpc ( src/Distribution/Simple/Hpc.hs, dist/build/Distribution/Simple/Hpc.p_o )
  489. 405.47 s [Cabal] [ 97 of 146] Compiling Distribution.Simple.Build.PackageInfoModule ( src/Distribution/Simple/Build/PackageInfoModule.hs, dist/build/Distribution/Simple/Build/PackageInfoModule.p_o )
  490. 405.47 s [Cabal] [ 98 of 146] Compiling Distribution.Simple.Build.Macros ( src/Distribution/Simple/Build/Macros.hs, dist/build/Distribution/Simple/Build/Macros.p_o )
  491. 405.47 s [Cabal] [ 99 of 146] Compiling Distribution.Backpack.Id ( src/Distribution/Backpack/Id.hs, dist/build/Distribution/Backpack/Id.p_o )
  492. 405.47 s [Cabal] [100 of 146] Compiling Distribution.Backpack.ConfiguredComponent ( src/Distribution/Backpack/ConfiguredComponent.hs, dist/build/Distribution/Backpack/ConfiguredComponent.p_o )
  493. 405.85 s [Cabal] [101 of 146] Compiling Distribution.Backpack.LinkedComponent ( src/Distribution/Backpack/LinkedComponent.hs, dist/build/Distribution/Backpack/LinkedComponent.p_o )
  494. 406.99 s [Cabal] [102 of 146] Compiling Distribution.Backpack.ComponentsGraph ( src/Distribution/Backpack/ComponentsGraph.hs, dist/build/Distribution/Backpack/ComponentsGraph.p_o )
  495. 406.99 s [Cabal] [103 of 146] Compiling Distribution.Simple.Program.Ld ( src/Distribution/Simple/Program/Ld.hs, dist/build/Distribution/Simple/Program/Ld.p_o )
  496. 406.99 s [Cabal] [104 of 146] Compiling Distribution.Simple.Program.Ar ( src/Distribution/Simple/Program/Ar.hs, dist/build/Distribution/Simple/Program/Ar.p_o )
  497. 406.99 s [Cabal] [105 of 146] Compiling Distribution.Simple.ConfigureScript ( src/Distribution/Simple/ConfigureScript.hs, dist/build/Distribution/Simple/ConfigureScript.p_o )
  498. 406.99 s [Cabal] [106 of 146] Compiling Distribution.Simple.Setup.Clean ( src/Distribution/Simple/Setup/Clean.hs, dist/build/Distribution/Simple/Setup/Clean.p_o )
  499. 406.99 s [Cabal] [107 of 146] Compiling Distribution.Simple.Setup.Build ( src/Distribution/Simple/Setup/Build.hs, dist/build/Distribution/Simple/Setup/Build.p_o )
  500. 406.99 s [Cabal] [108 of 146] Compiling Distribution.Simple.Setup.Benchmark ( src/Distribution/Simple/Setup/Benchmark.hs, dist/build/Distribution/Simple/Setup/Benchmark.p_o )
  501. 406.99 s [Cabal] [109 of 146] Compiling Distribution.Simple.Setup ( src/Distribution/Simple/Setup.hs, dist/build/Distribution/Simple/Setup.p_o )
  502. 406.99 s [Cabal] [110 of 146] Compiling Distribution.Simple.Build.Inputs ( src/Distribution/Simple/Build/Inputs.hs, dist/build/Distribution/Simple/Build/Inputs.p_o )
  503. 406.99 s [Cabal] [111 of 146] Compiling Distribution.Simple.BuildTarget ( src/Distribution/Simple/BuildTarget.hs, dist/build/Distribution/Simple/BuildTarget.p_o )
  504. 407.09 s [Cabal] [112 of 146] Compiling Distribution.Simple.BuildPaths ( src/Distribution/Simple/BuildPaths.hs, dist/build/Distribution/Simple/BuildPaths.p_o )
  505. 407.09 s [Cabal] [113 of 146] Compiling Distribution.Simple.UHC ( src/Distribution/Simple/UHC.hs, dist/build/Distribution/Simple/UHC.p_o )
  506. 407.09 s [Cabal] [114 of 146] Compiling Distribution.Simple.HaskellSuite ( src/Distribution/Simple/HaskellSuite.hs, dist/build/Distribution/Simple/HaskellSuite.p_o )
  507. 407.09 s [Cabal] [115 of 146] Compiling Distribution.Simple.GHC.Internal ( src/Distribution/Simple/GHC/Internal.hs, dist/build/Distribution/Simple/GHC/Internal.p_o )
  508. 407.09 s [Cabal] [116 of 146] Compiling Distribution.Simple.GHC.EnvironmentParser ( src/Distribution/Simple/GHC/EnvironmentParser.hs, dist/build/Distribution/Simple/GHC/EnvironmentParser.p_o )
  509. 407.09 s [Cabal] [117 of 146] Compiling Distribution.Simple.GHCJS ( src/Distribution/Simple/GHCJS.hs, dist/build/Distribution/Simple/GHCJS.p_o )
  510. 410.33 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 )
  511. 410.34 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 )
  512. 410.34 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 )
  513. 410.34 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 )
  514. 410.34 s [Cabal] [122 of 146] Compiling Distribution.Simple.GHC.Build ( src/Distribution/Simple/GHC/Build.hs, dist/build/Distribution/Simple/GHC/Build.p_o )
  515. 410.34 s [Cabal] [123 of 146] Compiling Distribution.Simple.GHC ( src/Distribution/Simple/GHC.hs, dist/build/Distribution/Simple/GHC.p_o )
  516. 410.34 s [Cabal] [124 of 146] Compiling Distribution.Simple.ShowBuildInfo ( src/Distribution/Simple/ShowBuildInfo.hs, dist/build/Distribution/Simple/ShowBuildInfo.p_o )
  517. 410.49 s [Cabal] [125 of 146] Compiling Distribution.Simple.Install ( src/Distribution/Simple/Install.hs, dist/build/Distribution/Simple/Install.p_o )
  518. 410.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 )
  519. 410.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 )
  520. 410.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 )
  521. 410.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 )
  522. 410.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 )
  523. 410.83 s [Cabal] [131 of 146] Compiling Distribution.PackageDescription.Check ( src/Distribution/PackageDescription/Check.hs, dist/build/Distribution/PackageDescription/Check.p_o )
  524. 410.83 s [Cabal] [132 of 146] Compiling Distribution.Make ( src/Distribution/Make.hs, dist/build/Distribution/Make.p_o )
  525. 410.83 s [Cabal] [133 of 146] Compiling Distribution.Compat.Time ( src/Distribution/Compat/Time.hs, dist/build/Distribution/Compat/Time.p_o )
  526. 410.83 s [Cabal] [134 of 146] Compiling Distribution.Backpack.ReadyComponent ( src/Distribution/Backpack/ReadyComponent.hs, dist/build/Distribution/Backpack/ReadyComponent.p_o )
  527. 410.83 s [Cabal] [135 of 146] Compiling Distribution.Backpack.Configure ( src/Distribution/Backpack/Configure.hs, dist/build/Distribution/Backpack/Configure.p_o )
  528. 410.83 s [Cabal] [136 of 146] Compiling Distribution.Backpack.DescribeUnitId ( src/Distribution/Backpack/DescribeUnitId.hs, dist/build/Distribution/Backpack/DescribeUnitId.p_o )
  529. 410.83 s [Cabal] [137 of 146] Compiling Distribution.Simple.Register ( src/Distribution/Simple/Register.hs, dist/build/Distribution/Simple/Register.p_o )
  530. 411.28 s [Cabal] [138 of 146] Compiling Distribution.Simple.PreProcess ( src/Distribution/Simple/PreProcess.hs, dist/build/Distribution/Simple/PreProcess.p_o )
  531. 411.28 s [Cabal] [139 of 146] Compiling Distribution.Simple.UserHooks ( src/Distribution/Simple/UserHooks.hs, dist/build/Distribution/Simple/UserHooks.p_o )
  532. 411.28 s [Cabal] [140 of 146] Compiling Distribution.Simple.Bench ( src/Distribution/Simple/Bench.hs, dist/build/Distribution/Simple/Bench.p_o )
  533. 411.28 s [Cabal] [141 of 146] Compiling Distribution.Simple.Configure ( src/Distribution/Simple/Configure.hs, dist/build/Distribution/Simple/Configure.p_o )
  534. 416.43 s [Cabal] [142 of 146] Compiling Distribution.Simple.Test ( src/Distribution/Simple/Test.hs, dist/build/Distribution/Simple/Test.p_o )
  535. 417.32 s [Cabal] [143 of 146] Compiling Distribution.Simple.SrcDist ( src/Distribution/Simple/SrcDist.hs, dist/build/Distribution/Simple/SrcDist.p_o )
  536. 418.20 s [Cabal] [144 of 146] Compiling Distribution.Simple.Build ( src/Distribution/Simple/Build.hs, dist/build/Distribution/Simple/Build.p_o )
  537. 420.01 s [Cabal] [145 of 146] Compiling Distribution.Simple.Haddock ( src/Distribution/Simple/Haddock.hs, dist/build/Distribution/Simple/Haddock.p_o )
  538. 424.49 s [Cabal] [146 of 146] Compiling Distribution.Simple ( src/Distribution/Simple.hs, dist/build/Distribution/Simple.p_o )
  539. 433.09 s [Cabal] buildPhase completed in 1 minutes 28 seconds
  540. 433.10 s [Cabal] Phase: haddockPhase
  541. 433.51 s [Cabal] Preprocessing library for Cabal-3.12.1.0...
  542. 433.58 s [Cabal] Running Haddock on library for Cabal-3.12.1.0...
  543. 436.47 s [Cabal] [ 1 of 146] Compiling Distribution.Backpack.FullUnitId ( src/Distribution/Backpack/FullUnitId.hs, nothing )
  544. 437.02 s [Cabal] [ 2 of 146] Compiling Distribution.Backpack.ModSubst ( src/Distribution/Backpack/ModSubst.hs, nothing )
  545. 437.04 s [Cabal] [ 3 of 146] Compiling Distribution.Backpack.ModuleScope ( src/Distribution/Backpack/ModuleScope.hs, nothing )
  546. 437.13 s [Cabal] [ 4 of 146] Compiling Distribution.Backpack.ModuleShape ( src/Distribution/Backpack/ModuleShape.hs, nothing )
  547. 437.29 s [Cabal] [ 5 of 146] Compiling Distribution.Backpack.PreModuleShape ( src/Distribution/Backpack/PreModuleShape.hs, nothing )
  548. 437.35 s [Cabal] [ 6 of 146] Compiling Distribution.Compat.Async ( src/Distribution/Compat/Async.hs, nothing )
  549. 437.42 s [Cabal] [ 7 of 146] Compiling Distribution.Compat.CreatePipe ( src/Distribution/Compat/CreatePipe.hs, nothing )
  550. 437.44 s [Cabal] [ 8 of 146] Compiling Distribution.Compat.Directory ( src/Distribution/Compat/Directory.hs, nothing )
  551. 437.45 s [Cabal] [ 9 of 146] Compiling Distribution.Compat.FilePath ( src/Distribution/Compat/FilePath.hs, nothing )
  552. 437.46 s [Cabal] [ 10 of 146] Compiling Distribution.Compat.GetShortPathName ( src/Distribution/Compat/GetShortPathName.hs, nothing )
  553. 437.47 s [Cabal] [ 11 of 146] Compiling Distribution.Compat.Internal.TempFile ( src/Distribution/Compat/Internal/TempFile.hs, nothing )
  554. 437.74 s [Cabal] [ 12 of 146] Compiling Distribution.Compat.CopyFile ( src/Distribution/Compat/CopyFile.hs, nothing )
  555. 437.80 s [Cabal] [ 13 of 146] Compiling Distribution.Compat.Prelude.Internal ( src/Distribution/Compat/Prelude/Internal.hs, nothing )
  556. 437.85 s [Cabal] [ 14 of 146] Compiling Distribution.Compat.Process ( src/Distribution/Compat/Process.hs, nothing )
  557. 437.86 s [Cabal] [ 15 of 146] Compiling Distribution.Compat.ResponseFile ( src/Distribution/Compat/ResponseFile.hs, nothing )
  558. 437.88 s [Cabal] [ 16 of 146] Compiling Distribution.Compat.SnocList ( src/Distribution/Compat/SnocList.hs, nothing )
  559. 437.89 s [Cabal] [ 17 of 146] Compiling Distribution.Compat.Stack ( src/Distribution/Compat/Stack.hs, nothing )
  560. 437.91 s [Cabal] [ 18 of 146] Compiling Distribution.Compat.Environment ( src/Distribution/Compat/Environment.hs, nothing )
  561. 437.93 s [Cabal] [ 19 of 146] Compiling Distribution.GetOpt ( src/Distribution/GetOpt.hs, nothing )
  562. 438.08 s [Cabal] [ 20 of 146] Compiling Distribution.Lex ( src/Distribution/Lex.hs, nothing )
  563. 438.09 s [Cabal] [ 21 of 146] Compiling Distribution.PackageDescription.Check.Warning ( src/Distribution/PackageDescription/Check/Warning.hs, nothing )
  564. 438.74 s [Cabal] [ 22 of 146] Compiling Distribution.ReadE ( src/Distribution/ReadE.hs, nothing )
  565. 438.94 s [Cabal] [ 23 of 146] Compiling Distribution.Simple.BuildToolDepends ( src/Distribution/Simple/BuildToolDepends.hs, nothing )
  566. 439.01 s [Cabal] [ 24 of 146] Compiling Distribution.Simple.CCompiler ( src/Distribution/Simple/CCompiler.hs, nothing )
  567. 439.01 s [Cabal] [ 25 of 146] Compiling Distribution.Simple.Flag ( src/Distribution/Simple/Flag.hs, nothing )
  568. 439.05 s [Cabal] [ 26 of 146] Compiling Distribution.Simple.InstallDirs.Internal ( src/Distribution/Simple/InstallDirs/Internal.hs, nothing )
  569. 439.18 s [Cabal] [ 27 of 146] Compiling Distribution.Simple.InstallDirs ( src/Distribution/Simple/InstallDirs.hs, nothing )
  570. 439.55 s [Cabal] [ 28 of 146] Compiling Distribution.Simple.Program.Internal ( src/Distribution/Simple/Program/Internal.hs, nothing )
  571. 439.59 s [Cabal] [ 29 of 146] Compiling Distribution.TestSuite ( src/Distribution/TestSuite.hs, nothing )
  572. 439.68 s [Cabal] [ 30 of 146] Compiling Distribution.Types.AnnotatedId ( src/Distribution/Types/AnnotatedId.hs, nothing )
  573. 439.72 s [Cabal] [ 31 of 146] Compiling Distribution.Backpack.PreExistingComponent ( src/Distribution/Backpack/PreExistingComponent.hs, nothing )
  574. 439.75 s [Cabal] [ 32 of 146] Compiling Distribution.Types.ComponentInclude ( src/Distribution/Types/ComponentInclude.hs, nothing )
  575. 439.76 s [Cabal] [ 33 of 146] Compiling Distribution.Types.ComponentLocalBuildInfo ( src/Distribution/Types/ComponentLocalBuildInfo.hs, nothing )
  576. 439.97 s [Cabal] [ 34 of 146] Compiling Distribution.Types.DumpBuildInfo ( src/Distribution/Types/DumpBuildInfo.hs, nothing )
  577. 440.00 s [Cabal] [ 35 of 146] Compiling Distribution.Types.GivenComponent ( src/Distribution/Types/GivenComponent.hs, nothing )
  578. 440.03 s [Cabal] [ 36 of 146] Compiling Distribution.Types.PackageName.Magic ( src/Distribution/Types/PackageName/Magic.hs, nothing )
  579. 440.03 s [Cabal] [ 37 of 146] Compiling Distribution.Types.ParStrat ( src/Distribution/Types/ParStrat.hs, nothing )
  580. 440.04 s [Cabal] [ 38 of 146] Compiling Distribution.Types.TargetInfo ( src/Distribution/Types/TargetInfo.hs, nothing )
  581. 440.12 s [Cabal] [ 39 of 146] Compiling Distribution.Utils.IOData ( src/Distribution/Utils/IOData.hs, nothing )
  582. 440.15 s [Cabal] [ 40 of 146] Compiling Distribution.Utils.Json ( src/Distribution/Utils/Json.hs, nothing )
  583. 440.18 s [Cabal] [ 41 of 146] Compiling Distribution.Utils.MapAccum ( src/Distribution/Utils/MapAccum.hs, nothing )
  584. 440.21 s [Cabal] [ 42 of 146] Compiling Distribution.Utils.Progress ( src/Distribution/Utils/Progress.hs, nothing )
  585. 440.24 s [Cabal] [ 43 of 146] Compiling Distribution.Utils.UnionFind ( src/Distribution/Utils/UnionFind.hs, nothing )
  586. 440.28 s [Cabal] [ 44 of 146] Compiling Distribution.Verbosity.Internal ( src/Distribution/Verbosity/Internal.hs, nothing )
  587. 440.34 s [Cabal] [ 45 of 146] Compiling Distribution.Verbosity ( src/Distribution/Verbosity.hs, nothing )
  588. 440.48 s [Cabal] [ 46 of 146] Compiling Distribution.Simple.Program.Types ( src/Distribution/Simple/Program/Types.hs, nothing )
  589. 440.61 s [Cabal] [ 47 of 146] Compiling Distribution.Simple.PreProcess.Types ( src/Distribution/Simple/PreProcess/Types.hs, nothing )
  590. 440.65 s [Cabal] [ 48 of 146] Compiling Distribution.Simple.Errors ( src/Distribution/Simple/Errors.hs, nothing )
  591. 441.12 s [Cabal] [ 49 of 146] Compiling Distribution.Simple.PreProcess.Unlit ( src/Distribution/Simple/PreProcess/Unlit.hs, nothing )
  592. 441.17 s [Cabal] [ 50 of 146] Compiling Distribution.Backpack.UnifyM ( src/Distribution/Backpack/UnifyM.hs, nothing )
  593. 441.35 s [Cabal] [ 51 of 146] Compiling Distribution.Backpack.MixLink ( src/Distribution/Backpack/MixLink.hs, nothing )
  594. 441.43 s [Cabal] [ 52 of 146] Compiling Distribution.ZinzaPrelude ( src/Distribution/ZinzaPrelude.hs, nothing )
  595. 441.44 s [Cabal] [ 53 of 146] Compiling Distribution.Simple.Build.PathsModule.Z ( src/Distribution/Simple/Build/PathsModule/Z.hs, nothing )
  596. 441.58 s [Cabal] [ 54 of 146] Compiling Distribution.Simple.Build.PackageInfoModule.Z ( src/Distribution/Simple/Build/PackageInfoModule/Z.hs, nothing )
  597. 441.61 s [Cabal] [ 55 of 146] Compiling Distribution.Simple.Build.Macros.Z ( src/Distribution/Simple/Build/Macros/Z.hs, nothing )
  598. 441.69 s [Cabal] [ 56 of 146] Compiling Paths_Cabal ( dist/build/autogen/Paths_Cabal.hs, nothing )
  599. 441.72 s [Cabal] [ 57 of 146] Compiling Distribution.Simple.Utils ( src/Distribution/Simple/Utils.hs, nothing )
  600. 442.38 s [Cabal] [ 58 of 146] Compiling Distribution.Utils.NubList ( src/Distribution/Utils/NubList.hs, nothing )
  601. 442.73 s [Cabal] [ 59 of 146] Compiling Distribution.Utils.LogProgress ( src/Distribution/Utils/LogProgress.hs, nothing )
  602. 442.78 s [Cabal] [ 60 of 146] Compiling Distribution.Simple.Program.Run ( src/Distribution/Simple/Program/Run.hs, nothing )
  603. 442.90 s [Cabal] [ 61 of 146] Compiling Distribution.Simple.Program.Script ( src/Distribution/Simple/Program/Script.hs, nothing )
  604. 442.94 s [Cabal] [ 62 of 146] Compiling Distribution.Simple.Program.ResponseFile ( src/Distribution/Simple/Program/ResponseFile.hs, nothing )
  605. 442.97 s [Cabal] [ 63 of 146] Compiling Distribution.Simple.Program.Hpc ( src/Distribution/Simple/Program/Hpc.hs, nothing )
  606. 443.00 s [Cabal] [ 64 of 146] Compiling Distribution.Simple.Program.Find ( src/Distribution/Simple/Program/Find.hs, nothing )
  607. 443.09 s [Cabal] [ 65 of 146] Compiling Distribution.Simple.PackageIndex ( src/Distribution/Simple/PackageIndex.hs, nothing )
  608. 443.41 s [Cabal] [ 66 of 146] Compiling Distribution.Simple.PackageDescription ( src/Distribution/Simple/PackageDescription.hs, nothing )
  609. 443.47 s [Cabal] [ 67 of 146] Compiling Distribution.Simple.Glob.Internal ( src/Distribution/Simple/Glob/Internal.hs, nothing )
  610. 443.81 s [Cabal] [ 68 of 146] Compiling Distribution.Simple.Glob ( src/Distribution/Simple/Glob.hs, nothing )
  611. 443.84 s [Cabal] [ 69 of 146] Compiling Distribution.PackageDescription.Check.Monad ( src/Distribution/PackageDescription/Check/Monad.hs, nothing )
  612. 444.03 s [Cabal] [ 70 of 146] Compiling Distribution.PackageDescription.Check.Conditional ( src/Distribution/PackageDescription/Check/Conditional.hs, nothing )
  613. 444.16 s [Cabal] [ 71 of 146] Compiling Distribution.PackageDescription.Check.Common ( src/Distribution/PackageDescription/Check/Common.hs, nothing )
  614. 444.20 s [Cabal] [ 72 of 146] Compiling Distribution.Simple.Compiler ( src/Distribution/Simple/Compiler.hs, nothing )
  615. 444.53 s [Cabal] [ 73 of 146] Compiling Distribution.Simple.Program.HcPkg ( src/Distribution/Simple/Program/HcPkg.hs, nothing )
  616. 444.84 s [Cabal] [ 74 of 146] Compiling Distribution.Simple.GHC.ImplInfo ( src/Distribution/Simple/GHC/ImplInfo.hs, nothing )
  617. 444.89 s [Cabal] [ 75 of 146] Compiling Distribution.Simple.Program.GHC ( src/Distribution/Simple/Program/GHC.hs, nothing )
  618. 445.98 s [Cabal] [ 76 of 146] Compiling Distribution.Simple.Program.Builtin ( src/Distribution/Simple/Program/Builtin.hs, nothing )
  619. 446.12 s [Cabal] [ 77 of 146] Compiling Distribution.Simple.Program.Db ( src/Distribution/Simple/Program/Db.hs, nothing )
  620. 446.34 s [Cabal] [ 78 of 146] Compiling Distribution.Simple.Program ( src/Distribution/Simple/Program.hs, nothing )
  621. 446.38 s [Cabal] [ 79 of 146] Compiling Distribution.Simple.Program.Strip ( src/Distribution/Simple/Program/Strip.hs, nothing )
  622. 446.41 s [Cabal] [ 80 of 146] Compiling Distribution.Simple.Command ( src/Distribution/Simple/Command.hs, nothing )
  623. 446.78 s [Cabal] [ 81 of 146] Compiling Distribution.Simple.Setup.Common ( src/Distribution/Simple/Setup/Common.hs, nothing )
  624. 446.84 s [Cabal] [ 82 of 146] Compiling Distribution.Simple.Setup.Test ( src/Distribution/Simple/Setup/Test.hs, nothing )
  625. 446.92 s [Cabal] [ 83 of 146] Compiling Distribution.Simple.Setup.SDist ( src/Distribution/Simple/Setup/SDist.hs, nothing )
  626. 446.94 s [Cabal] [ 84 of 146] Compiling Distribution.Simple.Setup.Repl ( src/Distribution/Simple/Setup/Repl.hs, nothing )
  627. 447.01 s [Cabal] [ 85 of 146] Compiling Distribution.Simple.Setup.Register ( src/Distribution/Simple/Setup/Register.hs, nothing )
  628. 447.03 s [Cabal] [ 86 of 146] Compiling Distribution.Simple.Setup.Install ( src/Distribution/Simple/Setup/Install.hs, nothing )
  629. 447.06 s [Cabal] [ 87 of 146] Compiling Distribution.Simple.Setup.Hscolour ( src/Distribution/Simple/Setup/Hscolour.hs, nothing )
  630. 447.12 s [Cabal] [ 88 of 146] Compiling Distribution.Simple.Setup.Haddock ( src/Distribution/Simple/Setup/Haddock.hs, nothing )
  631. 447.63 s [Cabal] [ 89 of 146] Compiling Distribution.Simple.Setup.Global ( src/Distribution/Simple/Setup/Global.hs, nothing )
  632. 447.66 s [Cabal] [ 90 of 146] Compiling Distribution.Simple.Setup.Copy ( src/Distribution/Simple/Setup/Copy.hs, nothing )
  633. 447.71 s [Cabal] [ 91 of 146] Compiling Distribution.Simple.Setup.Config ( src/Distribution/Simple/Setup/Config.hs, nothing )
  634. 448.41 s [Cabal] [ 92 of 146] Compiling Distribution.Types.LocalBuildConfig ( src/Distribution/Types/LocalBuildConfig.hs, nothing )
  635. 448.69 s [Cabal] [ 93 of 146] Compiling Distribution.Types.LocalBuildInfo ( src/Distribution/Types/LocalBuildInfo.hs, nothing )
  636. 448.84 s [Cabal] [ 94 of 146] Compiling Distribution.Simple.LocalBuildInfo ( src/Distribution/Simple/LocalBuildInfo.hs, nothing )
  637. 448.95 s [Cabal] [ 95 of 146] Compiling Distribution.Simple.Test.Log ( src/Distribution/Simple/Test/Log.hs, nothing )
  638. 449.08 s [Cabal] [ 96 of 146] Compiling Distribution.Simple.Hpc ( src/Distribution/Simple/Hpc.hs, nothing )
  639. 449.16 s [Cabal] [ 97 of 146] Compiling Distribution.Simple.Build.PackageInfoModule ( src/Distribution/Simple/Build/PackageInfoModule.hs, nothing )
  640. 449.18 s [Cabal] [ 98 of 146] Compiling Distribution.Simple.Build.Macros ( src/Distribution/Simple/Build/Macros.hs, nothing )
  641. 449.22 s [Cabal] [ 99 of 146] Compiling Distribution.Backpack.Id ( src/Distribution/Backpack/Id.hs, nothing )
  642. 449.26 s [Cabal] [100 of 146] Compiling Distribution.Backpack.ConfiguredComponent ( src/Distribution/Backpack/ConfiguredComponent.hs, nothing )
  643. 449.34 s [Cabal] [101 of 146] Compiling Distribution.Backpack.LinkedComponent ( src/Distribution/Backpack/LinkedComponent.hs, nothing )
  644. 449.76 s [Cabal] [102 of 146] Compiling Distribution.Backpack.ComponentsGraph ( src/Distribution/Backpack/ComponentsGraph.hs, nothing )
  645. 449.80 s [Cabal] [103 of 146] Compiling Distribution.Simple.Program.Ld ( src/Distribution/Simple/Program/Ld.hs, nothing )
  646. 449.84 s [Cabal] [104 of 146] Compiling Distribution.Simple.Program.Ar ( src/Distribution/Simple/Program/Ar.hs, nothing )
  647. 449.93 s [Cabal] [105 of 146] Compiling Distribution.Simple.ConfigureScript ( src/Distribution/Simple/ConfigureScript.hs, nothing )
  648. 450.01 s [Cabal] [106 of 146] Compiling Distribution.Simple.Setup.Clean ( src/Distribution/Simple/Setup/Clean.hs, nothing )
  649. 450.05 s [Cabal] [107 of 146] Compiling Distribution.Simple.Setup.Build ( src/Distribution/Simple/Setup/Build.hs, nothing )
  650. 450.16 s [Cabal] [108 of 146] Compiling Distribution.Simple.Setup.Benchmark ( src/Distribution/Simple/Setup/Benchmark.hs, nothing )
  651. 450.21 s [Cabal] [109 of 146] Compiling Distribution.Simple.Setup ( src/Distribution/Simple/Setup.hs, nothing )
  652. 450.24 s [Cabal] [110 of 146] Compiling Distribution.Simple.Build.Inputs ( src/Distribution/Simple/Build/Inputs.hs, nothing )
  653. 450.26 s [Cabal] [111 of 146] Compiling Distribution.Simple.BuildTarget ( src/Distribution/Simple/BuildTarget.hs, nothing )
  654. 450.77 s [Cabal] [112 of 146] Compiling Distribution.Simple.BuildPaths ( src/Distribution/Simple/BuildPaths.hs, nothing )
  655. 450.89 s [Cabal] [113 of 146] Compiling Distribution.Simple.UHC ( src/Distribution/Simple/UHC.hs, nothing )
  656. 451.05 s [Cabal] [114 of 146] Compiling Distribution.Simple.HaskellSuite ( src/Distribution/Simple/HaskellSuite.hs, nothing )
  657. 451.19 s [Cabal] [115 of 146] Compiling Distribution.Simple.GHC.Internal ( src/Distribution/Simple/GHC/Internal.hs, nothing )
  658. 451.49 s [Cabal] [116 of 146] Compiling Distribution.Simple.GHC.EnvironmentParser ( src/Distribution/Simple/GHC/EnvironmentParser.hs, nothing )
  659. 451.52 s [Cabal] [117 of 146] Compiling Distribution.Simple.GHCJS ( src/Distribution/Simple/GHCJS.hs, nothing )
  660. 452.74 s [Cabal] [118 of 146] Compiling Distribution.Simple.GHC.Build.Utils ( src/Distribution/Simple/GHC/Build/Utils.hs, nothing )
  661. 452.83 s [Cabal] [119 of 146] Compiling Distribution.Simple.GHC.Build.Modules ( src/Distribution/Simple/GHC/Build/Modules.hs, nothing )
  662. 453.02 s [Cabal] [120 of 146] Compiling Distribution.Simple.GHC.Build.ExtraSources ( src/Distribution/Simple/GHC/Build/ExtraSources.hs, nothing )
  663. 453.10 s [Cabal] [121 of 146] Compiling Distribution.Simple.GHC.Build.Link ( src/Distribution/Simple/GHC/Build/Link.hs, nothing )
  664. 453.49 s [Cabal] [122 of 146] Compiling Distribution.Simple.GHC.Build ( src/Distribution/Simple/GHC/Build.hs, nothing )
  665. 453.52 s [Cabal] [123 of 146] Compiling Distribution.Simple.GHC ( src/Distribution/Simple/GHC.hs, nothing )
  666. 453.88 s [Cabal] [124 of 146] Compiling Distribution.Simple.ShowBuildInfo ( src/Distribution/Simple/ShowBuildInfo.hs, nothing )
  667. 453.93 s [Cabal] [125 of 146] Compiling Distribution.Simple.Install ( src/Distribution/Simple/Install.hs, nothing )
  668. 454.05 s [Cabal] [126 of 146] Compiling Distribution.Simple.Build.PathsModule ( src/Distribution/Simple/Build/PathsModule.hs, nothing )
  669. 454.08 s [Cabal] [127 of 146] Compiling Distribution.Simple.Test.LibV09 ( src/Distribution/Simple/Test/LibV09.hs, nothing )
  670. 454.44 s [Cabal] [128 of 146] Compiling Distribution.Simple.Test.ExeV10 ( src/Distribution/Simple/Test/ExeV10.hs, nothing )
  671. 454.50 s [Cabal] [129 of 146] Compiling Distribution.PackageDescription.Check.Paths ( src/Distribution/PackageDescription/Check/Paths.hs, nothing )
  672. 454.59 s [Cabal] [130 of 146] Compiling Distribution.PackageDescription.Check.Target ( src/Distribution/PackageDescription/Check/Target.hs, nothing )
  673. 454.94 s [Cabal] [131 of 146] Compiling Distribution.PackageDescription.Check ( src/Distribution/PackageDescription/Check.hs, nothing )
  674. 455.37 s [Cabal] [132 of 146] Compiling Distribution.Make ( src/Distribution/Make.hs, nothing )
  675. 455.43 s [Cabal] [133 of 146] Compiling Distribution.Compat.Time ( src/Distribution/Compat/Time.hs, nothing )
  676. 455.52 s [Cabal] [134 of 146] Compiling Distribution.Backpack.ReadyComponent ( src/Distribution/Backpack/ReadyComponent.hs, nothing )
  677. 455.68 s [Cabal] [135 of 146] Compiling Distribution.Backpack.Configure ( src/Distribution/Backpack/Configure.hs, nothing )
  678. 455.80 s [Cabal] [136 of 146] Compiling Distribution.Backpack.DescribeUnitId ( src/Distribution/Backpack/DescribeUnitId.hs, nothing )
  679. 455.82 s [Cabal] [137 of 146] Compiling Distribution.Simple.Register ( src/Distribution/Simple/Register.hs, nothing )
  680. 456.37 s [Cabal] [138 of 146] Compiling Distribution.Simple.PreProcess ( src/Distribution/Simple/PreProcess.hs, nothing )
  681. 456.69 s [Cabal] [139 of 146] Compiling Distribution.Simple.UserHooks ( src/Distribution/Simple/UserHooks.hs, nothing )
  682. 456.73 s [Cabal] [140 of 146] Compiling Distribution.Simple.Bench ( src/Distribution/Simple/Bench.hs, nothing )
  683. 456.77 s [Cabal] [141 of 146] Compiling Distribution.Simple.Configure ( src/Distribution/Simple/Configure.hs, nothing )
  684. 457.85 s [Cabal] [142 of 146] Compiling Distribution.Simple.Test ( src/Distribution/Simple/Test.hs, nothing )
  685. 457.95 s [Cabal] [143 of 146] Compiling Distribution.Simple.SrcDist ( src/Distribution/Simple/SrcDist.hs, nothing )
  686. 458.32 s [Cabal] [144 of 146] Compiling Distribution.Simple.Build ( src/Distribution/Simple/Build.hs, nothing )
  687. 459.24 s [Cabal] [145 of 146] Compiling Distribution.Simple.Haddock ( src/Distribution/Simple/Haddock.hs, nothing )
  688. 459.98 s [Cabal] [146 of 146] Compiling Distribution.Simple ( src/Distribution/Simple.hs, nothing )
  689. 460.49 s [Cabal] Haddock coverage:
  690. 460.49 s [Cabal] 0% ( 0 / 5) in 'Distribution.Backpack.FullUnitId'
  691. 460.49 s [Cabal] Missing documentation for:
  692. 460.49 s [Cabal] Module header
  693. 460.49 s [Cabal] FullUnitId (src/Distribution/Backpack/FullUnitId.hs:15)
  694. 460.49 s [Cabal] FullDb (src/Distribution/Backpack/FullUnitId.hs:18)
  695. 460.49 s [Cabal] expandOpenUnitId (src/Distribution/Backpack/FullUnitId.hs:21)
  696. 460.49 s [Cabal] expandUnitId (src/Distribution/Backpack/FullUnitId.hs:27)
  697. 460.49 s [Cabal] Warning: 'ModuleSubst' is out of scope.
  698. 460.49 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  699. 460.49 s [Cabal] 100% ( 2 / 2) in 'Distribution.Backpack.ModSubst'
  700. 460.49 s [Cabal] Warning: 'OpenModule' is ambiguous. It is defined
  701. 460.49 s [Cabal] * in ‘Distribution.Backpack’
  702. 460.49 s [Cabal] * in ‘Distribution.Backpack’
  703. 460.49 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  704. 460.49 s [Cabal] by specifying the type/value namespace explicitly.
  705. 460.49 s [Cabal] Defaulting to the one defined in ‘Distribution.Backpack’
  706. 460.49 s [Cabal] Warning: 'Module' is out of scope.
  707. 460.49 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  708. 460.49 s [Cabal] Warning: 'ModuleScope' is ambiguous. It is defined
  709. 460.49 s [Cabal] * at src/Distribution/Backpack/ModuleScope.hs:69:20
  710. 460.49 s [Cabal] * at src/Distribution/Backpack/ModuleScope.hs:69:1
  711. 460.49 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  712. 460.49 s [Cabal] by specifying the type/value namespace explicitly.
  713. 460.50 s [Cabal] Defaulting to the one defined at src/Distribution/Backpack/ModuleScope.hs:69:1
  714. 460.50 s [Cabal] Warning: 'ModuleShape' is out of scope.
  715. 460.50 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  716. 460.50 s [Cabal] Warning: 'ModuleShape' is ambiguous. It is defined
  717. 460.50 s [Cabal] * at src/Distribution/Backpack/ModuleShape.hs:30:20
  718. 460.50 s [Cabal] * at src/Distribution/Backpack/ModuleShape.hs:30:1
  719. 460.50 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  720. 460.50 s [Cabal] by specifying the type/value namespace explicitly.
  721. 460.50 s [Cabal] Defaulting to the one defined at src/Distribution/Backpack/ModuleShape.hs:30:1
  722. 460.50 s [Cabal] Warning: 'InstalledPackageInfo' is ambiguous. It is defined
  723. 460.50 s [Cabal] * in ‘Distribution.Types.InstalledPackageInfo’
  724. 460.50 s [Cabal] * in ‘Distribution.Types.InstalledPackageInfo’
  725. 460.50 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  726. 460.50 s [Cabal] by specifying the type/value namespace explicitly.
  727. 460.50 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.InstalledPackageInfo’
  728. 460.50 s [Cabal] 80% ( 4 / 5) in 'Distribution.Backpack.ModuleShape'
  729. 460.50 s [Cabal] Missing documentation for:
  730. 460.50 s [Cabal] shapeInstalledPackage (src/Distribution/Backpack/ModuleShape.hs:77)
  731. 460.50 s [Cabal] 0% ( 0 / 5) in 'Distribution.Backpack.PreModuleShape'
  732. 460.50 s [Cabal] Missing documentation for:
  733. 460.50 s [Cabal] Module header
  734. 460.50 s [Cabal] PreModuleShape (src/Distribution/Backpack/PreModuleShape.hs:22)
  735. 460.50 s [Cabal] toPreModuleShape (src/Distribution/Backpack/PreModuleShape.hs:29)
  736. 460.50 s [Cabal] renamePreModuleShape (src/Distribution/Backpack/PreModuleShape.hs:32)
  737. 460.50 s [Cabal] mixLinkPreModuleShape (src/Distribution/Backpack/PreModuleShape.hs:41)
  738. 460.50 s [Cabal] Warning: 'async' is out of scope.
  739. 460.50 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  740. 460.51 s [Cabal] 50% ( 1 / 2) in 'Distribution.Compat.CreatePipe'
  741. 460.51 s [Cabal] Missing documentation for:
  742. 460.51 s [Cabal] Module header
  743. 460.51 s [Cabal] 75% ( 3 / 4) in 'Distribution.Compat.Directory'
  744. 460.51 s [Cabal] Missing documentation for:
  745. 460.51 s [Cabal] Module header
  746. 460.51 s [Cabal] 66% ( 2 / 3) in 'Distribution.Compat.FilePath'
  747. 460.51 s [Cabal] Missing documentation for:
  748. 460.51 s [Cabal] Module header
  749. 460.51 s [Cabal] Warning: 'GetShortPathName' is out of scope.
  750. 460.51 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  751. 460.52 s [Cabal] 100% ( 2 / 2) in 'Distribution.Compat.Prelude.Internal'
  752. 460.52 s [Cabal] Warning: 'delegate_ctlc' is out of scope.
  753. 460.52 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  754. 460.52 s [Cabal] 80% ( 4 / 5) in 'Distribution.Compat.Process'
  755. 460.52 s [Cabal] Missing documentation for:
  756. 460.52 s [Cabal] Module header
  757. 460.52 s [Cabal] 66% ( 2 / 3) in 'Distribution.Compat.ResponseFile'
  758. 460.52 s [Cabal] Missing documentation for:
  759. 460.52 s [Cabal] Module header
  760. 460.52 s [Cabal] Warning: 'Verbosity' is out of scope.
  761. 460.52 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  762. 460.52 s [Cabal] 66% ( 6 / 9) in 'Distribution.Compat.Stack'
  763. 460.52 s [Cabal] Missing documentation for:
  764. 460.52 s [Cabal] Module header
  765. 460.52 s [Cabal] WithCallStack (src/Distribution/Compat/Stack.hs:31)
  766. 460.52 s [Cabal] withLexicalCallStack (src/Distribution/Compat/Stack.hs:74)
  767. 460.53 s [Cabal] Warning: 'ReturnInOrder' is out of scope.
  768. 460.53 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  769. 460.53 s [Cabal] Warning: 'PackageCheck' is out of scope.
  770. 460.53 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  771. 460.54 s [Cabal] 50% ( 5 / 10) in 'Distribution.ReadE'
  772. 460.54 s [Cabal] Missing documentation for:
  773. 460.54 s [Cabal] succeedReadE (src/Distribution/ReadE.hs:47)
  774. 460.54 s [Cabal] failReadE (src/Distribution/ReadE.hs:50)
  775. 460.54 s [Cabal] parsecToReadE (src/Distribution/ReadE.hs:57)
  776. 460.54 s [Cabal] parsecToReadEErr (src/Distribution/ReadE.hs:61)
  777. 460.54 s [Cabal] unexpectMsgString (src/Distribution/ReadE.hs:67)
  778. 460.54 s [Cabal] Warning: 'PackageDescription' is ambiguous. It is defined
  779. 460.54 s [Cabal] * in ‘Distribution.Types.PackageDescription’
  780. 460.54 s [Cabal] * in ‘Distribution.Types.PackageDescription’
  781. 460.54 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  782. 460.54 s [Cabal] by specifying the type/value namespace explicitly.
  783. 460.54 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.PackageDescription’
  784. 460.54 s [Cabal] Warning: 'BuildInfo' is ambiguous. It is defined
  785. 460.54 s [Cabal] * in ‘Distribution.Types.BuildInfo’
  786. 460.54 s [Cabal] * in ‘Distribution.Types.BuildInfo’
  787. 460.54 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  788. 460.54 s [Cabal] by specifying the type/value namespace explicitly.
  789. 460.54 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.BuildInfo’
  790. 460.54 s [Cabal] 100% ( 6 / 6) in 'Distribution.Simple.BuildToolDepends'
  791. 460.54 s [Cabal] Warning: 'a' is out of scope.
  792. 460.54 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  793. 460.54 s [Cabal] Warning: 'b' is out of scope.
  794. 460.54 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  795. 460.55 s [Cabal] 100% ( 5 / 5) in 'Distribution.Simple.CCompiler'
  796. 460.55 s [Cabal] Warning: 'Flag' is ambiguous. It is defined
  797. 460.55 s [Cabal] * at src/Distribution/Simple/Flag.hs:65:15
  798. 460.55 s [Cabal] * at src/Distribution/Simple/Flag.hs:65:1
  799. 460.55 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  800. 460.55 s [Cabal] by specifying the type/value namespace explicitly.
  801. 460.55 s [Cabal] Defaulting to the one defined at src/Distribution/Simple/Flag.hs:65:1
  802. 460.55 s [Cabal] 100% ( 12 / 12) in 'Distribution.Simple.Flag'
  803. 460.55 s [Cabal] 0% ( 0 / 3) in 'Distribution.Simple.InstallDirs.Internal'
  804. 460.55 s [Cabal] Missing documentation for:
  805. 460.55 s [Cabal] Module header
  806. 460.55 s [Cabal] PathComponent (src/Distribution/Simple/InstallDirs/Internal.hs:12)
  807. 460.55 s [Cabal] PathTemplateVariable (src/Distribution/Simple/InstallDirs/Internal.hs:20)
  808. 460.55 s [Cabal] Warning: 'InstallDirs' is ambiguous. It is defined
  809. 460.55 s [Cabal] * at src/Distribution/Simple/InstallDirs.hs:85:24
  810. 460.55 s [Cabal] * at src/Distribution/Simple/InstallDirs.hs:85:1
  811. 460.55 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  812. 460.55 s [Cabal] by specifying the type/value namespace explicitly.
  813. 460.55 s [Cabal] Defaulting to the one defined at src/Distribution/Simple/InstallDirs.hs:85:1
  814. 460.55 s [Cabal] Warning: 'PathTemplate' is ambiguous. It is defined
  815. 460.55 s [Cabal] * at src/Distribution/Simple/InstallDirs.hs:389:24
  816. 460.55 s [Cabal] * at src/Distribution/Simple/InstallDirs.hs:389:1
  817. 460.55 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  818. 460.55 s [Cabal] by specifying the type/value namespace explicitly.
  819. 460.55 s [Cabal] Defaulting to the one defined at src/Distribution/Simple/InstallDirs.hs:389:1
  820. 460.56 s [Cabal] 47% ( 11 / 23) in 'Distribution.Simple.InstallDirs'
  821. 460.56 s [Cabal] Missing documentation for:
  822. 460.56 s [Cabal] defaultInstallDirs (src/Distribution/Simple/InstallDirs.hs:179)
  823. 460.56 s [Cabal] defaultInstallDirs' (src/Distribution/Simple/InstallDirs.hs:187)
  824. 460.56 s [Cabal] combineInstallDirs (src/Distribution/Simple/InstallDirs.hs:121)
  825. 460.56 s [Cabal] PathTemplateVariable (src/Distribution/Simple/InstallDirs/Internal.hs:20)
  826. 460.56 s [Cabal] PathTemplateEnv (src/Distribution/Simple/InstallDirs.hs:395)
  827. 460.56 s [Cabal] combinePathTemplate (src/Distribution/Simple/InstallDirs.hs:410)
  828. 460.56 s [Cabal] substPathTemplate (src/Distribution/Simple/InstallDirs.hs:414)
  829. 460.56 s [Cabal] platformTemplateEnv (src/Distribution/Simple/InstallDirs.hs:452)
  830. 460.56 s [Cabal] compilerTemplateEnv (src/Distribution/Simple/InstallDirs.hs:447)
  831. 460.56 s [Cabal] packageTemplateEnv (src/Distribution/Simple/InstallDirs.hs:437)
  832. 460.56 s [Cabal] abiTemplateEnv (src/Distribution/Simple/InstallDirs.hs:458)
  833. 460.56 s [Cabal] installDirsTemplateEnv (src/Distribution/Simple/InstallDirs.hs:477)
  834. 460.56 s [Cabal] Warning: 'strip' is out of scope.
  835. 460.56 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  836. 460.56 s [Cabal] 100% ( 2 / 2) in 'Distribution.Simple.Program.Internal'
  837. 460.56 s [Cabal] Warning: 'TestInstance' is ambiguous. It is defined
  838. 460.56 s [Cabal] * at src/Distribution/TestSuite.hs:30:21
  839. 460.56 s [Cabal] * at src/Distribution/TestSuite.hs:30:1
  840. 460.56 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  841. 460.56 s [Cabal] by specifying the type/value namespace explicitly.
  842. 460.56 s [Cabal] Defaulting to the one defined at src/Distribution/TestSuite.hs:30:1
  843. 460.56 s [Cabal] 22% ( 2 / 9) in 'Distribution.TestSuite'
  844. 460.56 s [Cabal] Missing documentation for:
  845. 460.56 s [Cabal] TestInstance (src/Distribution/TestSuite.hs:30)
  846. 460.56 s [Cabal] OptionDescr (src/Distribution/TestSuite.hs:49)
  847. 460.56 s [Cabal] OptionType (src/Distribution/TestSuite.hs:59)
  848. 460.56 s [Cabal] Test (src/Distribution/TestSuite.hs:78)
  849. 460.56 s [Cabal] Options (src/Distribution/TestSuite.hs:94)
  850. 460.56 s [Cabal] Progress (src/Distribution/TestSuite.hs:96)
  851. 460.56 s [Cabal] Result (src/Distribution/TestSuite.hs:100)
  852. 460.56 s [Cabal] Warning: 'AnnotatedId' is ambiguous. It is defined
  853. 460.56 s [Cabal] * at src/Distribution/Types/AnnotatedId.hs:19:23
  854. 460.56 s [Cabal] * at src/Distribution/Types/AnnotatedId.hs:19:1
  855. 460.56 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  856. 460.56 s [Cabal] by specifying the type/value namespace explicitly.
  857. 460.56 s [Cabal] Defaulting to the one defined at src/Distribution/Types/AnnotatedId.hs:19:1
  858. 460.56 s [Cabal] 50% ( 1 / 2) in 'Distribution.Types.AnnotatedId'
  859. 460.56 s [Cabal] Missing documentation for:
  860. 460.56 s [Cabal] Module header
  861. 460.56 s [Cabal] Warning: 'LinkedComponent' is out of scope.
  862. 460.57 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  863. 460.57 s [Cabal] Warning: 'pc_pkgid' is out of scope.
  864. 460.57 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  865. 460.57 s [Cabal] Warning: 'PreExistingComponent' is ambiguous. It is defined
  866. 460.57 s [Cabal] * at src/Distribution/Backpack/PreExistingComponent.hs:37:29
  867. 460.57 s [Cabal] * at src/Distribution/Backpack/PreExistingComponent.hs:37:1
  868. 460.57 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  869. 460.57 s [Cabal] by specifying the type/value namespace explicitly.
  870. 460.57 s [Cabal] Defaulting to the one defined at src/Distribution/Backpack/PreExistingComponent.hs:37:1
  871. 460.57 s [Cabal] Warning: 'CSubLibName' is out of scope.
  872. 460.57 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  873. 460.57 s [Cabal] 20% ( 1 / 5) in 'Distribution.Types.ComponentInclude'
  874. 460.57 s [Cabal] Missing documentation for:
  875. 460.57 s [Cabal] Module header
  876. 460.57 s [Cabal] ComponentInclude (src/Distribution/Types/ComponentInclude.hs:16)
  877. 460.57 s [Cabal] ci_id (src/Distribution/Types/ComponentInclude.hs:25)
  878. 460.57 s [Cabal] ci_pkgid (src/Distribution/Types/ComponentInclude.hs:28)
  879. 460.57 s [Cabal] Warning: 'ModuleRenaming' is ambiguous. It is defined
  880. 460.57 s [Cabal] * in ‘Distribution.Types.ModuleRenaming’
  881. 460.57 s [Cabal] * in ‘Distribution.Types.ModuleRenaming’
  882. 460.57 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  883. 460.57 s [Cabal] by specifying the type/value namespace explicitly.
  884. 460.57 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.ModuleRenaming’
  885. 460.57 s [Cabal] Warning: 'BuildInfo' is out of scope.
  886. 460.57 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  887. 460.57 s [Cabal] 25% ( 1 / 4) in 'Distribution.Types.ComponentLocalBuildInfo'
  888. 460.57 s [Cabal] Missing documentation for:
  889. 460.57 s [Cabal] Module header
  890. 460.57 s [Cabal] componentIsIndefinite (src/Distribution/Types/ComponentLocalBuildInfo.hs:122)
  891. 460.57 s [Cabal] maybeComponentInstantiatedWith (src/Distribution/Types/ComponentLocalBuildInfo.hs:126)
  892. 460.57 s [Cabal] 0% ( 0 / 2) in 'Distribution.Types.DumpBuildInfo'
  893. 460.57 s [Cabal] Missing documentation for:
  894. 460.57 s [Cabal] Module header
  895. 460.57 s [Cabal] DumpBuildInfo (src/Distribution/Types/DumpBuildInfo.hs:10)
  896. 460.57 s [Cabal] Warning: 'GivenComponent' is ambiguous. It is defined
  897. 460.57 s [Cabal] * at src/Distribution/Types/GivenComponent.hs:20:23
  898. 460.57 s [Cabal] * at src/Distribution/Types/GivenComponent.hs:20:1
  899. 460.57 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  900. 460.57 s [Cabal] by specifying the type/value namespace explicitly.
  901. 460.57 s [Cabal] Defaulting to the one defined at src/Distribution/Types/GivenComponent.hs:20:1
  902. 460.57 s [Cabal] 50% ( 1 / 2) in 'Distribution.Types.GivenComponent'
  903. 460.57 s [Cabal] Missing documentation for:
  904. 460.57 s [Cabal] Module header
  905. 460.57 s [Cabal] 100% ( 5 / 5) in 'Distribution.Types.PackageName.Magic'
  906. 460.57 s [Cabal] 80% ( 4 / 5) in 'Distribution.Types.ParStrat'
  907. 460.57 s [Cabal] Missing documentation for:
  908. 460.57 s [Cabal] Module header
  909. 460.57 s [Cabal] Warning: 'TargetInfo' is ambiguous. It is defined
  910. 460.57 s [Cabal] * at src/Distribution/Types/TargetInfo.hs:22:19
  911. 460.57 s [Cabal] * at src/Distribution/Types/TargetInfo.hs:22:1
  912. 460.57 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  913. 460.57 s [Cabal] by specifying the type/value namespace explicitly.
  914. 460.57 s [Cabal] Defaulting to the one defined at src/Distribution/Types/TargetInfo.hs:22:1
  915. 460.57 s [Cabal] Warning: 'LocalBuildInfo' is out of scope.
  916. 460.57 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  917. 460.57 s [Cabal] 50% ( 1 / 2) in 'Distribution.Types.TargetInfo'
  918. 460.57 s [Cabal] Missing documentation for:
  919. 460.57 s [Cabal] Module header
  920. 460.58 s [Cabal] 100% ( 8 / 8) in 'Distribution.Utils.IOData'
  921. 460.58 s [Cabal] Warning: 'ByteString' is out of scope.
  922. 460.58 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  923. 460.58 s [Cabal] 75% ( 3 / 4) in 'Distribution.Utils.Json'
  924. 460.58 s [Cabal] Missing documentation for:
  925. 460.58 s [Cabal] Json (src/Distribution/Utils/Json.hs:20)
  926. 460.58 s [Cabal] Warning: 'mapAccumL' is out of scope.
  927. 460.58 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  928. 460.58 s [Cabal] 50% ( 1 / 2) in 'Distribution.Utils.MapAccum'
  929. 460.58 s [Cabal] Missing documentation for:
  930. 460.58 s [Cabal] Module header
  931. 460.58 s [Cabal] 100% ( 5 / 5) in 'Distribution.Utils.Progress'
  932. 460.58 s [Cabal] Warning: 'Point' is ambiguous. It is defined
  933. 460.58 s [Cabal] * at src/Distribution/Utils/UnionFind.hs:23:21
  934. 460.58 s [Cabal] * at src/Distribution/Utils/UnionFind.hs:23:1
  935. 460.58 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  936. 460.58 s [Cabal] by specifying the type/value namespace explicitly.
  937. 460.58 s [Cabal] Defaulting to the one defined at src/Distribution/Utils/UnionFind.hs:23:1
  938. 460.58 s [Cabal] 0% ( 0 / 3) in 'Distribution.Verbosity.Internal'
  939. 460.58 s [Cabal] Missing documentation for:
  940. 460.58 s [Cabal] Module header
  941. 460.58 s [Cabal] VerbosityLevel (src/Distribution/Verbosity/Internal.hs:12)
  942. 460.58 s [Cabal] VerbosityFlag (src/Distribution/Verbosity/Internal.hs:18)
  943. 460.58 s [Cabal] Warning: 'Verbosity' is ambiguous. It is defined
  944. 460.58 s [Cabal] * at src/Distribution/Verbosity.hs:90:18
  945. 460.58 s [Cabal] * at src/Distribution/Verbosity.hs:90:1
  946. 460.58 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  947. 460.58 s [Cabal] by specifying the type/value namespace explicitly.
  948. 460.58 s [Cabal] Defaulting to the one defined at src/Distribution/Verbosity.hs:90:1
  949. 460.58 s [Cabal] Warning: 'stderr' is out of scope.
  950. 460.58 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  951. 460.58 s [Cabal] Warning: 'stdout' is out of scope.
  952. 460.58 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  953. 460.59 s [Cabal] 87% ( 35 / 40) in 'Distribution.Verbosity'
  954. 460.59 s [Cabal] Missing documentation for:
  955. 460.59 s [Cabal] Verbosity (src/Distribution/Verbosity.hs:90)
  956. 460.59 s [Cabal] flagToVerbosity (src/Distribution/Verbosity.hs:241)
  957. 460.59 s [Cabal] showForCabal (src/Distribution/Verbosity.hs:244)
  958. 460.59 s [Cabal] showForGHC (src/Distribution/Verbosity.hs:267)
  959. 460.59 s [Cabal] verboseHasFlags (src/Distribution/Verbosity.hs:335)
  960. 460.59 s [Cabal] Warning: 'Program' is ambiguous. It is defined
  961. 460.59 s [Cabal] * at src/Distribution/Simple/Program/Types.hs:50:16
  962. 460.59 s [Cabal] * at src/Distribution/Simple/Program/Types.hs:50:1
  963. 460.59 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  964. 460.59 s [Cabal] by specifying the type/value namespace explicitly.
  965. 460.59 s [Cabal] Defaulting to the one defined at src/Distribution/Simple/Program/Types.hs:50:1
  966. 460.59 s [Cabal] Warning: 'ConfiguredProgram' is ambiguous. It is defined
  967. 460.59 s [Cabal] * at src/Distribution/Simple/Program/Types.hs:120:26
  968. 460.59 s [Cabal] * at src/Distribution/Simple/Program/Types.hs:120:1
  969. 460.59 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  970. 460.59 s [Cabal] by specifying the type/value namespace explicitly.
  971. 460.59 s [Cabal] Defaulting to the one defined at src/Distribution/Simple/Program/Types.hs:120:1
  972. 460.59 s [Cabal] Warning: 'findExecutable' is out of scope.
  973. 460.59 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  974. 460.59 s [Cabal] Warning: 'simpleProgram' is out of scope.
  975. 460.59 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  976. 460.59 s [Cabal] Warning: 'findProgramOnSearchPath' is out of scope.
  977. 460.59 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  978. 460.59 s [Cabal] 83% ( 10 / 12) in 'Distribution.Simple.Program.Types'
  979. 460.59 s [Cabal] Missing documentation for:
  980. 460.59 s [Cabal] ProgramSearchPathEntry (src/Distribution/Simple/Program/Types.hs:105)
  981. 460.59 s [Cabal] ProgArg (src/Distribution/Simple/Program/Types.hs:83)
  982. 460.59 s [Cabal] Warning: 'PreProcessor' is ambiguous. It is defined
  983. 460.59 s [Cabal] * at src/Distribution/Simple/PreProcess/Types.hs:69:21
  984. 460.59 s [Cabal] * at src/Distribution/Simple/PreProcess/Types.hs:69:1
  985. 460.59 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  986. 460.59 s [Cabal] by specifying the type/value namespace explicitly.
  987. 460.59 s [Cabal] Defaulting to the one defined at src/Distribution/Simple/PreProcess/Types.hs:69:1
  988. 460.60 s [Cabal] 60% ( 3 / 5) in 'Distribution.Simple.PreProcess.Types'
  989. 460.60 s [Cabal] Missing documentation for:
  990. 460.60 s [Cabal] builtinHaskellSuffixes (src/Distribution/Simple/PreProcess/Types.hs:111)
  991. 460.60 s [Cabal] builtinHaskellBootSuffixes (src/Distribution/Simple/PreProcess/Types.hs:114)
  992. 460.60 s [Cabal] 0% ( 0 / 5) in 'Distribution.Simple.Errors'
  993. 460.60 s [Cabal] Missing documentation for:
  994. 460.60 s [Cabal] Module header
  995. 460.60 s [Cabal] CabalException (src/Distribution/Simple/Errors.hs:46)
  996. 460.60 s [Cabal] FailedDependency (src/Distribution/Simple/Errors.hs:39)
  997. 460.60 s [Cabal] exceptionCode (src/Distribution/Simple/Errors.hs:179)
  998. 460.60 s [Cabal] exceptionMessage (src/Distribution/Simple/Errors.hs:315)
  999. 460.60 s [Cabal] 100% ( 3 / 3) in 'Distribution.Simple.PreProcess.Unlit'
  1000. 460.60 s [Cabal] Warning: 'ModuleScope' is ambiguous. It is defined
  1001. 460.60 s [Cabal] * at src/Distribution/Backpack/ModuleScope.hs:69:20
  1002. 460.60 s [Cabal] * at src/Distribution/Backpack/ModuleScope.hs:69:1
  1003. 460.60 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1004. 460.60 s [Cabal] by specifying the type/value namespace explicitly.
  1005. 460.60 s [Cabal] Defaulting to the one defined at src/Distribution/Backpack/ModuleScope.hs:69:1
  1006. 460.60 s [Cabal] Warning: 'ModuleSubst' is out of scope.
  1007. 460.60 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1008. 460.60 s [Cabal] Warning: 'UnitIdU' is ambiguous. It is defined
  1009. 460.60 s [Cabal] * at src/Distribution/Backpack/UnifyM.hs:261:5
  1010. 460.60 s [Cabal] * at src/Distribution/Backpack/UnifyM.hs:268:1
  1011. 460.60 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1012. 460.60 s [Cabal] by specifying the type/value namespace explicitly.
  1013. 460.60 s [Cabal] Defaulting to the one defined at src/Distribution/Backpack/UnifyM.hs:268:1
  1014. 460.60 s [Cabal] Warning: 'Module' is ambiguous. It is defined
  1015. 460.60 s [Cabal] * in ‘Distribution.Types.Module’
  1016. 460.60 s [Cabal] * in ‘Distribution.Types.Module’
  1017. 460.60 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1018. 460.60 s [Cabal] by specifying the type/value namespace explicitly.
  1019. 460.60 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.Module’
  1020. 460.60 s [Cabal] Warning: 'ModuleU' is ambiguous. It is defined
  1021. 460.60 s [Cabal] * at src/Distribution/Backpack/UnifyM.hs:256:5
  1022. 460.60 s [Cabal] * at src/Distribution/Backpack/UnifyM.hs:265:1
  1023. 460.60 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1024. 460.60 s [Cabal] by specifying the type/value namespace explicitly.
  1025. 460.60 s [Cabal] Defaulting to the one defined at src/Distribution/Backpack/UnifyM.hs:265:1
  1026. 460.60 s [Cabal] Warning: 'UnifyM' is ambiguous. It is defined
  1027. 460.60 s [Cabal] * at src/Distribution/Backpack/UnifyM.hs:83:22
  1028. 460.60 s [Cabal] * at src/Distribution/Backpack/UnifyM.hs:83:1
  1029. 460.60 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1030. 460.60 s [Cabal] by specifying the type/value namespace explicitly.
  1031. 460.60 s [Cabal] Defaulting to the one defined at src/Distribution/Backpack/UnifyM.hs:83:1
  1032. 460.61 s [Cabal] Warning: 'ModuleShape' is ambiguous. It is defined
  1033. 460.61 s [Cabal] * at src/Distribution/Backpack/ModuleShape.hs:30:20
  1034. 460.61 s [Cabal] * at src/Distribution/Backpack/ModuleShape.hs:30:1
  1035. 460.61 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1036. 460.61 s [Cabal] by specifying the type/value namespace explicitly.
  1037. 460.61 s [Cabal] Defaulting to the one defined at src/Distribution/Backpack/ModuleShape.hs:30:1
  1038. 460.62 s [Cabal] Warning: 'die' is out of scope.
  1039. 460.62 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1040. 460.63 s [Cabal] Warning: 'rawSystem' is out of scope.
  1041. 460.63 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1042. 460.63 s [Cabal] Warning: 'action' is out of scope.
  1043. 460.63 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1044. 460.63 s [Cabal] Warning: 'CreatePipe' is out of scope.
  1045. 460.63 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1046. 460.64 s [Cabal] Warning: 'findModuleFile' is out of scope.
  1047. 460.64 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1048. 460.64 s [Cabal] Warning: 'createDirectoryIfMissing' is out of scope.
  1049. 460.64 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1050. 460.64 s [Cabal] Warning: 'TempFileOptions' is ambiguous. It is defined
  1051. 460.64 s [Cabal] * at src/Distribution/Simple/Utils.hs:1632:24
  1052. 460.64 s [Cabal] * at src/Distribution/Simple/Utils.hs:1632:1
  1053. 460.64 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1054. 460.64 s [Cabal] by specifying the type/value namespace explicitly.
  1055. 460.64 s [Cabal] Defaulting to the one defined at src/Distribution/Simple/Utils.hs:1632:1
  1056. 460.64 s [Cabal] Warning: 'ByteString' is out of scope.
  1057. 460.64 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1058. 460.64 s [Cabal] Warning: 'waitForProcess' is out of scope.
  1059. 460.64 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1060. 460.65 s [Cabal] 85% (122 /142) in 'Distribution.Simple.Utils'
  1061. 460.65 s [Cabal] Missing documentation for:
  1062. 460.65 s [Cabal] cabalVersion (src/Distribution/Simple/Utils.hs:285)
  1063. 460.65 s [Cabal] dieNoVerbosity (src/Distribution/Simple/Utils.hs:346)
  1064. 460.65 s [Cabal] die' (src/Distribution/Simple/Utils.hs:376)
  1065. 460.65 s [Cabal] dieWithException (src/Distribution/Simple/Utils.hs:389)
  1066. 460.65 s [Cabal] dieWithLocation' (src/Distribution/Simple/Utils.hs:365)
  1067. 460.65 s [Cabal] dieNoWrap (src/Distribution/Simple/Utils.hs:408)
  1068. 460.65 s [Cabal] topHandler (src/Distribution/Simple/Utils.hs:515)
  1069. 460.65 s [Cabal] topHandlerWith (src/Distribution/Simple/Utils.hs:464)
  1070. 460.65 s [Cabal] infoNoWrap (src/Distribution/Simple/Utils.hs:603)
  1071. 460.65 s [Cabal] VerboseException (src/Distribution/Simple/Utils.hs:384)
  1072. 460.65 s [Cabal] setFileOrdinary (src/Distribution/Compat/CopyFile.hs:77)
  1073. 460.65 s [Cabal] setFileExecutable (src/Distribution/Compat/CopyFile.hs:78)
  1074. 460.65 s [Cabal] shortRelativePath (src/Distribution/Simple/Utils.hs:1747)
  1075. 460.65 s [Cabal] findFirstFile (src/Distribution/Simple/Utils.hs:1301)
  1076. 460.65 s [Cabal] findAllFilesWithExtension (src/Distribution/Simple/Utils.hs:1277)
  1077. 460.65 s [Cabal] addLibraryPath (src/Distribution/Simple/Utils.hs:1397)
  1078. 460.65 s [Cabal] defaultTempFileOptions (src/Distribution/Simple/Utils.hs:1638)
  1079. 460.65 s [Cabal] createTempDirectory (src/Distribution/Compat/Internal/TempFile.hs:124)
  1080. 460.65 s [Cabal] equating
  1081. 460.65 s [Cabal] unintersperse
  1082. 460.65 s [Cabal] Warning: 'NubList' is ambiguous. It is defined
  1083. 460.65 s [Cabal] * at src/Distribution/Utils/NubList.hs:24:21
  1084. 460.65 s [Cabal] * at src/Distribution/Utils/NubList.hs:24:1
  1085. 460.65 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1086. 460.65 s [Cabal] by specifying the type/value namespace explicitly.
  1087. 460.65 s [Cabal] Defaulting to the one defined at src/Distribution/Utils/NubList.hs:24:1
  1088. 460.66 s [Cabal] 66% ( 6 / 9) in 'Distribution.Utils.NubList'
  1089. 460.66 s [Cabal] Missing documentation for:
  1090. 460.66 s [Cabal] Module header
  1091. 460.66 s [Cabal] fromNubList
  1092. 460.66 s [Cabal] fromNubListR
  1093. 460.66 s [Cabal] Warning: 'LogProgress' is ambiguous. It is defined
  1094. 460.66 s [Cabal] * at src/Distribution/Utils/LogProgress.hs:33:25
  1095. 460.66 s [Cabal] * at src/Distribution/Utils/LogProgress.hs:33:1
  1096. 460.66 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1097. 460.66 s [Cabal] by specifying the type/value namespace explicitly.
  1098. 460.66 s [Cabal] Defaulting to the one defined at src/Distribution/Utils/LogProgress.hs:33:1
  1099. 460.66 s [Cabal] Warning: 'die' is out of scope.
  1100. 460.66 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1101. 460.66 s [Cabal] 85% ( 6 / 7) in 'Distribution.Utils.LogProgress'
  1102. 460.66 s [Cabal] Missing documentation for:
  1103. 460.66 s [Cabal] Module header
  1104. 460.66 s [Cabal] 30% ( 4 / 13) in 'Distribution.Simple.Program.Run'
  1105. 460.66 s [Cabal] Missing documentation for:
  1106. 460.66 s [Cabal] IOEncoding (src/Distribution/Simple/Program/Run.hs:61)
  1107. 460.66 s [Cabal] emptyProgramInvocation (src/Distribution/Simple/Program/Run.hs:71)
  1108. 460.66 s [Cabal] simpleProgramInvocation (src/Distribution/Simple/Program/Run.hs:83)
  1109. 460.66 s [Cabal] programInvocation (src/Distribution/Simple/Program/Run.hs:90)
  1110. 460.66 s [Cabal] runProgramInvocation (src/Distribution/Simple/Program/Run.hs:101)
  1111. 460.66 s [Cabal] getProgramInvocationOutput (src/Distribution/Simple/Program/Run.hs:158)
  1112. 460.66 s [Cabal] getProgramInvocationLBS (src/Distribution/Simple/Program/Run.hs:166)
  1113. 460.66 s [Cabal] getProgramInvocationOutputAndErrors (src/Distribution/Simple/Program/Run.hs:177)
  1114. 460.66 s [Cabal] getProgramInvocationLBSAndErrors (src/Distribution/Simple/Program/Run.hs:189)
  1115. 460.66 s [Cabal] 100% ( 4 / 4) in 'Distribution.Simple.Program.Script'
  1116. 460.66 s [Cabal] 50% ( 1 / 2) in 'Distribution.Simple.Program.ResponseFile'
  1117. 460.66 s [Cabal] Missing documentation for:
  1118. 460.66 s [Cabal] withResponseFile (src/Distribution/Simple/Program/ResponseFile.hs:37)
  1119. 460.67 s [Cabal] 66% ( 2 / 3) in 'Distribution.Simple.Program.Hpc'
  1120. 460.67 s [Cabal] Missing documentation for:
  1121. 460.67 s [Cabal] union (src/Distribution/Simple/Program/Hpc.hs:115)
  1122. 460.67 s [Cabal] 63% ( 7 / 11) in 'Distribution.Simple.Program.Find'
  1123. 460.67 s [Cabal] Missing documentation for:
  1124. 460.67 s [Cabal] ProgramSearchPathEntry (src/Distribution/Simple/Program/Types.hs:105)
  1125. 460.67 s [Cabal] defaultProgramSearchPath (src/Distribution/Simple/Program/Find.hs:66)
  1126. 460.67 s [Cabal] findProgramOnSearchPath (src/Distribution/Simple/Program/Find.hs:82)
  1127. 460.67 s [Cabal] logExtraProgramSearchPath (src/Distribution/Simple/Program/Find.hs:72)
  1128. 460.67 s [Cabal] Warning: 'UnitIndex' is out of scope.
  1129. 460.67 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1130. 460.67 s [Cabal] Warning: 'PackageIndex' is ambiguous. It is defined
  1131. 460.67 s [Cabal] * at src/Distribution/Simple/PackageIndex.hs:127:23
  1132. 460.67 s [Cabal] * at src/Distribution/Simple/PackageIndex.hs:127:1
  1133. 460.67 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1134. 460.67 s [Cabal] by specifying the type/value namespace explicitly.
  1135. 460.67 s [Cabal] Defaulting to the one defined at src/Distribution/Simple/PackageIndex.hs:127:1
  1136. 460.67 s [Cabal] Warning: 'InstalledPackageInfo' is out of scope.
  1137. 460.67 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1138. 460.67 s [Cabal] Warning: 'Cabal' is out of scope.
  1139. 460.67 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1140. 460.67 s [Cabal] Warning: 'PackageDB' is out of scope.
  1141. 460.67 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1142. 460.68 s [Cabal] 92% ( 38 / 41) in 'Distribution.Simple.PackageIndex'
  1143. 460.68 s [Cabal] Missing documentation for:
  1144. 460.68 s [Cabal] SearchResult (src/Distribution/Simple/PackageIndex.hs:559)
  1145. 460.68 s [Cabal] topologicalOrder (src/Distribution/Simple/PackageIndex.hs:667)
  1146. 460.68 s [Cabal] reverseTopologicalOrder (src/Distribution/Simple/PackageIndex.hs:675)
  1147. 460.68 s [Cabal] 50% ( 3 / 6) in 'Distribution.Simple.PackageDescription'
  1148. 460.68 s [Cabal] Missing documentation for:
  1149. 460.68 s [Cabal] readGenericPackageDescription (src/Distribution/Simple/PackageDescription.hs:45)
  1150. 460.68 s [Cabal] readHookedBuildInfo (src/Distribution/Simple/PackageDescription.hs:48)
  1151. 460.68 s [Cabal] parseString (src/Distribution/Simple/PackageDescription.hs:81)
  1152. 460.68 s [Cabal] Warning: 'matchDirFileGlob' is out of scope.
  1153. 460.68 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1154. 460.69 s [Cabal] Warning: 'Version' is out of scope.
  1155. 460.69 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1156. 460.69 s [Cabal] 68% ( 15 / 22) in 'Distribution.Simple.Glob.Internal'
  1157. 460.69 s [Cabal] Missing documentation for:
  1158. 460.69 s [Cabal] parseFileGlob (src/Distribution/Simple/Glob/Internal.hs:138)
  1159. 460.69 s [Cabal] enableMultidot (src/Distribution/Simple/Glob/Internal.hs:178)
  1160. 460.69 s [Cabal] dispGlobPieces (src/Distribution/Simple/Glob/Internal.hs:234)
  1161. 460.69 s [Cabal] isGlobEscapedChar (src/Distribution/Simple/Glob/Internal.hs:252)
  1162. 460.69 s [Cabal] GlobSyntaxError (src/Distribution/Simple/Glob/Internal.hs:260)
  1163. 460.69 s [Cabal] explainGlobSyntaxError (src/Distribution/Simple/Glob/Internal.hs:272)
  1164. 460.69 s [Cabal] GlobResult (src/Distribution/Simple/Glob/Internal.hs:318)
  1165. 460.69 s [Cabal] Warning: 'die'' is out of scope.
  1166. 460.69 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1167. 460.69 s [Cabal] Warning: 'Version' is out of scope.
  1168. 460.69 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1169. 460.69 s [Cabal] Warning: 'die' is out of scope.
  1170. 460.69 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1171. 460.69 s [Cabal] 75% ( 12 / 16) in 'Distribution.Simple.Glob'
  1172. 460.69 s [Cabal] Missing documentation for:
  1173. 460.69 s [Cabal] GlobResult (src/Distribution/Simple/Glob/Internal.hs:318)
  1174. 460.69 s [Cabal] parseFileGlob (src/Distribution/Simple/Glob/Internal.hs:138)
  1175. 460.69 s [Cabal] GlobSyntaxError (src/Distribution/Simple/Glob/Internal.hs:260)
  1176. 460.69 s [Cabal] explainGlobSyntaxError (src/Distribution/Simple/Glob/Internal.hs:272)
  1177. 460.69 s [Cabal] Warning: 'm' is out of scope.
  1178. 460.69 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1179. 460.69 s [Cabal] Warning: 'TargetAnnotation' is ambiguous. It is defined
  1180. 460.69 s [Cabal] * at src/Distribution/PackageDescription/Check/Monad.hs:160:27
  1181. 460.69 s [Cabal] * at src/Distribution/PackageDescription/Check/Monad.hs:160:1
  1182. 460.69 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1183. 460.69 s [Cabal] by specifying the type/value namespace explicitly.
  1184. 460.69 s [Cabal] Defaulting to the one defined at src/Distribution/PackageDescription/Check/Monad.hs:160:1
  1185. 460.69 s [Cabal] Warning: 'CheckPackageContentOps' is ambiguous. It is defined
  1186. 460.69 s [Cabal] * at src/Distribution/PackageDescription/Check/Monad.hs:92:33
  1187. 460.69 s [Cabal] * at src/Distribution/PackageDescription/Check/Monad.hs:92:1
  1188. 460.69 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1189. 460.69 s [Cabal] by specifying the type/value namespace explicitly.
  1190. 460.69 s [Cabal] Defaulting to the one defined at src/Distribution/PackageDescription/Check/Monad.hs:92:1
  1191. 460.69 s [Cabal] Warning: 'CheckCtx' is ambiguous. It is defined
  1192. 460.69 s [Cabal] * at src/Distribution/PackageDescription/Check/Monad.hs:109:19
  1193. 460.69 s [Cabal] * at src/Distribution/PackageDescription/Check/Monad.hs:109:1
  1194. 460.69 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1195. 460.69 s [Cabal] by specifying the type/value namespace explicitly.
  1196. 460.69 s [Cabal] Defaulting to the one defined at src/Distribution/PackageDescription/Check/Monad.hs:109:1
  1197. 460.69 s [Cabal] Warning: 'local' is out of scope.
  1198. 460.69 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1199. 460.69 s [Cabal] Warning: 'ask' is out of scope.
  1200. 460.69 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1201. 460.70 s [Cabal] Warning: 'TaraAnn' is out of scope.
  1202. 460.70 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1203. 460.70 s [Cabal] Warning: 'LocalBuildInfo' is out of scope.
  1204. 460.70 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1205. 460.72 s [Cabal] 68% ( 33 / 48) in 'Distribution.Simple.Compiler'
  1206. 460.72 s [Cabal] Missing documentation for:
  1207. 460.72 s [Cabal] Compiler (src/Distribution/Simple/Compiler.hs:91)
  1208. 460.72 s [Cabal] showCompilerId (src/Distribution/Simple/Compiler.hs:113)
  1209. 460.72 s [Cabal] showCompilerIdWithAbi (src/Distribution/Simple/Compiler.hs:116)
  1210. 460.72 s [Cabal] compilerFlavor (src/Distribution/Simple/Compiler.hs:123)
  1211. 460.72 s [Cabal] compilerVersion (src/Distribution/Simple/Compiler.hs:126)
  1212. 460.72 s [Cabal] compilerInfo (src/Distribution/Simple/Compiler.hs:155)
  1213. 460.72 s [Cabal] absolutePackageDBPath (src/Distribution/Simple/Compiler.hs:213)
  1214. 460.72 s [Cabal] flagToOptimisationLevel (src/Distribution/Simple/Compiler.hs:237)
  1215. 460.72 s [Cabal] flagToDebugInfoLevel (src/Distribution/Simple/Compiler.hs:270)
  1216. 460.72 s [Cabal] CompilerFlag (src/Distribution/Simple/Compiler.hs:310)
  1217. 460.72 s [Cabal] languageToFlags (src/Distribution/Simple/Compiler.hs:295)
  1218. 460.72 s [Cabal] unsupportedLanguages (src/Distribution/Simple/Compiler.hs:290)
  1219. 460.72 s [Cabal] knownProfDetailLevels (src/Distribution/Simple/Compiler.hs:476)
  1220. 460.72 s [Cabal] flagToProfDetailLevel (src/Distribution/Simple/Compiler.hs:464)
  1221. 460.72 s [Cabal] showProfDetailLevel (src/Distribution/Simple/Compiler.hs:486)
  1222. 460.72 s [Cabal] 65% ( 17 / 26) in 'Distribution.Simple.Program.HcPkg'
  1223. 460.72 s [Cabal] Missing documentation for:
  1224. 460.72 s [Cabal] initInvocation (src/Distribution/Simple/Program/HcPkg.hs:387)
  1225. 460.72 s [Cabal] registerInvocation (src/Distribution/Simple/Program/HcPkg.hs:401)
  1226. 460.72 s [Cabal] unregisterInvocation (src/Distribution/Simple/Program/HcPkg.hs:429)
  1227. 460.72 s [Cabal] recacheInvocation (src/Distribution/Simple/Program/HcPkg.hs:439)
  1228. 460.73 s [Cabal] exposeInvocation (src/Distribution/Simple/Program/HcPkg.hs:450)
  1229. 460.73 s [Cabal] hideInvocation (src/Distribution/Simple/Program/HcPkg.hs:473)
  1230. 460.73 s [Cabal] dumpInvocation (src/Distribution/Simple/Program/HcPkg.hs:479)
  1231. 460.73 s [Cabal] describeInvocation (src/Distribution/Simple/Program/HcPkg.hs:461)
  1232. 460.73 s [Cabal] listInvocation (src/Distribution/Simple/Program/HcPkg.hs:492)
  1233. 460.74 s [Cabal] Warning: 'OpenModule' is ambiguous. It is defined
  1234. 460.74 s [Cabal] * in ‘Distribution.Backpack’
  1235. 460.74 s [Cabal] * in ‘Distribution.Backpack’
  1236. 460.74 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1237. 460.74 s [Cabal] by specifying the type/value namespace explicitly.
  1238. 460.74 s [Cabal] Defaulting to the one defined in ‘Distribution.Backpack’
  1239. 460.74 s [Cabal] 18% ( 2 / 11) in 'Distribution.Simple.Program.GHC'
  1240. 460.74 s [Cabal] Missing documentation for:
  1241. 460.74 s [Cabal] Module header
  1242. 460.74 s [Cabal] GhcMode (src/Distribution/Simple/Program/GHC.hs:585)
  1243. 460.74 s [Cabal] GhcOptimisation (src/Distribution/Simple/Program/GHC.hs:600)
  1244. 460.74 s [Cabal] GhcDynLinkMode (src/Distribution/Simple/Program/GHC.hs:611)
  1245. 460.74 s [Cabal] GhcProfAuto (src/Distribution/Simple/Program/GHC.hs:620)
  1246. 460.74 s [Cabal] ghcInvocation (src/Distribution/Simple/Program/GHC.hs:648)
  1247. 460.74 s [Cabal] renderGhcOptions (src/Distribution/Simple/Program/GHC.hs:659)
  1248. 460.74 s [Cabal] runGHC (src/Distribution/Simple/Program/GHC.hs:638)
  1249. 460.74 s [Cabal] normaliseGhcArgs (src/Distribution/Simple/Program/GHC.hs:49)
  1250. 460.74 s [Cabal] Warning: 'Program' is ambiguous. It is defined
  1251. 460.74 s [Cabal] * at src/Distribution/Simple/Program/Types.hs:50:16
  1252. 460.74 s [Cabal] * at src/Distribution/Simple/Program/Types.hs:50:1
  1253. 460.74 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1254. 460.74 s [Cabal] by specifying the type/value namespace explicitly.
  1255. 460.74 s [Cabal] Defaulting to the one defined at src/Distribution/Simple/Program/Types.hs:50:1
  1256. 460.74 s [Cabal] 12% ( 4 / 31) in 'Distribution.Simple.Program.Builtin'
  1257. 460.74 s [Cabal] Missing documentation for:
  1258. 460.75 s [Cabal] ghcProgram (src/Distribution/Simple/Program/Builtin.hs:104)
  1259. 460.75 s [Cabal] ghcPkgProgram (src/Distribution/Simple/Program/Builtin.hs:145)
  1260. 460.75 s [Cabal] runghcProgram (src/Distribution/Simple/Program/Builtin.hs:135)
  1261. 460.75 s [Cabal] ghcjsProgram (src/Distribution/Simple/Program/Builtin.hs:156)
  1262. 460.75 s [Cabal] ghcjsPkgProgram (src/Distribution/Simple/Program/Builtin.hs:163)
  1263. 460.75 s [Cabal] hmakeProgram (src/Distribution/Simple/Program/Builtin.hs:174)
  1264. 460.75 s [Cabal] jhcProgram (src/Distribution/Simple/Program/Builtin.hs:185)
  1265. 460.75 s [Cabal] haskellSuiteProgram (src/Distribution/Simple/Program/Builtin.hs:228)
  1266. 460.75 s [Cabal] haskellSuitePkgProgram (src/Distribution/Simple/Program/Builtin.hs:239)
  1267. 460.75 s [Cabal] uhcProgram (src/Distribution/Simple/Program/Builtin.hs:197)
  1268. 460.75 s [Cabal] gccProgram (src/Distribution/Simple/Program/Builtin.hs:268)
  1269. 460.75 s [Cabal] arProgram (src/Distribution/Simple/Program/Builtin.hs:274)
  1270. 460.75 s [Cabal] stripProgram (src/Distribution/Simple/Program/Builtin.hs:277)
  1271. 460.75 s [Cabal] happyProgram (src/Distribution/Simple/Program/Builtin.hs:246)
  1272. 460.75 s [Cabal] alexProgram (src/Distribution/Simple/Program/Builtin.hs:257)
  1273. 460.75 s [Cabal] hsc2hsProgram (src/Distribution/Simple/Program/Builtin.hs:284)
  1274. 460.75 s [Cabal] c2hsProgram (src/Distribution/Simple/Program/Builtin.hs:295)
  1275. 460.75 s [Cabal] cpphsProgram (src/Distribution/Simple/Program/Builtin.hs:301)
  1276. 460.75 s [Cabal] hscolourProgram (src/Distribution/Simple/Program/Builtin.hs:311)
  1277. 460.75 s [Cabal] doctestProgram (src/Distribution/Simple/Program/Builtin.hs:324)
  1278. 460.75 s [Cabal] haddockProgram (src/Distribution/Simple/Program/Builtin.hs:335)
  1279. 460.75 s [Cabal] greencardProgram (src/Distribution/Simple/Program/Builtin.hs:347)
  1280. 460.75 s [Cabal] ldProgram (src/Distribution/Simple/Program/Builtin.hs:350)
  1281. 460.75 s [Cabal] tarProgram (src/Distribution/Simple/Program/Builtin.hs:391)
  1282. 460.75 s [Cabal] cppProgram (src/Distribution/Simple/Program/Builtin.hs:409)
  1283. 460.75 s [Cabal] pkgConfigProgram (src/Distribution/Simple/Program/Builtin.hs:412)
  1284. 460.75 s [Cabal] hpcProgram (src/Distribution/Simple/Program/Builtin.hs:203)
  1285. 460.75 s [Cabal] Warning: 'ProgramDb' is ambiguous. It is defined
  1286. 460.75 s [Cabal] * at src/Distribution/Simple/Program/Db.hs:95:18
  1287. 460.75 s [Cabal] * at src/Distribution/Simple/Program/Db.hs:95:1
  1288. 460.75 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1289. 460.75 s [Cabal] by specifying the type/value namespace explicitly.
  1290. 460.75 s [Cabal] Defaulting to the one defined at src/Distribution/Simple/Program/Db.hs:95:1
  1291. 460.75 s [Cabal] Warning: 'Program' is ambiguous. It is defined
  1292. 460.75 s [Cabal] * at src/Distribution/Simple/Program/Types.hs:50:16
  1293. 460.75 s [Cabal] * at src/Distribution/Simple/Program/Types.hs:50:1
  1294. 460.75 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1295. 460.75 s [Cabal] by specifying the type/value namespace explicitly.
  1296. 460.75 s [Cabal] Defaulting to the one defined at src/Distribution/Simple/Program/Types.hs:50:1
  1297. 460.75 s [Cabal] Warning: 'Programs' is out of scope.
  1298. 460.75 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1299. 460.76 s [Cabal] Warning: 'AnyVersion' is out of scope.
  1300. 460.76 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1301. 460.76 s [Cabal] 82% ( 28 / 34) in 'Distribution.Simple.Program.Db'
  1302. 460.76 s [Cabal] Missing documentation for:
  1303. 460.76 s [Cabal] emptyProgramDb (src/Distribution/Simple/Program/Db.hs:107)
  1304. 460.76 s [Cabal] defaultProgramDb (src/Distribution/Simple/Program/Db.hs:110)
  1305. 460.76 s [Cabal] addKnownPrograms (src/Distribution/Simple/Program/Db.hs:190)
  1306. 460.76 s [Cabal] lookupKnownProgram (src/Distribution/Simple/Program/Db.hs:193)
  1307. 460.76 s [Cabal] knownPrograms (src/Distribution/Simple/Program/Db.hs:197)
  1308. 460.76 s [Cabal] userMaybeSpecifyPath (src/Distribution/Simple/Program/Db.hs:259)
  1309. 460.77 s [Cabal] Warning: 'Program' is ambiguous. It is defined
  1310. 460.77 s [Cabal] * at src/Distribution/Simple/Program/Types.hs:50:16
  1311. 460.77 s [Cabal] * at src/Distribution/Simple/Program/Types.hs:50:1
  1312. 460.77 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1313. 460.77 s [Cabal] by specifying the type/value namespace explicitly.
  1314. 460.77 s [Cabal] Defaulting to the one defined at src/Distribution/Simple/Program/Types.hs:50:1
  1315. 460.77 s [Cabal] Warning: 'ConfiguredProgram' is ambiguous. It is defined
  1316. 460.77 s [Cabal] * at src/Distribution/Simple/Program/Types.hs:120:26
  1317. 460.77 s [Cabal] * at src/Distribution/Simple/Program/Types.hs:120:1
  1318. 460.77 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1319. 460.77 s [Cabal] by specifying the type/value namespace explicitly.
  1320. 460.77 s [Cabal] Defaulting to the one defined at src/Distribution/Simple/Program/Types.hs:120:1
  1321. 460.77 s [Cabal] 50% ( 40 / 80) in 'Distribution.Simple.Program'
  1322. 460.77 s [Cabal] Missing documentation for:
  1323. 460.77 s [Cabal] ProgramSearchPathEntry (src/Distribution/Simple/Program/Types.hs:105)
  1324. 460.77 s [Cabal] findProgramOnSearchPath (src/Distribution/Simple/Program/Find.hs:82)
  1325. 460.77 s [Cabal] defaultProgramSearchPath (src/Distribution/Simple/Program/Find.hs:66)
  1326. 460.77 s [Cabal] ProgArg (src/Distribution/Simple/Program/Types.hs:83)
  1327. 460.77 s [Cabal] emptyProgramInvocation (src/Distribution/Simple/Program/Run.hs:71)
  1328. 460.77 s [Cabal] simpleProgramInvocation (src/Distribution/Simple/Program/Run.hs:83)
  1329. 460.77 s [Cabal] programInvocation (src/Distribution/Simple/Program/Run.hs:90)
  1330. 460.77 s [Cabal] runProgramInvocation (src/Distribution/Simple/Program/Run.hs:101)
  1331. 460.77 s [Cabal] getProgramInvocationOutput (src/Distribution/Simple/Program/Run.hs:158)
  1332. 460.77 s [Cabal] getProgramInvocationLBS (src/Distribution/Simple/Program/Run.hs:166)
  1333. 460.77 s [Cabal] defaultProgramDb (src/Distribution/Simple/Program/Db.hs:110)
  1334. 460.77 s [Cabal] emptyProgramDb (src/Distribution/Simple/Program/Db.hs:107)
  1335. 460.77 s [Cabal] addKnownPrograms (src/Distribution/Simple/Program/Db.hs:190)
  1336. 460.77 s [Cabal] lookupKnownProgram (src/Distribution/Simple/Program/Db.hs:193)
  1337. 460.77 s [Cabal] knownPrograms (src/Distribution/Simple/Program/Db.hs:197)
  1338. 460.77 s [Cabal] userMaybeSpecifyPath (src/Distribution/Simple/Program/Db.hs:259)
  1339. 460.77 s [Cabal] ghcProgram (src/Distribution/Simple/Program/Builtin.hs:104)
  1340. 460.77 s [Cabal] ghcPkgProgram (src/Distribution/Simple/Program/Builtin.hs:145)
  1341. 460.77 s [Cabal] ghcjsProgram (src/Distribution/Simple/Program/Builtin.hs:156)
  1342. 460.77 s [Cabal] ghcjsPkgProgram (src/Distribution/Simple/Program/Builtin.hs:163)
  1343. 460.77 s [Cabal] hmakeProgram (src/Distribution/Simple/Program/Builtin.hs:174)
  1344. 460.77 s [Cabal] jhcProgram (src/Distribution/Simple/Program/Builtin.hs:185)
  1345. 460.77 s [Cabal] uhcProgram (src/Distribution/Simple/Program/Builtin.hs:197)
  1346. 460.77 s [Cabal] gccProgram (src/Distribution/Simple/Program/Builtin.hs:268)
  1347. 460.77 s [Cabal] arProgram (src/Distribution/Simple/Program/Builtin.hs:274)
  1348. 460.77 s [Cabal] stripProgram (src/Distribution/Simple/Program/Builtin.hs:277)
  1349. 460.77 s [Cabal] happyProgram (src/Distribution/Simple/Program/Builtin.hs:246)
  1350. 460.77 s [Cabal] alexProgram (src/Distribution/Simple/Program/Builtin.hs:257)
  1351. 460.77 s [Cabal] hsc2hsProgram (src/Distribution/Simple/Program/Builtin.hs:284)
  1352. 460.77 s [Cabal] c2hsProgram (src/Distribution/Simple/Program/Builtin.hs:295)
  1353. 460.77 s [Cabal] cpphsProgram (src/Distribution/Simple/Program/Builtin.hs:301)
  1354. 460.77 s [Cabal] hscolourProgram (src/Distribution/Simple/Program/Builtin.hs:311)
  1355. 460.77 s [Cabal] doctestProgram (src/Distribution/Simple/Program/Builtin.hs:324)
  1356. 460.77 s [Cabal] haddockProgram (src/Distribution/Simple/Program/Builtin.hs:335)
  1357. 460.77 s [Cabal] greencardProgram (src/Distribution/Simple/Program/Builtin.hs:347)
  1358. 460.77 s [Cabal] ldProgram (src/Distribution/Simple/Program/Builtin.hs:350)
  1359. 460.77 s [Cabal] tarProgram (src/Distribution/Simple/Program/Builtin.hs:391)
  1360. 460.77 s [Cabal] cppProgram (src/Distribution/Simple/Program/Builtin.hs:409)
  1361. 460.77 s [Cabal] pkgConfigProgram (src/Distribution/Simple/Program/Builtin.hs:412)
  1362. 460.77 s [Cabal] hpcProgram (src/Distribution/Simple/Program/Builtin.hs:203)
  1363. 460.77 s [Cabal] 33% ( 1 / 3) in 'Distribution.Simple.Program.Strip'
  1364. 460.77 s [Cabal] Missing documentation for:
  1365. 460.77 s [Cabal] stripLib (src/Distribution/Simple/Program/Strip.hs:52)
  1366. 460.77 s [Cabal] stripExe (src/Distribution/Simple/Program/Strip.hs:41)
  1367. 460.77 s [Cabal] Warning: 'CommandUI' is ambiguous. It is defined
  1368. 460.77 s [Cabal] * at src/Distribution/Simple/Command.hs:97:24
  1369. 460.77 s [Cabal] * at src/Distribution/Simple/Command.hs:97:1
  1370. 460.77 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1371. 460.77 s [Cabal] by specifying the type/value namespace explicitly.
  1372. 460.77 s [Cabal] Defaulting to the one defined at src/Distribution/Simple/Command.hs:97:1
  1373. 460.79 s [Cabal] Warning: 'GetOpt' is out of scope.
  1374. 460.79 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1375. 460.79 s [Cabal] Warning: 'smart' is out of scope.
  1376. 460.79 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1377. 460.79 s [Cabal] 61% ( 33 / 54) in 'Distribution.Simple.Command'
  1378. 460.79 s [Cabal] Missing documentation for:
  1379. 460.79 s [Cabal] CommandUI (src/Distribution/Simple/Command.hs:97)
  1380. 460.79 s [Cabal] CommandParse (src/Distribution/Simple/Command.hs:596)
  1381. 460.79 s [Cabal] helpCommandUI (src/Distribution/Simple/Command.hs:764)
  1382. 460.79 s [Cabal] ShowOrParseArgs (src/Distribution/Simple/Command.hs:116)
  1383. 460.79 s [Cabal] Command (src/Distribution/Simple/Command.hs:608)
  1384. 460.79 s [Cabal] commandAddAction (src/Distribution/Simple/Command.hs:621)
  1385. 460.79 s [Cabal] CommandType (src/Distribution/Simple/Command.hs:607)
  1386. 460.79 s [Cabal] commandFromSpec (src/Distribution/Simple/Command.hs:788)
  1387. 460.79 s [Cabal] commandsRun (src/Distribution/Simple/Command.hs:659)
  1388. 460.79 s [Cabal] commandsRunWithFallback (src/Distribution/Simple/Command.hs:675)
  1389. 460.79 s [Cabal] defaultCommandFallback (src/Distribution/Simple/Command.hs:667)
  1390. 460.79 s [Cabal] Name (src/Distribution/Simple/Command.hs:117)
  1391. 460.79 s [Cabal] liftOption (src/Distribution/Simple/Command.hs:374)
  1392. 460.79 s [Cabal] Description (src/Distribution/Simple/Command.hs:118)
  1393. 460.79 s [Cabal] OptFlags (src/Distribution/Simple/Command.hs:160)
  1394. 460.79 s [Cabal] ArgPlaceHolder (src/Distribution/Simple/Command.hs:161)
  1395. 460.79 s [Cabal] MkOptDescr (src/Distribution/Simple/Command.hs:200)
  1396. 460.79 s [Cabal] optArgDef' (src/Distribution/Simple/Command.hs:275)
  1397. 460.79 s [Cabal] noArg (src/Distribution/Simple/Command.hs:279)
  1398. 460.79 s [Cabal] boolOpt (src/Distribution/Simple/Command.hs:287)
  1399. 460.79 s [Cabal] boolOpt' (src/Distribution/Simple/Command.hs:299)
  1400. 460.79 s [Cabal] Warning: 'progDb' is out of scope.
  1401. 460.79 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1402. 460.79 s [Cabal] Warning: 'OptionField' is ambiguous. It is defined
  1403. 460.79 s [Cabal] * at src/Distribution/Simple/Command.hs:125:22
  1404. 460.79 s [Cabal] * at src/Distribution/Simple/Command.hs:125:1
  1405. 460.79 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1406. 460.79 s [Cabal] by specifying the type/value namespace explicitly.
  1407. 460.79 s [Cabal] Defaulting to the one defined at src/Distribution/Simple/Command.hs:125:1
  1408. 460.80 s [Cabal] Warning: 'haddocksInterfaces' is out of scope.
  1409. 460.80 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1410. 460.80 s [Cabal] Warning: 'haddocksAction' is out of scope.
  1411. 460.80 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1412. 460.82 s [Cabal] Warning: 'BuildOptions' is ambiguous. It is defined
  1413. 460.82 s [Cabal] * at src/Distribution/Types/LocalBuildConfig.hs:148:21
  1414. 460.82 s [Cabal] * at src/Distribution/Types/LocalBuildConfig.hs:148:1
  1415. 460.82 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1416. 460.82 s [Cabal] by specifying the type/value namespace explicitly.
  1417. 460.82 s [Cabal] Defaulting to the one defined at src/Distribution/Types/LocalBuildConfig.hs:148:1
  1418. 460.82 s [Cabal] Warning: 'LocalBuildConfig' is ambiguous. It is defined
  1419. 460.82 s [Cabal] * at src/Distribution/Types/LocalBuildConfig.hs:134:25
  1420. 460.82 s [Cabal] * at src/Distribution/Types/LocalBuildConfig.hs:134:1
  1421. 460.82 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1422. 460.82 s [Cabal] by specifying the type/value namespace explicitly.
  1423. 460.82 s [Cabal] Defaulting to the one defined at src/Distribution/Types/LocalBuildConfig.hs:134:1
  1424. 460.82 s [Cabal] Warning: 'InstalledPackageInfo' is out of scope.
  1425. 460.82 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1426. 460.82 s [Cabal] Warning: 'PackageBuildDescr' is ambiguous. It is defined
  1427. 460.82 s [Cabal] * at src/Distribution/Types/LocalBuildConfig.hs:48:26
  1428. 460.82 s [Cabal] * at src/Distribution/Types/LocalBuildConfig.hs:48:1
  1429. 460.82 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1430. 460.82 s [Cabal] by specifying the type/value namespace explicitly.
  1431. 460.83 s [Cabal] Defaulting to the one defined at src/Distribution/Types/LocalBuildConfig.hs:48:1
  1432. 460.83 s [Cabal] 77% ( 7 / 9) in 'Distribution.Types.LocalBuildConfig'
  1433. 460.83 s [Cabal] Missing documentation for:
  1434. 460.83 s [Cabal] Module header
  1435. 460.83 s [Cabal] buildOptionsConfigFlags (src/Distribution/Types/LocalBuildConfig.hs:202)
  1436. 460.83 s [Cabal] Warning: 'LocalBuildInfo' is ambiguous. It is defined
  1437. 460.83 s [Cabal] * at src/Distribution/Types/LocalBuildInfo.hs:180:1
  1438. 460.83 s [Cabal] * at src/Distribution/Types/LocalBuildInfo.hs:129:1
  1439. 460.83 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1440. 460.83 s [Cabal] by specifying the type/value namespace explicitly.
  1441. 460.83 s [Cabal] Defaulting to the one defined at src/Distribution/Types/LocalBuildInfo.hs:129:1
  1442. 460.83 s [Cabal] Warning: 'LocalBuildDescr' is out of scope.
  1443. 460.83 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1444. 460.83 s [Cabal] Warning: 'LocalBuildConfig' is out of scope.
  1445. 460.83 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1446. 460.83 s [Cabal] Warning: 'PackageIdentifier' is ambiguous. It is defined
  1447. 460.83 s [Cabal] * in ‘Distribution.Types.PackageId’
  1448. 460.83 s [Cabal] * in ‘Distribution.Types.PackageId’
  1449. 460.83 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1450. 460.83 s [Cabal] by specifying the type/value namespace explicitly.
  1451. 460.83 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.PackageId’
  1452. 460.83 s [Cabal] Warning: 'TargetInfo' is ambiguous. It is defined
  1453. 460.83 s [Cabal] * at src/Distribution/Types/TargetInfo.hs:22:19
  1454. 460.83 s [Cabal] * at src/Distribution/Types/TargetInfo.hs:22:1
  1455. 460.83 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1456. 460.83 s [Cabal] by specifying the type/value namespace explicitly.
  1457. 460.83 s [Cabal] Defaulting to the one defined at src/Distribution/Types/TargetInfo.hs:22:1
  1458. 460.83 s [Cabal] Warning: 'PackageDescription' is ambiguous. It is defined
  1459. 460.83 s [Cabal] * in ‘Distribution.Types.PackageDescription’
  1460. 460.83 s [Cabal] * in ‘Distribution.Types.PackageDescription’
  1461. 460.83 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1462. 460.83 s [Cabal] by specifying the type/value namespace explicitly.
  1463. 460.83 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.PackageDescription’
  1464. 460.83 s [Cabal] Warning: 'Component' is out of scope.
  1465. 460.83 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1466. 460.84 s [Cabal] 53% ( 16 / 30) in 'Distribution.Types.LocalBuildInfo'
  1467. 460.84 s [Cabal] Missing documentation for:
  1468. 460.84 s [Cabal] Module header
  1469. 460.84 s [Cabal] buildDir (src/Distribution/Types/LocalBuildInfo.hs:277)
  1470. 460.84 s [Cabal] buildDirPBD (src/Distribution/Types/LocalBuildInfo.hs:281)
  1471. 460.84 s [Cabal] configFlagsBuildDir (src/Distribution/Types/LocalBuildInfo.hs:285)
  1472. 460.84 s [Cabal] cabalFilePath (src/Distribution/Types/LocalBuildInfo.hs:288)
  1473. 460.84 s [Cabal] progPrefix (src/Distribution/Types/LocalBuildInfo.hs:292)
  1474. 460.84 s [Cabal] progSuffix (src/Distribution/Types/LocalBuildInfo.hs:294)
  1475. 460.84 s [Cabal] unitIdTarget' (src/Distribution/Types/LocalBuildInfo.hs:360)
  1476. 460.84 s [Cabal] componentNameTargets (src/Distribution/Types/LocalBuildInfo.hs:420)
  1477. 460.84 s [Cabal] unitIdTarget (src/Distribution/Types/LocalBuildInfo.hs:423)
  1478. 460.84 s [Cabal] allTargetsInBuildOrder (src/Distribution/Types/LocalBuildInfo.hs:426)
  1479. 460.84 s [Cabal] withAllTargetsInBuildOrder (src/Distribution/Types/LocalBuildInfo.hs:429)
  1480. 460.84 s [Cabal] neededTargetsInBuildOrder (src/Distribution/Types/LocalBuildInfo.hs:432)
  1481. 460.84 s [Cabal] withNeededTargetsInBuildOrder (src/Distribution/Types/LocalBuildInfo.hs:435)
  1482. 460.84 s [Cabal] Warning: 'LocalBuildInfo' is ambiguous. It is defined
  1483. 460.84 s [Cabal] * at src/Distribution/Types/LocalBuildInfo.hs:180:1
  1484. 460.84 s [Cabal] * at src/Distribution/Types/LocalBuildInfo.hs:129:1
  1485. 460.84 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1486. 460.84 s [Cabal] by specifying the type/value namespace explicitly.
  1487. 460.84 s [Cabal] Defaulting to the one defined at src/Distribution/Types/LocalBuildInfo.hs:129:1
  1488. 460.84 s [Cabal] Warning: 'Executable' is ambiguous. It is defined
  1489. 460.84 s [Cabal] * in ‘Distribution.Types.Executable’
  1490. 460.84 s [Cabal] * in ‘Distribution.Types.Executable’
  1491. 460.84 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1492. 460.84 s [Cabal] by specifying the type/value namespace explicitly.
  1493. 460.84 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.Executable’
  1494. 460.84 s [Cabal] Warning: 'Benchmark' is ambiguous. It is defined
  1495. 460.84 s [Cabal] * in ‘Distribution.Types.Benchmark’
  1496. 460.84 s [Cabal] * in ‘Distribution.Types.Benchmark’
  1497. 460.84 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1498. 460.84 s [Cabal] by specifying the type/value namespace explicitly.
  1499. 460.84 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.Benchmark’
  1500. 460.84 s [Cabal] Warning: 'Library' is ambiguous. It is defined
  1501. 460.84 s [Cabal] * in ‘Distribution.Types.Library’
  1502. 460.84 s [Cabal] * in ‘Distribution.Types.Library’
  1503. 460.84 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1504. 460.84 s [Cabal] by specifying the type/value namespace explicitly.
  1505. 460.84 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.Library’
  1506. 460.84 s [Cabal] Warning: 'compBuildOrder' is out of scope.
  1507. 460.84 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1508. 460.84 s [Cabal] 49% ( 31 / 63) in 'Distribution.Simple.LocalBuildInfo'
  1509. 460.84 s [Cabal] Missing documentation for:
  1510. 460.84 s [Cabal] buildDir (src/Distribution/Types/LocalBuildInfo.hs:277)
  1511. 460.84 s [Cabal] cabalFilePath (src/Distribution/Types/LocalBuildInfo.hs:288)
  1512. 460.84 s [Cabal] progPrefix (src/Distribution/Types/LocalBuildInfo.hs:292)
  1513. 460.84 s [Cabal] progSuffix (src/Distribution/Types/LocalBuildInfo.hs:294)
  1514. 460.84 s [Cabal] Component
  1515. 460.84 s [Cabal] ComponentName
  1516. 460.84 s [Cabal] LibraryName
  1517. 460.84 s [Cabal] defaultLibName
  1518. 460.84 s [Cabal] showComponentName
  1519. 460.84 s [Cabal] componentBuildDir (src/Distribution/Simple/LocalBuildInfo.hs:115)
  1520. 460.84 s [Cabal] foldComponent
  1521. 460.84 s [Cabal] componentName
  1522. 460.84 s [Cabal] componentBuildInfo
  1523. 460.84 s [Cabal] lookupComponent
  1524. 460.84 s [Cabal] getComponent
  1525. 460.84 s [Cabal] allComponentsInBuildOrder (src/Distribution/Simple/LocalBuildInfo.hs:211)
  1526. 460.84 s [Cabal] withTestLBI (src/Distribution/Simple/LocalBuildInfo.hs:173)
  1527. 460.84 s [Cabal] enabledTestLBIs (src/Distribution/Simple/LocalBuildInfo.hs:180)
  1528. 460.84 s [Cabal] enabledBenchLBIs (src/Distribution/Simple/LocalBuildInfo.hs:190)
  1529. 460.84 s [Cabal] defaultInstallDirs (src/Distribution/Simple/InstallDirs.hs:179)
  1530. 460.84 s [Cabal] defaultInstallDirs' (src/Distribution/Simple/InstallDirs.hs:187)
  1531. 460.84 s [Cabal] combineInstallDirs (src/Distribution/Simple/InstallDirs.hs:121)
  1532. 460.84 s [Cabal] PathTemplateVariable (src/Distribution/Simple/InstallDirs/Internal.hs:20)
  1533. 460.84 s [Cabal] PathTemplateEnv (src/Distribution/Simple/InstallDirs.hs:395)
  1534. 460.84 s [Cabal] combinePathTemplate (src/Distribution/Simple/InstallDirs.hs:410)
  1535. 460.84 s [Cabal] platformTemplateEnv (src/Distribution/Simple/InstallDirs.hs:452)
  1536. 460.84 s [Cabal] compilerTemplateEnv (src/Distribution/Simple/InstallDirs.hs:447)
  1537. 460.84 s [Cabal] packageTemplateEnv (src/Distribution/Simple/InstallDirs.hs:437)
  1538. 460.84 s [Cabal] abiTemplateEnv (src/Distribution/Simple/InstallDirs.hs:458)
  1539. 460.84 s [Cabal] installDirsTemplateEnv (src/Distribution/Simple/InstallDirs.hs:477)
  1540. 460.84 s [Cabal] absoluteInstallCommandDirs (src/Distribution/Simple/LocalBuildInfo.hs:378)
  1541. 460.84 s [Cabal] substPathTemplate (src/Distribution/Simple/LocalBuildInfo.hs:436)
  1542. 460.84 s [Cabal] Warning: 'PackageLog' is ambiguous. It is defined
  1543. 460.84 s [Cabal] * at src/Distribution/Simple/Test/Log.hs:40:19
  1544. 460.84 s [Cabal] * at src/Distribution/Simple/Test/Log.hs:40:1
  1545. 460.84 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1546. 460.84 s [Cabal] by specifying the type/value namespace explicitly.
  1547. 460.84 s [Cabal] Defaulting to the one defined at src/Distribution/Simple/Test/Log.hs:40:1
  1548. 460.84 s [Cabal] Warning: 'TestSuiteLog' is ambiguous. It is defined
  1549. 460.84 s [Cabal] * at src/Distribution/Simple/Test/Log.hs:59:21
  1550. 460.84 s [Cabal] * at src/Distribution/Simple/Test/Log.hs:59:1
  1551. 460.84 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1552. 460.84 s [Cabal] by specifying the type/value namespace explicitly.
  1553. 460.84 s [Cabal] Defaulting to the one defined at src/Distribution/Simple/Test/Log.hs:59:1
  1554. 460.84 s [Cabal] 71% ( 10 / 14) in 'Distribution.Simple.Test.Log'
  1555. 460.84 s [Cabal] Missing documentation for:
  1556. 460.84 s [Cabal] Module header
  1557. 460.84 s [Cabal] TestLogs (src/Distribution/Simple/Test/Log.hs:66)
  1558. 460.84 s [Cabal] summarizeSuiteStart (src/Distribution/Simple/Test/Log.hs:193)
  1559. 460.84 s [Cabal] testSuiteLogPath (src/Distribution/Simple/Test/Log.hs:127)
  1560. 460.84 s [Cabal] 55% ( 5 / 9) in 'Distribution.Simple.Hpc'
  1561. 460.84 s [Cabal] Missing documentation for:
  1562. 460.84 s [Cabal] Way (src/Distribution/Simple/Hpc.hs:55)
  1563. 460.84 s [Cabal] htmlDir (src/Distribution/Simple/Hpc.hs:104)
  1564. 460.84 s [Cabal] mixDir (src/Distribution/Simple/Hpc.hs:77)
  1565. 460.84 s [Cabal] tixDir (src/Distribution/Simple/Hpc.hs:85)
  1566. 460.84 s [Cabal] 50% ( 1 / 2) in 'Distribution.Simple.Build.PackageInfoModule'
  1567. 460.84 s [Cabal] Missing documentation for:
  1568. 460.84 s [Cabal] generatePackageInfoModule (src/Distribution/Simple/Build/PackageInfoModule.hs:37)
  1569. 460.85 s [Cabal] 100% ( 3 / 3) in 'Distribution.Simple.Build.Macros'
  1570. 460.85 s [Cabal] Warning: 'computeCompatPackageName' is out of scope.
  1571. 460.85 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1572. 460.85 s [Cabal] Warning: 'ConfiguredComponent' is ambiguous. It is defined
  1573. 460.85 s [Cabal] * at src/Distribution/Backpack/ConfiguredComponent.hs:45:28
  1574. 460.85 s [Cabal] * at src/Distribution/Backpack/ConfiguredComponent.hs:45:1
  1575. 460.85 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1576. 460.85 s [Cabal] by specifying the type/value namespace explicitly.
  1577. 460.85 s [Cabal] Defaulting to the one defined at src/Distribution/Backpack/ConfiguredComponent.hs:45:1
  1578. 460.85 s [Cabal] 54% ( 6 / 11) in 'Distribution.Backpack.ConfiguredComponent'
  1579. 460.85 s [Cabal] Missing documentation for:
  1580. 460.85 s [Cabal] toConfiguredComponent (src/Distribution/Backpack/ConfiguredComponent.hs:179)
  1581. 460.85 s [Cabal] toConfiguredComponents (src/Distribution/Backpack/ConfiguredComponent.hs:317)
  1582. 460.85 s [Cabal] ConfiguredComponentMap (src/Distribution/Backpack/ConfiguredComponent.hs:169)
  1583. 460.85 s [Cabal] extendConfiguredComponentMap (src/Distribution/Backpack/ConfiguredComponent.hs:292)
  1584. 460.85 s [Cabal] newPackageDepsBehaviour (src/Distribution/Backpack/ConfiguredComponent.hs:350)
  1585. 460.85 s [Cabal] Warning: 'ConfiguredComponent' is ambiguous. It is defined
  1586. 460.85 s [Cabal] * at src/Distribution/Backpack/ConfiguredComponent.hs:45:28
  1587. 460.85 s [Cabal] * at src/Distribution/Backpack/ConfiguredComponent.hs:45:1
  1588. 460.85 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1589. 460.85 s [Cabal] by specifying the type/value namespace explicitly.
  1590. 460.85 s [Cabal] Defaulting to the one defined at src/Distribution/Backpack/ConfiguredComponent.hs:45:1
  1591. 460.85 s [Cabal] Warning: 'LinkedComponent' is ambiguous. It is defined
  1592. 460.85 s [Cabal] * at src/Distribution/Backpack/LinkedComponent.hs:50:24
  1593. 460.85 s [Cabal] * at src/Distribution/Backpack/LinkedComponent.hs:50:1
  1594. 460.85 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1595. 460.85 s [Cabal] by specifying the type/value namespace explicitly.
  1596. 460.85 s [Cabal] Defaulting to the one defined at src/Distribution/Backpack/LinkedComponent.hs:50:1
  1597. 460.85 s [Cabal] Warning: 'ReadyComponent' is out of scope.
  1598. 460.85 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1599. 460.85 s [Cabal] Warning: 'ModuleRenaming' is ambiguous. It is defined
  1600. 460.85 s [Cabal] * in ‘Distribution.Types.ModuleRenaming’
  1601. 460.85 s [Cabal] * in ‘Distribution.Types.ModuleRenaming’
  1602. 460.85 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1603. 460.85 s [Cabal] by specifying the type/value namespace explicitly.
  1604. 460.85 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.ModuleRenaming’
  1605. 460.85 s [Cabal] Warning: 'IncludeRenaming' is ambiguous. It is defined
  1606. 460.85 s [Cabal] * in ‘Distribution.Types.IncludeRenaming’
  1607. 460.85 s [Cabal] * in ‘Distribution.Types.IncludeRenaming’
  1608. 460.85 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1609. 460.85 s [Cabal] by specifying the type/value namespace explicitly.
  1610. 460.85 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.IncludeRenaming’
  1611. 460.85 s [Cabal] Warning: 'ModSubst' is out of scope.
  1612. 460.85 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1613. 460.85 s [Cabal] 54% ( 6 / 11) in 'Distribution.Backpack.LinkedComponent'
  1614. 460.85 s [Cabal] Missing documentation for:
  1615. 460.85 s [Cabal] toLinkedComponent (src/Distribution/Backpack/LinkedComponent.hs:123)
  1616. 460.85 s [Cabal] toLinkedComponents (src/Distribution/Backpack/LinkedComponent.hs:417)
  1617. 460.85 s [Cabal] dispLinkedComponent (src/Distribution/Backpack/LinkedComponent.hs:99)
  1618. 460.85 s [Cabal] LinkedComponentMap (src/Distribution/Backpack/LinkedComponent.hs:430)
  1619. 460.85 s [Cabal] extendLinkedComponentMap (src/Distribution/Backpack/LinkedComponent.hs:436)
  1620. 460.85 s [Cabal] Warning: 'PackageDescription' is ambiguous. It is defined
  1621. 460.85 s [Cabal] * in ‘Distribution.Types.PackageDescription’
  1622. 460.85 s [Cabal] * in ‘Distribution.Types.PackageDescription’
  1623. 460.85 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1624. 460.85 s [Cabal] by specifying the type/value namespace explicitly.
  1625. 460.85 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.PackageDescription’
  1626. 460.85 s [Cabal] 100% ( 7 / 7) in 'Distribution.Backpack.ComponentsGraph'
  1627. 460.85 s [Cabal] 100% ( 2 / 2) in 'Distribution.Simple.Program.Ld'
  1628. 460.85 s [Cabal] 100% ( 3 / 3) in 'Distribution.Simple.Program.Ar'
  1629. 460.86 s [Cabal] Warning: 'CommandUI' is out of scope.
  1630. 460.86 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1631. 460.86 s [Cabal] Warning: 'Monoid' is out of scope.
  1632. 460.86 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1633. 460.86 s [Cabal] 25% ( 26 /102) in 'Distribution.Simple.Setup'
  1634. 460.86 s [Cabal] Missing documentation for:
  1635. 460.86 s [Cabal] emptyGlobalFlags (src/Distribution/Simple/Setup/Global.hs:115)
  1636. 460.86 s [Cabal] defaultGlobalFlags (src/Distribution/Simple/Setup/Global.hs:54)
  1637. 460.86 s [Cabal] globalCommand (src/Distribution/Simple/Setup/Global.hs:61)
  1638. 460.86 s [Cabal] emptyConfigFlags (src/Distribution/Simple/Setup/Config.hs:1024)
  1639. 460.86 s [Cabal] defaultConfigFlags (src/Distribution/Simple/Setup/Config.hs:310)
  1640. 460.86 s [Cabal] configureCommand (src/Distribution/Simple/Setup/Config.hs:356)
  1641. 460.86 s [Cabal] configAbsolutePaths (src/Distribution/Simple/Setup/Config.hs:302)
  1642. 460.86 s [Cabal] readPackageDbList (src/Distribution/Simple/Setup/Config.hs:869)
  1643. 460.86 s [Cabal] showPackageDbList (src/Distribution/Simple/Setup/Config.hs:881)
  1644. 460.86 s [Cabal] emptyCopyFlags (src/Distribution/Simple/Setup/Copy.hs:146)
  1645. 460.86 s [Cabal] defaultCopyFlags (src/Distribution/Simple/Setup/Copy.hs:62)
  1646. 460.86 s [Cabal] copyCommand (src/Distribution/Simple/Setup/Copy.hs:72)
  1647. 460.86 s [Cabal] emptyInstallFlags (src/Distribution/Simple/Setup/Install.hs:151)
  1648. 460.86 s [Cabal] defaultInstallFlags (src/Distribution/Simple/Setup/Install.hs:61)
  1649. 460.86 s [Cabal] installCommand (src/Distribution/Simple/Setup/Install.hs:73)
  1650. 460.86 s [Cabal] HaddockFlags (src/Distribution/Simple/Setup/Haddock.hs:83)
  1651. 460.86 s [Cabal] emptyHaddockFlags (src/Distribution/Simple/Setup/Haddock.hs:357)
  1652. 460.86 s [Cabal] defaultHaddockFlags (src/Distribution/Simple/Setup/Haddock.hs:116)
  1653. 460.86 s [Cabal] haddockCommand (src/Distribution/Simple/Setup/Haddock.hs:146)
  1654. 460.86 s [Cabal] HaddockProjectFlags (src/Distribution/Simple/Setup/Haddock.hs:379)
  1655. 460.86 s [Cabal] emptyHaddockProjectFlags (src/Distribution/Simple/Setup/Haddock.hs:599)
  1656. 460.86 s [Cabal] defaultHaddockProjectFlags (src/Distribution/Simple/Setup/Haddock.hs:422)
  1657. 460.86 s [Cabal] haddockProjectCommand (src/Distribution/Simple/Setup/Haddock.hs:446)
  1658. 460.86 s [Cabal] HscolourFlags (src/Distribution/Simple/Setup/Hscolour.hs:42)
  1659. 460.86 s [Cabal] emptyHscolourFlags (src/Distribution/Simple/Setup/Hscolour.hs:58)
  1660. 460.86 s [Cabal] defaultHscolourFlags (src/Distribution/Simple/Setup/Hscolour.hs:61)
  1661. 460.86 s [Cabal] hscolourCommand (src/Distribution/Simple/Setup/Hscolour.hs:81)
  1662. 460.86 s [Cabal] BuildFlags (src/Distribution/Simple/Setup/Build.hs:47)
  1663. 460.86 s [Cabal] emptyBuildFlags (src/Distribution/Simple/Setup/Build.hs:158)
  1664. 460.86 s [Cabal] defaultBuildFlags (src/Distribution/Simple/Setup/Build.hs:65)
  1665. 460.86 s [Cabal] buildCommand (src/Distribution/Simple/Setup/Build.hs:78)
  1666. 460.86 s [Cabal] DumpBuildInfo (src/Distribution/Types/DumpBuildInfo.hs:10)
  1667. 460.86 s [Cabal] ReplFlags (src/Distribution/Simple/Setup/Repl.hs:63)
  1668. 460.86 s [Cabal] defaultReplFlags (src/Distribution/Simple/Setup/Repl.hs:77)
  1669. 460.86 s [Cabal] replCommand (src/Distribution/Simple/Setup/Repl.hs:95)
  1670. 460.86 s [Cabal] ReplOptions (src/Distribution/Simple/Setup/Repl.hs:46)
  1671. 460.86 s [Cabal] CleanFlags (src/Distribution/Simple/Setup/Clean.hs:42)
  1672. 460.86 s [Cabal] emptyCleanFlags (src/Distribution/Simple/Setup/Clean.hs:90)
  1673. 460.86 s [Cabal] defaultCleanFlags (src/Distribution/Simple/Setup/Clean.hs:54)
  1674. 460.86 s [Cabal] cleanCommand (src/Distribution/Simple/Setup/Clean.hs:63)
  1675. 460.86 s [Cabal] emptyRegisterFlags (src/Distribution/Simple/Setup/Register.hs:188)
  1676. 460.86 s [Cabal] defaultRegisterFlags (src/Distribution/Simple/Setup/Register.hs:61)
  1677. 460.86 s [Cabal] registerCommand (src/Distribution/Simple/Setup/Register.hs:75)
  1678. 460.86 s [Cabal] unregisterCommand (src/Distribution/Simple/Setup/Register.hs:142)
  1679. 460.86 s [Cabal] emptySDistFlags (src/Distribution/Simple/Setup/SDist.hs:106)
  1680. 460.86 s [Cabal] defaultSDistFlags (src/Distribution/Simple/Setup/SDist.hs:53)
  1681. 460.86 s [Cabal] sdistCommand (src/Distribution/Simple/Setup/SDist.hs:63)
  1682. 460.86 s [Cabal] TestFlags (src/Distribution/Simple/Setup/Test.hs:82)
  1683. 460.86 s [Cabal] emptyTestFlags (src/Distribution/Simple/Setup/Test.hs:247)
  1684. 460.86 s [Cabal] defaultTestFlags (src/Distribution/Simple/Setup/Test.hs:100)
  1685. 460.86 s [Cabal] testCommand (src/Distribution/Simple/Setup/Test.hs:114)
  1686. 460.86 s [Cabal] TestShowDetails (src/Distribution/Simple/Setup/Test.hs:51)
  1687. 460.86 s [Cabal] BenchmarkFlags (src/Distribution/Simple/Setup/Benchmark.hs:45)
  1688. 460.86 s [Cabal] emptyBenchmarkFlags (src/Distribution/Simple/Setup/Benchmark.hs:124)
  1689. 460.86 s [Cabal] defaultBenchmarkFlags (src/Distribution/Simple/Setup/Benchmark.hs:56)
  1690. 460.86 s [Cabal] benchmarkCommand (src/Distribution/Simple/Setup/Benchmark.hs:64)
  1691. 460.86 s [Cabal] configureOptions (src/Distribution/Simple/Setup/Config.hs:403)
  1692. 460.86 s [Cabal] configureCCompiler (src/Distribution/Simple/Setup/Common.hs:327)
  1693. 460.86 s [Cabal] configureLinker (src/Distribution/Simple/Setup/Common.hs:330)
  1694. 460.86 s [Cabal] buildOptions (src/Distribution/Simple/Setup/Build.hs:129)
  1695. 460.86 s [Cabal] haddockOptions (src/Distribution/Simple/Setup/Haddock.hs:184)
  1696. 460.86 s [Cabal] haddockProjectOptions (src/Distribution/Simple/Setup/Haddock.hs:484)
  1697. 460.86 s [Cabal] installDirsOptions (src/Distribution/Simple/Setup/Config.hs:920)
  1698. 460.86 s [Cabal] testOptions' (src/Distribution/Simple/Setup/Test.hs:134)
  1699. 460.86 s [Cabal] benchmarkOptions' (src/Distribution/Simple/Setup/Benchmark.hs:84)
  1700. 460.86 s [Cabal] programFlagsDescription (src/Distribution/Simple/Setup/Common.hs:105)
  1701. 460.86 s [Cabal] replOptions (src/Distribution/Simple/Setup/Repl.hs:183)
  1702. 460.86 s [Cabal] defaultDistPref (src/Distribution/Simple/Setup/Common.hs:65)
  1703. 460.86 s [Cabal] optionDistPref (src/Distribution/Simple/Setup/Common.hs:255)
  1704. 460.86 s [Cabal] boolOpt (src/Distribution/Simple/Setup/Common.hs:228)
  1705. 460.86 s [Cabal] boolOpt' (src/Distribution/Simple/Setup/Common.hs:234)
  1706. 460.86 s [Cabal] trueArg (src/Distribution/Simple/Setup/Common.hs:237)
  1707. 460.86 s [Cabal] falseArg (src/Distribution/Simple/Setup/Common.hs:238)
  1708. 460.86 s [Cabal] optionVerbosity (src/Distribution/Simple/Setup/Common.hs:275)
  1709. 460.86 s [Cabal] buildingWhatVerbosity (src/Distribution/Simple/Setup.hs:180)
  1710. 460.86 s [Cabal] buildingWhatDistPref (src/Distribution/Simple/Setup.hs:187)
  1711. 460.86 s [Cabal] Warning: 'Library' is out of scope.
  1712. 460.86 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1713. 460.86 s [Cabal] Warning: 'BuildInfo' is ambiguous. It is defined
  1714. 460.86 s [Cabal] * in ‘Distribution.Types.BuildInfo’
  1715. 460.86 s [Cabal] * in ‘Distribution.Types.BuildInfo’
  1716. 460.86 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1717. 460.86 s [Cabal] by specifying the type/value namespace explicitly.
  1718. 460.86 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.BuildInfo’
  1719. 460.86 s [Cabal] Warning: 'Compiler' is ambiguous. It is defined
  1720. 460.86 s [Cabal] * at src/Distribution/Simple/Compiler.hs:91:17
  1721. 460.86 s [Cabal] * at src/Distribution/Simple/Compiler.hs:91:1
  1722. 460.86 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1723. 460.86 s [Cabal] by specifying the type/value namespace explicitly.
  1724. 460.86 s [Cabal] Defaulting to the one defined at src/Distribution/Simple/Compiler.hs:91:1
  1725. 460.86 s [Cabal] 81% ( 13 / 16) in 'Distribution.Simple.Build.Inputs'
  1726. 460.86 s [Cabal] Missing documentation for:
  1727. 460.86 s [Cabal] Module header
  1728. 460.86 s [Cabal] buildingWhatVerbosity (src/Distribution/Simple/Setup.hs:180)
  1729. 460.86 s [Cabal] buildingWhatDistPref (src/Distribution/Simple/Setup.hs:187)
  1730. 460.86 s [Cabal] Warning: 'matchExactly' is out of scope.
  1731. 460.86 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1732. 460.86 s [Cabal] Warning: 'ambiguousWith' is out of scope.
  1733. 460.86 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1734. 460.86 s [Cabal] Warning: 'shadows' is out of scope.
  1735. 460.86 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1736. 460.86 s [Cabal] Warning: 'TargetInfo' is ambiguous. It is defined
  1737. 460.86 s [Cabal] * at src/Distribution/Types/TargetInfo.hs:22:19
  1738. 460.86 s [Cabal] * at src/Distribution/Types/TargetInfo.hs:22:1
  1739. 460.86 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1740. 460.86 s [Cabal] by specifying the type/value namespace explicitly.
  1741. 460.86 s [Cabal] Defaulting to the one defined at src/Distribution/Types/TargetInfo.hs:22:1
  1742. 460.86 s [Cabal] Warning: 'PackageDescription' is ambiguous. It is defined
  1743. 460.86 s [Cabal] * in ‘Distribution.Types.PackageDescription’
  1744. 460.86 s [Cabal] * in ‘Distribution.Types.PackageDescription’
  1745. 460.86 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1746. 460.86 s [Cabal] by specifying the type/value namespace explicitly.
  1747. 460.86 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.PackageDescription’
  1748. 460.87 s [Cabal] 57% ( 11 / 19) in 'Distribution.Simple.BuildTarget'
  1749. 460.87 s [Cabal] Missing documentation for:
  1750. 460.87 s [Cabal] QualLevel (src/Distribution/Simple/BuildTarget.hs:371)
  1751. 460.87 s [Cabal] buildTargetComponentName (src/Distribution/Simple/BuildTarget.hs:136)
  1752. 460.87 s [Cabal] readUserBuildTargets (src/Distribution/Simple/BuildTarget.hs:183)
  1753. 460.87 s [Cabal] showUserBuildTarget (src/Distribution/Simple/BuildTarget.hs:255)
  1754. 460.87 s [Cabal] UserBuildTargetProblem (src/Distribution/Simple/BuildTarget.hs:242)
  1755. 460.87 s [Cabal] reportUserBuildTargetProblems (src/Distribution/Simple/BuildTarget.hs:247)
  1756. 460.87 s [Cabal] BuildTargetProblem (src/Distribution/Simple/BuildTarget.hs:334)
  1757. 460.87 s [Cabal] reportBuildTargetProblems (src/Distribution/Simple/BuildTarget.hs:397)
  1758. 460.87 s [Cabal] Warning: 'lib' is out of scope.
  1759. 460.87 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1760. 460.87 s [Cabal] Warning: 'C' is out of scope.
  1761. 460.87 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1762. 460.87 s [Cabal] 58% ( 18 / 31) in 'Distribution.Simple.BuildPaths'
  1763. 460.87 s [Cabal] Missing documentation for:
  1764. 460.87 s [Cabal] defaultDistPref (src/Distribution/Simple/Setup/Common.hs:65)
  1765. 460.87 s [Cabal] srcPref (src/Distribution/Simple/BuildPaths.hs:74)
  1766. 460.87 s [Cabal] hscolourPref (src/Distribution/Simple/BuildPaths.hs:77)
  1767. 460.87 s [Cabal] cppHeaderName (src/Distribution/Simple/BuildPaths.hs:108)
  1768. 460.87 s [Cabal] haddockName (src/Distribution/Simple/BuildPaths.hs:129)
  1769. 460.87 s [Cabal] mkLibName (src/Distribution/Simple/BuildPaths.hs:220)
  1770. 460.87 s [Cabal] mkProfLibName (src/Distribution/Simple/BuildPaths.hs:223)
  1771. 460.87 s [Cabal] mkSharedLibName (src/Distribution/Simple/BuildPaths.hs:238)
  1772. 460.87 s [Cabal] mkStaticLibName (src/Distribution/Simple/BuildPaths.hs:244)
  1773. 460.87 s [Cabal] getSourceFiles (src/Distribution/Simple/BuildPaths.hs:191)
  1774. 460.87 s [Cabal] getLibSourceFiles (src/Distribution/Simple/BuildPaths.hs:140)
  1775. 460.87 s [Cabal] getExeSourceFiles (src/Distribution/Simple/BuildPaths.hs:157)
  1776. 460.87 s [Cabal] getFLibSourceFiles (src/Distribution/Simple/BuildPaths.hs:176)
  1777. 460.87 s [Cabal] 12% ( 1 / 8) in 'Distribution.Simple.UHC'
  1778. 460.87 s [Cabal] Missing documentation for:
  1779. 460.87 s [Cabal] configure (src/Distribution/Simple/UHC.hs:64)
  1780. 460.87 s [Cabal] getInstalledPackages (src/Distribution/Simple/UHC.hs:118)
  1781. 460.87 s [Cabal] buildLib (src/Distribution/Simple/UHC.hs:208)
  1782. 460.87 s [Cabal] buildExe (src/Distribution/Simple/UHC.hs:242)
  1783. 460.87 s [Cabal] installLib (src/Distribution/Simple/UHC.hs:324)
  1784. 460.87 s [Cabal] registerPackage (src/Distribution/Simple/UHC.hs:350)
  1785. 460.87 s [Cabal] inplacePackageDbPath (src/Distribution/Simple/UHC.hs:365)
  1786. 460.87 s [Cabal] 0% ( 0 / 13) in 'Distribution.Simple.HaskellSuite'
  1787. 460.87 s [Cabal] Missing documentation for:
  1788. 460.87 s [Cabal] Module header
  1789. 460.87 s [Cabal] configure (src/Distribution/Simple/HaskellSuite.hs:36)
  1790. 460.87 s [Cabal] hstoolVersion (src/Distribution/Simple/HaskellSuite.hs:93)
  1791. 460.87 s [Cabal] numericVersion (src/Distribution/Simple/HaskellSuite.hs:96)
  1792. 460.87 s [Cabal] getCompilerVersion (src/Distribution/Simple/HaskellSuite.hs:99)
  1793. 460.87 s [Cabal] getExtensions (src/Distribution/Simple/HaskellSuite.hs:113)
  1794. 460.87 s [Cabal] getLanguages (src/Distribution/Simple/HaskellSuite.hs:121)
  1795. 460.87 s [Cabal] getInstalledPackages (src/Distribution/Simple/HaskellSuite.hs:135)
  1796. 460.87 s [Cabal] buildLib (src/Distribution/Simple/HaskellSuite.hs:173)
  1797. 460.87 s [Cabal] installLib (src/Distribution/Simple/HaskellSuite.hs:224)
  1798. 460.87 s [Cabal] registerPackage (src/Distribution/Simple/HaskellSuite.hs:245)
  1799. 460.87 s [Cabal] initPackageDB (src/Distribution/Simple/HaskellSuite.hs:257)
  1800. 460.87 s [Cabal] packageDbOpt (src/Distribution/Simple/HaskellSuite.hs:265)
  1801. 460.87 s [Cabal] Warning: 'Arch' is ambiguous. It is defined
  1802. 460.87 s [Cabal] * in ‘Distribution.System’
  1803. 460.87 s [Cabal] * in ‘Distribution.Types.ConfVar’
  1804. 460.87 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1805. 460.87 s [Cabal] by specifying the type/value namespace explicitly.
  1806. 460.87 s [Cabal] Defaulting to the one defined in ‘Distribution.System’
  1807. 460.87 s [Cabal] Warning: 'OS' is ambiguous. It is defined
  1808. 460.87 s [Cabal] * in ‘Distribution.System’
  1809. 460.87 s [Cabal] * in ‘Distribution.Types.ConfVar’
  1810. 460.87 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1811. 460.87 s [Cabal] by specifying the type/value namespace explicitly.
  1812. 460.87 s [Cabal] Defaulting to the one defined in ‘Distribution.System’
  1813. 460.87 s [Cabal] Warning: 'Platform' is ambiguous. It is defined
  1814. 460.87 s [Cabal] * in ‘Distribution.System’
  1815. 460.87 s [Cabal] * in ‘Distribution.System’
  1816. 460.87 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1817. 460.87 s [Cabal] by specifying the type/value namespace explicitly.
  1818. 460.87 s [Cabal] Defaulting to the one defined in ‘Distribution.System’
  1819. 460.88 s [Cabal] Warning: 'BuildSources' is ambiguous. It is defined
  1820. 460.88 s [Cabal] * at src/Distribution/Simple/GHCJS.hs:1105:21
  1821. 460.88 s [Cabal] * at src/Distribution/Simple/GHCJS.hs:1105:1
  1822. 460.88 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1823. 460.88 s [Cabal] by specifying the type/value namespace explicitly.
  1824. 460.88 s [Cabal] Defaulting to the one defined at src/Distribution/Simple/GHCJS.hs:1105:1
  1825. 460.88 s [Cabal] Warning: 'hsLibraries' is out of scope.
  1826. 460.88 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1827. 460.88 s [Cabal] Warning: 'BuildInfo' is ambiguous. It is defined
  1828. 460.88 s [Cabal] * in ‘Distribution.Types.BuildInfo’
  1829. 460.88 s [Cabal] * in ‘Distribution.Types.BuildInfo’
  1830. 460.88 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1831. 460.88 s [Cabal] by specifying the type/value namespace explicitly.
  1832. 460.88 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.BuildInfo’
  1833. 460.88 s [Cabal] 52% ( 20 / 38) in 'Distribution.Simple.GHCJS'
  1834. 460.88 s [Cabal] Missing documentation for:
  1835. 460.88 s [Cabal] Module header
  1836. 460.88 s [Cabal] getGhcInfo (src/Distribution/Simple/GHCJS.hs:308)
  1837. 460.88 s [Cabal] configure (src/Distribution/Simple/GHCJS.hs:117)
  1838. 460.88 s [Cabal] buildLib (src/Distribution/Simple/GHCJS.hs:463)
  1839. 460.88 s [Cabal] replLib (src/Distribution/Simple/GHCJS.hs:474)
  1840. 460.88 s [Cabal] replFLib (src/Distribution/Simple/GHCJS.hs:891)
  1841. 460.88 s [Cabal] replExe (src/Distribution/Simple/GHCJS.hs:914)
  1842. 460.88 s [Cabal] hcPkgInfo (src/Distribution/Simple/GHCJS.hs:1968)
  1843. 460.88 s [Cabal] registerPackage (src/Distribution/Simple/GHCJS.hs:1992)
  1844. 460.88 s [Cabal] componentGhcOptions (src/Distribution/Simple/GHCJS.hs:1780)
  1845. 460.88 s [Cabal] componentCcGhcOptions (src/Distribution/Simple/GHC/Internal.hs:349)
  1846. 460.88 s [Cabal] getLibDir (src/Distribution/Simple/GHCJS.hs:355)
  1847. 460.88 s [Cabal] isDynamic (src/Distribution/Simple/GHCJS.hs:1948)
  1848. 460.88 s [Cabal] pkgRoot (src/Distribution/Simple/GHCJS.hs:2001)
  1849. 460.88 s [Cabal] readGhcEnvironmentFile (src/Distribution/Simple/GHC/EnvironmentParser.hs:57)
  1850. 460.88 s [Cabal] parseGhcEnvironmentFile (src/Distribution/Simple/GHC/EnvironmentParser.hs:54)
  1851. 460.88 s [Cabal] ParseErrorExc (src/Distribution/Simple/GHC/EnvironmentParser.hs:48)
  1852. 460.88 s [Cabal] getImplInfo (src/Distribution/Simple/GHC/ImplInfo.hs:70)
  1853. 460.88 s [Cabal] Warning: 'Executable' is ambiguous. It is defined
  1854. 460.88 s [Cabal] * in ‘Distribution.Types.Executable’
  1855. 460.88 s [Cabal] * in ‘Distribution.Types.Executable’
  1856. 460.88 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1857. 460.88 s [Cabal] by specifying the type/value namespace explicitly.
  1858. 460.88 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.Executable’
  1859. 460.88 s [Cabal] Warning: 'TestSuite' is ambiguous. It is defined
  1860. 460.88 s [Cabal] * in ‘Distribution.Types.TestSuite’
  1861. 460.88 s [Cabal] * in ‘Distribution.Types.TestSuite’
  1862. 460.88 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1863. 460.88 s [Cabal] by specifying the type/value namespace explicitly.
  1864. 460.88 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.TestSuite’
  1865. 460.88 s [Cabal] Warning: 'Benchmark' is ambiguous. It is defined
  1866. 460.88 s [Cabal] * in ‘Distribution.Types.Benchmark’
  1867. 460.88 s [Cabal] * in ‘Distribution.Types.Benchmark’
  1868. 460.88 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1869. 460.88 s [Cabal] by specifying the type/value namespace explicitly.
  1870. 460.88 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.Benchmark’
  1871. 460.88 s [Cabal] Warning: 'BuildInfo' is ambiguous. It is defined
  1872. 460.88 s [Cabal] * in ‘Distribution.Types.BuildInfo’
  1873. 460.88 s [Cabal] * in ‘Distribution.Types.BuildInfo’
  1874. 460.88 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1875. 460.88 s [Cabal] by specifying the type/value namespace explicitly.
  1876. 460.88 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.BuildInfo’
  1877. 460.89 s [Cabal] Warning: 'GhcOptions' is ambiguous. It is defined
  1878. 460.89 s [Cabal] * at src/Distribution/Simple/Program/GHC.hs:410:19
  1879. 460.89 s [Cabal] * at src/Distribution/Simple/Program/GHC.hs:410:1
  1880. 460.89 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1881. 460.89 s [Cabal] by specifying the type/value namespace explicitly.
  1882. 460.89 s [Cabal] Defaulting to the one defined at src/Distribution/Simple/Program/GHC.hs:410:1
  1883. 460.89 s [Cabal] Warning: 'PreBuildComponentRules' is out of scope.
  1884. 460.89 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1885. 460.89 s [Cabal] Warning: 'GhcOptions' is ambiguous. It is defined
  1886. 460.89 s [Cabal] * at src/Distribution/Simple/Program/GHC.hs:410:19
  1887. 460.89 s [Cabal] * at src/Distribution/Simple/Program/GHC.hs:410:1
  1888. 460.89 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1889. 460.89 s [Cabal] by specifying the type/value namespace explicitly.
  1890. 460.89 s [Cabal] Defaulting to the one defined at src/Distribution/Simple/Program/GHC.hs:410:1
  1891. 460.89 s [Cabal] Warning: 'Executable' is ambiguous. It is defined
  1892. 460.89 s [Cabal] * in ‘Distribution.Types.Executable’
  1893. 460.89 s [Cabal] * in ‘Distribution.Types.Executable’
  1894. 460.89 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1895. 460.89 s [Cabal] by specifying the type/value namespace explicitly.
  1896. 460.89 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.Executable’
  1897. 460.89 s [Cabal] Warning: 'hsLibraries' is out of scope.
  1898. 460.89 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1899. 460.89 s [Cabal] Warning: 'BuildInfo' is ambiguous. It is defined
  1900. 460.89 s [Cabal] * in ‘Distribution.Types.BuildInfo’
  1901. 460.89 s [Cabal] * in ‘Distribution.Types.BuildInfo’
  1902. 460.89 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1903. 460.89 s [Cabal] by specifying the type/value namespace explicitly.
  1904. 460.89 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.BuildInfo’
  1905. 460.89 s [Cabal] Warning: 'Compiler' is ambiguous. It is defined
  1906. 460.89 s [Cabal] * at src/Distribution/Simple/Compiler.hs:91:17
  1907. 460.89 s [Cabal] * at src/Distribution/Simple/Compiler.hs:91:1
  1908. 460.89 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1909. 460.89 s [Cabal] by specifying the type/value namespace explicitly.
  1910. 460.89 s [Cabal] Defaulting to the one defined at src/Distribution/Simple/Compiler.hs:91:1
  1911. 460.90 s [Cabal] 55% ( 21 / 38) in 'Distribution.Simple.GHC'
  1912. 460.90 s [Cabal] Missing documentation for:
  1913. 460.90 s [Cabal] getGhcInfo (src/Distribution/Simple/GHC.hs:387)
  1914. 460.90 s [Cabal] configure (src/Distribution/Simple/GHC.hs:155)
  1915. 460.90 s [Cabal] getInstalledPackagesMonitorFiles (src/Distribution/Simple/GHC.hs:545)
  1916. 460.90 s [Cabal] buildLib (src/Distribution/Simple/GHC.hs:578)
  1917. 460.90 s [Cabal] replLib (src/Distribution/Simple/GHC.hs:590)
  1918. 460.90 s [Cabal] replFLib (src/Distribution/Simple/GHC.hs:636)
  1919. 460.90 s [Cabal] replExe (src/Distribution/Simple/GHC.hs:661)
  1920. 460.90 s [Cabal] hcPkgInfo (src/Distribution/Simple/GHC.hs:960)
  1921. 460.90 s [Cabal] registerPackage (src/Distribution/Simple/GHC.hs:984)
  1922. 460.90 s [Cabal] componentGhcOptions (src/Distribution/Simple/GHC/Internal.hs:522)
  1923. 460.90 s [Cabal] componentCcGhcOptions (src/Distribution/Simple/GHC/Internal.hs:349)
  1924. 460.90 s [Cabal] getLibDir (src/Distribution/Simple/GHC.hs:451)
  1925. 460.90 s [Cabal] pkgRoot (src/Distribution/Simple/GHC.hs:993)
  1926. 460.90 s [Cabal] readGhcEnvironmentFile (src/Distribution/Simple/GHC/EnvironmentParser.hs:57)
  1927. 460.90 s [Cabal] parseGhcEnvironmentFile (src/Distribution/Simple/GHC/EnvironmentParser.hs:54)
  1928. 460.90 s [Cabal] ParseErrorExc (src/Distribution/Simple/GHC/EnvironmentParser.hs:48)
  1929. 460.90 s [Cabal] getImplInfo (src/Distribution/Simple/GHC/ImplInfo.hs:70)
  1930. 460.90 s [Cabal] 60% ( 3 / 5) in 'Distribution.Simple.ShowBuildInfo'
  1931. 460.90 s [Cabal] Missing documentation for:
  1932. 460.90 s [Cabal] mkCompilerInfo (src/Distribution/Simple/ShowBuildInfo.hs:134)
  1933. 460.90 s [Cabal] mkComponentInfo (src/Distribution/Simple/ShowBuildInfo.hs:142)
  1934. 460.90 s [Cabal] Warning: 'register' is out of scope.
  1935. 460.90 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1936. 460.90 s [Cabal] 100% ( 2 / 2) in 'Distribution.Simple.Install'
  1937. 460.90 s [Cabal] 66% ( 2 / 3) in 'Distribution.Simple.Build.PathsModule'
  1938. 460.90 s [Cabal] Missing documentation for:
  1939. 460.90 s [Cabal] generatePathsModule (src/Distribution/Simple/Build/PathsModule.hs:42)
  1940. 460.90 s [Cabal] Warning: 'TestSuite' is out of scope.
  1941. 460.90 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1942. 460.90 s [Cabal] Warning: 'Test' is ambiguous. It is defined
  1943. 460.90 s [Cabal] * at src/Distribution/TestSuite.hs:79:5
  1944. 460.90 s [Cabal] * at src/Distribution/TestSuite.hs:78:1
  1945. 460.90 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1946. 460.90 s [Cabal] by specifying the type/value namespace explicitly.
  1947. 460.90 s [Cabal] Defaulting to the one defined at src/Distribution/TestSuite.hs:78:1
  1948. 460.90 s [Cabal] Warning: 'TestSuiteLog' is ambiguous. It is defined
  1949. 460.90 s [Cabal] * at src/Distribution/Simple/Test/Log.hs:59:21
  1950. 460.90 s [Cabal] * at src/Distribution/Simple/Test/Log.hs:59:1
  1951. 460.90 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1952. 460.90 s [Cabal] by specifying the type/value namespace explicitly.
  1953. 460.90 s [Cabal] Defaulting to the one defined at src/Distribution/Simple/Test/Log.hs:59:1
  1954. 460.90 s [Cabal] 75% ( 6 / 8) in 'Distribution.Simple.Test.LibV09'
  1955. 460.90 s [Cabal] Missing documentation for:
  1956. 460.90 s [Cabal] Module header
  1957. 460.90 s [Cabal] runTest (src/Distribution/Simple/Test/LibV09.hs:65)
  1958. 460.90 s [Cabal] 0% ( 0 / 2) in 'Distribution.Simple.Test.ExeV10'
  1959. 460.90 s [Cabal] Missing documentation for:
  1960. 460.90 s [Cabal] Module header
  1961. 460.90 s [Cabal] runTest (src/Distribution/Simple/Test/ExeV10.hs:59)
  1962. 460.90 s [Cabal] Warning: 'dist' is out of scope.
  1963. 460.90 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1964. 460.91 s [Cabal] Warning: 'PackageDescription' is ambiguous. It is defined
  1965. 460.91 s [Cabal] * in ‘Distribution.Types.PackageDescription’
  1966. 460.91 s [Cabal] * in ‘Distribution.Types.PackageDescription’
  1967. 460.91 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1968. 460.91 s [Cabal] by specifying the type/value namespace explicitly.
  1969. 460.91 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.PackageDescription’
  1970. 460.91 s [Cabal] Warning: 'CheckPackageContentOps' is ambiguous. It is defined
  1971. 460.91 s [Cabal] * at src/Distribution/PackageDescription/Check/Monad.hs:92:33
  1972. 460.91 s [Cabal] * at src/Distribution/PackageDescription/Check/Monad.hs:92:1
  1973. 460.91 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1974. 460.91 s [Cabal] by specifying the type/value namespace explicitly.
  1975. 460.91 s [Cabal] Defaulting to the one defined at src/Distribution/PackageDescription/Check/Monad.hs:92:1
  1976. 460.91 s [Cabal] Warning: 'GenericPackageDescription' is ambiguous. It is defined
  1977. 460.91 s [Cabal] * in ‘Distribution.Types.GenericPackageDescription’
  1978. 460.91 s [Cabal] * in ‘Distribution.Types.GenericPackageDescription’
  1979. 460.91 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1980. 460.91 s [Cabal] by specifying the type/value namespace explicitly.
  1981. 460.91 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.GenericPackageDescription’
  1982. 460.91 s [Cabal] 89% ( 17 / 19) in 'Distribution.PackageDescription.Check'
  1983. 460.91 s [Cabal] Missing documentation for:
  1984. 460.91 s [Cabal] CheckExplanationIDString (src/Distribution/PackageDescription/Check/Warning.hs:590)
  1985. 460.91 s [Cabal] ppCheckExplanationId (src/Distribution/PackageDescription/Check/Warning.hs:597)
  1986. 460.91 s [Cabal] 66% ( 4 / 6) in 'Distribution.Make'
  1987. 460.91 s [Cabal] Missing documentation for:
  1988. 460.91 s [Cabal] defaultMain (src/Distribution/Make.hs:85)
  1989. 460.91 s [Cabal] defaultMainArgs (src/Distribution/Make.hs:88)
  1990. 460.92 s [Cabal] Warning: 'ModTime' is ambiguous. It is defined
  1991. 460.92 s [Cabal] * at src/Distribution/Compat/Time.hs:60:19
  1992. 460.92 s [Cabal] * at src/Distribution/Compat/Time.hs:60:1
  1993. 460.92 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  1994. 460.92 s [Cabal] by specifying the type/value namespace explicitly.
  1995. 460.92 s [Cabal] Defaulting to the one defined at src/Distribution/Compat/Time.hs:60:1
  1996. 460.92 s [Cabal] Warning: 'sleepFileTimeCalibrate' is out of scope.
  1997. 460.92 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  1998. 460.92 s [Cabal] 85% ( 6 / 7) in 'Distribution.Compat.Time'
  1999. 460.92 s [Cabal] Missing documentation for:
  2000. 460.92 s [Cabal] Module header
  2001. 460.92 s [Cabal] Warning: 'InstM' is ambiguous. It is defined
  2002. 460.92 s [Cabal] * at src/Distribution/Backpack/ReadyComponent.hs:205:19
  2003. 460.92 s [Cabal] * at src/Distribution/Backpack/ReadyComponent.hs:205:1
  2004. 460.92 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  2005. 460.92 s [Cabal] by specifying the type/value namespace explicitly.
  2006. 460.92 s [Cabal] Defaulting to the one defined at src/Distribution/Backpack/ReadyComponent.hs:205:1
  2007. 460.92 s [Cabal] Warning: 'IndefiniteComponent' is ambiguous. It is defined
  2008. 460.92 s [Cabal] * at src/Distribution/Backpack/ReadyComponent.hs:110:28
  2009. 460.92 s [Cabal] * at src/Distribution/Backpack/ReadyComponent.hs:110:1
  2010. 460.92 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  2011. 460.92 s [Cabal] by specifying the type/value namespace explicitly.
  2012. 460.92 s [Cabal] Defaulting to the one defined at src/Distribution/Backpack/ReadyComponent.hs:110:1
  2013. 460.92 s [Cabal] Warning: 'InstantiatedComponent' is ambiguous. It is defined
  2014. 460.92 s [Cabal] * at src/Distribution/Backpack/ReadyComponent.hs:93:30
  2015. 460.92 s [Cabal] * at src/Distribution/Backpack/ReadyComponent.hs:93:1
  2016. 460.92 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  2017. 460.92 s [Cabal] by specifying the type/value namespace explicitly.
  2018. 460.92 s [Cabal] Defaulting to the one defined at src/Distribution/Backpack/ReadyComponent.hs:93:1
  2019. 460.92 s [Cabal] Warning: 'componentPackageDeps' is out of scope.
  2020. 460.92 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2021. 460.92 s [Cabal] Warning: 'ReadyComponent' is ambiguous. It is defined
  2022. 460.92 s [Cabal] * at src/Distribution/Backpack/ReadyComponent.hs:55:23
  2023. 460.92 s [Cabal] * at src/Distribution/Backpack/ReadyComponent.hs:55:1
  2024. 460.92 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  2025. 460.92 s [Cabal] by specifying the type/value namespace explicitly.
  2026. 460.92 s [Cabal] Defaulting to the one defined at src/Distribution/Backpack/ReadyComponent.hs:55:1
  2027. 460.92 s [Cabal] Warning: 'OpenModule' is ambiguous. It is defined
  2028. 460.92 s [Cabal] * in ‘Distribution.Backpack’
  2029. 460.92 s [Cabal] * in ‘Distribution.Backpack’
  2030. 460.92 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  2031. 460.92 s [Cabal] by specifying the type/value namespace explicitly.
  2032. 460.92 s [Cabal] Defaulting to the one defined in ‘Distribution.Backpack’
  2033. 460.92 s [Cabal] Warning: 'InstalledPackageInfo' is out of scope.
  2034. 460.92 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2035. 460.92 s [Cabal] Warning: 'MungedPackageId' is ambiguous. It is defined
  2036. 460.92 s [Cabal] * in ‘Distribution.Types.MungedPackageId’
  2037. 460.92 s [Cabal] * in ‘Distribution.Types.MungedPackageId’
  2038. 460.92 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  2039. 460.92 s [Cabal] by specifying the type/value namespace explicitly.
  2040. 460.92 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.MungedPackageId’
  2041. 460.92 s [Cabal] Warning: 'LinkedComponent' is ambiguous. It is defined
  2042. 460.92 s [Cabal] * at src/Distribution/Backpack/LinkedComponent.hs:50:24
  2043. 460.92 s [Cabal] * at src/Distribution/Backpack/LinkedComponent.hs:50:1
  2044. 460.92 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  2045. 460.92 s [Cabal] by specifying the type/value namespace explicitly.
  2046. 460.92 s [Cabal] Defaulting to the one defined at src/Distribution/Backpack/LinkedComponent.hs:50:1
  2047. 460.92 s [Cabal] Warning: 'improveUnitId' is out of scope.
  2048. 460.92 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2049. 460.92 s [Cabal] Warning: 'HashedUnitId' is out of scope.
  2050. 460.92 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2051. 460.92 s [Cabal] 50% ( 1 / 2) in 'Distribution.Backpack.Configure'
  2052. 460.92 s [Cabal] Missing documentation for:
  2053. 460.92 s [Cabal] configureComponentLocalBuildInfos (src/Distribution/Backpack/Configure.hs:79)
  2054. 460.92 s [Cabal] Warning: 'OpenModule' is out of scope.
  2055. 460.92 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2056. 460.92 s [Cabal] Warning: 'Module' is out of scope.
  2057. 460.92 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2058. 460.92 s [Cabal] 50% ( 1 / 2) in 'Distribution.Backpack.DescribeUnitId'
  2059. 460.92 s [Cabal] Missing documentation for:
  2060. 460.92 s [Cabal] Module header
  2061. 460.93 s [Cabal] 52% ( 9 / 17) in 'Distribution.Simple.Register'
  2062. 460.93 s [Cabal] Missing documentation for:
  2063. 460.93 s [Cabal] register (src/Distribution/Simple/Register.hs:99)
  2064. 460.93 s [Cabal] unregister (src/Distribution/Simple/Register.hs:703)
  2065. 460.93 s [Cabal] internalPackageDBPath (src/Distribution/Simple/Register.hs:738)
  2066. 460.93 s [Cabal] initPackageDB (src/Distribution/Simple/Register.hs:355)
  2067. 460.93 s [Cabal] doesPackageDBExist (src/Distribution/Simple/Register.hs:375)
  2068. 460.93 s [Cabal] deletePackageDB (src/Distribution/Simple/Register.hs:383)
  2069. 460.93 s [Cabal] registerPackage (src/Distribution/Simple/Register.hs:430)
  2070. 460.93 s [Cabal] generateRegistrationInfo (src/Distribution/Simple/Register.hs:261)
  2071. 460.93 s [Cabal] Warning: 'PreProcessor' is ambiguous. It is defined
  2072. 460.93 s [Cabal] * at src/Distribution/Simple/PreProcess/Types.hs:69:21
  2073. 460.93 s [Cabal] * at src/Distribution/Simple/PreProcess/Types.hs:69:1
  2074. 460.93 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  2075. 460.93 s [Cabal] by specifying the type/value namespace explicitly.
  2076. 460.93 s [Cabal] Defaulting to the one defined at src/Distribution/Simple/PreProcess/Types.hs:69:1
  2077. 460.93 s [Cabal] Warning: 'Suffix' is ambiguous. It is defined
  2078. 460.93 s [Cabal] * at src/Distribution/Simple/PreProcess/Types.hs:101:18
  2079. 460.93 s [Cabal] * at src/Distribution/Simple/PreProcess/Types.hs:101:1
  2080. 460.93 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  2081. 460.93 s [Cabal] by specifying the type/value namespace explicitly.
  2082. 460.93 s [Cabal] Defaulting to the one defined at src/Distribution/Simple/PreProcess/Types.hs:101:1
  2083. 460.93 s [Cabal] 40% ( 9 / 22) in 'Distribution.Simple.PreProcess'
  2084. 460.93 s [Cabal] Missing documentation for:
  2085. 460.93 s [Cabal] builtinHaskellSuffixes (src/Distribution/Simple/PreProcess/Types.hs:111)
  2086. 460.93 s [Cabal] builtinHaskellBootSuffixes (src/Distribution/Simple/PreProcess/Types.hs:114)
  2087. 460.93 s [Cabal] mkSimplePreProcessor (src/Distribution/Simple/PreProcess.hs:109)
  2088. 460.93 s [Cabal] runSimplePreProcessor (src/Distribution/Simple/PreProcess.hs:124)
  2089. 460.93 s [Cabal] ppCpp (src/Distribution/Simple/PreProcess.hs:407)
  2090. 460.93 s [Cabal] ppCpp' (src/Distribution/Simple/PreProcess.hs:410)
  2091. 460.93 s [Cabal] ppGreenCard (src/Distribution/Simple/PreProcess.hs:382)
  2092. 460.93 s [Cabal] ppC2hs (src/Distribution/Simple/PreProcess.hs:651)
  2093. 460.93 s [Cabal] ppHsc2hs (src/Distribution/Simple/PreProcess.hs:476)
  2094. 460.93 s [Cabal] ppHappy (src/Distribution/Simple/PreProcess.hs:813)
  2095. 460.93 s [Cabal] ppAlex (src/Distribution/Simple/PreProcess.hs:822)
  2096. 460.93 s [Cabal] ppUnlit (src/Distribution/Simple/PreProcess.hs:397)
  2097. 460.93 s [Cabal] platformDefines (src/Distribution/Simple/PreProcess.hs:720)
  2098. 460.93 s [Cabal] Warning: 'UserHooks' is ambiguous. It is defined
  2099. 460.93 s [Cabal] * at src/Distribution/Simple/UserHooks.hs:53:18
  2100. 460.93 s [Cabal] * at src/Distribution/Simple/UserHooks.hs:53:1
  2101. 460.93 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  2102. 460.93 s [Cabal] by specifying the type/value namespace explicitly.
  2103. 460.93 s [Cabal] Defaulting to the one defined at src/Distribution/Simple/UserHooks.hs:53:1
  2104. 460.93 s [Cabal] 75% ( 3 / 4) in 'Distribution.Simple.UserHooks'
  2105. 460.93 s [Cabal] Missing documentation for:
  2106. 460.93 s [Cabal] Args (src/Distribution/Simple/UserHooks.hs:45)
  2107. 460.93 s [Cabal] 100% ( 2 / 2) in 'Distribution.Simple.Bench'
  2108. 460.94 s [Cabal] Warning: 'BuildInfo' is ambiguous. It is defined
  2109. 460.94 s [Cabal] * in ‘Distribution.Types.BuildInfo’
  2110. 460.94 s [Cabal] * in ‘Distribution.Types.BuildInfo’
  2111. 460.94 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  2112. 460.94 s [Cabal] by specifying the type/value namespace explicitly.
  2113. 460.94 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.BuildInfo’
  2114. 460.94 s [Cabal] Warning: 'LocalBuildInfo' is ambiguous. It is defined
  2115. 460.94 s [Cabal] * at src/Distribution/Types/LocalBuildInfo.hs:180:1
  2116. 460.94 s [Cabal] * at src/Distribution/Types/LocalBuildInfo.hs:129:1
  2117. 460.94 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  2118. 460.94 s [Cabal] by specifying the type/value namespace explicitly.
  2119. 460.94 s [Cabal] Defaulting to the one defined at src/Distribution/Types/LocalBuildInfo.hs:129:1
  2120. 460.94 s [Cabal] Warning: 'UserHooks' is out of scope.
  2121. 460.94 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2122. 460.94 s [Cabal] Warning: 'ConfigFlags' is ambiguous. It is defined
  2123. 460.94 s [Cabal] * at src/Distribution/Simple/Setup/Config.hs:78:20
  2124. 460.94 s [Cabal] * at src/Distribution/Simple/Setup/Config.hs:78:1
  2125. 460.94 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  2126. 460.94 s [Cabal] by specifying the type/value namespace explicitly.
  2127. 460.94 s [Cabal] Defaulting to the one defined at src/Distribution/Simple/Setup/Config.hs:78:1
  2128. 460.94 s [Cabal] Warning: 'Compiler' is ambiguous. It is defined
  2129. 460.94 s [Cabal] * at src/Distribution/Simple/Compiler.hs:91:17
  2130. 460.94 s [Cabal] * at src/Distribution/Simple/Compiler.hs:91:1
  2131. 460.94 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  2132. 460.94 s [Cabal] by specifying the type/value namespace explicitly.
  2133. 460.94 s [Cabal] Defaulting to the one defined at src/Distribution/Simple/Compiler.hs:91:1
  2134. 460.94 s [Cabal] 85% ( 23 / 27) in 'Distribution.Simple.Configure'
  2135. 460.94 s [Cabal] Missing documentation for:
  2136. 460.94 s [Cabal] configCompilerEx (src/Distribution/Simple/Configure.hs:2274)
  2137. 460.94 s [Cabal] configCompilerAuxEx (src/Distribution/Simple/Configure.hs:2258)
  2138. 460.94 s [Cabal] checkForeignDeps (src/Distribution/Simple/Configure.hs:2293)
  2139. 460.94 s [Cabal] platformDefines (src/Distribution/Simple/PreProcess.hs:720)
  2140. 460.94 s [Cabal] 100% ( 2 / 2) in 'Distribution.Simple.Test'
  2141. 460.95 s [Cabal] Warning: 'die' is out of scope.
  2142. 460.95 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2143. 460.95 s [Cabal] Warning: 'PackageDescription' is ambiguous. It is defined
  2144. 460.95 s [Cabal] * in ‘Distribution.Types.PackageDescription’
  2145. 460.95 s [Cabal] * in ‘Distribution.Types.PackageDescription’
  2146. 460.95 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  2147. 460.95 s [Cabal] by specifying the type/value namespace explicitly.
  2148. 460.95 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.PackageDescription’
  2149. 460.95 s [Cabal] Warning: 'errorPrefix' is out of scope.
  2150. 460.95 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2151. 460.95 s [Cabal] 100% ( 15 / 15) in 'Distribution.Simple.SrcDist'
  2152. 460.95 s [Cabal] Warning: 'LocalBuildInfo' is ambiguous. It is defined
  2153. 460.95 s [Cabal] * at src/Distribution/Types/LocalBuildInfo.hs:180:1
  2154. 460.95 s [Cabal] * at src/Distribution/Types/LocalBuildInfo.hs:129:1
  2155. 460.95 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  2156. 460.95 s [Cabal] by specifying the type/value namespace explicitly.
  2157. 460.95 s [Cabal] Defaulting to the one defined at src/Distribution/Types/LocalBuildInfo.hs:129:1
  2158. 460.95 s [Cabal] Warning: 'TestSuite' is ambiguous. It is defined
  2159. 460.95 s [Cabal] * in ‘Distribution.Types.TestSuite’
  2160. 460.95 s [Cabal] * in ‘Distribution.Types.TestSuite’
  2161. 460.95 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  2162. 460.95 s [Cabal] by specifying the type/value namespace explicitly.
  2163. 460.95 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.TestSuite’
  2164. 460.95 s [Cabal] Warning: 'Benchmark' is ambiguous. It is defined
  2165. 460.95 s [Cabal] * in ‘Distribution.Types.Benchmark’
  2166. 460.95 s [Cabal] * in ‘Distribution.Types.Benchmark’
  2167. 460.95 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  2168. 460.95 s [Cabal] by specifying the type/value namespace explicitly.
  2169. 460.95 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.Benchmark’
  2170. 460.95 s [Cabal] Warning: 'autogenComponentsModuleDir' is out of scope.
  2171. 460.95 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2172. 460.96 s [Cabal] 88% ( 15 / 17) in 'Distribution.Simple.Build'
  2173. 460.96 s [Cabal] Missing documentation for:
  2174. 460.96 s [Cabal] repl (src/Distribution/Simple/Build.hs:278)
  2175. 460.96 s [Cabal] AutogenFile (src/Distribution/Simple/Build.hs:1078)
  2176. 460.96 s [Cabal] Warning: 'haddocks' is out of scope.
  2177. 460.96 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2178. 460.96 s [Cabal] Warning: 'Haddock' is out of scope.
  2179. 460.96 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2180. 460.96 s [Cabal] Warning: 'HaddocksFlags' is out of scope.
  2181. 460.96 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2182. 460.96 s [Cabal] 66% ( 4 / 6) in 'Distribution.Simple.Haddock'
  2183. 460.96 s [Cabal] Missing documentation for:
  2184. 460.96 s [Cabal] haddock (src/Distribution/Simple/Haddock.hs:213)
  2185. 460.96 s [Cabal] hscolour (src/Distribution/Simple/Haddock.hs:1125)
  2186. 460.96 s [Cabal] Warning: 'UserHooks' is ambiguous. It is defined
  2187. 460.96 s [Cabal] * at src/Distribution/Simple/UserHooks.hs:53:18
  2188. 460.96 s [Cabal] * at src/Distribution/Simple/UserHooks.hs:53:1
  2189. 460.96 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  2190. 460.96 s [Cabal] by specifying the type/value namespace explicitly.
  2191. 460.96 s [Cabal] Defaulting to the one defined at src/Distribution/Simple/UserHooks.hs:53:1
  2192. 460.96 s [Cabal] 95% ( 20 / 21) in 'Distribution.Simple'
  2193. 460.96 s [Cabal] Missing documentation for:
  2194. 460.96 s [Cabal] Args (src/Distribution/Simple/UserHooks.hs:45)
  2195. 462.18 s [Cabal] Warning: Distribution.Backpack.FullUnitId: could not find link destinations for:
  2196. 462.18 s [Cabal] - Distribution.Backpack.FullUnitId.Rep_FullUnitId
  2197. 462.18 s [Cabal] Warning: Distribution.Backpack.ModuleShape: could not find link destinations for:
  2198. 462.18 s [Cabal] - Distribution.Utils.Structured.Tagged
  2199. 462.18 s [Cabal] - Distribution.Utils.Structured.structureHash'
  2200. 462.18 s [Cabal] - Distribution.Backpack.ModuleShape.Rep_ModuleShape
  2201. 462.18 s [Cabal] Warning: Distribution.Backpack.PreModuleShape: could not find link destinations for:
  2202. 462.18 s [Cabal] - Distribution.Backpack.PreModuleShape.Rep_PreModuleShape
  2203. 462.19 s [Cabal] Warning: Distribution.Compat.Stack: could not find link destinations for:
  2204. 462.19 s [Cabal] - GHC.Internal.IsList.D:R:ItemCallStack
  2205. 462.19 s [Cabal] Warning: Distribution.ReadE: could not find link destinations for:
  2206. 462.19 s [Cabal] - Distribution.ReadE.ErrorMsg
  2207. 462.19 s [Cabal] Warning: Distribution.Simple.Flag: could not find link destinations for:
  2208. 462.19 s [Cabal] - Distribution.Utils.Structured.Tagged
  2209. 462.19 s [Cabal] - Distribution.Utils.Structured.structureHash'
  2210. 462.19 s [Cabal] - Distribution.Simple.Flag.Rep_Flag
  2211. 462.19 s [Cabal] Warning: Distribution.Simple.InstallDirs.Internal: could not find link destinations for:
  2212. 462.19 s [Cabal] - Distribution.Utils.Structured.Tagged
  2213. 462.19 s [Cabal] - Distribution.Utils.Structured.structureHash'
  2214. 462.19 s [Cabal] - Distribution.Simple.InstallDirs.Internal.Rep_PathComponent
  2215. 462.19 s [Cabal] - Distribution.Simple.InstallDirs.Internal.Rep_PathTemplateVariable
  2216. 462.20 s [Cabal] Warning: Distribution.Simple.InstallDirs: could not find link destinations for:
  2217. 462.20 s [Cabal] - Distribution.Utils.Structured.Tagged
  2218. 462.20 s [Cabal] - Distribution.Utils.Structured.structureHash'
  2219. 462.20 s [Cabal] - Distribution.Simple.InstallDirs.Internal.Rep_PathTemplateVariable
  2220. 462.20 s [Cabal] - Distribution.Simple.InstallDirs.Rep_PathTemplate
  2221. 462.20 s [Cabal] - Distribution.Simple.InstallDirs.Rep_CopyDest
  2222. 462.20 s [Cabal] - Distribution.Simple.InstallDirs.Rep_InstallDirs
  2223. 462.21 s [Cabal] Warning: Distribution.Types.ComponentLocalBuildInfo: could not find link destinations for:
  2224. 462.21 s [Cabal] - Distribution.Utils.Structured.Tagged
  2225. 462.21 s [Cabal] - Distribution.Utils.Structured.structureHash'
  2226. 462.21 s [Cabal] - Distribution.Types.ComponentLocalBuildInfo.D:R:KeyComponentLocalBuildInfo
  2227. 462.21 s [Cabal] - Distribution.Types.ComponentLocalBuildInfo.Rep_ComponentLocalBuildInfo
  2228. 462.21 s [Cabal] Warning: Distribution.Types.DumpBuildInfo: could not find link destinations for:
  2229. 462.21 s [Cabal] - Distribution.Utils.Structured.Tagged
  2230. 462.21 s [Cabal] - Distribution.Utils.Structured.structureHash'
  2231. 462.21 s [Cabal] - Distribution.Types.DumpBuildInfo.Rep_DumpBuildInfo
  2232. 462.21 s [Cabal] Warning: Distribution.Types.GivenComponent: could not find link destinations for:
  2233. 462.21 s [Cabal] - Distribution.Utils.Structured.Tagged
  2234. 462.21 s [Cabal] - Distribution.Utils.Structured.structureHash'
  2235. 462.21 s [Cabal] - Distribution.Types.GivenComponent.Rep_GivenComponent
  2236. 462.21 s [Cabal] Warning: Distribution.Types.TargetInfo: could not find link destinations for:
  2237. 462.21 s [Cabal] - Distribution.Utils.Structured.Tagged
  2238. 462.21 s [Cabal] - Distribution.Utils.Structured.structureHash'
  2239. 462.21 s [Cabal] - Distribution.Types.TargetInfo.D:R:KeyTargetInfo
  2240. 462.21 s [Cabal] - Distribution.Types.TargetInfo.Rep_TargetInfo
  2241. 462.22 s [Cabal] Warning: Distribution.Verbosity.Internal: could not find link destinations for:
  2242. 462.22 s [Cabal] - Distribution.Utils.Structured.Tagged
  2243. 462.22 s [Cabal] - Distribution.Utils.Structured.structureHash'
  2244. 462.22 s [Cabal] - Distribution.Verbosity.Internal.Rep_VerbosityFlag
  2245. 462.22 s [Cabal] - Distribution.Verbosity.Internal.Rep_VerbosityLevel
  2246. 462.22 s [Cabal] Warning: Distribution.Verbosity: could not find link destinations for:
  2247. 462.22 s [Cabal] - Distribution.Utils.Structured.Tagged
  2248. 462.22 s [Cabal] - Distribution.Utils.Structured.structureHash'
  2249. 462.22 s [Cabal] - Distribution.Verbosity.Rep_Verbosity
  2250. 462.23 s [Cabal] Warning: Distribution.Simple.Program.Types: could not find link destinations for:
  2251. 462.23 s [Cabal] - Distribution.Utils.Structured.Tagged
  2252. 462.23 s [Cabal] - Distribution.Utils.Structured.structureHash'
  2253. 462.23 s [Cabal] - Distribution.Simple.Program.Types.Rep_ConfiguredProgram
  2254. 462.23 s [Cabal] - Distribution.Simple.Program.Types.Rep_ProgramLocation
  2255. 462.23 s [Cabal] - Distribution.Simple.Program.Types.Rep_ProgramSearchPathEntry
  2256. 462.23 s [Cabal] Warning: Distribution.Simple.PreProcess.Types: could not find link destinations for:
  2257. 462.23 s [Cabal] - Distribution.Utils.Structured.Tagged
  2258. 462.23 s [Cabal] - Distribution.Utils.Structured.structureHash'
  2259. 462.23 s [Cabal] - Distribution.Simple.PreProcess.Types.Rep_Suffix
  2260. 462.40 s [Cabal] Warning: Distribution.Simple.Utils: could not find link destinations for:
  2261. 462.40 s [Cabal] - Distribution.Simple.Utils.withMetadata
  2262. 462.40 s [Cabal] Warning: Distribution.Utils.NubList: could not find link destinations for:
  2263. 462.40 s [Cabal] - Distribution.Utils.Structured.Tagged
  2264. 462.40 s [Cabal] - Distribution.Utils.Structured.structureHash'
  2265. 462.40 s [Cabal] - Distribution.Utils.NubList.Rep_NubList
  2266. 462.40 s [Cabal] Warning: Distribution.Utils.LogProgress: could not find link destinations for:
  2267. 462.40 s [Cabal] - Distribution.Utils.LogProgress.CtxMsg
  2268. 462.41 s [Cabal] Warning: Distribution.Simple.Program.Find: could not find link destinations for:
  2269. 462.41 s [Cabal] - Distribution.Utils.Structured.Tagged
  2270. 462.41 s [Cabal] - Distribution.Utils.Structured.structureHash'
  2271. 462.41 s [Cabal] - Distribution.Simple.Program.Types.Rep_ProgramSearchPathEntry
  2272. 462.41 s [Cabal] - Distribution.Simple.Program.Find.findExecutable
  2273. 462.42 s [Cabal] Warning: Distribution.Simple.PackageIndex: could not find link destinations for:
  2274. 462.42 s [Cabal] - Distribution.Utils.Structured.Tagged
  2275. 462.42 s [Cabal] - Distribution.Utils.Structured.structureHash'
  2276. 462.42 s [Cabal] - Distribution.Simple.PackageIndex.DepUniqueKey
  2277. 462.42 s [Cabal] - Distribution.Simple.PackageIndex.Rep_PackageIndex
  2278. 462.42 s [Cabal] Warning: Distribution.Simple.Glob.Internal: could not find link destinations for:
  2279. 462.42 s [Cabal] - Distribution.Utils.Structured.Tagged
  2280. 462.43 s [Cabal] - Distribution.Utils.Structured.structureHash'
  2281. 462.43 s [Cabal] - Distribution.Simple.Glob.Internal.Rep_Glob
  2282. 462.43 s [Cabal] - Distribution.Simple.Glob.Internal.Rep_GlobPiece
  2283. 462.43 s [Cabal] Warning: Distribution.Simple.Glob: could not find link destinations for:
  2284. 462.43 s [Cabal] - Distribution.Utils.Structured.Tagged
  2285. 462.43 s [Cabal] - Distribution.Utils.Structured.structureHash'
  2286. 462.43 s [Cabal] - Distribution.Simple.Glob.Internal.Rep_Glob
  2287. 462.45 s [Cabal] Warning: Distribution.Simple.Compiler: could not find link destinations for:
  2288. 462.45 s [Cabal] - Distribution.Utils.Structured.Tagged
  2289. 462.45 s [Cabal] - Distribution.Utils.Structured.structureHash'
  2290. 462.45 s [Cabal] - Distribution.Simple.Compiler.Rep_ProfDetailLevel
  2291. 462.45 s [Cabal] - Distribution.Simple.Compiler.Rep_Compiler
  2292. 462.45 s [Cabal] - Distribution.Simple.Compiler.Rep_DebugInfoLevel
  2293. 462.45 s [Cabal] - Distribution.Simple.Compiler.Rep_OptimisationLevel
  2294. 462.45 s [Cabal] - Distribution.Simple.Compiler.Rep_PackageDB
  2295. 462.47 s [Cabal] Warning: Distribution.Simple.Program.GHC: could not find link destinations for:
  2296. 462.47 s [Cabal] - Distribution.Simple.Program.GHC.Rep_GhcOptions
  2297. 462.47 s [Cabal] Warning: Distribution.Simple.Program.Db: could not find link destinations for:
  2298. 462.47 s [Cabal] - Distribution.Utils.Structured.Tagged
  2299. 462.47 s [Cabal] - Distribution.Utils.Structured.structureHash'
  2300. 462.49 s [Cabal] Warning: Distribution.Simple.Program: could not find link destinations for:
  2301. 462.49 s [Cabal] - Distribution.Utils.Structured.Tagged
  2302. 462.49 s [Cabal] - Distribution.Utils.Structured.structureHash'
  2303. 462.49 s [Cabal] - Distribution.Simple.Program.Types.Rep_ConfiguredProgram
  2304. 462.49 s [Cabal] - Distribution.Simple.Program.Types.Rep_ProgramLocation
  2305. 462.49 s [Cabal] - Distribution.Simple.Program.Types.Rep_ProgramSearchPathEntry
  2306. 462.53 s [Cabal] Warning: Distribution.Types.LocalBuildConfig: could not find link destinations for:
  2307. 462.53 s [Cabal] - Distribution.Utils.Structured.Tagged
  2308. 462.53 s [Cabal] - Distribution.Utils.Structured.structureHash'
  2309. 462.53 s [Cabal] - Distribution.Types.LocalBuildConfig.Rep_LocalBuildConfig
  2310. 462.53 s [Cabal] - Distribution.Types.LocalBuildConfig.Rep_BuildOptions
  2311. 462.53 s [Cabal] - Distribution.Types.LocalBuildConfig.Rep_LocalBuildDescr
  2312. 462.53 s [Cabal] - Distribution.Types.LocalBuildConfig.Rep_ComponentBuildDescr
  2313. 462.53 s [Cabal] - Distribution.Types.LocalBuildConfig.Rep_PackageBuildDescr
  2314. 462.54 s [Cabal] Warning: Distribution.Types.LocalBuildInfo: could not find link destinations for:
  2315. 462.54 s [Cabal] - Distribution.Utils.Structured.Tagged
  2316. 462.54 s [Cabal] - Distribution.Utils.Structured.structureHash'
  2317. 462.54 s [Cabal] - Distribution.Types.LocalBuildInfo.Rep_LocalBuildInfo
  2318. 462.57 s [Cabal] Warning: Distribution.Simple.LocalBuildInfo: could not find link destinations for:
  2319. 462.57 s [Cabal] - Distribution.Utils.Structured.Tagged
  2320. 462.57 s [Cabal] - Distribution.Utils.Structured.structureHash'
  2321. 462.57 s [Cabal] - Distribution.Types.LibraryName.Rep_LibraryName
  2322. 462.57 s [Cabal] - Distribution.Types.ComponentName.NotLibComponentName
  2323. 462.57 s [Cabal] - Distribution.Types.ComponentName.Rep_ComponentName
  2324. 462.57 s [Cabal] - Distribution.Simple.InstallDirs.Internal.Rep_PathTemplateVariable
  2325. 462.57 s [Cabal] - Distribution.Simple.InstallDirs.Rep_PathTemplate
  2326. 462.57 s [Cabal] - Distribution.Simple.InstallDirs.Rep_CopyDest
  2327. 462.57 s [Cabal] - Distribution.Simple.InstallDirs.Rep_InstallDirs
  2328. 462.57 s [Cabal] - Distribution.Types.ComponentLocalBuildInfo.D:R:KeyComponentLocalBuildInfo
  2329. 462.57 s [Cabal] - Distribution.Types.ComponentLocalBuildInfo.Rep_ComponentLocalBuildInfo
  2330. 462.57 s [Cabal] - Distribution.Types.Component.Rep_Component
  2331. 462.57 s [Cabal] - Distribution.Types.LocalBuildInfo.Rep_LocalBuildInfo
  2332. 462.63 s [Cabal] Warning: Distribution.Simple.Setup: could not find link destinations for:
  2333. 462.63 s [Cabal] - Distribution.Utils.Structured.Tagged
  2334. 462.63 s [Cabal] - Distribution.Utils.Structured.structureHash'
  2335. 462.63 s [Cabal] - Distribution.Simple.Flag.Rep_Flag
  2336. 462.63 s [Cabal] - Distribution.Simple.InstallDirs.Rep_CopyDest
  2337. 462.63 s [Cabal] - Distribution.Types.DumpBuildInfo.Rep_DumpBuildInfo
  2338. 462.63 s [Cabal] - Distribution.Simple.Setup.Common.programDbPaths
  2339. 462.63 s [Cabal] - Distribution.Simple.Setup.Test.Rep_TestFlags
  2340. 462.63 s [Cabal] - Distribution.Simple.Setup.Test.Rep_TestShowDetails
  2341. 462.63 s [Cabal] - Distribution.Simple.Setup.SDist.Rep_SDistFlags
  2342. 462.63 s [Cabal] - Distribution.Simple.Setup.Repl.Rep_ReplFlags
  2343. 462.63 s [Cabal] - Distribution.Simple.Setup.Repl.Rep_ReplOptions
  2344. 462.63 s [Cabal] - Distribution.Simple.Setup.Register.Rep_RegisterFlags
  2345. 462.63 s [Cabal] - Distribution.Simple.Setup.Install.Rep_InstallFlags
  2346. 462.63 s [Cabal] - Distribution.Simple.Setup.Hscolour.Rep_HscolourFlags
  2347. 462.63 s [Cabal] - Distribution.Simple.Setup.Haddock.Rep_HaddockProjectFlags
  2348. 462.63 s [Cabal] - Distribution.Simple.Setup.Haddock.Rep_HaddockFlags
  2349. 462.63 s [Cabal] - Distribution.Simple.Setup.Haddock.Rep_HaddockTarget
  2350. 462.63 s [Cabal] - Distribution.Simple.Setup.Global.Rep_GlobalFlags
  2351. 462.63 s [Cabal] - Distribution.Simple.Setup.Copy.Rep_CopyFlags
  2352. 462.63 s [Cabal] - Distribution.Simple.Setup.Config.Rep_ConfigFlags
  2353. 462.63 s [Cabal] - Distribution.Simple.Setup.Clean.Rep_CleanFlags
  2354. 462.63 s [Cabal] - Distribution.Simple.Setup.Build.Rep_BuildFlags
  2355. 462.63 s [Cabal] - Distribution.Simple.Setup.Benchmark.Rep_BenchmarkFlags
  2356. 462.63 s [Cabal] - Distribution.Simple.Setup.Rep_BuildingWhat
  2357. 462.64 s [Cabal] Warning: Distribution.Simple.Build.Inputs: could not find link destinations for:
  2358. 462.64 s [Cabal] - Distribution.Utils.Structured.Tagged
  2359. 462.64 s [Cabal] - Distribution.Utils.Structured.structureHash'
  2360. 462.64 s [Cabal] - Distribution.Types.TargetInfo.D:R:KeyTargetInfo
  2361. 462.64 s [Cabal] - Distribution.Types.TargetInfo.Rep_TargetInfo
  2362. 462.64 s [Cabal] - Distribution.Types.LocalBuildInfo.Rep_LocalBuildInfo
  2363. 462.64 s [Cabal] - Distribution.Simple.Setup.Rep_BuildingWhat
  2364. 462.64 s [Cabal] Warning: Distribution.Simple.BuildTarget: could not find link destinations for:
  2365. 462.64 s [Cabal] - Distribution.Simple.BuildTarget.Rep_BuildTarget
  2366. 462.68 s [Cabal] Warning: Distribution.PackageDescription.Check: could not find link destinations for:
  2367. 462.68 s [Cabal] - Distribution.PackageDescription.Check.Warning.WarnLang
  2368. 462.68 s [Cabal] - Distribution.PackageDescription.Check.Warning.CEType
  2369. 462.68 s [Cabal] Warning: Distribution.Make: could not find link destinations for:
  2370. 462.68 s [Cabal] - Distribution.Types.InstalledPackageInfo.FieldGrammar.SpecLicenseLenient
  2371. 462.68 s [Cabal] - Distribution.Types.Version.Rep_Version
  2372. 462.68 s [Cabal] - Distribution.Utils.Structured.Tagged
  2373. 462.68 s [Cabal] - Distribution.Utils.Structured.structureHash'
  2374. 462.68 s [Cabal] - Distribution.License.Rep_License
  2375. 462.68 s [Cabal] Warning: Distribution.Compat.Time: could not find link destinations for:
  2376. 462.68 s [Cabal] - Distribution.Utils.Structured.Tagged
  2377. 462.68 s [Cabal] - Distribution.Utils.Structured.structureHash'
  2378. 462.68 s [Cabal] - Distribution.Compat.Time.Rep_ModTime
  2379. 462.69 s [Cabal] Warning: Distribution.Backpack.Configure: could not find link destinations for:
  2380. 462.69 s [Cabal] - Distribution.Backpack.PreExistingComponent.PreExistingComponent
  2381. 462.69 s [Cabal] - Distribution.Backpack.PreExistingComponent.PromisedComponent
  2382. 462.69 s [Cabal] Warning: Distribution.Simple.PreProcess: could not find link destinations for:
  2383. 462.69 s [Cabal] - Distribution.Utils.Structured.Tagged
  2384. 462.69 s [Cabal] - Distribution.Utils.Structured.structureHash'
  2385. 462.69 s [Cabal] - Distribution.Simple.PreProcess.Types.Rep_Suffix
  2386. 476.55 s [Cabal] Documentation created: dist/doc/html/Cabal/, dist/doc/html/Cabal/Cabal.txt
  2387. 476.65 s [Cabal] haddockPhase completed in 43 seconds
  2388. 476.65 s [Cabal] Phase: installPhase
  2389. 476.81 s [Cabal] Installing library in /nix/store/na0m63ls6daw8iirfn81fr5z72c2333q-Cabal-3.12.1.0/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-1e2a/Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt
  2390. 480.84 s [Cabal] Phase: fixupPhase
  2391. 480.87 s [Cabal] shrinking RPATHs of ELF executables and libraries in /nix/store/na0m63ls6daw8iirfn81fr5z72c2333q-Cabal-3.12.1.0
  2392. 480.88 s [Cabal] shrinking /nix/store/na0m63ls6daw8iirfn81fr5z72c2333q-Cabal-3.12.1.0/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-1e2a/libHSCabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt-ghc9.10.2.so
  2393. 481.03 s [Cabal] checking for references to /build/ in /nix/store/na0m63ls6daw8iirfn81fr5z72c2333q-Cabal-3.12.1.0...
  2394. 481.19 s [Cabal] patching script interpreter paths in /nix/store/na0m63ls6daw8iirfn81fr5z72c2333q-Cabal-3.12.1.0
  2395. 481.20 s [Cabal] stripping (with command strip and flags -S -p) in /nix/store/na0m63ls6daw8iirfn81fr5z72c2333q-Cabal-3.12.1.0/lib
  2396. 483.31 s [Cabal] shrinking RPATHs of ELF executables and libraries in /nix/store/s7ffg172jj99gyhhv10ydsm2j0lrhddy-Cabal-3.12.1.0-doc
  2397. 483.37 s [Cabal] checking for references to /build/ in /nix/store/s7ffg172jj99gyhhv10ydsm2j0lrhddy-Cabal-3.12.1.0-doc...
  2398. 483.46 s [Cabal] patching script interpreter paths in /nix/store/s7ffg172jj99gyhhv10ydsm2j0lrhddy-Cabal-3.12.1.0-doc
  2399. 483.97 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/na0m63ls6daw8iirfn81fr5z72c2333q-Cabal-3.12.1.0 /nix/store/s7ffg172jj99gyhhv10ydsm2j0lrhddy-Cabal-3.12.1.0-doc
  2400. 484.50 s [post-build-hook] Pushing 2 paths (72 are already present) using zstd to cache sellout ⏳
  2401. 484.50 s [post-build-hook]
  2402. 485.02 s [post-build-hook] Pushing /nix/store/na0m63ls6daw8iirfn81fr5z72c2333q-Cabal-3.12.1.0 (125.14 MiB)
  2403. 485.03 s [post-build-hook] Pushing /nix/store/s7ffg172jj99gyhhv10ydsm2j0lrhddy-Cabal-3.12.1.0-doc (33.50 MiB)
  2404. 487.36 s [post-build-hook]
  2405. 487.36 s [post-build-hook] All done.
  2406. 487.39 s [post-build-hook] Uploading to the NixCI cache: /nix/store/na0m63ls6daw8iirfn81fr5z72c2333q-Cabal-3.12.1.0 /nix/store/s7ffg172jj99gyhhv10ydsm2j0lrhddy-Cabal-3.12.1.0-doc
  2407. 487.44 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2408. 487.61 s [post-build-hook] copying 2 paths...
  2409. 487.61 s [post-build-hook] copying path '/nix/store/s7ffg172jj99gyhhv10ydsm2j0lrhddy-Cabal-3.12.1.0-doc' to 'https://cache.nix-ci.com'...
  2410. 492.99 s [post-build-hook] copying path '/nix/store/na0m63ls6daw8iirfn81fr5z72c2333q-Cabal-3.12.1.0' to 'https://cache.nix-ci.com'...
  2411. 527.92 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2412. 528.10 s [post-build-hook] copying 1 paths...
  2413. 528.16 s [post-build-hook] copying path '/nix/store/0dhgcqn82vpi0gv5jg4b8lgfp69px1x4-Cabal-3.12.1.0.drv' to 'https://cache.nix-ci.com'...
  2414. 528.25 s Progress: 2 of 22 built, 177 of 177 downloaded from cache
  2415. 528.29 s Building cabal-doctest
  2416. 528.32 s Building ghc-paths
  2417. 528.37 s [cabal-doctest] Phase: setupCompilerEnvironmentPhase
  2418. 528.37 s [cabal-doctest] Build with /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2.
  2419. 528.40 s [ghc-paths] Phase: setupCompilerEnvironmentPhase
  2420. 528.40 s [ghc-paths] Build with /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2.
  2421. 528.51 s [cabal-doctest] Phase: unpackPhase
  2422. 528.52 s [cabal-doctest] unpacking source archive /nix/store/ckph819l8a613hapx2pwbjv3yzi8gm3k-cabal-doctest-1.0.12.tar.gz
  2423. 528.52 s [cabal-doctest] source root is cabal-doctest-1.0.12
  2424. 528.53 s [cabal-doctest] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "cabal-doctest-1.0.12/src/Distribution/Extra/Doctest.hs"
  2425. 528.54 s [cabal-doctest] Phase: patchPhase
  2426. 528.54 s [ghc-paths] Phase: unpackPhase
  2427. 528.55 s [cabal-doctest] Phase: compileBuildDriverPhase
  2428. 528.55 s [ghc-paths] unpacking source archive /nix/store/jbdk3r2ic959xyc0394gn6n61wgjf6n0-ghc-paths-0.1.0.12.tar.gz
  2429. 528.55 s [cabal-doctest] setupCompileFlags: -package-db=/build/tmp.wyPXiTuPjY/setup-package.conf.d -threaded
  2430. 528.55 s [ghc-paths] source root is ghc-paths-0.1.0.12
  2431. 528.56 s [ghc-paths] setting SOURCE_DATE_EPOCH to timestamp 1566388706 of file "ghc-paths-0.1.0.12/Setup.hs"
  2432. 528.56 s [ghc-paths] Phase: patchPhase
  2433. 528.57 s [ghc-paths] Replace Cabal file with edited version from mirror://hackage/ghc-paths-0.1.0.12/revision/8.cabal.
  2434. 528.57 s [ghc-paths] applying patch /nix/store/57w4xa43g7ilkdjd7mplrn8l3pvmyklf-ghc-paths-nix.patch
  2435. 528.57 s [ghc-paths] patching file GHC/Paths.hs
  2436. 528.58 s [ghc-paths] Phase: compileBuildDriverPhase
  2437. 528.58 s [ghc-paths] setupCompileFlags: -package-db=/build/tmp.3YTHbv0Chk/setup-package.conf.d -threaded
  2438. 528.61 s [cabal-doctest] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.wyPXiTuPjY/Main.o )
  2439. 528.66 s [ghc-paths] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.3YTHbv0Chk/Main.o )
  2440. 528.66 s [cabal-doctest] [2 of 2] Linking Setup
  2441. 528.89 s [ghc-paths] [2 of 2] Linking Setup
  2442. 530.01 s [cabal-doctest] Phase: updateAutotoolsGnuConfigScriptsPhase
  2443. 530.02 s [cabal-doctest] Phase: configurePhase
  2444. 530.03 s [cabal-doctest] configureFlags: --verbose --prefix=/nix/store/jqaj1q4vgmbd2x8w70z3mki4b9wii8q9-cabal-doctest-1.0.12 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/763l1xc96d7gxbmz5kwx3z48yivhzzhn-cabal-doctest-1.0.12-doc/share/doc/cabal-doctest-1.0.12 --with-gcc=gcc --package-db=/build/tmp.wyPXiTuPjY/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
  2445. 530.03 s [cabal-doctest] Using Parsec parser
  2446. 530.03 s [cabal-doctest] Configuring cabal-doctest-1.0.12...
  2447. 530.23 s [ghc-paths] Phase: updateAutotoolsGnuConfigScriptsPhase
  2448. 530.24 s [ghc-paths] Phase: configurePhase
  2449. 530.24 s [ghc-paths] configureFlags: --verbose --prefix=/nix/store/qbc6n9xcfhin2gvkj1lbzrhd5q4bd5s9-ghc-paths-0.1.0.12 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/6qfqcsp44y2aicwbbpmvcgdni7q7p5zb-ghc-paths-0.1.0.12-doc/share/doc/ghc-paths-0.1.0.12 --with-gcc=gcc --package-db=/build/tmp.3YTHbv0Chk/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
  2450. 530.25 s [ghc-paths] Using Parsec parser
  2451. 530.25 s [ghc-paths] Configuring ghc-paths-0.1.0.12...
  2452. 530.56 s [cabal-doctest] Dependency Cabal >=1.24 && <3.16: using Cabal-3.12.1.0
  2453. 530.56 s [cabal-doctest] Dependency base >=4.9 && <5: using base-4.20.1.0
  2454. 530.56 s [cabal-doctest] Dependency directory >=1.3 && <2: using directory-1.3.8.5
  2455. 530.56 s [cabal-doctest] Dependency filepath >=1.4 && <2: using filepath-1.5.4.0
  2456. 530.56 s [cabal-doctest] Source component graph: component lib
  2457. 530.56 s [cabal-doctest] Configured component graph:
  2458. 530.56 s [cabal-doctest] component cabal-doctest-1.0.12-Jwvc96ehpDX2sbU9yjsKFV
  2459. 530.56 s [cabal-doctest] include Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt
  2460. 530.56 s [cabal-doctest] include base-4.20.1.0-2277
  2461. 530.56 s [cabal-doctest] include directory-1.3.8.5-ad1a
  2462. 530.57 s [cabal-doctest] include filepath-1.5.4.0-590e
  2463. 530.57 s [cabal-doctest] Linked component graph:
  2464. 530.57 s [cabal-doctest] unit cabal-doctest-1.0.12-Jwvc96ehpDX2sbU9yjsKFV
  2465. 530.57 s [cabal-doctest] include Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt
  2466. 530.57 s [cabal-doctest] include base-4.20.1.0-2277
  2467. 530.57 s [cabal-doctest] include directory-1.3.8.5-ad1a
  2468. 530.57 s [cabal-doctest] include filepath-1.5.4.0-590e
  2469. 530.57 s [cabal-doctest] Distribution.Extra.Doctest=cabal-doctest-1.0.12-Jwvc96ehpDX2sbU9yjsKFV:Distribution.Extra.Doctest
  2470. 530.57 s [cabal-doctest] Ready component graph:
  2471. 530.57 s [cabal-doctest] definite cabal-doctest-1.0.12-Jwvc96ehpDX2sbU9yjsKFV
  2472. 530.57 s [cabal-doctest] depends Cabal-3.12.1.0-IO1n2irVWgBkKktYJRcmt
  2473. 530.57 s [cabal-doctest] depends base-4.20.1.0-2277
  2474. 530.57 s [cabal-doctest] depends directory-1.3.8.5-ad1a
  2475. 530.57 s [cabal-doctest] depends filepath-1.5.4.0-590e
  2476. 530.57 s [cabal-doctest] Using Cabal-3.12.1.0 compiled by ghc-9.10
  2477. 530.57 s [cabal-doctest] Using compiler: ghc-9.10.2
  2478. 530.57 s [cabal-doctest] Using install prefix:
  2479. 530.57 s [cabal-doctest] /nix/store/jqaj1q4vgmbd2x8w70z3mki4b9wii8q9-cabal-doctest-1.0.12
  2480. 530.57 s [cabal-doctest] Executables installed in:
  2481. 530.57 s [cabal-doctest] /nix/store/jqaj1q4vgmbd2x8w70z3mki4b9wii8q9-cabal-doctest-1.0.12/bin
  2482. 530.57 s [cabal-doctest] Libraries installed in:
  2483. 530.57 s [cabal-doctest] /nix/store/jqaj1q4vgmbd2x8w70z3mki4b9wii8q9-cabal-doctest-1.0.12/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-1e2a/cabal-doctest-1.0.12-Jwvc96ehpDX2sbU9yjsKFV
  2484. 530.57 s [cabal-doctest] Dynamic Libraries installed in:
  2485. 530.57 s [cabal-doctest] /nix/store/jqaj1q4vgmbd2x8w70z3mki4b9wii8q9-cabal-doctest-1.0.12/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-1e2a
  2486. 530.57 s [cabal-doctest] Private executables installed in:
  2487. 530.57 s [cabal-doctest] /nix/store/jqaj1q4vgmbd2x8w70z3mki4b9wii8q9-cabal-doctest-1.0.12/libexec/x86_64-linux-ghc-9.10.2-1e2a/cabal-doctest-1.0.12
  2488. 530.57 s [cabal-doctest] Data files installed in:
  2489. 530.57 s [cabal-doctest] /nix/store/jqaj1q4vgmbd2x8w70z3mki4b9wii8q9-cabal-doctest-1.0.12/share/x86_64-linux-ghc-9.10.2-1e2a/cabal-doctest-1.0.12
  2490. 530.57 s [cabal-doctest] Documentation installed in:
  2491. 530.57 s [cabal-doctest] /nix/store/763l1xc96d7gxbmz5kwx3z48yivhzzhn-cabal-doctest-1.0.12-doc/share/doc/cabal-doctest-1.0.12
  2492. 530.57 s [cabal-doctest] Configuration files installed in:
  2493. 530.57 s [cabal-doctest] /nix/store/jqaj1q4vgmbd2x8w70z3mki4b9wii8q9-cabal-doctest-1.0.12/etc
  2494. 530.57 s [cabal-doctest] No alex found
  2495. 530.57 s [cabal-doctest] Using ar found on system at:
  2496. 530.57 s [cabal-doctest] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
  2497. 530.57 s [cabal-doctest] No c2hs found
  2498. 530.57 s [cabal-doctest] No cpphs found
  2499. 530.57 s [cabal-doctest] No doctest found
  2500. 530.57 s [cabal-doctest] Using gcc version 14.3.0 given by user at:
  2501. 530.57 s [cabal-doctest] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
  2502. 530.57 s [cabal-doctest] Using ghc version 9.10.2 found on system at:
  2503. 530.57 s [cabal-doctest] /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/bin/ghc
  2504. 530.57 s [cabal-doctest] Using ghc-pkg version 9.10.2 found on system at:
  2505. 530.57 s [cabal-doctest] /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/bin/ghc-pkg-9.10.2
  2506. 530.57 s [cabal-doctest] No ghcjs found
  2507. 530.57 s [cabal-doctest] No ghcjs-pkg found
  2508. 530.57 s [cabal-doctest] No greencard found
  2509. 530.57 s [cabal-doctest] Using haddock version 2.31.0 found on system at:
  2510. 530.57 s [cabal-doctest] /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/bin/haddock-ghc-9.10.2
  2511. 530.57 s [cabal-doctest] No happy found
  2512. 530.57 s [cabal-doctest] Using haskell-suite found on system at: haskell-suite-dummy-location
  2513. 530.57 s [cabal-doctest] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  2514. 530.57 s [cabal-doctest] No hmake found
  2515. 530.57 s [cabal-doctest] Using hpc version 0.69 found on system at:
  2516. 530.57 s [cabal-doctest] /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/bin/hpc-ghc-9.10.2
  2517. 530.57 s [cabal-doctest] Using hsc2hs version 0.68.10 found on system at:
  2518. 530.57 s [cabal-doctest] /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/bin/hsc2hs-ghc-9.10.2
  2519. 530.57 s [cabal-doctest] Using hscolour version 1.25 found on system at:
  2520. 530.57 s [cabal-doctest] /nix/store/kb4afndnwdxxc5ps9k8xv0jzd0a9y8n5-hscolour-1.25/bin/HsColour
  2521. 530.57 s [cabal-doctest] No jhc found
  2522. 530.57 s [cabal-doctest] Using ld found on system at:
  2523. 530.57 s [cabal-doctest] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/ld
  2524. 530.57 s [cabal-doctest] No pkg-config found
  2525. 530.57 s [cabal-doctest] Using runghc version 9.10.2 found on system at:
  2526. 530.57 s [cabal-doctest] /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/bin/runghc-9.10.2
  2527. 530.57 s [cabal-doctest] Using strip version 2.44 found on system at:
  2528. 530.57 s [cabal-doctest] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
  2529. 530.57 s [cabal-doctest] Using tar found on system at:
  2530. 530.57 s [cabal-doctest] /nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
  2531. 530.57 s [cabal-doctest] No uhc found
  2532. 530.68 s [cabal-doctest] Phase: buildPhase
  2533. 530.73 s [cabal-doctest] Preprocessing library for cabal-doctest-1.0.12...
  2534. 530.74 s [cabal-doctest] Building library for cabal-doctest-1.0.12...
  2535. 530.76 s [ghc-paths] Dependency base >=3 && <5: using base-4.20.1.0
  2536. 530.76 s [ghc-paths] Source component graph: component lib
  2537. 530.76 s [ghc-paths] Configured component graph:
  2538. 530.76 s [ghc-paths] component ghc-paths-0.1.0.12-BTxxrzk1njL3kUH7q72lnB
  2539. 530.76 s [ghc-paths] include base-4.20.1.0-2277
  2540. 530.76 s [ghc-paths] Linked component graph:
  2541. 530.76 s [ghc-paths] unit ghc-paths-0.1.0.12-BTxxrzk1njL3kUH7q72lnB
  2542. 530.76 s [ghc-paths] include base-4.20.1.0-2277
  2543. 530.76 s [ghc-paths] GHC.Paths=ghc-paths-0.1.0.12-BTxxrzk1njL3kUH7q72lnB:GHC.Paths
  2544. 530.76 s [ghc-paths] Ready component graph:
  2545. 530.76 s [ghc-paths] definite ghc-paths-0.1.0.12-BTxxrzk1njL3kUH7q72lnB
  2546. 530.76 s [ghc-paths] depends base-4.20.1.0-2277
  2547. 530.76 s [ghc-paths] Using Cabal-3.12.1.0 compiled by ghc-9.10
  2548. 530.76 s [ghc-paths] Using compiler: ghc-9.10.2
  2549. 530.76 s [ghc-paths] Using install prefix:
  2550. 530.76 s [ghc-paths] /nix/store/qbc6n9xcfhin2gvkj1lbzrhd5q4bd5s9-ghc-paths-0.1.0.12
  2551. 530.76 s [ghc-paths] Executables installed in:
  2552. 530.76 s [ghc-paths] /nix/store/qbc6n9xcfhin2gvkj1lbzrhd5q4bd5s9-ghc-paths-0.1.0.12/bin
  2553. 530.76 s [ghc-paths] Libraries installed in:
  2554. 530.76 s [ghc-paths] /nix/store/qbc6n9xcfhin2gvkj1lbzrhd5q4bd5s9-ghc-paths-0.1.0.12/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-1e2a/ghc-paths-0.1.0.12-BTxxrzk1njL3kUH7q72lnB
  2555. 530.76 s [ghc-paths] Dynamic Libraries installed in:
  2556. 530.76 s [ghc-paths] /nix/store/qbc6n9xcfhin2gvkj1lbzrhd5q4bd5s9-ghc-paths-0.1.0.12/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-1e2a
  2557. 530.76 s [ghc-paths] Private executables installed in:
  2558. 530.76 s [ghc-paths] /nix/store/qbc6n9xcfhin2gvkj1lbzrhd5q4bd5s9-ghc-paths-0.1.0.12/libexec/x86_64-linux-ghc-9.10.2-1e2a/ghc-paths-0.1.0.12
  2559. 530.76 s [ghc-paths] Data files installed in:
  2560. 530.76 s [ghc-paths] /nix/store/qbc6n9xcfhin2gvkj1lbzrhd5q4bd5s9-ghc-paths-0.1.0.12/share/x86_64-linux-ghc-9.10.2-1e2a/ghc-paths-0.1.0.12
  2561. 530.76 s [ghc-paths] Documentation installed in:
  2562. 530.76 s [ghc-paths] /nix/store/6qfqcsp44y2aicwbbpmvcgdni7q7p5zb-ghc-paths-0.1.0.12-doc/share/doc/ghc-paths-0.1.0.12
  2563. 530.76 s [ghc-paths] Configuration files installed in:
  2564. 530.76 s [ghc-paths] /nix/store/qbc6n9xcfhin2gvkj1lbzrhd5q4bd5s9-ghc-paths-0.1.0.12/etc
  2565. 530.76 s [ghc-paths] No alex found
  2566. 530.76 s [ghc-paths] Using ar found on system at:
  2567. 530.76 s [ghc-paths] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
  2568. 530.76 s [ghc-paths] No c2hs found
  2569. 530.76 s [ghc-paths] No cpphs found
  2570. 530.76 s [ghc-paths] No doctest found
  2571. 530.76 s [ghc-paths] Using gcc version 14.3.0 given by user at:
  2572. 530.76 s [ghc-paths] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
  2573. 530.76 s [ghc-paths] Using ghc version 9.10.2 found on system at:
  2574. 530.76 s [ghc-paths] /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/bin/ghc
  2575. 530.76 s [ghc-paths] Using ghc-pkg version 9.10.2 found on system at:
  2576. 530.76 s [ghc-paths] /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/bin/ghc-pkg-9.10.2
  2577. 530.76 s [ghc-paths] No ghcjs found
  2578. 530.76 s [ghc-paths] No ghcjs-pkg found
  2579. 530.76 s [ghc-paths] No greencard found
  2580. 530.76 s [ghc-paths] Using haddock version 2.31.0 found on system at:
  2581. 530.76 s [ghc-paths] /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/bin/haddock-ghc-9.10.2
  2582. 530.76 s [ghc-paths] No happy found
  2583. 530.76 s [ghc-paths] Using haskell-suite found on system at: haskell-suite-dummy-location
  2584. 530.76 s [ghc-paths] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  2585. 530.76 s [ghc-paths] No hmake found
  2586. 530.76 s [ghc-paths] Using hpc version 0.69 found on system at:
  2587. 530.76 s [ghc-paths] /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/bin/hpc-ghc-9.10.2
  2588. 530.76 s [ghc-paths] Using hsc2hs version 0.68.10 found on system at:
  2589. 530.76 s [ghc-paths] /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/bin/hsc2hs-ghc-9.10.2
  2590. 530.76 s [ghc-paths] Using hscolour version 1.25 found on system at:
  2591. 530.76 s [ghc-paths] /nix/store/kb4afndnwdxxc5ps9k8xv0jzd0a9y8n5-hscolour-1.25/bin/HsColour
  2592. 530.76 s [ghc-paths] No jhc found
  2593. 530.76 s [ghc-paths] Using ld found on system at:
  2594. 530.76 s [ghc-paths] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/ld
  2595. 530.76 s [ghc-paths] No pkg-config found
  2596. 530.77 s [ghc-paths] Using runghc version 9.10.2 found on system at:
  2597. 530.77 s [ghc-paths] /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/bin/runghc-9.10.2
  2598. 530.77 s [ghc-paths] Using strip version 2.44 found on system at:
  2599. 530.77 s [ghc-paths] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
  2600. 530.77 s [ghc-paths] Using tar found on system at:
  2601. 530.77 s [ghc-paths] /nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
  2602. 530.77 s [ghc-paths] No uhc found
  2603. 530.77 s [ghc-paths] Running: /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/bin/ghc --print-libdir -j16 '+RTS' -A64M -RTS -haddock
  2604. 530.81 s [ghc-paths] Phase: buildPhase
  2605. 530.82 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 )
  2606. 530.86 s [ghc-paths] Preprocessing library for ghc-paths-0.1.0.12...
  2607. 530.86 s [ghc-paths] Building library for ghc-paths-0.1.0.12...
  2608. 530.93 s [ghc-paths] [1 of 1] Compiling GHC.Paths ( GHC/Paths.hs, dist/build/GHC/Paths.o, dist/build/GHC/Paths.dyn_o )
  2609. 531.16 s [ghc-paths] [1 of 1] Compiling GHC.Paths ( GHC/Paths.hs, dist/build/GHC/Paths.p_o )
  2610. 531.98 s [ghc-paths] Phase: checkPhase
  2611. 532.00 s [ghc-paths] Package has no test suites.
  2612. 532.00 s [ghc-paths] Phase: haddockPhase
  2613. 532.11 s [ghc-paths] Preprocessing library for ghc-paths-0.1.0.12...
  2614. 532.11 s [ghc-paths] Running Haddock on library for ghc-paths-0.1.0.12...
  2615. 532.22 s [cabal-doctest] [1 of 1] Compiling Distribution.Extra.Doctest ( src/Distribution/Extra/Doctest.hs, dist/build/Distribution/Extra/Doctest.p_o )
  2616. 532.26 s [ghc-paths] [1 of 1] Compiling GHC.Paths ( GHC/Paths.hs, nothing )
  2617. 532.31 s [ghc-paths] Haddock coverage:
  2618. 532.31 s [ghc-paths] 0% ( 0 / 5) in 'GHC.Paths'
  2619. 532.31 s [ghc-paths] Missing documentation for:
  2620. 532.31 s [ghc-paths] Module header
  2621. 532.31 s [ghc-paths] ghc (GHC/Paths.hs:34)
  2622. 532.31 s [ghc-paths] ghc_pkg (GHC/Paths.hs:35)
  2623. 532.31 s [ghc-paths] libdir (GHC/Paths.hs:31)
  2624. 532.31 s [ghc-paths] docdir (GHC/Paths.hs:32)
  2625. 535.18 s [ghc-paths] Documentation created: dist/doc/html/ghc-paths/,
  2626. 535.22 s [ghc-paths] dist/doc/html/ghc-paths/ghc-paths.txt
  2627. 535.25 s [ghc-paths] Phase: installPhase
  2628. 535.28 s [ghc-paths] Installing library in /nix/store/qbc6n9xcfhin2gvkj1lbzrhd5q4bd5s9-ghc-paths-0.1.0.12/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-1e2a/ghc-paths-0.1.0.12-BTxxrzk1njL3kUH7q72lnB
  2629. 535.31 s [cabal-doctest] Phase: checkPhase
  2630. 535.33 s [cabal-doctest] Package has no test suites.
  2631. 535.34 s [cabal-doctest] Phase: haddockPhase
  2632. 535.40 s [ghc-paths] Phase: fixupPhase
  2633. 535.42 s [ghc-paths] shrinking RPATHs of ELF executables and libraries in /nix/store/qbc6n9xcfhin2gvkj1lbzrhd5q4bd5s9-ghc-paths-0.1.0.12
  2634. 535.42 s [ghc-paths] shrinking /nix/store/qbc6n9xcfhin2gvkj1lbzrhd5q4bd5s9-ghc-paths-0.1.0.12/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-1e2a/libHSghc-paths-0.1.0.12-BTxxrzk1njL3kUH7q72lnB-ghc9.10.2.so
  2635. 535.42 s [ghc-paths] checking for references to /build/ in /nix/store/qbc6n9xcfhin2gvkj1lbzrhd5q4bd5s9-ghc-paths-0.1.0.12...
  2636. 535.44 s [ghc-paths] patching script interpreter paths in /nix/store/qbc6n9xcfhin2gvkj1lbzrhd5q4bd5s9-ghc-paths-0.1.0.12
  2637. 535.44 s [ghc-paths] stripping (with command strip and flags -S -p) in /nix/store/qbc6n9xcfhin2gvkj1lbzrhd5q4bd5s9-ghc-paths-0.1.0.12/lib
  2638. 535.46 s [cabal-doctest] Preprocessing library for cabal-doctest-1.0.12...
  2639. 535.46 s [cabal-doctest] Running Haddock on library for cabal-doctest-1.0.12...
  2640. 535.47 s [ghc-paths] shrinking RPATHs of ELF executables and libraries in /nix/store/6qfqcsp44y2aicwbbpmvcgdni7q7p5zb-ghc-paths-0.1.0.12-doc
  2641. 535.47 s [ghc-paths] checking for references to /build/ in /nix/store/6qfqcsp44y2aicwbbpmvcgdni7q7p5zb-ghc-paths-0.1.0.12-doc...
  2642. 535.49 s [ghc-paths] patching script interpreter paths in /nix/store/6qfqcsp44y2aicwbbpmvcgdni7q7p5zb-ghc-paths-0.1.0.12-doc
  2643. 535.55 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/6qfqcsp44y2aicwbbpmvcgdni7q7p5zb-ghc-paths-0.1.0.12-doc /nix/store/qbc6n9xcfhin2gvkj1lbzrhd5q4bd5s9-ghc-paths-0.1.0.12
  2644. 535.95 s [post-build-hook] Pushing 2 paths (70 are already present) using zstd to cache sellout ⏳
  2645. 535.95 s [post-build-hook]
  2646. 536.34 s [post-build-hook] Pushing /nix/store/6qfqcsp44y2aicwbbpmvcgdni7q7p5zb-ghc-paths-0.1.0.12-doc (121.12 KiB)
  2647. 536.45 s [post-build-hook] Pushing /nix/store/qbc6n9xcfhin2gvkj1lbzrhd5q4bd5s9-ghc-paths-0.1.0.12 (102.84 KiB)
  2648. 537.41 s [post-build-hook]
  2649. 537.41 s [post-build-hook] All done.
  2650. 537.44 s [post-build-hook] Uploading to the NixCI cache: /nix/store/6qfqcsp44y2aicwbbpmvcgdni7q7p5zb-ghc-paths-0.1.0.12-doc /nix/store/qbc6n9xcfhin2gvkj1lbzrhd5q4bd5s9-ghc-paths-0.1.0.12
  2651. 537.49 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2652. 537.82 s [post-build-hook] copying 2 paths...
  2653. 537.82 s [post-build-hook] copying path '/nix/store/6qfqcsp44y2aicwbbpmvcgdni7q7p5zb-ghc-paths-0.1.0.12-doc' to 'https://cache.nix-ci.com'...
  2654. 537.89 s [post-build-hook] copying path '/nix/store/qbc6n9xcfhin2gvkj1lbzrhd5q4bd5s9-ghc-paths-0.1.0.12' to 'https://cache.nix-ci.com'...
  2655. 538.15 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2656. 538.35 s [post-build-hook] copying 1 paths...
  2657. 538.35 s [post-build-hook] copying path '/nix/store/czk495ak2l4y4isg4z826m5mxcs5ijwi-ghc-paths-0.1.0.12.drv' to 'https://cache.nix-ci.com'...
  2658. 538.51 s Progress: 3 of 22 built (1 building), 177 of 177 downloaded from cache
  2659. 538.56 s Building doctest
  2660. 538.56 s [cabal-doctest] [1 of 1] Compiling Distribution.Extra.Doctest ( src/Distribution/Extra/Doctest.hs, nothing )
  2661. 538.56 s [cabal-doctest] Haddock coverage:
  2662. 538.56 s [cabal-doctest] Warning: 'UserHooks' is ambiguous. It is defined
  2663. 538.56 s [cabal-doctest] * in ‘Distribution.Simple.UserHooks’
  2664. 538.56 s [cabal-doctest] * in ‘Distribution.Simple.UserHooks’
  2665. 538.56 s [cabal-doctest] You may be able to disambiguate the identifier by qualifying it or
  2666. 538.56 s [cabal-doctest] by specifying the type/value namespace explicitly.
  2667. 538.56 s [cabal-doctest] Defaulting to the one defined in ‘Distribution.Simple.UserHooks’
  2668. 538.56 s [cabal-doctest] 100% ( 7 / 7) in 'Distribution.Extra.Doctest'
  2669. 538.75 s [doctest] Phase: setupCompilerEnvironmentPhase
  2670. 538.76 s [doctest] Build with /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2.
  2671. 538.97 s [doctest] Phase: unpackPhase
  2672. 538.98 s [doctest] unpacking source archive /nix/store/bhl15ifbap4vkm5qbpgwa3svq4yanr2l-doctest-0.24.2.tar.gz
  2673. 538.99 s [doctest] source root is doctest-0.24.2
  2674. 539.00 s [doctest] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "doctest-0.24.2/test/UtilSpec.hs"
  2675. 539.01 s [doctest] Phase: patchPhase
  2676. 539.02 s [doctest] Phase: compileBuildDriverPhase
  2677. 539.02 s [doctest] setupCompileFlags: -package-db=/build/tmp.vbNwAnsLfL/setup-package.conf.d -threaded
  2678. 539.10 s [doctest] [1 of 2] Compiling Main ( Setup.lhs, /build/tmp.vbNwAnsLfL/Main.o )
  2679. 539.17 s [doctest] [2 of 2] Linking Setup
  2680. 540.57 s [doctest] Phase: updateAutotoolsGnuConfigScriptsPhase
  2681. 540.59 s [doctest] Phase: configurePhase
  2682. 540.59 s [doctest] configureFlags: --verbose --prefix=/nix/store/zmwlk8gqk89i9b1qlifd7b9wywswg74r-doctest-0.24.2 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/4fvfydn6fvvk22rbz2qx2blkvlnagnn2-doctest-0.24.2-doc/share/doc/doctest-0.24.2 --with-gcc=gcc --package-db=/build/tmp.vbNwAnsLfL/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/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/lib
  2683. 540.59 s [doctest] Using Parsec parser
  2684. 540.59 s [doctest] Configuring doctest-0.24.2...
  2685. 540.92 s [doctest] Flags chosen: cabal-doctest=False
  2686. 541.15 s [doctest] Dependency base >=4.12 && <5: using base-4.20.1.0
  2687. 541.15 s [doctest] Dependency code-page >=0.1: using code-page-0.2.1
  2688. 541.15 s [doctest] Dependency containers: using containers-0.7
  2689. 541.15 s [doctest] Dependency deepseq: using deepseq-1.5.0.0
  2690. 541.15 s [doctest] Dependency directory: using directory-1.3.8.5
  2691. 541.15 s [doctest] Dependency exceptions: using exceptions-0.10.9
  2692. 541.15 s [doctest] Dependency filepath: using filepath-1.5.4.0
  2693. 541.15 s [doctest] Dependency ghc >=8.6 && <9.14: using ghc-9.10.2
  2694. 541.15 s [doctest] Dependency ghc-paths >=0.1.0.9: using ghc-paths-0.1.0.12
  2695. 541.15 s [doctest] Dependency process: using process-1.6.25.0
  2696. 541.15 s [doctest] Dependency syb >=0.3: using syb-0.7.2.4
  2697. 541.15 s [doctest] Dependency temporary: using temporary-1.3
  2698. 541.15 s [doctest] Dependency transformers: using transformers-0.6.1.1
  2699. 541.15 s [doctest] Dependency base >=4.12 && <5: using base-4.20.1.0
  2700. 541.15 s [doctest] Dependency doctest: using doctest-0.24.2
  2701. 541.15 s [doctest] Dependency HUnit: using HUnit-1.6.2.0
  2702. 541.15 s [doctest] Dependency QuickCheck >=2.13.1: using QuickCheck-2.15.0.1
  2703. 541.15 s [doctest] Dependency base >=4.12 && <5: using base-4.20.1.0
  2704. 541.15 s [doctest] Dependency code-page >=0.1: using code-page-0.2.1
  2705. 541.15 s [doctest] Dependency containers: using containers-0.7
  2706. 541.15 s [doctest] Dependency deepseq: using deepseq-1.5.0.0
  2707. 541.15 s [doctest] Dependency directory: using directory-1.3.8.5
  2708. 541.15 s [doctest] Dependency exceptions: using exceptions-0.10.9
  2709. 541.15 s [doctest] Dependency filepath: using filepath-1.5.4.0
  2710. 541.15 s [doctest] Dependency ghc >=8.6 && <9.14: using ghc-9.10.2
  2711. 541.15 s [doctest] Dependency ghc-paths >=0.1.0.9: using ghc-paths-0.1.0.12
  2712. 541.15 s [doctest] Dependency hspec >=2.3.0: using hspec-2.11.14
  2713. 541.15 s [doctest] Dependency hspec-core >=2.3.0: using hspec-core-2.11.14
  2714. 541.15 s [doctest] Dependency mockery: using mockery-0.3.5
  2715. 541.15 s [doctest] Dependency process: using process-1.6.25.0
  2716. 541.15 s [doctest] Dependency silently >=1.2.4: using silently-1.2.5.4
  2717. 541.15 s [doctest] Dependency stringbuilder >=0.4: using stringbuilder-0.5.1
  2718. 541.15 s [doctest] Dependency syb >=0.3: using syb-0.7.2.4
  2719. 541.15 s [doctest] Dependency temporary: using temporary-1.3
  2720. 541.15 s [doctest] Dependency transformers: using transformers-0.6.1.1
  2721. 541.15 s [doctest] Source component graph:
  2722. 541.15 s [doctest] component test:spec
  2723. 541.15 s [doctest] component lib
  2724. 541.15 s [doctest] component exe:doctest dependency lib
  2725. 541.15 s [doctest] Configured component graph:
  2726. 541.15 s [doctest] component doctest-0.24.2-DY3taqnYuzK2D3Dy7SugF8-spec
  2727. 541.15 s [doctest] include HUnit-1.6.2.0-5oiOKRYRGyM8sVZY2GPYrG
  2728. 541.15 s [doctest] include QuickCheck-2.15.0.1-stTt2BXNne46QxWHi9NgG
  2729. 541.15 s [doctest] include base-4.20.1.0-2277
  2730. 541.15 s [doctest] include code-page-0.2.1-6ENFgM4AdrPG89mdDiGgQE
  2731. 541.15 s [doctest] include containers-0.7-dff9
  2732. 541.15 s [doctest] include deepseq-1.5.0.0-f20c
  2733. 541.15 s [doctest] include directory-1.3.8.5-ad1a
  2734. 541.15 s [doctest] include exceptions-0.10.9-fd91
  2735. 541.15 s [doctest] include filepath-1.5.4.0-590e
  2736. 541.15 s [doctest] include ghc-9.10.2-1e2a
  2737. 541.15 s [doctest] include ghc-paths-0.1.0.12-BTxxrzk1njL3kUH7q72lnB
  2738. 541.15 s [doctest] include hspec-2.11.14-3auEz28FeP0D0azREoF21o
  2739. 541.15 s [doctest] include hspec-core-2.11.14-2ODHRHRlRhY5X6Tttrwltc
  2740. 541.15 s [doctest] include mockery-0.3.5-1gZs6Gh8HyS7KrENSjoMkb
  2741. 541.15 s [doctest] include process-1.6.25.0-d21a
  2742. 541.15 s [doctest] include silently-1.2.5.4-CfYnUQltkCQFwCEtYutEag
  2743. 541.15 s [doctest] include stringbuilder-0.5.1-3D1tLjcqCDw2HlXfDuEiaF
  2744. 541.15 s [doctest] include syb-0.7.2.4-1Jh7SexWS76JQPmzYJSHJV
  2745. 541.15 s [doctest] include temporary-1.3-BQ38mAt3evo5vO57xabNgq
  2746. 541.15 s [doctest] include transformers-0.6.1.1-407f
  2747. 541.15 s [doctest] component doctest-0.24.2-H4FgSSwrzQD6JTD7tYQanP
  2748. 541.15 s [doctest] include base-4.20.1.0-2277
  2749. 541.15 s [doctest] include code-page-0.2.1-6ENFgM4AdrPG89mdDiGgQE
  2750. 541.15 s [doctest] include containers-0.7-dff9
  2751. 541.15 s [doctest] include deepseq-1.5.0.0-f20c
  2752. 541.15 s [doctest] include directory-1.3.8.5-ad1a
  2753. 541.15 s [doctest] include exceptions-0.10.9-fd91
  2754. 541.15 s [doctest] include filepath-1.5.4.0-590e
  2755. 541.15 s [doctest] include ghc-9.10.2-1e2a
  2756. 541.15 s [doctest] include ghc-paths-0.1.0.12-BTxxrzk1njL3kUH7q72lnB
  2757. 541.15 s [doctest] include process-1.6.25.0-d21a
  2758. 541.15 s [doctest] include syb-0.7.2.4-1Jh7SexWS76JQPmzYJSHJV
  2759. 541.15 s [doctest] include temporary-1.3-BQ38mAt3evo5vO57xabNgq
  2760. 541.15 s [doctest] include transformers-0.6.1.1-407f
  2761. 541.15 s [doctest] component doctest-0.24.2-Kyn3GVVLAqI2HGmLykzp7e-doctest
  2762. 541.15 s [doctest] include base-4.20.1.0-2277
  2763. 541.15 s [doctest] include doctest-0.24.2-H4FgSSwrzQD6JTD7tYQanP
  2764. 541.15 s [doctest] Linked component graph:
  2765. 541.15 s [doctest] unit doctest-0.24.2-DY3taqnYuzK2D3Dy7SugF8-spec
  2766. 541.15 s [doctest] include HUnit-1.6.2.0-5oiOKRYRGyM8sVZY2GPYrG
  2767. 541.15 s [doctest] include QuickCheck-2.15.0.1-stTt2BXNne46QxWHi9NgG
  2768. 541.15 s [doctest] include base-4.20.1.0-2277
  2769. 541.15 s [doctest] include code-page-0.2.1-6ENFgM4AdrPG89mdDiGgQE
  2770. 541.15 s [doctest] include containers-0.7-dff9
  2771. 541.15 s [doctest] include deepseq-1.5.0.0-f20c
  2772. 541.15 s [doctest] include directory-1.3.8.5-ad1a
  2773. 541.15 s [doctest] include exceptions-0.10.9-fd91
  2774. 541.15 s [doctest] include filepath-1.5.4.0-590e
  2775. 541.15 s [doctest] include ghc-9.10.2-1e2a
  2776. 541.15 s [doctest] include ghc-paths-0.1.0.12-BTxxrzk1njL3kUH7q72lnB
  2777. 541.15 s [doctest] include hspec-2.11.14-3auEz28FeP0D0azREoF21o
  2778. 541.15 s [doctest] include hspec-core-2.11.14-2ODHRHRlRhY5X6Tttrwltc
  2779. 541.15 s [doctest] include mockery-0.3.5-1gZs6Gh8HyS7KrENSjoMkb
  2780. 541.15 s [doctest] include process-1.6.25.0-d21a
  2781. 541.15 s [doctest] include silently-1.2.5.4-CfYnUQltkCQFwCEtYutEag
  2782. 541.15 s [doctest] include stringbuilder-0.5.1-3D1tLjcqCDw2HlXfDuEiaF
  2783. 541.15 s [doctest] include syb-0.7.2.4-1Jh7SexWS76JQPmzYJSHJV
  2784. 541.15 s [doctest] include temporary-1.3-BQ38mAt3evo5vO57xabNgq
  2785. 541.15 s [doctest] include transformers-0.6.1.1-407f
  2786. 541.15 s [doctest] unit doctest-0.24.2-H4FgSSwrzQD6JTD7tYQanP
  2787. 541.15 s [doctest] include base-4.20.1.0-2277
  2788. 541.15 s [doctest] include code-page-0.2.1-6ENFgM4AdrPG89mdDiGgQE
  2789. 541.15 s [doctest] include containers-0.7-dff9
  2790. 541.15 s [doctest] include deepseq-1.5.0.0-f20c
  2791. 541.15 s [doctest] include directory-1.3.8.5-ad1a
  2792. 541.15 s [doctest] include exceptions-0.10.9-fd91
  2793. 541.15 s [doctest] include filepath-1.5.4.0-590e
  2794. 541.15 s [doctest] include ghc-9.10.2-1e2a
  2795. 541.15 s [doctest] include ghc-paths-0.1.0.12-BTxxrzk1njL3kUH7q72lnB
  2796. 541.15 s [doctest] include process-1.6.25.0-d21a
  2797. 541.15 s [doctest] include syb-0.7.2.4-1Jh7SexWS76JQPmzYJSHJV
  2798. 541.15 s [doctest] include temporary-1.3-BQ38mAt3evo5vO57xabNgq
  2799. 541.15 s [doctest] include transformers-0.6.1.1-407f
  2800. 541.15 s [doctest] Test.DocTest=doctest-0.24.2-H4FgSSwrzQD6JTD7tYQanP:Test.DocTest,Test.DocTest.Internal.Cabal=doctest-0.24.2-H4FgSSwrzQD6JTD7tYQanP:Test.DocTest.Internal.Cabal,Test.DocTest.Internal.Extract=doctest-0.24.2-H4FgSSwrzQD6JTD7tYQanP:Test.DocTest.Internal.Extract,Test.DocTest.Internal.Location=doctest-0.24.2-H4FgSSwrzQD6JTD7tYQanP:Test.DocTest.Internal.Location,Test.DocTest.Internal.Parse=doctest-0.24.2-H4FgSSwrzQD6JTD7tYQanP:Test.DocTest.Internal.Parse,Test.DocTest.Internal.Run=doctest-0.24.2-H4FgSSwrzQD6JTD7tYQanP:Test.DocTest.Internal.Run
  2801. 541.15 s [doctest] unit doctest-0.24.2-Kyn3GVVLAqI2HGmLykzp7e-doctest
  2802. 541.15 s [doctest] include base-4.20.1.0-2277
  2803. 541.15 s [doctest] include doctest-0.24.2-H4FgSSwrzQD6JTD7tYQanP
  2804. 541.15 s [doctest] Ready component graph:
  2805. 541.15 s [doctest] definite doctest-0.24.2-H4FgSSwrzQD6JTD7tYQanP
  2806. 541.15 s [doctest] depends base-4.20.1.0-2277
  2807. 541.15 s [doctest] depends code-page-0.2.1-6ENFgM4AdrPG89mdDiGgQE
  2808. 541.15 s [doctest] depends containers-0.7-dff9
  2809. 541.15 s [doctest] depends deepseq-1.5.0.0-f20c
  2810. 541.15 s [doctest] depends directory-1.3.8.5-ad1a
  2811. 541.15 s [doctest] depends exceptions-0.10.9-fd91
  2812. 541.15 s [doctest] depends filepath-1.5.4.0-590e
  2813. 541.15 s [doctest] depends ghc-9.10.2-1e2a
  2814. 541.15 s [doctest] depends ghc-paths-0.1.0.12-BTxxrzk1njL3kUH7q72lnB
  2815. 541.15 s [doctest] depends process-1.6.25.0-d21a
  2816. 541.15 s [doctest] depends syb-0.7.2.4-1Jh7SexWS76JQPmzYJSHJV
  2817. 541.15 s [doctest] depends temporary-1.3-BQ38mAt3evo5vO57xabNgq
  2818. 541.15 s [doctest] depends transformers-0.6.1.1-407f
  2819. 541.15 s [doctest] definite doctest-0.24.2-Kyn3GVVLAqI2HGmLykzp7e-doctest
  2820. 541.15 s [doctest] depends base-4.20.1.0-2277
  2821. 541.15 s [doctest] depends doctest-0.24.2-H4FgSSwrzQD6JTD7tYQanP
  2822. 541.15 s [doctest] definite doctest-0.24.2-DY3taqnYuzK2D3Dy7SugF8-spec
  2823. 541.15 s [doctest] depends HUnit-1.6.2.0-5oiOKRYRGyM8sVZY2GPYrG
  2824. 541.15 s [doctest] depends QuickCheck-2.15.0.1-stTt2BXNne46QxWHi9NgG
  2825. 541.15 s [doctest] depends base-4.20.1.0-2277
  2826. 541.15 s [doctest] depends code-page-0.2.1-6ENFgM4AdrPG89mdDiGgQE
  2827. 541.15 s [doctest] depends containers-0.7-dff9
  2828. 541.15 s [doctest] depends deepseq-1.5.0.0-f20c
  2829. 541.15 s [doctest] depends directory-1.3.8.5-ad1a
  2830. 541.15 s [doctest] depends exceptions-0.10.9-fd91
  2831. 541.15 s [doctest] depends filepath-1.5.4.0-590e
  2832. 541.15 s [doctest] depends ghc-9.10.2-1e2a
  2833. 541.15 s [doctest] depends ghc-paths-0.1.0.12-BTxxrzk1njL3kUH7q72lnB
  2834. 541.15 s [doctest] depends hspec-2.11.14-3auEz28FeP0D0azREoF21o
  2835. 541.15 s [doctest] depends hspec-core-2.11.14-2ODHRHRlRhY5X6Tttrwltc
  2836. 541.15 s [doctest] depends mockery-0.3.5-1gZs6Gh8HyS7KrENSjoMkb
  2837. 541.15 s [doctest] depends process-1.6.25.0-d21a
  2838. 541.15 s [doctest] depends silently-1.2.5.4-CfYnUQltkCQFwCEtYutEag
  2839. 541.15 s [doctest] depends stringbuilder-0.5.1-3D1tLjcqCDw2HlXfDuEiaF
  2840. 541.15 s [doctest] depends syb-0.7.2.4-1Jh7SexWS76JQPmzYJSHJV
  2841. 541.15 s [doctest] depends temporary-1.3-BQ38mAt3evo5vO57xabNgq
  2842. 541.15 s [doctest] depends transformers-0.6.1.1-407f
  2843. 541.15 s [doctest] Using Cabal-3.12.1.0 compiled by ghc-9.10
  2844. 541.15 s [doctest] Using compiler: ghc-9.10.2
  2845. 541.15 s [doctest] Using install prefix:
  2846. 541.15 s [doctest] /nix/store/zmwlk8gqk89i9b1qlifd7b9wywswg74r-doctest-0.24.2
  2847. 541.15 s [doctest] Executables installed in:
  2848. 541.15 s [doctest] /nix/store/zmwlk8gqk89i9b1qlifd7b9wywswg74r-doctest-0.24.2/bin
  2849. 541.15 s [doctest] Libraries installed in:
  2850. 541.15 s [doctest] /nix/store/zmwlk8gqk89i9b1qlifd7b9wywswg74r-doctest-0.24.2/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-1e2a/doctest-0.24.2-H4FgSSwrzQD6JTD7tYQanP
  2851. 541.15 s [doctest] Dynamic Libraries installed in:
  2852. 541.15 s [doctest] /nix/store/zmwlk8gqk89i9b1qlifd7b9wywswg74r-doctest-0.24.2/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-1e2a
  2853. 541.16 s [doctest] Private executables installed in:
  2854. 541.16 s [doctest] /nix/store/zmwlk8gqk89i9b1qlifd7b9wywswg74r-doctest-0.24.2/libexec/x86_64-linux-ghc-9.10.2-1e2a/doctest-0.24.2
  2855. 541.16 s [doctest] Data files installed in:
  2856. 541.16 s [doctest] /nix/store/zmwlk8gqk89i9b1qlifd7b9wywswg74r-doctest-0.24.2/share/x86_64-linux-ghc-9.10.2-1e2a/doctest-0.24.2
  2857. 541.16 s [doctest] Documentation installed in:
  2858. 541.16 s [doctest] /nix/store/4fvfydn6fvvk22rbz2qx2blkvlnagnn2-doctest-0.24.2-doc/share/doc/doctest-0.24.2
  2859. 541.16 s [doctest] Configuration files installed in:
  2860. 541.16 s [doctest] /nix/store/zmwlk8gqk89i9b1qlifd7b9wywswg74r-doctest-0.24.2/etc
  2861. 541.16 s [doctest] No alex found
  2862. 541.16 s [doctest] Using ar found on system at:
  2863. 541.16 s [doctest] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
  2864. 541.16 s [doctest] No c2hs found
  2865. 541.16 s [doctest] No cpphs found
  2866. 541.16 s [doctest] No doctest found
  2867. 541.16 s [doctest] Using gcc version 14.3.0 given by user at:
  2868. 541.16 s [doctest] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
  2869. 541.16 s [doctest] Using ghc version 9.10.2 found on system at:
  2870. 541.16 s [doctest] /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/bin/ghc
  2871. 541.16 s [doctest] Using ghc-pkg version 9.10.2 found on system at:
  2872. 541.16 s [doctest] /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/bin/ghc-pkg-9.10.2
  2873. 541.16 s [doctest] No ghcjs found
  2874. 541.16 s [doctest] No ghcjs-pkg found
  2875. 541.16 s [doctest] No greencard found
  2876. 541.16 s [doctest] Using haddock version 2.31.0 found on system at:
  2877. 541.16 s [doctest] /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/bin/haddock-ghc-9.10.2
  2878. 541.16 s [doctest] No happy found
  2879. 541.16 s [doctest] Using haskell-suite found on system at: haskell-suite-dummy-location
  2880. 541.16 s [doctest] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  2881. 541.16 s [doctest] No hmake found
  2882. 541.16 s [doctest] Using hpc version 0.69 found on system at:
  2883. 541.16 s [doctest] /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/bin/hpc-ghc-9.10.2
  2884. 541.16 s [doctest] Using hsc2hs version 0.68.10 found on system at:
  2885. 541.16 s [doctest] /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/bin/hsc2hs-ghc-9.10.2
  2886. 541.16 s [doctest] Using hscolour version 1.25 found on system at:
  2887. 541.16 s [doctest] /nix/store/kb4afndnwdxxc5ps9k8xv0jzd0a9y8n5-hscolour-1.25/bin/HsColour
  2888. 541.16 s [doctest] No jhc found
  2889. 541.16 s [doctest] Using ld found on system at:
  2890. 541.16 s [doctest] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/ld
  2891. 541.16 s [doctest] No pkg-config found
  2892. 541.16 s [doctest] Using runghc version 9.10.2 found on system at:
  2893. 541.16 s [doctest] /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/bin/runghc-9.10.2
  2894. 541.16 s [doctest] Using strip version 2.44 found on system at:
  2895. 541.16 s [doctest] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
  2896. 541.17 s [doctest] Using tar found on system at:
  2897. 541.17 s [doctest] /nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
  2898. 541.17 s [doctest] No uhc found
  2899. 541.30 s [doctest] Phase: buildPhase
  2900. 541.36 s [doctest] Preprocessing library for doctest-0.24.2...
  2901. 541.36 s [doctest] Building library for doctest-0.24.2...
  2902. 541.72 s [doctest] [ 1 of 26] Compiling Imports ( src/Imports.hs, dist/build/Imports.o, dist/build/Imports.dyn_o )
  2903. 541.82 s [doctest] [ 2 of 26] Compiling GhcUtil ( src/GhcUtil.hs, dist/build/GhcUtil.o, dist/build/GhcUtil.dyn_o )
  2904. 542.45 s [doctest] [ 3 of 26] Compiling Cabal.ReplOptions ( src/Cabal/ReplOptions.hs, dist/build/Cabal/ReplOptions.o, dist/build/Cabal/ReplOptions.dyn_o )
  2905. 542.45 s [doctest] [ 4 of 26] Compiling Cabal.Paths ( src/Cabal/Paths.hs, dist/build/Cabal/Paths.o, dist/build/Cabal/Paths.dyn_o )
  2906. 542.45 s [doctest] [ 5 of 26] Compiling Cabal.Options ( src/Cabal/Options.hs, dist/build/Cabal/Options.o, dist/build/Cabal/Options.dyn_o )
  2907. 542.47 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 )
  2908. 542.47 s [doctest] [ 7 of 26] Compiling Interpreter ( src/Interpreter.hs, dist/build/Interpreter.o, dist/build/Interpreter.dyn_o )
  2909. 542.47 s [doctest] [ 8 of 26] Compiling Location ( src/Location.hs, dist/build/Location.o, dist/build/Location.dyn_o )
  2910. 542.47 s [doctest] [ 9 of 26] Compiling PackageDBs ( src/PackageDBs.hs, dist/build/PackageDBs.o, dist/build/PackageDBs.dyn_o )
  2911. 542.47 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 )
  2912. 542.47 s [doctest] [11 of 26] Compiling Info ( src/Info.hs, dist/build/Info.o, dist/build/Info.dyn_o )
  2913. 542.47 s [doctest] [12 of 26] Compiling Options ( src/Options.hs, dist/build/Options.o, dist/build/Options.dyn_o )
  2914. 542.56 s [doctest] [13 of 26] Compiling Cabal ( src/Cabal.hs, dist/build/Cabal.o, dist/build/Cabal.dyn_o )
  2915. 542.59 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 )
  2916. 542.61 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 )
  2917. 542.61 s [doctest] [16 of 26] Compiling Util ( src/Util.hs, dist/build/Util.o, dist/build/Util.dyn_o )
  2918. 542.61 s [doctest] [17 of 26] Compiling Extract ( src/Extract.hs, dist/build/Extract.o, dist/build/Extract.dyn_o )
  2919. 542.67 s [cabal-doctest] Documentation created: dist/doc/html/cabal-doctest/,
  2920. 542.67 s [cabal-doctest] dist/doc/html/cabal-doctest/cabal-doctest.txt
  2921. 542.74 s [cabal-doctest] Phase: installPhase
  2922. 542.78 s [cabal-doctest] Installing library in /nix/store/jqaj1q4vgmbd2x8w70z3mki4b9wii8q9-cabal-doctest-1.0.12/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-1e2a/cabal-doctest-1.0.12-Jwvc96ehpDX2sbU9yjsKFV
  2923. 542.88 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 )
  2924. 542.90 s [doctest] [19 of 26] Compiling Parse ( src/Parse.hs, dist/build/Parse.o, dist/build/Parse.dyn_o )
  2925. 542.91 s [cabal-doctest] Phase: fixupPhase
  2926. 542.93 s [cabal-doctest] shrinking RPATHs of ELF executables and libraries in /nix/store/jqaj1q4vgmbd2x8w70z3mki4b9wii8q9-cabal-doctest-1.0.12
  2927. 542.93 s [cabal-doctest] shrinking /nix/store/jqaj1q4vgmbd2x8w70z3mki4b9wii8q9-cabal-doctest-1.0.12/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-1e2a/libHScabal-doctest-1.0.12-Jwvc96ehpDX2sbU9yjsKFV-ghc9.10.2.so
  2928. 542.94 s [cabal-doctest] checking for references to /build/ in /nix/store/jqaj1q4vgmbd2x8w70z3mki4b9wii8q9-cabal-doctest-1.0.12...
  2929. 542.96 s [cabal-doctest] patching script interpreter paths in /nix/store/jqaj1q4vgmbd2x8w70z3mki4b9wii8q9-cabal-doctest-1.0.12
  2930. 542.96 s [cabal-doctest] stripping (with command strip and flags -S -p) in /nix/store/jqaj1q4vgmbd2x8w70z3mki4b9wii8q9-cabal-doctest-1.0.12/lib
  2931. 542.99 s [cabal-doctest] shrinking RPATHs of ELF executables and libraries in /nix/store/763l1xc96d7gxbmz5kwx3z48yivhzzhn-cabal-doctest-1.0.12-doc
  2932. 543.00 s [cabal-doctest] checking for references to /build/ in /nix/store/763l1xc96d7gxbmz5kwx3z48yivhzzhn-cabal-doctest-1.0.12-doc...
  2933. 543.01 s [cabal-doctest] patching script interpreter paths in /nix/store/763l1xc96d7gxbmz5kwx3z48yivhzzhn-cabal-doctest-1.0.12-doc
  2934. 543.09 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/763l1xc96d7gxbmz5kwx3z48yivhzzhn-cabal-doctest-1.0.12-doc /nix/store/jqaj1q4vgmbd2x8w70z3mki4b9wii8q9-cabal-doctest-1.0.12
  2935. 543.58 s [post-build-hook] Pushing 2 paths (74 are already present) using zstd to cache sellout ⏳
  2936. 543.58 s [post-build-hook]
  2937. 543.99 s [post-build-hook] Pushing /nix/store/763l1xc96d7gxbmz5kwx3z48yivhzzhn-cabal-doctest-1.0.12-doc (379.52 KiB)
  2938. 544.01 s [post-build-hook] Pushing /nix/store/jqaj1q4vgmbd2x8w70z3mki4b9wii8q9-cabal-doctest-1.0.12 (801.35 KiB)
  2939. 545.17 s [post-build-hook]
  2940. 545.17 s [post-build-hook] All done.
  2941. 545.19 s [post-build-hook] Uploading to the NixCI cache: /nix/store/763l1xc96d7gxbmz5kwx3z48yivhzzhn-cabal-doctest-1.0.12-doc /nix/store/jqaj1q4vgmbd2x8w70z3mki4b9wii8q9-cabal-doctest-1.0.12
  2942. 545.24 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2943. 545.38 s [post-build-hook] copying 2 paths...
  2944. 545.38 s [post-build-hook] copying path '/nix/store/763l1xc96d7gxbmz5kwx3z48yivhzzhn-cabal-doctest-1.0.12-doc' to 'https://cache.nix-ci.com'...
  2945. 545.74 s [post-build-hook] copying path '/nix/store/jqaj1q4vgmbd2x8w70z3mki4b9wii8q9-cabal-doctest-1.0.12' to 'https://cache.nix-ci.com'...
  2946. 546.10 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2947. 546.26 s [post-build-hook] copying 1 paths...
  2948. 546.26 s [post-build-hook] copying path '/nix/store/1pvwnyvk8yg83hi4rw9swc7wvdyrvzwd-cabal-doctest-1.0.12.drv' to 'https://cache.nix-ci.com'...
  2949. 546.41 s Progress: 4 of 22 built (1 building), 177 of 177 downloaded from cache
  2950. 546.41 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 )
  2951. 546.41 s [doctest] [21 of 26] Compiling Runner.Example ( src/Runner/Example.hs, dist/build/Runner/Example.o, dist/build/Runner/Example.dyn_o )
  2952. 546.41 s [doctest] [22 of 26] Compiling Property ( src/Property.hs, dist/build/Property.o, dist/build/Property.dyn_o )
  2953. 546.41 s [doctest] [23 of 26] Compiling Runner ( src/Runner.hs, dist/build/Runner.o, dist/build/Runner.dyn_o )
  2954. 546.41 s [doctest] [24 of 26] Compiling Run ( src/Run.hs, dist/build/Run.o, dist/build/Run.dyn_o )
  2955. 546.41 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 )
  2956. 546.41 s [doctest] [26 of 26] Compiling Test.DocTest ( src/Test/DocTest.hs, dist/build/Test/DocTest.o, dist/build/Test/DocTest.dyn_o )
  2957. 546.41 s [doctest] [ 1 of 26] Compiling Imports ( src/Imports.hs, dist/build/Imports.p_o )
  2958. 546.41 s [doctest] [ 2 of 26] Compiling GhcUtil ( src/GhcUtil.hs, dist/build/GhcUtil.p_o )
  2959. 546.41 s [doctest] [ 3 of 26] Compiling Cabal.ReplOptions ( src/Cabal/ReplOptions.hs, dist/build/Cabal/ReplOptions.p_o )
  2960. 546.41 s [doctest] [ 4 of 26] Compiling Cabal.Paths ( src/Cabal/Paths.hs, dist/build/Cabal/Paths.p_o )
  2961. 546.41 s [doctest] [ 5 of 26] Compiling Cabal.Options ( src/Cabal/Options.hs, dist/build/Cabal/Options.p_o )
  2962. 546.41 s [doctest] [ 6 of 26] Compiling Language.Haskell.GhciWrapper ( src/Language/Haskell/GhciWrapper.hs, dist/build/Language/Haskell/GhciWrapper.p_o )
  2963. 546.41 s [doctest] [ 7 of 26] Compiling Interpreter ( src/Interpreter.hs, dist/build/Interpreter.p_o )
  2964. 546.41 s [doctest] [ 8 of 26] Compiling Location ( src/Location.hs, dist/build/Location.p_o )
  2965. 546.41 s [doctest] [ 9 of 26] Compiling PackageDBs ( src/PackageDBs.hs, dist/build/PackageDBs.p_o )
  2966. 546.41 s [doctest] [10 of 26] Compiling Paths_doctest ( dist/build/autogen/Paths_doctest.hs, dist/build/Paths_doctest.p_o )
  2967. 546.41 s [doctest] [11 of 26] Compiling Info ( src/Info.hs, dist/build/Info.p_o )
  2968. 546.41 s [doctest] [12 of 26] Compiling Options ( src/Options.hs, dist/build/Options.p_o )
  2969. 546.41 s [doctest] [13 of 26] Compiling Cabal ( src/Cabal.hs, dist/build/Cabal.p_o )
  2970. 546.41 s [doctest] [14 of 26] Compiling Test.DocTest.Internal.Cabal ( src/Test/DocTest/Internal/Cabal.hs, dist/build/Test/DocTest/Internal/Cabal.p_o )
  2971. 546.41 s [doctest] [15 of 26] Compiling Test.DocTest.Internal.Location ( src/Test/DocTest/Internal/Location.hs, dist/build/Test/DocTest/Internal/Location.p_o )
  2972. 546.41 s [doctest] [16 of 26] Compiling Util ( src/Util.hs, dist/build/Util.p_o )
  2973. 546.41 s [doctest] [17 of 26] Compiling Extract ( src/Extract.hs, dist/build/Extract.p_o )
  2974. 546.41 s [doctest] [18 of 26] Compiling Test.DocTest.Internal.Extract ( src/Test/DocTest/Internal/Extract.hs, dist/build/Test/DocTest/Internal/Extract.p_o )
  2975. 546.41 s [doctest] [19 of 26] Compiling Parse ( src/Parse.hs, dist/build/Parse.p_o )
  2976. 546.41 s [doctest] [20 of 26] Compiling Test.DocTest.Internal.Parse ( src/Test/DocTest/Internal/Parse.hs, dist/build/Test/DocTest/Internal/Parse.p_o )
  2977. 546.41 s [doctest] [21 of 26] Compiling Runner.Example ( src/Runner/Example.hs, dist/build/Runner/Example.p_o )
  2978. 546.53 s [doctest] [22 of 26] Compiling Property ( src/Property.hs, dist/build/Property.p_o )
  2979. 546.53 s [doctest] [23 of 26] Compiling Runner ( src/Runner.hs, dist/build/Runner.p_o )
  2980. 546.92 s [doctest] [24 of 26] Compiling Run ( src/Run.hs, dist/build/Run.p_o )
  2981. 547.14 s [doctest] [25 of 26] Compiling Test.DocTest.Internal.Run ( src/Test/DocTest/Internal/Run.hs, dist/build/Test/DocTest/Internal/Run.p_o )
  2982. 547.26 s [doctest] [26 of 26] Compiling Test.DocTest ( src/Test/DocTest.hs, dist/build/Test/DocTest.p_o )
  2983. 550.83 s [doctest] Preprocessing executable 'doctest' for doctest-0.24.2...
  2984. 550.83 s [doctest] Building executable 'doctest' for doctest-0.24.2...
  2985. 550.92 s [doctest] [1 of 2] Compiling Main ( driver/doctest.hs, dist/build/doctest/doctest-tmp/Main.o )
  2986. 551.05 s [doctest] [2 of 2] Compiling Paths_doctest ( dist/build/doctest/autogen/Paths_doctest.hs, dist/build/doctest/doctest-tmp/Paths_doctest.o )
  2987. 551.20 s [doctest] [3 of 3] Linking dist/build/doctest/doctest
  2988. 555.73 s [doctest] Preprocessing test suite 'spec' for doctest-0.24.2...
  2989. 555.74 s [doctest] Building test suite 'spec' for doctest-0.24.2...
  2990. 556.28 s [doctest] [ 1 of 44] Compiling Imports ( src/Imports.hs, dist/build/spec/spec-tmp/Imports.o )
  2991. 556.37 s [doctest] [ 2 of 44] Compiling GhcUtil ( src/GhcUtil.hs, dist/build/spec/spec-tmp/GhcUtil.o )
  2992. 556.91 s [doctest] [ 3 of 44] Compiling Cabal.ReplOptions ( src/Cabal/ReplOptions.hs, dist/build/spec/spec-tmp/Cabal/ReplOptions.o )
  2993. 556.91 s [doctest] [ 4 of 44] Compiling Cabal.ReplOptionsSpec ( test/Cabal/ReplOptionsSpec.hs, dist/build/spec/spec-tmp/Cabal/ReplOptionsSpec.o )
  2994. 557.20 s [doctest] [ 5 of 44] Compiling Cabal.Paths ( src/Cabal/Paths.hs, dist/build/spec/spec-tmp/Cabal/Paths.o )
  2995. 557.20 s [doctest] [ 6 of 44] Compiling Cabal.Options ( src/Cabal/Options.hs, dist/build/spec/spec-tmp/Cabal/Options.o )
  2996. 557.20 s [doctest] [ 7 of 44] Compiling Cabal.OptionsSpec ( test/Cabal/OptionsSpec.hs, dist/build/spec/spec-tmp/Cabal/OptionsSpec.o )
  2997. 557.46 s [doctest] [ 8 of 44] Compiling Language.Haskell.GhciWrapper ( src/Language/Haskell/GhciWrapper.hs, dist/build/spec/spec-tmp/Language/Haskell/GhciWrapper.o )
  2998. 557.46 s [doctest] [ 9 of 44] Compiling Interpreter ( src/Interpreter.hs, dist/build/spec/spec-tmp/Interpreter.o )
  2999. 557.46 s [doctest] [10 of 44] Compiling InterpreterSpec ( test/InterpreterSpec.hs, dist/build/spec/spec-tmp/InterpreterSpec.o )
  3000. 557.46 s [doctest] [11 of 44] Compiling Info ( src/Info.hs, dist/build/spec/spec-tmp/Info.o )
  3001. 557.46 s [doctest] [12 of 44] Compiling InfoSpec ( test/InfoSpec.hs, dist/build/spec/spec-tmp/InfoSpec.o )
  3002. 557.46 s [doctest] [13 of 44] Compiling Cabal ( src/Cabal.hs, dist/build/spec/spec-tmp/Cabal.o )
  3003. 557.47 s [doctest] [14 of 44] Compiling Cabal.PathsSpec ( test/Cabal/PathsSpec.hs, dist/build/spec/spec-tmp/Cabal/PathsSpec.o )
  3004. 557.47 s [doctest] [15 of 44] Compiling Language.Haskell.GhciWrapperSpec ( test/Language/Haskell/GhciWrapperSpec.hs, dist/build/spec/spec-tmp/Language/Haskell/GhciWrapperSpec.o )
  3005. 557.47 s [doctest] [16 of 44] Compiling Location ( src/Location.hs, dist/build/spec/spec-tmp/Location.o )
  3006. 557.47 s [doctest] [17 of 44] Compiling LocationSpec ( test/LocationSpec.hs, dist/build/spec/spec-tmp/LocationSpec.o )
  3007. 557.47 s [doctest] [18 of 44] Compiling Options ( src/Options.hs, dist/build/spec/spec-tmp/Options.o )
  3008. 557.47 s [doctest] [19 of 44] Compiling OptionsSpec ( test/OptionsSpec.hs, dist/build/spec/spec-tmp/OptionsSpec.o )
  3009. 557.73 s [doctest] [20 of 44] Compiling PackageDBs ( src/PackageDBs.hs, dist/build/spec/spec-tmp/PackageDBs.o )
  3010. 557.73 s [doctest] [21 of 44] Compiling PackageDBsSpec ( test/PackageDBsSpec.hs, dist/build/spec/spec-tmp/PackageDBsSpec.o )
  3011. 557.73 s [doctest] [22 of 44] Compiling Paths_doctest ( dist/build/spec/autogen/Paths_doctest.hs, dist/build/spec/spec-tmp/Paths_doctest.o )
  3012. 557.73 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 )
  3013. 557.73 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 )
  3014. 557.73 s [doctest] [25 of 44] Compiling Util ( src/Util.hs, dist/build/spec/spec-tmp/Util.o )
  3015. 557.73 s [doctest] [26 of 44] Compiling Extract ( src/Extract.hs, dist/build/spec/spec-tmp/Extract.o )
  3016. 557.80 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 )
  3017. 557.81 s [doctest] [28 of 44] Compiling Parse ( src/Parse.hs, dist/build/spec/spec-tmp/Parse.o )
  3018. 558.07 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 )
  3019. 558.10 s [doctest] [30 of 44] Compiling Runner.Example ( src/Runner/Example.hs, dist/build/spec/spec-tmp/Runner/Example.o )
  3020. 558.55 s [doctest] [31 of 44] Compiling Runner.ExampleSpec ( test/Runner/ExampleSpec.hs, dist/build/spec/spec-tmp/Runner/ExampleSpec.o )
  3021. 559.08 s [doctest] [32 of 44] Compiling Property ( src/Property.hs, dist/build/spec/spec-tmp/Property.o )
  3022. 559.08 s [doctest] [33 of 44] Compiling Runner ( src/Runner.hs, dist/build/spec/spec-tmp/Runner.o )
  3023. 559.13 s [doctest] [34 of 44] Compiling RunnerSpec ( test/RunnerSpec.hs, dist/build/spec/spec-tmp/RunnerSpec.o )
  3024. 559.24 s [doctest] [35 of 44] Compiling Run ( src/Run.hs, dist/build/spec/spec-tmp/Run.o )
  3025. 559.26 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 )
  3026. 559.28 s [doctest] [37 of 44] Compiling Test.DocTest ( src/Test/DocTest.hs, dist/build/spec/spec-tmp/Test/DocTest.o )
  3027. 559.29 s [doctest] [38 of 44] Compiling RunSpec ( test/RunSpec.hs, dist/build/spec/spec-tmp/RunSpec.o )
  3028. 559.82 s [doctest] [39 of 44] Compiling MainSpec ( test/MainSpec.hs, dist/build/spec/spec-tmp/MainSpec.o )
  3029. 559.96 s [doctest] [40 of 44] Compiling PropertySpec ( test/PropertySpec.hs, dist/build/spec/spec-tmp/PropertySpec.o )
  3030. 559.96 s [doctest] [41 of 44] Compiling ParseSpec ( test/ParseSpec.hs, dist/build/spec/spec-tmp/ParseSpec.o )
  3031. 559.96 s [doctest] [42 of 44] Compiling ExtractSpec ( test/ExtractSpec.hs, dist/build/spec/spec-tmp/ExtractSpec.o )
  3032. 559.96 s [doctest] [43 of 44] Compiling UtilSpec ( test/UtilSpec.hs, dist/build/spec/spec-tmp/UtilSpec.o )
  3033. 559.96 s [doctest] [44 of 44] Compiling Main ( test/Spec.hs, dist/build/spec/spec-tmp/Main.o )
  3034. 561.91 s [doctest] [45 of 45] Linking dist/build/spec/spec
  3035. 568.72 s [doctest] Phase: checkPhase
  3036. 569.23 s [doctest] Running 1 test suites...
  3037. 569.23 s [doctest] Test suite spec: RUNNING...
  3038. 569.26 s [doctest]
  3039. 569.26 s [doctest] Extract
  3040. 569.26 s [doctest] extract
  3041. 569.36 s [doctest] extracts documentation for a top-level declaration [✔]
  3042. 569.44 s [doctest] extracts documentation from argument list [✔]
  3043. 569.48 s [doctest] extracts documentation for a type class function [✔]
  3044. 569.54 s [doctest] extracts documentation from the argument list of a type class function [✔]
  3045. 569.58 s [doctest] extracts documentation from the module header [✔]
  3046. 569.66 s [doctest] extracts documentation from imported modules [✔]
  3047. 569.71 s [doctest] extracts documentation from export list [✔]
  3048. 569.77 s [doctest] extracts documentation from named chunks [✔]
  3049. 569.84 s [doctest] returns docstrings in the same order they appear in the source [✔]
  3050. 569.90 s [doctest] extracts $setup code [✔]
  3051. 569.95 s [doctest] fails on invalid flags [✔]
  3052. 569.95 s [doctest] extract (regression tests)
  3053. 570.01 s [doctest] works with infix operators [✔]
  3054. 570.09 s [doctest] works with parallel list comprehensions [✔]
  3055. 570.11 s [doctest] works with list comprehensions in instance definitions [✔]
  3056. 570.19 s [doctest] works with foreign imports [✔]
  3057. 570.24 s [doctest] works for rewrite rules [✔]
  3058. 570.28 s [doctest] works for rewrite rules with type signatures [✔]
  3059. 570.35 s [doctest] strips CR from dos line endings [✔]
  3060. 570.41 s [doctest] works with a module that splices in an expression from an other module [✔]
  3061. 570.48 s [doctest] works for type families and GHC 7.6.1 [✔]
  3062. 570.48 s [doctest] Info
  3063. 570.48 s [doctest] formatInfo
  3064. 570.56 s [doctest] formats --info output [✔]
  3065. 570.56 s [doctest] Interpreter
  3066. 570.56 s [doctest] interpreterSupported
  3067. 570.66 s [doctest] indicates whether GHCi is supported on current platform [✔]
  3068. 570.66 s [doctest] ghcInfo
  3069. 570.77 s [doctest] includes "Have interpreter" [✔]
  3070. 570.77 s [doctest] safeEval
  3071. 571.23 s [doctest] evaluates an expression [✔]
  3072. 571.68 s [doctest] returns Left on unterminated multiline command [✔]
  3073. 571.68 s [doctest] filterExpression
  3074. 571.68 s [doctest] removes :set -XTemplateHaskell [✔]
  3075. 571.68 s [doctest] filters -XTemplateHaskell [✔]
  3076. 571.68 s [doctest] leaves :set-statement that do not set -XTemplateHaskell alone [✔]
  3077. 571.68 s [doctest] Language.Haskell.GhciWrapper
  3078. 571.68 s [doctest] evalEcho
  3079. 572.04 s [doctest] prints result to stdout [✔]
  3080. 572.04 s [doctest] evalWith
  3081. 572.04 s [doctest] with PreserveIt
  3082. 572.49 s [doctest] preserves it [✔]
  3083. 572.49 s [doctest] eval
  3084. 572.88 s [doctest] shows literals [✔]
  3085. 573.29 s [doctest] shows string literals containing Unicode [✔]
  3086. 573.78 s [doctest] evaluates simple expressions [✔]
  3087. 574.22 s [doctest] supports let bindings [✔]
  3088. 574.73 s [doctest] allows import statements [✔]
  3089. 575.14 s [doctest] captures stdout [✔]
  3090. 575.56 s [doctest] captures stdout (Unicode) [✔]
  3091. 575.89 s [doctest] captures stdout (empty line) [✔]
  3092. 576.25 s [doctest] captures stdout (multiple lines) [✔]
  3093. 576.68 s [doctest] captures stderr [✔]
  3094. 577.13 s [doctest] captures stderr (Unicode) [✔]
  3095. 577.59 s [doctest] shows exceptions [✔]
  3096. 578.07 s [doctest] shows exceptions (ExitCode) [✔]
  3097. 578.58 s [doctest] gives an error message for identifiers that are not in scope [✔]
  3098. 578.58 s [doctest] when configVerbose is True
  3099. 579.02 s [doctest] prints prompt [✔]
  3100. 579.02 s [doctest] with -XOverloadedStrings, -Wall and -Werror
  3101. 579.43 s [doctest] does not fail on marker expression (bug fix) [✔]
  3102. 579.43 s [doctest] with NoImplicitPrelude
  3103. 579.87 s [doctest] works [✔]
  3104. 579.87 s [doctest] with a strange String type
  3105. 580.31 s [doctest] works [✔]
  3106. 580.31 s [doctest] Location
  3107. 580.31 s [doctest] toLocation
  3108. 580.39 s [doctest] works for a regular SrcSpan [✔]
  3109. 580.39 s [doctest] works for a single-line SrcSpan [✔]
  3110. 580.39 s [doctest] works for a SrcSpan that corresponds to single point [✔]
  3111. 580.39 s [doctest] works for a bad SrcSpan [✔]
  3112. 580.39 s [doctest] works for a SrcLoc with bad locations [✔]
  3113. 580.39 s [doctest] enumerate
  3114. 580.39 s [doctest] replicates UnhelpfulLocation [✔]
  3115. 580.40 s [doctest] enumerates Location [✔]
  3116. 580.40 s [doctest] Main
  3117. 580.40 s [doctest] doctest
  3118. 581.04 s [doctest] testSimple [✔]
  3119. 581.72 s [doctest] it-variable [✔]
  3120. 582.33 s [doctest] it-variable in $setup [✔]
  3121. 583.02 s [doctest] failing [✔]
  3122. 583.74 s [doctest] skips subsequent examples from the same group if an example fails [✔]
  3123. 583.74 s [doctest] without --fail-fast
  3124. 584.50 s [doctest] continuous even if some tests fail [✔]
  3125. 584.50 s [doctest] with --fail-fast
  3126. 585.11 s [doctest] stops after the first failure [✔]
  3127. 585.71 s [doctest] stops after failures in $setup [✔]
  3128. 587.07 s [doctest] testImport [✔]
  3129. 587.96 s [doctest] testCommentLocation [✔]
  3130. 588.64 s [doctest] testPutStr [✔]
  3131. 589.22 s [doctest] fails on multi-line expressions, introduced with :{ [✔]
  3132. 589.99 s [doctest] testBlankline [✔]
  3133. 590.62 s [doctest] examples from the same Haddock comment share the same scope [✔]
  3134. 591.26 s [doctest] testDocumentationForArguments [✔]
  3135. 591.94 s [doctest] template-haskell [✔]
  3136. 592.54 s [doctest] handles source files with CRLF line endings [✔]
  3137. 593.19 s [doctest] runs $setup before each test group [✔]
  3138. 593.74 s [doctest] skips subsequent tests from a module, if $setup fails [✔]
  3139. 594.38 s [doctest] ignores trailing whitespace when matching test output [✔]
  3140. 594.39 s [doctest] doctest as a runner for QuickCheck properties
  3141. 595.12 s [doctest] runs a boolean property [✔]
  3142. 595.81 s [doctest] runs an explicitly quantified property [✔]
  3143. 596.37 s [doctest] runs an implicitly quantified property [✔]
  3144. 597.10 s [doctest] reports a failing property [✔]
  3145. 597.83 s [doctest] runs a boolean property with an explicit type signature [✔]
  3146. 598.84 s [doctest] runs $setup before each property [✔]
  3147. 598.84 s [doctest] doctest (regression tests)
  3148. 600.90 s [doctest] bugfixWorkingDirectory [✔]
  3149. 601.77 s [doctest] bugfixOutputToStdErr [✔]
  3150. 602.65 s [doctest] bugfixImportHierarchical [✔]
  3151. 603.52 s [doctest] bugfixMultipleModules [✔]
  3152. 605.02 s [doctest] testCPP [✔]
  3153. 605.89 s [doctest] template-haskell-bugfix [✔]
  3154. 606.33 s [doctest] doesn't clash with user bindings of stdout/stderr [✔]
  3155. 606.81 s [doctest] doesn't get confused by doctests using System.IO imports [✔]
  3156. 606.82 s [doctest] Options
  3157. 606.82 s [doctest] parseOptions
  3158. 606.82 s [doctest] strips --optghc [✔]
  3159. 606.83 s [doctest] strips --optghc= [✔]
  3160. 606.83 s [doctest] with ghc options that are not valid with --interactive
  3161. 606.90 s [doctest] returns ProxyToGhc [✔]
  3162. 606.90 s [doctest] +++ OK, passed 100 tests.
  3163. 606.90 s [doctest] with --interactive
  3164. 606.90 s [doctest] disables magic mode [✔]
  3165. 606.90 s [doctest] filters out --interactive [✔]
  3166. 606.90 s [doctest] accepts --fast [✔]
  3167. 606.90 s [doctest] --no-magic
  3168. 606.90 s [doctest] without --no-magic
  3169. 606.90 s [doctest] enables magic mode [✔]
  3170. 606.90 s [doctest] with --no-magic
  3171. 606.90 s [doctest] disables magic mode [✔]
  3172. 606.90 s [doctest] --fast
  3173. 606.90 s [doctest] without --fast
  3174. 606.90 s [doctest] disables fast mode [✔]
  3175. 606.90 s [doctest] with --fast
  3176. 606.90 s [doctest] enables fast mode [✔]
  3177. 606.90 s [doctest] --preserve-it
  3178. 606.90 s [doctest] without --preserve-it
  3179. 606.90 s [doctest] does not preserve the `it` variable [✔]
  3180. 606.90 s [doctest] with --preserve-it
  3181. 606.90 s [doctest] preserves the `it` variable [✔]
  3182. 606.90 s [doctest] --fail-fast
  3183. 606.90 s [doctest] without --fail-fast
  3184. 606.90 s [doctest] disables fail-fast mode [✔]
  3185. 606.90 s [doctest] with --fail-fast
  3186. 606.90 s [doctest] enables fail-fast mode [✔]
  3187. 606.90 s [doctest] with --help
  3188. 606.90 s [doctest] outputs usage information [✔]
  3189. 606.90 s [doctest] with --version
  3190. 606.90 s [doctest] outputs version information [✔]
  3191. 606.90 s [doctest] with --info
  3192. 606.99 s [doctest] outputs machine readable version information [✔]
  3193. 606.99 s [doctest] --verbose
  3194. 606.99 s [doctest] without --verbose
  3195. 606.99 s [doctest] is not verbose by default [✔]
  3196. 606.99 s [doctest] with --verbose
  3197. 606.99 s [doctest] parses verbose option [✔]
  3198. 606.99 s [doctest] PackageDBs
  3199. 606.99 s [doctest] getPackageDBsFromEnv
  3200. 607.00 s [doctest] uses global and user when no env used [✔]
  3201. 607.00 s [doctest] respects GHC_PACKAGE_PATH [✔]
  3202. 607.00 s [doctest] Parse
  3203. 607.00 s [doctest] extractDocTests
  3204. 607.01 s [doctest] extracts properties from a module [✔]
  3205. 607.07 s [doctest] extracts examples from a module [✔]
  3206. 607.12 s [doctest] extracts examples from documentation for non-exported names [✔]
  3207. 607.17 s [doctest] extracts multiple examples from a module [✔]
  3208. 607.23 s [doctest] returns an empty list, if documentation contains no examples [✔]
  3209. 607.29 s [doctest] sets setup code to Nothing, if it does not contain any tests [✔]
  3210. 607.35 s [doctest] keeps modules that only contain setup code [✔]
  3211. 607.35 s [doctest] parseInteractions (an internal function)
  3212. 607.35 s [doctest] parses an interaction [✔]
  3213. 607.35 s [doctest] drops whitespace as appropriate [✔]
  3214. 607.35 s [doctest] parses an interaction without a result [✔]
  3215. 607.35 s [doctest] works with a complex example [✔]
  3216. 607.35 s [doctest] attaches location information to parsed interactions [✔]
  3217. 607.35 s [doctest] basic multiline [✔]
  3218. 607.35 s [doctest] multiline align output [✔]
  3219. 607.35 s [doctest] multiline align output with >>> [✔]
  3220. 607.35 s [doctest] parses wild cards lines [✔]
  3221. 607.35 s [doctest] parses wild card chunks [✔]
  3222. 607.35 s [doctest] parseProperties (an internal function)
  3223. 607.35 s [doctest] parses a property [✔]
  3224. 607.35 s [doctest] mkLineChunks (an internal function)
  3225. 607.35 s [doctest] replaces ellipsis with WildCardChunks [✔]
  3226. 607.35 s [doctest] doesn't replace fewer than 3 consecutive dots [✔]
  3227. 607.35 s [doctest] handles leading and trailing dots [✔]
  3228. 607.35 s [doctest] handles leading and trailing ellipsis [✔]
  3229. 607.35 s [doctest] Property
  3230. 607.35 s [doctest] runProperty
  3231. 607.83 s [doctest] reports a failing property [✔]
  3232. 608.30 s [doctest] runs a Bool property [✔]
  3233. 608.78 s [doctest] runs a Bool property with an explicit type signature [✔]
  3234. 609.21 s [doctest] runs an implicitly quantified property [✔]
  3235. 609.60 s [doctest] runs an implicitly quantified property even with GHC 7.4 [✔]
  3236. 609.98 s [doctest] runs an explicitly quantified property [✔]
  3237. 610.41 s [doctest] allows to mix implicit and explicit quantification [✔]
  3238. 610.86 s [doctest] reports the value for which a property fails [✔]
  3239. 611.22 s [doctest] reports the values for which a property that takes multiple arguments fails [✔]
  3240. 611.59 s [doctest] defaults ambiguous type variables to Integer [✔]
  3241. 611.59 s [doctest] freeVariables
  3242. 611.89 s [doctest] finds a free variables in a term [✔]
  3243. 612.26 s [doctest] ignores duplicates [✔]
  3244. 612.64 s [doctest] works for terms with multiple names [✔]
  3245. 613.01 s [doctest] works for names that contain a prime [✔]
  3246. 613.32 s [doctest] works for names that are similar to other names that are in scope [✔]
  3247. 613.32 s [doctest] parseNotInScope
  3248. 613.32 s [doctest] when error message was produced by GHC 7.4.1
  3249. 613.32 s [doctest] extracts a variable name of variable that is not in scope from an error message [✔]
  3250. 613.32 s [doctest] ignores duplicates [✔]
  3251. 613.32 s [doctest] works for variable names that contain a prime [✔]
  3252. 613.32 s [doctest] works for error messages with suggestions [✔]
  3253. 613.32 s [doctest] when error message was produced by GHC 8.0.1
  3254. 613.32 s [doctest] extracts a variable name of variable that is not in scope from an error message [✔]
  3255. 613.32 s [doctest] ignores duplicates [✔]
  3256. 613.32 s [doctest] works for variable names that contain a prime [✔]
  3257. 613.32 s [doctest] works for error messages with suggestions [✔]
  3258. 613.32 s [doctest] Run
  3259. 613.32 s [doctest] doctest
  3260. 613.80 s [doctest] exits with ExitFailure if at least one test case fails [✔]
  3261. 613.80 s [doctest] prints help on --help [✔]
  3262. 613.80 s [doctest] prints version on --version [✔]
  3263. 614.22 s [doctest] accepts arbitrary GHC options [✔]
  3264. 614.78 s [doctest] accepts GHC options with --optghc [✔]
  3265. 615.21 s [doctest] prints a deprecation message for --optghc [✔]
  3266. 615.30 s [doctest] prints error message on invalid option [✔]
  3267. 615.78 s [doctest] interprets GHC response files [✔]
  3268. 616.29 s [doctest] prints verbose description of a specification [✔]
  3269. 616.83 s [doctest] prints verbose description of a property [✔]
  3270. 617.22 s [doctest] prints verbose error [✔]
  3271. 617.68 s [doctest] can deal with potentially problematic GHC options [✔]
  3272. 617.68 s [doctest] doctestWithResult
  3273. 617.68 s [doctest] on parse error
  3274. 617.76 s [doctest] aborts with (ExitFailure 1) [✔]
  3275. 617.82 s [doctest] prints a useful error message [✔]
  3276. 617.82 s [doctest] expandDirs
  3277. 617.82 s [doctest] expands a directory [✔]
  3278. 617.82 s [doctest] ignores files [✔]
  3279. 617.82 s [doctest] ignores random things [✔]
  3280. 617.82 s [doctest] Runner
  3281. 617.82 s [doctest] report
  3282. 617.82 s [doctest] when mode is interactive
  3283. 617.82 s [doctest] writes to stderr [✔]
  3284. 617.82 s [doctest] when mode is non-interactive
  3285. 617.82 s [doctest] writes to stderr [✔]
  3286. 617.82 s [doctest] report_
  3287. 617.82 s [doctest] when mode is interactive
  3288. 617.82 s [doctest] writes transient output to stderr [✔]
  3289. 617.82 s [doctest] when mode is non-interactive
  3290. 617.82 s [doctest] is ignored [✔]
  3291. 617.82 s [doctest] Runner.Example
  3292. 617.82 s [doctest] mkResult
  3293. 617.91 s [doctest] returns Equal when output matches [✔]
  3294. 617.91 s [doctest] +++ OK, passed 100 tests.
  3295. 617.91 s [doctest] ignores trailing whitespace [✔]
  3296. 617.91 s [doctest] with WildCardLine
  3297. 617.91 s [doctest] matches zero lines [✔]
  3298. 617.91 s [doctest] matches first zero line [✔]
  3299. 617.91 s [doctest] matches final zero line [✔]
  3300. 617.91 s [doctest] matches an arbitrary number of lines [✔]
  3301. 617.91 s [doctest] matches an arbitrary number of lines (quickcheck) [✔]
  3302. 617.91 s [doctest] +++ OK, passed 100 tests.
  3303. 617.91 s [doctest] with WildCardChunk
  3304. 617.91 s [doctest] matches an arbitrary line chunk [✔]
  3305. 617.91 s [doctest] matches an arbitrary line chunk at end [✔]
  3306. 617.91 s [doctest] does not match at end [✔]
  3307. 617.91 s [doctest] does not match at start [✔]
  3308. 617.91 s [doctest] when output does not match
  3309. 617.91 s [doctest] constructs failure message [✔]
  3310. 617.91 s [doctest] constructs failure message for multi-line output [✔]
  3311. 617.91 s [doctest] when any output line contains "unsafe" characters
  3312. 617.91 s [doctest] uses show to format output lines [✔]
  3313. 617.91 s [doctest] insert caret after last matching character on different lengths [✔]
  3314. 617.91 s [doctest] insert caret after mismatching line for multi-line output [✔]
  3315. 617.91 s [doctest] insert caret after mismatching line with the longest match for multi-line wildcard pattern [✔]
  3316. 617.91 s [doctest] insert caret after longest match for wildcard [✔]
  3317. 617.91 s [doctest] show expanded pattern for long matches [✔]
  3318. 617.91 s [doctest] Util
  3319. 617.91 s [doctest] convertDosLineEndings
  3320. 617.91 s [doctest] converts CRLF to LF [✔]
  3321. 617.91 s [doctest] strips a trailing CR [✔]
  3322. 617.91 s [doctest] takeWhileEnd
  3323. 617.91 s [doctest] returns the longest suffix of elements that satisfy a given predicate [✔]
  3324. 617.91 s [doctest]
  3325. 617.91 s [doctest] Finished in 48.6566 seconds
  3326. 617.91 s [doctest] 198 examples, 0 failures
  3327. 617.94 s [doctest] Test suite spec: PASS
  3328. 617.94 s [doctest] Test suite logged to: dist/test/doctest-0.24.2-spec.log
  3329. 617.94 s [doctest] 1 of 1 test suites (1 of 1 test cases) passed.
  3330. 617.96 s [doctest] checkPhase completed in 49 seconds
  3331. 617.96 s [doctest] Phase: haddockPhase
  3332. 618.20 s [doctest] Preprocessing library for doctest-0.24.2...
  3333. 618.21 s [doctest] Running Haddock on library for doctest-0.24.2...
  3334. 619.04 s [doctest] [ 1 of 26] Compiling Imports ( src/Imports.hs, nothing )
  3335. 619.14 s [doctest] [ 2 of 26] Compiling GhcUtil ( src/GhcUtil.hs, nothing )
  3336. 619.62 s [doctest] [ 3 of 26] Compiling Cabal.ReplOptions ( src/Cabal/ReplOptions.hs, nothing )
  3337. 619.68 s [doctest] [ 4 of 26] Compiling Cabal.Paths ( src/Cabal/Paths.hs, nothing )
  3338. 619.71 s [doctest] [ 5 of 26] Compiling Cabal.Options ( src/Cabal/Options.hs, nothing )
  3339. 619.73 s [doctest] [ 6 of 26] Compiling Language.Haskell.GhciWrapper ( src/Language/Haskell/GhciWrapper.hs, nothing )
  3340. 619.76 s [doctest] [ 7 of 26] Compiling Interpreter ( src/Interpreter.hs, nothing )
  3341. 619.78 s [doctest] [ 8 of 26] Compiling Location ( src/Location.hs, nothing )
  3342. 619.81 s [doctest] [ 9 of 26] Compiling PackageDBs ( src/PackageDBs.hs, nothing )
  3343. 619.82 s [doctest] [10 of 26] Compiling Paths_doctest ( dist/build/autogen/Paths_doctest.hs, nothing )
  3344. 619.98 s [doctest] [11 of 26] Compiling Info ( src/Info.hs, nothing )
  3345. 619.99 s [doctest] [12 of 26] Compiling Options ( src/Options.hs, nothing )
  3346. 620.04 s [doctest] [13 of 26] Compiling Cabal ( src/Cabal.hs, nothing )
  3347. 620.11 s [doctest] [14 of 26] Compiling Test.DocTest.Internal.Cabal ( src/Test/DocTest/Internal/Cabal.hs, nothing )
  3348. 620.12 s [doctest] [15 of 26] Compiling Test.DocTest.Internal.Location ( src/Test/DocTest/Internal/Location.hs, nothing )
  3349. 620.12 s [doctest] [16 of 26] Compiling Util ( src/Util.hs, nothing )
  3350. 620.12 s [doctest] [17 of 26] Compiling Extract ( src/Extract.hs, nothing )
  3351. 620.30 s [doctest] [18 of 26] Compiling Test.DocTest.Internal.Extract ( src/Test/DocTest/Internal/Extract.hs, nothing )
  3352. 620.31 s [doctest] [19 of 26] Compiling Parse ( src/Parse.hs, nothing )
  3353. 620.35 s [doctest] [20 of 26] Compiling Test.DocTest.Internal.Parse ( src/Test/DocTest/Internal/Parse.hs, nothing )
  3354. 620.35 s [doctest] [21 of 26] Compiling Runner.Example ( src/Runner/Example.hs, nothing )
  3355. 620.40 s [doctest] [22 of 26] Compiling Property ( src/Property.hs, nothing )
  3356. 620.42 s [doctest] [23 of 26] Compiling Runner ( src/Runner.hs, nothing )
  3357. 620.49 s [doctest] [24 of 26] Compiling Run ( src/Run.hs, nothing )
  3358. 620.53 s [doctest] [25 of 26] Compiling Test.DocTest.Internal.Run ( src/Test/DocTest/Internal/Run.hs, nothing )
  3359. 620.53 s [doctest] [26 of 26] Compiling Test.DocTest ( src/Test/DocTest.hs, nothing )
  3360. 620.53 s [doctest] Haddock coverage:
  3361. 620.53 s [doctest] Warning: Imports: Could not find documentation for exported module: Imports
  3362. 620.54 s [doctest] 0% ( 0 / 2) in 'Test.DocTest.Internal.Cabal'
  3363. 620.54 s [doctest] Missing documentation for:
  3364. 620.54 s [doctest] Module header
  3365. 620.54 s [doctest] doctest (src/Test/DocTest/Internal/Cabal.hs:10)
  3366. 620.54 s [doctest] 88% ( 8 / 9) in 'Test.DocTest.Internal.Location'
  3367. 620.54 s [doctest] Missing documentation for:
  3368. 620.54 s [doctest] Module header
  3369. 620.54 s [doctest] Warning: 'SomeException' is ambiguous. It is defined
  3370. 620.54 s [doctest] * in ‘GHC.Internal.Exception.Type’
  3371. 620.54 s [doctest] * in ‘GHC.Internal.Exception.Type’
  3372. 620.54 s [doctest] You may be able to disambiguate the identifier by qualifying it or
  3373. 620.54 s [doctest] by specifying the type/value namespace explicitly.
  3374. 620.54 s [doctest] Defaulting to the one defined in ‘GHC.Internal.Exception.Type’
  3375. 620.54 s [doctest] 66% ( 2 / 3) in 'Test.DocTest.Internal.Extract'
  3376. 620.54 s [doctest] Missing documentation for:
  3377. 620.54 s [doctest] Module header
  3378. 620.54 s [doctest] 22% ( 2 / 9) in 'Test.DocTest.Internal.Parse'
  3379. 620.54 s [doctest] Missing documentation for:
  3380. 620.54 s [doctest] Module header
  3381. 620.54 s [doctest] DocTest (src/Parse.hs:29)
  3382. 620.54 s [doctest] Expression (src/Parse.hs:44)
  3383. 620.54 s [doctest] ExpectedResult (src/Parse.hs:45)
  3384. 620.54 s [doctest] ExpectedLine (src/Parse.hs:38)
  3385. 620.54 s [doctest] LineChunk (src/Parse.hs:32)
  3386. 620.54 s [doctest] parseModules (src/Parse.hs:60)
  3387. 620.54 s [doctest] Warning: 'report_' is out of scope.
  3388. 620.54 s [doctest] If you qualify the identifier, haddock can try to link it anyway.
  3389. 620.54 s [doctest] 15% ( 2 / 13) in 'Test.DocTest.Internal.Run'
  3390. 620.54 s [doctest] Missing documentation for:
  3391. 620.54 s [doctest] Module header
  3392. 620.54 s [doctest] Result (src/Run.hs:139)
  3393. 620.54 s [doctest] Config (src/Options.hs:58)
  3394. 620.54 s [doctest] isSuccess (src/Runner.hs:55)
  3395. 620.54 s [doctest] defaultConfig (src/Options.hs:68)
  3396. 620.54 s [doctest] doctestWithRepl (src/Run.hs:67)
  3397. 620.54 s [doctest] doctestWith (src/Run.hs:137)
  3398. 620.54 s [doctest] formatSummary (src/Runner.hs:58)
  3399. 620.54 s [doctest] evaluateResult (src/Run.hs:142)
  3400. 620.54 s [doctest] doctestWithResult (src/Run.hs:145)
  3401. 620.54 s [doctest] runDocTests (src/Run.hs:155)
  3402. 620.54 s [doctest] 50% ( 1 / 2) in 'Test.DocTest'
  3403. 620.54 s [doctest] Missing documentation for:
  3404. 620.54 s [doctest] Module header
  3405. 639.02 s [doctest] Documentation created: dist/doc/html/doctest/,
  3406. 639.02 s [doctest] dist/doc/html/doctest/doctest.txt
  3407. 639.16 s [doctest] Preprocessing executable 'doctest' for doctest-0.24.2...
  3408. 639.16 s [doctest] Preprocessing test suite 'spec' for doctest-0.24.2...
  3409. 639.20 s [doctest] Phase: installPhase
  3410. 639.39 s [doctest] Installing library in /nix/store/zmwlk8gqk89i9b1qlifd7b9wywswg74r-doctest-0.24.2/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-1e2a/doctest-0.24.2-H4FgSSwrzQD6JTD7tYQanP
  3411. 639.58 s [doctest] Installing executable doctest in /nix/store/zmwlk8gqk89i9b1qlifd7b9wywswg74r-doctest-0.24.2/bin
  3412. 639.58 s [doctest] Warning: The directory
  3413. 639.58 s [doctest] /nix/store/zmwlk8gqk89i9b1qlifd7b9wywswg74r-doctest-0.24.2/bin is not in the
  3414. 639.58 s [doctest] system search path.
  3415. 641.14 s [doctest] Phase: fixupPhase
  3416. 641.18 s [doctest] shrinking RPATHs of ELF executables and libraries in /nix/store/zmwlk8gqk89i9b1qlifd7b9wywswg74r-doctest-0.24.2
  3417. 641.18 s [doctest] shrinking /nix/store/zmwlk8gqk89i9b1qlifd7b9wywswg74r-doctest-0.24.2/bin/doctest
  3418. 641.67 s [doctest] shrinking /nix/store/zmwlk8gqk89i9b1qlifd7b9wywswg74r-doctest-0.24.2/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-1e2a/libHSdoctest-0.24.2-H4FgSSwrzQD6JTD7tYQanP-ghc9.10.2.so
  3419. 641.69 s [doctest] checking for references to /build/ in /nix/store/zmwlk8gqk89i9b1qlifd7b9wywswg74r-doctest-0.24.2...
  3420. 641.86 s [doctest] patching script interpreter paths in /nix/store/zmwlk8gqk89i9b1qlifd7b9wywswg74r-doctest-0.24.2
  3421. 641.87 s [doctest] stripping (with command strip and flags -S -p) in /nix/store/zmwlk8gqk89i9b1qlifd7b9wywswg74r-doctest-0.24.2/lib /nix/store/zmwlk8gqk89i9b1qlifd7b9wywswg74r-doctest-0.24.2/bin
  3422. 642.47 s [doctest] shrinking RPATHs of ELF executables and libraries in /nix/store/4fvfydn6fvvk22rbz2qx2blkvlnagnn2-doctest-0.24.2-doc
  3423. 642.49 s [doctest] checking for references to /build/ in /nix/store/4fvfydn6fvvk22rbz2qx2blkvlnagnn2-doctest-0.24.2-doc...
  3424. 642.54 s [doctest] patching script interpreter paths in /nix/store/4fvfydn6fvvk22rbz2qx2blkvlnagnn2-doctest-0.24.2-doc
  3425. 642.99 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/4fvfydn6fvvk22rbz2qx2blkvlnagnn2-doctest-0.24.2-doc /nix/store/zmwlk8gqk89i9b1qlifd7b9wywswg74r-doctest-0.24.2
  3426. 647.89 s [post-build-hook] Pushing 2 paths (82 are already present) using zstd to cache sellout ⏳
  3427. 647.89 s [post-build-hook]
  3428. 648.84 s [post-build-hook] Pushing /nix/store/zmwlk8gqk89i9b1qlifd7b9wywswg74r-doctest-0.24.2 (70.86 MiB)
  3429. 648.86 s [post-build-hook] Pushing /nix/store/4fvfydn6fvvk22rbz2qx2blkvlnagnn2-doctest-0.24.2-doc (1.52 MiB)
  3430. 654.36 s [post-build-hook]
  3431. 654.36 s [post-build-hook] All done.
  3432. 654.53 s [post-build-hook] Uploading to the NixCI cache: /nix/store/4fvfydn6fvvk22rbz2qx2blkvlnagnn2-doctest-0.24.2-doc /nix/store/zmwlk8gqk89i9b1qlifd7b9wywswg74r-doctest-0.24.2
  3433. 654.65 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  3434. 654.94 s [post-build-hook] copying 2 paths...
  3435. 654.94 s [post-build-hook] copying path '/nix/store/4fvfydn6fvvk22rbz2qx2blkvlnagnn2-doctest-0.24.2-doc' to 'https://cache.nix-ci.com'...
  3436. 655.46 s [post-build-hook] copying path '/nix/store/zmwlk8gqk89i9b1qlifd7b9wywswg74r-doctest-0.24.2' to 'https://cache.nix-ci.com'...
  3437. 695.95 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  3438. 696.14 s [post-build-hook] copying 1 paths...
  3439. 696.15 s [post-build-hook] copying path '/nix/store/kq6cyl50j42j66jv35lam2c7142bpc29-doctest-0.24.2.drv' to 'https://cache.nix-ci.com'...
  3440. 696.30 s Progress: 5 of 22 built, 177 of 177 downloaded from cache
  3441. 696.35 s Building duoids
  3442. 696.39 s Building vector
  3443. 696.46 s [duoids] Phase: setupCompilerEnvironmentPhase
  3444. 696.46 s [duoids] Build with /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2.
  3445. 696.52 s [vector] Phase: setupCompilerEnvironmentPhase
  3446. 696.53 s [vector] Build with /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2.
  3447. 696.66 s [duoids] Phase: unpackPhase
  3448. 696.66 s [duoids] unpacking source archive /nix/store/hwhxlh4aq4w3fvrlk65js3cdkm3in22k-5y8mzl3igbd7qyrpb010fqiak50k5q01-source/./core
  3449. 696.67 s [duoids] source root is core
  3450. 696.70 s [duoids] Phase: patchPhase
  3451. 696.71 s [duoids] Phase: compileBuildDriverPhase
  3452. 696.72 s [duoids] setupCompileFlags: -package-db=/build/tmp.pdxOWm1FcJ/setup-package.conf.d -threaded
  3453. 696.79 s [vector] Phase: unpackPhase
  3454. 696.79 s [vector] unpacking source archive /nix/store/ysi2m95adzhn3nmggwppnxvmps3a93x3-vector-0.13.2.0.tar.gz
  3455. 696.80 s [vector] source root is vector-0.13.2.0
  3456. 696.81 s [vector] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "vector-0.13.2.0/vector.cabal"
  3457. 696.81 s [vector] Phase: patchPhase
  3458. 696.82 s [vector] Replace Cabal file with edited version from mirror://hackage/vector-0.13.2.0/revision/2.cabal.
  3459. 696.82 s [vector] Run jailbreak-cabal to lift version restrictions on build inputs.
  3460. 696.83 s [duoids] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.pdxOWm1FcJ/Main.o )
  3461. 696.84 s [vector] Phase: compileBuildDriverPhase
  3462. 696.84 s [vector] setupCompileFlags: -package-db=/build/tmp.D34luVyEGW/setup-package.conf.d -threaded
  3463. 696.88 s [duoids] [2 of 2] Linking Setup
  3464. 696.95 s [vector] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.D34luVyEGW/Main.o )
  3465. 697.00 s [vector] [2 of 2] Linking Setup
  3466. 698.66 s [duoids] Phase: updateAutotoolsGnuConfigScriptsPhase
  3467. 698.68 s [duoids] Phase: configurePhase
  3468. 698.69 s [duoids] configureFlags: --verbose --prefix=/nix/store/5wzfl59csy20l6v8wfrh52x0i22jmrp4-duoids-0.0.1.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/4x74slj59wml5q8zal7h1f394ylgf6ca-duoids-0.0.1.0-doc/share/doc/duoids-0.0.1.0 --with-gcc=gcc --package-db=/build/tmp.pdxOWm1FcJ/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/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/lib
  3469. 698.71 s [duoids] Using Parsec parser
  3470. 698.71 s [duoids] Configuring duoids-0.0.1.0...
  3471. 699.00 s [vector] Phase: updateAutotoolsGnuConfigScriptsPhase
  3472. 699.02 s [vector] Phase: configurePhase
  3473. 699.03 s [vector] configureFlags: --verbose --prefix=/nix/store/bbyrw13yswg4p9yknixq0criplfzk75i-vector-0.13.2.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --with-gcc=gcc --package-db=/build/tmp.D34luVyEGW/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/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/lib
  3474. 699.05 s [vector] Using Parsec parser
  3475. 699.05 s [vector] Configuring vector-0.13.2.0...
  3476. 699.27 s [duoids] Flags chosen: lint=False, noisy-deprecations=True
  3477. 699.58 s [vector] Flags chosen: boundschecks=True, internalchecks=False, unsafechecks=False,
  3478. 699.58 s [vector] wall=False
  3479. 699.68 s [duoids] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  3480. 699.68 s [duoids] >=4.21.0 && <4.22 || >=4.22.0 && <4.23: using base-4.20.1.0
  3481. 699.68 s [duoids] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  3482. 699.68 s [duoids] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  3483. 699.68 s [duoids] >=4.21.0 && <4.22 || >=4.22.0 && <4.23: using base-4.20.1.0
  3484. 699.68 s [duoids] Dependency doctest >=0.21.1 && <0.22 || >=0.22.6 && <0.23 || >=0.24.0 &&
  3485. 699.68 s [duoids] <0.25: using doctest-0.24.2
  3486. 699.68 s [duoids] Dependency duoids: using duoids-0.0.1.0
  3487. 699.68 s [duoids] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  3488. 699.68 s [duoids] Source component graph:
  3489. 699.68 s [duoids] component lib
  3490. 699.68 s [duoids] component test:doctests dependency lib
  3491. 699.68 s [duoids] Configured component graph:
  3492. 699.68 s [duoids] component duoids-0.0.1.0-5q4kbrGqhufDoKkeqzXV7l
  3493. 699.68 s [duoids] include base-4.20.1.0-2277
  3494. 699.68 s [duoids] include ghc-compat-plugin-0.1.0.1-5wmISeCFDky4w6cG3d8F6M
  3495. 699.68 s [duoids] component duoids-0.0.1.0-3e9HJWtKZe7XquNIy5Kws-doctests
  3496. 699.68 s [duoids] include base-4.20.1.0-2277
  3497. 699.68 s [duoids] include doctest-0.24.2-H4FgSSwrzQD6JTD7tYQanP
  3498. 699.68 s [duoids] include duoids-0.0.1.0-5q4kbrGqhufDoKkeqzXV7l
  3499. 699.68 s [duoids] include ghc-compat-plugin-0.1.0.1-5wmISeCFDky4w6cG3d8F6M
  3500. 699.68 s [duoids] Linked component graph:
  3501. 699.68 s [duoids] unit duoids-0.0.1.0-5q4kbrGqhufDoKkeqzXV7l
  3502. 699.68 s [duoids] include base-4.20.1.0-2277
  3503. 699.68 s [duoids] include ghc-compat-plugin-0.1.0.1-5wmISeCFDky4w6cG3d8F6M
  3504. 699.68 s [duoids] Control.Duoidal=duoids-0.0.1.0-5q4kbrGqhufDoKkeqzXV7l:Control.Duoidal,Control.Duoidal.Either=duoids-0.0.1.0-5q4kbrGqhufDoKkeqzXV7l:Control.Duoidal.Either,Control.Duoidal.Laws=duoids-0.0.1.0-5q4kbrGqhufDoKkeqzXV7l:Control.Duoidal.Laws,Data.Duoid=duoids-0.0.1.0-5q4kbrGqhufDoKkeqzXV7l:Data.Duoid,Data.Duoid.Laws=duoids-0.0.1.0-5q4kbrGqhufDoKkeqzXV7l:Data.Duoid.Laws
  3505. 699.68 s [duoids] unit duoids-0.0.1.0-3e9HJWtKZe7XquNIy5Kws-doctests
  3506. 699.68 s [duoids] include base-4.20.1.0-2277
  3507. 699.68 s [duoids] include doctest-0.24.2-H4FgSSwrzQD6JTD7tYQanP
  3508. 699.68 s [duoids] include duoids-0.0.1.0-5q4kbrGqhufDoKkeqzXV7l
  3509. 699.68 s [duoids] include ghc-compat-plugin-0.1.0.1-5wmISeCFDky4w6cG3d8F6M
  3510. 699.68 s [duoids] Ready component graph:
  3511. 699.68 s [duoids] definite duoids-0.0.1.0-5q4kbrGqhufDoKkeqzXV7l
  3512. 699.68 s [duoids] depends base-4.20.1.0-2277
  3513. 699.68 s [duoids] depends ghc-compat-plugin-0.1.0.1-5wmISeCFDky4w6cG3d8F6M
  3514. 699.68 s [duoids] definite duoids-0.0.1.0-3e9HJWtKZe7XquNIy5Kws-doctests
  3515. 699.68 s [duoids] depends base-4.20.1.0-2277
  3516. 699.68 s [duoids] depends doctest-0.24.2-H4FgSSwrzQD6JTD7tYQanP
  3517. 699.68 s [duoids] depends duoids-0.0.1.0-5q4kbrGqhufDoKkeqzXV7l
  3518. 699.68 s [duoids] depends ghc-compat-plugin-0.1.0.1-5wmISeCFDky4w6cG3d8F6M
  3519. 699.68 s [duoids] Using Cabal-3.12.1.0 compiled by ghc-9.10
  3520. 699.68 s [duoids] Using compiler: ghc-9.10.2
  3521. 699.68 s [duoids] Using install prefix:
  3522. 699.68 s [duoids] /nix/store/5wzfl59csy20l6v8wfrh52x0i22jmrp4-duoids-0.0.1.0
  3523. 699.68 s [duoids] Executables installed in:
  3524. 699.68 s [duoids] /nix/store/5wzfl59csy20l6v8wfrh52x0i22jmrp4-duoids-0.0.1.0/bin
  3525. 699.68 s [duoids] Libraries installed in:
  3526. 699.68 s [duoids] /nix/store/5wzfl59csy20l6v8wfrh52x0i22jmrp4-duoids-0.0.1.0/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-1e2a/duoids-0.0.1.0-5q4kbrGqhufDoKkeqzXV7l
  3527. 699.68 s [duoids] Dynamic Libraries installed in:
  3528. 699.68 s [duoids] /nix/store/5wzfl59csy20l6v8wfrh52x0i22jmrp4-duoids-0.0.1.0/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-1e2a
  3529. 699.68 s [duoids] Private executables installed in:
  3530. 699.68 s [duoids] /nix/store/5wzfl59csy20l6v8wfrh52x0i22jmrp4-duoids-0.0.1.0/libexec/x86_64-linux-ghc-9.10.2-1e2a/duoids-0.0.1.0
  3531. 699.68 s [duoids] Data files installed in:
  3532. 699.68 s [duoids] /nix/store/5wzfl59csy20l6v8wfrh52x0i22jmrp4-duoids-0.0.1.0/share/x86_64-linux-ghc-9.10.2-1e2a/duoids-0.0.1.0
  3533. 699.68 s [duoids] Documentation installed in:
  3534. 699.68 s [duoids] /nix/store/4x74slj59wml5q8zal7h1f394ylgf6ca-duoids-0.0.1.0-doc/share/doc/duoids-0.0.1.0
  3535. 699.68 s [duoids] Configuration files installed in:
  3536. 699.68 s [duoids] /nix/store/5wzfl59csy20l6v8wfrh52x0i22jmrp4-duoids-0.0.1.0/etc
  3537. 699.68 s [duoids] No alex found
  3538. 699.68 s [duoids] Using ar found on system at:
  3539. 699.68 s [duoids] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
  3540. 699.68 s [duoids] No c2hs found
  3541. 699.68 s [duoids] No cpphs found
  3542. 699.68 s [duoids] Using doctest version 0.24.2 found on system at:
  3543. 699.68 s [duoids] /nix/store/zmwlk8gqk89i9b1qlifd7b9wywswg74r-doctest-0.24.2/bin/doctest
  3544. 699.68 s [duoids] Using gcc version 14.3.0 given by user at:
  3545. 699.68 s [duoids] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
  3546. 699.68 s [duoids] Using ghc version 9.10.2 found on system at:
  3547. 699.68 s [duoids] /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/bin/ghc
  3548. 699.68 s [duoids] Using ghc-pkg version 9.10.2 found on system at:
  3549. 699.68 s [duoids] /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/bin/ghc-pkg-9.10.2
  3550. 699.68 s [duoids] No ghcjs found
  3551. 699.68 s [duoids] No ghcjs-pkg found
  3552. 699.68 s [duoids] No greencard found
  3553. 699.68 s [duoids] Using haddock version 2.31.0 found on system at:
  3554. 699.68 s [duoids] /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/bin/haddock-ghc-9.10.2
  3555. 699.68 s [duoids] No happy found
  3556. 699.68 s [duoids] Using haskell-suite found on system at: haskell-suite-dummy-location
  3557. 699.68 s [duoids] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  3558. 699.68 s [duoids] No hmake found
  3559. 699.68 s [duoids] Using hpc version 0.69 found on system at:
  3560. 699.68 s [duoids] /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/bin/hpc-ghc-9.10.2
  3561. 699.68 s [duoids] Using hsc2hs version 0.68.10 found on system at:
  3562. 699.68 s [duoids] /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/bin/hsc2hs-ghc-9.10.2
  3563. 699.68 s [duoids] Using hscolour version 1.25 found on system at:
  3564. 699.68 s [duoids] /nix/store/kb4afndnwdxxc5ps9k8xv0jzd0a9y8n5-hscolour-1.25/bin/HsColour
  3565. 699.68 s [duoids] No jhc found
  3566. 699.68 s [duoids] Using ld found on system at:
  3567. 699.68 s [duoids] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/ld
  3568. 699.68 s [duoids] No pkg-config found
  3569. 699.68 s [duoids] Using runghc version 9.10.2 found on system at:
  3570. 699.68 s [duoids] /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/bin/runghc-9.10.2
  3571. 699.68 s [duoids] Using strip version 2.44 found on system at:
  3572. 699.68 s [duoids] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
  3573. 699.68 s [duoids] Using tar found on system at:
  3574. 699.68 s [duoids] /nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
  3575. 699.68 s [duoids] No uhc found
  3576. 699.85 s [duoids] Phase: buildPhase
  3577. 699.94 s [duoids] Preprocessing library for duoids-0.0.1.0...
  3578. 699.94 s [duoids] Building library for duoids-0.0.1.0...
  3579. 699.95 s [vector] Dependency base: using base-4.20.1.0
  3580. 699.95 s [vector] Dependency deepseq: using deepseq-1.5.0.0
  3581. 699.95 s [vector] Dependency primitive: using primitive-0.9.1.0
  3582. 699.95 s [vector] Dependency vector-stream: using vector-stream-0.1.0.1
  3583. 699.95 s [vector] Dependency base: using base-4.20.1.0
  3584. 699.95 s [vector] Dependency random: using random-1.2.1.3
  3585. 699.95 s [vector] Dependency tasty: using tasty-1.5.3
  3586. 699.95 s [vector] Dependency vector: using vector-0.13.2.0
  3587. 699.95 s [vector] Dependency QuickCheck: using QuickCheck-2.15.0.1
  3588. 699.95 s [vector] Dependency base: using base-4.20.1.0
  3589. 699.95 s [vector] Dependency base-orphans: using base-orphans-0.9.3
  3590. 699.95 s [vector] Dependency primitive: using primitive-0.9.1.0
  3591. 699.95 s [vector] Dependency random: using random-1.2.1.3
  3592. 699.95 s [vector] Dependency tasty: using tasty-1.5.3
  3593. 699.95 s [vector] Dependency tasty-hunit: using tasty-hunit-0.10.2
  3594. 699.95 s [vector] Dependency tasty-quickcheck: using tasty-quickcheck-0.11.1
  3595. 699.95 s [vector] Dependency template-haskell: using template-haskell-2.22.0.0
  3596. 699.95 s [vector] Dependency transformers: using transformers-0.6.1.1
  3597. 699.95 s [vector] Dependency vector: using vector-0.13.2.0
  3598. 699.95 s [vector] Dependency QuickCheck: using QuickCheck-2.15.0.1
  3599. 699.95 s [vector] Dependency base: using base-4.20.1.0
  3600. 699.95 s [vector] Dependency base-orphans: using base-orphans-0.9.3
  3601. 699.95 s [vector] Dependency primitive: using primitive-0.9.1.0
  3602. 699.95 s [vector] Dependency random: using random-1.2.1.3
  3603. 699.95 s [vector] Dependency tasty: using tasty-1.5.3
  3604. 699.95 s [vector] Dependency tasty-hunit: using tasty-hunit-0.10.2
  3605. 699.95 s [vector] Dependency tasty-quickcheck: using tasty-quickcheck-0.11.1
  3606. 699.95 s [vector] Dependency template-haskell: using template-haskell-2.22.0.0
  3607. 699.95 s [vector] Dependency transformers: using transformers-0.6.1.1
  3608. 699.95 s [vector] Dependency vector: using vector-0.13.2.0
  3609. 699.95 s [vector] Dependency base: using base-4.20.1.0
  3610. 699.95 s [vector] Dependency doctest: using doctest-0.24.2
  3611. 699.96 s [vector] Dependency primitive: using primitive-0.9.1.0
  3612. 699.96 s [vector] Dependency vector: using vector-0.13.2.0
  3613. 699.96 s [vector] Dependency base: using base-4.20.1.0
  3614. 699.96 s [vector] Dependency primitive: using primitive-0.9.1.0
  3615. 699.96 s [vector] Dependency tasty: using tasty-1.5.3
  3616. 699.96 s [vector] Dependency tasty-inspection-testing: using tasty-inspection-testing-0.2.1
  3617. 699.96 s [vector] Dependency vector: using vector-0.13.2.0
  3618. 699.96 s [vector] Source component graph:
  3619. 699.96 s [vector] component lib
  3620. 699.96 s [vector] component lib:benchmarks-O2 dependency lib
  3621. 699.96 s [vector] component test:vector-doctest dependency lib
  3622. 699.96 s [vector] component test:vector-inspection dependency lib
  3623. 699.96 s [vector] component test:vector-tests-O0 dependency lib
  3624. 699.96 s [vector] component test:vector-tests-O2 dependency lib
  3625. 699.96 s [vector] Configured component graph:
  3626. 699.96 s [vector] component vector-0.13.2.0-6XtMmq2Ff9ODcKEbpcqiG
  3627. 699.96 s [vector] include base-4.20.1.0-2277
  3628. 699.96 s [vector] include deepseq-1.5.0.0-f20c
  3629. 699.96 s [vector] include primitive-0.9.1.0-IS0Uswzbk4H38TsU65qNKd
  3630. 699.96 s [vector] include vector-stream-0.1.0.1-GvRGfCA0k7XEVGjh2RjIVV
  3631. 699.96 s [vector] component vector-0.13.2.0-LslaBhDvA2lAi0aUqn9WaN-benchmarks-O2
  3632. 699.96 s [vector] include base-4.20.1.0-2277
  3633. 699.96 s [vector] include random-1.2.1.3-8klJqjF3xhRCzBrgK1uJlY
  3634. 699.96 s [vector] include tasty-1.5.3-6lJNZiPO6mr1IBj9i5AbbV
  3635. 699.96 s [vector] include vector-0.13.2.0-6XtMmq2Ff9ODcKEbpcqiG
  3636. 699.96 s [vector] component vector-0.13.2.0-3nAcEP5l8ZI5b6nfr1JzfV-vector-doctest
  3637. 699.96 s [vector] include base-4.20.1.0-2277
  3638. 699.96 s [vector] include doctest-0.24.2-H4FgSSwrzQD6JTD7tYQanP
  3639. 699.96 s [vector] include primitive-0.9.1.0-IS0Uswzbk4H38TsU65qNKd
  3640. 699.96 s [vector] include vector-0.13.2.0-6XtMmq2Ff9ODcKEbpcqiG
  3641. 699.96 s [vector] component vector-0.13.2.0-1BA2XfA0qbnEytmpE0qJoX-vector-inspection
  3642. 699.96 s [vector] include base-4.20.1.0-2277
  3643. 699.96 s [vector] include primitive-0.9.1.0-IS0Uswzbk4H38TsU65qNKd
  3644. 699.96 s [vector] include tasty-1.5.3-6lJNZiPO6mr1IBj9i5AbbV
  3645. 699.96 s [vector] include tasty-inspection-testing-0.2.1-CQRF1KtEhRP7SB95bPKEFg
  3646. 699.96 s [vector] include vector-0.13.2.0-6XtMmq2Ff9ODcKEbpcqiG
  3647. 699.96 s [vector] component vector-0.13.2.0-FRPpbjJQMIvEqhb341yYii-vector-tests-O0
  3648. 699.96 s [vector] include QuickCheck-2.15.0.1-stTt2BXNne46QxWHi9NgG
  3649. 699.96 s [vector] include base-4.20.1.0-2277
  3650. 699.96 s [vector] include base-orphans-0.9.3-8QLFBKoZYCE78obgAGlSgm
  3651. 699.96 s [vector] include primitive-0.9.1.0-IS0Uswzbk4H38TsU65qNKd
  3652. 699.96 s [vector] include random-1.2.1.3-8klJqjF3xhRCzBrgK1uJlY
  3653. 699.96 s [vector] include tasty-1.5.3-6lJNZiPO6mr1IBj9i5AbbV
  3654. 699.96 s [vector] include tasty-hunit-0.10.2-ApRuPpVuRf9mwaiocwfO9
  3655. 699.96 s [vector] include tasty-quickcheck-0.11.1-DepBLPMHb7DnNfDS8A0JQ
  3656. 699.96 s [vector] include template-haskell-2.22.0.0-2a41
  3657. 699.96 s [vector] include transformers-0.6.1.1-407f
  3658. 699.96 s [vector] include vector-0.13.2.0-6XtMmq2Ff9ODcKEbpcqiG
  3659. 699.96 s [vector] component vector-0.13.2.0-1AOexfr7zf3FI9QHZTJrCr-vector-tests-O2
  3660. 699.96 s [vector] include QuickCheck-2.15.0.1-stTt2BXNne46QxWHi9NgG
  3661. 699.96 s [vector] include base-4.20.1.0-2277
  3662. 699.96 s [vector] include base-orphans-0.9.3-8QLFBKoZYCE78obgAGlSgm
  3663. 699.96 s [vector] include primitive-0.9.1.0-IS0Uswzbk4H38TsU65qNKd
  3664. 699.96 s [vector] include random-1.2.1.3-8klJqjF3xhRCzBrgK1uJlY
  3665. 699.96 s [vector] include tasty-1.5.3-6lJNZiPO6mr1IBj9i5AbbV
  3666. 699.96 s [vector] include tasty-hunit-0.10.2-ApRuPpVuRf9mwaiocwfO9
  3667. 699.96 s [vector] include tasty-quickcheck-0.11.1-DepBLPMHb7DnNfDS8A0JQ
  3668. 699.96 s [vector] include template-haskell-2.22.0.0-2a41
  3669. 699.96 s [vector] include transformers-0.6.1.1-407f
  3670. 699.96 s [vector] include vector-0.13.2.0-6XtMmq2Ff9ODcKEbpcqiG
  3671. 699.96 s [vector] Linked component graph:
  3672. 699.96 s [vector] unit vector-0.13.2.0-6XtMmq2Ff9ODcKEbpcqiG
  3673. 699.96 s [vector] include base-4.20.1.0-2277
  3674. 699.96 s [vector] include deepseq-1.5.0.0-f20c
  3675. 699.96 s [vector] include primitive-0.9.1.0-IS0Uswzbk4H38TsU65qNKd
  3676. 699.96 s [vector] include vector-stream-0.1.0.1-GvRGfCA0k7XEVGjh2RjIVV
  3677. 699.96 s [vector] Data.Vector=vector-0.13.2.0-6XtMmq2Ff9ODcKEbpcqiG:Data.Vector,Data.Vector.Fusion.Bundle=vector-0.13.2.0-6XtMmq2Ff9ODcKEbpcqiG:Data.Vector.Fusion.Bundle,Data.Vector.Fusion.Bundle.Monadic=vector-0.13.2.0-6XtMmq2Ff9ODcKEbpcqiG:Data.Vector.Fusion.Bundle.Monadic,Data.Vector.Fusion.Bundle.Size=vector-0.13.2.0-6XtMmq2Ff9ODcKEbpcqiG:Data.Vector.Fusion.Bundle.Size,Data.Vector.Fusion.Stream.Monadic=vector-0.13.2.0-6XtMmq2Ff9ODcKEbpcqiG:Data.Vector.Fusion.Stream.Monadic,Data.Vector.Fusion.Util=vector-0.13.2.0-6XtMmq2Ff9ODcKEbpcqiG:Data.Vector.Fusion.Util,Data.Vector.Generic=vector-0.13.2.0-6XtMmq2Ff9ODcKEbpcqiG:Data.Vector.Generic,Data.Vector.Generic.Base=vector-0.13.2.0-6XtMmq2Ff9ODcKEbpcqiG:Data.Vector.Generic.Base,Data.Vector.Generic.Mutable=vector-0.13.2.0-6XtMmq2Ff9ODcKEbpcqiG:Data.Vector.Generic.Mutable,Data.Vector.Generic.Mutable.Base=vector-0.13.2.0-6XtMmq2Ff9ODcKEbpcqiG:Data.Vector.Generic.Mutable.Base,Data.Vector.Generic.New=vector-0.13.2.0-6XtMmq2Ff9ODcKEbpcqiG:Data.Vector.Generic.New,Data.Vector.Internal.Check=vector-0.13.2.0-6XtMmq2Ff9ODcKEbpcqiG:Data.Vector.Internal.Check,Data.Vector.Mutable=vector-0.13.2.0-6XtMmq2Ff9ODcKEbpcqiG:Data.Vector.Mutable,Data.Vector.Primitive=vector-0.13.2.0-6XtMmq2Ff9ODcKEbpcqiG:Data.Vector.Primitive,Data.Vector.Primitive.Mutable=vector-0.13.2.0-6XtMmq2Ff9ODcKEbpcqiG:Data.Vector.Primitive.Mutable,Data.Vector.Storable=vector-0.13.2.0-6XtMmq2Ff9ODcKEbpcqiG:Data.Vector.Storable,Data.Vector.Storable.Internal=vector-0.13.2.0-6XtMmq2Ff9ODcKEbpcqiG:Data.Vector.Storable.Internal,Data.Vector.Storable.Mutable=vector-0.13.2.0-6XtMmq2Ff9ODcKEbpcqiG:Data.Vector.Storable.Mutable,Data.Vector.Strict=vector-0.13.2.0-6XtMmq2Ff9ODcKEbpcqiG:Data.Vector.Strict,Data.Vector.Strict.Mutable=vector-0.13.2.0-6XtMmq2Ff9ODcKEbpcqiG:Data.Vector.Strict.Mutable,Data.Vector.Unboxed=vector-0.13.2.0-6XtMmq2Ff9ODcKEbpcqiG:Data.Vector.Unboxed,Data.Vector.Unboxed.Base=vector-0.13.2.0-6XtMmq2Ff9ODcKEbpcqiG:Data.Vector.Unboxed.Base,Data.Vector.Unboxed.Mutable=vector-0.13.2.0-6XtMmq2Ff9ODcKEbpcqiG:Data.Vector.Unboxed.Mutable
  3678. 699.96 s [vector] unit vector-0.13.2.0-LslaBhDvA2lAi0aUqn9WaN-benchmarks-O2
  3679. 699.96 s [vector] include base-4.20.1.0-2277
  3680. 699.96 s [vector] include random-1.2.1.3-8klJqjF3xhRCzBrgK1uJlY
  3681. 699.96 s [vector] include tasty-1.5.3-6lJNZiPO6mr1IBj9i5AbbV
  3682. 699.96 s [vector] include vector-0.13.2.0-6XtMmq2Ff9ODcKEbpcqiG
  3683. 699.99 s [vector] Bench.Vector.Algo.AwShCC=vector-0.13.2.0-LslaBhDvA2lAi0aUqn9WaN-benchmarks-O2:Bench.Vector.Algo.AwShCC,Bench.Vector.Algo.FindIndexR=vector-0.13.2.0-LslaBhDvA2lAi0aUqn9WaN-benchmarks-O2:Bench.Vector.Algo.FindIndexR,Bench.Vector.Algo.HybCC=vector-0.13.2.0-LslaBhDvA2lAi0aUqn9WaN-benchmarks-O2:Bench.Vector.Algo.HybCC,Bench.Vector.Algo.Leaffix=vector-0.13.2.0-LslaBhDvA2lAi0aUqn9WaN-benchmarks-O2:Bench.Vector.Algo.Leaffix,Bench.Vector.Algo.ListRank=vector-0.13.2.0-LslaBhDvA2lAi0aUqn9WaN-benchmarks-O2:Bench.Vector.Algo.ListRank,Bench.Vector.Algo.MutableSet=vector-0.13.2.0-LslaBhDvA2lAi0aUqn9WaN-benchmarks-O2:Bench.Vector.Algo.MutableSet,Bench.Vector.Algo.NextPermutation=vector-0.13.2.0-LslaBhDvA2lAi0aUqn9WaN-benchmarks-O2:Bench.Vector.Algo.NextPermutation,Bench.Vector.Algo.Quickhull=vector-0.13.2.0-LslaBhDvA2lAi0aUqn9WaN-benchmarks-O2:Bench.Vector.Algo.Quickhull,Bench.Vector.Algo.Rootfix=vector-0.13.2.0-LslaBhDvA2lAi0aUqn9WaN-benchmarks-O2:Bench.Vector.Algo.Rootfix,Bench.Vector.Algo.Spectral=vector-0.13.2.0-LslaBhDvA2lAi0aUqn9WaN-benchmarks-O2:Bench.Vector.Algo.Spectral,Bench.Vector.Algo.Tridiag=vector-0.13.2.0-LslaBhDvA2lAi0aUqn9WaN-benchmarks-O2:Bench.Vector.Algo.Tridiag,Bench.Vector.Tasty=vector-0.13.2.0-LslaBhDvA2lAi0aUqn9WaN-benchmarks-O2:Bench.Vector.Tasty,Bench.Vector.TestData.Graph=vector-0.13.2.0-LslaBhDvA2lAi0aUqn9WaN-benchmarks-O2:Bench.Vector.TestData.Graph,Bench.Vector.TestData.ParenTree=vector-0.13.2.0-LslaBhDvA2lAi0aUqn9WaN-benchmarks-O2:Bench.Vector.TestData.ParenTree
  3684. 699.99 s [vector] unit vector-0.13.2.0-3nAcEP5l8ZI5b6nfr1JzfV-vector-doctest
  3685. 699.99 s [vector] include base-4.20.1.0-2277
  3686. 699.99 s [vector] include doctest-0.24.2-H4FgSSwrzQD6JTD7tYQanP
  3687. 699.99 s [vector] include primitive-0.9.1.0-IS0Uswzbk4H38TsU65qNKd
  3688. 699.99 s [vector] include vector-0.13.2.0-6XtMmq2Ff9ODcKEbpcqiG
  3689. 699.99 s [vector] unit vector-0.13.2.0-1BA2XfA0qbnEytmpE0qJoX-vector-inspection
  3690. 699.99 s [vector] include base-4.20.1.0-2277
  3691. 699.99 s [vector] include primitive-0.9.1.0-IS0Uswzbk4H38TsU65qNKd
  3692. 699.99 s [vector] include tasty-1.5.3-6lJNZiPO6mr1IBj9i5AbbV
  3693. 699.99 s [vector] include tasty-inspection-testing-0.2.1-CQRF1KtEhRP7SB95bPKEFg
  3694. 699.99 s [vector] include vector-0.13.2.0-6XtMmq2Ff9ODcKEbpcqiG
  3695. 699.99 s [vector] unit vector-0.13.2.0-FRPpbjJQMIvEqhb341yYii-vector-tests-O0
  3696. 699.99 s [vector] include QuickCheck-2.15.0.1-stTt2BXNne46QxWHi9NgG
  3697. 699.99 s [vector] include base-4.20.1.0-2277
  3698. 699.99 s [vector] include base-orphans-0.9.3-8QLFBKoZYCE78obgAGlSgm
  3699. 699.99 s [vector] include primitive-0.9.1.0-IS0Uswzbk4H38TsU65qNKd
  3700. 699.99 s [vector] include random-1.2.1.3-8klJqjF3xhRCzBrgK1uJlY
  3701. 699.99 s [vector] include tasty-1.5.3-6lJNZiPO6mr1IBj9i5AbbV
  3702. 699.99 s [vector] include tasty-hunit-0.10.2-ApRuPpVuRf9mwaiocwfO9
  3703. 699.99 s [vector] include tasty-quickcheck-0.11.1-DepBLPMHb7DnNfDS8A0JQ
  3704. 699.99 s [vector] include template-haskell-2.22.0.0-2a41
  3705. 699.99 s [vector] include transformers-0.6.1.1-407f
  3706. 699.99 s [vector] include vector-0.13.2.0-6XtMmq2Ff9ODcKEbpcqiG
  3707. 699.99 s [vector] unit vector-0.13.2.0-1AOexfr7zf3FI9QHZTJrCr-vector-tests-O2
  3708. 699.99 s [vector] include QuickCheck-2.15.0.1-stTt2BXNne46QxWHi9NgG
  3709. 699.99 s [vector] include base-4.20.1.0-2277
  3710. 699.99 s [vector] include base-orphans-0.9.3-8QLFBKoZYCE78obgAGlSgm
  3711. 699.99 s [vector] include primitive-0.9.1.0-IS0Uswzbk4H38TsU65qNKd
  3712. 699.99 s [vector] include random-1.2.1.3-8klJqjF3xhRCzBrgK1uJlY
  3713. 699.99 s [vector] include tasty-1.5.3-6lJNZiPO6mr1IBj9i5AbbV
  3714. 699.99 s [vector] include tasty-hunit-0.10.2-ApRuPpVuRf9mwaiocwfO9
  3715. 699.99 s [vector] include tasty-quickcheck-0.11.1-DepBLPMHb7DnNfDS8A0JQ
  3716. 699.99 s [vector] include template-haskell-2.22.0.0-2a41
  3717. 699.99 s [vector] include transformers-0.6.1.1-407f
  3718. 699.99 s [vector] include vector-0.13.2.0-6XtMmq2Ff9ODcKEbpcqiG
  3719. 699.99 s [vector] Ready component graph:
  3720. 699.99 s [vector] definite vector-0.13.2.0-6XtMmq2Ff9ODcKEbpcqiG
  3721. 699.99 s [vector] depends base-4.20.1.0-2277
  3722. 699.99 s [vector] depends deepseq-1.5.0.0-f20c
  3723. 699.99 s [vector] depends primitive-0.9.1.0-IS0Uswzbk4H38TsU65qNKd
  3724. 699.99 s [vector] depends vector-stream-0.1.0.1-GvRGfCA0k7XEVGjh2RjIVV
  3725. 699.99 s [vector] definite vector-0.13.2.0-FRPpbjJQMIvEqhb341yYii-vector-tests-O0
  3726. 699.99 s [vector] depends QuickCheck-2.15.0.1-stTt2BXNne46QxWHi9NgG
  3727. 699.99 s [vector] depends base-4.20.1.0-2277
  3728. 699.99 s [vector] depends base-orphans-0.9.3-8QLFBKoZYCE78obgAGlSgm
  3729. 699.99 s [vector] depends primitive-0.9.1.0-IS0Uswzbk4H38TsU65qNKd
  3730. 699.99 s [vector] depends random-1.2.1.3-8klJqjF3xhRCzBrgK1uJlY
  3731. 699.99 s [vector] depends tasty-1.5.3-6lJNZiPO6mr1IBj9i5AbbV
  3732. 699.99 s [vector] depends tasty-hunit-0.10.2-ApRuPpVuRf9mwaiocwfO9
  3733. 699.99 s [vector] depends tasty-quickcheck-0.11.1-DepBLPMHb7DnNfDS8A0JQ
  3734. 699.99 s [vector] depends template-haskell-2.22.0.0-2a41
  3735. 699.99 s [vector] depends transformers-0.6.1.1-407f
  3736. 699.99 s [vector] depends vector-0.13.2.0-6XtMmq2Ff9ODcKEbpcqiG
  3737. 699.99 s [vector] definite vector-0.13.2.0-LslaBhDvA2lAi0aUqn9WaN-benchmarks-O2
  3738. 699.99 s [vector] depends base-4.20.1.0-2277
  3739. 699.99 s [vector] depends random-1.2.1.3-8klJqjF3xhRCzBrgK1uJlY
  3740. 699.99 s [vector] depends tasty-1.5.3-6lJNZiPO6mr1IBj9i5AbbV
  3741. 699.99 s [vector] depends vector-0.13.2.0-6XtMmq2Ff9ODcKEbpcqiG
  3742. 699.99 s [vector] definite vector-0.13.2.0-3nAcEP5l8ZI5b6nfr1JzfV-vector-doctest
  3743. 699.99 s [vector] depends base-4.20.1.0-2277
  3744. 699.99 s [vector] depends doctest-0.24.2-H4FgSSwrzQD6JTD7tYQanP
  3745. 699.99 s [vector] depends primitive-0.9.1.0-IS0Uswzbk4H38TsU65qNKd
  3746. 699.99 s [vector] depends vector-0.13.2.0-6XtMmq2Ff9ODcKEbpcqiG
  3747. 699.99 s [vector] definite vector-0.13.2.0-1BA2XfA0qbnEytmpE0qJoX-vector-inspection
  3748. 699.99 s [vector] depends base-4.20.1.0-2277
  3749. 699.99 s [vector] depends primitive-0.9.1.0-IS0Uswzbk4H38TsU65qNKd
  3750. 699.99 s [vector] depends tasty-1.5.3-6lJNZiPO6mr1IBj9i5AbbV
  3751. 699.99 s [vector] depends tasty-inspection-testing-0.2.1-CQRF1KtEhRP7SB95bPKEFg
  3752. 699.99 s [vector] depends vector-0.13.2.0-6XtMmq2Ff9ODcKEbpcqiG
  3753. 699.99 s [vector] definite vector-0.13.2.0-1AOexfr7zf3FI9QHZTJrCr-vector-tests-O2
  3754. 699.99 s [vector] depends QuickCheck-2.15.0.1-stTt2BXNne46QxWHi9NgG
  3755. 699.99 s [vector] depends base-4.20.1.0-2277
  3756. 699.99 s [vector] depends base-orphans-0.9.3-8QLFBKoZYCE78obgAGlSgm
  3757. 699.99 s [vector] depends primitive-0.9.1.0-IS0Uswzbk4H38TsU65qNKd
  3758. 699.99 s [vector] depends random-1.2.1.3-8klJqjF3xhRCzBrgK1uJlY
  3759. 699.99 s [vector] depends tasty-1.5.3-6lJNZiPO6mr1IBj9i5AbbV
  3760. 699.99 s [vector] depends tasty-hunit-0.10.2-ApRuPpVuRf9mwaiocwfO9
  3761. 699.99 s [vector] depends tasty-quickcheck-0.11.1-DepBLPMHb7DnNfDS8A0JQ
  3762. 699.99 s [vector] depends template-haskell-2.22.0.0-2a41
  3763. 699.99 s [vector] depends transformers-0.6.1.1-407f
  3764. 699.99 s [vector] depends vector-0.13.2.0-6XtMmq2Ff9ODcKEbpcqiG
  3765. 699.99 s [vector] Using Cabal-3.12.1.0 compiled by ghc-9.10
  3766. 699.99 s [vector] Using compiler: ghc-9.10.2
  3767. 699.99 s [vector] Using install prefix:
  3768. 699.99 s [vector] /nix/store/bbyrw13yswg4p9yknixq0criplfzk75i-vector-0.13.2.0
  3769. 699.99 s [vector] Executables installed in:
  3770. 699.99 s [vector] /nix/store/bbyrw13yswg4p9yknixq0criplfzk75i-vector-0.13.2.0/bin
  3771. 699.99 s [vector] Libraries installed in:
  3772. 699.99 s [vector] /nix/store/bbyrw13yswg4p9yknixq0criplfzk75i-vector-0.13.2.0/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-1e2a/vector-0.13.2.0-6XtMmq2Ff9ODcKEbpcqiG
  3773. 699.99 s [vector] Dynamic Libraries installed in:
  3774. 699.99 s [vector] /nix/store/bbyrw13yswg4p9yknixq0criplfzk75i-vector-0.13.2.0/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-1e2a
  3775. 699.99 s [vector] Private executables installed in:
  3776. 699.99 s [vector] /nix/store/bbyrw13yswg4p9yknixq0criplfzk75i-vector-0.13.2.0/libexec/x86_64-linux-ghc-9.10.2-1e2a/vector-0.13.2.0
  3777. 699.99 s [vector] Data files installed in:
  3778. 699.99 s [vector] /nix/store/bbyrw13yswg4p9yknixq0criplfzk75i-vector-0.13.2.0/share/x86_64-linux-ghc-9.10.2-1e2a/vector-0.13.2.0
  3779. 699.99 s [vector] Documentation installed in:
  3780. 699.99 s [vector] /nix/store/bbyrw13yswg4p9yknixq0criplfzk75i-vector-0.13.2.0/share/doc/x86_64-linux-ghc-9.10.2-1e2a/vector-0.13.2.0
  3781. 699.99 s [vector] Configuration files installed in:
  3782. 699.99 s [vector] /nix/store/bbyrw13yswg4p9yknixq0criplfzk75i-vector-0.13.2.0/etc
  3783. 699.99 s [vector] No alex found
  3784. 699.99 s [vector] Using ar found on system at:
  3785. 699.99 s [vector] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
  3786. 699.99 s [vector] No c2hs found
  3787. 699.99 s [vector] No cpphs found
  3788. 699.99 s [vector] Using doctest version 0.24.2 found on system at:
  3789. 699.99 s [vector] /nix/store/zmwlk8gqk89i9b1qlifd7b9wywswg74r-doctest-0.24.2/bin/doctest
  3790. 699.99 s [vector] Using gcc version 14.3.0 given by user at:
  3791. 699.99 s [vector] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
  3792. 699.99 s [vector] Using ghc version 9.10.2 found on system at:
  3793. 699.99 s [vector] /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/bin/ghc
  3794. 699.99 s [vector] Using ghc-pkg version 9.10.2 found on system at:
  3795. 699.99 s [vector] /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/bin/ghc-pkg-9.10.2
  3796. 699.99 s [vector] No ghcjs found
  3797. 699.99 s [vector] No ghcjs-pkg found
  3798. 699.99 s [vector] No greencard found
  3799. 699.99 s [vector] Using haddock version 2.31.0 found on system at:
  3800. 699.99 s [vector] /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/bin/haddock-ghc-9.10.2
  3801. 699.99 s [vector] No happy found
  3802. 699.99 s [vector] Using haskell-suite found on system at: haskell-suite-dummy-location
  3803. 699.99 s [vector] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  3804. 699.99 s [vector] No hmake found
  3805. 699.99 s [vector] Using hpc version 0.69 found on system at:
  3806. 699.99 s [vector] /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/bin/hpc-ghc-9.10.2
  3807. 699.99 s [vector] Using hsc2hs version 0.68.10 found on system at:
  3808. 699.99 s [vector] /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/bin/hsc2hs-ghc-9.10.2
  3809. 699.99 s [vector] Using hscolour version 1.25 found on system at:
  3810. 699.99 s [vector] /nix/store/kb4afndnwdxxc5ps9k8xv0jzd0a9y8n5-hscolour-1.25/bin/HsColour
  3811. 699.99 s [vector] No jhc found
  3812. 699.99 s [vector] Using ld found on system at:
  3813. 699.99 s [vector] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/ld
  3814. 699.99 s [vector] No pkg-config found
  3815. 699.99 s [vector] Using runghc version 9.10.2 found on system at:
  3816. 699.99 s [vector] /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/bin/runghc-9.10.2
  3817. 699.99 s [vector] Using strip version 2.44 found on system at:
  3818. 699.99 s [vector] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
  3819. 699.99 s [vector] Using tar found on system at:
  3820. 699.99 s [vector] /nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
  3821. 699.99 s [vector] No uhc found
  3822. 700.11 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 )
  3823. 700.20 s [vector] Phase: buildPhase
  3824. 700.29 s [vector] Preprocessing library for vector-0.13.2.0...
  3825. 700.29 s [vector] Building library for vector-0.13.2.0...
  3826. 700.78 s [duoids] [2 of 6] Compiling Data.Duoid ( src/Data/Duoid.hs, dist/build/Data/Duoid.o, dist/build/Data/Duoid.dyn_o )
  3827. 700.98 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 )
  3828. 701.29 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 )
  3829. 701.32 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 )
  3830. 701.61 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 )
  3831. 701.61 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 )
  3832. 701.61 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 )
  3833. 701.61 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 )
  3834. 703.02 s [duoids] [3 of 6] Compiling Control.Duoidal ( src/Control/Duoidal.hs, dist/build/Control/Duoidal.o, dist/build/Control/Duoidal.dyn_o )
  3835. 706.69 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 )
  3836. 706.74 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 )
  3837. 706.74 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 )
  3838. 707.15 s [duoids] [1 of 6] Compiling Control.Duoidal.Async ( src/Control/Duoidal/Async.hs, dist/build/Control/Duoidal/Async.p_o )
  3839. 707.99 s [duoids] [2 of 6] Compiling Data.Duoid ( src/Data/Duoid.hs, dist/build/Data/Duoid.p_o )
  3840. 710.09 s [duoids] [3 of 6] Compiling Control.Duoidal ( src/Control/Duoidal.hs, dist/build/Control/Duoidal.p_o )
  3841. 710.24 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 )
  3842. 712.96 s [duoids] [4 of 6] Compiling Control.Duoidal.Either ( src/Control/Duoidal/Either.hs, dist/build/Control/Duoidal/Either.p_o )
  3843. 713.10 s [duoids] [5 of 6] Compiling Data.Duoid.Laws ( src/Data/Duoid/Laws.hs, dist/build/Data/Duoid/Laws.p_o )
  3844. 713.12 s [duoids] [6 of 6] Compiling Control.Duoidal.Laws ( src/Control/Duoidal/Laws.hs, dist/build/Control/Duoidal/Laws.p_o )
  3845. 715.67 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 )
  3846. 721.58 s [duoids] Preprocessing test suite 'doctests' for duoids-0.0.1.0...
  3847. 721.58 s [duoids] Building test suite 'doctests' for duoids-0.0.1.0...
  3848. 721.89 s [duoids] [1 of 2] Compiling Build_doctests ( dist/build/doctests/autogen/Build_doctests.hs, dist/build/doctests/doctests-tmp/Build_doctests.o )
  3849. 722.81 s [duoids] [2 of 2] Compiling Main ( tests/doctests.hs, dist/build/doctests/doctests-tmp/Main.o )
  3850. 722.84 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 )
  3851. 723.95 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 )
  3852. 724.14 s [duoids] [3 of 3] Linking dist/build/doctests/doctests
  3853. 731.02 s [duoids] buildPhase completed in 31 seconds
  3854. 731.02 s [duoids] Phase: checkPhase
  3855. 731.42 s [duoids] Running 1 test suites...
  3856. 731.42 s [duoids] Test suite doctests: RUNNING...
  3857. 731.99 s [duoids] on the commandline: warning: [GHC-98887]
  3858. 731.99 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  3859. 731.99 s [duoids]
  3860. 732.00 s [duoids] on the commandline: warning: [GHC-98887]
  3861. 732.00 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  3862. 732.00 s [duoids]
  3863. 732.00 s [duoids] on the commandline: warning: [GHC-98887]
  3864. 732.00 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  3865. 732.00 s [duoids]
  3866. 732.00 s [duoids] on the commandline: warning: [GHC-98887]
  3867. 732.00 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  3868. 732.00 s [duoids]
  3869. 732.00 s [duoids] on the commandline: warning: [GHC-98887]
  3870. 732.00 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  3871. 732.00 s [duoids]
  3872. 732.00 s [duoids] on the commandline: warning: [GHC-98887]
  3873. 732.00 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  3874. 732.00 s [duoids]
  3875. 732.00 s [duoids] on the commandline: warning: [GHC-98887]
  3876. 732.00 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  3877. 732.00 s [duoids]
  3878. 732.00 s [duoids] on the commandline: warning: [GHC-98887]
  3879. 732.00 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  3880. 732.00 s [duoids]
  3881. 732.01 s [duoids] on the commandline: warning: [GHC-98887]
  3882. 732.01 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  3883. 732.01 s [duoids]
  3884. 732.01 s [duoids] on the commandline: warning: [GHC-98887]
  3885. 732.01 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  3886. 732.01 s [duoids]
  3887. 733.91 s [duoids] Examples: 5 Tried: 5 Errors: 0 Failures: 0
  3888. 734.02 s [duoids] NameLib Nothing
  3889. 734.02 s [duoids] ----------------------------------------
  3890. 734.04 s [duoids] Test suite doctests: PASS
  3891. 734.04 s [duoids] Test suite logged to: dist/test/duoids-0.0.1.0-doctests.log
  3892. 734.04 s [duoids] 1 of 1 test suites (1 of 1 test cases) passed.
  3893. 734.06 s [duoids] Phase: haddockPhase
  3894. 734.39 s [duoids] Preprocessing library for duoids-0.0.1.0...
  3895. 734.39 s [duoids] Running Haddock on library for duoids-0.0.1.0...
  3896. 735.28 s [duoids] [1 of 6] Compiling Control.Duoidal.Async ( src/Control/Duoidal/Async.hs, nothing )
  3897. 735.81 s [duoids] [2 of 6] Compiling Data.Duoid ( src/Data/Duoid.hs, nothing )
  3898. 736.22 s [duoids] [3 of 6] Compiling Control.Duoidal ( src/Control/Duoidal.hs, nothing )
  3899. 737.27 s [duoids] [4 of 6] Compiling Control.Duoidal.Either ( src/Control/Duoidal/Either.hs, nothing )
  3900. 737.29 s [duoids] [5 of 6] Compiling Data.Duoid.Laws ( src/Data/Duoid/Laws.hs, nothing )
  3901. 737.30 s [duoids] [6 of 6] Compiling Control.Duoidal.Laws ( src/Control/Duoidal/Laws.hs, nothing )
  3902. 737.32 s [duoids] Haddock coverage:
  3903. 737.32 s [duoids] Warning: 'cancel' is out of scope.
  3904. 737.32 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  3905. 737.33 s [duoids] Warning: 'Applicative' is out of scope.
  3906. 737.33 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  3907. 737.33 s [duoids] Warning: 'Alternative' is out of scope.
  3908. 737.33 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  3909. 737.33 s [duoids] Warning: 'Par' is ambiguous. It is defined
  3910. 737.33 s [duoids] * at src/Data/Duoid.hs:62:5
  3911. 737.33 s [duoids] * at src/Data/Duoid.hs:58:1
  3912. 737.33 s [duoids] You may be able to disambiguate the identifier by qualifying it or
  3913. 737.33 s [duoids] by specifying the type/value namespace explicitly.
  3914. 737.33 s [duoids] Defaulting to the one defined at src/Data/Duoid.hs:58:1
  3915. 737.33 s [duoids] Warning: 'Seq' is ambiguous. It is defined
  3916. 737.33 s [duoids] * at src/Data/Duoid.hs:118:5
  3917. 737.33 s [duoids] * at src/Data/Duoid.hs:114:1
  3918. 737.33 s [duoids] You may be able to disambiguate the identifier by qualifying it or
  3919. 737.33 s [duoids] by specifying the type/value namespace explicitly.
  3920. 737.33 s [duoids] Defaulting to the one defined at src/Data/Duoid.hs:114:1
  3921. 737.33 s [duoids] 100% ( 10 / 10) in 'Data.Duoid'
  3922. 737.33 s [duoids] Warning: 'ExceptT' is out of scope.
  3923. 737.33 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  3924. 737.33 s [duoids] Warning: 'Parallel' is ambiguous. It is defined
  3925. 737.33 s [duoids] * at src/Control/Duoidal.hs:238:5
  3926. 737.33 s [duoids] * at src/Control/Duoidal.hs:234:1
  3927. 737.33 s [duoids] You may be able to disambiguate the identifier by qualifying it or
  3928. 737.33 s [duoids] by specifying the type/value namespace explicitly.
  3929. 737.33 s [duoids] Defaulting to the one defined at src/Control/Duoidal.hs:234:1
  3930. 737.33 s [duoids] Warning: 'Sequential' is ambiguous. It is defined
  3931. 737.33 s [duoids] * at src/Control/Duoidal.hs:308:5
  3932. 737.33 s [duoids] * at src/Control/Duoidal.hs:304:1
  3933. 737.33 s [duoids] You may be able to disambiguate the identifier by qualifying it or
  3934. 737.33 s [duoids] by specifying the type/value namespace explicitly.
  3935. 737.33 s [duoids] Defaulting to the one defined at src/Control/Duoidal.hs:304:1
  3936. 737.33 s [duoids] Warning: 'NoDefaultPrelude' is out of scope.
  3937. 737.33 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  3938. 737.33 s [duoids] Warning: 'Validation' is out of scope.
  3939. 737.33 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  3940. 737.33 s [duoids] Warning: 'fail' is out of scope.
  3941. 737.33 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  3942. 737.33 s [duoids] Warning: 'MonadFail' is out of scope.
  3943. 737.33 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  3944. 737.34 s [duoids] Warning: 'Commutative' is ambiguous. It is defined
  3945. 737.34 s [duoids] * at src/Control/Duoidal.hs:774:5
  3946. 737.34 s [duoids] * at src/Control/Duoidal.hs:770:1
  3947. 737.34 s [duoids] You may be able to disambiguate the identifier by qualifying it or
  3948. 737.34 s [duoids] by specifying the type/value namespace explicitly.
  3949. 737.34 s [duoids] Defaulting to the one defined at src/Control/Duoidal.hs:770:1
  3950. 737.34 s [duoids] Warning: 'Writer' is out of scope.
  3951. 737.34 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  3952. 737.34 s [duoids] Warning: 'Set' is out of scope.
  3953. 737.34 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  3954. 737.34 s [duoids] Warning: 'Char' is out of scope.
  3955. 737.34 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  3956. 737.34 s [duoids] Warning: 'Const' is ambiguous. It is defined
  3957. 737.34 s [duoids] * in ‘GHC.Internal.Data.Functor.Const’
  3958. 737.34 s [duoids] * in ‘GHC.Internal.Data.Functor.Const’
  3959. 737.34 s [duoids] You may be able to disambiguate the identifier by qualifying it or
  3960. 737.34 s [duoids] by specifying the type/value namespace explicitly.
  3961. 737.34 s [duoids] Defaulting to the one defined in ‘GHC.Internal.Data.Functor.Const’
  3962. 737.34 s [duoids] Warning: 'Normal' is ambiguous. It is defined
  3963. 737.34 s [duoids] * at src/Control/Duoidal.hs:395:1
  3964. 737.34 s [duoids] * at src/Data/Duoid.hs:183:1
  3965. 737.34 s [duoids] You may be able to disambiguate the identifier by qualifying it or
  3966. 737.34 s [duoids] by specifying the type/value namespace explicitly.
  3967. 737.34 s [duoids] Defaulting to the one defined at src/Data/Duoid.hs:183:1
  3968. 737.35 s [duoids] 100% ( 60 / 60) in 'Control.Duoidal'
  3969. 737.35 s [duoids] 100% ( 2 / 2) in 'Control.Duoidal.Either'
  3970. 737.35 s [duoids] Warning: 'Normal' is out of scope.
  3971. 737.35 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  3972. 737.35 s [duoids] Warning: 'Law' is ambiguous. It is defined
  3973. 737.35 s [duoids] * at src/Data/Duoid/Laws.hs:38:5
  3974. 737.35 s [duoids] * at src/Data/Duoid/Laws.hs:34:1
  3975. 737.35 s [duoids] You may be able to disambiguate the identifier by qualifying it or
  3976. 737.35 s [duoids] by specifying the type/value namespace explicitly.
  3977. 737.35 s [duoids] Defaulting to the one defined at src/Data/Duoid/Laws.hs:34:1
  3978. 737.35 s [duoids] 100% ( 12 / 12) in 'Data.Duoid.Laws'
  3979. 737.35 s [duoids] 100% ( 6 / 6) in 'Control.Duoidal.Laws'
  3980. 737.43 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 )
  3981. 737.43 s [vector] [13 of 23] Compiling Data.Vector ( src/Data/Vector.hs, dist/build/Data/Vector.o, dist/build/Data/Vector.dyn_o )
  3982. 737.54 s [duoids] Warning: Data.Duoid: could not find link destinations for:
  3983. 737.54 s [duoids] - Data.Duoid.Rep_Comm
  3984. 737.54 s [duoids] - Data.Duoid.Rep1_Comm
  3985. 737.54 s [duoids] - Data.Duoid.Rep_Seq
  3986. 737.54 s [duoids] - Data.Duoid.Rep1_Seq
  3987. 737.54 s [duoids] - Data.Duoid.Rep_Par
  3988. 737.54 s [duoids] - Data.Duoid.Rep1_Par
  3989. 737.56 s [duoids] Warning: Control.Duoidal: could not find link destinations for:
  3990. 737.56 s [duoids] - Control.Duoidal.Rep_Commutative
  3991. 737.56 s [duoids] - Control.Duoidal.Rep1_Commutative
  3992. 737.56 s [duoids] - Control.Duoidal.Rep_Sequential
  3993. 737.56 s [duoids] - Control.Duoidal.Rep1_Sequential
  3994. 737.56 s [duoids] - Control.Duoidal.Rep_Parallel
  3995. 737.56 s [duoids] - Control.Duoidal.Rep1_Parallel
  3996. 737.56 s [duoids] Warning: Data.Duoid.Laws: could not find link destinations for:
  3997. 737.56 s [duoids] - Data.Duoid.Laws.Rep_NormalLaws
  3998. 737.56 s [duoids] - Data.Duoid.Laws.Rep1_NormalLaws
  3999. 737.56 s [duoids] - Data.Duoid.Laws.Rep_Laws
  4000. 737.56 s [duoids] - Data.Duoid.Laws.Rep_Law
  4001. 748.57 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 )
  4002. 748.59 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 )
  4003. 748.59 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 )
  4004. 748.59 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 )
  4005. 748.59 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 )
  4006. 749.96 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 )
  4007. 749.96 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 )
  4008. 756.97 s [duoids] Documentation created: dist/doc/html/duoids/, dist/doc/html/duoids/duoids.txt
  4009. 757.13 s [duoids] Preprocessing test suite 'doctests' for duoids-0.0.1.0...
  4010. 757.15 s [duoids] Phase: installPhase
  4011. 757.35 s [duoids] Installing library in /nix/store/5wzfl59csy20l6v8wfrh52x0i22jmrp4-duoids-0.0.1.0/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-1e2a/duoids-0.0.1.0-5q4kbrGqhufDoKkeqzXV7l
  4012. 758.32 s [duoids] Phase: fixupPhase
  4013. 758.36 s [duoids] shrinking RPATHs of ELF executables and libraries in /nix/store/5wzfl59csy20l6v8wfrh52x0i22jmrp4-duoids-0.0.1.0
  4014. 758.37 s [duoids] shrinking /nix/store/5wzfl59csy20l6v8wfrh52x0i22jmrp4-duoids-0.0.1.0/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-1e2a/libHSduoids-0.0.1.0-5q4kbrGqhufDoKkeqzXV7l-ghc9.10.2.so
  4015. 758.39 s [duoids] checking for references to /build/ in /nix/store/5wzfl59csy20l6v8wfrh52x0i22jmrp4-duoids-0.0.1.0...
  4016. 758.42 s [duoids] patching script interpreter paths in /nix/store/5wzfl59csy20l6v8wfrh52x0i22jmrp4-duoids-0.0.1.0
  4017. 758.43 s [duoids] stripping (with command strip and flags -S -p) in /nix/store/5wzfl59csy20l6v8wfrh52x0i22jmrp4-duoids-0.0.1.0/lib
  4018. 758.70 s [duoids] shrinking RPATHs of ELF executables and libraries in /nix/store/4x74slj59wml5q8zal7h1f394ylgf6ca-duoids-0.0.1.0-doc
  4019. 758.71 s [duoids] checking for references to /build/ in /nix/store/4x74slj59wml5q8zal7h1f394ylgf6ca-duoids-0.0.1.0-doc...
  4020. 758.74 s [duoids] patching script interpreter paths in /nix/store/4x74slj59wml5q8zal7h1f394ylgf6ca-duoids-0.0.1.0-doc
  4021. 759.01 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/4x74slj59wml5q8zal7h1f394ylgf6ca-duoids-0.0.1.0-doc /nix/store/5wzfl59csy20l6v8wfrh52x0i22jmrp4-duoids-0.0.1.0
  4022. 759.68 s [post-build-hook] Pushing 2 paths (72 are already present) using zstd to cache sellout ⏳
  4023. 759.68 s [post-build-hook]
  4024. 760.06 s [post-build-hook] Pushing /nix/store/5wzfl59csy20l6v8wfrh52x0i22jmrp4-duoids-0.0.1.0 (8.25 MiB)
  4025. 760.10 s [post-build-hook] Pushing /nix/store/4x74slj59wml5q8zal7h1f394ylgf6ca-duoids-0.0.1.0-doc (2.25 MiB)
  4026. 761.18 s [post-build-hook]
  4027. 761.18 s [post-build-hook] All done.
  4028. 761.25 s [post-build-hook] Uploading to the NixCI cache: /nix/store/4x74slj59wml5q8zal7h1f394ylgf6ca-duoids-0.0.1.0-doc /nix/store/5wzfl59csy20l6v8wfrh52x0i22jmrp4-duoids-0.0.1.0
  4029. 761.36 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  4030. 761.39 s [post-build-hook] copying 2 paths...
  4031. 761.39 s [post-build-hook] copying path '/nix/store/4x74slj59wml5q8zal7h1f394ylgf6ca-duoids-0.0.1.0-doc' to 'https://cache.nix-ci.com'...
  4032. 762.31 s [post-build-hook] copying path '/nix/store/5wzfl59csy20l6v8wfrh52x0i22jmrp4-duoids-0.0.1.0' to 'https://cache.nix-ci.com'...
  4033. 765.66 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  4034. 765.92 s [post-build-hook] copying 1 paths...
  4035. 765.92 s [post-build-hook] copying path '/nix/store/djnib4r73f23f6r7mx0y2jcrjkyly31q-duoids-0.0.1.0.drv' to 'https://cache.nix-ci.com'...
  4036. 766.13 s Progress: 6 of 22 built (1 building), 177 of 177 downloaded from cache
  4037. 766.22 s Building duoidal-transformers
  4038. 766.30 s Building duoids-hedgehog
  4039. 766.30 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 )
  4040. 766.33 s [duoidal-transformers] Phase: setupCompilerEnvironmentPhase
  4041. 766.34 s [duoidal-transformers] Build with /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2.
  4042. 766.50 s [duoids-hedgehog] Phase: setupCompilerEnvironmentPhase
  4043. 766.50 s [duoids-hedgehog] Build with /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2.
  4044. 766.71 s [duoidal-transformers] Phase: unpackPhase
  4045. 766.72 s [duoidal-transformers] unpacking source archive /nix/store/hwhxlh4aq4w3fvrlk65js3cdkm3in22k-5y8mzl3igbd7qyrpb010fqiak50k5q01-source/./transformers
  4046. 766.73 s [duoidal-transformers] source root is transformers
  4047. 766.76 s [duoidal-transformers] Phase: patchPhase
  4048. 766.77 s [duoidal-transformers] Phase: compileBuildDriverPhase
  4049. 766.78 s [duoidal-transformers] setupCompileFlags: -package-db=/build/tmp.NNPqw9fvWL/setup-package.conf.d -threaded
  4050. 766.91 s [duoidal-transformers] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.NNPqw9fvWL/Main.o )
  4051. 767.01 s [duoids-hedgehog] Phase: unpackPhase
  4052. 767.01 s [duoids-hedgehog] unpacking source archive /nix/store/hwhxlh4aq4w3fvrlk65js3cdkm3in22k-5y8mzl3igbd7qyrpb010fqiak50k5q01-source/./hedgehog
  4053. 767.02 s [duoids-hedgehog] source root is hedgehog
  4054. 767.04 s [duoidal-transformers] [2 of 2] Linking Setup
  4055. 767.04 s [duoids-hedgehog] Phase: patchPhase
  4056. 767.06 s [duoids-hedgehog] Phase: compileBuildDriverPhase
  4057. 767.07 s [duoids-hedgehog] setupCompileFlags: -package-db=/build/tmp.ChrI74HQxi/setup-package.conf.d -threaded
  4058. 767.21 s [duoids-hedgehog] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.ChrI74HQxi/Main.o )
  4059. 767.35 s [duoids-hedgehog] [2 of 2] Linking Setup
  4060. 769.45 s [duoidal-transformers] Phase: updateAutotoolsGnuConfigScriptsPhase
  4061. 769.47 s [duoidal-transformers] Phase: configurePhase
  4062. 769.48 s [duoidal-transformers] configureFlags: --verbose --prefix=/nix/store/q100bhcm82xglcq9n7pmikbqwpca49ls-duoidal-transformers-0.0.1.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/3v34zwy744ha74cnpknxqjfbqazdpy1p-duoidal-transformers-0.0.1.0-doc/share/doc/duoidal-transformers-0.0.1.0 --with-gcc=gcc --package-db=/build/tmp.NNPqw9fvWL/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/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/lib
  4063. 769.50 s [duoidal-transformers] Using Parsec parser
  4064. 769.50 s [duoidal-transformers] Configuring duoidal-transformers-0.0.1.0...
  4065. 769.89 s [duoids-hedgehog] Phase: updateAutotoolsGnuConfigScriptsPhase
  4066. 769.92 s [duoids-hedgehog] Phase: configurePhase
  4067. 769.94 s [duoids-hedgehog] configureFlags: --verbose --prefix=/nix/store/hmi97yr3s7pq1i2xn2lmawdf52i3cwgn-duoids-hedgehog-0.0.1.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/wjvw8frmsxhz52aqa8pfcyrhsl8j33gg-duoids-hedgehog-0.0.1.0-doc/share/doc/duoids-hedgehog-0.0.1.0 --with-gcc=gcc --package-db=/build/tmp.ChrI74HQxi/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/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/lib
  4068. 769.96 s [duoids-hedgehog] Using Parsec parser
  4069. 769.96 s [duoids-hedgehog] Configuring duoids-hedgehog-0.0.1.0...
  4070. 770.51 s [duoidal-transformers] Flags chosen: lint=False, noisy-deprecations=True
  4071. 771.01 s [duoids-hedgehog] Flags chosen: lint=False, noisy-deprecations=True
  4072. 771.33 s [duoidal-transformers] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  4073. 771.33 s [duoidal-transformers] >=4.21.0 && <4.22 || >=4.22.0 && <4.23: using base-4.20.1.0
  4074. 771.33 s [duoidal-transformers] Dependency duoids >=0.0.1 && <0.1: using duoids-0.0.1.0
  4075. 771.33 s [duoidal-transformers] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  4076. 771.33 s [duoidal-transformers] Dependency transformers >=0.6.1 && <0.7: using transformers-0.6.1.1
  4077. 771.33 s [duoidal-transformers] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  4078. 771.33 s [duoidal-transformers] >=4.21.0 && <4.22 || >=4.22.0 && <4.23: using base-4.20.1.0
  4079. 771.33 s [duoidal-transformers] Dependency doctest >=0.21.1 && <0.22 || >=0.22.6 && <0.23 || >=0.24.0 &&
  4080. 771.33 s [duoidal-transformers] <0.25: using doctest-0.24.2
  4081. 771.33 s [duoidal-transformers] Dependency duoidal-transformers: using duoidal-transformers-0.0.1.0
  4082. 771.33 s [duoidal-transformers] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  4083. 771.33 s [duoidal-transformers] Source component graph:
  4084. 771.33 s [duoidal-transformers] component lib
  4085. 771.33 s [duoidal-transformers] component test:doctests dependency lib
  4086. 771.33 s [duoidal-transformers] Configured component graph:
  4087. 771.33 s [duoidal-transformers] component duoidal-transformers-0.0.1.0-K4hS8Tqn0Av68PS4VM4Tn0
  4088. 771.33 s [duoidal-transformers] include base-4.20.1.0-2277
  4089. 771.33 s [duoidal-transformers] include duoids-0.0.1.0-5q4kbrGqhufDoKkeqzXV7l
  4090. 771.33 s [duoidal-transformers] include ghc-compat-plugin-0.1.0.1-5wmISeCFDky4w6cG3d8F6M
  4091. 771.33 s [duoidal-transformers] include transformers-0.6.1.1-407f
  4092. 771.34 s [duoidal-transformers] component duoidal-transformers-0.0.1.0-Ne5vjqhljhGz2KEJ8ZPJB-doctests
  4093. 771.34 s [duoidal-transformers] include base-4.20.1.0-2277
  4094. 771.34 s [duoidal-transformers] include doctest-0.24.2-H4FgSSwrzQD6JTD7tYQanP
  4095. 771.34 s [duoidal-transformers] include duoidal-transformers-0.0.1.0-K4hS8Tqn0Av68PS4VM4Tn0
  4096. 771.34 s [duoidal-transformers] include ghc-compat-plugin-0.1.0.1-5wmISeCFDky4w6cG3d8F6M
  4097. 771.34 s [duoidal-transformers] Linked component graph:
  4098. 771.34 s [duoidal-transformers] unit duoidal-transformers-0.0.1.0-K4hS8Tqn0Av68PS4VM4Tn0
  4099. 771.34 s [duoidal-transformers] include base-4.20.1.0-2277
  4100. 771.34 s [duoidal-transformers] include duoids-0.0.1.0-5q4kbrGqhufDoKkeqzXV7l
  4101. 771.34 s [duoidal-transformers] include ghc-compat-plugin-0.1.0.1-5wmISeCFDky4w6cG3d8F6M
  4102. 771.34 s [duoidal-transformers] include transformers-0.6.1.1-407f
  4103. 771.34 s [duoidal-transformers] Control.Duoidal.Trans.Class=duoidal-transformers-0.0.1.0-K4hS8Tqn0Av68PS4VM4Tn0:Control.Duoidal.Trans.Class,Control.Duoidal.Trans.Orphans=duoidal-transformers-0.0.1.0-K4hS8Tqn0Av68PS4VM4Tn0:Control.Duoidal.Trans.Orphans
  4104. 771.34 s [duoidal-transformers] unit duoidal-transformers-0.0.1.0-Ne5vjqhljhGz2KEJ8ZPJB-doctests
  4105. 771.34 s [duoidal-transformers] include base-4.20.1.0-2277
  4106. 771.34 s [duoidal-transformers] include doctest-0.24.2-H4FgSSwrzQD6JTD7tYQanP
  4107. 771.34 s [duoidal-transformers] include duoidal-transformers-0.0.1.0-K4hS8Tqn0Av68PS4VM4Tn0
  4108. 771.34 s [duoidal-transformers] include ghc-compat-plugin-0.1.0.1-5wmISeCFDky4w6cG3d8F6M
  4109. 771.34 s [duoidal-transformers] Ready component graph:
  4110. 771.34 s [duoidal-transformers] definite duoidal-transformers-0.0.1.0-K4hS8Tqn0Av68PS4VM4Tn0
  4111. 771.34 s [duoidal-transformers] depends base-4.20.1.0-2277
  4112. 771.34 s [duoidal-transformers] depends duoids-0.0.1.0-5q4kbrGqhufDoKkeqzXV7l
  4113. 771.34 s [duoidal-transformers] depends ghc-compat-plugin-0.1.0.1-5wmISeCFDky4w6cG3d8F6M
  4114. 771.34 s [duoidal-transformers] depends transformers-0.6.1.1-407f
  4115. 771.34 s [duoidal-transformers] definite duoidal-transformers-0.0.1.0-Ne5vjqhljhGz2KEJ8ZPJB-doctests
  4116. 771.34 s [duoidal-transformers] depends base-4.20.1.0-2277
  4117. 771.34 s [duoidal-transformers] depends doctest-0.24.2-H4FgSSwrzQD6JTD7tYQanP
  4118. 771.34 s [duoidal-transformers] depends duoidal-transformers-0.0.1.0-K4hS8Tqn0Av68PS4VM4Tn0
  4119. 771.34 s [duoidal-transformers] depends ghc-compat-plugin-0.1.0.1-5wmISeCFDky4w6cG3d8F6M
  4120. 771.34 s [duoidal-transformers] Using Cabal-3.12.1.0 compiled by ghc-9.10
  4121. 771.34 s [duoidal-transformers] Using compiler: ghc-9.10.2
  4122. 771.34 s [duoidal-transformers] Using install prefix:
  4123. 771.34 s [duoidal-transformers] /nix/store/q100bhcm82xglcq9n7pmikbqwpca49ls-duoidal-transformers-0.0.1.0
  4124. 771.34 s [duoidal-transformers] Executables installed in:
  4125. 771.34 s [duoidal-transformers] /nix/store/q100bhcm82xglcq9n7pmikbqwpca49ls-duoidal-transformers-0.0.1.0/bin
  4126. 771.34 s [duoidal-transformers] Libraries installed in:
  4127. 771.34 s [duoidal-transformers] /nix/store/q100bhcm82xglcq9n7pmikbqwpca49ls-duoidal-transformers-0.0.1.0/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-1e2a/duoidal-transformers-0.0.1.0-K4hS8Tqn0Av68PS4VM4Tn0
  4128. 771.34 s [duoidal-transformers] Dynamic Libraries installed in:
  4129. 771.34 s [duoidal-transformers] /nix/store/q100bhcm82xglcq9n7pmikbqwpca49ls-duoidal-transformers-0.0.1.0/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-1e2a
  4130. 771.34 s [duoidal-transformers] Private executables installed in:
  4131. 771.34 s [duoidal-transformers] /nix/store/q100bhcm82xglcq9n7pmikbqwpca49ls-duoidal-transformers-0.0.1.0/libexec/x86_64-linux-ghc-9.10.2-1e2a/duoidal-transformers-0.0.1.0
  4132. 771.34 s [duoidal-transformers] Data files installed in:
  4133. 771.34 s [duoidal-transformers] /nix/store/q100bhcm82xglcq9n7pmikbqwpca49ls-duoidal-transformers-0.0.1.0/share/x86_64-linux-ghc-9.10.2-1e2a/duoidal-transformers-0.0.1.0
  4134. 771.34 s [duoidal-transformers] Documentation installed in:
  4135. 771.34 s [duoidal-transformers] /nix/store/3v34zwy744ha74cnpknxqjfbqazdpy1p-duoidal-transformers-0.0.1.0-doc/share/doc/duoidal-transformers-0.0.1.0
  4136. 771.34 s [duoidal-transformers] Configuration files installed in:
  4137. 771.34 s [duoidal-transformers] /nix/store/q100bhcm82xglcq9n7pmikbqwpca49ls-duoidal-transformers-0.0.1.0/etc
  4138. 771.34 s [duoidal-transformers] No alex found
  4139. 771.34 s [duoidal-transformers] Using ar found on system at:
  4140. 771.34 s [duoidal-transformers] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
  4141. 771.34 s [duoidal-transformers] No c2hs found
  4142. 771.34 s [duoidal-transformers] No cpphs found
  4143. 771.34 s [duoidal-transformers] Using doctest version 0.24.2 found on system at:
  4144. 771.34 s [duoidal-transformers] /nix/store/zmwlk8gqk89i9b1qlifd7b9wywswg74r-doctest-0.24.2/bin/doctest
  4145. 771.34 s [duoidal-transformers] Using gcc version 14.3.0 given by user at:
  4146. 771.34 s [duoidal-transformers] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
  4147. 771.34 s [duoidal-transformers] Using ghc version 9.10.2 found on system at:
  4148. 771.34 s [duoidal-transformers] /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/bin/ghc
  4149. 771.34 s [duoidal-transformers] Using ghc-pkg version 9.10.2 found on system at:
  4150. 771.34 s [duoidal-transformers] /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/bin/ghc-pkg-9.10.2
  4151. 771.34 s [duoidal-transformers] No ghcjs found
  4152. 771.34 s [duoidal-transformers] No ghcjs-pkg found
  4153. 771.34 s [duoidal-transformers] No greencard found
  4154. 771.34 s [duoidal-transformers] Using haddock version 2.31.0 found on system at:
  4155. 771.34 s [duoidal-transformers] /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/bin/haddock-ghc-9.10.2
  4156. 771.34 s [duoidal-transformers] No happy found
  4157. 771.34 s [duoidal-transformers] Using haskell-suite found on system at: haskell-suite-dummy-location
  4158. 771.34 s [duoidal-transformers] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  4159. 771.34 s [duoidal-transformers] No hmake found
  4160. 771.34 s [duoidal-transformers] Using hpc version 0.69 found on system at:
  4161. 771.34 s [duoidal-transformers] /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/bin/hpc-ghc-9.10.2
  4162. 771.34 s [duoidal-transformers] Using hsc2hs version 0.68.10 found on system at:
  4163. 771.34 s [duoidal-transformers] /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/bin/hsc2hs-ghc-9.10.2
  4164. 771.34 s [duoidal-transformers] Using hscolour version 1.25 found on system at:
  4165. 771.34 s [duoidal-transformers] /nix/store/kb4afndnwdxxc5ps9k8xv0jzd0a9y8n5-hscolour-1.25/bin/HsColour
  4166. 771.34 s [duoidal-transformers] No jhc found
  4167. 771.34 s [duoidal-transformers] Using ld found on system at:
  4168. 771.34 s [duoidal-transformers] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/ld
  4169. 771.34 s [duoidal-transformers] No pkg-config found
  4170. 771.34 s [duoidal-transformers] Using runghc version 9.10.2 found on system at:
  4171. 771.34 s [duoidal-transformers] /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/bin/runghc-9.10.2
  4172. 771.34 s [duoidal-transformers] Using strip version 2.44 found on system at:
  4173. 771.34 s [duoidal-transformers] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
  4174. 771.34 s [duoidal-transformers] Using tar found on system at:
  4175. 771.34 s [duoidal-transformers] /nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
  4176. 771.34 s [duoidal-transformers] No uhc found
  4177. 771.71 s [duoidal-transformers] Phase: buildPhase
  4178. 771.87 s [duoids-hedgehog] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  4179. 771.87 s [duoids-hedgehog] >=4.21.0 && <4.22 || >=4.22.0 && <4.23: using base-4.20.1.0
  4180. 771.87 s [duoids-hedgehog] Dependency duoids >=0.0.1 && <0.1: using duoids-0.0.1.0
  4181. 771.87 s [duoids-hedgehog] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  4182. 771.87 s [duoids-hedgehog] Dependency hedgehog >=1.2 && <1.3 || >=1.4 && <1.6 || >=1.7 && <1.8: using
  4183. 771.87 s [duoids-hedgehog] hedgehog-1.5
  4184. 771.87 s [duoids-hedgehog] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  4185. 771.87 s [duoids-hedgehog] >=4.21.0 && <4.22 || >=4.22.0 && <4.23: using base-4.20.1.0
  4186. 771.87 s [duoids-hedgehog] Dependency duoids-hedgehog: using duoids-hedgehog-0.0.1.0
  4187. 771.87 s [duoids-hedgehog] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  4188. 771.87 s [duoids-hedgehog] Dependency hedgehog >=1.2 && <1.3 || >=1.4 && <1.6 || >=1.7 && <1.8: using
  4189. 771.87 s [duoids-hedgehog] hedgehog-1.5
  4190. 771.87 s [duoids-hedgehog] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  4191. 771.87 s [duoids-hedgehog] >=4.21.0 && <4.22 || >=4.22.0 && <4.23: using base-4.20.1.0
  4192. 771.87 s [duoids-hedgehog] Dependency doctest >=0.21.1 && <0.22 || >=0.22.6 && <0.23 || >=0.24.0 &&
  4193. 771.87 s [duoids-hedgehog] <0.25: using doctest-0.24.2
  4194. 771.87 s [duoids-hedgehog] Dependency duoids-hedgehog: using duoids-hedgehog-0.0.1.0
  4195. 771.87 s [duoids-hedgehog] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  4196. 771.87 s [duoids-hedgehog] Source component graph:
  4197. 771.87 s [duoids-hedgehog] component lib
  4198. 771.87 s [duoids-hedgehog] component test:doctests dependency lib
  4199. 771.88 s [duoids-hedgehog] component test:laws dependency lib
  4200. 771.88 s [duoids-hedgehog] Configured component graph:
  4201. 771.88 s [duoids-hedgehog] component duoids-hedgehog-0.0.1.0-5gSNeuVBdOQDy9trKqTi02
  4202. 771.88 s [duoids-hedgehog] include base-4.20.1.0-2277
  4203. 771.88 s [duoids-hedgehog] include duoids-0.0.1.0-5q4kbrGqhufDoKkeqzXV7l
  4204. 771.88 s [duoids-hedgehog] include ghc-compat-plugin-0.1.0.1-5wmISeCFDky4w6cG3d8F6M
  4205. 771.88 s [duoids-hedgehog] include hedgehog-1.5-EfuEQGiebWdHenxPcHRkuA
  4206. 771.88 s [duoids-hedgehog] component duoids-hedgehog-0.0.1.0-6KbcCqgSXxBBtr7oUC8hAU-doctests
  4207. 771.88 s [duoids-hedgehog] include base-4.20.1.0-2277
  4208. 771.88 s [duoids-hedgehog] include doctest-0.24.2-H4FgSSwrzQD6JTD7tYQanP
  4209. 771.88 s [duoids-hedgehog] include duoids-hedgehog-0.0.1.0-5gSNeuVBdOQDy9trKqTi02
  4210. 771.88 s [duoids-hedgehog] include ghc-compat-plugin-0.1.0.1-5wmISeCFDky4w6cG3d8F6M
  4211. 771.88 s [duoids-hedgehog] component duoids-hedgehog-0.0.1.0-K2b7mzWiMUi8q1kpZBvMkT-laws
  4212. 771.88 s [duoids-hedgehog] include base-4.20.1.0-2277
  4213. 771.88 s [duoids-hedgehog] include duoids-hedgehog-0.0.1.0-5gSNeuVBdOQDy9trKqTi02
  4214. 771.88 s [duoids-hedgehog] include ghc-compat-plugin-0.1.0.1-5wmISeCFDky4w6cG3d8F6M
  4215. 771.88 s [duoids-hedgehog] include hedgehog-1.5-EfuEQGiebWdHenxPcHRkuA
  4216. 771.88 s [duoids-hedgehog] Linked component graph:
  4217. 771.88 s [duoids-hedgehog] unit duoids-hedgehog-0.0.1.0-5gSNeuVBdOQDy9trKqTi02
  4218. 771.88 s [duoids-hedgehog] include base-4.20.1.0-2277
  4219. 771.88 s [duoids-hedgehog] include duoids-0.0.1.0-5q4kbrGqhufDoKkeqzXV7l
  4220. 771.88 s [duoids-hedgehog] include ghc-compat-plugin-0.1.0.1-5wmISeCFDky4w6cG3d8F6M
  4221. 771.88 s [duoids-hedgehog] include hedgehog-1.5-EfuEQGiebWdHenxPcHRkuA
  4222. 771.88 s [duoids-hedgehog] Test.Duoid=duoids-hedgehog-0.0.1.0-5gSNeuVBdOQDy9trKqTi02:Test.Duoid,Test.Duoidal=duoids-hedgehog-0.0.1.0-5gSNeuVBdOQDy9trKqTi02:Test.Duoidal
  4223. 771.88 s [duoids-hedgehog] unit duoids-hedgehog-0.0.1.0-6KbcCqgSXxBBtr7oUC8hAU-doctests
  4224. 771.88 s [duoids-hedgehog] include base-4.20.1.0-2277
  4225. 771.88 s [duoids-hedgehog] include doctest-0.24.2-H4FgSSwrzQD6JTD7tYQanP
  4226. 771.88 s [duoids-hedgehog] include duoids-hedgehog-0.0.1.0-5gSNeuVBdOQDy9trKqTi02
  4227. 771.88 s [duoids-hedgehog] include ghc-compat-plugin-0.1.0.1-5wmISeCFDky4w6cG3d8F6M
  4228. 771.88 s [duoids-hedgehog] unit duoids-hedgehog-0.0.1.0-K2b7mzWiMUi8q1kpZBvMkT-laws
  4229. 771.88 s [duoids-hedgehog] include base-4.20.1.0-2277
  4230. 771.88 s [duoids-hedgehog] include duoids-hedgehog-0.0.1.0-5gSNeuVBdOQDy9trKqTi02
  4231. 771.88 s [duoids-hedgehog] include ghc-compat-plugin-0.1.0.1-5wmISeCFDky4w6cG3d8F6M
  4232. 771.88 s [duoids-hedgehog] include hedgehog-1.5-EfuEQGiebWdHenxPcHRkuA
  4233. 771.88 s [duoids-hedgehog] Ready component graph:
  4234. 771.88 s [duoids-hedgehog] definite duoids-hedgehog-0.0.1.0-5gSNeuVBdOQDy9trKqTi02
  4235. 771.88 s [duoids-hedgehog] depends base-4.20.1.0-2277
  4236. 771.88 s [duoids-hedgehog] depends duoids-0.0.1.0-5q4kbrGqhufDoKkeqzXV7l
  4237. 771.88 s [duoids-hedgehog] depends ghc-compat-plugin-0.1.0.1-5wmISeCFDky4w6cG3d8F6M
  4238. 771.88 s [duoids-hedgehog] depends hedgehog-1.5-EfuEQGiebWdHenxPcHRkuA
  4239. 771.88 s [duoids-hedgehog] definite duoids-hedgehog-0.0.1.0-6KbcCqgSXxBBtr7oUC8hAU-doctests
  4240. 771.88 s [duoids-hedgehog] depends base-4.20.1.0-2277
  4241. 771.88 s [duoids-hedgehog] depends doctest-0.24.2-H4FgSSwrzQD6JTD7tYQanP
  4242. 771.88 s [duoids-hedgehog] depends duoids-hedgehog-0.0.1.0-5gSNeuVBdOQDy9trKqTi02
  4243. 771.88 s [duoids-hedgehog] depends ghc-compat-plugin-0.1.0.1-5wmISeCFDky4w6cG3d8F6M
  4244. 771.88 s [duoids-hedgehog] definite duoids-hedgehog-0.0.1.0-K2b7mzWiMUi8q1kpZBvMkT-laws
  4245. 771.88 s [duoids-hedgehog] depends base-4.20.1.0-2277
  4246. 771.88 s [duoids-hedgehog] depends duoids-hedgehog-0.0.1.0-5gSNeuVBdOQDy9trKqTi02
  4247. 771.88 s [duoids-hedgehog] depends ghc-compat-plugin-0.1.0.1-5wmISeCFDky4w6cG3d8F6M
  4248. 771.88 s [duoids-hedgehog] depends hedgehog-1.5-EfuEQGiebWdHenxPcHRkuA
  4249. 771.88 s [duoids-hedgehog] Using Cabal-3.12.1.0 compiled by ghc-9.10
  4250. 771.88 s [duoids-hedgehog] Using compiler: ghc-9.10.2
  4251. 771.88 s [duoids-hedgehog] Using install prefix:
  4252. 771.88 s [duoids-hedgehog] /nix/store/hmi97yr3s7pq1i2xn2lmawdf52i3cwgn-duoids-hedgehog-0.0.1.0
  4253. 771.88 s [duoids-hedgehog] Executables installed in:
  4254. 771.88 s [duoids-hedgehog] /nix/store/hmi97yr3s7pq1i2xn2lmawdf52i3cwgn-duoids-hedgehog-0.0.1.0/bin
  4255. 771.88 s [duoids-hedgehog] Libraries installed in:
  4256. 771.88 s [duoids-hedgehog] /nix/store/hmi97yr3s7pq1i2xn2lmawdf52i3cwgn-duoids-hedgehog-0.0.1.0/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-1e2a/duoids-hedgehog-0.0.1.0-5gSNeuVBdOQDy9trKqTi02
  4257. 771.88 s [duoids-hedgehog] Dynamic Libraries installed in:
  4258. 771.88 s [duoids-hedgehog] /nix/store/hmi97yr3s7pq1i2xn2lmawdf52i3cwgn-duoids-hedgehog-0.0.1.0/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-1e2a
  4259. 771.88 s [duoids-hedgehog] Private executables installed in:
  4260. 771.88 s [duoids-hedgehog] /nix/store/hmi97yr3s7pq1i2xn2lmawdf52i3cwgn-duoids-hedgehog-0.0.1.0/libexec/x86_64-linux-ghc-9.10.2-1e2a/duoids-hedgehog-0.0.1.0
  4261. 771.88 s [duoids-hedgehog] Data files installed in:
  4262. 771.88 s [duoids-hedgehog] /nix/store/hmi97yr3s7pq1i2xn2lmawdf52i3cwgn-duoids-hedgehog-0.0.1.0/share/x86_64-linux-ghc-9.10.2-1e2a/duoids-hedgehog-0.0.1.0
  4263. 771.88 s [duoids-hedgehog] Documentation installed in:
  4264. 771.88 s [duoids-hedgehog] /nix/store/wjvw8frmsxhz52aqa8pfcyrhsl8j33gg-duoids-hedgehog-0.0.1.0-doc/share/doc/duoids-hedgehog-0.0.1.0
  4265. 771.88 s [duoids-hedgehog] Configuration files installed in:
  4266. 771.88 s [duoids-hedgehog] /nix/store/hmi97yr3s7pq1i2xn2lmawdf52i3cwgn-duoids-hedgehog-0.0.1.0/etc
  4267. 771.88 s [duoids-hedgehog] No alex found
  4268. 771.88 s [duoids-hedgehog] Using ar found on system at:
  4269. 771.88 s [duoids-hedgehog] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
  4270. 771.88 s [duoids-hedgehog] No c2hs found
  4271. 771.88 s [duoids-hedgehog] No cpphs found
  4272. 771.88 s [duoids-hedgehog] Using doctest version 0.24.2 found on system at:
  4273. 771.88 s [duoids-hedgehog] /nix/store/zmwlk8gqk89i9b1qlifd7b9wywswg74r-doctest-0.24.2/bin/doctest
  4274. 771.88 s [duoids-hedgehog] Using gcc version 14.3.0 given by user at:
  4275. 771.88 s [duoids-hedgehog] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
  4276. 771.88 s [duoids-hedgehog] Using ghc version 9.10.2 found on system at:
  4277. 771.88 s [duoids-hedgehog] /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/bin/ghc
  4278. 771.88 s [duoids-hedgehog] Using ghc-pkg version 9.10.2 found on system at:
  4279. 771.88 s [duoids-hedgehog] /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/bin/ghc-pkg-9.10.2
  4280. 771.88 s [duoids-hedgehog] No ghcjs found
  4281. 771.88 s [duoids-hedgehog] No ghcjs-pkg found
  4282. 771.88 s [duoids-hedgehog] No greencard found
  4283. 771.88 s [duoids-hedgehog] Using haddock version 2.31.0 found on system at:
  4284. 771.88 s [duoids-hedgehog] /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/bin/haddock-ghc-9.10.2
  4285. 771.88 s [duoids-hedgehog] No happy found
  4286. 771.88 s [duoids-hedgehog] Using haskell-suite found on system at: haskell-suite-dummy-location
  4287. 771.88 s [duoids-hedgehog] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  4288. 771.88 s [duoids-hedgehog] No hmake found
  4289. 771.88 s [duoids-hedgehog] Using hpc version 0.69 found on system at:
  4290. 771.88 s [duoids-hedgehog] /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/bin/hpc-ghc-9.10.2
  4291. 771.88 s [duoids-hedgehog] Using hsc2hs version 0.68.10 found on system at:
  4292. 771.88 s [duoids-hedgehog] /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/bin/hsc2hs-ghc-9.10.2
  4293. 771.88 s [duoids-hedgehog] Using hscolour version 1.25 found on system at:
  4294. 771.88 s [duoids-hedgehog] /nix/store/kb4afndnwdxxc5ps9k8xv0jzd0a9y8n5-hscolour-1.25/bin/HsColour
  4295. 771.88 s [duoids-hedgehog] No jhc found
  4296. 771.88 s [duoids-hedgehog] Using ld found on system at:
  4297. 771.88 s [duoids-hedgehog] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/ld
  4298. 771.88 s [duoids-hedgehog] No pkg-config found
  4299. 771.88 s [duoids-hedgehog] Using runghc version 9.10.2 found on system at:
  4300. 771.88 s [duoids-hedgehog] /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/bin/runghc-9.10.2
  4301. 771.89 s [duoids-hedgehog] Using strip version 2.44 found on system at:
  4302. 771.89 s [duoids-hedgehog] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
  4303. 771.89 s [duoids-hedgehog] Using tar found on system at:
  4304. 771.89 s [duoids-hedgehog] /nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
  4305. 771.89 s [duoids-hedgehog] No uhc found
  4306. 771.94 s [duoidal-transformers] Preprocessing library for duoidal-transformers-0.0.1.0...
  4307. 771.94 s [duoidal-transformers] Building library for duoidal-transformers-0.0.1.0...
  4308. 772.20 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 )
  4309. 772.23 s [duoids-hedgehog] Phase: buildPhase
  4310. 772.42 s [duoids-hedgehog] Preprocessing library for duoids-hedgehog-0.0.1.0...
  4311. 772.42 s [duoids-hedgehog] Building library for duoids-hedgehog-0.0.1.0...
  4312. 772.74 s [duoids-hedgehog] [1 of 2] Compiling Test.Duoid ( src/Test/Duoid.hs, dist/build/Test/Duoid.o, dist/build/Test/Duoid.dyn_o )
  4313. 772.78 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 )
  4314. 773.84 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 )
  4315. 774.55 s [duoids-hedgehog] [2 of 2] Compiling Test.Duoidal ( src/Test/Duoidal.hs, dist/build/Test/Duoidal.o, dist/build/Test/Duoidal.dyn_o )
  4316. 774.98 s [duoids-hedgehog] [1 of 2] Compiling Test.Duoid ( src/Test/Duoid.hs, dist/build/Test/Duoid.p_o )
  4317. 775.01 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 )
  4318. 775.72 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 )
  4319. 776.15 s [duoids-hedgehog] [2 of 2] Compiling Test.Duoidal ( src/Test/Duoidal.hs, dist/build/Test/Duoidal.p_o )
  4320. 784.48 s [duoidal-transformers] Preprocessing test suite 'doctests' for duoidal-transformers-0.0.1.0...
  4321. 784.49 s [duoidal-transformers] Building test suite 'doctests' for duoidal-transformers-0.0.1.0...
  4322. 784.75 s [duoidal-transformers] [1 of 2] Compiling Build_doctests ( dist/build/doctests/autogen/Build_doctests.hs, dist/build/doctests/doctests-tmp/Build_doctests.o )
  4323. 784.86 s [duoids-hedgehog] Preprocessing test suite 'doctests' for duoids-hedgehog-0.0.1.0...
  4324. 784.86 s [duoids-hedgehog] Building test suite 'doctests' for duoids-hedgehog-0.0.1.0...
  4325. 785.11 s [duoids-hedgehog] [1 of 2] Compiling Build_doctests ( dist/build/doctests/autogen/Build_doctests.hs, dist/build/doctests/doctests-tmp/Build_doctests.o )
  4326. 785.46 s [duoidal-transformers] [2 of 2] Compiling Main ( tests/doctests.hs, dist/build/doctests/doctests-tmp/Main.o )
  4327. 785.91 s [duoids-hedgehog] [2 of 2] Compiling Main ( tests/doctests.hs, dist/build/doctests/doctests-tmp/Main.o )
  4328. 786.69 s [duoidal-transformers] [3 of 3] Linking dist/build/doctests/doctests
  4329. 787.23 s [duoids-hedgehog] [3 of 3] Linking dist/build/doctests/doctests
  4330. 789.24 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 )
  4331. 790.60 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 )
  4332. 790.80 s [vector] [ 2 of 23] Compiling Data.Vector.Fusion.Util ( src/Data/Vector/Fusion/Util.hs, dist/build/Data/Vector/Fusion/Util.p_o )
  4333. 790.85 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 )
  4334. 791.26 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 )
  4335. 791.26 s [vector] [ 5 of 23] Compiling Data.Vector.Generic.Base ( src/Data/Vector/Generic/Base.hs, dist/build/Data/Vector/Generic/Base.p_o )
  4336. 791.26 s [vector] [ 6 of 23] Compiling Data.Vector.Internal.Check ( src/Data/Vector/Internal/Check.hs, dist/build/Data/Vector/Internal/Check.p_o )
  4337. 791.26 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 )
  4338. 793.00 s [duoidal-transformers] Phase: checkPhase
  4339. 793.34 s [duoidal-transformers] Running 1 test suites...
  4340. 793.34 s [duoidal-transformers] Test suite doctests: RUNNING...
  4341. 793.62 s [duoids-hedgehog] Preprocessing test suite 'laws' for duoids-hedgehog-0.0.1.0...
  4342. 793.62 s [duoids-hedgehog] Building test suite 'laws' for duoids-hedgehog-0.0.1.0...
  4343. 793.74 s [duoidal-transformers] on the commandline: warning: [GHC-98887]
  4344. 793.74 s [duoidal-transformers] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  4345. 793.74 s [duoidal-transformers]
  4346. 793.74 s [duoidal-transformers] on the commandline: warning: [GHC-98887]
  4347. 793.74 s [duoidal-transformers] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  4348. 793.74 s [duoidal-transformers]
  4349. 793.75 s [duoidal-transformers] on the commandline: warning: [GHC-98887]
  4350. 793.75 s [duoidal-transformers] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  4351. 793.75 s [duoidal-transformers]
  4352. 793.81 s [duoids-hedgehog] [1 of 1] Compiling Main ( tests/laws.hs, dist/build/laws/laws-tmp/Main.o )
  4353. 794.00 s [duoidal-transformers] Examples: 0 Tried: 0 Errors: 0 Failures: 0
  4354. 794.06 s [duoidal-transformers] NameLib Nothing
  4355. 794.06 s [duoidal-transformers] ----------------------------------------
  4356. 794.07 s [duoidal-transformers] Test suite doctests: PASS
  4357. 794.07 s [duoidal-transformers] Test suite logged to: dist/test/duoidal-transformers-0.0.1.0-doctests.log
  4358. 794.07 s [duoidal-transformers] 1 of 1 test suites (1 of 1 test cases) passed.
  4359. 794.08 s [duoidal-transformers] Phase: haddockPhase
  4360. 794.29 s [duoidal-transformers] Preprocessing library for duoidal-transformers-0.0.1.0...
  4361. 794.29 s [duoidal-transformers] Running Haddock on library for duoidal-transformers-0.0.1.0...
  4362. 794.94 s [duoidal-transformers] [1 of 2] Compiling Control.Duoidal.Trans.Class ( src/Control/Duoidal/Trans/Class.hs, nothing )
  4363. 795.29 s [duoids-hedgehog] [2 of 2] Linking dist/build/laws/laws
  4364. 795.33 s [duoidal-transformers] [2 of 2] Compiling Control.Duoidal.Trans.Orphans ( src/Control/Duoidal/Trans/Orphans.hs, nothing )
  4365. 795.53 s [duoidal-transformers] Haddock coverage:
  4366. 795.53 s [duoidal-transformers] Warning: 'MonadTrans' is out of scope.
  4367. 795.53 s [duoidal-transformers] If you qualify the identifier, haddock can try to link it anyway.
  4368. 795.53 s [duoidal-transformers] 100% ( 3 / 3) in 'Control.Duoidal.Trans.Class'
  4369. 795.53 s [duoidal-transformers] 100% ( 1 / 1) in 'Control.Duoidal.Trans.Orphans'
  4370. 796.59 s [duoids-hedgehog] Phase: checkPhase
  4371. 797.02 s [duoids-hedgehog] Running 2 test suites...
  4372. 797.02 s [duoids-hedgehog] Test suite doctests: RUNNING...
  4373. 798.42 s [duoids-hedgehog] Examples: 0 Tried: 0 Errors: 0 Failures: 0
  4374. 798.56 s [duoids-hedgehog] NameLib Nothing
  4375. 798.56 s [duoids-hedgehog] ----------------------------------------
  4376. 798.58 s [duoids-hedgehog] Test suite doctests: PASS
  4377. 798.58 s [duoids-hedgehog] Test suite logged to: dist/test/duoids-hedgehog-0.0.1.0-doctests.log
  4378. 798.58 s [duoids-hedgehog] Test suite laws: RUNNING...
  4379. 798.59 s [duoids-hedgehog] ━━━ Duoid Int ━━━
  4380. 798.60 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  4381. 798.60 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  4382. 798.60 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  4383. 798.60 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  4384. 798.60 s [duoids-hedgehog] ✓ 4 succeeded.
  4385. 798.60 s [duoids-hedgehog] ━━━ Duoid Int16 ━━━
  4386. 798.60 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  4387. 798.60 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  4388. 798.60 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  4389. 798.60 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  4390. 798.60 s [duoids-hedgehog] ✓ 4 succeeded.
  4391. 798.60 s [duoids-hedgehog] ━━━ Duoid Int32 ━━━
  4392. 798.60 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  4393. 798.60 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  4394. 798.60 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  4395. 798.60 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  4396. 798.60 s [duoids-hedgehog] ✓ 4 succeeded.
  4397. 798.60 s [duoids-hedgehog] ━━━ Duoid Int64 ━━━
  4398. 798.61 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  4399. 798.61 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  4400. 798.61 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  4401. 798.61 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  4402. 798.61 s [duoids-hedgehog] ✓ 4 succeeded.
  4403. 798.61 s [duoids-hedgehog] ━━━ Duoid Int8 ━━━
  4404. 798.61 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  4405. 798.61 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  4406. 798.61 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  4407. 798.61 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  4408. 798.61 s [duoids-hedgehog] ✓ 4 succeeded.
  4409. 798.62 s [duoids-hedgehog] ━━━ Duoid.Normal Natural ━━━
  4410. 798.62 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  4411. 798.62 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  4412. 798.62 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  4413. 798.62 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  4414. 798.62 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  4415. 798.62 s [duoids-hedgehog] ✓ 5 succeeded.
  4416. 798.62 s [duoids-hedgehog] ━━━ Duoid.Normal (Ratio Natural) ━━━
  4417. 798.62 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  4418. 798.62 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  4419. 798.62 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  4420. 798.62 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  4421. 798.62 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  4422. 798.62 s [duoids-hedgehog] ✓ 5 succeeded.
  4423. 798.62 s [duoids-hedgehog] ━━━ Duoid (Ratio Integer) ━━━
  4424. 798.63 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  4425. 798.63 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  4426. 798.63 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  4427. 798.63 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  4428. 798.63 s [duoids-hedgehog] ✓ 4 succeeded.
  4429. 798.63 s [duoids-hedgehog] ━━━ Duoid.Normal Word ━━━
  4430. 798.63 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  4431. 798.63 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  4432. 798.63 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  4433. 798.63 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  4434. 798.63 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  4435. 798.63 s [duoids-hedgehog] ✓ 5 succeeded.
  4436. 798.63 s [duoids-hedgehog] ━━━ Duoid.Normal Word16 ━━━
  4437. 798.63 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  4438. 798.63 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  4439. 798.63 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  4440. 798.63 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  4441. 798.63 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  4442. 798.63 s [duoids-hedgehog] ✓ 5 succeeded.
  4443. 798.63 s [duoids-hedgehog] ━━━ Duoid.Normal Word32 ━━━
  4444. 798.63 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  4445. 798.63 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  4446. 798.63 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  4447. 798.63 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  4448. 798.63 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  4449. 798.63 s [duoids-hedgehog] ✓ 5 succeeded.
  4450. 798.63 s [duoids-hedgehog] ━━━ Duoid.Normal Word64 ━━━
  4451. 798.64 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  4452. 798.64 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  4453. 798.64 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  4454. 798.64 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  4455. 798.64 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  4456. 798.64 s [duoids-hedgehog] ✓ 5 succeeded.
  4457. 798.64 s [duoids-hedgehog] ━━━ Duoid.Normal Word8 ━━━
  4458. 798.64 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  4459. 798.64 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  4460. 798.64 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  4461. 798.64 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  4462. 798.64 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  4463. 798.64 s [duoids-hedgehog] ✓ 5 succeeded.
  4464. 798.64 s [duoids-hedgehog] Test suite laws: PASS
  4465. 798.64 s [duoids-hedgehog] Test suite logged to: dist/test/duoids-hedgehog-0.0.1.0-laws.log
  4466. 798.64 s [duoids-hedgehog] 2 of 2 test suites (2 of 2 test cases) passed.
  4467. 798.80 s [duoids-hedgehog] Phase: haddockPhase
  4468. 799.20 s [duoids-hedgehog] Preprocessing library for duoids-hedgehog-0.0.1.0...
  4469. 799.20 s [duoids-hedgehog] Running Haddock on library for duoids-hedgehog-0.0.1.0...
  4470. 800.09 s [duoids-hedgehog] [1 of 2] Compiling Test.Duoid ( src/Test/Duoid.hs, nothing )
  4471. 800.24 s [vector] [ 8 of 23] Compiling Data.Vector.Fusion.Bundle ( src/Data/Vector/Fusion/Bundle.hs, dist/build/Data/Vector/Fusion/Bundle.p_o )
  4472. 801.32 s [duoids-hedgehog] [2 of 2] Compiling Test.Duoidal ( src/Test/Duoidal.hs, nothing )
  4473. 801.43 s [duoids-hedgehog] Haddock coverage:
  4474. 801.43 s [duoids-hedgehog] 100% ( 3 / 3) in 'Test.Duoid'
  4475. 801.44 s [duoids-hedgehog] 100% ( 2 / 2) in 'Test.Duoidal'
  4476. 804.91 s [vector] [ 9 of 23] Compiling Data.Vector.Generic.Mutable ( src/Data/Vector/Generic/Mutable.hs, dist/build/Data/Vector/Generic/Mutable.p_o )
  4477. 809.68 s [vector] [10 of 23] Compiling Data.Vector.Generic.New ( src/Data/Vector/Generic/New.hs, dist/build/Data/Vector/Generic/New.p_o )
  4478. 810.74 s [vector] [11 of 23] Compiling Data.Vector.Generic ( src/Data/Vector/Generic.hs, dist/build/Data/Vector/Generic.p_o )
  4479. 811.82 s [duoidal-transformers] Documentation created: dist/doc/html/duoidal-transformers/,
  4480. 811.82 s [duoidal-transformers] dist/doc/html/duoidal-transformers/duoidal-transformers.txt
  4481. 811.95 s [duoidal-transformers] Preprocessing test suite 'doctests' for duoidal-transformers-0.0.1.0...
  4482. 811.96 s [duoidal-transformers] Phase: installPhase
  4483. 812.15 s [duoidal-transformers] Installing library in /nix/store/q100bhcm82xglcq9n7pmikbqwpca49ls-duoidal-transformers-0.0.1.0/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-1e2a/duoidal-transformers-0.0.1.0-K4hS8Tqn0Av68PS4VM4Tn0
  4484. 812.64 s [duoidal-transformers] Phase: fixupPhase
  4485. 812.67 s [duoidal-transformers] shrinking RPATHs of ELF executables and libraries in /nix/store/q100bhcm82xglcq9n7pmikbqwpca49ls-duoidal-transformers-0.0.1.0
  4486. 812.68 s [duoidal-transformers] shrinking /nix/store/q100bhcm82xglcq9n7pmikbqwpca49ls-duoidal-transformers-0.0.1.0/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-1e2a/libHSduoidal-transformers-0.0.1.0-K4hS8Tqn0Av68PS4VM4Tn0-ghc9.10.2.so
  4487. 812.68 s [duoidal-transformers] checking for references to /build/ in /nix/store/q100bhcm82xglcq9n7pmikbqwpca49ls-duoidal-transformers-0.0.1.0...
  4488. 812.71 s [duoidal-transformers] patching script interpreter paths in /nix/store/q100bhcm82xglcq9n7pmikbqwpca49ls-duoidal-transformers-0.0.1.0
  4489. 812.72 s [duoidal-transformers] stripping (with command strip and flags -S -p) in /nix/store/q100bhcm82xglcq9n7pmikbqwpca49ls-duoidal-transformers-0.0.1.0/lib
  4490. 812.77 s [duoidal-transformers] shrinking RPATHs of ELF executables and libraries in /nix/store/3v34zwy744ha74cnpknxqjfbqazdpy1p-duoidal-transformers-0.0.1.0-doc
  4491. 812.78 s [duoidal-transformers] checking for references to /build/ in /nix/store/3v34zwy744ha74cnpknxqjfbqazdpy1p-duoidal-transformers-0.0.1.0-doc...
  4492. 812.80 s [duoidal-transformers] patching script interpreter paths in /nix/store/3v34zwy744ha74cnpknxqjfbqazdpy1p-duoidal-transformers-0.0.1.0-doc
  4493. 813.02 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/3v34zwy744ha74cnpknxqjfbqazdpy1p-duoidal-transformers-0.0.1.0-doc /nix/store/q100bhcm82xglcq9n7pmikbqwpca49ls-duoidal-transformers-0.0.1.0
  4494. 813.55 s [post-build-hook] Pushing 2 paths (74 are already present) using zstd to cache sellout ⏳
  4495. 813.55 s [post-build-hook]
  4496. 813.94 s [post-build-hook] Pushing /nix/store/3v34zwy744ha74cnpknxqjfbqazdpy1p-duoidal-transformers-0.0.1.0-doc (347.32 KiB)
  4497. 814.11 s [post-build-hook] Pushing /nix/store/q100bhcm82xglcq9n7pmikbqwpca49ls-duoidal-transformers-0.0.1.0 (675.42 KiB)
  4498. 815.11 s [post-build-hook]
  4499. 815.13 s [post-build-hook] All done.
  4500. 815.14 s [post-build-hook] Uploading to the NixCI cache: /nix/store/3v34zwy744ha74cnpknxqjfbqazdpy1p-duoidal-transformers-0.0.1.0-doc /nix/store/q100bhcm82xglcq9n7pmikbqwpca49ls-duoidal-transformers-0.0.1.0
  4501. 815.20 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  4502. 815.22 s [post-build-hook] copying 2 paths...
  4503. 815.22 s [post-build-hook] copying path '/nix/store/3v34zwy744ha74cnpknxqjfbqazdpy1p-duoidal-transformers-0.0.1.0-doc' to 'https://cache.nix-ci.com'...
  4504. 815.48 s [post-build-hook] copying path '/nix/store/q100bhcm82xglcq9n7pmikbqwpca49ls-duoidal-transformers-0.0.1.0' to 'https://cache.nix-ci.com'...
  4505. 816.51 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  4506. 816.73 s [post-build-hook] copying 1 paths...
  4507. 816.73 s [post-build-hook] copying path '/nix/store/ydgj2659qplclv1b7xg1qgr3yyba3xif-duoidal-transformers-0.0.1.0.drv' to 'https://cache.nix-ci.com'...
  4508. 816.95 s Progress: 7 of 21 built (2 building), 177 of 177 downloaded from cache
  4509. 817.78 s [duoids-hedgehog] Documentation created: dist/doc/html/duoids-hedgehog/,
  4510. 817.78 s [duoids-hedgehog] dist/doc/html/duoids-hedgehog/duoids-hedgehog.txt
  4511. 817.87 s [duoids-hedgehog] Preprocessing test suite 'doctests' for duoids-hedgehog-0.0.1.0...
  4512. 817.87 s [duoids-hedgehog] Preprocessing test suite 'laws' for duoids-hedgehog-0.0.1.0...
  4513. 817.88 s [duoids-hedgehog] Phase: installPhase
  4514. 818.01 s [duoids-hedgehog] Installing library in /nix/store/hmi97yr3s7pq1i2xn2lmawdf52i3cwgn-duoids-hedgehog-0.0.1.0/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-1e2a/duoids-hedgehog-0.0.1.0-5gSNeuVBdOQDy9trKqTi02
  4515. 818.35 s [duoids-hedgehog] Phase: fixupPhase
  4516. 818.37 s [duoids-hedgehog] shrinking RPATHs of ELF executables and libraries in /nix/store/hmi97yr3s7pq1i2xn2lmawdf52i3cwgn-duoids-hedgehog-0.0.1.0
  4517. 818.38 s [duoids-hedgehog] shrinking /nix/store/hmi97yr3s7pq1i2xn2lmawdf52i3cwgn-duoids-hedgehog-0.0.1.0/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-1e2a/libHSduoids-hedgehog-0.0.1.0-5gSNeuVBdOQDy9trKqTi02-ghc9.10.2.so
  4518. 818.39 s [duoids-hedgehog] checking for references to /build/ in /nix/store/hmi97yr3s7pq1i2xn2lmawdf52i3cwgn-duoids-hedgehog-0.0.1.0...
  4519. 818.41 s [duoids-hedgehog] patching script interpreter paths in /nix/store/hmi97yr3s7pq1i2xn2lmawdf52i3cwgn-duoids-hedgehog-0.0.1.0
  4520. 818.42 s [duoids-hedgehog] stripping (with command strip and flags -S -p) in /nix/store/hmi97yr3s7pq1i2xn2lmawdf52i3cwgn-duoids-hedgehog-0.0.1.0/lib
  4521. 818.45 s [duoids-hedgehog] shrinking RPATHs of ELF executables and libraries in /nix/store/wjvw8frmsxhz52aqa8pfcyrhsl8j33gg-duoids-hedgehog-0.0.1.0-doc
  4522. 818.46 s [duoids-hedgehog] checking for references to /build/ in /nix/store/wjvw8frmsxhz52aqa8pfcyrhsl8j33gg-duoids-hedgehog-0.0.1.0-doc...
  4523. 818.48 s [duoids-hedgehog] patching script interpreter paths in /nix/store/wjvw8frmsxhz52aqa8pfcyrhsl8j33gg-duoids-hedgehog-0.0.1.0-doc
  4524. 818.67 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/hmi97yr3s7pq1i2xn2lmawdf52i3cwgn-duoids-hedgehog-0.0.1.0 /nix/store/wjvw8frmsxhz52aqa8pfcyrhsl8j33gg-duoids-hedgehog-0.0.1.0-doc
  4525. 819.14 s [post-build-hook] Pushing 2 paths (136 are already present) using zstd to cache sellout ⏳
  4526. 819.14 s [post-build-hook]
  4527. 819.52 s [post-build-hook] Pushing /nix/store/hmi97yr3s7pq1i2xn2lmawdf52i3cwgn-duoids-hedgehog-0.0.1.0 (537.87 KiB)
  4528. 819.56 s [post-build-hook] Pushing /nix/store/wjvw8frmsxhz52aqa8pfcyrhsl8j33gg-duoids-hedgehog-0.0.1.0-doc (301.60 KiB)
  4529. 820.45 s [post-build-hook]
  4530. 820.47 s [post-build-hook] All done.
  4531. 820.48 s [post-build-hook] Uploading to the NixCI cache: /nix/store/hmi97yr3s7pq1i2xn2lmawdf52i3cwgn-duoids-hedgehog-0.0.1.0 /nix/store/wjvw8frmsxhz52aqa8pfcyrhsl8j33gg-duoids-hedgehog-0.0.1.0-doc
  4532. 820.54 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  4533. 820.56 s [post-build-hook] copying 19 paths...
  4534. 820.56 s [post-build-hook] copying path '/nix/store/jnrdq2jlpyxb26r5xzkfw540a432pcig-erf-2.0.0.0-doc' to 'https://cache.nix-ci.com'...
  4535. 820.56 s [post-build-hook] copying path '/nix/store/9am0ii2gi4daa0xa6xbw9p03n0s7k7la-lifted-base-0.2.3.12-doc' to 'https://cache.nix-ci.com'...
  4536. 820.56 s [post-build-hook] copying path '/nix/store/slvwm454bf5nydv2asshi5130xnv4wl2-barbies-2.1.1.0-doc' to 'https://cache.nix-ci.com'...
  4537. 820.56 s [post-build-hook] copying path '/nix/store/lrc7ljdmkjr8s2jhccpn57y63xfahn3q-wl-pprint-annotated-0.1.0.1-doc' to 'https://cache.nix-ci.com'...
  4538. 820.56 s [post-build-hook] copying path '/nix/store/wj3k3bv2lkgndjkkldx5znb19fv7r07m-pretty-show-1.10-data' to 'https://cache.nix-ci.com'...
  4539. 820.56 s [post-build-hook] copying path '/nix/store/l8zqgb7chr6cq4lygq2gihwch23gfy58-concurrent-output-1.10.21-doc' to 'https://cache.nix-ci.com'...
  4540. 820.82 s [post-build-hook] copying path '/nix/store/hm4mnnp154blggdcc7mg6mmbcs6zjp76-pretty-show-1.10-doc' to 'https://cache.nix-ci.com'...
  4541. 820.86 s [post-build-hook] copying path '/nix/store/z29n10vyzhlh6j6bffhw5w82b9y39h7i-erf-2.0.0.0' to 'https://cache.nix-ci.com'...
  4542. 820.94 s [post-build-hook] copying path '/nix/store/w07ijhjbpgqnni69pjyg36kd62fjzkhh-lifted-base-0.2.3.12' to 'https://cache.nix-ci.com'...
  4543. 820.94 s [post-build-hook] copying path '/nix/store/5az5j7n587wamnd5118vwqiq2cwc142y-lifted-async-0.10.2.7-doc' to 'https://cache.nix-ci.com'...
  4544. 820.98 s [post-build-hook] copying path '/nix/store/b8mlz83j47f7y9wdrkymc1kdh1qn6jsm-wl-pprint-annotated-0.1.0.1' to 'https://cache.nix-ci.com'...
  4545. 820.99 s [post-build-hook] copying path '/nix/store/6si8zsjbgams5g95mn38388hi5s0xa2g-concurrent-output-1.10.21' to 'https://cache.nix-ci.com'...
  4546. 821.37 s [post-build-hook] copying path '/nix/store/jhyi7rbfn0404s8wv41xb5b7zhmpzzsa-pretty-show-1.10' to 'https://cache.nix-ci.com'...
  4547. 821.49 s [post-build-hook] copying path '/nix/store/vndl7knv97k4cjlfg75znwfdkf5mda5r-lifted-async-0.10.2.7' to 'https://cache.nix-ci.com'...
  4548. 821.90 s [post-build-hook] copying path '/nix/store/0wv7zyqwf2w1j0wplid6xdb4i67dx30y-barbies-2.1.1.0' to 'https://cache.nix-ci.com'...
  4549. 821.90 s [post-build-hook] copying path '/nix/store/97nw0pcvws89f6mk0rp6cw2my45c740c-hedgehog-1.5-doc' to 'https://cache.nix-ci.com'...
  4550. 825.55 s [post-build-hook] copying path '/nix/store/wjvw8frmsxhz52aqa8pfcyrhsl8j33gg-duoids-hedgehog-0.0.1.0-doc' to 'https://cache.nix-ci.com'...
  4551. 825.58 s [post-build-hook] copying path '/nix/store/4a5757hy61mya8xkrx5rqw899yn4q840-hedgehog-1.5' to 'https://cache.nix-ci.com'...
  4552. 836.93 s [post-build-hook] copying path '/nix/store/hmi97yr3s7pq1i2xn2lmawdf52i3cwgn-duoids-hedgehog-0.0.1.0' to 'https://cache.nix-ci.com'...
  4553. 837.78 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  4554. 838.14 s [post-build-hook] copying 1 paths...
  4555. 838.14 s [post-build-hook] copying path '/nix/store/k4l6krqhqm445ra8qvzjhxlg5lgj4hv6-duoids-hedgehog-0.0.1.0.drv' to 'https://cache.nix-ci.com'...
  4556. 838.45 s Progress: 8 of 20 built (1 building), 177 of 177 downloaded from cache
  4557. 838.45 s [vector] [12 of 23] Compiling Data.Vector.Mutable ( src/Data/Vector/Mutable.hs, dist/build/Data/Vector/Mutable.p_o )
  4558. 838.45 s [vector] [13 of 23] Compiling Data.Vector ( src/Data/Vector.hs, dist/build/Data/Vector.p_o )
  4559. 838.45 s [vector] [14 of 23] Compiling Data.Vector.Primitive.Mutable ( src/Data/Vector/Primitive/Mutable.hs, dist/build/Data/Vector/Primitive/Mutable.p_o )
  4560. 838.45 s [vector] [15 of 23] Compiling Data.Vector.Primitive ( src/Data/Vector/Primitive.hs, dist/build/Data/Vector/Primitive.p_o )
  4561. 838.45 s [vector] [16 of 23] Compiling Data.Vector.Storable.Internal ( src/Data/Vector/Storable/Internal.hs, dist/build/Data/Vector/Storable/Internal.p_o )
  4562. 838.45 s [vector] [17 of 23] Compiling Data.Vector.Storable.Mutable ( src/Data/Vector/Storable/Mutable.hs, dist/build/Data/Vector/Storable/Mutable.p_o )
  4563. 838.45 s [vector] [18 of 23] Compiling Data.Vector.Storable ( src/Data/Vector/Storable.hs, dist/build/Data/Vector/Storable.p_o )
  4564. 838.45 s [vector] [19 of 23] Compiling Data.Vector.Strict.Mutable ( src/Data/Vector/Strict/Mutable.hs, dist/build/Data/Vector/Strict/Mutable.p_o )
  4565. 838.45 s [vector] [20 of 23] Compiling Data.Vector.Strict ( src/Data/Vector/Strict.hs, dist/build/Data/Vector/Strict.p_o )
  4566. 853.75 s [vector] [21 of 23] Compiling Data.Vector.Unboxed.Base ( src/Data/Vector/Unboxed/Base.hs, dist/build/Data/Vector/Unboxed/Base.p_o )
  4567. 865.03 s [vector] [22 of 23] Compiling Data.Vector.Unboxed ( src/Data/Vector/Unboxed.hs, dist/build/Data/Vector/Unboxed.p_o )
  4568. 876.55 s [vector] [23 of 23] Compiling Data.Vector.Unboxed.Mutable ( src/Data/Vector/Unboxed/Mutable.hs, dist/build/Data/Vector/Unboxed/Mutable.p_o )
  4569. 878.55 s [vector] Preprocessing test suite 'vector-tests-O0' for vector-0.13.2.0...
  4570. 878.55 s [vector] Building test suite 'vector-tests-O0' for vector-0.13.2.0...
  4571. 878.70 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 )
  4572. 878.88 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 )
  4573. 880.52 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 )
  4574. 880.52 s [vector] tests/Utilities.hs:244:17: warning: [GHC-63394] [-Wx-partial]
  4575. 880.52 s [vector] In the use of ‘tail’
  4576. 880.52 s [vector] (imported from Prelude, but defined in GHC.Internal.List):
  4577. 880.52 s [vector] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  4578. 880.52 s [vector] |
  4579. 880.52 s [vector] 244 | postscanl f z = tail . scanl f z
  4580. 880.52 s [vector] | ^^^^
  4581. 880.52 s [vector]
  4582. 880.52 s [vector] tests/Utilities.hs:245:16: warning: [GHC-63394] [-Wx-partial]
  4583. 880.52 s [vector] In the use of ‘tail’
  4584. 880.52 s [vector] (imported from Prelude, but defined in GHC.Internal.List):
  4585. 880.52 s [vector] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  4586. 880.52 s [vector] |
  4587. 880.52 s [vector] 245 | prescanr f z = tail . scanr f z
  4588. 880.52 s [vector] | ^^^^
  4589. 880.52 s [vector]
  4590. 880.52 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 )
  4591. 880.52 s [vector] tests/Tests/Vector/Property.hs:243:68: warning: [GHC-63394] [-Wx-partial]
  4592. 880.52 s [vector] In the use of ‘head’
  4593. 880.52 s [vector] (imported from Data.List, but defined in GHC.Internal.List):
  4594. 880.52 s [vector] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  4595. 880.52 s [vector] |
  4596. 880.52 s [vector] 243 | prop_head :: P (v a -> a) = not . V.null ===> V.head `eq` head
  4597. 880.52 s [vector] | ^^^^
  4598. 880.52 s [vector]
  4599. 880.52 s [vector] tests/Tests/Vector/Property.hs:256:76: warning: [GHC-63394] [-Wx-partial]
  4600. 880.52 s [vector] In the use of ‘head’
  4601. 880.52 s [vector] (imported from Data.List, but defined in GHC.Internal.List):
  4602. 880.52 s [vector] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  4603. 880.52 s [vector] |
  4604. 880.52 s [vector] 256 | prop_unsafeHead :: P (v a -> a) = not . V.null ===> V.unsafeHead `eq` head
  4605. 880.52 s [vector] | ^^^^
  4606. 880.52 s [vector]
  4607. 880.52 s [vector] tests/Tests/Vector/Property.hs:272:65: warning: [GHC-63394] [-Wx-partial]
  4608. 880.52 s [vector] In the use of ‘tail’
  4609. 880.52 s [vector] (imported from Data.List, but defined in GHC.Internal.List):
  4610. 880.52 s [vector] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  4611. 880.52 s [vector] |
  4612. 880.52 s [vector] 272 | prop_tail :: P (v a -> v a) = not . V.null ===> V.tail `eq` tail
  4613. 880.52 s [vector] | ^^^^
  4614. 880.52 s [vector]
  4615. 880.52 s [vector] tests/Tests/Vector/Property.hs:439:26: warning: [GHC-63394] [-Wx-partial]
  4616. 880.52 s [vector] In the use of ‘head’
  4617. 880.52 s [vector] (imported from Data.List, but defined in GHC.Internal.List):
  4618. 880.52 s [vector] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  4619. 880.52 s [vector] |
  4620. 880.52 s [vector] 439 | = V.uniq `eq` (map head . group)
  4621. 880.52 s [vector] | ^^^^
  4622. 880.52 s [vector]
  4623. 881.69 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 )
  4624. 881.86 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 )
  4625. 881.86 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 )
  4626. 881.86 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 )
  4627. 881.86 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 )
  4628. 881.86 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 )
  4629. 881.86 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 )
  4630. 881.86 s [vector] tests/Tests/Bundle.hs:16:29: warning: [GHC-38856] [-Wunused-imports]
  4631. 881.86 s [vector] The import of ‘foldl'’ from module ‘Data.List’ is redundant
  4632. 881.86 s [vector] |
  4633. 881.86 s [vector] 16 | import Data.List (foldl', foldl1', unfoldr, find, findIndex)
  4634. 881.86 s [vector] | ^^^^^^
  4635. 881.86 s [vector]
  4636. 881.86 s [vector] tests/Tests/Bundle.hs:76:77: warning: [GHC-63394] [-Wx-partial]
  4637. 881.86 s [vector] In the use of ‘head’
  4638. 881.86 s [vector] (imported from Prelude, but defined in GHC.Internal.List):
  4639. 881.86 s [vector] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  4640. 881.86 s [vector] |
  4641. 881.86 s [vector] 76 | prop_head :: P (S.Bundle v a -> a) = not . S.null ===> S.head `eq` head
  4642. 881.86 s [vector] | ^^^^
  4643. 881.86 s [vector]
  4644. 881.86 s [vector] tests/Tests/Bundle.hs:92:83: warning: [GHC-63394] [-Wx-partial]
  4645. 881.86 s [vector] In the use of ‘tail’
  4646. 881.86 s [vector] (imported from Prelude, but defined in GHC.Internal.List):
  4647. 881.86 s [vector] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  4648. 881.86 s [vector] |
  4649. 881.86 s [vector] 92 | prop_tail :: P (S.Bundle v a -> S.Bundle v a) = not . S.null ===> S.tail `eq` tail
  4650. 881.86 s [vector] | ^^^^
  4651. 881.86 s [vector]
  4652. 881.86 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 )
  4653. 882.50 s [vector] [13 of 13] Linking dist/build/vector-tests-O0/vector-tests-O0
  4654. 883.66 s [vector] Preprocessing library 'benchmarks-O2' for vector-0.13.2.0...
  4655. 883.66 s [vector] Building library 'benchmarks-O2' for vector-0.13.2.0...
  4656. 883.76 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 )
  4657. 885.67 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 )
  4658. 885.67 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 )
  4659. 885.92 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 )
  4660. 885.92 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 )
  4661. 885.92 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 )
  4662. 885.92 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 )
  4663. 885.92 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 )
  4664. 885.92 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 )
  4665. 885.92 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 )
  4666. 885.92 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 )
  4667. 885.92 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 )
  4668. 885.92 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 )
  4669. 885.92 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 )
  4670. 886.28 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 )
  4671. 888.61 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 )
  4672. 888.63 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 )
  4673. 889.00 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 )
  4674. 889.00 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 )
  4675. 889.00 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 )
  4676. 889.00 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 )
  4677. 889.00 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 )
  4678. 889.00 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 )
  4679. 889.00 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 )
  4680. 889.00 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 )
  4681. 889.00 s [vector] [12 of 14] Compiling Bench.Vector.Tasty ( benchlib/Bench/Vector/Tasty.hs, dist/build/benchmarks-O2/Bench/Vector/Tasty.p_o )
  4682. 889.00 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 )
  4683. 889.00 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 )
  4684. 891.09 s [vector] Preprocessing test suite 'vector-doctest' for vector-0.13.2.0...
  4685. 891.09 s [vector] Building test suite 'vector-doctest' for vector-0.13.2.0...
  4686. 891.18 s [vector] [1 of 1] Compiling Main ( tests/doctests.hs, dist/build/vector-doctest/vector-doctest-tmp/Main.o )
  4687. 891.67 s [vector] [2 of 2] Linking dist/build/vector-doctest/vector-doctest
  4688. 896.35 s [vector] Preprocessing test suite 'vector-inspection' for vector-0.13.2.0...
  4689. 896.35 s [vector] Building test suite 'vector-inspection' for vector-0.13.2.0...
  4690. 896.52 s [vector] [1 of 4] Compiling Inspect ( tests-inspect/Inspect.hs, dist/build/vector-inspection/vector-inspection-tmp/Inspect.o )
  4691. 897.31 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 )
  4692. 897.31 s [vector] [3 of 4] Compiling Inspect.DerivingVia ( tests-inspect/Inspect/DerivingVia.hs, dist/build/vector-inspection/vector-inspection-tmp/Inspect/DerivingVia.o )
  4693. 898.41 s [vector] [4 of 4] Compiling Main ( tests-inspect/main.hs, dist/build/vector-inspection/vector-inspection-tmp/Main.o )
  4694. 899.13 s [vector] [5 of 5] Linking dist/build/vector-inspection/vector-inspection
  4695. 900.03 s [vector] Preprocessing test suite 'vector-tests-O2' for vector-0.13.2.0...
  4696. 900.03 s [vector] Building test suite 'vector-tests-O2' for vector-0.13.2.0...
  4697. 900.16 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 )
  4698. 900.35 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 )
  4699. 911.45 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 )
  4700. 911.48 s [vector] tests/Utilities.hs:244:17: warning: [GHC-63394] [-Wx-partial]
  4701. 911.48 s [vector] In the use of ‘tail’
  4702. 911.48 s [vector] (imported from Prelude, but defined in GHC.Internal.List):
  4703. 911.48 s [vector] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  4704. 911.48 s [vector] |
  4705. 911.48 s [vector] 244 | postscanl f z = tail . scanl f z
  4706. 911.48 s [vector] | ^^^^
  4707. 911.48 s [vector]
  4708. 911.48 s [vector] tests/Utilities.hs:245:16: warning: [GHC-63394] [-Wx-partial]
  4709. 911.48 s [vector] In the use of ‘tail’
  4710. 911.48 s [vector] (imported from Prelude, but defined in GHC.Internal.List):
  4711. 911.48 s [vector] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  4712. 911.48 s [vector] |
  4713. 911.48 s [vector] 245 | prescanr f z = tail . scanr f z
  4714. 911.48 s [vector] | ^^^^
  4715. 911.48 s [vector]
  4716. 911.48 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 )
  4717. 911.48 s [vector] tests/Tests/Vector/Property.hs:243:68: warning: [GHC-63394] [-Wx-partial]
  4718. 911.48 s [vector] In the use of ‘head’
  4719. 911.48 s [vector] (imported from Data.List, but defined in GHC.Internal.List):
  4720. 911.48 s [vector] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  4721. 911.48 s [vector] |
  4722. 911.48 s [vector] 243 | prop_head :: P (v a -> a) = not . V.null ===> V.head `eq` head
  4723. 911.48 s [vector] | ^^^^
  4724. 911.48 s [vector]
  4725. 911.48 s [vector] tests/Tests/Vector/Property.hs:256:76: warning: [GHC-63394] [-Wx-partial]
  4726. 911.48 s [vector] In the use of ‘head’
  4727. 911.48 s [vector] (imported from Data.List, but defined in GHC.Internal.List):
  4728. 911.48 s [vector] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  4729. 911.48 s [vector] |
  4730. 911.48 s [vector] 256 | prop_unsafeHead :: P (v a -> a) = not . V.null ===> V.unsafeHead `eq` head
  4731. 911.48 s [vector] | ^^^^
  4732. 911.48 s [vector]
  4733. 911.48 s [vector] tests/Tests/Vector/Property.hs:272:65: warning: [GHC-63394] [-Wx-partial]
  4734. 911.48 s [vector] In the use of ‘tail’
  4735. 911.48 s [vector] (imported from Data.List, but defined in GHC.Internal.List):
  4736. 911.48 s [vector] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  4737. 911.48 s [vector] |
  4738. 911.48 s [vector] 272 | prop_tail :: P (v a -> v a) = not . V.null ===> V.tail `eq` tail
  4739. 911.48 s [vector] | ^^^^
  4740. 911.48 s [vector]
  4741. 911.48 s [vector] tests/Tests/Vector/Property.hs:439:26: warning: [GHC-63394] [-Wx-partial]
  4742. 911.48 s [vector] In the use of ‘head’
  4743. 911.48 s [vector] (imported from Data.List, but defined in GHC.Internal.List):
  4744. 911.48 s [vector] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  4745. 911.48 s [vector] |
  4746. 911.48 s [vector] 439 | = V.uniq `eq` (map head . group)
  4747. 911.48 s [vector] | ^^^^
  4748. 911.48 s [vector]
  4749. 922.89 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 )
  4750. 943.85 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 )
  4751. 943.86 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 )
  4752. 943.86 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 )
  4753. 943.86 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 )
  4754. 943.86 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 )
  4755. 943.86 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 )
  4756. 943.86 s [vector] tests/Tests/Bundle.hs:16:29: warning: [GHC-38856] [-Wunused-imports]
  4757. 943.86 s [vector] The import of ‘foldl'’ from module ‘Data.List’ is redundant
  4758. 943.86 s [vector] |
  4759. 943.86 s [vector] 16 | import Data.List (foldl', foldl1', unfoldr, find, findIndex)
  4760. 943.86 s [vector] | ^^^^^^
  4761. 943.86 s [vector]
  4762. 943.86 s [vector] tests/Tests/Bundle.hs:76:77: warning: [GHC-63394] [-Wx-partial]
  4763. 943.86 s [vector] In the use of ‘head’
  4764. 943.86 s [vector] (imported from Prelude, but defined in GHC.Internal.List):
  4765. 943.86 s [vector] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  4766. 943.86 s [vector] |
  4767. 943.86 s [vector] 76 | prop_head :: P (S.Bundle v a -> a) = not . S.null ===> S.head `eq` head
  4768. 943.86 s [vector] | ^^^^
  4769. 943.86 s [vector]
  4770. 943.86 s [vector] tests/Tests/Bundle.hs:92:83: warning: [GHC-63394] [-Wx-partial]
  4771. 943.86 s [vector] In the use of ‘tail’
  4772. 943.86 s [vector] (imported from Prelude, but defined in GHC.Internal.List):
  4773. 943.86 s [vector] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  4774. 943.86 s [vector] |
  4775. 943.86 s [vector] 92 | prop_tail :: P (S.Bundle v a -> S.Bundle v a) = not . S.null ===> S.tail `eq` tail
  4776. 943.86 s [vector] | ^^^^
  4777. 943.86 s [vector]
  4778. 943.86 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 )
  4779. 944.66 s [vector] [13 of 13] Linking dist/build/vector-tests-O2/vector-tests-O2
  4780. 945.85 s [vector] buildPhase completed in 4 minutes 5 seconds
  4781. 945.85 s [vector] Phase: checkPhase
  4782. 946.11 s [vector] Running 2 test suites...
  4783. 946.11 s [vector] Test suite vector-tests-O0: RUNNING...
  4784. 946.21 s [vector] toplevel
  4785. 946.21 s [vector] Data.Vector.Fusion.Bundle
  4786. 946.21 s [vector] fromList.toList == id: OK
  4787. 946.21 s [vector] +++ OK, passed 100 tests.
  4788. 946.21 s [vector] toList.fromList == id: OK
  4789. 946.21 s [vector] +++ OK, passed 100 tests.
  4790. 946.21 s [vector] eq: OK
  4791. 946.21 s [vector] +++ OK, passed 100 tests.
  4792. 946.21 s [vector] length: OK
  4793. 946.21 s [vector] +++ OK, passed 100 tests.
  4794. 946.21 s [vector] null: OK
  4795. 946.22 s [vector] +++ OK, passed 100 tests.
  4796. 946.22 s [vector] empty: OK
  4797. 946.22 s [vector] +++ OK, passed 100 tests.
  4798. 946.22 s [vector] singleton: OK
  4799. 946.22 s [vector] +++ OK, passed 100 tests.
  4800. 946.22 s [vector] replicate: OK
  4801. 946.22 s [vector] +++ OK, passed 100 tests.
  4802. 946.22 s [vector] cons: OK
  4803. 946.22 s [vector] +++ OK, passed 100 tests.
  4804. 946.22 s [vector] snoc: OK
  4805. 946.22 s [vector] +++ OK, passed 100 tests.
  4806. 946.22 s [vector] append: OK
  4807. 946.22 s [vector] +++ OK, passed 100 tests.
  4808. 946.22 s [vector] head: OK
  4809. 946.23 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4810. 946.23 s [vector] last: OK
  4811. 946.23 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4812. 946.23 s [vector] index: OK
  4813. 946.23 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4814. 946.23 s [vector] extract: OK
  4815. 946.23 s [vector] +++ OK, passed 100 tests.
  4816. 946.23 s [vector] init: OK
  4817. 946.23 s [vector] +++ OK, passed 100 tests; 18 discarded.
  4818. 946.23 s [vector] tail: OK
  4819. 946.23 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4820. 946.23 s [vector] take: OK
  4821. 946.23 s [vector] +++ OK, passed 100 tests.
  4822. 946.23 s [vector] drop: OK
  4823. 946.23 s [vector] +++ OK, passed 100 tests.
  4824. 946.23 s [vector] map: OK
  4825. 946.23 s [vector] +++ OK, passed 100 tests.
  4826. 946.23 s [vector] zipWith: OK
  4827. 946.23 s [vector] +++ OK, passed 100 tests.
  4828. 946.23 s [vector] zipWith3: OK
  4829. 946.23 s [vector] +++ OK, passed 100 tests.
  4830. 946.23 s [vector] filter: OK
  4831. 946.23 s [vector] +++ OK, passed 100 tests.
  4832. 946.23 s [vector] takeWhile: OK
  4833. 946.23 s [vector] +++ OK, passed 100 tests.
  4834. 946.23 s [vector] dropWhile: OK
  4835. 946.23 s [vector] +++ OK, passed 100 tests.
  4836. 946.23 s [vector] elem: OK
  4837. 946.23 s [vector] +++ OK, passed 100 tests.
  4838. 946.23 s [vector] notElem: OK
  4839. 946.23 s [vector] +++ OK, passed 100 tests.
  4840. 946.23 s [vector] find: OK
  4841. 946.23 s [vector] +++ OK, passed 100 tests.
  4842. 946.23 s [vector] findIndex: OK
  4843. 946.23 s [vector] +++ OK, passed 100 tests.
  4844. 946.23 s [vector] foldl: OK
  4845. 946.23 s [vector] +++ OK, passed 100 tests.
  4846. 946.23 s [vector] foldl1: OK
  4847. 946.23 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4848. 946.23 s [vector] foldl': OK
  4849. 946.23 s [vector] +++ OK, passed 100 tests.
  4850. 946.23 s [vector] foldl1': OK
  4851. 946.23 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4852. 946.23 s [vector] foldr: OK
  4853. 946.23 s [vector] +++ OK, passed 100 tests.
  4854. 946.23 s [vector] foldr1: OK
  4855. 946.23 s [vector] +++ OK, passed 100 tests; 25 discarded.
  4856. 946.23 s [vector] prescanl: OK
  4857. 946.23 s [vector] +++ OK, passed 100 tests.
  4858. 946.23 s [vector] prescanl': OK
  4859. 946.23 s [vector] +++ OK, passed 100 tests.
  4860. 946.23 s [vector] postscanl: OK
  4861. 946.23 s [vector] +++ OK, passed 100 tests.
  4862. 946.23 s [vector] postscanl': OK
  4863. 946.23 s [vector] +++ OK, passed 100 tests.
  4864. 946.23 s [vector] scanl: OK
  4865. 946.23 s [vector] +++ OK, passed 100 tests.
  4866. 946.23 s [vector] scanl': OK
  4867. 946.23 s [vector] +++ OK, passed 100 tests.
  4868. 946.23 s [vector] scanl1: OK
  4869. 946.23 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4870. 946.23 s [vector] scanl1': OK
  4871. 946.23 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4872. 946.23 s [vector] concatMap: OK
  4873. 946.23 s [vector] +++ OK, passed 100 tests.
  4874. 946.23 s [vector] unfoldr: OK
  4875. 946.23 s [vector] +++ OK, passed 100 tests.
  4876. 946.23 s [vector] and: OK
  4877. 946.23 s [vector] +++ OK, passed 100 tests.
  4878. 946.23 s [vector] or: OK
  4879. 946.24 s [vector] +++ OK, passed 100 tests.
  4880. 946.24 s [vector] Tests.Vector.Boxed
  4881. 946.24 s [vector] Bool
  4882. 946.24 s [vector] fromList.toList == id: OK
  4883. 946.24 s [vector] +++ OK, passed 100 tests.
  4884. 946.24 s [vector] toList.fromList == id: OK
  4885. 946.24 s [vector] +++ OK, passed 100 tests.
  4886. 946.24 s [vector] unstream.stream == id: OK
  4887. 946.24 s [vector] +++ OK, passed 100 tests.
  4888. 946.24 s [vector] stream.unstream == id: OK
  4889. 946.24 s [vector] +++ OK, passed 100 tests.
  4890. 946.24 s [vector] eq: OK
  4891. 946.24 s [vector] +++ OK, passed 100 tests.
  4892. 946.24 s [vector] length: OK
  4893. 946.24 s [vector] +++ OK, passed 100 tests.
  4894. 946.24 s [vector] null: OK
  4895. 946.24 s [vector] +++ OK, passed 100 tests.
  4896. 946.24 s [vector] index: OK
  4897. 946.24 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4898. 946.24 s [vector] safeIndex: OK
  4899. 946.24 s [vector] +++ OK, passed 100 tests.
  4900. 946.24 s [vector] head: OK
  4901. 946.24 s [vector] +++ OK, passed 100 tests; 21 discarded.
  4902. 946.24 s [vector] last: OK
  4903. 946.24 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4904. 946.24 s [vector] unsafeIndex: OK
  4905. 946.24 s [vector] +++ OK, passed 100 tests; 13 discarded.
  4906. 946.24 s [vector] unsafeHead: OK
  4907. 946.24 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4908. 946.24 s [vector] unsafeLast: OK
  4909. 946.24 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4910. 946.24 s [vector] slice: OK
  4911. 946.24 s [vector] +++ OK, passed 100 tests.
  4912. 946.24 s [vector] init: OK
  4913. 946.24 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4914. 946.24 s [vector] tail: OK
  4915. 946.24 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4916. 946.24 s [vector] take: OK
  4917. 946.24 s [vector] +++ OK, passed 100 tests.
  4918. 946.24 s [vector] drop: OK
  4919. 946.24 s [vector] +++ OK, passed 100 tests.
  4920. 946.24 s [vector] splitAt: OK
  4921. 946.24 s [vector] +++ OK, passed 100 tests.
  4922. 946.24 s [vector] empty: OK
  4923. 946.24 s [vector] +++ OK, passed 100 tests.
  4924. 946.24 s [vector] singleton: OK
  4925. 946.24 s [vector] +++ OK, passed 100 tests.
  4926. 946.24 s [vector] replicate: OK
  4927. 946.24 s [vector] +++ OK, passed 100 tests.
  4928. 946.24 s [vector] generate: OK
  4929. 946.24 s [vector] +++ OK, passed 100 tests.
  4930. 946.24 s [vector] iterateN: OK
  4931. 946.24 s [vector] +++ OK, passed 100 tests.
  4932. 946.28 s [vector] iterateNM: OK (0.06s)
  4933. 946.28 s [vector] +++ OK, passed 100 tests.
  4934. 946.30 s [vector] generateM: OK (0.02s)
  4935. 946.30 s [vector] +++ OK, passed 100 tests.
  4936. 946.30 s [vector] replicateM: OK
  4937. 946.30 s [vector] +++ OK, passed 100 tests.
  4938. 946.30 s [vector] create: OK
  4939. 946.30 s [vector] +++ OK, passed 100 tests.
  4940. 946.30 s [vector] createT: OK
  4941. 946.30 s [vector] +++ OK, passed 100 tests.
  4942. 946.30 s [vector] unfoldr: OK
  4943. 946.30 s [vector] +++ OK, passed 100 tests.
  4944. 946.30 s [vector] unfoldrN: OK
  4945. 946.30 s [vector] +++ OK, passed 100 tests.
  4946. 946.30 s [vector] unfoldrExactN: OK
  4947. 946.32 s [vector] +++ OK, passed 100 tests.
  4948. 946.32 s [vector] unfoldrM: OK (0.01s)
  4949. 946.32 s [vector] +++ OK, passed 100 tests.
  4950. 946.34 s [vector] unfoldrNM: OK (0.01s)
  4951. 946.34 s [vector] +++ OK, passed 100 tests.
  4952. 946.35 s [vector] unfoldrExactNM: OK (0.02s)
  4953. 946.35 s [vector] +++ OK, passed 100 tests.
  4954. 946.35 s [vector] constructN: OK
  4955. 946.35 s [vector] +++ OK, passed 100 tests.
  4956. 946.35 s [vector] constructrN: OK
  4957. 946.35 s [vector] +++ OK, passed 100 tests.
  4958. 946.36 s [vector] cons: OK
  4959. 946.36 s [vector] +++ OK, passed 100 tests.
  4960. 946.36 s [vector] snoc: OK
  4961. 946.36 s [vector] +++ OK, passed 100 tests.
  4962. 946.36 s [vector] append: OK
  4963. 946.36 s [vector] +++ OK, passed 100 tests.
  4964. 946.37 s [vector] concat: OK
  4965. 946.37 s [vector] +++ OK, passed 100 tests.
  4966. 946.37 s [vector] force: OK
  4967. 946.37 s [vector] +++ OK, passed 100 tests.
  4968. 946.37 s [vector] upd: OK
  4969. 946.37 s [vector] +++ OK, passed 100 tests.
  4970. 946.37 s [vector] accum: OK
  4971. 946.37 s [vector] +++ OK, passed 100 tests.
  4972. 946.37 s [vector] reverse: OK
  4973. 946.37 s [vector] +++ OK, passed 100 tests.
  4974. 946.37 s [vector] backpermute: OK
  4975. 946.37 s [vector] +++ OK, passed 100 tests.
  4976. 946.37 s [vector] map: OK
  4977. 946.38 s [vector] +++ OK, passed 100 tests.
  4978. 946.38 s [vector] imap: OK
  4979. 946.38 s [vector] +++ OK, passed 100 tests.
  4980. 946.38 s [vector] concatMap: OK
  4981. 946.38 s [vector] +++ OK, passed 100 tests.
  4982. 946.38 s [vector] mapM: OK
  4983. 946.38 s [vector] +++ OK, passed 100 tests.
  4984. 946.39 s [vector] mapM_: OK (0.01s)
  4985. 946.39 s [vector] +++ OK, passed 100 tests.
  4986. 946.39 s [vector] forM: OK
  4987. 946.40 s [vector] +++ OK, passed 100 tests.
  4988. 946.40 s [vector] forM_: OK
  4989. 946.40 s [vector] +++ OK, passed 100 tests.
  4990. 946.40 s [vector] imapM: OK
  4991. 946.40 s [vector] +++ OK, passed 100 tests.
  4992. 946.42 s [vector] imapM_: OK
  4993. 946.42 s [vector] +++ OK, passed 100 tests.
  4994. 946.42 s [vector] zipWith: OK
  4995. 946.42 s [vector] +++ OK, passed 100 tests.
  4996. 946.42 s [vector] zipWith3: OK
  4997. 946.42 s [vector] +++ OK, passed 100 tests.
  4998. 946.42 s [vector] izipWith: OK
  4999. 946.42 s [vector] +++ OK, passed 100 tests.
  5000. 946.42 s [vector] izipWith3: OK
  5001. 946.42 s [vector] +++ OK, passed 100 tests.
  5002. 946.44 s [vector] izipWithM: OK
  5003. 946.44 s [vector] +++ OK, passed 100 tests.
  5004. 946.44 s [vector] izipWithM_: OK
  5005. 946.44 s [vector] +++ OK, passed 100 tests.
  5006. 946.44 s [vector] zipWithM: OK
  5007. 946.44 s [vector] +++ OK, passed 100 tests.
  5008. 946.45 s [vector] zipWithM_: OK (0.01s)
  5009. 946.45 s [vector] +++ OK, passed 100 tests.
  5010. 946.45 s [vector] filter: OK
  5011. 946.45 s [vector] +++ OK, passed 100 tests.
  5012. 946.45 s [vector] ifilter: OK
  5013. 946.46 s [vector] +++ OK, passed 100 tests.
  5014. 946.47 s [vector] filterM: OK (0.02s)
  5015. 946.47 s [vector] +++ OK, passed 100 tests.
  5016. 946.47 s [vector] uniq: OK
  5017. 946.47 s [vector] +++ OK, passed 100 tests.
  5018. 946.47 s [vector] mapMaybe: OK
  5019. 946.48 s [vector] +++ OK, passed 100 tests.
  5020. 946.48 s [vector] imapMaybe: OK
  5021. 946.48 s [vector] +++ OK, passed 100 tests.
  5022. 946.48 s [vector] takeWhile: OK
  5023. 946.48 s [vector] +++ OK, passed 100 tests.
  5024. 946.48 s [vector] dropWhile: OK
  5025. 946.48 s [vector] +++ OK, passed 100 tests.
  5026. 946.48 s [vector] partition: OK
  5027. 946.48 s [vector] +++ OK, passed 100 tests.
  5028. 946.48 s [vector] partitionWith: OK
  5029. 946.48 s [vector] +++ OK, passed 100 tests.
  5030. 946.48 s [vector] span: OK
  5031. 946.48 s [vector] +++ OK, passed 100 tests.
  5032. 946.48 s [vector] break: OK
  5033. 946.48 s [vector] +++ OK, passed 100 tests.
  5034. 946.48 s [vector] spanR: OK
  5035. 946.48 s [vector] +++ OK, passed 100 tests.
  5036. 946.49 s [vector] breakR: OK
  5037. 946.49 s [vector] +++ OK, passed 100 tests.
  5038. 946.49 s [vector] groupBy: OK
  5039. 946.49 s [vector] +++ OK, passed 100 tests.
  5040. 946.49 s [vector] elem: OK
  5041. 946.49 s [vector] +++ OK, passed 100 tests.
  5042. 946.49 s [vector] notElem: OK
  5043. 946.49 s [vector] +++ OK, passed 100 tests.
  5044. 946.49 s [vector] find: OK
  5045. 946.49 s [vector] +++ OK, passed 100 tests.
  5046. 946.49 s [vector] findIndex: OK
  5047. 946.49 s [vector] +++ OK, passed 100 tests.
  5048. 946.49 s [vector] findIndexR: OK
  5049. 946.49 s [vector] +++ OK, passed 100 tests.
  5050. 946.49 s [vector] findIndices: OK
  5051. 946.49 s [vector] +++ OK, passed 100 tests.
  5052. 946.49 s [vector] elemIndex: OK
  5053. 946.49 s [vector] +++ OK, passed 100 tests.
  5054. 946.49 s [vector] elemIndices: OK
  5055. 946.49 s [vector] +++ OK, passed 100 tests.
  5056. 946.49 s [vector] foldl: OK
  5057. 946.49 s [vector] +++ OK, passed 100 tests.
  5058. 946.49 s [vector] foldl1: OK
  5059. 946.49 s [vector] +++ OK, passed 100 tests; 12 discarded.
  5060. 946.50 s [vector] foldl': OK
  5061. 946.50 s [vector] +++ OK, passed 100 tests.
  5062. 946.50 s [vector] foldl1': OK
  5063. 946.50 s [vector] +++ OK, passed 100 tests; 12 discarded.
  5064. 946.50 s [vector] foldr: OK
  5065. 946.50 s [vector] +++ OK, passed 100 tests.
  5066. 946.50 s [vector] foldr1: OK
  5067. 946.50 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5068. 946.50 s [vector] foldr': OK
  5069. 946.50 s [vector] +++ OK, passed 100 tests.
  5070. 946.50 s [vector] foldr1': OK
  5071. 946.50 s [vector] +++ OK, passed 100 tests; 11 discarded.
  5072. 946.50 s [vector] ifoldl: OK
  5073. 946.50 s [vector] +++ OK, passed 100 tests.
  5074. 946.51 s [vector] ifoldl': OK
  5075. 946.51 s [vector] +++ OK, passed 100 tests.
  5076. 946.51 s [vector] ifoldr: OK
  5077. 946.51 s [vector] +++ OK, passed 100 tests.
  5078. 946.51 s [vector] ifoldr': OK
  5079. 946.52 s [vector] +++ OK, passed 100 tests.
  5080. 946.52 s [vector] ifoldM: OK
  5081. 946.52 s [vector] +++ OK, passed 100 tests.
  5082. 946.52 s [vector] ifoldM': OK
  5083. 946.52 s [vector] +++ OK, passed 100 tests.
  5084. 946.53 s [vector] ifoldM_: OK (0.01s)
  5085. 946.53 s [vector] +++ OK, passed 100 tests.
  5086. 946.55 s [vector] ifoldM'_: OK
  5087. 946.55 s [vector] +++ OK, passed 100 tests.
  5088. 946.55 s [vector] all: OK
  5089. 946.55 s [vector] +++ OK, passed 100 tests.
  5090. 946.55 s [vector] any: OK
  5091. 946.55 s [vector] +++ OK, passed 100 tests.
  5092. 946.55 s [vector] prescanl: OK
  5093. 946.55 s [vector] +++ OK, passed 100 tests.
  5094. 946.55 s [vector] prescanl': OK
  5095. 946.55 s [vector] +++ OK, passed 100 tests.
  5096. 946.55 s [vector] postscanl: OK
  5097. 946.55 s [vector] +++ OK, passed 100 tests.
  5098. 946.55 s [vector] postscanl': OK
  5099. 946.56 s [vector] +++ OK, passed 100 tests.
  5100. 946.56 s [vector] scanl: OK
  5101. 946.56 s [vector] +++ OK, passed 100 tests.
  5102. 946.56 s [vector] scanl': OK
  5103. 946.56 s [vector] +++ OK, passed 100 tests.
  5104. 946.56 s [vector] scanl1: OK
  5105. 946.56 s [vector] +++ OK, passed 100 tests.
  5106. 946.56 s [vector] scanl1': OK
  5107. 946.56 s [vector] +++ OK, passed 100 tests.
  5108. 946.57 s [vector] iscanl: OK
  5109. 946.57 s [vector] +++ OK, passed 100 tests.
  5110. 946.57 s [vector] iscanl': OK
  5111. 946.57 s [vector] +++ OK, passed 100 tests.
  5112. 946.57 s [vector] prescanr: OK
  5113. 946.57 s [vector] +++ OK, passed 100 tests.
  5114. 946.57 s [vector] prescanr': OK
  5115. 946.57 s [vector] +++ OK, passed 100 tests.
  5116. 946.57 s [vector] postscanr: OK
  5117. 946.57 s [vector] +++ OK, passed 100 tests.
  5118. 946.57 s [vector] postscanr': OK
  5119. 946.57 s [vector] +++ OK, passed 100 tests.
  5120. 946.58 s [vector] scanr: OK
  5121. 946.58 s [vector] +++ OK, passed 100 tests.
  5122. 946.58 s [vector] scanr': OK
  5123. 946.58 s [vector] +++ OK, passed 100 tests.
  5124. 946.58 s [vector] scanr1: OK
  5125. 946.58 s [vector] +++ OK, passed 100 tests.
  5126. 946.58 s [vector] scanr1': OK
  5127. 946.58 s [vector] +++ OK, passed 100 tests.
  5128. 946.59 s [vector] iscanr: OK
  5129. 946.59 s [vector] +++ OK, passed 100 tests.
  5130. 946.59 s [vector] iscanr': OK
  5131. 946.59 s [vector] +++ OK, passed 100 tests.
  5132. 946.59 s [vector] mut_read: OK
  5133. 946.59 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5134. 946.59 s [vector] mut_write: OK
  5135. 946.59 s [vector] +++ OK, passed 100 tests; 20 discarded.
  5136. 946.59 s [vector] mut_modify: OK
  5137. 946.59 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5138. 946.59 s [vector] mut_generate: OK
  5139. 946.60 s [vector] +++ OK, passed 100 tests.
  5140. 946.60 s [vector] mut_generateM: OK
  5141. 946.60 s [vector] +++ OK, passed 100 tests.
  5142. 946.62 s [vector] mut_mapM_: OK
  5143. 946.62 s [vector] +++ OK, passed 100 tests.
  5144. 946.62 s [vector] mut_imapM_: OK (0.01s)
  5145. 946.62 s [vector] +++ OK, passed 100 tests.
  5146. 946.64 s [vector] mut_forM_: OK (0.01s)
  5147. 946.64 s [vector] +++ OK, passed 100 tests.
  5148. 946.64 s [vector] mut_iforM_: OK
  5149. 946.64 s [vector] +++ OK, passed 100 tests.
  5150. 946.64 s [vector] mut_foldr: OK
  5151. 946.64 s [vector] +++ OK, passed 100 tests.
  5152. 946.65 s [vector] mut_foldr': OK
  5153. 946.65 s [vector] +++ OK, passed 100 tests.
  5154. 946.65 s [vector] mut_foldl: OK
  5155. 946.65 s [vector] +++ OK, passed 100 tests.
  5156. 946.65 s [vector] mut_foldl': OK
  5157. 946.65 s [vector] +++ OK, passed 100 tests.
  5158. 946.65 s [vector] mut_ifoldr: OK
  5159. 946.65 s [vector] +++ OK, passed 100 tests.
  5160. 946.65 s [vector] mut_ifoldr': OK
  5161. 946.66 s [vector] +++ OK, passed 100 tests.
  5162. 946.66 s [vector] mut_ifoldl: OK
  5163. 946.66 s [vector] +++ OK, passed 100 tests.
  5164. 946.66 s [vector] mut_ifoldl': OK
  5165. 946.66 s [vector] +++ OK, passed 100 tests.
  5166. 946.66 s [vector] mut_foldM: OK
  5167. 946.66 s [vector] +++ OK, passed 100 tests.
  5168. 946.66 s [vector] mut_foldM': OK
  5169. 946.66 s [vector] +++ OK, passed 100 tests.
  5170. 946.67 s [vector] mut_foldrM: OK
  5171. 946.67 s [vector] +++ OK, passed 100 tests.
  5172. 946.67 s [vector] mut_foldrM': OK
  5173. 946.67 s [vector] +++ OK, passed 100 tests.
  5174. 946.67 s [vector] mut_ifoldM: OK
  5175. 946.67 s [vector] +++ OK, passed 100 tests.
  5176. 946.68 s [vector] mut_ifoldM': OK
  5177. 946.68 s [vector] +++ OK, passed 100 tests.
  5178. 946.68 s [vector] mut_ifoldrM: OK
  5179. 946.68 s [vector] +++ OK, passed 100 tests.
  5180. 946.68 s [vector] mut_ifoldrM': OK
  5181. 946.68 s [vector] +++ OK, passed 100 tests.
  5182. 946.68 s [vector] compare: OK
  5183. 946.68 s [vector] +++ OK, passed 100 tests.
  5184. 946.68 s [vector] maximum: OK
  5185. 946.68 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5186. 946.68 s [vector] minimum: OK
  5187. 946.68 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5188. 946.68 s [vector] minIndex: OK
  5189. 946.68 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5190. 946.68 s [vector] maxIndex: OK
  5191. 946.68 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5192. 946.68 s [vector] maximumBy: OK
  5193. 946.68 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5194. 946.68 s [vector] minimumBy: OK
  5195. 946.68 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5196. 946.68 s [vector] maximumOn: OK
  5197. 946.68 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5198. 946.68 s [vector] minimumOn: OK
  5199. 946.68 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5200. 946.68 s [vector] maxIndexBy: OK
  5201. 946.68 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5202. 946.68 s [vector] minIndexBy: OK
  5203. 946.68 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5204. 946.68 s [vector] ListFirstMaxIndexWins: OK
  5205. 946.68 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5206. 946.69 s [vector] FalseListFirstMaxIndexWins: OK
  5207. 946.69 s [vector] +++ OK, failed as expected. (after 1 test):
  5208. 946.69 s [vector] Exception:
  5209. 946.69 s [vector] Prelude.foldr1: empty list
  5210. 946.69 s [vector] CallStack (from HasCallStack):
  5211. 946.69 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  5212. 946.69 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  5213. 946.69 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  5214. 946.69 s [vector] []
  5215. 946.69 s [vector] zip: OK
  5216. 946.69 s [vector] +++ OK, passed 100 tests.
  5217. 946.69 s [vector] zip3: OK
  5218. 946.69 s [vector] +++ OK, passed 100 tests.
  5219. 946.69 s [vector] unzip: OK
  5220. 946.69 s [vector] +++ OK, passed 100 tests.
  5221. 946.69 s [vector] unzip3: OK
  5222. 946.69 s [vector] +++ OK, passed 100 tests.
  5223. 946.69 s [vector] indexed: OK
  5224. 946.69 s [vector] +++ OK, passed 100 tests.
  5225. 946.69 s [vector] update: OK
  5226. 946.70 s [vector] +++ OK, passed 100 tests.
  5227. 946.70 s [vector] concat: OK
  5228. 946.70 s [vector] +++ OK, passed 100 tests.
  5229. 946.70 s [vector] mempty: OK
  5230. 946.70 s [vector] +++ OK, passed 100 tests.
  5231. 946.72 s [vector] mappend: OK
  5232. 946.72 s [vector] +++ OK, passed 100 tests.
  5233. 946.72 s [vector] mconcat: OK (0.01s)
  5234. 946.72 s [vector] +++ OK, passed 100 tests.
  5235. 946.72 s [vector] fmap: OK
  5236. 946.72 s [vector] +++ OK, passed 100 tests.
  5237. 946.72 s [vector] return: OK
  5238. 946.72 s [vector] +++ OK, passed 100 tests.
  5239. 946.74 s [vector] bind: OK (0.02s)
  5240. 946.74 s [vector] +++ OK, passed 100 tests.
  5241. 946.74 s [vector] mzip: OK
  5242. 946.74 s [vector] +++ OK, passed 100 tests.
  5243. 946.74 s [vector] munzip: OK
  5244. 946.74 s [vector] +++ OK, passed 100 tests.
  5245. 946.74 s [vector] applicative_pure: OK
  5246. 946.74 s [vector] +++ OK, passed 100 tests.
  5247. 946.76 s [vector] applicative_appl: OK (0.02s)
  5248. 946.76 s [vector] +++ OK, passed 100 tests.
  5249. 946.76 s [vector] alternative_empty: OK
  5250. 946.76 s [vector] +++ OK, passed 100 tests.
  5251. 946.76 s [vector] alternative_or: OK
  5252. 946.76 s [vector] +++ OK, passed 100 tests.
  5253. 946.79 s [vector] sequence: OK (0.02s)
  5254. 946.79 s [vector] +++ OK, passed 100 tests.
  5255. 946.80 s [vector] sequence_: OK
  5256. 946.80 s [vector] +++ OK, passed 100 tests.
  5257. 946.80 s [vector] glength: OK
  5258. 946.80 s [vector] +++ OK, passed 100 tests.
  5259. 946.80 s [vector] and: OK
  5260. 946.80 s [vector] +++ OK, passed 100 tests.
  5261. 946.80 s [vector] or: OK
  5262. 946.80 s [vector] +++ OK, passed 100 tests.
  5263. 946.80 s [vector] Int
  5264. 946.80 s [vector] fromList.toList == id: OK
  5265. 946.80 s [vector] +++ OK, passed 100 tests.
  5266. 946.80 s [vector] toList.fromList == id: OK
  5267. 946.80 s [vector] +++ OK, passed 100 tests.
  5268. 946.80 s [vector] unstream.stream == id: OK
  5269. 946.80 s [vector] +++ OK, passed 100 tests.
  5270. 946.80 s [vector] stream.unstream == id: OK
  5271. 946.80 s [vector] +++ OK, passed 100 tests.
  5272. 946.80 s [vector] eq: OK
  5273. 946.80 s [vector] +++ OK, passed 100 tests.
  5274. 946.80 s [vector] length: OK
  5275. 946.80 s [vector] +++ OK, passed 100 tests.
  5276. 946.80 s [vector] null: OK
  5277. 946.80 s [vector] +++ OK, passed 100 tests.
  5278. 946.80 s [vector] index: OK
  5279. 946.80 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5280. 946.80 s [vector] safeIndex: OK
  5281. 946.80 s [vector] +++ OK, passed 100 tests.
  5282. 946.80 s [vector] head: OK
  5283. 946.80 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5284. 946.80 s [vector] last: OK
  5285. 946.80 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5286. 946.80 s [vector] unsafeIndex: OK
  5287. 946.80 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5288. 946.80 s [vector] unsafeHead: OK
  5289. 946.80 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5290. 946.80 s [vector] unsafeLast: OK
  5291. 946.80 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5292. 946.80 s [vector] slice: OK
  5293. 946.80 s [vector] +++ OK, passed 100 tests.
  5294. 946.80 s [vector] init: OK
  5295. 946.80 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5296. 946.80 s [vector] tail: OK
  5297. 946.80 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5298. 946.80 s [vector] take: OK
  5299. 946.81 s [vector] +++ OK, passed 100 tests.
  5300. 946.81 s [vector] drop: OK
  5301. 946.81 s [vector] +++ OK, passed 100 tests.
  5302. 946.81 s [vector] splitAt: OK
  5303. 946.81 s [vector] +++ OK, passed 100 tests.
  5304. 946.81 s [vector] empty: OK
  5305. 946.81 s [vector] +++ OK, passed 100 tests.
  5306. 946.81 s [vector] singleton: OK
  5307. 946.81 s [vector] +++ OK, passed 100 tests.
  5308. 946.81 s [vector] replicate: OK
  5309. 946.81 s [vector] +++ OK, passed 100 tests.
  5310. 946.81 s [vector] generate: OK
  5311. 946.81 s [vector] +++ OK, passed 100 tests.
  5312. 946.81 s [vector] iterateN: OK
  5313. 946.83 s [vector] +++ OK, passed 100 tests.
  5314. 946.86 s [vector] iterateNM: OK (0.03s)
  5315. 946.86 s [vector] +++ OK, passed 100 tests.
  5316. 946.88 s [vector] generateM: OK (0.02s)
  5317. 946.88 s [vector] +++ OK, passed 100 tests.
  5318. 946.88 s [vector] replicateM: OK
  5319. 946.88 s [vector] +++ OK, passed 100 tests.
  5320. 946.88 s [vector] create: OK
  5321. 946.88 s [vector] +++ OK, passed 100 tests.
  5322. 946.88 s [vector] createT: OK
  5323. 946.88 s [vector] +++ OK, passed 100 tests.
  5324. 946.88 s [vector] unfoldr: OK
  5325. 946.88 s [vector] +++ OK, passed 100 tests.
  5326. 946.88 s [vector] unfoldrN: OK
  5327. 946.88 s [vector] +++ OK, passed 100 tests.
  5328. 946.88 s [vector] unfoldrExactN: OK
  5329. 946.88 s [vector] +++ OK, passed 100 tests.
  5330. 946.88 s [vector] unfoldrM: OK
  5331. 946.88 s [vector] +++ OK, passed 100 tests.
  5332. 946.90 s [vector] unfoldrNM: OK (0.01s)
  5333. 946.90 s [vector] +++ OK, passed 100 tests.
  5334. 946.93 s [vector] unfoldrExactNM: OK (0.03s)
  5335. 946.93 s [vector] +++ OK, passed 100 tests.
  5336. 946.94 s [vector] constructN: OK
  5337. 946.94 s [vector] +++ OK, passed 100 tests.
  5338. 946.94 s [vector] constructrN: OK
  5339. 946.94 s [vector] +++ OK, passed 100 tests.
  5340. 946.94 s [vector] cons: OK
  5341. 946.94 s [vector] +++ OK, passed 100 tests.
  5342. 946.94 s [vector] snoc: OK
  5343. 946.94 s [vector] +++ OK, passed 100 tests.
  5344. 946.94 s [vector] append: OK
  5345. 946.94 s [vector] +++ OK, passed 100 tests.
  5346. 946.95 s [vector] concat: OK (0.01s)
  5347. 946.95 s [vector] +++ OK, passed 100 tests.
  5348. 946.96 s [vector] force: OK
  5349. 946.96 s [vector] +++ OK, passed 100 tests.
  5350. 946.96 s [vector] upd: OK
  5351. 946.96 s [vector] +++ OK, passed 100 tests.
  5352. 946.96 s [vector] accum: OK
  5353. 946.96 s [vector] +++ OK, passed 100 tests.
  5354. 946.96 s [vector] reverse: OK
  5355. 946.96 s [vector] +++ OK, passed 100 tests.
  5356. 946.96 s [vector] backpermute: OK
  5357. 946.96 s [vector] +++ OK, passed 100 tests.
  5358. 946.96 s [vector] map: OK
  5359. 946.97 s [vector] +++ OK, passed 100 tests.
  5360. 946.97 s [vector] imap: OK
  5361. 946.97 s [vector] +++ OK, passed 100 tests.
  5362. 946.97 s [vector] concatMap: OK
  5363. 946.97 s [vector] +++ OK, passed 100 tests.
  5364. 946.97 s [vector] mapM: OK
  5365. 946.99 s [vector] +++ OK, passed 100 tests.
  5366. 947.00 s [vector] mapM_: OK (0.02s)
  5367. 947.00 s [vector] +++ OK, passed 100 tests.
  5368. 947.00 s [vector] forM: OK
  5369. 947.00 s [vector] +++ OK, passed 100 tests.
  5370. 947.02 s [vector] forM_: OK (0.02s)
  5371. 947.02 s [vector] +++ OK, passed 100 tests.
  5372. 947.02 s [vector] imapM: OK
  5373. 947.02 s [vector] +++ OK, passed 100 tests.
  5374. 947.04 s [vector] imapM_: OK (0.02s)
  5375. 947.04 s [vector] +++ OK, passed 100 tests.
  5376. 947.04 s [vector] zipWith: OK
  5377. 947.04 s [vector] +++ OK, passed 100 tests.
  5378. 947.05 s [vector] zipWith3: OK
  5379. 947.05 s [vector] +++ OK, passed 100 tests.
  5380. 947.05 s [vector] izipWith: OK
  5381. 947.05 s [vector] +++ OK, passed 100 tests.
  5382. 947.06 s [vector] izipWith3: OK
  5383. 947.06 s [vector] +++ OK, passed 100 tests.
  5384. 947.06 s [vector] izipWithM: OK
  5385. 947.06 s [vector] +++ OK, passed 100 tests.
  5386. 947.08 s [vector] izipWithM_: OK (0.02s)
  5387. 947.08 s [vector] +++ OK, passed 100 tests.
  5388. 947.08 s [vector] zipWithM: OK
  5389. 947.08 s [vector] +++ OK, passed 100 tests.
  5390. 947.09 s [vector] zipWithM_: OK (0.01s)
  5391. 947.09 s [vector] +++ OK, passed 100 tests.
  5392. 947.09 s [vector] filter: OK
  5393. 947.10 s [vector] +++ OK, passed 100 tests.
  5394. 947.10 s [vector] ifilter: OK
  5395. 947.10 s [vector] +++ OK, passed 100 tests.
  5396. 947.12 s [vector] filterM: OK (0.03s)
  5397. 947.12 s [vector] +++ OK, passed 100 tests.
  5398. 947.12 s [vector] uniq: OK
  5399. 947.12 s [vector] +++ OK, passed 100 tests.
  5400. 947.12 s [vector] mapMaybe: OK
  5401. 947.13 s [vector] +++ OK, passed 100 tests.
  5402. 947.13 s [vector] imapMaybe: OK
  5403. 947.13 s [vector] +++ OK, passed 100 tests.
  5404. 947.13 s [vector] takeWhile: OK
  5405. 947.13 s [vector] +++ OK, passed 100 tests.
  5406. 947.13 s [vector] dropWhile: OK
  5407. 947.13 s [vector] +++ OK, passed 100 tests.
  5408. 947.13 s [vector] partition: OK
  5409. 947.13 s [vector] +++ OK, passed 100 tests.
  5410. 947.13 s [vector] partitionWith: OK
  5411. 947.13 s [vector] +++ OK, passed 100 tests.
  5412. 947.13 s [vector] span: OK
  5413. 947.13 s [vector] +++ OK, passed 100 tests.
  5414. 947.13 s [vector] break: OK
  5415. 947.13 s [vector] +++ OK, passed 100 tests.
  5416. 947.14 s [vector] spanR: OK
  5417. 947.14 s [vector] +++ OK, passed 100 tests.
  5418. 947.14 s [vector] breakR: OK
  5419. 947.14 s [vector] +++ OK, passed 100 tests.
  5420. 947.14 s [vector] groupBy: OK
  5421. 947.14 s [vector] +++ OK, passed 100 tests.
  5422. 947.14 s [vector] elem: OK
  5423. 947.14 s [vector] +++ OK, passed 100 tests.
  5424. 947.14 s [vector] notElem: OK
  5425. 947.14 s [vector] +++ OK, passed 100 tests.
  5426. 947.14 s [vector] find: OK
  5427. 947.14 s [vector] +++ OK, passed 100 tests.
  5428. 947.14 s [vector] findIndex: OK
  5429. 947.14 s [vector] +++ OK, passed 100 tests.
  5430. 947.14 s [vector] findIndexR: OK
  5431. 947.14 s [vector] +++ OK, passed 100 tests.
  5432. 947.14 s [vector] findIndices: OK
  5433. 947.14 s [vector] +++ OK, passed 100 tests.
  5434. 947.14 s [vector] elemIndex: OK
  5435. 947.14 s [vector] +++ OK, passed 100 tests.
  5436. 947.15 s [vector] elemIndices: OK
  5437. 947.15 s [vector] +++ OK, passed 100 tests.
  5438. 947.15 s [vector] foldl: OK
  5439. 947.15 s [vector] +++ OK, passed 100 tests.
  5440. 947.15 s [vector] foldl1: OK
  5441. 947.15 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5442. 947.15 s [vector] foldl': OK
  5443. 947.16 s [vector] +++ OK, passed 100 tests.
  5444. 947.16 s [vector] foldl1': OK
  5445. 947.16 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5446. 947.16 s [vector] foldr: OK
  5447. 947.16 s [vector] +++ OK, passed 100 tests.
  5448. 947.16 s [vector] foldr1: OK
  5449. 947.16 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5450. 947.16 s [vector] foldr': OK
  5451. 947.17 s [vector] +++ OK, passed 100 tests.
  5452. 947.17 s [vector] foldr1': OK
  5453. 947.17 s [vector] +++ OK, passed 100 tests; 20 discarded.
  5454. 947.17 s [vector] ifoldl: OK
  5455. 947.17 s [vector] +++ OK, passed 100 tests.
  5456. 947.17 s [vector] ifoldl': OK
  5457. 947.18 s [vector] +++ OK, passed 100 tests.
  5458. 947.18 s [vector] ifoldr: OK
  5459. 947.18 s [vector] +++ OK, passed 100 tests.
  5460. 947.18 s [vector] ifoldr': OK
  5461. 947.18 s [vector] +++ OK, passed 100 tests.
  5462. 947.19 s [vector] ifoldM: OK
  5463. 947.19 s [vector] +++ OK, passed 100 tests.
  5464. 947.19 s [vector] ifoldM': OK
  5465. 947.19 s [vector] +++ OK, passed 100 tests.
  5466. 947.22 s [vector] ifoldM_: OK (0.01s)
  5467. 947.22 s [vector] +++ OK, passed 100 tests.
  5468. 947.24 s [vector] ifoldM'_: OK (0.03s)
  5469. 947.24 s [vector] +++ OK, passed 100 tests.
  5470. 947.24 s [vector] all: OK
  5471. 947.24 s [vector] +++ OK, passed 100 tests.
  5472. 947.24 s [vector] any: OK
  5473. 947.24 s [vector] +++ OK, passed 100 tests.
  5474. 947.24 s [vector] prescanl: OK
  5475. 947.25 s [vector] +++ OK, passed 100 tests.
  5476. 947.25 s [vector] prescanl': OK
  5477. 947.25 s [vector] +++ OK, passed 100 tests.
  5478. 947.25 s [vector] postscanl: OK
  5479. 947.25 s [vector] +++ OK, passed 100 tests.
  5480. 947.26 s [vector] postscanl': OK
  5481. 947.26 s [vector] +++ OK, passed 100 tests.
  5482. 947.26 s [vector] scanl: OK
  5483. 947.26 s [vector] +++ OK, passed 100 tests.
  5484. 947.26 s [vector] scanl': OK
  5485. 947.26 s [vector] +++ OK, passed 100 tests.
  5486. 947.26 s [vector] scanl1: OK
  5487. 947.26 s [vector] +++ OK, passed 100 tests.
  5488. 947.27 s [vector] scanl1': OK
  5489. 947.27 s [vector] +++ OK, passed 100 tests.
  5490. 947.27 s [vector] iscanl: OK
  5491. 947.27 s [vector] +++ OK, passed 100 tests.
  5492. 947.28 s [vector] iscanl': OK
  5493. 947.28 s [vector] +++ OK, passed 100 tests.
  5494. 947.28 s [vector] prescanr: OK
  5495. 947.28 s [vector] +++ OK, passed 100 tests.
  5496. 947.28 s [vector] prescanr': OK
  5497. 947.28 s [vector] +++ OK, passed 100 tests.
  5498. 947.28 s [vector] postscanr: OK
  5499. 947.29 s [vector] +++ OK, passed 100 tests.
  5500. 947.29 s [vector] postscanr': OK
  5501. 947.29 s [vector] +++ OK, passed 100 tests.
  5502. 947.29 s [vector] scanr: OK
  5503. 947.29 s [vector] +++ OK, passed 100 tests.
  5504. 947.29 s [vector] scanr': OK
  5505. 947.29 s [vector] +++ OK, passed 100 tests.
  5506. 947.29 s [vector] scanr1: OK
  5507. 947.30 s [vector] +++ OK, passed 100 tests.
  5508. 947.30 s [vector] scanr1': OK
  5509. 947.30 s [vector] +++ OK, passed 100 tests.
  5510. 947.30 s [vector] iscanr: OK
  5511. 947.30 s [vector] +++ OK, passed 100 tests.
  5512. 947.30 s [vector] iscanr': OK
  5513. 947.30 s [vector] +++ OK, passed 100 tests.
  5514. 947.31 s [vector] mut_read: OK
  5515. 947.31 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5516. 947.31 s [vector] mut_write: OK
  5517. 947.31 s [vector] +++ OK, passed 100 tests; 25 discarded.
  5518. 947.31 s [vector] mut_modify: OK
  5519. 947.31 s [vector] +++ OK, passed 100 tests; 21 discarded.
  5520. 947.32 s [vector] mut_generate: OK
  5521. 947.32 s [vector] +++ OK, passed 100 tests.
  5522. 947.32 s [vector] mut_generateM: OK
  5523. 947.32 s [vector] +++ OK, passed 100 tests.
  5524. 947.34 s [vector] mut_mapM_: OK (0.02s)
  5525. 947.34 s [vector] +++ OK, passed 100 tests.
  5526. 947.36 s [vector] mut_imapM_: OK (0.02s)
  5527. 947.36 s [vector] +++ OK, passed 100 tests.
  5528. 947.38 s [vector] mut_forM_: OK (0.02s)
  5529. 947.38 s [vector] +++ OK, passed 100 tests.
  5530. 947.40 s [vector] mut_iforM_: OK (0.02s)
  5531. 947.40 s [vector] +++ OK, passed 100 tests.
  5532. 947.40 s [vector] mut_foldr: OK
  5533. 947.40 s [vector] +++ OK, passed 100 tests.
  5534. 947.40 s [vector] mut_foldr': OK
  5535. 947.40 s [vector] +++ OK, passed 100 tests.
  5536. 947.40 s [vector] mut_foldl: OK
  5537. 947.40 s [vector] +++ OK, passed 100 tests.
  5538. 947.41 s [vector] mut_foldl': OK
  5539. 947.41 s [vector] +++ OK, passed 100 tests.
  5540. 947.41 s [vector] mut_ifoldr: OK
  5541. 947.42 s [vector] +++ OK, passed 100 tests.
  5542. 947.42 s [vector] mut_ifoldr': OK
  5543. 947.42 s [vector] +++ OK, passed 100 tests.
  5544. 947.42 s [vector] mut_ifoldl: OK
  5545. 947.42 s [vector] +++ OK, passed 100 tests.
  5546. 947.42 s [vector] mut_ifoldl': OK
  5547. 947.42 s [vector] +++ OK, passed 100 tests.
  5548. 947.43 s [vector] mut_foldM: OK
  5549. 947.43 s [vector] +++ OK, passed 100 tests.
  5550. 947.43 s [vector] mut_foldM': OK
  5551. 947.43 s [vector] +++ OK, passed 100 tests.
  5552. 947.43 s [vector] mut_foldrM: OK
  5553. 947.44 s [vector] +++ OK, passed 100 tests.
  5554. 947.44 s [vector] mut_foldrM': OK
  5555. 947.44 s [vector] +++ OK, passed 100 tests.
  5556. 947.44 s [vector] mut_ifoldM: OK
  5557. 947.44 s [vector] +++ OK, passed 100 tests.
  5558. 947.44 s [vector] mut_ifoldM': OK
  5559. 947.44 s [vector] +++ OK, passed 100 tests.
  5560. 947.45 s [vector] mut_ifoldrM: OK
  5561. 947.45 s [vector] +++ OK, passed 100 tests.
  5562. 947.45 s [vector] mut_ifoldrM': OK
  5563. 947.45 s [vector] +++ OK, passed 100 tests.
  5564. 947.45 s [vector] compare: OK
  5565. 947.45 s [vector] +++ OK, passed 100 tests.
  5566. 947.45 s [vector] maximum: OK
  5567. 947.45 s [vector] +++ OK, passed 100 tests; 20 discarded.
  5568. 947.46 s [vector] minimum: OK
  5569. 947.46 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5570. 947.46 s [vector] minIndex: OK
  5571. 947.46 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5572. 947.46 s [vector] maxIndex: OK
  5573. 947.46 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5574. 947.46 s [vector] maximumBy: OK
  5575. 947.46 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5576. 947.46 s [vector] minimumBy: OK
  5577. 947.46 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5578. 947.46 s [vector] maximumOn: OK
  5579. 947.46 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5580. 947.46 s [vector] minimumOn: OK
  5581. 947.46 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5582. 947.46 s [vector] maxIndexBy: OK
  5583. 947.46 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5584. 947.46 s [vector] minIndexBy: OK
  5585. 947.46 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5586. 947.46 s [vector] ListFirstMaxIndexWins: OK
  5587. 947.46 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5588. 947.46 s [vector] FalseListFirstMaxIndexWins: OK
  5589. 947.46 s [vector] +++ OK, failed as expected. (after 1 test):
  5590. 947.46 s [vector] Exception:
  5591. 947.46 s [vector] Prelude.foldr1: empty list
  5592. 947.46 s [vector] CallStack (from HasCallStack):
  5593. 947.46 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  5594. 947.46 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  5595. 947.46 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  5596. 947.46 s [vector] []
  5597. 947.46 s [vector] zip: OK
  5598. 947.46 s [vector] +++ OK, passed 100 tests.
  5599. 947.47 s [vector] zip3: OK
  5600. 947.47 s [vector] +++ OK, passed 100 tests.
  5601. 947.47 s [vector] unzip: OK
  5602. 947.47 s [vector] +++ OK, passed 100 tests.
  5603. 947.47 s [vector] unzip3: OK
  5604. 947.48 s [vector] +++ OK, passed 100 tests.
  5605. 947.48 s [vector] indexed: OK
  5606. 947.48 s [vector] +++ OK, passed 100 tests.
  5607. 947.48 s [vector] update: OK
  5608. 947.48 s [vector] +++ OK, passed 100 tests.
  5609. 947.49 s [vector] concat: OK (0.01s)
  5610. 947.49 s [vector] +++ OK, passed 100 tests.
  5611. 947.49 s [vector] mempty: OK
  5612. 947.49 s [vector] +++ OK, passed 100 tests.
  5613. 947.49 s [vector] mappend: OK
  5614. 947.49 s [vector] +++ OK, passed 100 tests.
  5615. 947.50 s [vector] mconcat: OK (0.01s)
  5616. 947.50 s [vector] +++ OK, passed 100 tests.
  5617. 947.50 s [vector] fmap: OK
  5618. 947.50 s [vector] +++ OK, passed 100 tests.
  5619. 947.50 s [vector] return: OK
  5620. 947.50 s [vector] +++ OK, passed 100 tests.
  5621. 947.53 s [vector] bind: OK (0.02s)
  5622. 947.53 s [vector] +++ OK, passed 100 tests.
  5623. 947.53 s [vector] mzip: OK
  5624. 947.53 s [vector] +++ OK, passed 100 tests.
  5625. 947.53 s [vector] munzip: OK
  5626. 947.53 s [vector] +++ OK, passed 100 tests.
  5627. 947.53 s [vector] applicative_pure: OK
  5628. 947.53 s [vector] +++ OK, passed 100 tests.
  5629. 947.57 s [vector] applicative_appl: OK (0.04s)
  5630. 947.57 s [vector] +++ OK, passed 100 tests.
  5631. 947.57 s [vector] alternative_empty: OK
  5632. 947.57 s [vector] +++ OK, passed 100 tests.
  5633. 947.57 s [vector] alternative_or: OK
  5634. 947.57 s [vector] +++ OK, passed 100 tests.
  5635. 947.60 s [vector] sequence: OK (0.03s)
  5636. 947.60 s [vector] +++ OK, passed 100 tests.
  5637. 947.62 s [vector] sequence_: OK (0.01s)
  5638. 947.62 s [vector] +++ OK, passed 100 tests.
  5639. 947.62 s [vector] glength: OK
  5640. 947.62 s [vector] +++ OK, passed 100 tests.
  5641. 947.62 s [vector] sum: OK
  5642. 947.62 s [vector] +++ OK, passed 100 tests.
  5643. 947.62 s [vector] product: OK
  5644. 947.62 s [vector] +++ OK, passed 100 tests.
  5645. 947.62 s [vector] enumFromN: OK
  5646. 947.62 s [vector] +++ OK, passed 100 tests.
  5647. 947.62 s [vector] enumFromThenN: OK
  5648. 947.62 s [vector] +++ OK, passed 100 tests.
  5649. 947.62 s [vector] enumFromTo: OK
  5650. 947.62 s [vector] +++ OK, passed 100 tests.
  5651. 947.62 s [vector] enumFromThenTo: OK
  5652. 947.62 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5653. 947.62 s [vector] unstream
  5654. 947.62 s [vector] unstream == vunstream (exact): OK
  5655. 947.62 s [vector] +++ OK, passed 100 tests.
  5656. 947.63 s [vector] unstream == vunstream (unknown): OK
  5657. 947.63 s [vector] +++ OK, passed 100 tests.
  5658. 947.63 s [vector] unstreamR ~= vunstream (exact): OK
  5659. 947.63 s [vector] +++ OK, passed 100 tests.
  5660. 947.63 s [vector] unstreamR ~= vunstream (unknown): OK
  5661. 947.63 s [vector] +++ OK, passed 100 tests.
  5662. 947.63 s [vector] Tests.Vector.Primitive
  5663. 947.63 s [vector] Int
  5664. 947.63 s [vector] fromList.toList == id: OK
  5665. 947.63 s [vector] +++ OK, passed 100 tests.
  5666. 947.63 s [vector] toList.fromList == id: OK
  5667. 947.63 s [vector] +++ OK, passed 100 tests.
  5668. 947.63 s [vector] unstream.stream == id: OK
  5669. 947.63 s [vector] +++ OK, passed 100 tests.
  5670. 947.63 s [vector] stream.unstream == id: OK
  5671. 947.63 s [vector] +++ OK, passed 100 tests.
  5672. 947.63 s [vector] eq: OK
  5673. 947.63 s [vector] +++ OK, passed 100 tests.
  5674. 947.63 s [vector] length: OK
  5675. 947.63 s [vector] +++ OK, passed 100 tests.
  5676. 947.63 s [vector] null: OK
  5677. 947.63 s [vector] +++ OK, passed 100 tests.
  5678. 947.63 s [vector] index: OK
  5679. 947.63 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5680. 947.63 s [vector] safeIndex: OK
  5681. 947.64 s [vector] +++ OK, passed 100 tests.
  5682. 947.64 s [vector] head: OK
  5683. 947.64 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5684. 947.64 s [vector] last: OK
  5685. 947.64 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5686. 947.64 s [vector] unsafeIndex: OK
  5687. 947.64 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5688. 947.64 s [vector] unsafeHead: OK
  5689. 947.64 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5690. 947.64 s [vector] unsafeLast: OK
  5691. 947.64 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5692. 947.64 s [vector] slice: OK
  5693. 947.64 s [vector] +++ OK, passed 100 tests.
  5694. 947.64 s [vector] init: OK
  5695. 947.64 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5696. 947.64 s [vector] tail: OK
  5697. 947.64 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5698. 947.64 s [vector] take: OK
  5699. 947.64 s [vector] +++ OK, passed 100 tests.
  5700. 947.64 s [vector] drop: OK
  5701. 947.64 s [vector] +++ OK, passed 100 tests.
  5702. 947.64 s [vector] splitAt: OK
  5703. 947.64 s [vector] +++ OK, passed 100 tests.
  5704. 947.65 s [vector] empty: OK
  5705. 947.65 s [vector] +++ OK, passed 100 tests.
  5706. 947.65 s [vector] singleton: OK
  5707. 947.65 s [vector] +++ OK, passed 100 tests.
  5708. 947.65 s [vector] replicate: OK
  5709. 947.65 s [vector] +++ OK, passed 100 tests.
  5710. 947.65 s [vector] generate: OK
  5711. 947.65 s [vector] +++ OK, passed 100 tests.
  5712. 947.66 s [vector] iterateN: OK
  5713. 947.66 s [vector] +++ OK, passed 100 tests.
  5714. 947.68 s [vector] iterateNM: OK (0.02s)
  5715. 947.68 s [vector] +++ OK, passed 100 tests.
  5716. 947.71 s [vector] generateM: OK (0.03s)
  5717. 947.71 s [vector] +++ OK, passed 100 tests.
  5718. 947.71 s [vector] replicateM: OK (0.01s)
  5719. 947.71 s [vector] +++ OK, passed 100 tests.
  5720. 947.71 s [vector] create: OK
  5721. 947.72 s [vector] +++ OK, passed 100 tests.
  5722. 947.72 s [vector] createT: OK
  5723. 947.72 s [vector] +++ OK, passed 100 tests.
  5724. 947.72 s [vector] unfoldr: OK
  5725. 947.72 s [vector] +++ OK, passed 100 tests.
  5726. 947.72 s [vector] unfoldrN: OK
  5727. 947.72 s [vector] +++ OK, passed 100 tests.
  5728. 947.72 s [vector] unfoldrExactN: OK
  5729. 947.72 s [vector] +++ OK, passed 100 tests.
  5730. 947.72 s [vector] unfoldrM: OK
  5731. 947.72 s [vector] +++ OK, passed 100 tests.
  5732. 947.73 s [vector] unfoldrNM: OK
  5733. 947.73 s [vector] +++ OK, passed 100 tests.
  5734. 947.76 s [vector] unfoldrExactNM: OK (0.03s)
  5735. 947.76 s [vector] +++ OK, passed 100 tests.
  5736. 947.76 s [vector] constructN: OK
  5737. 947.76 s [vector] +++ OK, passed 100 tests.
  5738. 947.76 s [vector] constructrN: OK
  5739. 947.76 s [vector] +++ OK, passed 100 tests.
  5740. 947.76 s [vector] cons: OK
  5741. 947.76 s [vector] +++ OK, passed 100 tests.
  5742. 947.76 s [vector] snoc: OK
  5743. 947.77 s [vector] +++ OK, passed 100 tests.
  5744. 947.78 s [vector] append: OK
  5745. 947.78 s [vector] +++ OK, passed 100 tests.
  5746. 947.79 s [vector] concat: OK (0.02s)
  5747. 947.79 s [vector] +++ OK, passed 100 tests.
  5748. 947.79 s [vector] force: OK
  5749. 947.80 s [vector] +++ OK, passed 100 tests.
  5750. 947.80 s [vector] upd: OK
  5751. 947.80 s [vector] +++ OK, passed 100 tests.
  5752. 947.80 s [vector] accum: OK
  5753. 947.80 s [vector] +++ OK, passed 100 tests.
  5754. 947.80 s [vector] reverse: OK
  5755. 947.80 s [vector] +++ OK, passed 100 tests.
  5756. 947.80 s [vector] backpermute: OK
  5757. 947.81 s [vector] +++ OK, passed 100 tests.
  5758. 947.81 s [vector] map: OK
  5759. 947.82 s [vector] +++ OK, passed 100 tests.
  5760. 947.82 s [vector] imap: OK
  5761. 947.82 s [vector] +++ OK, passed 100 tests.
  5762. 947.82 s [vector] concatMap: OK
  5763. 947.82 s [vector] +++ OK, passed 100 tests.
  5764. 947.82 s [vector] mapM: OK
  5765. 947.82 s [vector] +++ OK, passed 100 tests.
  5766. 947.83 s [vector] mapM_: OK (0.02s)
  5767. 947.84 s [vector] +++ OK, passed 100 tests.
  5768. 947.84 s [vector] forM: OK
  5769. 947.84 s [vector] +++ OK, passed 100 tests.
  5770. 947.86 s [vector] forM_: OK (0.02s)
  5771. 947.86 s [vector] +++ OK, passed 100 tests.
  5772. 947.86 s [vector] imapM: OK
  5773. 947.86 s [vector] +++ OK, passed 100 tests.
  5774. 947.88 s [vector] imapM_: OK (0.02s)
  5775. 947.88 s [vector] +++ OK, passed 100 tests.
  5776. 947.88 s [vector] zipWith: OK
  5777. 947.88 s [vector] +++ OK, passed 100 tests.
  5778. 947.88 s [vector] zipWith3: OK
  5779. 947.88 s [vector] +++ OK, passed 100 tests.
  5780. 947.89 s [vector] izipWith: OK
  5781. 947.89 s [vector] +++ OK, passed 100 tests.
  5782. 947.90 s [vector] izipWith3: OK
  5783. 947.90 s [vector] +++ OK, passed 100 tests.
  5784. 947.90 s [vector] izipWithM: OK
  5785. 947.90 s [vector] +++ OK, passed 100 tests.
  5786. 947.91 s [vector] izipWithM_: OK (0.01s)
  5787. 947.92 s [vector] +++ OK, passed 100 tests.
  5788. 947.92 s [vector] zipWithM: OK
  5789. 947.92 s [vector] +++ OK, passed 100 tests.
  5790. 947.93 s [vector] zipWithM_: OK (0.02s)
  5791. 947.93 s [vector] +++ OK, passed 100 tests.
  5792. 947.94 s [vector] filter: OK
  5793. 947.94 s [vector] +++ OK, passed 100 tests.
  5794. 947.94 s [vector] ifilter: OK
  5795. 947.94 s [vector] +++ OK, passed 100 tests.
  5796. 947.96 s [vector] filterM: OK (0.03s)
  5797. 947.96 s [vector] +++ OK, passed 100 tests.
  5798. 947.96 s [vector] uniq: OK
  5799. 947.96 s [vector] +++ OK, passed 100 tests.
  5800. 947.96 s [vector] mapMaybe: OK
  5801. 947.96 s [vector] +++ OK, passed 100 tests.
  5802. 947.96 s [vector] imapMaybe: OK
  5803. 947.96 s [vector] +++ OK, passed 100 tests.
  5804. 947.96 s [vector] takeWhile: OK
  5805. 947.96 s [vector] +++ OK, passed 100 tests.
  5806. 947.97 s [vector] dropWhile: OK
  5807. 947.97 s [vector] +++ OK, passed 100 tests.
  5808. 947.97 s [vector] partition: OK
  5809. 947.97 s [vector] +++ OK, passed 100 tests.
  5810. 947.97 s [vector] partitionWith: OK
  5811. 947.97 s [vector] +++ OK, passed 100 tests.
  5812. 947.97 s [vector] span: OK
  5813. 947.97 s [vector] +++ OK, passed 100 tests.
  5814. 947.97 s [vector] break: OK
  5815. 947.97 s [vector] +++ OK, passed 100 tests.
  5816. 947.97 s [vector] spanR: OK
  5817. 947.98 s [vector] +++ OK, passed 100 tests.
  5818. 947.98 s [vector] breakR: OK
  5819. 947.98 s [vector] +++ OK, passed 100 tests.
  5820. 947.98 s [vector] groupBy: OK
  5821. 947.98 s [vector] +++ OK, passed 100 tests.
  5822. 947.98 s [vector] elem: OK
  5823. 947.98 s [vector] +++ OK, passed 100 tests.
  5824. 947.98 s [vector] notElem: OK
  5825. 947.98 s [vector] +++ OK, passed 100 tests.
  5826. 947.98 s [vector] find: OK
  5827. 947.98 s [vector] +++ OK, passed 100 tests.
  5828. 947.98 s [vector] findIndex: OK
  5829. 947.98 s [vector] +++ OK, passed 100 tests.
  5830. 947.98 s [vector] findIndexR: OK
  5831. 947.98 s [vector] +++ OK, passed 100 tests.
  5832. 947.99 s [vector] findIndices: OK
  5833. 947.99 s [vector] +++ OK, passed 100 tests.
  5834. 947.99 s [vector] elemIndex: OK
  5835. 947.99 s [vector] +++ OK, passed 100 tests.
  5836. 948.00 s [vector] elemIndices: OK
  5837. 948.00 s [vector] +++ OK, passed 100 tests.
  5838. 948.01 s [vector] foldl: OK
  5839. 948.02 s [vector] +++ OK, passed 100 tests.
  5840. 948.02 s [vector] foldl1: OK
  5841. 948.02 s [vector] +++ OK, passed 100 tests; 24 discarded.
  5842. 948.02 s [vector] foldl': OK
  5843. 948.02 s [vector] +++ OK, passed 100 tests.
  5844. 948.02 s [vector] foldl1': OK
  5845. 948.02 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5846. 948.02 s [vector] foldr: OK
  5847. 948.02 s [vector] +++ OK, passed 100 tests.
  5848. 948.02 s [vector] foldr1: OK
  5849. 948.02 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5850. 948.02 s [vector] foldr': OK
  5851. 948.02 s [vector] +++ OK, passed 100 tests.
  5852. 948.02 s [vector] foldr1': OK
  5853. 948.02 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5854. 948.02 s [vector] ifoldl: OK
  5855. 948.03 s [vector] +++ OK, passed 100 tests.
  5856. 948.03 s [vector] ifoldl': OK
  5857. 948.04 s [vector] +++ OK, passed 100 tests.
  5858. 948.04 s [vector] ifoldr: OK
  5859. 948.04 s [vector] +++ OK, passed 100 tests.
  5860. 948.04 s [vector] ifoldr': OK
  5861. 948.04 s [vector] +++ OK, passed 100 tests.
  5862. 948.05 s [vector] ifoldM: OK
  5863. 948.06 s [vector] +++ OK, passed 100 tests.
  5864. 948.06 s [vector] ifoldM': OK
  5865. 948.06 s [vector] +++ OK, passed 100 tests.
  5866. 948.08 s [vector] ifoldM_: OK (0.02s)
  5867. 948.08 s [vector] +++ OK, passed 100 tests.
  5868. 948.09 s [vector] ifoldM'_: OK (0.02s)
  5869. 948.09 s [vector] +++ OK, passed 100 tests.
  5870. 948.09 s [vector] all: OK
  5871. 948.09 s [vector] +++ OK, passed 100 tests.
  5872. 948.09 s [vector] any: OK
  5873. 948.09 s [vector] +++ OK, passed 100 tests.
  5874. 948.10 s [vector] prescanl: OK
  5875. 948.10 s [vector] +++ OK, passed 100 tests.
  5876. 948.10 s [vector] prescanl': OK
  5877. 948.10 s [vector] +++ OK, passed 100 tests.
  5878. 948.10 s [vector] postscanl: OK
  5879. 948.10 s [vector] +++ OK, passed 100 tests.
  5880. 948.11 s [vector] postscanl': OK
  5881. 948.11 s [vector] +++ OK, passed 100 tests.
  5882. 948.11 s [vector] scanl: OK
  5883. 948.11 s [vector] +++ OK, passed 100 tests.
  5884. 948.11 s [vector] scanl': OK
  5885. 948.11 s [vector] +++ OK, passed 100 tests.
  5886. 948.11 s [vector] scanl1: OK
  5887. 948.12 s [vector] +++ OK, passed 100 tests.
  5888. 948.12 s [vector] scanl1': OK
  5889. 948.12 s [vector] +++ OK, passed 100 tests.
  5890. 948.12 s [vector] iscanl: OK
  5891. 948.12 s [vector] +++ OK, passed 100 tests.
  5892. 948.13 s [vector] iscanl': OK
  5893. 948.13 s [vector] +++ OK, passed 100 tests.
  5894. 948.13 s [vector] prescanr: OK
  5895. 948.13 s [vector] +++ OK, passed 100 tests.
  5896. 948.13 s [vector] prescanr': OK
  5897. 948.13 s [vector] +++ OK, passed 100 tests.
  5898. 948.14 s [vector] postscanr: OK
  5899. 948.14 s [vector] +++ OK, passed 100 tests.
  5900. 948.14 s [vector] postscanr': OK
  5901. 948.14 s [vector] +++ OK, passed 100 tests.
  5902. 948.14 s [vector] scanr: OK
  5903. 948.14 s [vector] +++ OK, passed 100 tests.
  5904. 948.15 s [vector] scanr': OK
  5905. 948.15 s [vector] +++ OK, passed 100 tests.
  5906. 948.15 s [vector] scanr1: OK
  5907. 948.15 s [vector] +++ OK, passed 100 tests.
  5908. 948.15 s [vector] scanr1': OK
  5909. 948.15 s [vector] +++ OK, passed 100 tests.
  5910. 948.15 s [vector] iscanr: OK
  5911. 948.15 s [vector] +++ OK, passed 100 tests.
  5912. 948.16 s [vector] iscanr': OK
  5913. 948.16 s [vector] +++ OK, passed 100 tests.
  5914. 948.16 s [vector] mut_read: OK
  5915. 948.16 s [vector] +++ OK, passed 100 tests; 12 discarded.
  5916. 948.16 s [vector] mut_write: OK
  5917. 948.16 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5918. 948.16 s [vector] mut_modify: OK
  5919. 948.16 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5920. 948.17 s [vector] mut_generate: OK
  5921. 948.17 s [vector] +++ OK, passed 100 tests.
  5922. 948.18 s [vector] mut_generateM: OK
  5923. 948.18 s [vector] +++ OK, passed 100 tests.
  5924. 948.20 s [vector] mut_mapM_: OK (0.02s)
  5925. 948.20 s [vector] +++ OK, passed 100 tests.
  5926. 948.22 s [vector] mut_imapM_: OK (0.02s)
  5927. 948.22 s [vector] +++ OK, passed 100 tests.
  5928. 948.23 s [vector] mut_forM_: OK (0.02s)
  5929. 948.23 s [vector] +++ OK, passed 100 tests.
  5930. 948.25 s [vector] mut_iforM_: OK (0.01s)
  5931. 948.25 s [vector] +++ OK, passed 100 tests.
  5932. 948.26 s [vector] mut_foldr: OK
  5933. 948.26 s [vector] +++ OK, passed 100 tests.
  5934. 948.26 s [vector] mut_foldr': OK
  5935. 948.26 s [vector] +++ OK, passed 100 tests.
  5936. 948.26 s [vector] mut_foldl: OK
  5937. 948.26 s [vector] +++ OK, passed 100 tests.
  5938. 948.26 s [vector] mut_foldl': OK
  5939. 948.27 s [vector] +++ OK, passed 100 tests.
  5940. 948.27 s [vector] mut_ifoldr: OK
  5941. 948.27 s [vector] +++ OK, passed 100 tests.
  5942. 948.27 s [vector] mut_ifoldr': OK
  5943. 948.28 s [vector] +++ OK, passed 100 tests.
  5944. 948.28 s [vector] mut_ifoldl: OK
  5945. 948.28 s [vector] +++ OK, passed 100 tests.
  5946. 948.28 s [vector] mut_ifoldl': OK
  5947. 948.28 s [vector] +++ OK, passed 100 tests.
  5948. 948.28 s [vector] mut_foldM: OK
  5949. 948.28 s [vector] +++ OK, passed 100 tests.
  5950. 948.29 s [vector] mut_foldM': OK
  5951. 948.29 s [vector] +++ OK, passed 100 tests.
  5952. 948.29 s [vector] mut_foldrM: OK
  5953. 948.29 s [vector] +++ OK, passed 100 tests.
  5954. 948.30 s [vector] mut_foldrM': OK
  5955. 948.30 s [vector] +++ OK, passed 100 tests.
  5956. 948.30 s [vector] mut_ifoldM: OK
  5957. 948.30 s [vector] +++ OK, passed 100 tests.
  5958. 948.31 s [vector] mut_ifoldM': OK
  5959. 948.31 s [vector] +++ OK, passed 100 tests.
  5960. 948.31 s [vector] mut_ifoldrM: OK
  5961. 948.31 s [vector] +++ OK, passed 100 tests.
  5962. 948.31 s [vector] mut_ifoldrM': OK
  5963. 948.31 s [vector] +++ OK, passed 100 tests.
  5964. 948.31 s [vector] compare: OK
  5965. 948.31 s [vector] +++ OK, passed 100 tests.
  5966. 948.31 s [vector] maximum: OK
  5967. 948.31 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5968. 948.31 s [vector] minimum: OK
  5969. 948.31 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5970. 948.31 s [vector] minIndex: OK
  5971. 948.31 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5972. 948.31 s [vector] maxIndex: OK
  5973. 948.32 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5974. 948.32 s [vector] maximumBy: OK
  5975. 948.32 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5976. 948.32 s [vector] minimumBy: OK
  5977. 948.32 s [vector] +++ OK, passed 100 tests; 12 discarded.
  5978. 948.32 s [vector] maximumOn: OK
  5979. 948.32 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5980. 948.32 s [vector] minimumOn: OK
  5981. 948.32 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5982. 948.32 s [vector] maxIndexBy: OK
  5983. 948.32 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5984. 948.32 s [vector] minIndexBy: OK
  5985. 948.32 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5986. 948.32 s [vector] ListFirstMaxIndexWins: OK
  5987. 948.32 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5988. 948.32 s [vector] FalseListFirstMaxIndexWins: OK
  5989. 948.32 s [vector] +++ OK, failed as expected. (after 1 test):
  5990. 948.32 s [vector] Exception:
  5991. 948.32 s [vector] Prelude.foldr1: empty list
  5992. 948.32 s [vector] CallStack (from HasCallStack):
  5993. 948.32 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  5994. 948.32 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  5995. 948.32 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  5996. 948.32 s [vector] []
  5997. 948.32 s [vector] mempty: OK
  5998. 948.32 s [vector] +++ OK, passed 100 tests.
  5999. 948.34 s [vector] mappend: OK
  6000. 948.34 s [vector] +++ OK, passed 100 tests.
  6001. 948.34 s [vector] mconcat: OK (0.02s)
  6002. 948.34 s [vector] +++ OK, passed 100 tests.
  6003. 948.34 s [vector] glength: OK
  6004. 948.34 s [vector] +++ OK, passed 100 tests.
  6005. 948.35 s [vector] sum: OK
  6006. 948.35 s [vector] +++ OK, passed 100 tests.
  6007. 948.35 s [vector] product: OK
  6008. 948.35 s [vector] +++ OK, passed 100 tests.
  6009. 948.35 s [vector] enumFromN: OK
  6010. 948.35 s [vector] +++ OK, passed 100 tests.
  6011. 948.35 s [vector] enumFromThenN: OK
  6012. 948.35 s [vector] +++ OK, passed 100 tests.
  6013. 948.35 s [vector] enumFromTo: OK
  6014. 948.35 s [vector] +++ OK, passed 100 tests.
  6015. 948.35 s [vector] enumFromThenTo: OK
  6016. 948.35 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6017. 948.35 s [vector] Double
  6018. 948.35 s [vector] fromList.toList == id: OK
  6019. 948.35 s [vector] +++ OK, passed 100 tests.
  6020. 948.35 s [vector] toList.fromList == id: OK
  6021. 948.35 s [vector] +++ OK, passed 100 tests.
  6022. 948.35 s [vector] unstream.stream == id: OK
  6023. 948.35 s [vector] +++ OK, passed 100 tests.
  6024. 948.35 s [vector] stream.unstream == id: OK
  6025. 948.35 s [vector] +++ OK, passed 100 tests.
  6026. 948.36 s [vector] eq: OK
  6027. 948.36 s [vector] +++ OK, passed 100 tests.
  6028. 948.36 s [vector] length: OK
  6029. 948.36 s [vector] +++ OK, passed 100 tests.
  6030. 948.36 s [vector] null: OK
  6031. 948.36 s [vector] +++ OK, passed 100 tests.
  6032. 948.36 s [vector] index: OK
  6033. 948.36 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6034. 948.36 s [vector] safeIndex: OK
  6035. 948.36 s [vector] +++ OK, passed 100 tests.
  6036. 948.36 s [vector] head: OK
  6037. 948.36 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6038. 948.36 s [vector] last: OK
  6039. 948.36 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6040. 948.36 s [vector] unsafeIndex: OK
  6041. 948.36 s [vector] +++ OK, passed 100 tests; 20 discarded.
  6042. 948.36 s [vector] unsafeHead: OK
  6043. 948.36 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6044. 948.36 s [vector] unsafeLast: OK
  6045. 948.36 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6046. 948.36 s [vector] slice: OK
  6047. 948.36 s [vector] +++ OK, passed 100 tests.
  6048. 948.37 s [vector] init: OK
  6049. 948.37 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6050. 948.37 s [vector] tail: OK
  6051. 948.37 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6052. 948.37 s [vector] take: OK
  6053. 948.37 s [vector] +++ OK, passed 100 tests.
  6054. 948.37 s [vector] drop: OK
  6055. 948.37 s [vector] +++ OK, passed 100 tests.
  6056. 948.37 s [vector] splitAt: OK
  6057. 948.37 s [vector] +++ OK, passed 100 tests.
  6058. 948.37 s [vector] empty: OK
  6059. 948.37 s [vector] +++ OK, passed 100 tests.
  6060. 948.37 s [vector] singleton: OK
  6061. 948.37 s [vector] +++ OK, passed 100 tests.
  6062. 948.37 s [vector] replicate: OK
  6063. 948.37 s [vector] +++ OK, passed 100 tests.
  6064. 948.37 s [vector] generate: OK
  6065. 948.37 s [vector] +++ OK, passed 100 tests.
  6066. 948.37 s [vector] iterateN: OK
  6067. 948.38 s [vector] +++ OK, passed 100 tests.
  6068. 948.42 s [vector] iterateNM: OK (0.04s)
  6069. 948.42 s [vector] +++ OK, passed 100 tests.
  6070. 948.45 s [vector] generateM: OK (0.03s)
  6071. 948.45 s [vector] +++ OK, passed 100 tests.
  6072. 948.45 s [vector] replicateM: OK
  6073. 948.45 s [vector] +++ OK, passed 100 tests.
  6074. 948.45 s [vector] create: OK
  6075. 948.45 s [vector] +++ OK, passed 100 tests.
  6076. 948.46 s [vector] createT: OK
  6077. 948.46 s [vector] +++ OK, passed 100 tests.
  6078. 948.46 s [vector] unfoldr: OK
  6079. 948.46 s [vector] +++ OK, passed 100 tests.
  6080. 948.46 s [vector] unfoldrN: OK
  6081. 948.46 s [vector] +++ OK, passed 100 tests.
  6082. 948.46 s [vector] unfoldrExactN: OK
  6083. 948.46 s [vector] +++ OK, passed 100 tests.
  6084. 948.46 s [vector] unfoldrM: OK
  6085. 948.46 s [vector] +++ OK, passed 100 tests.
  6086. 948.48 s [vector] unfoldrNM: OK (0.01s)
  6087. 948.48 s [vector] +++ OK, passed 100 tests.
  6088. 948.54 s [vector] unfoldrExactNM: OK (0.05s)
  6089. 948.54 s [vector] +++ OK, passed 100 tests.
  6090. 948.55 s [vector] constructN: OK (0.01s)
  6091. 948.55 s [vector] +++ OK, passed 100 tests.
  6092. 948.55 s [vector] constructrN: OK (0.01s)
  6093. 948.55 s [vector] +++ OK, passed 100 tests.
  6094. 948.56 s [vector] cons: OK
  6095. 948.56 s [vector] +++ OK, passed 100 tests.
  6096. 948.56 s [vector] snoc: OK
  6097. 948.57 s [vector] +++ OK, passed 100 tests.
  6098. 948.57 s [vector] append: OK
  6099. 948.57 s [vector] +++ OK, passed 100 tests.
  6100. 948.58 s [vector] concat: OK (0.02s)
  6101. 948.58 s [vector] +++ OK, passed 100 tests.
  6102. 948.58 s [vector] force: OK
  6103. 948.58 s [vector] +++ OK, passed 100 tests.
  6104. 948.58 s [vector] upd: OK
  6105. 948.58 s [vector] +++ OK, passed 100 tests.
  6106. 948.60 s [vector] accum: OK (0.02s)
  6107. 948.60 s [vector] +++ OK, passed 100 tests.
  6108. 948.60 s [vector] reverse: OK
  6109. 948.60 s [vector] +++ OK, passed 100 tests.
  6110. 948.60 s [vector] backpermute: OK
  6111. 948.60 s [vector] +++ OK, passed 100 tests.
  6112. 948.61 s [vector] map: OK
  6113. 948.61 s [vector] +++ OK, passed 100 tests.
  6114. 948.62 s [vector] imap: OK
  6115. 948.62 s [vector] +++ OK, passed 100 tests.
  6116. 948.62 s [vector] concatMap: OK
  6117. 948.62 s [vector] +++ OK, passed 100 tests.
  6118. 948.63 s [vector] mapM: OK
  6119. 948.63 s [vector] +++ OK, passed 100 tests.
  6120. 948.68 s [vector] mapM_: OK (0.04s)
  6121. 948.68 s [vector] +++ OK, passed 100 tests.
  6122. 948.68 s [vector] forM: OK
  6123. 948.68 s [vector] +++ OK, passed 100 tests.
  6124. 948.72 s [vector] forM_: OK (0.03s)
  6125. 948.72 s [vector] +++ OK, passed 100 tests.
  6126. 948.72 s [vector] imapM: OK
  6127. 948.72 s [vector] +++ OK, passed 100 tests.
  6128. 948.76 s [vector] imapM_: OK (0.03s)
  6129. 948.76 s [vector] +++ OK, passed 100 tests.
  6130. 948.77 s [vector] zipWith: OK
  6131. 948.78 s [vector] +++ OK, passed 100 tests.
  6132. 948.78 s [vector] zipWith3: OK (0.01s)
  6133. 948.78 s [vector] +++ OK, passed 100 tests.
  6134. 948.80 s [vector] izipWith: OK
  6135. 948.80 s [vector] +++ OK, passed 100 tests.
  6136. 948.80 s [vector] izipWith3: OK (0.01s)
  6137. 948.80 s [vector] +++ OK, passed 100 tests.
  6138. 948.82 s [vector] izipWithM: OK (0.01s)
  6139. 948.82 s [vector] +++ OK, passed 100 tests.
  6140. 948.84 s [vector] izipWithM_: OK (0.03s)
  6141. 948.84 s [vector] +++ OK, passed 100 tests.
  6142. 948.86 s [vector] zipWithM: OK (0.01s)
  6143. 948.99 s [vector] +++ OK, passed 100 tests.
  6144. 948.99 s [vector] zipWithM_: OK (0.03s)
  6145. 948.99 s [vector] +++ OK, passed 100 tests.
  6146. 948.99 s [vector] filter: OK
  6147. 948.99 s [vector] +++ OK, passed 100 tests.
  6148. 948.99 s [vector] ifilter: OK
  6149. 948.99 s [vector] +++ OK, passed 100 tests.
  6150. 948.99 s [vector] filterM: OK (0.05s)
  6151. 948.99 s [vector] +++ OK, passed 100 tests.
  6152. 948.99 s [vector] uniq: OK
  6153. 948.99 s [vector] +++ OK, passed 100 tests.
  6154. 948.99 s [vector] mapMaybe: OK
  6155. 948.99 s [vector] +++ OK, passed 100 tests.
  6156. 948.99 s [vector] imapMaybe: OK
  6157. 948.99 s [vector] +++ OK, passed 100 tests.
  6158. 948.99 s [vector] takeWhile: OK
  6159. 948.99 s [vector] +++ OK, passed 100 tests.
  6160. 948.99 s [vector] dropWhile: OK
  6161. 948.99 s [vector] +++ OK, passed 100 tests.
  6162. 948.99 s [vector] partition: OK
  6163. 948.99 s [vector] +++ OK, passed 100 tests.
  6164. 948.99 s [vector] partitionWith: OK
  6165. 948.99 s [vector] +++ OK, passed 100 tests.
  6166. 948.99 s [vector] span: OK
  6167. 948.99 s [vector] +++ OK, passed 100 tests.
  6168. 948.99 s [vector] break: OK
  6169. 948.99 s [vector] +++ OK, passed 100 tests.
  6170. 948.99 s [vector] spanR: OK
  6171. 949.00 s [vector] +++ OK, passed 100 tests.
  6172. 949.00 s [vector] breakR: OK
  6173. 949.00 s [vector] +++ OK, passed 100 tests.
  6174. 949.01 s [vector] groupBy: OK (0.02s)
  6175. 949.01 s [vector] +++ OK, passed 100 tests.
  6176. 949.01 s [vector] elem: OK
  6177. 949.01 s [vector] +++ OK, passed 100 tests.
  6178. 949.02 s [vector] notElem: OK
  6179. 949.02 s [vector] +++ OK, passed 100 tests.
  6180. 949.02 s [vector] find: OK
  6181. 949.02 s [vector] +++ OK, passed 100 tests.
  6182. 949.02 s [vector] findIndex: OK
  6183. 949.03 s [vector] +++ OK, passed 100 tests.
  6184. 949.04 s [vector] findIndexR: OK
  6185. 949.04 s [vector] +++ OK, passed 100 tests.
  6186. 949.04 s [vector] findIndices: OK (0.01s)
  6187. 949.04 s [vector] +++ OK, passed 100 tests.
  6188. 949.04 s [vector] elemIndex: OK
  6189. 949.04 s [vector] +++ OK, passed 100 tests.
  6190. 949.04 s [vector] elemIndices: OK
  6191. 949.04 s [vector] +++ OK, passed 100 tests.
  6192. 949.06 s [vector] foldl: OK (0.01s)
  6193. 949.06 s [vector] +++ OK, passed 100 tests.
  6194. 949.06 s [vector] foldl1: OK (0.01s)
  6195. 949.06 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6196. 949.08 s [vector] foldl': OK
  6197. 949.08 s [vector] +++ OK, passed 100 tests.
  6198. 949.10 s [vector] foldl1': OK (0.01s)
  6199. 949.10 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6200. 949.10 s [vector] foldr: OK (0.01s)
  6201. 949.10 s [vector] +++ OK, passed 100 tests.
  6202. 949.12 s [vector] foldr1: OK (0.01s)
  6203. 949.12 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6204. 949.12 s [vector] foldr': OK (0.01s)
  6205. 949.12 s [vector] +++ OK, passed 100 tests.
  6206. 949.14 s [vector] foldr1': OK (0.01s)
  6207. 949.14 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6208. 949.16 s [vector] ifoldl: OK (0.01s)
  6209. 949.16 s [vector] +++ OK, passed 100 tests.
  6210. 949.16 s [vector] ifoldl': OK (0.01s)
  6211. 949.16 s [vector] +++ OK, passed 100 tests.
  6212. 949.18 s [vector] ifoldr: OK (0.02s)
  6213. 949.18 s [vector] +++ OK, passed 100 tests.
  6214. 949.20 s [vector] ifoldr': OK (0.01s)
  6215. 949.20 s [vector] +++ OK, passed 100 tests.
  6216. 949.22 s [vector] ifoldM: OK (0.01s)
  6217. 949.22 s [vector] +++ OK, passed 100 tests.
  6218. 949.22 s [vector] ifoldM': OK (0.01s)
  6219. 949.22 s [vector] +++ OK, passed 100 tests.
  6220. 949.26 s [vector] ifoldM_: OK (0.04s)
  6221. 949.26 s [vector] +++ OK, passed 100 tests.
  6222. 949.30 s [vector] ifoldM'_: OK (0.04s)
  6223. 949.30 s [vector] +++ OK, passed 100 tests.
  6224. 949.30 s [vector] all: OK
  6225. 949.30 s [vector] +++ OK, passed 100 tests.
  6226. 949.32 s [vector] any: OK
  6227. 949.32 s [vector] +++ OK, passed 100 tests.
  6228. 949.32 s [vector] prescanl: OK (0.01s)
  6229. 949.32 s [vector] +++ OK, passed 100 tests.
  6230. 949.34 s [vector] prescanl': OK (0.01s)
  6231. 949.34 s [vector] +++ OK, passed 100 tests.
  6232. 949.34 s [vector] postscanl: OK (0.01s)
  6233. 949.34 s [vector] +++ OK, passed 100 tests.
  6234. 949.36 s [vector] postscanl': OK (0.01s)
  6235. 949.36 s [vector] +++ OK, passed 100 tests.
  6236. 949.38 s [vector] scanl: OK (0.01s)
  6237. 949.38 s [vector] +++ OK, passed 100 tests.
  6238. 949.40 s [vector] scanl': OK (0.01s)
  6239. 949.40 s [vector] +++ OK, passed 100 tests.
  6240. 949.40 s [vector] scanl1: OK (0.01s)
  6241. 949.40 s [vector] +++ OK, passed 100 tests.
  6242. 949.42 s [vector] scanl1': OK (0.01s)
  6243. 949.42 s [vector] +++ OK, passed 100 tests.
  6244. 949.42 s [vector] iscanl: OK (0.01s)
  6245. 949.42 s [vector] +++ OK, passed 100 tests.
  6246. 949.43 s [vector] iscanl': OK (0.01s)
  6247. 949.43 s [vector] +++ OK, passed 100 tests.
  6248. 949.45 s [vector] prescanr: OK
  6249. 949.45 s [vector] +++ OK, passed 100 tests.
  6250. 949.46 s [vector] prescanr': OK (0.01s)
  6251. 949.46 s [vector] +++ OK, passed 100 tests.
  6252. 949.48 s [vector] postscanr: OK (0.01s)
  6253. 949.48 s [vector] +++ OK, passed 100 tests.
  6254. 949.50 s [vector] postscanr': OK (0.01s)
  6255. 949.50 s [vector] +++ OK, passed 100 tests.
  6256. 949.50 s [vector] scanr: OK (0.01s)
  6257. 949.50 s [vector] +++ OK, passed 100 tests.
  6258. 949.52 s [vector] scanr': OK (0.01s)
  6259. 949.52 s [vector] +++ OK, passed 100 tests.
  6260. 949.52 s [vector] scanr1: OK (0.01s)
  6261. 949.52 s [vector] +++ OK, passed 100 tests.
  6262. 949.54 s [vector] scanr1': OK
  6263. 949.54 s [vector] +++ OK, passed 100 tests.
  6264. 949.56 s [vector] iscanr: OK (0.02s)
  6265. 949.56 s [vector] +++ OK, passed 100 tests.
  6266. 949.58 s [vector] iscanr': OK (0.02s)
  6267. 949.58 s [vector] +++ OK, passed 100 tests.
  6268. 949.58 s [vector] mut_read: OK
  6269. 949.58 s [vector] +++ OK, passed 100 tests; 22 discarded.
  6270. 949.58 s [vector] mut_write: OK
  6271. 949.58 s [vector] +++ OK, passed 100 tests; 24 discarded.
  6272. 949.58 s [vector] mut_modify: OK
  6273. 949.59 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6274. 949.60 s [vector] mut_generate: OK
  6275. 949.60 s [vector] +++ OK, passed 100 tests.
  6276. 949.60 s [vector] mut_generateM: OK (0.01s)
  6277. 949.60 s [vector] +++ OK, passed 100 tests.
  6278. 949.64 s [vector] mut_mapM_: OK (0.03s)
  6279. 949.64 s [vector] +++ OK, passed 100 tests.
  6280. 949.68 s [vector] mut_imapM_: OK (0.04s)
  6281. 949.68 s [vector] +++ OK, passed 100 tests.
  6282. 949.72 s [vector] mut_forM_: OK (0.03s)
  6283. 949.72 s [vector] +++ OK, passed 100 tests.
  6284. 949.74 s [vector] mut_iforM_: OK (0.04s)
  6285. 949.74 s [vector] +++ OK, passed 100 tests.
  6286. 949.76 s [vector] mut_foldr: OK
  6287. 949.76 s [vector] +++ OK, passed 100 tests.
  6288. 949.78 s [vector] mut_foldr': OK (0.01s)
  6289. 949.78 s [vector] +++ OK, passed 100 tests.
  6290. 949.79 s [vector] mut_foldl: OK (0.01s)
  6291. 949.79 s [vector] +++ OK, passed 100 tests.
  6292. 949.80 s [vector] mut_foldl': OK (0.01s)
  6293. 949.80 s [vector] +++ OK, passed 100 tests.
  6294. 949.82 s [vector] mut_ifoldr: OK (0.01s)
  6295. 949.82 s [vector] +++ OK, passed 100 tests.
  6296. 949.83 s [vector] mut_ifoldr': OK (0.01s)
  6297. 949.83 s [vector] +++ OK, passed 100 tests.
  6298. 949.84 s [vector] mut_ifoldl: OK (0.01s)
  6299. 949.84 s [vector] +++ OK, passed 100 tests.
  6300. 949.86 s [vector] mut_ifoldl': OK (0.01s)
  6301. 949.86 s [vector] +++ OK, passed 100 tests.
  6302. 949.86 s [vector] mut_foldM: OK (0.01s)
  6303. 949.86 s [vector] +++ OK, passed 100 tests.
  6304. 949.88 s [vector] mut_foldM': OK (0.01s)
  6305. 949.88 s [vector] +++ OK, passed 100 tests.
  6306. 949.90 s [vector] mut_foldrM: OK (0.01s)
  6307. 949.90 s [vector] +++ OK, passed 100 tests.
  6308. 949.91 s [vector] mut_foldrM': OK (0.01s)
  6309. 949.91 s [vector] +++ OK, passed 100 tests.
  6310. 949.92 s [vector] mut_ifoldM: OK (0.01s)
  6311. 949.92 s [vector] +++ OK, passed 100 tests.
  6312. 949.93 s [vector] mut_ifoldM': OK (0.01s)
  6313. 949.93 s [vector] +++ OK, passed 100 tests.
  6314. 949.94 s [vector] mut_ifoldrM: OK
  6315. 949.94 s [vector] +++ OK, passed 100 tests.
  6316. 949.95 s [vector] mut_ifoldrM': OK (0.01s)
  6317. 949.95 s [vector] +++ OK, passed 100 tests.
  6318. 949.95 s [vector] compare: OK
  6319. 949.95 s [vector] +++ OK, passed 100 tests.
  6320. 949.95 s [vector] maximum: OK
  6321. 949.95 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6322. 949.95 s [vector] minimum: OK
  6323. 949.95 s [vector] +++ OK, passed 100 tests; 20 discarded.
  6324. 949.95 s [vector] minIndex: OK
  6325. 949.96 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6326. 949.96 s [vector] maxIndex: OK
  6327. 949.96 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6328. 949.96 s [vector] maximumBy: OK
  6329. 949.96 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6330. 949.96 s [vector] minimumBy: OK
  6331. 949.96 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6332. 949.96 s [vector] maximumOn: OK
  6333. 949.96 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6334. 949.96 s [vector] minimumOn: OK
  6335. 949.96 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6336. 949.96 s [vector] maxIndexBy: OK
  6337. 949.96 s [vector] +++ OK, passed 100 tests; 11 discarded.
  6338. 949.96 s [vector] minIndexBy: OK
  6339. 949.96 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6340. 949.96 s [vector] ListFirstMaxIndexWins: OK
  6341. 949.96 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6342. 949.96 s [vector] FalseListFirstMaxIndexWins: OK
  6343. 949.96 s [vector] +++ OK, failed as expected. (after 1 test):
  6344. 949.96 s [vector] Exception:
  6345. 949.96 s [vector] Prelude.foldr1: empty list
  6346. 949.96 s [vector] CallStack (from HasCallStack):
  6347. 949.96 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  6348. 949.98 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  6349. 949.98 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  6350. 949.98 s [vector] []
  6351. 949.99 s [vector] mempty: OK
  6352. 949.99 s [vector] +++ OK, passed 100 tests.
  6353. 949.99 s [vector] mappend: OK
  6354. 949.99 s [vector] +++ OK, passed 100 tests.
  6355. 949.99 s [vector] mconcat: OK (0.02s)
  6356. 949.99 s [vector] +++ OK, passed 100 tests.
  6357. 949.99 s [vector] glength: OK
  6358. 949.99 s [vector] +++ OK, passed 100 tests.
  6359. 949.99 s [vector] sum: OK
  6360. 949.99 s [vector] +++ OK, passed 100 tests.
  6361. 949.99 s [vector] product: OK
  6362. 949.99 s [vector] +++ OK, passed 100 tests.
  6363. 949.99 s [vector] enumFromN: OK
  6364. 949.99 s [vector] +++ OK, passed 100 tests.
  6365. 949.99 s [vector] enumFromThenN: OK
  6366. 949.99 s [vector] +++ OK, passed 100 tests.
  6367. 949.99 s [vector] enumFromTo: OK
  6368. 949.99 s [vector] +++ OK, passed 100 tests.
  6369. 949.99 s [vector] enumFromThenTo: OK
  6370. 949.99 s [vector] +++ OK, passed 100 tests; 1 discarded.
  6371. 949.99 s [vector] unstream
  6372. 950.00 s [vector] unstream == vunstream (exact): OK
  6373. 950.00 s [vector] +++ OK, passed 100 tests.
  6374. 950.00 s [vector] unstream == vunstream (unknown): OK
  6375. 950.00 s [vector] +++ OK, passed 100 tests.
  6376. 950.00 s [vector] unstreamR ~= vunstream (exact): OK
  6377. 950.00 s [vector] +++ OK, passed 100 tests.
  6378. 950.00 s [vector] unstreamR ~= vunstream (unknown): OK
  6379. 950.00 s [vector] +++ OK, passed 100 tests.
  6380. 950.00 s [vector] Tests.Vector.Storable
  6381. 950.00 s [vector] Data.Vector.Storable.Vector (Int)
  6382. 950.00 s [vector] fromList.toList == id: OK
  6383. 950.00 s [vector] +++ OK, passed 100 tests.
  6384. 950.00 s [vector] toList.fromList == id: OK
  6385. 950.00 s [vector] +++ OK, passed 100 tests.
  6386. 950.00 s [vector] unstream.stream == id: OK
  6387. 950.00 s [vector] +++ OK, passed 100 tests.
  6388. 950.00 s [vector] stream.unstream == id: OK
  6389. 950.00 s [vector] +++ OK, passed 100 tests.
  6390. 950.00 s [vector] eq: OK
  6391. 950.00 s [vector] +++ OK, passed 100 tests.
  6392. 950.00 s [vector] length: OK
  6393. 950.00 s [vector] +++ OK, passed 100 tests.
  6394. 950.00 s [vector] null: OK
  6395. 950.00 s [vector] +++ OK, passed 100 tests.
  6396. 950.00 s [vector] index: OK
  6397. 950.01 s [vector] +++ OK, passed 100 tests; 23 discarded.
  6398. 950.01 s [vector] safeIndex: OK
  6399. 950.01 s [vector] +++ OK, passed 100 tests.
  6400. 950.01 s [vector] head: OK
  6401. 950.01 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6402. 950.01 s [vector] last: OK
  6403. 950.01 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6404. 950.01 s [vector] unsafeIndex: OK
  6405. 950.01 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6406. 950.01 s [vector] unsafeHead: OK
  6407. 950.01 s [vector] +++ OK, passed 100 tests; 20 discarded.
  6408. 950.01 s [vector] unsafeLast: OK
  6409. 950.01 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6410. 950.01 s [vector] slice: OK
  6411. 950.01 s [vector] +++ OK, passed 100 tests.
  6412. 950.01 s [vector] init: OK
  6413. 950.01 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6414. 950.01 s [vector] tail: OK
  6415. 950.01 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6416. 950.01 s [vector] take: OK
  6417. 950.01 s [vector] +++ OK, passed 100 tests.
  6418. 950.01 s [vector] drop: OK
  6419. 950.01 s [vector] +++ OK, passed 100 tests.
  6420. 950.01 s [vector] splitAt: OK
  6421. 950.01 s [vector] +++ OK, passed 100 tests.
  6422. 950.01 s [vector] empty: OK
  6423. 950.01 s [vector] +++ OK, passed 100 tests.
  6424. 950.01 s [vector] singleton: OK
  6425. 950.01 s [vector] +++ OK, passed 100 tests.
  6426. 950.01 s [vector] replicate: OK
  6427. 950.01 s [vector] +++ OK, passed 100 tests.
  6428. 950.01 s [vector] generate: OK
  6429. 950.02 s [vector] +++ OK, passed 100 tests.
  6430. 950.02 s [vector] iterateN: OK
  6431. 950.02 s [vector] +++ OK, passed 100 tests.
  6432. 950.04 s [vector] iterateNM: OK (0.02s)
  6433. 950.04 s [vector] +++ OK, passed 100 tests.
  6434. 950.07 s [vector] generateM: OK (0.03s)
  6435. 950.07 s [vector] +++ OK, passed 100 tests.
  6436. 950.07 s [vector] replicateM: OK
  6437. 950.07 s [vector] +++ OK, passed 100 tests.
  6438. 950.07 s [vector] create: OK
  6439. 950.08 s [vector] +++ OK, passed 100 tests.
  6440. 950.08 s [vector] createT: OK
  6441. 950.08 s [vector] +++ OK, passed 100 tests.
  6442. 950.08 s [vector] unfoldr: OK
  6443. 950.08 s [vector] +++ OK, passed 100 tests.
  6444. 950.08 s [vector] unfoldrN: OK
  6445. 950.08 s [vector] +++ OK, passed 100 tests.
  6446. 950.08 s [vector] unfoldrExactN: OK
  6447. 950.08 s [vector] +++ OK, passed 100 tests.
  6448. 950.08 s [vector] unfoldrM: OK
  6449. 950.08 s [vector] +++ OK, passed 100 tests.
  6450. 950.08 s [vector] unfoldrNM: OK
  6451. 950.08 s [vector] +++ OK, passed 100 tests.
  6452. 950.15 s [vector] unfoldrExactNM: OK (0.07s)
  6453. 950.15 s [vector] +++ OK, passed 100 tests.
  6454. 950.16 s [vector] constructN: OK
  6455. 950.16 s [vector] +++ OK, passed 100 tests.
  6456. 950.16 s [vector] constructrN: OK
  6457. 950.16 s [vector] +++ OK, passed 100 tests.
  6458. 950.16 s [vector] cons: OK
  6459. 950.16 s [vector] +++ OK, passed 100 tests.
  6460. 950.16 s [vector] snoc: OK
  6461. 950.16 s [vector] +++ OK, passed 100 tests.
  6462. 950.16 s [vector] append: OK
  6463. 950.16 s [vector] +++ OK, passed 100 tests.
  6464. 950.18 s [vector] concat: OK (0.02s)
  6465. 950.18 s [vector] +++ OK, passed 100 tests.
  6466. 950.18 s [vector] force: OK
  6467. 950.18 s [vector] +++ OK, passed 100 tests.
  6468. 950.18 s [vector] upd: OK
  6469. 950.18 s [vector] +++ OK, passed 100 tests.
  6470. 950.19 s [vector] accum: OK
  6471. 950.19 s [vector] +++ OK, passed 100 tests.
  6472. 950.19 s [vector] reverse: OK
  6473. 950.19 s [vector] +++ OK, passed 100 tests.
  6474. 950.19 s [vector] backpermute: OK
  6475. 950.19 s [vector] +++ OK, passed 100 tests.
  6476. 950.20 s [vector] map: OK
  6477. 950.20 s [vector] +++ OK, passed 100 tests.
  6478. 950.20 s [vector] imap: OK
  6479. 950.20 s [vector] +++ OK, passed 100 tests.
  6480. 950.20 s [vector] concatMap: OK
  6481. 950.20 s [vector] +++ OK, passed 100 tests.
  6482. 950.20 s [vector] mapM: OK
  6483. 950.20 s [vector] +++ OK, passed 100 tests.
  6484. 950.22 s [vector] mapM_: OK (0.02s)
  6485. 950.22 s [vector] +++ OK, passed 100 tests.
  6486. 950.22 s [vector] forM: OK
  6487. 950.22 s [vector] +++ OK, passed 100 tests.
  6488. 950.24 s [vector] forM_: OK (0.02s)
  6489. 950.24 s [vector] +++ OK, passed 100 tests.
  6490. 950.26 s [vector] imapM: OK
  6491. 950.26 s [vector] +++ OK, passed 100 tests.
  6492. 950.27 s [vector] imapM_: OK (0.02s)
  6493. 950.27 s [vector] +++ OK, passed 100 tests.
  6494. 950.27 s [vector] zipWith: OK
  6495. 950.27 s [vector] +++ OK, passed 100 tests.
  6496. 950.27 s [vector] zipWith3: OK
  6497. 950.27 s [vector] +++ OK, passed 100 tests.
  6498. 950.27 s [vector] izipWith: OK
  6499. 950.27 s [vector] +++ OK, passed 100 tests.
  6500. 950.28 s [vector] izipWith3: OK
  6501. 950.28 s [vector] +++ OK, passed 100 tests.
  6502. 950.28 s [vector] izipWithM: OK
  6503. 950.28 s [vector] +++ OK, passed 100 tests.
  6504. 950.30 s [vector] izipWithM_: OK (0.01s)
  6505. 950.30 s [vector] +++ OK, passed 100 tests.
  6506. 950.30 s [vector] zipWithM: OK
  6507. 950.30 s [vector] +++ OK, passed 100 tests.
  6508. 950.31 s [vector] zipWithM_: OK
  6509. 950.31 s [vector] +++ OK, passed 100 tests.
  6510. 950.32 s [vector] filter: OK
  6511. 950.32 s [vector] +++ OK, passed 100 tests.
  6512. 950.32 s [vector] ifilter: OK
  6513. 950.32 s [vector] +++ OK, passed 100 tests.
  6514. 950.35 s [vector] filterM: OK (0.03s)
  6515. 950.35 s [vector] +++ OK, passed 100 tests.
  6516. 950.36 s [vector] uniq: OK
  6517. 950.36 s [vector] +++ OK, passed 100 tests.
  6518. 950.36 s [vector] mapMaybe: OK
  6519. 950.36 s [vector] +++ OK, passed 100 tests.
  6520. 950.36 s [vector] imapMaybe: OK
  6521. 950.36 s [vector] +++ OK, passed 100 tests.
  6522. 950.36 s [vector] takeWhile: OK
  6523. 950.36 s [vector] +++ OK, passed 100 tests.
  6524. 950.36 s [vector] dropWhile: OK
  6525. 950.36 s [vector] +++ OK, passed 100 tests.
  6526. 950.36 s [vector] partition: OK
  6527. 950.36 s [vector] +++ OK, passed 100 tests.
  6528. 950.36 s [vector] partitionWith: OK
  6529. 950.36 s [vector] +++ OK, passed 100 tests.
  6530. 950.36 s [vector] span: OK
  6531. 950.36 s [vector] +++ OK, passed 100 tests.
  6532. 950.36 s [vector] break: OK
  6533. 950.36 s [vector] +++ OK, passed 100 tests.
  6534. 950.36 s [vector] spanR: OK
  6535. 950.36 s [vector] +++ OK, passed 100 tests.
  6536. 950.37 s [vector] breakR: OK
  6537. 950.37 s [vector] +++ OK, passed 100 tests.
  6538. 950.37 s [vector] groupBy: OK
  6539. 950.37 s [vector] +++ OK, passed 100 tests.
  6540. 950.37 s [vector] elem: OK
  6541. 950.37 s [vector] +++ OK, passed 100 tests.
  6542. 950.37 s [vector] notElem: OK
  6543. 950.37 s [vector] +++ OK, passed 100 tests.
  6544. 950.37 s [vector] find: OK
  6545. 950.37 s [vector] +++ OK, passed 100 tests.
  6546. 950.37 s [vector] findIndex: OK
  6547. 950.37 s [vector] +++ OK, passed 100 tests.
  6548. 950.37 s [vector] findIndexR: OK
  6549. 950.37 s [vector] +++ OK, passed 100 tests.
  6550. 950.38 s [vector] findIndices: OK
  6551. 950.38 s [vector] +++ OK, passed 100 tests.
  6552. 950.38 s [vector] elemIndex: OK
  6553. 950.38 s [vector] +++ OK, passed 100 tests.
  6554. 950.38 s [vector] elemIndices: OK
  6555. 950.38 s [vector] +++ OK, passed 100 tests.
  6556. 950.38 s [vector] foldl: OK
  6557. 950.38 s [vector] +++ OK, passed 100 tests.
  6558. 950.38 s [vector] foldl1: OK
  6559. 950.38 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6560. 950.38 s [vector] foldl': OK
  6561. 950.39 s [vector] +++ OK, passed 100 tests.
  6562. 950.39 s [vector] foldl1': OK
  6563. 950.40 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6564. 950.40 s [vector] foldr: OK
  6565. 950.40 s [vector] +++ OK, passed 100 tests.
  6566. 950.40 s [vector] foldr1: OK
  6567. 950.40 s [vector] +++ OK, passed 100 tests; 20 discarded.
  6568. 950.41 s [vector] foldr': OK
  6569. 950.41 s [vector] +++ OK, passed 100 tests.
  6570. 950.41 s [vector] foldr1': OK
  6571. 950.41 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6572. 950.42 s [vector] ifoldl: OK
  6573. 950.42 s [vector] +++ OK, passed 100 tests.
  6574. 950.42 s [vector] ifoldl': OK
  6575. 950.43 s [vector] +++ OK, passed 100 tests.
  6576. 950.43 s [vector] ifoldr: OK
  6577. 950.43 s [vector] +++ OK, passed 100 tests.
  6578. 950.43 s [vector] ifoldr': OK
  6579. 950.44 s [vector] +++ OK, passed 100 tests.
  6580. 950.44 s [vector] ifoldM: OK
  6581. 950.44 s [vector] +++ OK, passed 100 tests.
  6582. 950.45 s [vector] ifoldM': OK
  6583. 950.45 s [vector] +++ OK, passed 100 tests.
  6584. 950.46 s [vector] ifoldM_: OK (0.02s)
  6585. 950.46 s [vector] +++ OK, passed 100 tests.
  6586. 950.48 s [vector] ifoldM'_: OK
  6587. 950.48 s [vector] +++ OK, passed 100 tests.
  6588. 950.48 s [vector] all: OK
  6589. 950.48 s [vector] +++ OK, passed 100 tests.
  6590. 950.49 s [vector] any: OK
  6591. 950.49 s [vector] +++ OK, passed 100 tests.
  6592. 950.49 s [vector] prescanl: OK
  6593. 950.49 s [vector] +++ OK, passed 100 tests.
  6594. 950.50 s [vector] prescanl': OK
  6595. 950.50 s [vector] +++ OK, passed 100 tests.
  6596. 950.50 s [vector] postscanl: OK
  6597. 950.50 s [vector] +++ OK, passed 100 tests.
  6598. 950.50 s [vector] postscanl': OK
  6599. 950.50 s [vector] +++ OK, passed 100 tests.
  6600. 950.50 s [vector] scanl: OK
  6601. 950.50 s [vector] +++ OK, passed 100 tests.
  6602. 950.50 s [vector] scanl': OK
  6603. 950.50 s [vector] +++ OK, passed 100 tests.
  6604. 950.50 s [vector] scanl1: OK
  6605. 950.50 s [vector] +++ OK, passed 100 tests.
  6606. 950.51 s [vector] scanl1': OK
  6607. 950.51 s [vector] +++ OK, passed 100 tests.
  6608. 950.51 s [vector] iscanl: OK
  6609. 950.51 s [vector] +++ OK, passed 100 tests.
  6610. 950.51 s [vector] iscanl': OK
  6611. 950.52 s [vector] +++ OK, passed 100 tests.
  6612. 950.52 s [vector] prescanr: OK
  6613. 950.52 s [vector] +++ OK, passed 100 tests.
  6614. 950.52 s [vector] prescanr': OK
  6615. 950.52 s [vector] +++ OK, passed 100 tests.
  6616. 950.53 s [vector] postscanr: OK
  6617. 950.53 s [vector] +++ OK, passed 100 tests.
  6618. 950.54 s [vector] postscanr': OK
  6619. 950.54 s [vector] +++ OK, passed 100 tests.
  6620. 950.54 s [vector] scanr: OK
  6621. 950.54 s [vector] +++ OK, passed 100 tests.
  6622. 950.54 s [vector] scanr': OK
  6623. 950.55 s [vector] +++ OK, passed 100 tests.
  6624. 950.55 s [vector] scanr1: OK
  6625. 950.56 s [vector] +++ OK, passed 100 tests.
  6626. 950.56 s [vector] scanr1': OK
  6627. 950.56 s [vector] +++ OK, passed 100 tests.
  6628. 950.56 s [vector] iscanr: OK
  6629. 950.56 s [vector] +++ OK, passed 100 tests.
  6630. 950.56 s [vector] iscanr': OK
  6631. 950.56 s [vector] +++ OK, passed 100 tests.
  6632. 950.56 s [vector] mut_read: OK
  6633. 950.56 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6634. 950.56 s [vector] mut_write: OK
  6635. 950.56 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6636. 950.56 s [vector] mut_modify: OK
  6637. 950.56 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6638. 950.56 s [vector] mut_generate: OK
  6639. 950.56 s [vector] +++ OK, passed 100 tests.
  6640. 950.57 s [vector] mut_generateM: OK (0.01s)
  6641. 950.57 s [vector] +++ OK, passed 100 tests.
  6642. 950.58 s [vector] mut_mapM_: OK (0.02s)
  6643. 950.58 s [vector] +++ OK, passed 100 tests.
  6644. 950.60 s [vector] mut_imapM_: OK (0.02s)
  6645. 950.60 s [vector] +++ OK, passed 100 tests.
  6646. 950.62 s [vector] mut_forM_: OK (0.01s)
  6647. 950.62 s [vector] +++ OK, passed 100 tests.
  6648. 950.63 s [vector] mut_iforM_: OK (0.02s)
  6649. 950.63 s [vector] +++ OK, passed 100 tests.
  6650. 950.64 s [vector] mut_foldr: OK
  6651. 950.64 s [vector] +++ OK, passed 100 tests.
  6652. 950.64 s [vector] mut_foldr': OK
  6653. 950.64 s [vector] +++ OK, passed 100 tests.
  6654. 950.65 s [vector] mut_foldl: OK
  6655. 950.65 s [vector] +++ OK, passed 100 tests.
  6656. 950.65 s [vector] mut_foldl': OK
  6657. 950.65 s [vector] +++ OK, passed 100 tests.
  6658. 950.65 s [vector] mut_ifoldr: OK
  6659. 950.65 s [vector] +++ OK, passed 100 tests.
  6660. 950.65 s [vector] mut_ifoldr': OK
  6661. 950.65 s [vector] +++ OK, passed 100 tests.
  6662. 950.66 s [vector] mut_ifoldl: OK
  6663. 950.66 s [vector] +++ OK, passed 100 tests.
  6664. 950.66 s [vector] mut_ifoldl': OK
  6665. 950.66 s [vector] +++ OK, passed 100 tests.
  6666. 950.67 s [vector] mut_foldM: OK
  6667. 950.67 s [vector] +++ OK, passed 100 tests.
  6668. 950.68 s [vector] mut_foldM': OK
  6669. 950.68 s [vector] +++ OK, passed 100 tests.
  6670. 950.68 s [vector] mut_foldrM: OK
  6671. 950.68 s [vector] +++ OK, passed 100 tests.
  6672. 950.68 s [vector] mut_foldrM': OK
  6673. 950.68 s [vector] +++ OK, passed 100 tests.
  6674. 950.68 s [vector] mut_ifoldM: OK
  6675. 950.68 s [vector] +++ OK, passed 100 tests.
  6676. 950.68 s [vector] mut_ifoldM': OK
  6677. 950.68 s [vector] +++ OK, passed 100 tests.
  6678. 950.68 s [vector] mut_ifoldrM: OK
  6679. 950.68 s [vector] +++ OK, passed 100 tests.
  6680. 950.68 s [vector] mut_ifoldrM': OK
  6681. 950.68 s [vector] +++ OK, passed 100 tests.
  6682. 950.68 s [vector] compare: OK
  6683. 950.68 s [vector] +++ OK, passed 100 tests.
  6684. 950.68 s [vector] maximum: OK
  6685. 950.68 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6686. 950.68 s [vector] minimum: OK
  6687. 950.68 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6688. 950.69 s [vector] minIndex: OK
  6689. 950.69 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6690. 950.69 s [vector] maxIndex: OK
  6691. 950.69 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6692. 950.69 s [vector] maximumBy: OK
  6693. 950.69 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6694. 950.69 s [vector] minimumBy: OK
  6695. 950.69 s [vector] +++ OK, passed 100 tests; 22 discarded.
  6696. 950.69 s [vector] maximumOn: OK
  6697. 950.69 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6698. 950.69 s [vector] minimumOn: OK
  6699. 950.69 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6700. 950.69 s [vector] maxIndexBy: OK
  6701. 950.69 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6702. 950.69 s [vector] minIndexBy: OK
  6703. 950.69 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6704. 950.69 s [vector] ListFirstMaxIndexWins: OK
  6705. 950.69 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6706. 950.69 s [vector] FalseListFirstMaxIndexWins: OK
  6707. 950.69 s [vector] +++ OK, failed as expected. (after 1 test):
  6708. 950.69 s [vector] Exception:
  6709. 950.69 s [vector] Prelude.foldr1: empty list
  6710. 950.69 s [vector] CallStack (from HasCallStack):
  6711. 950.69 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  6712. 950.69 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  6713. 950.69 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  6714. 950.69 s [vector] []
  6715. 950.69 s [vector] mempty: OK
  6716. 950.69 s [vector] +++ OK, passed 100 tests.
  6717. 950.69 s [vector] mappend: OK
  6718. 950.70 s [vector] +++ OK, passed 100 tests.
  6719. 950.72 s [vector] mconcat: OK (0.02s)
  6720. 950.72 s [vector] +++ OK, passed 100 tests.
  6721. 950.72 s [vector] glength: OK
  6722. 950.72 s [vector] +++ OK, passed 100 tests.
  6723. 950.72 s [vector] sum: OK
  6724. 950.72 s [vector] +++ OK, passed 100 tests.
  6725. 950.72 s [vector] product: OK
  6726. 950.72 s [vector] +++ OK, passed 100 tests.
  6727. 950.72 s [vector] enumFromN: OK
  6728. 950.72 s [vector] +++ OK, passed 100 tests.
  6729. 950.72 s [vector] enumFromThenN: OK
  6730. 950.72 s [vector] +++ OK, passed 100 tests.
  6731. 950.72 s [vector] enumFromTo: OK
  6732. 950.72 s [vector] +++ OK, passed 100 tests.
  6733. 950.72 s [vector] enumFromThenTo: OK
  6734. 950.72 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6735. 950.72 s [vector] Data.Vector.Storable.Vector (Double)
  6736. 950.72 s [vector] fromList.toList == id: OK
  6737. 950.72 s [vector] +++ OK, passed 100 tests.
  6738. 950.72 s [vector] toList.fromList == id: OK
  6739. 950.72 s [vector] +++ OK, passed 100 tests.
  6740. 950.72 s [vector] unstream.stream == id: OK
  6741. 950.72 s [vector] +++ OK, passed 100 tests.
  6742. 950.72 s [vector] stream.unstream == id: OK
  6743. 950.72 s [vector] +++ OK, passed 100 tests.
  6744. 950.73 s [vector] eq: OK
  6745. 950.73 s [vector] +++ OK, passed 100 tests.
  6746. 950.73 s [vector] length: OK
  6747. 950.73 s [vector] +++ OK, passed 100 tests.
  6748. 950.73 s [vector] null: OK
  6749. 950.73 s [vector] +++ OK, passed 100 tests.
  6750. 950.73 s [vector] index: OK
  6751. 950.73 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6752. 950.73 s [vector] safeIndex: OK
  6753. 950.73 s [vector] +++ OK, passed 100 tests.
  6754. 950.73 s [vector] head: OK
  6755. 950.73 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6756. 950.73 s [vector] last: OK
  6757. 950.73 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6758. 950.73 s [vector] unsafeIndex: OK
  6759. 950.73 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6760. 950.73 s [vector] unsafeHead: OK
  6761. 950.73 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6762. 950.73 s [vector] unsafeLast: OK
  6763. 950.73 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6764. 950.73 s [vector] slice: OK
  6765. 950.73 s [vector] +++ OK, passed 100 tests.
  6766. 950.73 s [vector] init: OK
  6767. 950.73 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6768. 950.74 s [vector] tail: OK
  6769. 950.74 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6770. 950.74 s [vector] take: OK
  6771. 950.74 s [vector] +++ OK, passed 100 tests.
  6772. 950.74 s [vector] drop: OK
  6773. 950.74 s [vector] +++ OK, passed 100 tests.
  6774. 950.74 s [vector] splitAt: OK
  6775. 950.74 s [vector] +++ OK, passed 100 tests.
  6776. 950.74 s [vector] empty: OK
  6777. 950.74 s [vector] +++ OK, passed 100 tests.
  6778. 950.74 s [vector] singleton: OK
  6779. 950.74 s [vector] +++ OK, passed 100 tests.
  6780. 950.74 s [vector] replicate: OK
  6781. 950.74 s [vector] +++ OK, passed 100 tests.
  6782. 950.76 s [vector] generate: OK
  6783. 950.76 s [vector] +++ OK, passed 100 tests.
  6784. 950.76 s [vector] iterateN: OK
  6785. 950.76 s [vector] +++ OK, passed 100 tests.
  6786. 950.80 s [vector] iterateNM: OK (0.05s)
  6787. 950.80 s [vector] +++ OK, passed 100 tests.
  6788. 950.82 s [vector] generateM: OK (0.03s)
  6789. 950.82 s [vector] +++ OK, passed 100 tests.
  6790. 950.83 s [vector] replicateM: OK (0.01s)
  6791. 950.83 s [vector] +++ OK, passed 100 tests.
  6792. 950.83 s [vector] create: OK
  6793. 950.84 s [vector] +++ OK, passed 100 tests.
  6794. 950.84 s [vector] createT: OK
  6795. 950.84 s [vector] +++ OK, passed 100 tests.
  6796. 950.84 s [vector] unfoldr: OK
  6797. 950.84 s [vector] +++ OK, passed 100 tests.
  6798. 950.84 s [vector] unfoldrN: OK
  6799. 950.84 s [vector] +++ OK, passed 100 tests.
  6800. 950.84 s [vector] unfoldrExactN: OK
  6801. 950.84 s [vector] +++ OK, passed 100 tests.
  6802. 950.84 s [vector] unfoldrM: OK
  6803. 950.84 s [vector] +++ OK, passed 100 tests.
  6804. 950.86 s [vector] unfoldrNM: OK (0.02s)
  6805. 950.86 s [vector] +++ OK, passed 100 tests.
  6806. 950.90 s [vector] unfoldrExactNM: OK (0.04s)
  6807. 950.90 s [vector] +++ OK, passed 100 tests.
  6808. 950.91 s [vector] constructN: OK (0.01s)
  6809. 950.91 s [vector] +++ OK, passed 100 tests.
  6810. 950.93 s [vector] constructrN: OK
  6811. 950.93 s [vector] +++ OK, passed 100 tests.
  6812. 950.93 s [vector] cons: OK
  6813. 950.93 s [vector] +++ OK, passed 100 tests.
  6814. 950.93 s [vector] snoc: OK
  6815. 950.93 s [vector] +++ OK, passed 100 tests.
  6816. 950.94 s [vector] append: OK
  6817. 950.94 s [vector] +++ OK, passed 100 tests.
  6818. 950.95 s [vector] concat: OK (0.02s)
  6819. 950.95 s [vector] +++ OK, passed 100 tests.
  6820. 950.96 s [vector] force: OK
  6821. 950.96 s [vector] +++ OK, passed 100 tests.
  6822. 950.96 s [vector] upd: OK
  6823. 950.96 s [vector] +++ OK, passed 100 tests.
  6824. 950.97 s [vector] accum: OK (0.01s)
  6825. 950.97 s [vector] +++ OK, passed 100 tests.
  6826. 950.97 s [vector] reverse: OK
  6827. 950.97 s [vector] +++ OK, passed 100 tests.
  6828. 950.98 s [vector] backpermute: OK
  6829. 950.98 s [vector] +++ OK, passed 100 tests.
  6830. 950.98 s [vector] map: OK
  6831. 950.98 s [vector] +++ OK, passed 100 tests.
  6832. 950.99 s [vector] imap: OK
  6833. 950.99 s [vector] +++ OK, passed 100 tests.
  6834. 951.00 s [vector] concatMap: OK
  6835. 951.00 s [vector] +++ OK, passed 100 tests.
  6836. 951.01 s [vector] mapM: OK
  6837. 951.01 s [vector] +++ OK, passed 100 tests.
  6838. 951.05 s [vector] mapM_: OK (0.04s)
  6839. 951.06 s [vector] +++ OK, passed 100 tests.
  6840. 951.06 s [vector] forM: OK
  6841. 951.06 s [vector] +++ OK, passed 100 tests.
  6842. 951.09 s [vector] forM_: OK (0.03s)
  6843. 951.10 s [vector] +++ OK, passed 100 tests.
  6844. 951.10 s [vector] imapM: OK
  6845. 951.11 s [vector] +++ OK, passed 100 tests.
  6846. 951.14 s [vector] imapM_: OK (0.04s)
  6847. 951.14 s [vector] +++ OK, passed 100 tests.
  6848. 951.15 s [vector] zipWith: OK (0.01s)
  6849. 951.16 s [vector] +++ OK, passed 100 tests.
  6850. 951.17 s [vector] zipWith3: OK (0.01s)
  6851. 951.17 s [vector] +++ OK, passed 100 tests.
  6852. 951.18 s [vector] izipWith: OK (0.01s)
  6853. 951.18 s [vector] +++ OK, passed 100 tests.
  6854. 951.19 s [vector] izipWith3: OK (0.01s)
  6855. 951.19 s [vector] +++ OK, passed 100 tests.
  6856. 951.20 s [vector] izipWithM: OK (0.01s)
  6857. 951.20 s [vector] +++ OK, passed 100 tests.
  6858. 951.23 s [vector] izipWithM_: OK (0.03s)
  6859. 951.24 s [vector] +++ OK, passed 100 tests.
  6860. 951.24 s [vector] zipWithM: OK
  6861. 951.24 s [vector] +++ OK, passed 100 tests.
  6862. 951.27 s [vector] zipWithM_: OK (0.03s)
  6863. 951.27 s [vector] +++ OK, passed 100 tests.
  6864. 951.27 s [vector] filter: OK
  6865. 951.27 s [vector] +++ OK, passed 100 tests.
  6866. 951.28 s [vector] ifilter: OK
  6867. 951.28 s [vector] +++ OK, passed 100 tests.
  6868. 951.33 s [vector] filterM: OK (0.05s)
  6869. 951.33 s [vector] +++ OK, passed 100 tests.
  6870. 951.33 s [vector] uniq: OK
  6871. 951.33 s [vector] +++ OK, passed 100 tests.
  6872. 951.34 s [vector] mapMaybe: OK
  6873. 951.34 s [vector] +++ OK, passed 100 tests.
  6874. 951.35 s [vector] imapMaybe: OK
  6875. 951.35 s [vector] +++ OK, passed 100 tests.
  6876. 951.35 s [vector] takeWhile: OK
  6877. 951.35 s [vector] +++ OK, passed 100 tests.
  6878. 951.35 s [vector] dropWhile: OK
  6879. 951.35 s [vector] +++ OK, passed 100 tests.
  6880. 951.36 s [vector] partition: OK
  6881. 951.36 s [vector] +++ OK, passed 100 tests.
  6882. 951.36 s [vector] partitionWith: OK
  6883. 951.36 s [vector] +++ OK, passed 100 tests.
  6884. 951.36 s [vector] span: OK
  6885. 951.37 s [vector] +++ OK, passed 100 tests.
  6886. 951.37 s [vector] break: OK
  6887. 951.37 s [vector] +++ OK, passed 100 tests.
  6888. 951.37 s [vector] spanR: OK
  6889. 951.37 s [vector] +++ OK, passed 100 tests.
  6890. 951.38 s [vector] breakR: OK
  6891. 951.38 s [vector] +++ OK, passed 100 tests.
  6892. 951.38 s [vector] groupBy: OK
  6893. 951.38 s [vector] +++ OK, passed 100 tests.
  6894. 951.38 s [vector] elem: OK
  6895. 951.38 s [vector] +++ OK, passed 100 tests.
  6896. 951.38 s [vector] notElem: OK
  6897. 951.38 s [vector] +++ OK, passed 100 tests.
  6898. 951.38 s [vector] find: OK
  6899. 951.38 s [vector] +++ OK, passed 100 tests.
  6900. 951.38 s [vector] findIndex: OK
  6901. 951.38 s [vector] +++ OK, passed 100 tests.
  6902. 951.38 s [vector] findIndexR: OK
  6903. 951.39 s [vector] +++ OK, passed 100 tests.
  6904. 951.39 s [vector] findIndices: OK
  6905. 951.39 s [vector] +++ OK, passed 100 tests.
  6906. 951.39 s [vector] elemIndex: OK
  6907. 951.39 s [vector] +++ OK, passed 100 tests.
  6908. 951.39 s [vector] elemIndices: OK
  6909. 951.40 s [vector] +++ OK, passed 100 tests.
  6910. 951.42 s [vector] foldl: OK (0.01s)
  6911. 951.42 s [vector] +++ OK, passed 100 tests.
  6912. 951.42 s [vector] foldl1: OK (0.01s)
  6913. 951.42 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6914. 951.44 s [vector] foldl': OK (0.01s)
  6915. 951.44 s [vector] +++ OK, passed 100 tests.
  6916. 951.45 s [vector] foldl1': OK (0.01s)
  6917. 951.45 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6918. 951.46 s [vector] foldr: OK (0.01s)
  6919. 951.46 s [vector] +++ OK, passed 100 tests.
  6920. 951.48 s [vector] foldr1: OK (0.01s)
  6921. 951.48 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6922. 951.50 s [vector] foldr': OK (0.02s)
  6923. 951.50 s [vector] +++ OK, passed 100 tests.
  6924. 951.52 s [vector] foldr1': OK (0.02s)
  6925. 951.52 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6926. 951.54 s [vector] ifoldl: OK (0.02s)
  6927. 951.54 s [vector] +++ OK, passed 100 tests.
  6928. 951.56 s [vector] ifoldl': OK (0.01s)
  6929. 951.56 s [vector] +++ OK, passed 100 tests.
  6930. 951.57 s [vector] ifoldr: OK (0.01s)
  6931. 951.57 s [vector] +++ OK, passed 100 tests.
  6932. 951.58 s [vector] ifoldr': OK (0.01s)
  6933. 951.58 s [vector] +++ OK, passed 100 tests.
  6934. 951.60 s [vector] ifoldM: OK (0.01s)
  6935. 951.60 s [vector] +++ OK, passed 100 tests.
  6936. 951.60 s [vector] ifoldM': OK (0.01s)
  6937. 951.60 s [vector] +++ OK, passed 100 tests.
  6938. 951.64 s [vector] ifoldM_: OK (0.04s)
  6939. 951.64 s [vector] +++ OK, passed 100 tests.
  6940. 951.68 s [vector] ifoldM'_: OK (0.03s)
  6941. 951.68 s [vector] +++ OK, passed 100 tests.
  6942. 951.68 s [vector] all: OK
  6943. 951.68 s [vector] +++ OK, passed 100 tests.
  6944. 951.68 s [vector] any: OK
  6945. 951.68 s [vector] +++ OK, passed 100 tests.
  6946. 951.70 s [vector] prescanl: OK (0.01s)
  6947. 951.70 s [vector] +++ OK, passed 100 tests.
  6948. 951.72 s [vector] prescanl': OK (0.01s)
  6949. 951.72 s [vector] +++ OK, passed 100 tests.
  6950. 951.73 s [vector] postscanl: OK (0.01s)
  6951. 951.74 s [vector] +++ OK, passed 100 tests.
  6952. 951.75 s [vector] postscanl': OK (0.01s)
  6953. 951.75 s [vector] +++ OK, passed 100 tests.
  6954. 951.75 s [vector] scanl: OK (0.01s)
  6955. 951.75 s [vector] +++ OK, passed 100 tests.
  6956. 951.76 s [vector] scanl': OK (0.01s)
  6957. 951.77 s [vector] +++ OK, passed 100 tests.
  6958. 951.78 s [vector] scanl1: OK (0.02s)
  6959. 951.78 s [vector] +++ OK, passed 100 tests.
  6960. 951.79 s [vector] scanl1': OK
  6961. 951.79 s [vector] +++ OK, passed 100 tests.
  6962. 951.80 s [vector] iscanl: OK (0.01s)
  6963. 951.80 s [vector] +++ OK, passed 100 tests.
  6964. 951.82 s [vector] iscanl': OK (0.01s)
  6965. 951.82 s [vector] +++ OK, passed 100 tests.
  6966. 951.84 s [vector] prescanr: OK (0.01s)
  6967. 951.84 s [vector] +++ OK, passed 100 tests.
  6968. 951.85 s [vector] prescanr': OK (0.01s)
  6969. 951.85 s [vector] +++ OK, passed 100 tests.
  6970. 951.86 s [vector] postscanr: OK (0.01s)
  6971. 951.86 s [vector] +++ OK, passed 100 tests.
  6972. 951.88 s [vector] postscanr': OK (0.01s)
  6973. 951.88 s [vector] +++ OK, passed 100 tests.
  6974. 951.89 s [vector] scanr: OK (0.01s)
  6975. 951.89 s [vector] +++ OK, passed 100 tests.
  6976. 951.90 s [vector] scanr': OK (0.01s)
  6977. 951.90 s [vector] +++ OK, passed 100 tests.
  6978. 951.91 s [vector] scanr1: OK (0.01s)
  6979. 951.91 s [vector] +++ OK, passed 100 tests.
  6980. 951.92 s [vector] scanr1': OK (0.01s)
  6981. 951.92 s [vector] +++ OK, passed 100 tests.
  6982. 951.92 s [vector] iscanr: OK (0.01s)
  6983. 951.92 s [vector] +++ OK, passed 100 tests.
  6984. 951.94 s [vector] iscanr': OK (0.01s)
  6985. 951.94 s [vector] +++ OK, passed 100 tests.
  6986. 951.94 s [vector] mut_read: OK
  6987. 951.94 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6988. 951.94 s [vector] mut_write: OK
  6989. 951.96 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6990. 951.96 s [vector] mut_modify: OK
  6991. 951.96 s [vector] +++ OK, passed 100 tests; 20 discarded.
  6992. 951.96 s [vector] mut_generate: OK
  6993. 951.96 s [vector] +++ OK, passed 100 tests.
  6994. 951.96 s [vector] mut_generateM: OK (0.02s)
  6995. 951.96 s [vector] +++ OK, passed 100 tests.
  6996. 952.00 s [vector] mut_mapM_: OK (0.04s)
  6997. 952.00 s [vector] +++ OK, passed 100 tests.
  6998. 952.04 s [vector] mut_imapM_: OK (0.03s)
  6999. 952.04 s [vector] +++ OK, passed 100 tests.
  7000. 952.08 s [vector] mut_forM_: OK (0.04s)
  7001. 952.08 s [vector] +++ OK, passed 100 tests.
  7002. 952.10 s [vector] mut_iforM_: OK (0.03s)
  7003. 952.10 s [vector] +++ OK, passed 100 tests.
  7004. 952.12 s [vector] mut_foldr: OK (0.01s)
  7005. 952.12 s [vector] +++ OK, passed 100 tests.
  7006. 952.14 s [vector] mut_foldr': OK (0.01s)
  7007. 952.14 s [vector] +++ OK, passed 100 tests.
  7008. 952.14 s [vector] mut_foldl: OK (0.01s)
  7009. 952.14 s [vector] +++ OK, passed 100 tests.
  7010. 952.16 s [vector] mut_foldl': OK (0.01s)
  7011. 952.16 s [vector] +++ OK, passed 100 tests.
  7012. 952.18 s [vector] mut_ifoldr: OK (0.01s)
  7013. 952.18 s [vector] +++ OK, passed 100 tests.
  7014. 952.18 s [vector] mut_ifoldr': OK (0.01s)
  7015. 952.18 s [vector] +++ OK, passed 100 tests.
  7016. 952.19 s [vector] mut_ifoldl: OK (0.01s)
  7017. 952.19 s [vector] +++ OK, passed 100 tests.
  7018. 952.22 s [vector] mut_ifoldl': OK
  7019. 952.22 s [vector] +++ OK, passed 100 tests.
  7020. 952.22 s [vector] mut_foldM: OK (0.01s)
  7021. 952.22 s [vector] +++ OK, passed 100 tests.
  7022. 952.23 s [vector] mut_foldM': OK (0.01s)
  7023. 952.23 s [vector] +++ OK, passed 100 tests.
  7024. 952.24 s [vector] mut_foldrM: OK
  7025. 952.24 s [vector] +++ OK, passed 100 tests.
  7026. 952.26 s [vector] mut_foldrM': OK (0.01s)
  7027. 952.26 s [vector] +++ OK, passed 100 tests.
  7028. 952.28 s [vector] mut_ifoldM: OK (0.01s)
  7029. 952.28 s [vector] +++ OK, passed 100 tests.
  7030. 952.29 s [vector] mut_ifoldM': OK (0.01s)
  7031. 952.29 s [vector] +++ OK, passed 100 tests.
  7032. 952.30 s [vector] mut_ifoldrM: OK (0.01s)
  7033. 952.30 s [vector] +++ OK, passed 100 tests.
  7034. 952.31 s [vector] mut_ifoldrM': OK (0.01s)
  7035. 952.31 s [vector] +++ OK, passed 100 tests.
  7036. 952.31 s [vector] compare: OK
  7037. 952.31 s [vector] +++ OK, passed 100 tests.
  7038. 952.31 s [vector] maximum: OK
  7039. 952.31 s [vector] +++ OK, passed 100 tests; 20 discarded.
  7040. 952.31 s [vector] minimum: OK
  7041. 952.31 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7042. 952.31 s [vector] minIndex: OK
  7043. 952.31 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7044. 952.31 s [vector] maxIndex: OK
  7045. 952.31 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7046. 952.31 s [vector] maximumBy: OK
  7047. 952.31 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7048. 952.31 s [vector] minimumBy: OK
  7049. 952.32 s [vector] +++ OK, passed 100 tests; 23 discarded.
  7050. 952.32 s [vector] maximumOn: OK
  7051. 952.32 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7052. 952.32 s [vector] minimumOn: OK
  7053. 952.32 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7054. 952.32 s [vector] maxIndexBy: OK
  7055. 952.32 s [vector] +++ OK, passed 100 tests; 20 discarded.
  7056. 952.32 s [vector] minIndexBy: OK
  7057. 952.32 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7058. 952.32 s [vector] ListFirstMaxIndexWins: OK
  7059. 952.32 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7060. 952.32 s [vector] FalseListFirstMaxIndexWins: OK
  7061. 952.32 s [vector] +++ OK, failed as expected. (after 1 test):
  7062. 952.32 s [vector] Exception:
  7063. 952.32 s [vector] Prelude.foldr1: empty list
  7064. 952.32 s [vector] CallStack (from HasCallStack):
  7065. 952.32 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  7066. 952.32 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  7067. 952.32 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  7068. 952.32 s [vector] []
  7069. 952.32 s [vector] mempty: OK
  7070. 952.32 s [vector] +++ OK, passed 100 tests.
  7071. 952.32 s [vector] mappend: OK
  7072. 952.32 s [vector] +++ OK, passed 100 tests.
  7073. 952.35 s [vector] mconcat: OK (0.02s)
  7074. 952.35 s [vector] +++ OK, passed 100 tests.
  7075. 952.35 s [vector] glength: OK
  7076. 952.35 s [vector] +++ OK, passed 100 tests.
  7077. 952.35 s [vector] sum: OK
  7078. 952.35 s [vector] +++ OK, passed 100 tests.
  7079. 952.35 s [vector] product: OK
  7080. 952.35 s [vector] +++ OK, passed 100 tests.
  7081. 952.35 s [vector] enumFromN: OK
  7082. 952.35 s [vector] +++ OK, passed 100 tests.
  7083. 952.35 s [vector] enumFromThenN: OK
  7084. 952.35 s [vector] +++ OK, passed 100 tests.
  7085. 952.35 s [vector] enumFromTo: OK
  7086. 952.35 s [vector] +++ OK, passed 100 tests.
  7087. 952.35 s [vector] enumFromThenTo: OK
  7088. 952.35 s [vector] +++ OK, passed 100 tests.
  7089. 952.35 s [vector] unstream
  7090. 952.36 s [vector] unstream == vunstream (exact): OK
  7091. 952.36 s [vector] +++ OK, passed 100 tests.
  7092. 952.36 s [vector] unstream == vunstream (unknown): OK
  7093. 952.36 s [vector] +++ OK, passed 100 tests.
  7094. 952.36 s [vector] unstreamR ~= vunstream (exact): OK
  7095. 952.36 s [vector] +++ OK, passed 100 tests.
  7096. 952.36 s [vector] unstreamR ~= vunstream (unknown): OK
  7097. 952.36 s [vector] +++ OK, passed 100 tests.
  7098. 952.36 s [vector] Tests.Vector.Strict
  7099. 952.36 s [vector] Bool
  7100. 952.36 s [vector] fromList.toList == id: OK
  7101. 952.36 s [vector] +++ OK, passed 100 tests.
  7102. 952.36 s [vector] toList.fromList == id: OK
  7103. 952.36 s [vector] +++ OK, passed 100 tests.
  7104. 952.36 s [vector] unstream.stream == id: OK
  7105. 952.36 s [vector] +++ OK, passed 100 tests.
  7106. 952.36 s [vector] stream.unstream == id: OK
  7107. 952.36 s [vector] +++ OK, passed 100 tests.
  7108. 952.36 s [vector] eq: OK
  7109. 952.36 s [vector] +++ OK, passed 100 tests.
  7110. 952.36 s [vector] length: OK
  7111. 952.36 s [vector] +++ OK, passed 100 tests.
  7112. 952.36 s [vector] null: OK
  7113. 952.36 s [vector] +++ OK, passed 100 tests.
  7114. 952.36 s [vector] index: OK
  7115. 952.36 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7116. 952.36 s [vector] safeIndex: OK
  7117. 952.36 s [vector] +++ OK, passed 100 tests.
  7118. 952.36 s [vector] head: OK
  7119. 952.36 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7120. 952.36 s [vector] last: OK
  7121. 952.36 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7122. 952.36 s [vector] unsafeIndex: OK
  7123. 952.36 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7124. 952.36 s [vector] unsafeHead: OK
  7125. 952.37 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7126. 952.37 s [vector] unsafeLast: OK
  7127. 952.37 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7128. 952.37 s [vector] slice: OK
  7129. 952.37 s [vector] +++ OK, passed 100 tests.
  7130. 952.37 s [vector] init: OK
  7131. 952.37 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7132. 952.37 s [vector] tail: OK
  7133. 952.37 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7134. 952.37 s [vector] take: OK
  7135. 952.37 s [vector] +++ OK, passed 100 tests.
  7136. 952.37 s [vector] drop: OK
  7137. 952.37 s [vector] +++ OK, passed 100 tests.
  7138. 952.37 s [vector] splitAt: OK
  7139. 952.37 s [vector] +++ OK, passed 100 tests.
  7140. 952.37 s [vector] empty: OK
  7141. 952.37 s [vector] +++ OK, passed 100 tests.
  7142. 952.37 s [vector] singleton: OK
  7143. 952.37 s [vector] +++ OK, passed 100 tests.
  7144. 952.37 s [vector] replicate: OK
  7145. 952.37 s [vector] +++ OK, passed 100 tests.
  7146. 952.38 s [vector] generate: OK
  7147. 952.38 s [vector] +++ OK, passed 100 tests.
  7148. 952.38 s [vector] iterateN: OK
  7149. 952.38 s [vector] +++ OK, passed 100 tests.
  7150. 952.42 s [vector] iterateNM: OK (0.05s)
  7151. 952.42 s [vector] +++ OK, passed 100 tests.
  7152. 952.43 s [vector] generateM: OK (0.02s)
  7153. 952.43 s [vector] +++ OK, passed 100 tests.
  7154. 952.45 s [vector] replicateM: OK
  7155. 952.45 s [vector] +++ OK, passed 100 tests.
  7156. 952.45 s [vector] create: OK
  7157. 952.45 s [vector] +++ OK, passed 100 tests.
  7158. 952.45 s [vector] createT: OK
  7159. 952.45 s [vector] +++ OK, passed 100 tests.
  7160. 952.45 s [vector] unfoldr: OK
  7161. 952.45 s [vector] +++ OK, passed 100 tests.
  7162. 952.45 s [vector] unfoldrN: OK
  7163. 952.45 s [vector] +++ OK, passed 100 tests.
  7164. 952.45 s [vector] unfoldrExactN: OK
  7165. 952.45 s [vector] +++ OK, passed 100 tests.
  7166. 952.45 s [vector] unfoldrM: OK
  7167. 952.45 s [vector] +++ OK, passed 100 tests.
  7168. 952.46 s [vector] unfoldrNM: OK
  7169. 952.46 s [vector] +++ OK, passed 100 tests.
  7170. 952.51 s [vector] unfoldrExactNM: OK (0.05s)
  7171. 952.51 s [vector] +++ OK, passed 100 tests.
  7172. 952.51 s [vector] constructN: OK
  7173. 952.51 s [vector] +++ OK, passed 100 tests.
  7174. 952.51 s [vector] constructrN: OK
  7175. 952.51 s [vector] +++ OK, passed 100 tests.
  7176. 952.51 s [vector] cons: OK
  7177. 952.51 s [vector] +++ OK, passed 100 tests.
  7178. 952.51 s [vector] snoc: OK
  7179. 952.51 s [vector] +++ OK, passed 100 tests.
  7180. 952.52 s [vector] append: OK
  7181. 952.52 s [vector] +++ OK, passed 100 tests.
  7182. 952.52 s [vector] concat: OK
  7183. 952.52 s [vector] +++ OK, passed 100 tests.
  7184. 952.52 s [vector] force: OK
  7185. 952.52 s [vector] +++ OK, passed 100 tests.
  7186. 952.52 s [vector] upd: OK
  7187. 952.52 s [vector] +++ OK, passed 100 tests.
  7188. 952.53 s [vector] accum: OK
  7189. 952.53 s [vector] +++ OK, passed 100 tests.
  7190. 952.53 s [vector] reverse: OK
  7191. 952.53 s [vector] +++ OK, passed 100 tests.
  7192. 952.53 s [vector] backpermute: OK
  7193. 952.53 s [vector] +++ OK, passed 100 tests.
  7194. 952.53 s [vector] map: OK
  7195. 952.53 s [vector] +++ OK, passed 100 tests.
  7196. 952.54 s [vector] imap: OK
  7197. 952.54 s [vector] +++ OK, passed 100 tests.
  7198. 952.54 s [vector] concatMap: OK
  7199. 952.54 s [vector] +++ OK, passed 100 tests.
  7200. 952.54 s [vector] mapM: OK
  7201. 952.54 s [vector] +++ OK, passed 100 tests.
  7202. 952.55 s [vector] mapM_: OK
  7203. 952.55 s [vector] +++ OK, passed 100 tests.
  7204. 952.56 s [vector] forM: OK
  7205. 952.56 s [vector] +++ OK, passed 100 tests.
  7206. 952.56 s [vector] forM_: OK (0.01s)
  7207. 952.56 s [vector] +++ OK, passed 100 tests.
  7208. 952.56 s [vector] imapM: OK
  7209. 952.57 s [vector] +++ OK, passed 100 tests.
  7210. 952.57 s [vector] imapM_: OK (0.01s)
  7211. 952.57 s [vector] +++ OK, passed 100 tests.
  7212. 952.58 s [vector] zipWith: OK
  7213. 952.58 s [vector] +++ OK, passed 100 tests.
  7214. 952.58 s [vector] zipWith3: OK
  7215. 952.58 s [vector] +++ OK, passed 100 tests.
  7216. 952.58 s [vector] izipWith: OK
  7217. 952.58 s [vector] +++ OK, passed 100 tests.
  7218. 952.58 s [vector] izipWith3: OK
  7219. 952.58 s [vector] +++ OK, passed 100 tests.
  7220. 952.58 s [vector] izipWithM: OK
  7221. 952.58 s [vector] +++ OK, passed 100 tests.
  7222. 952.59 s [vector] izipWithM_: OK
  7223. 952.59 s [vector] +++ OK, passed 100 tests.
  7224. 952.59 s [vector] zipWithM: OK
  7225. 952.59 s [vector] +++ OK, passed 100 tests.
  7226. 952.60 s [vector] zipWithM_: OK
  7227. 952.61 s [vector] +++ OK, passed 100 tests.
  7228. 952.62 s [vector] filter: OK
  7229. 952.62 s [vector] +++ OK, passed 100 tests.
  7230. 952.62 s [vector] ifilter: OK
  7231. 952.62 s [vector] +++ OK, passed 100 tests.
  7232. 952.63 s [vector] filterM: OK (0.02s)
  7233. 952.63 s [vector] +++ OK, passed 100 tests.
  7234. 952.63 s [vector] uniq: OK
  7235. 952.63 s [vector] +++ OK, passed 100 tests.
  7236. 952.63 s [vector] mapMaybe: OK
  7237. 952.63 s [vector] +++ OK, passed 100 tests.
  7238. 952.63 s [vector] imapMaybe: OK
  7239. 952.63 s [vector] +++ OK, passed 100 tests.
  7240. 952.63 s [vector] takeWhile: OK
  7241. 952.63 s [vector] +++ OK, passed 100 tests.
  7242. 952.63 s [vector] dropWhile: OK
  7243. 952.63 s [vector] +++ OK, passed 100 tests.
  7244. 952.64 s [vector] partition: OK
  7245. 952.64 s [vector] +++ OK, passed 100 tests.
  7246. 952.64 s [vector] partitionWith: OK
  7247. 952.64 s [vector] +++ OK, passed 100 tests.
  7248. 952.64 s [vector] span: OK
  7249. 952.64 s [vector] +++ OK, passed 100 tests.
  7250. 952.64 s [vector] break: OK
  7251. 952.64 s [vector] +++ OK, passed 100 tests.
  7252. 952.64 s [vector] spanR: OK
  7253. 952.64 s [vector] +++ OK, passed 100 tests.
  7254. 952.64 s [vector] breakR: OK
  7255. 952.64 s [vector] +++ OK, passed 100 tests.
  7256. 952.64 s [vector] groupBy: OK
  7257. 952.64 s [vector] +++ OK, passed 100 tests.
  7258. 952.64 s [vector] elem: OK
  7259. 952.64 s [vector] +++ OK, passed 100 tests.
  7260. 952.64 s [vector] notElem: OK
  7261. 952.64 s [vector] +++ OK, passed 100 tests.
  7262. 952.65 s [vector] find: OK
  7263. 952.65 s [vector] +++ OK, passed 100 tests.
  7264. 952.65 s [vector] findIndex: OK
  7265. 952.65 s [vector] +++ OK, passed 100 tests.
  7266. 952.65 s [vector] findIndexR: OK
  7267. 952.65 s [vector] +++ OK, passed 100 tests.
  7268. 952.65 s [vector] findIndices: OK
  7269. 952.65 s [vector] +++ OK, passed 100 tests.
  7270. 952.65 s [vector] elemIndex: OK
  7271. 952.65 s [vector] +++ OK, passed 100 tests.
  7272. 952.65 s [vector] elemIndices: OK
  7273. 952.65 s [vector] +++ OK, passed 100 tests.
  7274. 952.65 s [vector] foldl: OK
  7275. 952.65 s [vector] +++ OK, passed 100 tests.
  7276. 952.65 s [vector] foldl1: OK
  7277. 952.65 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7278. 952.65 s [vector] foldl': OK
  7279. 952.65 s [vector] +++ OK, passed 100 tests.
  7280. 952.65 s [vector] foldl1': OK
  7281. 952.65 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7282. 952.65 s [vector] foldr: OK
  7283. 952.65 s [vector] +++ OK, passed 100 tests.
  7284. 952.65 s [vector] foldr1: OK
  7285. 952.65 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7286. 952.65 s [vector] foldr': OK
  7287. 952.66 s [vector] +++ OK, passed 100 tests.
  7288. 952.66 s [vector] foldr1': OK
  7289. 952.66 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7290. 952.66 s [vector] ifoldl: OK
  7291. 952.66 s [vector] +++ OK, passed 100 tests.
  7292. 952.66 s [vector] ifoldl': OK
  7293. 952.66 s [vector] +++ OK, passed 100 tests.
  7294. 952.66 s [vector] ifoldr: OK
  7295. 952.66 s [vector] +++ OK, passed 100 tests.
  7296. 952.66 s [vector] ifoldr': OK
  7297. 952.66 s [vector] +++ OK, passed 100 tests.
  7298. 952.67 s [vector] ifoldM: OK
  7299. 952.67 s [vector] +++ OK, passed 100 tests.
  7300. 952.68 s [vector] ifoldM': OK
  7301. 952.68 s [vector] +++ OK, passed 100 tests.
  7302. 952.70 s [vector] ifoldM_: OK (0.01s)
  7303. 952.70 s [vector] +++ OK, passed 100 tests.
  7304. 952.70 s [vector] ifoldM'_: OK (0.01s)
  7305. 952.70 s [vector] +++ OK, passed 100 tests.
  7306. 952.70 s [vector] all: OK
  7307. 952.70 s [vector] +++ OK, passed 100 tests.
  7308. 952.70 s [vector] any: OK
  7309. 952.70 s [vector] +++ OK, passed 100 tests.
  7310. 952.70 s [vector] prescanl: OK
  7311. 952.70 s [vector] +++ OK, passed 100 tests.
  7312. 952.70 s [vector] prescanl': OK
  7313. 952.70 s [vector] +++ OK, passed 100 tests.
  7314. 952.70 s [vector] postscanl: OK
  7315. 952.70 s [vector] +++ OK, passed 100 tests.
  7316. 952.70 s [vector] postscanl': OK
  7317. 952.70 s [vector] +++ OK, passed 100 tests.
  7318. 952.71 s [vector] scanl: OK
  7319. 952.71 s [vector] +++ OK, passed 100 tests.
  7320. 952.71 s [vector] scanl': OK
  7321. 952.71 s [vector] +++ OK, passed 100 tests.
  7322. 952.71 s [vector] scanl1: OK
  7323. 952.71 s [vector] +++ OK, passed 100 tests.
  7324. 952.71 s [vector] scanl1': OK
  7325. 952.71 s [vector] +++ OK, passed 100 tests.
  7326. 952.72 s [vector] iscanl: OK
  7327. 952.72 s [vector] +++ OK, passed 100 tests.
  7328. 952.72 s [vector] iscanl': OK
  7329. 952.72 s [vector] +++ OK, passed 100 tests.
  7330. 952.72 s [vector] prescanr: OK
  7331. 952.72 s [vector] +++ OK, passed 100 tests.
  7332. 952.72 s [vector] prescanr': OK
  7333. 952.72 s [vector] +++ OK, passed 100 tests.
  7334. 952.72 s [vector] postscanr: OK
  7335. 952.72 s [vector] +++ OK, passed 100 tests.
  7336. 952.72 s [vector] postscanr': OK
  7337. 952.72 s [vector] +++ OK, passed 100 tests.
  7338. 952.73 s [vector] scanr: OK
  7339. 952.73 s [vector] +++ OK, passed 100 tests.
  7340. 952.73 s [vector] scanr': OK
  7341. 952.73 s [vector] +++ OK, passed 100 tests.
  7342. 952.73 s [vector] scanr1: OK
  7343. 952.73 s [vector] +++ OK, passed 100 tests.
  7344. 952.73 s [vector] scanr1': OK
  7345. 952.73 s [vector] +++ OK, passed 100 tests.
  7346. 952.73 s [vector] iscanr: OK
  7347. 952.73 s [vector] +++ OK, passed 100 tests.
  7348. 952.73 s [vector] iscanr': OK
  7349. 952.73 s [vector] +++ OK, passed 100 tests.
  7350. 952.73 s [vector] mut_read: OK
  7351. 952.73 s [vector] +++ OK, passed 100 tests; 11 discarded.
  7352. 952.74 s [vector] mut_write: OK
  7353. 952.74 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7354. 952.74 s [vector] mut_modify: OK
  7355. 952.74 s [vector] +++ OK, passed 100 tests; 22 discarded.
  7356. 952.74 s [vector] mut_generate: OK
  7357. 952.74 s [vector] +++ OK, passed 100 tests.
  7358. 952.76 s [vector] mut_generateM: OK (0.01s)
  7359. 952.76 s [vector] +++ OK, passed 100 tests.
  7360. 952.77 s [vector] mut_mapM_: OK (0.01s)
  7361. 952.78 s [vector] +++ OK, passed 100 tests.
  7362. 952.78 s [vector] mut_imapM_: OK (0.01s)
  7363. 952.78 s [vector] +++ OK, passed 100 tests.
  7364. 952.80 s [vector] mut_forM_: OK (0.01s)
  7365. 952.80 s [vector] +++ OK, passed 100 tests.
  7366. 952.80 s [vector] mut_iforM_: OK (0.01s)
  7367. 952.80 s [vector] +++ OK, passed 100 tests.
  7368. 952.80 s [vector] mut_foldr: OK
  7369. 952.80 s [vector] +++ OK, passed 100 tests.
  7370. 952.80 s [vector] mut_foldr': OK
  7371. 952.80 s [vector] +++ OK, passed 100 tests.
  7372. 952.80 s [vector] mut_foldl: OK
  7373. 952.80 s [vector] +++ OK, passed 100 tests.
  7374. 952.80 s [vector] mut_foldl': OK
  7375. 952.80 s [vector] +++ OK, passed 100 tests.
  7376. 952.81 s [vector] mut_ifoldr: OK
  7377. 952.81 s [vector] +++ OK, passed 100 tests.
  7378. 952.81 s [vector] mut_ifoldr': OK
  7379. 952.81 s [vector] +++ OK, passed 100 tests.
  7380. 952.82 s [vector] mut_ifoldl: OK
  7381. 952.82 s [vector] +++ OK, passed 100 tests.
  7382. 952.82 s [vector] mut_ifoldl': OK
  7383. 952.82 s [vector] +++ OK, passed 100 tests.
  7384. 952.82 s [vector] mut_foldM: OK
  7385. 952.82 s [vector] +++ OK, passed 100 tests.
  7386. 952.83 s [vector] mut_foldM': OK
  7387. 952.83 s [vector] +++ OK, passed 100 tests.
  7388. 952.83 s [vector] mut_foldrM: OK
  7389. 952.83 s [vector] +++ OK, passed 100 tests.
  7390. 952.83 s [vector] mut_foldrM': OK
  7391. 952.83 s [vector] +++ OK, passed 100 tests.
  7392. 952.83 s [vector] mut_ifoldM: OK
  7393. 952.83 s [vector] +++ OK, passed 100 tests.
  7394. 952.83 s [vector] mut_ifoldM': OK
  7395. 952.83 s [vector] +++ OK, passed 100 tests.
  7396. 952.83 s [vector] mut_ifoldrM: OK
  7397. 952.83 s [vector] +++ OK, passed 100 tests.
  7398. 952.83 s [vector] mut_ifoldrM': OK
  7399. 952.83 s [vector] +++ OK, passed 100 tests.
  7400. 952.83 s [vector] compare: OK
  7401. 952.83 s [vector] +++ OK, passed 100 tests.
  7402. 952.83 s [vector] maximum: OK
  7403. 952.83 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7404. 952.83 s [vector] minimum: OK
  7405. 952.83 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7406. 952.84 s [vector] minIndex: OK
  7407. 952.84 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7408. 952.84 s [vector] maxIndex: OK
  7409. 952.84 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7410. 952.84 s [vector] maximumBy: OK
  7411. 952.84 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7412. 952.84 s [vector] minimumBy: OK
  7413. 952.84 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7414. 952.84 s [vector] maximumOn: OK
  7415. 952.84 s [vector] +++ OK, passed 100 tests; 21 discarded.
  7416. 952.84 s [vector] minimumOn: OK
  7417. 952.84 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7418. 952.84 s [vector] maxIndexBy: OK
  7419. 952.84 s [vector] +++ OK, passed 100 tests; 20 discarded.
  7420. 952.84 s [vector] minIndexBy: OK
  7421. 952.84 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7422. 952.84 s [vector] ListFirstMaxIndexWins: OK
  7423. 952.84 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7424. 952.84 s [vector] FalseListFirstMaxIndexWins: OK
  7425. 952.84 s [vector] +++ OK, failed as expected. (after 1 test):
  7426. 952.84 s [vector] Exception:
  7427. 952.84 s [vector] Prelude.foldr1: empty list
  7428. 952.84 s [vector] CallStack (from HasCallStack):
  7429. 952.84 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  7430. 952.84 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  7431. 952.84 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  7432. 952.84 s [vector] []
  7433. 952.85 s [vector] zip: OK
  7434. 952.85 s [vector] +++ OK, passed 100 tests.
  7435. 952.85 s [vector] zip3: OK
  7436. 952.85 s [vector] +++ OK, passed 100 tests.
  7437. 952.85 s [vector] unzip: OK
  7438. 952.85 s [vector] +++ OK, passed 100 tests.
  7439. 952.86 s [vector] unzip3: OK
  7440. 952.86 s [vector] +++ OK, passed 100 tests.
  7441. 952.86 s [vector] indexed: OK
  7442. 952.86 s [vector] +++ OK, passed 100 tests.
  7443. 952.86 s [vector] update: OK
  7444. 952.86 s [vector] +++ OK, passed 100 tests.
  7445. 952.86 s [vector] concat: OK
  7446. 952.86 s [vector] +++ OK, passed 100 tests.
  7447. 952.86 s [vector] mempty: OK
  7448. 952.86 s [vector] +++ OK, passed 100 tests.
  7449. 952.86 s [vector] mappend: OK
  7450. 952.86 s [vector] +++ OK, passed 100 tests.
  7451. 952.87 s [vector] mconcat: OK
  7452. 952.87 s [vector] +++ OK, passed 100 tests.
  7453. 952.87 s [vector] fmap: OK
  7454. 952.87 s [vector] +++ OK, passed 100 tests.
  7455. 952.87 s [vector] return: OK
  7456. 952.87 s [vector] +++ OK, passed 100 tests.
  7457. 952.87 s [vector] bind: OK (0.01s)
  7458. 952.87 s [vector] +++ OK, passed 100 tests.
  7459. 952.87 s [vector] mzip: OK
  7460. 952.87 s [vector] +++ OK, passed 100 tests.
  7461. 952.87 s [vector] munzip: OK
  7462. 952.88 s [vector] +++ OK, passed 100 tests.
  7463. 952.88 s [vector] applicative_pure: OK
  7464. 952.89 s [vector] +++ OK, passed 100 tests.
  7465. 952.89 s [vector] applicative_appl: OK (0.02s)
  7466. 952.89 s [vector] +++ OK, passed 100 tests.
  7467. 952.89 s [vector] alternative_empty: OK
  7468. 952.89 s [vector] +++ OK, passed 100 tests.
  7469. 952.90 s [vector] alternative_or: OK
  7470. 952.90 s [vector] +++ OK, passed 100 tests.
  7471. 952.92 s [vector] sequence: OK (0.02s)
  7472. 952.92 s [vector] +++ OK, passed 100 tests.
  7473. 952.93 s [vector] sequence_: OK
  7474. 952.93 s [vector] +++ OK, passed 100 tests.
  7475. 952.93 s [vector] glength: OK
  7476. 952.93 s [vector] +++ OK, passed 100 tests.
  7477. 952.93 s [vector] and: OK
  7478. 952.93 s [vector] +++ OK, passed 100 tests.
  7479. 952.93 s [vector] or: OK
  7480. 952.93 s [vector] +++ OK, passed 100 tests.
  7481. 952.93 s [vector] Int
  7482. 952.93 s [vector] fromList.toList == id: OK
  7483. 952.93 s [vector] +++ OK, passed 100 tests.
  7484. 952.93 s [vector] toList.fromList == id: OK
  7485. 952.93 s [vector] +++ OK, passed 100 tests.
  7486. 952.93 s [vector] unstream.stream == id: OK
  7487. 952.93 s [vector] +++ OK, passed 100 tests.
  7488. 952.93 s [vector] stream.unstream == id: OK
  7489. 952.93 s [vector] +++ OK, passed 100 tests.
  7490. 952.93 s [vector] eq: OK
  7491. 952.93 s [vector] +++ OK, passed 100 tests.
  7492. 952.94 s [vector] length: OK
  7493. 952.94 s [vector] +++ OK, passed 100 tests.
  7494. 952.94 s [vector] null: OK
  7495. 952.94 s [vector] +++ OK, passed 100 tests.
  7496. 952.94 s [vector] index: OK
  7497. 952.94 s [vector] +++ OK, passed 100 tests; 11 discarded.
  7498. 952.94 s [vector] safeIndex: OK
  7499. 952.94 s [vector] +++ OK, passed 100 tests.
  7500. 952.94 s [vector] head: OK
  7501. 952.94 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7502. 952.94 s [vector] last: OK
  7503. 952.94 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7504. 952.94 s [vector] unsafeIndex: OK
  7505. 952.94 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7506. 952.94 s [vector] unsafeHead: OK
  7507. 952.94 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7508. 952.94 s [vector] unsafeLast: OK
  7509. 952.94 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7510. 952.94 s [vector] slice: OK
  7511. 952.94 s [vector] +++ OK, passed 100 tests.
  7512. 952.94 s [vector] init: OK
  7513. 952.94 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7514. 952.94 s [vector] tail: OK
  7515. 952.94 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7516. 952.94 s [vector] take: OK
  7517. 952.94 s [vector] +++ OK, passed 100 tests.
  7518. 952.94 s [vector] drop: OK
  7519. 952.94 s [vector] +++ OK, passed 100 tests.
  7520. 952.94 s [vector] splitAt: OK
  7521. 952.94 s [vector] +++ OK, passed 100 tests.
  7522. 952.94 s [vector] empty: OK
  7523. 952.94 s [vector] +++ OK, passed 100 tests.
  7524. 952.94 s [vector] singleton: OK
  7525. 952.94 s [vector] +++ OK, passed 100 tests.
  7526. 952.95 s [vector] replicate: OK
  7527. 952.95 s [vector] +++ OK, passed 100 tests.
  7528. 952.95 s [vector] generate: OK
  7529. 952.95 s [vector] +++ OK, passed 100 tests.
  7530. 952.97 s [vector] iterateN: OK
  7531. 952.97 s [vector] +++ OK, passed 100 tests.
  7532. 952.98 s [vector] iterateNM: OK (0.04s)
  7533. 952.98 s [vector] +++ OK, passed 100 tests.
  7534. 953.02 s [vector] generateM: OK
  7535. 953.02 s [vector] +++ OK, passed 100 tests.
  7536. 953.03 s [vector] replicateM: OK (0.02s)
  7537. 953.03 s [vector] +++ OK, passed 100 tests.
  7538. 953.03 s [vector] create: OK
  7539. 953.03 s [vector] +++ OK, passed 100 tests.
  7540. 953.03 s [vector] createT: OK
  7541. 953.03 s [vector] +++ OK, passed 100 tests.
  7542. 953.03 s [vector] unfoldr: OK
  7543. 953.03 s [vector] +++ OK, passed 100 tests.
  7544. 953.03 s [vector] unfoldrN: OK
  7545. 953.03 s [vector] +++ OK, passed 100 tests.
  7546. 953.03 s [vector] unfoldrExactN: OK
  7547. 953.03 s [vector] +++ OK, passed 100 tests.
  7548. 953.04 s [vector] unfoldrM: OK
  7549. 953.04 s [vector] +++ OK, passed 100 tests.
  7550. 953.04 s [vector] unfoldrNM: OK
  7551. 953.04 s [vector] +++ OK, passed 100 tests.
  7552. 953.08 s [vector] unfoldrExactNM: OK (0.05s)
  7553. 953.08 s [vector] +++ OK, passed 100 tests.
  7554. 953.09 s [vector] constructN: OK
  7555. 953.09 s [vector] +++ OK, passed 100 tests.
  7556. 953.09 s [vector] constructrN: OK
  7557. 953.09 s [vector] +++ OK, passed 100 tests.
  7558. 953.09 s [vector] cons: OK
  7559. 953.10 s [vector] +++ OK, passed 100 tests.
  7560. 953.10 s [vector] snoc: OK
  7561. 953.10 s [vector] +++ OK, passed 100 tests.
  7562. 953.10 s [vector] append: OK
  7563. 953.10 s [vector] +++ OK, passed 100 tests.
  7564. 953.10 s [vector] concat: OK
  7565. 953.10 s [vector] +++ OK, passed 100 tests.
  7566. 953.10 s [vector] force: OK
  7567. 953.10 s [vector] +++ OK, passed 100 tests.
  7568. 953.10 s [vector] upd: OK
  7569. 953.10 s [vector] +++ OK, passed 100 tests.
  7570. 953.11 s [vector] accum: OK
  7571. 953.11 s [vector] +++ OK, passed 100 tests.
  7572. 953.11 s [vector] reverse: OK
  7573. 953.11 s [vector] +++ OK, passed 100 tests.
  7574. 953.11 s [vector] backpermute: OK
  7575. 953.11 s [vector] +++ OK, passed 100 tests.
  7576. 953.12 s [vector] map: OK
  7577. 953.12 s [vector] +++ OK, passed 100 tests.
  7578. 953.12 s [vector] imap: OK
  7579. 953.12 s [vector] +++ OK, passed 100 tests.
  7580. 953.12 s [vector] concatMap: OK
  7581. 953.12 s [vector] +++ OK, passed 100 tests.
  7582. 953.12 s [vector] mapM: OK
  7583. 953.12 s [vector] +++ OK, passed 100 tests.
  7584. 953.14 s [vector] mapM_: OK (0.02s)
  7585. 953.14 s [vector] +++ OK, passed 100 tests.
  7586. 953.14 s [vector] forM: OK
  7587. 953.14 s [vector] +++ OK, passed 100 tests.
  7588. 953.16 s [vector] forM_: OK (0.02s)
  7589. 953.16 s [vector] +++ OK, passed 100 tests.
  7590. 953.16 s [vector] imapM: OK
  7591. 953.16 s [vector] +++ OK, passed 100 tests.
  7592. 953.18 s [vector] imapM_: OK (0.02s)
  7593. 953.18 s [vector] +++ OK, passed 100 tests.
  7594. 953.18 s [vector] zipWith: OK
  7595. 953.18 s [vector] +++ OK, passed 100 tests.
  7596. 953.18 s [vector] zipWith3: OK
  7597. 953.18 s [vector] +++ OK, passed 100 tests.
  7598. 953.18 s [vector] izipWith: OK
  7599. 953.18 s [vector] +++ OK, passed 100 tests.
  7600. 953.18 s [vector] izipWith3: OK
  7601. 953.18 s [vector] +++ OK, passed 100 tests.
  7602. 953.19 s [vector] izipWithM: OK
  7603. 953.19 s [vector] +++ OK, passed 100 tests.
  7604. 953.20 s [vector] izipWithM_: OK (0.01s)
  7605. 953.20 s [vector] +++ OK, passed 100 tests.
  7606. 953.20 s [vector] zipWithM: OK
  7607. 953.20 s [vector] +++ OK, passed 100 tests.
  7608. 953.22 s [vector] zipWithM_: OK (0.01s)
  7609. 953.22 s [vector] +++ OK, passed 100 tests.
  7610. 953.22 s [vector] filter: OK
  7611. 953.22 s [vector] +++ OK, passed 100 tests.
  7612. 953.22 s [vector] ifilter: OK
  7613. 953.22 s [vector] +++ OK, passed 100 tests.
  7614. 953.24 s [vector] filterM: OK (0.02s)
  7615. 953.24 s [vector] +++ OK, passed 100 tests.
  7616. 953.24 s [vector] uniq: OK
  7617. 953.24 s [vector] +++ OK, passed 100 tests.
  7618. 953.25 s [vector] mapMaybe: OK
  7619. 953.25 s [vector] +++ OK, passed 100 tests.
  7620. 953.25 s [vector] imapMaybe: OK
  7621. 953.25 s [vector] +++ OK, passed 100 tests.
  7622. 953.25 s [vector] takeWhile: OK
  7623. 953.25 s [vector] +++ OK, passed 100 tests.
  7624. 953.25 s [vector] dropWhile: OK
  7625. 953.25 s [vector] +++ OK, passed 100 tests.
  7626. 953.25 s [vector] partition: OK
  7627. 953.25 s [vector] +++ OK, passed 100 tests.
  7628. 953.25 s [vector] partitionWith: OK
  7629. 953.25 s [vector] +++ OK, passed 100 tests.
  7630. 953.25 s [vector] span: OK
  7631. 953.26 s [vector] +++ OK, passed 100 tests.
  7632. 953.26 s [vector] break: OK
  7633. 953.26 s [vector] +++ OK, passed 100 tests.
  7634. 953.26 s [vector] spanR: OK
  7635. 953.26 s [vector] +++ OK, passed 100 tests.
  7636. 953.26 s [vector] breakR: OK
  7637. 953.26 s [vector] +++ OK, passed 100 tests.
  7638. 953.26 s [vector] groupBy: OK
  7639. 953.26 s [vector] +++ OK, passed 100 tests.
  7640. 953.26 s [vector] elem: OK
  7641. 953.26 s [vector] +++ OK, passed 100 tests.
  7642. 953.26 s [vector] notElem: OK
  7643. 953.26 s [vector] +++ OK, passed 100 tests.
  7644. 953.26 s [vector] find: OK
  7645. 953.26 s [vector] +++ OK, passed 100 tests.
  7646. 953.26 s [vector] findIndex: OK
  7647. 953.26 s [vector] +++ OK, passed 100 tests.
  7648. 953.26 s [vector] findIndexR: OK
  7649. 953.26 s [vector] +++ OK, passed 100 tests.
  7650. 953.26 s [vector] findIndices: OK
  7651. 953.26 s [vector] +++ OK, passed 100 tests.
  7652. 953.26 s [vector] elemIndex: OK
  7653. 953.26 s [vector] +++ OK, passed 100 tests.
  7654. 953.27 s [vector] elemIndices: OK
  7655. 953.27 s [vector] +++ OK, passed 100 tests.
  7656. 953.27 s [vector] foldl: OK
  7657. 953.27 s [vector] +++ OK, passed 100 tests.
  7658. 953.27 s [vector] foldl1: OK
  7659. 953.27 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7660. 953.27 s [vector] foldl': OK
  7661. 953.28 s [vector] +++ OK, passed 100 tests.
  7662. 953.28 s [vector] foldl1': OK
  7663. 953.28 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7664. 953.28 s [vector] foldr: OK
  7665. 953.28 s [vector] +++ OK, passed 100 tests.
  7666. 953.28 s [vector] foldr1: OK
  7667. 953.28 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7668. 953.29 s [vector] foldr': OK
  7669. 953.29 s [vector] +++ OK, passed 100 tests.
  7670. 953.29 s [vector] foldr1': OK
  7671. 953.29 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7672. 953.29 s [vector] ifoldl: OK
  7673. 953.29 s [vector] +++ OK, passed 100 tests.
  7674. 953.30 s [vector] ifoldl': OK
  7675. 953.30 s [vector] +++ OK, passed 100 tests.
  7676. 953.30 s [vector] ifoldr: OK
  7677. 953.30 s [vector] +++ OK, passed 100 tests.
  7678. 953.30 s [vector] ifoldr': OK
  7679. 953.30 s [vector] +++ OK, passed 100 tests.
  7680. 953.30 s [vector] ifoldM: OK
  7681. 953.30 s [vector] +++ OK, passed 100 tests.
  7682. 953.31 s [vector] ifoldM': OK
  7683. 953.31 s [vector] +++ OK, passed 100 tests.
  7684. 953.34 s [vector] ifoldM_: OK (0.02s)
  7685. 953.34 s [vector] +++ OK, passed 100 tests.
  7686. 953.35 s [vector] ifoldM'_: OK (0.02s)
  7687. 953.35 s [vector] +++ OK, passed 100 tests.
  7688. 953.35 s [vector] all: OK
  7689. 953.35 s [vector] +++ OK, passed 100 tests.
  7690. 953.35 s [vector] any: OK
  7691. 953.35 s [vector] +++ OK, passed 100 tests.
  7692. 953.35 s [vector] prescanl: OK
  7693. 953.35 s [vector] +++ OK, passed 100 tests.
  7694. 953.35 s [vector] prescanl': OK
  7695. 953.35 s [vector] +++ OK, passed 100 tests.
  7696. 953.36 s [vector] postscanl: OK
  7697. 953.36 s [vector] +++ OK, passed 100 tests.
  7698. 953.36 s [vector] postscanl': OK
  7699. 953.36 s [vector] +++ OK, passed 100 tests.
  7700. 953.36 s [vector] scanl: OK
  7701. 953.36 s [vector] +++ OK, passed 100 tests.
  7702. 953.36 s [vector] scanl': OK
  7703. 953.37 s [vector] +++ OK, passed 100 tests.
  7704. 953.37 s [vector] scanl1: OK
  7705. 953.37 s [vector] +++ OK, passed 100 tests.
  7706. 953.37 s [vector] scanl1': OK
  7707. 953.37 s [vector] +++ OK, passed 100 tests.
  7708. 953.38 s [vector] iscanl: OK
  7709. 953.38 s [vector] +++ OK, passed 100 tests.
  7710. 953.38 s [vector] iscanl': OK
  7711. 953.38 s [vector] +++ OK, passed 100 tests.
  7712. 953.38 s [vector] prescanr: OK
  7713. 953.38 s [vector] +++ OK, passed 100 tests.
  7714. 953.38 s [vector] prescanr': OK
  7715. 953.38 s [vector] +++ OK, passed 100 tests.
  7716. 953.39 s [vector] postscanr: OK
  7717. 953.39 s [vector] +++ OK, passed 100 tests.
  7718. 953.39 s [vector] postscanr': OK
  7719. 953.39 s [vector] +++ OK, passed 100 tests.
  7720. 953.39 s [vector] scanr: OK
  7721. 953.39 s [vector] +++ OK, passed 100 tests.
  7722. 953.40 s [vector] scanr': OK
  7723. 953.40 s [vector] +++ OK, passed 100 tests.
  7724. 953.40 s [vector] scanr1: OK
  7725. 953.40 s [vector] +++ OK, passed 100 tests.
  7726. 953.40 s [vector] scanr1': OK
  7727. 953.40 s [vector] +++ OK, passed 100 tests.
  7728. 953.41 s [vector] iscanr: OK
  7729. 953.41 s [vector] +++ OK, passed 100 tests.
  7730. 953.41 s [vector] iscanr': OK
  7731. 953.41 s [vector] +++ OK, passed 100 tests.
  7732. 953.41 s [vector] mut_read: OK
  7733. 953.41 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7734. 953.41 s [vector] mut_write: OK
  7735. 953.41 s [vector] +++ OK, passed 100 tests; 20 discarded.
  7736. 953.41 s [vector] mut_modify: OK
  7737. 953.41 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7738. 953.41 s [vector] mut_generate: OK
  7739. 953.42 s [vector] +++ OK, passed 100 tests.
  7740. 953.44 s [vector] mut_generateM: OK (0.01s)
  7741. 953.44 s [vector] +++ OK, passed 100 tests.
  7742. 953.44 s [vector] mut_mapM_: OK (0.02s)
  7743. 953.44 s [vector] +++ OK, passed 100 tests.
  7744. 953.46 s [vector] mut_imapM_: OK (0.02s)
  7745. 953.46 s [vector] +++ OK, passed 100 tests.
  7746. 953.48 s [vector] mut_forM_: OK (0.02s)
  7747. 953.48 s [vector] +++ OK, passed 100 tests.
  7748. 953.50 s [vector] mut_iforM_: OK (0.02s)
  7749. 953.50 s [vector] +++ OK, passed 100 tests.
  7750. 953.50 s [vector] mut_foldr: OK
  7751. 953.50 s [vector] +++ OK, passed 100 tests.
  7752. 953.50 s [vector] mut_foldr': OK
  7753. 953.50 s [vector] +++ OK, passed 100 tests.
  7754. 953.50 s [vector] mut_foldl: OK
  7755. 953.50 s [vector] +++ OK, passed 100 tests.
  7756. 953.51 s [vector] mut_foldl': OK
  7757. 953.51 s [vector] +++ OK, passed 100 tests.
  7758. 953.51 s [vector] mut_ifoldr: OK
  7759. 953.51 s [vector] +++ OK, passed 100 tests.
  7760. 953.51 s [vector] mut_ifoldr': OK
  7761. 953.51 s [vector] +++ OK, passed 100 tests.
  7762. 953.51 s [vector] mut_ifoldl: OK
  7763. 953.52 s [vector] +++ OK, passed 100 tests.
  7764. 953.52 s [vector] mut_ifoldl': OK
  7765. 953.52 s [vector] +++ OK, passed 100 tests.
  7766. 953.52 s [vector] mut_foldM: OK
  7767. 953.52 s [vector] +++ OK, passed 100 tests.
  7768. 953.53 s [vector] mut_foldM': OK
  7769. 953.53 s [vector] +++ OK, passed 100 tests.
  7770. 953.53 s [vector] mut_foldrM: OK
  7771. 953.53 s [vector] +++ OK, passed 100 tests.
  7772. 953.53 s [vector] mut_foldrM': OK
  7773. 953.53 s [vector] +++ OK, passed 100 tests.
  7774. 953.53 s [vector] mut_ifoldM: OK
  7775. 953.54 s [vector] +++ OK, passed 100 tests.
  7776. 953.54 s [vector] mut_ifoldM': OK
  7777. 953.54 s [vector] +++ OK, passed 100 tests.
  7778. 953.55 s [vector] mut_ifoldrM: OK
  7779. 953.55 s [vector] +++ OK, passed 100 tests.
  7780. 953.55 s [vector] mut_ifoldrM': OK
  7781. 953.55 s [vector] +++ OK, passed 100 tests.
  7782. 953.55 s [vector] compare: OK
  7783. 953.55 s [vector] +++ OK, passed 100 tests.
  7784. 953.55 s [vector] maximum: OK
  7785. 953.55 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7786. 953.55 s [vector] minimum: OK
  7787. 953.55 s [vector] +++ OK, passed 100 tests; 20 discarded.
  7788. 953.55 s [vector] minIndex: OK
  7789. 953.55 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7790. 953.55 s [vector] maxIndex: OK
  7791. 953.55 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7792. 953.55 s [vector] maximumBy: OK
  7793. 953.55 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7794. 953.55 s [vector] minimumBy: OK
  7795. 953.55 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7796. 953.55 s [vector] maximumOn: OK
  7797. 953.55 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7798. 953.55 s [vector] minimumOn: OK
  7799. 953.55 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7800. 953.55 s [vector] maxIndexBy: OK
  7801. 953.56 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7802. 953.56 s [vector] minIndexBy: OK
  7803. 953.56 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7804. 953.56 s [vector] ListFirstMaxIndexWins: OK
  7805. 953.56 s [vector] +++ OK, passed 100 tests; 10 discarded.
  7806. 953.56 s [vector] FalseListFirstMaxIndexWins: OK
  7807. 953.56 s [vector] +++ OK, failed as expected. (after 1 test):
  7808. 953.56 s [vector] Exception:
  7809. 953.56 s [vector] Prelude.foldr1: empty list
  7810. 953.57 s [vector] CallStack (from HasCallStack):
  7811. 953.57 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  7812. 953.57 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  7813. 953.57 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  7814. 953.57 s [vector] []
  7815. 953.57 s [vector] zip: OK
  7816. 953.57 s [vector] +++ OK, passed 100 tests.
  7817. 953.57 s [vector] zip3: OK
  7818. 953.57 s [vector] +++ OK, passed 100 tests.
  7819. 953.57 s [vector] unzip: OK
  7820. 953.57 s [vector] +++ OK, passed 100 tests.
  7821. 953.57 s [vector] unzip3: OK
  7822. 953.57 s [vector] +++ OK, passed 100 tests.
  7823. 953.57 s [vector] indexed: OK
  7824. 953.57 s [vector] +++ OK, passed 100 tests.
  7825. 953.58 s [vector] update: OK
  7826. 953.58 s [vector] +++ OK, passed 100 tests.
  7827. 953.58 s [vector] concat: OK (0.01s)
  7828. 953.58 s [vector] +++ OK, passed 100 tests.
  7829. 953.58 s [vector] mempty: OK
  7830. 953.58 s [vector] +++ OK, passed 100 tests.
  7831. 953.58 s [vector] mappend: OK
  7832. 953.60 s [vector] +++ OK, passed 100 tests.
  7833. 953.60 s [vector] mconcat: OK (0.01s)
  7834. 953.60 s [vector] +++ OK, passed 100 tests.
  7835. 953.60 s [vector] fmap: OK
  7836. 953.60 s [vector] +++ OK, passed 100 tests.
  7837. 953.60 s [vector] return: OK
  7838. 953.60 s [vector] +++ OK, passed 100 tests.
  7839. 953.62 s [vector] bind: OK (0.02s)
  7840. 953.62 s [vector] +++ OK, passed 100 tests.
  7841. 953.62 s [vector] mzip: OK
  7842. 953.62 s [vector] +++ OK, passed 100 tests.
  7843. 953.62 s [vector] munzip: OK
  7844. 953.62 s [vector] +++ OK, passed 100 tests.
  7845. 953.62 s [vector] applicative_pure: OK
  7846. 953.62 s [vector] +++ OK, passed 100 tests.
  7847. 953.65 s [vector] applicative_appl: OK (0.03s)
  7848. 953.65 s [vector] +++ OK, passed 100 tests.
  7849. 953.65 s [vector] alternative_empty: OK
  7850. 953.65 s [vector] +++ OK, passed 100 tests.
  7851. 953.65 s [vector] alternative_or: OK
  7852. 953.65 s [vector] +++ OK, passed 100 tests.
  7853. 953.68 s [vector] sequence: OK (0.03s)
  7854. 953.68 s [vector] +++ OK, passed 100 tests.
  7855. 953.69 s [vector] sequence_: OK (0.01s)
  7856. 953.69 s [vector] +++ OK, passed 100 tests.
  7857. 953.69 s [vector] glength: OK
  7858. 953.69 s [vector] +++ OK, passed 100 tests.
  7859. 953.69 s [vector] sum: OK
  7860. 953.69 s [vector] +++ OK, passed 100 tests.
  7861. 953.69 s [vector] product: OK
  7862. 953.69 s [vector] +++ OK, passed 100 tests.
  7863. 953.69 s [vector] enumFromN: OK
  7864. 953.69 s [vector] +++ OK, passed 100 tests.
  7865. 953.70 s [vector] enumFromThenN: OK
  7866. 953.70 s [vector] +++ OK, passed 100 tests.
  7867. 953.70 s [vector] enumFromTo: OK
  7868. 953.70 s [vector] +++ OK, passed 100 tests.
  7869. 953.70 s [vector] enumFromThenTo: OK
  7870. 953.70 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7871. 953.70 s [vector] unstream
  7872. 953.70 s [vector] unstream == vunstream (exact): OK
  7873. 953.70 s [vector] +++ OK, passed 100 tests.
  7874. 953.70 s [vector] unstream == vunstream (unknown): OK
  7875. 953.70 s [vector] +++ OK, passed 100 tests.
  7876. 953.70 s [vector] unstreamR ~= vunstream (exact): OK
  7877. 953.70 s [vector] +++ OK, passed 100 tests.
  7878. 953.70 s [vector] unstreamR ~= vunstream (unknown): OK
  7879. 953.70 s [vector] +++ OK, passed 100 tests.
  7880. 953.70 s [vector] Tests.Vector.Unboxed
  7881. 953.70 s [vector] ()
  7882. 953.70 s [vector] fromList.toList == id: OK
  7883. 953.70 s [vector] +++ OK, passed 100 tests.
  7884. 953.70 s [vector] toList.fromList == id: OK
  7885. 953.70 s [vector] +++ OK, passed 100 tests.
  7886. 953.70 s [vector] unstream.stream == id: OK
  7887. 953.70 s [vector] +++ OK, passed 100 tests.
  7888. 953.71 s [vector] stream.unstream == id: OK
  7889. 953.71 s [vector] +++ OK, passed 100 tests.
  7890. 953.71 s [vector] eq: OK
  7891. 953.71 s [vector] +++ OK, passed 100 tests.
  7892. 953.71 s [vector] length: OK
  7893. 953.71 s [vector] +++ OK, passed 100 tests.
  7894. 953.71 s [vector] null: OK
  7895. 953.71 s [vector] +++ OK, passed 100 tests.
  7896. 953.71 s [vector] index: OK
  7897. 953.71 s [vector] +++ OK, passed 100 tests; 21 discarded.
  7898. 953.71 s [vector] safeIndex: OK
  7899. 953.71 s [vector] +++ OK, passed 100 tests.
  7900. 953.71 s [vector] head: OK
  7901. 953.71 s [vector] +++ OK, passed 100 tests; 20 discarded.
  7902. 953.71 s [vector] last: OK
  7903. 953.71 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7904. 953.71 s [vector] unsafeIndex: OK
  7905. 953.71 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7906. 953.71 s [vector] unsafeHead: OK
  7907. 953.71 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7908. 953.71 s [vector] unsafeLast: OK
  7909. 953.71 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7910. 953.71 s [vector] slice: OK
  7911. 953.71 s [vector] +++ OK, passed 100 tests.
  7912. 953.71 s [vector] init: OK
  7913. 953.71 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7914. 953.71 s [vector] tail: OK
  7915. 953.71 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7916. 953.71 s [vector] take: OK
  7917. 953.71 s [vector] +++ OK, passed 100 tests.
  7918. 953.71 s [vector] drop: OK
  7919. 953.71 s [vector] +++ OK, passed 100 tests.
  7920. 953.71 s [vector] splitAt: OK
  7921. 953.71 s [vector] +++ OK, passed 100 tests.
  7922. 953.71 s [vector] empty: OK
  7923. 953.71 s [vector] +++ OK, passed 100 tests.
  7924. 953.71 s [vector] singleton: OK
  7925. 953.71 s [vector] +++ OK, passed 100 tests.
  7926. 953.71 s [vector] replicate: OK
  7927. 953.71 s [vector] +++ OK, passed 100 tests.
  7928. 953.71 s [vector] generate: OK
  7929. 953.71 s [vector] +++ OK, passed 100 tests.
  7930. 953.72 s [vector] iterateN: OK
  7931. 953.72 s [vector] +++ OK, passed 100 tests.
  7932. 953.76 s [vector] iterateNM: OK (0.03s)
  7933. 953.76 s [vector] +++ OK, passed 100 tests.
  7934. 953.77 s [vector] generateM: OK (0.01s)
  7935. 953.77 s [vector] +++ OK, passed 100 tests.
  7936. 953.78 s [vector] replicateM: OK (0.02s)
  7937. 953.78 s [vector] +++ OK, passed 100 tests.
  7938. 953.78 s [vector] create: OK
  7939. 953.78 s [vector] +++ OK, passed 100 tests.
  7940. 953.78 s [vector] createT: OK
  7941. 953.78 s [vector] +++ OK, passed 100 tests.
  7942. 953.78 s [vector] unfoldr: OK
  7943. 953.78 s [vector] +++ OK, passed 100 tests.
  7944. 953.78 s [vector] unfoldrN: OK
  7945. 953.78 s [vector] +++ OK, passed 100 tests.
  7946. 953.78 s [vector] unfoldrExactN: OK
  7947. 953.78 s [vector] +++ OK, passed 100 tests.
  7948. 953.79 s [vector] unfoldrM: OK
  7949. 953.79 s [vector] +++ OK, passed 100 tests.
  7950. 953.79 s [vector] unfoldrNM: OK
  7951. 953.80 s [vector] +++ OK, passed 100 tests.
  7952. 953.86 s [vector] unfoldrExactNM: OK (0.06s)
  7953. 953.86 s [vector] +++ OK, passed 100 tests.
  7954. 954.02 s [vector] constructN: OK
  7955. 954.02 s [vector] +++ OK, passed 100 tests.
  7956. 954.02 s [vector] constructrN: OK
  7957. 954.02 s [vector] +++ OK, passed 100 tests.
  7958. 954.02 s [vector] cons: OK
  7959. 954.02 s [vector] +++ OK, passed 100 tests.
  7960. 954.02 s [vector] snoc: OK
  7961. 954.02 s [vector] +++ OK, passed 100 tests.
  7962. 954.02 s [vector] append: OK
  7963. 954.02 s [vector] +++ OK, passed 100 tests.
  7964. 954.02 s [vector] concat: OK
  7965. 954.02 s [vector] +++ OK, passed 100 tests.
  7966. 954.02 s [vector] force: OK
  7967. 954.02 s [vector] +++ OK, passed 100 tests.
  7968. 954.02 s [vector] upd: OK
  7969. 954.02 s [vector] +++ OK, passed 100 tests.
  7970. 954.02 s [vector] accum: OK
  7971. 954.02 s [vector] +++ OK, passed 100 tests.
  7972. 954.02 s [vector] reverse: OK
  7973. 954.02 s [vector] +++ OK, passed 100 tests.
  7974. 954.02 s [vector] backpermute: OK
  7975. 954.02 s [vector] +++ OK, passed 100 tests.
  7976. 954.02 s [vector] map: OK
  7977. 954.02 s [vector] +++ OK, passed 100 tests.
  7978. 954.02 s [vector] imap: OK
  7979. 954.02 s [vector] +++ OK, passed 100 tests.
  7980. 954.02 s [vector] concatMap: OK
  7981. 954.02 s [vector] +++ OK, passed 100 tests.
  7982. 954.02 s [vector] mapM: OK
  7983. 954.02 s [vector] +++ OK, passed 100 tests.
  7984. 954.02 s [vector] mapM_: OK (0.01s)
  7985. 954.02 s [vector] +++ OK, passed 100 tests.
  7986. 954.02 s [vector] forM: OK
  7987. 954.02 s [vector] +++ OK, passed 100 tests.
  7988. 954.02 s [vector] forM_: OK (0.01s)
  7989. 954.02 s [vector] +++ OK, passed 100 tests.
  7990. 954.02 s [vector] imapM: OK
  7991. 954.02 s [vector] +++ OK, passed 100 tests.
  7992. 954.02 s [vector] imapM_: OK (0.01s)
  7993. 954.02 s [vector] +++ OK, passed 100 tests.
  7994. 954.02 s [vector] zipWith: OK
  7995. 954.02 s [vector] +++ OK, passed 100 tests.
  7996. 954.02 s [vector] zipWith3: OK
  7997. 954.02 s [vector] +++ OK, passed 100 tests.
  7998. 954.02 s [vector] izipWith: OK
  7999. 954.02 s [vector] +++ OK, passed 100 tests.
  8000. 954.02 s [vector] izipWith3: OK
  8001. 954.02 s [vector] +++ OK, passed 100 tests.
  8002. 954.02 s [vector] izipWithM: OK
  8003. 954.02 s [vector] +++ OK, passed 100 tests.
  8004. 954.02 s [vector] izipWithM_: OK (0.01s)
  8005. 954.02 s [vector] +++ OK, passed 100 tests.
  8006. 954.02 s [vector] zipWithM: OK
  8007. 954.02 s [vector] +++ OK, passed 100 tests.
  8008. 954.02 s [vector] zipWithM_: OK
  8009. 954.02 s [vector] +++ OK, passed 100 tests.
  8010. 954.02 s [vector] filter: OK
  8011. 954.02 s [vector] +++ OK, passed 100 tests.
  8012. 954.02 s [vector] ifilter: OK
  8013. 954.02 s [vector] +++ OK, passed 100 tests.
  8014. 954.02 s [vector] filterM: OK (0.03s)
  8015. 954.02 s [vector] +++ OK, passed 100 tests.
  8016. 954.02 s [vector] uniq: OK
  8017. 954.02 s [vector] +++ OK, passed 100 tests.
  8018. 954.02 s [vector] mapMaybe: OK
  8019. 954.02 s [vector] +++ OK, passed 100 tests.
  8020. 954.02 s [vector] imapMaybe: OK
  8021. 954.02 s [vector] +++ OK, passed 100 tests.
  8022. 954.02 s [vector] takeWhile: OK
  8023. 954.02 s [vector] +++ OK, passed 100 tests.
  8024. 954.02 s [vector] dropWhile: OK
  8025. 954.02 s [vector] +++ OK, passed 100 tests.
  8026. 954.02 s [vector] partition: OK
  8027. 954.02 s [vector] +++ OK, passed 100 tests.
  8028. 954.02 s [vector] partitionWith: OK
  8029. 954.02 s [vector] +++ OK, passed 100 tests.
  8030. 954.02 s [vector] span: OK
  8031. 954.02 s [vector] +++ OK, passed 100 tests.
  8032. 954.02 s [vector] break: OK
  8033. 954.02 s [vector] +++ OK, passed 100 tests.
  8034. 954.02 s [vector] spanR: OK
  8035. 954.02 s [vector] +++ OK, passed 100 tests.
  8036. 954.02 s [vector] breakR: OK
  8037. 954.02 s [vector] +++ OK, passed 100 tests.
  8038. 954.02 s [vector] groupBy: OK
  8039. 954.02 s [vector] +++ OK, passed 100 tests.
  8040. 954.02 s [vector] elem: OK
  8041. 954.02 s [vector] +++ OK, passed 100 tests.
  8042. 954.02 s [vector] notElem: OK
  8043. 954.02 s [vector] +++ OK, passed 100 tests.
  8044. 954.02 s [vector] find: OK
  8045. 954.02 s [vector] +++ OK, passed 100 tests.
  8046. 954.02 s [vector] findIndex: OK
  8047. 954.02 s [vector] +++ OK, passed 100 tests.
  8048. 954.02 s [vector] findIndexR: OK
  8049. 954.02 s [vector] +++ OK, passed 100 tests.
  8050. 954.02 s [vector] findIndices: OK
  8051. 954.02 s [vector] +++ OK, passed 100 tests.
  8052. 954.02 s [vector] elemIndex: OK
  8053. 954.02 s [vector] +++ OK, passed 100 tests.
  8054. 954.02 s [vector] elemIndices: OK
  8055. 954.02 s [vector] +++ OK, passed 100 tests.
  8056. 954.02 s [vector] foldl: OK
  8057. 954.02 s [vector] +++ OK, passed 100 tests.
  8058. 954.02 s [vector] foldl1: OK
  8059. 954.02 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8060. 954.02 s [vector] foldl': OK
  8061. 954.02 s [vector] +++ OK, passed 100 tests.
  8062. 954.02 s [vector] foldl1': OK
  8063. 954.02 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8064. 954.02 s [vector] foldr: OK
  8065. 954.02 s [vector] +++ OK, passed 100 tests.
  8066. 954.02 s [vector] foldr1: OK
  8067. 954.02 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8068. 954.02 s [vector] foldr': OK
  8069. 954.02 s [vector] +++ OK, passed 100 tests.
  8070. 954.02 s [vector] foldr1': OK
  8071. 954.02 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8072. 954.03 s [vector] ifoldl: OK
  8073. 954.03 s [vector] +++ OK, passed 100 tests.
  8074. 954.03 s [vector] ifoldl': OK
  8075. 954.03 s [vector] +++ OK, passed 100 tests.
  8076. 954.03 s [vector] ifoldr: OK
  8077. 954.03 s [vector] +++ OK, passed 100 tests.
  8078. 954.03 s [vector] ifoldr': OK
  8079. 954.03 s [vector] +++ OK, passed 100 tests.
  8080. 954.03 s [vector] ifoldM: OK
  8081. 954.03 s [vector] +++ OK, passed 100 tests.
  8082. 954.03 s [vector] ifoldM': OK
  8083. 954.03 s [vector] +++ OK, passed 100 tests.
  8084. 954.04 s [vector] ifoldM_: OK (0.01s)
  8085. 954.04 s [vector] +++ OK, passed 100 tests.
  8086. 954.04 s [vector] ifoldM'_: OK (0.01s)
  8087. 954.04 s [vector] +++ OK, passed 100 tests.
  8088. 954.04 s [vector] all: OK
  8089. 954.04 s [vector] +++ OK, passed 100 tests.
  8090. 954.04 s [vector] any: OK
  8091. 954.04 s [vector] +++ OK, passed 100 tests.
  8092. 954.04 s [vector] prescanl: OK
  8093. 954.04 s [vector] +++ OK, passed 100 tests.
  8094. 954.04 s [vector] prescanl': OK
  8095. 954.04 s [vector] +++ OK, passed 100 tests.
  8096. 954.04 s [vector] postscanl: OK
  8097. 954.04 s [vector] +++ OK, passed 100 tests.
  8098. 954.04 s [vector] postscanl': OK
  8099. 954.04 s [vector] +++ OK, passed 100 tests.
  8100. 954.04 s [vector] scanl: OK
  8101. 954.04 s [vector] +++ OK, passed 100 tests.
  8102. 954.05 s [vector] scanl': OK
  8103. 954.05 s [vector] +++ OK, passed 100 tests.
  8104. 954.05 s [vector] scanl1: OK
  8105. 954.05 s [vector] +++ OK, passed 100 tests.
  8106. 954.05 s [vector] scanl1': OK
  8107. 954.05 s [vector] +++ OK, passed 100 tests.
  8108. 954.05 s [vector] iscanl: OK
  8109. 954.05 s [vector] +++ OK, passed 100 tests.
  8110. 954.05 s [vector] iscanl': OK
  8111. 954.05 s [vector] +++ OK, passed 100 tests.
  8112. 954.05 s [vector] prescanr: OK
  8113. 954.05 s [vector] +++ OK, passed 100 tests.
  8114. 954.05 s [vector] prescanr': OK
  8115. 954.05 s [vector] +++ OK, passed 100 tests.
  8116. 954.05 s [vector] postscanr: OK
  8117. 954.05 s [vector] +++ OK, passed 100 tests.
  8118. 954.05 s [vector] postscanr': OK
  8119. 954.06 s [vector] +++ OK, passed 100 tests.
  8120. 954.06 s [vector] scanr: OK
  8121. 954.06 s [vector] +++ OK, passed 100 tests.
  8122. 954.06 s [vector] scanr': OK
  8123. 954.06 s [vector] +++ OK, passed 100 tests.
  8124. 954.06 s [vector] scanr1: OK
  8125. 954.06 s [vector] +++ OK, passed 100 tests.
  8126. 954.06 s [vector] scanr1': OK
  8127. 954.06 s [vector] +++ OK, passed 100 tests.
  8128. 954.06 s [vector] iscanr: OK
  8129. 954.06 s [vector] +++ OK, passed 100 tests.
  8130. 954.06 s [vector] iscanr': OK
  8131. 954.06 s [vector] +++ OK, passed 100 tests.
  8132. 954.06 s [vector] mut_read: OK
  8133. 954.06 s [vector] +++ OK, passed 100 tests; 23 discarded.
  8134. 954.06 s [vector] mut_write: OK
  8135. 954.06 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8136. 954.07 s [vector] mut_modify: OK
  8137. 954.07 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8138. 954.07 s [vector] mut_generate: OK
  8139. 954.07 s [vector] +++ OK, passed 100 tests.
  8140. 954.08 s [vector] mut_generateM: OK
  8141. 954.08 s [vector] +++ OK, passed 100 tests.
  8142. 954.08 s [vector] mut_mapM_: OK
  8143. 954.08 s [vector] +++ OK, passed 100 tests.
  8144. 954.09 s [vector] mut_imapM_: OK (0.01s)
  8145. 954.09 s [vector] +++ OK, passed 100 tests.
  8146. 954.11 s [vector] mut_forM_: OK
  8147. 954.11 s [vector] +++ OK, passed 100 tests.
  8148. 954.11 s [vector] mut_iforM_: OK
  8149. 954.11 s [vector] +++ OK, passed 100 tests.
  8150. 954.11 s [vector] mut_foldr: OK
  8151. 954.11 s [vector] +++ OK, passed 100 tests.
  8152. 954.11 s [vector] mut_foldr': OK
  8153. 954.11 s [vector] +++ OK, passed 100 tests.
  8154. 954.11 s [vector] mut_foldl: OK
  8155. 954.12 s [vector] +++ OK, passed 100 tests.
  8156. 954.12 s [vector] mut_foldl': OK
  8157. 954.12 s [vector] +++ OK, passed 100 tests.
  8158. 954.12 s [vector] mut_ifoldr: OK
  8159. 954.12 s [vector] +++ OK, passed 100 tests.
  8160. 954.12 s [vector] mut_ifoldr': OK
  8161. 954.12 s [vector] +++ OK, passed 100 tests.
  8162. 954.12 s [vector] mut_ifoldl: OK
  8163. 954.12 s [vector] +++ OK, passed 100 tests.
  8164. 954.12 s [vector] mut_ifoldl': OK
  8165. 954.12 s [vector] +++ OK, passed 100 tests.
  8166. 954.12 s [vector] mut_foldM: OK
  8167. 954.12 s [vector] +++ OK, passed 100 tests.
  8168. 954.12 s [vector] mut_foldM': OK
  8169. 954.12 s [vector] +++ OK, passed 100 tests.
  8170. 954.12 s [vector] mut_foldrM: OK
  8171. 954.12 s [vector] +++ OK, passed 100 tests.
  8172. 954.12 s [vector] mut_foldrM': OK
  8173. 954.12 s [vector] +++ OK, passed 100 tests.
  8174. 954.12 s [vector] mut_ifoldM: OK
  8175. 954.12 s [vector] +++ OK, passed 100 tests.
  8176. 954.13 s [vector] mut_ifoldM': OK
  8177. 954.13 s [vector] +++ OK, passed 100 tests.
  8178. 954.13 s [vector] mut_ifoldrM: OK
  8179. 954.13 s [vector] +++ OK, passed 100 tests.
  8180. 954.13 s [vector] mut_ifoldrM': OK
  8181. 954.13 s [vector] +++ OK, passed 100 tests.
  8182. 954.13 s [vector] compare: OK
  8183. 954.13 s [vector] +++ OK, passed 100 tests.
  8184. 954.13 s [vector] maximum: OK
  8185. 954.13 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8186. 954.13 s [vector] minimum: OK
  8187. 954.13 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8188. 954.13 s [vector] minIndex: OK
  8189. 954.13 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8190. 954.13 s [vector] maxIndex: OK
  8191. 954.13 s [vector] +++ OK, passed 100 tests; 21 discarded.
  8192. 954.13 s [vector] maximumBy: OK
  8193. 954.13 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8194. 954.13 s [vector] minimumBy: OK
  8195. 954.13 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8196. 954.13 s [vector] maximumOn: OK
  8197. 954.13 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8198. 954.13 s [vector] minimumOn: OK
  8199. 954.13 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8200. 954.13 s [vector] maxIndexBy: OK
  8201. 954.13 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8202. 954.14 s [vector] minIndexBy: OK
  8203. 954.14 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8204. 954.14 s [vector] ListFirstMaxIndexWins: OK
  8205. 954.14 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8206. 954.14 s [vector] FalseListFirstMaxIndexWins: OK
  8207. 954.14 s [vector] +++ OK, failed as expected. (after 1 test):
  8208. 954.14 s [vector] Exception:
  8209. 954.14 s [vector] Prelude.foldr1: empty list
  8210. 954.14 s [vector] CallStack (from HasCallStack):
  8211. 954.14 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  8212. 954.14 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  8213. 954.14 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  8214. 954.14 s [vector] []
  8215. 954.14 s [vector] zip: OK
  8216. 954.14 s [vector] +++ OK, passed 100 tests.
  8217. 954.14 s [vector] zip3: OK
  8218. 954.14 s [vector] +++ OK, passed 100 tests.
  8219. 954.14 s [vector] unzip: OK
  8220. 954.14 s [vector] +++ OK, passed 100 tests.
  8221. 954.14 s [vector] unzip3: OK
  8222. 954.14 s [vector] +++ OK, passed 100 tests.
  8223. 954.14 s [vector] indexed: OK
  8224. 954.14 s [vector] +++ OK, passed 100 tests.
  8225. 954.14 s [vector] update: OK
  8226. 954.14 s [vector] +++ OK, passed 100 tests.
  8227. 954.14 s [vector] mempty: OK
  8228. 954.14 s [vector] +++ OK, passed 100 tests.
  8229. 954.15 s [vector] mappend: OK
  8230. 954.15 s [vector] +++ OK, passed 100 tests.
  8231. 954.15 s [vector] mconcat: OK
  8232. 954.15 s [vector] +++ OK, passed 100 tests.
  8233. 954.15 s [vector] glength: OK
  8234. 954.16 s [vector] +++ OK, passed 100 tests.
  8235. 954.16 s [vector] (Bool)
  8236. 954.16 s [vector] fromList.toList == id: OK
  8237. 954.16 s [vector] +++ OK, passed 100 tests.
  8238. 954.16 s [vector] toList.fromList == id: OK
  8239. 954.16 s [vector] +++ OK, passed 100 tests.
  8240. 954.16 s [vector] unstream.stream == id: OK
  8241. 954.16 s [vector] +++ OK, passed 100 tests.
  8242. 954.16 s [vector] stream.unstream == id: OK
  8243. 954.16 s [vector] +++ OK, passed 100 tests.
  8244. 954.16 s [vector] eq: OK
  8245. 954.16 s [vector] +++ OK, passed 100 tests.
  8246. 954.16 s [vector] length: OK
  8247. 954.16 s [vector] +++ OK, passed 100 tests.
  8248. 954.16 s [vector] null: OK
  8249. 954.16 s [vector] +++ OK, passed 100 tests.
  8250. 954.16 s [vector] index: OK
  8251. 954.16 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8252. 954.16 s [vector] safeIndex: OK
  8253. 954.16 s [vector] +++ OK, passed 100 tests.
  8254. 954.16 s [vector] head: OK
  8255. 954.16 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8256. 954.16 s [vector] last: OK
  8257. 954.16 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8258. 954.16 s [vector] unsafeIndex: OK
  8259. 954.16 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8260. 954.16 s [vector] unsafeHead: OK
  8261. 954.16 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8262. 954.16 s [vector] unsafeLast: OK
  8263. 954.16 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8264. 954.16 s [vector] slice: OK
  8265. 954.16 s [vector] +++ OK, passed 100 tests.
  8266. 954.16 s [vector] init: OK
  8267. 954.16 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8268. 954.16 s [vector] tail: OK
  8269. 954.17 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8270. 954.17 s [vector] take: OK
  8271. 954.17 s [vector] +++ OK, passed 100 tests.
  8272. 954.17 s [vector] drop: OK
  8273. 954.17 s [vector] +++ OK, passed 100 tests.
  8274. 954.17 s [vector] splitAt: OK
  8275. 954.17 s [vector] +++ OK, passed 100 tests.
  8276. 954.17 s [vector] empty: OK
  8277. 954.17 s [vector] +++ OK, passed 100 tests.
  8278. 954.17 s [vector] singleton: OK
  8279. 954.17 s [vector] +++ OK, passed 100 tests.
  8280. 954.17 s [vector] replicate: OK
  8281. 954.17 s [vector] +++ OK, passed 100 tests.
  8282. 954.17 s [vector] generate: OK
  8283. 954.17 s [vector] +++ OK, passed 100 tests.
  8284. 954.18 s [vector] iterateN: OK
  8285. 954.18 s [vector] +++ OK, passed 100 tests.
  8286. 954.20 s [vector] iterateNM: OK (0.03s)
  8287. 954.20 s [vector] +++ OK, passed 100 tests.
  8288. 954.22 s [vector] generateM: OK (0.01s)
  8289. 954.22 s [vector] +++ OK, passed 100 tests.
  8290. 954.23 s [vector] replicateM: OK (0.01s)
  8291. 954.23 s [vector] +++ OK, passed 100 tests.
  8292. 954.23 s [vector] create: OK
  8293. 954.23 s [vector] +++ OK, passed 100 tests.
  8294. 954.23 s [vector] createT: OK
  8295. 954.23 s [vector] +++ OK, passed 100 tests.
  8296. 954.23 s [vector] unfoldr: OK
  8297. 954.23 s [vector] +++ OK, passed 100 tests.
  8298. 954.23 s [vector] unfoldrN: OK
  8299. 954.23 s [vector] +++ OK, passed 100 tests.
  8300. 954.23 s [vector] unfoldrExactN: OK
  8301. 954.23 s [vector] +++ OK, passed 100 tests.
  8302. 954.23 s [vector] unfoldrM: OK
  8303. 954.23 s [vector] +++ OK, passed 100 tests.
  8304. 954.24 s [vector] unfoldrNM: OK
  8305. 954.24 s [vector] +++ OK, passed 100 tests.
  8306. 954.26 s [vector] unfoldrExactNM: OK (0.03s)
  8307. 954.26 s [vector] +++ OK, passed 100 tests.
  8308. 954.27 s [vector] constructN: OK
  8309. 954.27 s [vector] +++ OK, passed 100 tests.
  8310. 954.27 s [vector] constructrN: OK
  8311. 954.27 s [vector] +++ OK, passed 100 tests.
  8312. 954.27 s [vector] cons: OK
  8313. 954.27 s [vector] +++ OK, passed 100 tests.
  8314. 954.27 s [vector] snoc: OK
  8315. 954.27 s [vector] +++ OK, passed 100 tests.
  8316. 954.28 s [vector] append: OK
  8317. 954.28 s [vector] +++ OK, passed 100 tests.
  8318. 954.29 s [vector] concat: OK (0.02s)
  8319. 954.29 s [vector] +++ OK, passed 100 tests.
  8320. 954.29 s [vector] force: OK
  8321. 954.29 s [vector] +++ OK, passed 100 tests.
  8322. 954.29 s [vector] upd: OK
  8323. 954.29 s [vector] +++ OK, passed 100 tests.
  8324. 954.29 s [vector] accum: OK
  8325. 954.29 s [vector] +++ OK, passed 100 tests.
  8326. 954.30 s [vector] reverse: OK
  8327. 954.30 s [vector] +++ OK, passed 100 tests.
  8328. 954.30 s [vector] backpermute: OK
  8329. 954.30 s [vector] +++ OK, passed 100 tests.
  8330. 954.30 s [vector] map: OK
  8331. 954.30 s [vector] +++ OK, passed 100 tests.
  8332. 954.30 s [vector] imap: OK
  8333. 954.30 s [vector] +++ OK, passed 100 tests.
  8334. 954.30 s [vector] concatMap: OK
  8335. 954.32 s [vector] +++ OK, passed 100 tests.
  8336. 954.32 s [vector] mapM: OK
  8337. 954.32 s [vector] +++ OK, passed 100 tests.
  8338. 954.32 s [vector] mapM_: OK (0.01s)
  8339. 954.32 s [vector] +++ OK, passed 100 tests.
  8340. 954.32 s [vector] forM: OK
  8341. 954.32 s [vector] +++ OK, passed 100 tests.
  8342. 954.33 s [vector] forM_: OK (0.01s)
  8343. 954.33 s [vector] +++ OK, passed 100 tests.
  8344. 954.34 s [vector] imapM: OK
  8345. 954.34 s [vector] +++ OK, passed 100 tests.
  8346. 954.35 s [vector] imapM_: OK (0.01s)
  8347. 954.35 s [vector] +++ OK, passed 100 tests.
  8348. 954.35 s [vector] zipWith: OK
  8349. 954.35 s [vector] +++ OK, passed 100 tests.
  8350. 954.35 s [vector] zipWith3: OK
  8351. 954.35 s [vector] +++ OK, passed 100 tests.
  8352. 954.36 s [vector] izipWith: OK
  8353. 954.36 s [vector] +++ OK, passed 100 tests.
  8354. 954.36 s [vector] izipWith3: OK
  8355. 954.36 s [vector] +++ OK, passed 100 tests.
  8356. 954.36 s [vector] izipWithM: OK
  8357. 954.36 s [vector] +++ OK, passed 100 tests.
  8358. 954.37 s [vector] izipWithM_: OK
  8359. 954.37 s [vector] +++ OK, passed 100 tests.
  8360. 954.37 s [vector] zipWithM: OK
  8361. 954.37 s [vector] +++ OK, passed 100 tests.
  8362. 954.38 s [vector] zipWithM_: OK
  8363. 954.38 s [vector] +++ OK, passed 100 tests.
  8364. 954.38 s [vector] filter: OK
  8365. 954.38 s [vector] +++ OK, passed 100 tests.
  8366. 954.38 s [vector] ifilter: OK
  8367. 954.40 s [vector] +++ OK, passed 100 tests.
  8368. 954.40 s [vector] filterM: OK (0.02s)
  8369. 954.40 s [vector] +++ OK, passed 100 tests.
  8370. 954.40 s [vector] uniq: OK
  8371. 954.40 s [vector] +++ OK, passed 100 tests.
  8372. 954.40 s [vector] mapMaybe: OK
  8373. 954.41 s [vector] +++ OK, passed 100 tests.
  8374. 954.41 s [vector] imapMaybe: OK
  8375. 954.41 s [vector] +++ OK, passed 100 tests.
  8376. 954.41 s [vector] takeWhile: OK
  8377. 954.41 s [vector] +++ OK, passed 100 tests.
  8378. 954.41 s [vector] dropWhile: OK
  8379. 954.41 s [vector] +++ OK, passed 100 tests.
  8380. 954.41 s [vector] partition: OK
  8381. 954.41 s [vector] +++ OK, passed 100 tests.
  8382. 954.41 s [vector] partitionWith: OK
  8383. 954.41 s [vector] +++ OK, passed 100 tests.
  8384. 954.41 s [vector] span: OK
  8385. 954.41 s [vector] +++ OK, passed 100 tests.
  8386. 954.41 s [vector] break: OK
  8387. 954.41 s [vector] +++ OK, passed 100 tests.
  8388. 954.41 s [vector] spanR: OK
  8389. 954.42 s [vector] +++ OK, passed 100 tests.
  8390. 954.42 s [vector] breakR: OK
  8391. 954.42 s [vector] +++ OK, passed 100 tests.
  8392. 954.42 s [vector] groupBy: OK
  8393. 954.42 s [vector] +++ OK, passed 100 tests.
  8394. 954.42 s [vector] elem: OK
  8395. 954.42 s [vector] +++ OK, passed 100 tests.
  8396. 954.42 s [vector] notElem: OK
  8397. 954.42 s [vector] +++ OK, passed 100 tests.
  8398. 954.42 s [vector] find: OK
  8399. 954.42 s [vector] +++ OK, passed 100 tests.
  8400. 954.42 s [vector] findIndex: OK
  8401. 954.42 s [vector] +++ OK, passed 100 tests.
  8402. 954.42 s [vector] findIndexR: OK
  8403. 954.42 s [vector] +++ OK, passed 100 tests.
  8404. 954.42 s [vector] findIndices: OK
  8405. 954.42 s [vector] +++ OK, passed 100 tests.
  8406. 954.42 s [vector] elemIndex: OK
  8407. 954.42 s [vector] +++ OK, passed 100 tests.
  8408. 954.42 s [vector] elemIndices: OK
  8409. 954.42 s [vector] +++ OK, passed 100 tests.
  8410. 954.42 s [vector] foldl: OK
  8411. 954.43 s [vector] +++ OK, passed 100 tests.
  8412. 954.43 s [vector] foldl1: OK
  8413. 954.43 s [vector] +++ OK, passed 100 tests; 11 discarded.
  8414. 954.43 s [vector] foldl': OK
  8415. 954.43 s [vector] +++ OK, passed 100 tests.
  8416. 954.43 s [vector] foldl1': OK
  8417. 954.43 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8418. 954.43 s [vector] foldr: OK
  8419. 954.43 s [vector] +++ OK, passed 100 tests.
  8420. 954.43 s [vector] foldr1: OK
  8421. 954.43 s [vector] +++ OK, passed 100 tests; 11 discarded.
  8422. 954.44 s [vector] foldr': OK
  8423. 954.44 s [vector] +++ OK, passed 100 tests.
  8424. 954.44 s [vector] foldr1': OK
  8425. 954.44 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8426. 954.44 s [vector] ifoldl: OK
  8427. 954.44 s [vector] +++ OK, passed 100 tests.
  8428. 954.44 s [vector] ifoldl': OK
  8429. 954.44 s [vector] +++ OK, passed 100 tests.
  8430. 954.45 s [vector] ifoldr: OK
  8431. 954.45 s [vector] +++ OK, passed 100 tests.
  8432. 954.45 s [vector] ifoldr': OK
  8433. 954.45 s [vector] +++ OK, passed 100 tests.
  8434. 954.46 s [vector] ifoldM: OK
  8435. 954.46 s [vector] +++ OK, passed 100 tests.
  8436. 954.46 s [vector] ifoldM': OK
  8437. 954.46 s [vector] +++ OK, passed 100 tests.
  8438. 954.48 s [vector] ifoldM_: OK (0.01s)
  8439. 954.48 s [vector] +++ OK, passed 100 tests.
  8440. 954.48 s [vector] ifoldM'_: OK (0.02s)
  8441. 954.48 s [vector] +++ OK, passed 100 tests.
  8442. 954.48 s [vector] all: OK
  8443. 954.48 s [vector] +++ OK, passed 100 tests.
  8444. 954.48 s [vector] any: OK
  8445. 954.49 s [vector] +++ OK, passed 100 tests.
  8446. 954.49 s [vector] prescanl: OK
  8447. 954.49 s [vector] +++ OK, passed 100 tests.
  8448. 954.49 s [vector] prescanl': OK
  8449. 954.49 s [vector] +++ OK, passed 100 tests.
  8450. 954.49 s [vector] postscanl: OK
  8451. 954.49 s [vector] +++ OK, passed 100 tests.
  8452. 954.49 s [vector] postscanl': OK
  8453. 954.49 s [vector] +++ OK, passed 100 tests.
  8454. 954.49 s [vector] scanl: OK
  8455. 954.49 s [vector] +++ OK, passed 100 tests.
  8456. 954.49 s [vector] scanl': OK
  8457. 954.49 s [vector] +++ OK, passed 100 tests.
  8458. 954.50 s [vector] scanl1: OK
  8459. 954.50 s [vector] +++ OK, passed 100 tests.
  8460. 954.50 s [vector] scanl1': OK
  8461. 954.50 s [vector] +++ OK, passed 100 tests.
  8462. 954.50 s [vector] iscanl: OK
  8463. 954.50 s [vector] +++ OK, passed 100 tests.
  8464. 954.50 s [vector] iscanl': OK
  8465. 954.50 s [vector] +++ OK, passed 100 tests.
  8466. 954.50 s [vector] prescanr: OK
  8467. 954.50 s [vector] +++ OK, passed 100 tests.
  8468. 954.51 s [vector] prescanr': OK
  8469. 954.51 s [vector] +++ OK, passed 100 tests.
  8470. 954.51 s [vector] postscanr: OK
  8471. 954.51 s [vector] +++ OK, passed 100 tests.
  8472. 954.51 s [vector] postscanr': OK
  8473. 954.51 s [vector] +++ OK, passed 100 tests.
  8474. 954.51 s [vector] scanr: OK
  8475. 954.51 s [vector] +++ OK, passed 100 tests.
  8476. 954.51 s [vector] scanr': OK
  8477. 954.51 s [vector] +++ OK, passed 100 tests.
  8478. 954.52 s [vector] scanr1: OK
  8479. 954.52 s [vector] +++ OK, passed 100 tests.
  8480. 954.52 s [vector] scanr1': OK
  8481. 954.53 s [vector] +++ OK, passed 100 tests.
  8482. 954.53 s [vector] iscanr: OK
  8483. 954.53 s [vector] +++ OK, passed 100 tests.
  8484. 954.53 s [vector] iscanr': OK
  8485. 954.53 s [vector] +++ OK, passed 100 tests.
  8486. 954.53 s [vector] mut_read: OK
  8487. 954.53 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8488. 954.53 s [vector] mut_write: OK
  8489. 954.53 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8490. 954.53 s [vector] mut_modify: OK
  8491. 954.53 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8492. 954.53 s [vector] mut_generate: OK
  8493. 954.53 s [vector] +++ OK, passed 100 tests.
  8494. 954.54 s [vector] mut_generateM: OK
  8495. 954.54 s [vector] +++ OK, passed 100 tests.
  8496. 954.56 s [vector] mut_mapM_: OK (0.01s)
  8497. 954.56 s [vector] +++ OK, passed 100 tests.
  8498. 954.58 s [vector] mut_imapM_: OK (0.01s)
  8499. 954.58 s [vector] +++ OK, passed 100 tests.
  8500. 954.58 s [vector] mut_forM_: OK (0.01s)
  8501. 954.58 s [vector] +++ OK, passed 100 tests.
  8502. 954.59 s [vector] mut_iforM_: OK (0.01s)
  8503. 954.59 s [vector] +++ OK, passed 100 tests.
  8504. 954.59 s [vector] mut_foldr: OK
  8505. 954.59 s [vector] +++ OK, passed 100 tests.
  8506. 954.60 s [vector] mut_foldr': OK
  8507. 954.60 s [vector] +++ OK, passed 100 tests.
  8508. 954.60 s [vector] mut_foldl: OK
  8509. 954.60 s [vector] +++ OK, passed 100 tests.
  8510. 954.60 s [vector] mut_foldl': OK
  8511. 954.60 s [vector] +++ OK, passed 100 tests.
  8512. 954.60 s [vector] mut_ifoldr: OK
  8513. 954.60 s [vector] +++ OK, passed 100 tests.
  8514. 954.61 s [vector] mut_ifoldr': OK
  8515. 954.61 s [vector] +++ OK, passed 100 tests.
  8516. 954.61 s [vector] mut_ifoldl: OK
  8517. 954.61 s [vector] +++ OK, passed 100 tests.
  8518. 954.61 s [vector] mut_ifoldl': OK
  8519. 954.61 s [vector] +++ OK, passed 100 tests.
  8520. 954.61 s [vector] mut_foldM: OK
  8521. 954.61 s [vector] +++ OK, passed 100 tests.
  8522. 954.61 s [vector] mut_foldM': OK
  8523. 954.61 s [vector] +++ OK, passed 100 tests.
  8524. 954.62 s [vector] mut_foldrM: OK
  8525. 954.62 s [vector] +++ OK, passed 100 tests.
  8526. 954.62 s [vector] mut_foldrM': OK
  8527. 954.62 s [vector] +++ OK, passed 100 tests.
  8528. 954.62 s [vector] mut_ifoldM: OK
  8529. 954.62 s [vector] +++ OK, passed 100 tests.
  8530. 954.62 s [vector] mut_ifoldM': OK
  8531. 954.63 s [vector] +++ OK, passed 100 tests.
  8532. 954.63 s [vector] mut_ifoldrM: OK
  8533. 954.63 s [vector] +++ OK, passed 100 tests.
  8534. 954.63 s [vector] mut_ifoldrM': OK
  8535. 954.63 s [vector] +++ OK, passed 100 tests.
  8536. 954.63 s [vector] compare: OK
  8537. 954.63 s [vector] +++ OK, passed 100 tests.
  8538. 954.63 s [vector] maximum: OK
  8539. 954.63 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8540. 954.63 s [vector] minimum: OK
  8541. 954.63 s [vector] +++ OK, passed 100 tests; 11 discarded.
  8542. 954.63 s [vector] minIndex: OK
  8543. 954.63 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8544. 954.63 s [vector] maxIndex: OK
  8545. 954.63 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8546. 954.63 s [vector] maximumBy: OK
  8547. 954.63 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8548. 954.64 s [vector] minimumBy: OK
  8549. 954.64 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8550. 954.64 s [vector] maximumOn: OK
  8551. 954.64 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8552. 954.64 s [vector] minimumOn: OK
  8553. 954.64 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8554. 954.64 s [vector] maxIndexBy: OK
  8555. 954.64 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8556. 954.64 s [vector] minIndexBy: OK
  8557. 954.64 s [vector] +++ OK, passed 100 tests; 21 discarded.
  8558. 954.64 s [vector] ListFirstMaxIndexWins: OK
  8559. 954.64 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8560. 954.64 s [vector] FalseListFirstMaxIndexWins: OK
  8561. 954.64 s [vector] +++ OK, failed as expected. (after 1 test):
  8562. 954.64 s [vector] Exception:
  8563. 954.64 s [vector] Prelude.foldr1: empty list
  8564. 954.64 s [vector] CallStack (from HasCallStack):
  8565. 954.64 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  8566. 954.64 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  8567. 954.64 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  8568. 954.64 s [vector] []
  8569. 954.65 s [vector] zip: OK
  8570. 954.65 s [vector] +++ OK, passed 100 tests.
  8571. 954.65 s [vector] zip3: OK
  8572. 954.65 s [vector] +++ OK, passed 100 tests.
  8573. 954.65 s [vector] unzip: OK
  8574. 954.65 s [vector] +++ OK, passed 100 tests.
  8575. 954.65 s [vector] unzip3: OK
  8576. 954.65 s [vector] +++ OK, passed 100 tests.
  8577. 954.65 s [vector] indexed: OK
  8578. 954.65 s [vector] +++ OK, passed 100 tests.
  8579. 954.65 s [vector] update: OK
  8580. 954.65 s [vector] +++ OK, passed 100 tests.
  8581. 954.65 s [vector] mempty: OK
  8582. 954.66 s [vector] +++ OK, passed 100 tests.
  8583. 954.66 s [vector] mappend: OK
  8584. 954.66 s [vector] +++ OK, passed 100 tests.
  8585. 954.67 s [vector] mconcat: OK (0.01s)
  8586. 954.67 s [vector] +++ OK, passed 100 tests.
  8587. 954.67 s [vector] glength: OK
  8588. 954.67 s [vector] +++ OK, passed 100 tests.
  8589. 954.67 s [vector] and: OK
  8590. 954.67 s [vector] +++ OK, passed 100 tests.
  8591. 954.67 s [vector] or: OK
  8592. 954.67 s [vector] +++ OK, passed 100 tests.
  8593. 954.67 s [vector] (Int)
  8594. 954.67 s [vector] fromList.toList == id: OK
  8595. 954.67 s [vector] +++ OK, passed 100 tests.
  8596. 954.67 s [vector] toList.fromList == id: OK
  8597. 954.67 s [vector] +++ OK, passed 100 tests.
  8598. 954.67 s [vector] unstream.stream == id: OK
  8599. 954.67 s [vector] +++ OK, passed 100 tests.
  8600. 954.67 s [vector] stream.unstream == id: OK
  8601. 954.67 s [vector] +++ OK, passed 100 tests.
  8602. 954.67 s [vector] eq: OK
  8603. 954.67 s [vector] +++ OK, passed 100 tests.
  8604. 954.67 s [vector] length: OK
  8605. 954.67 s [vector] +++ OK, passed 100 tests.
  8606. 954.67 s [vector] null: OK
  8607. 954.67 s [vector] +++ OK, passed 100 tests.
  8608. 954.67 s [vector] index: OK
  8609. 954.67 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8610. 954.67 s [vector] safeIndex: OK
  8611. 954.67 s [vector] +++ OK, passed 100 tests.
  8612. 954.67 s [vector] head: OK
  8613. 954.67 s [vector] +++ OK, passed 100 tests; 11 discarded.
  8614. 954.67 s [vector] last: OK
  8615. 954.67 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8616. 954.67 s [vector] unsafeIndex: OK
  8617. 954.67 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8618. 954.67 s [vector] unsafeHead: OK
  8619. 954.67 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8620. 954.68 s [vector] unsafeLast: OK
  8621. 954.68 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8622. 954.68 s [vector] slice: OK
  8623. 954.68 s [vector] +++ OK, passed 100 tests.
  8624. 954.68 s [vector] init: OK
  8625. 954.68 s [vector] +++ OK, passed 100 tests; 10 discarded.
  8626. 954.68 s [vector] tail: OK
  8627. 954.68 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8628. 954.68 s [vector] take: OK
  8629. 954.68 s [vector] +++ OK, passed 100 tests.
  8630. 954.68 s [vector] drop: OK
  8631. 954.68 s [vector] +++ OK, passed 100 tests.
  8632. 954.68 s [vector] splitAt: OK
  8633. 954.68 s [vector] +++ OK, passed 100 tests.
  8634. 954.68 s [vector] empty: OK
  8635. 954.68 s [vector] +++ OK, passed 100 tests.
  8636. 954.68 s [vector] singleton: OK
  8637. 954.68 s [vector] +++ OK, passed 100 tests.
  8638. 954.68 s [vector] replicate: OK
  8639. 954.68 s [vector] +++ OK, passed 100 tests.
  8640. 954.68 s [vector] generate: OK
  8641. 954.68 s [vector] +++ OK, passed 100 tests.
  8642. 954.68 s [vector] iterateN: OK
  8643. 954.68 s [vector] +++ OK, passed 100 tests.
  8644. 954.72 s [vector] iterateNM: OK (0.04s)
  8645. 954.72 s [vector] +++ OK, passed 100 tests.
  8646. 954.74 s [vector] generateM: OK (0.02s)
  8647. 954.74 s [vector] +++ OK, passed 100 tests.
  8648. 954.75 s [vector] replicateM: OK
  8649. 954.75 s [vector] +++ OK, passed 100 tests.
  8650. 954.75 s [vector] create: OK
  8651. 954.75 s [vector] +++ OK, passed 100 tests.
  8652. 954.75 s [vector] createT: OK
  8653. 954.75 s [vector] +++ OK, passed 100 tests.
  8654. 954.75 s [vector] unfoldr: OK
  8655. 954.75 s [vector] +++ OK, passed 100 tests.
  8656. 954.75 s [vector] unfoldrN: OK
  8657. 954.75 s [vector] +++ OK, passed 100 tests.
  8658. 954.75 s [vector] unfoldrExactN: OK
  8659. 954.76 s [vector] +++ OK, passed 100 tests.
  8660. 954.76 s [vector] unfoldrM: OK (0.01s)
  8661. 954.76 s [vector] +++ OK, passed 100 tests.
  8662. 954.76 s [vector] unfoldrNM: OK
  8663. 954.78 s [vector] +++ OK, passed 100 tests.
  8664. 954.79 s [vector] unfoldrExactNM: OK (0.02s)
  8665. 954.79 s [vector] +++ OK, passed 100 tests.
  8666. 954.79 s [vector] constructN: OK
  8667. 954.79 s [vector] +++ OK, passed 100 tests.
  8668. 954.80 s [vector] constructrN: OK
  8669. 954.80 s [vector] +++ OK, passed 100 tests.
  8670. 954.80 s [vector] cons: OK
  8671. 954.80 s [vector] +++ OK, passed 100 tests.
  8672. 954.80 s [vector] snoc: OK
  8673. 954.80 s [vector] +++ OK, passed 100 tests.
  8674. 954.80 s [vector] append: OK
  8675. 954.80 s [vector] +++ OK, passed 100 tests.
  8676. 954.81 s [vector] concat: OK (0.01s)
  8677. 954.81 s [vector] +++ OK, passed 100 tests.
  8678. 954.81 s [vector] force: OK
  8679. 954.81 s [vector] +++ OK, passed 100 tests.
  8680. 954.81 s [vector] upd: OK
  8681. 954.82 s [vector] +++ OK, passed 100 tests.
  8682. 954.82 s [vector] accum: OK
  8683. 954.82 s [vector] +++ OK, passed 100 tests.
  8684. 954.82 s [vector] reverse: OK
  8685. 954.82 s [vector] +++ OK, passed 100 tests.
  8686. 954.82 s [vector] backpermute: OK
  8687. 954.82 s [vector] +++ OK, passed 100 tests.
  8688. 954.82 s [vector] map: OK
  8689. 954.82 s [vector] +++ OK, passed 100 tests.
  8690. 954.82 s [vector] imap: OK
  8691. 954.83 s [vector] +++ OK, passed 100 tests.
  8692. 954.83 s [vector] concatMap: OK
  8693. 954.84 s [vector] +++ OK, passed 100 tests.
  8694. 954.84 s [vector] mapM: OK
  8695. 954.84 s [vector] +++ OK, passed 100 tests.
  8696. 954.85 s [vector] mapM_: OK (0.02s)
  8697. 954.85 s [vector] +++ OK, passed 100 tests.
  8698. 954.85 s [vector] forM: OK
  8699. 954.85 s [vector] +++ OK, passed 100 tests.
  8700. 954.87 s [vector] forM_: OK
  8701. 954.87 s [vector] +++ OK, passed 100 tests.
  8702. 954.87 s [vector] imapM: OK
  8703. 954.87 s [vector] +++ OK, passed 100 tests.
  8704. 954.89 s [vector] imapM_: OK (0.02s)
  8705. 954.89 s [vector] +++ OK, passed 100 tests.
  8706. 954.90 s [vector] zipWith: OK
  8707. 954.90 s [vector] +++ OK, passed 100 tests.
  8708. 954.90 s [vector] zipWith3: OK
  8709. 954.90 s [vector] +++ OK, passed 100 tests.
  8710. 954.90 s [vector] izipWith: OK
  8711. 954.90 s [vector] +++ OK, passed 100 tests.
  8712. 954.90 s [vector] izipWith3: OK
  8713. 954.90 s [vector] +++ OK, passed 100 tests.
  8714. 954.92 s [vector] izipWithM: OK
  8715. 954.92 s [vector] +++ OK, passed 100 tests.
  8716. 954.92 s [vector] izipWithM_: OK (0.01s)
  8717. 954.92 s [vector] +++ OK, passed 100 tests.
  8718. 954.94 s [vector] zipWithM: OK
  8719. 954.94 s [vector] +++ OK, passed 100 tests.
  8720. 954.94 s [vector] zipWithM_: OK (0.01s)
  8721. 954.94 s [vector] +++ OK, passed 100 tests.
  8722. 954.94 s [vector] filter: OK
  8723. 954.94 s [vector] +++ OK, passed 100 tests.
  8724. 954.94 s [vector] ifilter: OK
  8725. 954.94 s [vector] +++ OK, passed 100 tests.
  8726. 954.97 s [vector] filterM: OK (0.03s)
  8727. 954.97 s [vector] +++ OK, passed 100 tests.
  8728. 954.97 s [vector] uniq: OK
  8729. 954.97 s [vector] +++ OK, passed 100 tests.
  8730. 954.97 s [vector] mapMaybe: OK
  8731. 954.97 s [vector] +++ OK, passed 100 tests.
  8732. 954.97 s [vector] imapMaybe: OK
  8733. 954.97 s [vector] +++ OK, passed 100 tests.
  8734. 954.97 s [vector] takeWhile: OK
  8735. 954.98 s [vector] +++ OK, passed 100 tests.
  8736. 954.98 s [vector] dropWhile: OK
  8737. 954.98 s [vector] +++ OK, passed 100 tests.
  8738. 954.98 s [vector] partition: OK
  8739. 954.98 s [vector] +++ OK, passed 100 tests.
  8740. 954.98 s [vector] partitionWith: OK
  8741. 954.98 s [vector] +++ OK, passed 100 tests.
  8742. 954.98 s [vector] span: OK
  8743. 954.98 s [vector] +++ OK, passed 100 tests.
  8744. 954.98 s [vector] break: OK
  8745. 954.98 s [vector] +++ OK, passed 100 tests.
  8746. 954.98 s [vector] spanR: OK
  8747. 954.98 s [vector] +++ OK, passed 100 tests.
  8748. 954.98 s [vector] breakR: OK
  8749. 954.98 s [vector] +++ OK, passed 100 tests.
  8750. 954.99 s [vector] groupBy: OK
  8751. 954.99 s [vector] +++ OK, passed 100 tests.
  8752. 954.99 s [vector] elem: OK
  8753. 954.99 s [vector] +++ OK, passed 100 tests.
  8754. 954.99 s [vector] notElem: OK
  8755. 954.99 s [vector] +++ OK, passed 100 tests.
  8756. 954.99 s [vector] find: OK
  8757. 954.99 s [vector] +++ OK, passed 100 tests.
  8758. 954.99 s [vector] findIndex: OK
  8759. 954.99 s [vector] +++ OK, passed 100 tests.
  8760. 954.99 s [vector] findIndexR: OK
  8761. 954.99 s [vector] +++ OK, passed 100 tests.
  8762. 954.99 s [vector] findIndices: OK
  8763. 954.99 s [vector] +++ OK, passed 100 tests.
  8764. 954.99 s [vector] elemIndex: OK
  8765. 954.99 s [vector] +++ OK, passed 100 tests.
  8766. 955.00 s [vector] elemIndices: OK
  8767. 955.00 s [vector] +++ OK, passed 100 tests.
  8768. 955.00 s [vector] foldl: OK
  8769. 955.00 s [vector] +++ OK, passed 100 tests.
  8770. 955.00 s [vector] foldl1: OK
  8771. 955.00 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8772. 955.00 s [vector] foldl': OK
  8773. 955.00 s [vector] +++ OK, passed 100 tests.
  8774. 955.01 s [vector] foldl1': OK
  8775. 955.01 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8776. 955.01 s [vector] foldr: OK
  8777. 955.01 s [vector] +++ OK, passed 100 tests.
  8778. 955.01 s [vector] foldr1: OK
  8779. 955.01 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8780. 955.01 s [vector] foldr': OK
  8781. 955.02 s [vector] +++ OK, passed 100 tests.
  8782. 955.02 s [vector] foldr1': OK
  8783. 955.02 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8784. 955.02 s [vector] ifoldl: OK
  8785. 955.02 s [vector] +++ OK, passed 100 tests.
  8786. 955.02 s [vector] ifoldl': OK
  8787. 955.02 s [vector] +++ OK, passed 100 tests.
  8788. 955.02 s [vector] ifoldr: OK
  8789. 955.02 s [vector] +++ OK, passed 100 tests.
  8790. 955.03 s [vector] ifoldr': OK
  8791. 955.04 s [vector] +++ OK, passed 100 tests.
  8792. 955.04 s [vector] ifoldM: OK
  8793. 955.04 s [vector] +++ OK, passed 100 tests.
  8794. 955.04 s [vector] ifoldM': OK
  8795. 955.04 s [vector] +++ OK, passed 100 tests.
  8796. 955.06 s [vector] ifoldM_: OK (0.02s)
  8797. 955.06 s [vector] +++ OK, passed 100 tests.
  8798. 955.08 s [vector] ifoldM'_: OK (0.02s)
  8799. 955.08 s [vector] +++ OK, passed 100 tests.
  8800. 955.08 s [vector] all: OK
  8801. 955.08 s [vector] +++ OK, passed 100 tests.
  8802. 955.08 s [vector] any: OK
  8803. 955.08 s [vector] +++ OK, passed 100 tests.
  8804. 955.08 s [vector] prescanl: OK
  8805. 955.08 s [vector] +++ OK, passed 100 tests.
  8806. 955.08 s [vector] prescanl': OK
  8807. 955.08 s [vector] +++ OK, passed 100 tests.
  8808. 955.09 s [vector] postscanl: OK
  8809. 955.09 s [vector] +++ OK, passed 100 tests.
  8810. 955.09 s [vector] postscanl': OK
  8811. 955.09 s [vector] +++ OK, passed 100 tests.
  8812. 955.09 s [vector] scanl: OK
  8813. 955.09 s [vector] +++ OK, passed 100 tests.
  8814. 955.10 s [vector] scanl': OK
  8815. 955.10 s [vector] +++ OK, passed 100 tests.
  8816. 955.10 s [vector] scanl1: OK
  8817. 955.10 s [vector] +++ OK, passed 100 tests.
  8818. 955.10 s [vector] scanl1': OK
  8819. 955.10 s [vector] +++ OK, passed 100 tests.
  8820. 955.10 s [vector] iscanl: OK
  8821. 955.10 s [vector] +++ OK, passed 100 tests.
  8822. 955.11 s [vector] iscanl': OK
  8823. 955.11 s [vector] +++ OK, passed 100 tests.
  8824. 955.11 s [vector] prescanr: OK
  8825. 955.11 s [vector] +++ OK, passed 100 tests.
  8826. 955.11 s [vector] prescanr': OK
  8827. 955.11 s [vector] +++ OK, passed 100 tests.
  8828. 955.12 s [vector] postscanr: OK
  8829. 955.12 s [vector] +++ OK, passed 100 tests.
  8830. 955.12 s [vector] postscanr': OK
  8831. 955.12 s [vector] +++ OK, passed 100 tests.
  8832. 955.12 s [vector] scanr: OK
  8833. 955.13 s [vector] +++ OK, passed 100 tests.
  8834. 955.13 s [vector] scanr': OK
  8835. 955.13 s [vector] +++ OK, passed 100 tests.
  8836. 955.13 s [vector] scanr1: OK
  8837. 955.13 s [vector] +++ OK, passed 100 tests.
  8838. 955.13 s [vector] scanr1': OK
  8839. 955.14 s [vector] +++ OK, passed 100 tests.
  8840. 955.14 s [vector] iscanr: OK
  8841. 955.14 s [vector] +++ OK, passed 100 tests.
  8842. 955.14 s [vector] iscanr': OK
  8843. 955.14 s [vector] +++ OK, passed 100 tests.
  8844. 955.14 s [vector] mut_read: OK
  8845. 955.14 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8846. 955.14 s [vector] mut_write: OK
  8847. 955.14 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8848. 955.14 s [vector] mut_modify: OK
  8849. 955.14 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8850. 955.16 s [vector] mut_generate: OK
  8851. 955.16 s [vector] +++ OK, passed 100 tests.
  8852. 955.16 s [vector] mut_generateM: OK (0.01s)
  8853. 955.16 s [vector] +++ OK, passed 100 tests.
  8854. 955.18 s [vector] mut_mapM_: OK (0.02s)
  8855. 955.18 s [vector] +++ OK, passed 100 tests.
  8856. 955.20 s [vector] mut_imapM_: OK (0.02s)
  8857. 955.20 s [vector] +++ OK, passed 100 tests.
  8858. 955.22 s [vector] mut_forM_: OK (0.02s)
  8859. 955.23 s [vector] +++ OK, passed 100 tests.
  8860. 955.23 s [vector] mut_iforM_: OK (0.02s)
  8861. 955.23 s [vector] +++ OK, passed 100 tests.
  8862. 955.23 s [vector] mut_foldr: OK
  8863. 955.23 s [vector] +++ OK, passed 100 tests.
  8864. 955.23 s [vector] mut_foldr': OK
  8865. 955.23 s [vector] +++ OK, passed 100 tests.
  8866. 955.23 s [vector] mut_foldl: OK
  8867. 955.23 s [vector] +++ OK, passed 100 tests.
  8868. 955.24 s [vector] mut_foldl': OK
  8869. 955.24 s [vector] +++ OK, passed 100 tests.
  8870. 955.24 s [vector] mut_ifoldr: OK
  8871. 955.24 s [vector] +++ OK, passed 100 tests.
  8872. 955.24 s [vector] mut_ifoldr': OK
  8873. 955.24 s [vector] +++ OK, passed 100 tests.
  8874. 955.25 s [vector] mut_ifoldl: OK
  8875. 955.25 s [vector] +++ OK, passed 100 tests.
  8876. 955.25 s [vector] mut_ifoldl': OK
  8877. 955.26 s [vector] +++ OK, passed 100 tests.
  8878. 955.26 s [vector] mut_foldM: OK
  8879. 955.26 s [vector] +++ OK, passed 100 tests.
  8880. 955.26 s [vector] mut_foldM': OK
  8881. 955.26 s [vector] +++ OK, passed 100 tests.
  8882. 955.26 s [vector] mut_foldrM: OK
  8883. 955.26 s [vector] +++ OK, passed 100 tests.
  8884. 955.26 s [vector] mut_foldrM': OK
  8885. 955.26 s [vector] +++ OK, passed 100 tests.
  8886. 955.27 s [vector] mut_ifoldM: OK
  8887. 955.27 s [vector] +++ OK, passed 100 tests.
  8888. 955.27 s [vector] mut_ifoldM': OK
  8889. 955.27 s [vector] +++ OK, passed 100 tests.
  8890. 955.28 s [vector] mut_ifoldrM: OK
  8891. 955.28 s [vector] +++ OK, passed 100 tests.
  8892. 955.28 s [vector] mut_ifoldrM': OK
  8893. 955.28 s [vector] +++ OK, passed 100 tests.
  8894. 955.28 s [vector] compare: OK
  8895. 955.28 s [vector] +++ OK, passed 100 tests.
  8896. 955.28 s [vector] maximum: OK
  8897. 955.28 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8898. 955.28 s [vector] minimum: OK
  8899. 955.28 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8900. 955.28 s [vector] minIndex: OK
  8901. 955.28 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8902. 955.28 s [vector] maxIndex: OK
  8903. 955.28 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8904. 955.28 s [vector] maximumBy: OK
  8905. 955.28 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8906. 955.28 s [vector] minimumBy: OK
  8907. 955.28 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8908. 955.28 s [vector] maximumOn: OK
  8909. 955.28 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8910. 955.28 s [vector] minimumOn: OK
  8911. 955.28 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8912. 955.28 s [vector] maxIndexBy: OK
  8913. 955.28 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8914. 955.29 s [vector] minIndexBy: OK
  8915. 955.29 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8916. 955.29 s [vector] ListFirstMaxIndexWins: OK
  8917. 955.29 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8918. 955.29 s [vector] FalseListFirstMaxIndexWins: OK
  8919. 955.29 s [vector] +++ OK, failed as expected. (after 1 test):
  8920. 955.29 s [vector] Exception:
  8921. 955.29 s [vector] Prelude.foldr1: empty list
  8922. 955.29 s [vector] CallStack (from HasCallStack):
  8923. 955.29 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  8924. 955.29 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  8925. 955.29 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  8926. 955.29 s [vector] []
  8927. 955.29 s [vector] zip: OK
  8928. 955.29 s [vector] +++ OK, passed 100 tests.
  8929. 955.29 s [vector] zip3: OK
  8930. 955.29 s [vector] +++ OK, passed 100 tests.
  8931. 955.29 s [vector] unzip: OK
  8932. 955.29 s [vector] +++ OK, passed 100 tests.
  8933. 955.30 s [vector] unzip3: OK
  8934. 955.30 s [vector] +++ OK, passed 100 tests.
  8935. 955.30 s [vector] indexed: OK
  8936. 955.30 s [vector] +++ OK, passed 100 tests.
  8937. 955.30 s [vector] update: OK
  8938. 955.30 s [vector] +++ OK, passed 100 tests.
  8939. 955.30 s [vector] mempty: OK
  8940. 955.30 s [vector] +++ OK, passed 100 tests.
  8941. 955.30 s [vector] mappend: OK
  8942. 955.30 s [vector] +++ OK, passed 100 tests.
  8943. 955.32 s [vector] mconcat: OK (0.02s)
  8944. 955.32 s [vector] +++ OK, passed 100 tests.
  8945. 955.32 s [vector] glength: OK
  8946. 955.32 s [vector] +++ OK, passed 100 tests.
  8947. 955.32 s [vector] sum: OK
  8948. 955.32 s [vector] +++ OK, passed 100 tests.
  8949. 955.32 s [vector] product: OK
  8950. 955.32 s [vector] +++ OK, passed 100 tests.
  8951. 955.32 s [vector] enumFromN: OK
  8952. 955.32 s [vector] +++ OK, passed 100 tests.
  8953. 955.32 s [vector] enumFromThenN: OK
  8954. 955.32 s [vector] +++ OK, passed 100 tests.
  8955. 955.32 s [vector] enumFromTo: OK
  8956. 955.32 s [vector] +++ OK, passed 100 tests.
  8957. 955.32 s [vector] enumFromThenTo: OK
  8958. 955.32 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8959. 955.32 s [vector] (Float)
  8960. 955.32 s [vector] fromList.toList == id: OK
  8961. 955.32 s [vector] +++ OK, passed 100 tests.
  8962. 955.32 s [vector] toList.fromList == id: OK
  8963. 955.32 s [vector] +++ OK, passed 100 tests.
  8964. 955.32 s [vector] unstream.stream == id: OK
  8965. 955.33 s [vector] +++ OK, passed 100 tests.
  8966. 955.33 s [vector] stream.unstream == id: OK
  8967. 955.33 s [vector] +++ OK, passed 100 tests.
  8968. 955.33 s [vector] eq: OK
  8969. 955.33 s [vector] +++ OK, passed 100 tests.
  8970. 955.33 s [vector] length: OK
  8971. 955.33 s [vector] +++ OK, passed 100 tests.
  8972. 955.33 s [vector] null: OK
  8973. 955.33 s [vector] +++ OK, passed 100 tests.
  8974. 955.33 s [vector] index: OK
  8975. 955.33 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8976. 955.33 s [vector] safeIndex: OK
  8977. 955.33 s [vector] +++ OK, passed 100 tests.
  8978. 955.33 s [vector] head: OK
  8979. 955.33 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8980. 955.33 s [vector] last: OK
  8981. 955.33 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8982. 955.33 s [vector] unsafeIndex: OK
  8983. 955.33 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8984. 955.33 s [vector] unsafeHead: OK
  8985. 955.33 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8986. 955.33 s [vector] unsafeLast: OK
  8987. 955.33 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8988. 955.34 s [vector] slice: OK
  8989. 955.34 s [vector] +++ OK, passed 100 tests.
  8990. 955.34 s [vector] init: OK
  8991. 955.34 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8992. 955.34 s [vector] tail: OK
  8993. 955.34 s [vector] +++ OK, passed 100 tests; 25 discarded.
  8994. 955.34 s [vector] take: OK
  8995. 955.34 s [vector] +++ OK, passed 100 tests.
  8996. 955.34 s [vector] drop: OK
  8997. 955.34 s [vector] +++ OK, passed 100 tests.
  8998. 955.34 s [vector] splitAt: OK
  8999. 955.34 s [vector] +++ OK, passed 100 tests.
  9000. 955.34 s [vector] empty: OK
  9001. 955.34 s [vector] +++ OK, passed 100 tests.
  9002. 955.34 s [vector] singleton: OK
  9003. 955.34 s [vector] +++ OK, passed 100 tests.
  9004. 955.34 s [vector] replicate: OK
  9005. 955.34 s [vector] +++ OK, passed 100 tests.
  9006. 955.34 s [vector] generate: OK
  9007. 955.34 s [vector] +++ OK, passed 100 tests.
  9008. 955.36 s [vector] iterateN: OK
  9009. 955.36 s [vector] +++ OK, passed 100 tests.
  9010. 955.38 s [vector] iterateNM: OK (0.03s)
  9011. 955.38 s [vector] +++ OK, passed 100 tests.
  9012. 955.40 s [vector] generateM: OK (0.02s)
  9013. 955.40 s [vector] +++ OK, passed 100 tests.
  9014. 955.41 s [vector] replicateM: OK
  9015. 955.41 s [vector] +++ OK, passed 100 tests.
  9016. 955.41 s [vector] create: OK
  9017. 955.41 s [vector] +++ OK, passed 100 tests.
  9018. 955.41 s [vector] createT: OK
  9019. 955.41 s [vector] +++ OK, passed 100 tests.
  9020. 955.41 s [vector] unfoldr: OK
  9021. 955.41 s [vector] +++ OK, passed 100 tests.
  9022. 955.41 s [vector] unfoldrN: OK
  9023. 955.42 s [vector] +++ OK, passed 100 tests.
  9024. 955.42 s [vector] unfoldrExactN: OK
  9025. 955.42 s [vector] +++ OK, passed 100 tests.
  9026. 955.42 s [vector] unfoldrM: OK
  9027. 955.42 s [vector] +++ OK, passed 100 tests.
  9028. 955.42 s [vector] unfoldrNM: OK
  9029. 955.42 s [vector] +++ OK, passed 100 tests.
  9030. 955.48 s [vector] unfoldrExactNM: OK (0.05s)
  9031. 955.48 s [vector] +++ OK, passed 100 tests.
  9032. 955.48 s [vector] constructN: OK
  9033. 955.48 s [vector] +++ OK, passed 100 tests.
  9034. 955.48 s [vector] constructrN: OK
  9035. 955.49 s [vector] +++ OK, passed 100 tests.
  9036. 955.49 s [vector] cons: OK
  9037. 955.49 s [vector] +++ OK, passed 100 tests.
  9038. 955.50 s [vector] snoc: OK
  9039. 955.50 s [vector] +++ OK, passed 100 tests.
  9040. 955.50 s [vector] append: OK
  9041. 955.50 s [vector] +++ OK, passed 100 tests.
  9042. 955.51 s [vector] concat: OK (0.02s)
  9043. 955.51 s [vector] +++ OK, passed 100 tests.
  9044. 955.52 s [vector] force: OK
  9045. 955.52 s [vector] +++ OK, passed 100 tests.
  9046. 955.53 s [vector] upd: OK
  9047. 955.53 s [vector] +++ OK, passed 100 tests.
  9048. 955.54 s [vector] accum: OK (0.01s)
  9049. 955.54 s [vector] +++ OK, passed 100 tests.
  9050. 955.54 s [vector] reverse: OK
  9051. 955.55 s [vector] +++ OK, passed 100 tests.
  9052. 955.55 s [vector] backpermute: OK
  9053. 955.55 s [vector] +++ OK, passed 100 tests.
  9054. 955.55 s [vector] map: OK
  9055. 955.55 s [vector] +++ OK, passed 100 tests.
  9056. 955.55 s [vector] imap: OK
  9057. 955.55 s [vector] +++ OK, passed 100 tests.
  9058. 955.55 s [vector] concatMap: OK
  9059. 955.55 s [vector] +++ OK, passed 100 tests.
  9060. 955.56 s [vector] mapM: OK
  9061. 955.56 s [vector] +++ OK, passed 100 tests.
  9062. 955.58 s [vector] mapM_: OK (0.02s)
  9063. 955.58 s [vector] +++ OK, passed 100 tests.
  9064. 955.59 s [vector] forM: OK
  9065. 955.59 s [vector] +++ OK, passed 100 tests.
  9066. 955.63 s [vector] forM_: OK (0.04s)
  9067. 955.64 s [vector] +++ OK, passed 100 tests.
  9068. 955.64 s [vector] imapM: OK
  9069. 955.65 s [vector] +++ OK, passed 100 tests.
  9070. 955.66 s [vector] imapM_: OK (0.03s)
  9071. 955.66 s [vector] +++ OK, passed 100 tests.
  9072. 955.67 s [vector] zipWith: OK
  9073. 955.68 s [vector] +++ OK, passed 100 tests.
  9074. 955.68 s [vector] zipWith3: OK
  9075. 955.68 s [vector] +++ OK, passed 100 tests.
  9076. 955.68 s [vector] izipWith: OK
  9077. 955.68 s [vector] +++ OK, passed 100 tests.
  9078. 955.69 s [vector] izipWith3: OK
  9079. 955.69 s [vector] +++ OK, passed 100 tests.
  9080. 955.70 s [vector] izipWithM: OK
  9081. 955.70 s [vector] +++ OK, passed 100 tests.
  9082. 955.73 s [vector] izipWithM_: OK (0.03s)
  9083. 955.74 s [vector] +++ OK, passed 100 tests.
  9084. 955.74 s [vector] zipWithM: OK
  9085. 955.74 s [vector] +++ OK, passed 100 tests.
  9086. 955.77 s [vector] zipWithM_: OK (0.03s)
  9087. 955.77 s [vector] +++ OK, passed 100 tests.
  9088. 955.78 s [vector] filter: OK
  9089. 955.78 s [vector] +++ OK, passed 100 tests.
  9090. 955.79 s [vector] ifilter: OK
  9091. 955.79 s [vector] +++ OK, passed 100 tests.
  9092. 955.81 s [vector] filterM: OK (0.04s)
  9093. 955.81 s [vector] +++ OK, passed 100 tests.
  9094. 955.81 s [vector] uniq: OK
  9095. 955.81 s [vector] +++ OK, passed 100 tests.
  9096. 955.82 s [vector] mapMaybe: OK
  9097. 955.82 s [vector] +++ OK, passed 100 tests.
  9098. 955.83 s [vector] imapMaybe: OK
  9099. 955.83 s [vector] +++ OK, passed 100 tests.
  9100. 955.83 s [vector] takeWhile: OK
  9101. 955.84 s [vector] +++ OK, passed 100 tests.
  9102. 955.84 s [vector] dropWhile: OK
  9103. 955.84 s [vector] +++ OK, passed 100 tests.
  9104. 955.84 s [vector] partition: OK
  9105. 955.84 s [vector] +++ OK, passed 100 tests.
  9106. 955.84 s [vector] partitionWith: OK
  9107. 955.84 s [vector] +++ OK, passed 100 tests.
  9108. 955.84 s [vector] span: OK
  9109. 955.84 s [vector] +++ OK, passed 100 tests.
  9110. 955.84 s [vector] break: OK
  9111. 955.84 s [vector] +++ OK, passed 100 tests.
  9112. 955.84 s [vector] spanR: OK
  9113. 955.84 s [vector] +++ OK, passed 100 tests.
  9114. 955.85 s [vector] breakR: OK
  9115. 955.85 s [vector] +++ OK, passed 100 tests.
  9116. 955.85 s [vector] groupBy: OK
  9117. 955.85 s [vector] +++ OK, passed 100 tests.
  9118. 955.85 s [vector] elem: OK
  9119. 955.85 s [vector] +++ OK, passed 100 tests.
  9120. 955.85 s [vector] notElem: OK
  9121. 955.85 s [vector] +++ OK, passed 100 tests.
  9122. 955.86 s [vector] find: OK
  9123. 955.86 s [vector] +++ OK, passed 100 tests.
  9124. 955.86 s [vector] findIndex: OK
  9125. 955.86 s [vector] +++ OK, passed 100 tests.
  9126. 955.86 s [vector] findIndexR: OK
  9127. 955.86 s [vector] +++ OK, passed 100 tests.
  9128. 955.86 s [vector] findIndices: OK
  9129. 955.86 s [vector] +++ OK, passed 100 tests.
  9130. 955.86 s [vector] elemIndex: OK
  9131. 955.86 s [vector] +++ OK, passed 100 tests.
  9132. 955.86 s [vector] elemIndices: OK
  9133. 955.86 s [vector] +++ OK, passed 100 tests.
  9134. 955.87 s [vector] foldl: OK
  9135. 955.87 s [vector] +++ OK, passed 100 tests.
  9136. 955.87 s [vector] foldl1: OK
  9137. 955.87 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9138. 955.88 s [vector] foldl': OK
  9139. 955.88 s [vector] +++ OK, passed 100 tests.
  9140. 955.89 s [vector] foldl1': OK
  9141. 955.89 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9142. 955.90 s [vector] foldr: OK
  9143. 955.90 s [vector] +++ OK, passed 100 tests.
  9144. 955.91 s [vector] foldr1: OK
  9145. 955.92 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9146. 955.92 s [vector] foldr': OK
  9147. 955.92 s [vector] +++ OK, passed 100 tests.
  9148. 955.93 s [vector] foldr1': OK
  9149. 955.94 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9150. 955.94 s [vector] ifoldl: OK
  9151. 955.94 s [vector] +++ OK, passed 100 tests.
  9152. 955.94 s [vector] ifoldl': OK
  9153. 955.94 s [vector] +++ OK, passed 100 tests.
  9154. 955.94 s [vector] ifoldr: OK
  9155. 955.94 s [vector] +++ OK, passed 100 tests.
  9156. 955.96 s [vector] ifoldr': OK
  9157. 955.96 s [vector] +++ OK, passed 100 tests.
  9158. 955.97 s [vector] ifoldM: OK
  9159. 955.98 s [vector] +++ OK, passed 100 tests.
  9160. 955.98 s [vector] ifoldM': OK
  9161. 955.99 s [vector] +++ OK, passed 100 tests.
  9162. 956.00 s [vector] ifoldM_: OK (0.04s)
  9163. 956.00 s [vector] +++ OK, passed 100 tests.
  9164. 956.04 s [vector] ifoldM'_: OK (0.04s)
  9165. 956.04 s [vector] +++ OK, passed 100 tests.
  9166. 956.04 s [vector] all: OK
  9167. 956.04 s [vector] +++ OK, passed 100 tests.
  9168. 956.04 s [vector] any: OK
  9169. 956.05 s [vector] +++ OK, passed 100 tests.
  9170. 956.06 s [vector] prescanl: OK
  9171. 956.06 s [vector] +++ OK, passed 100 tests.
  9172. 956.06 s [vector] prescanl': OK
  9173. 956.06 s [vector] +++ OK, passed 100 tests.
  9174. 956.07 s [vector] postscanl: OK
  9175. 956.07 s [vector] +++ OK, passed 100 tests.
  9176. 956.08 s [vector] postscanl': OK
  9177. 956.08 s [vector] +++ OK, passed 100 tests.
  9178. 956.08 s [vector] scanl: OK
  9179. 956.08 s [vector] +++ OK, passed 100 tests.
  9180. 956.09 s [vector] scanl': OK
  9181. 956.09 s [vector] +++ OK, passed 100 tests.
  9182. 956.10 s [vector] scanl1: OK
  9183. 956.10 s [vector] +++ OK, passed 100 tests.
  9184. 956.12 s [vector] scanl1': OK
  9185. 956.12 s [vector] +++ OK, passed 100 tests.
  9186. 956.12 s [vector] iscanl: OK (0.01s)
  9187. 956.12 s [vector] +++ OK, passed 100 tests.
  9188. 956.13 s [vector] iscanl': OK
  9189. 956.13 s [vector] +++ OK, passed 100 tests.
  9190. 956.13 s [vector] prescanr: OK
  9191. 956.13 s [vector] +++ OK, passed 100 tests.
  9192. 956.15 s [vector] prescanr': OK
  9193. 956.15 s [vector] +++ OK, passed 100 tests.
  9194. 956.15 s [vector] postscanr: OK
  9195. 956.16 s [vector] +++ OK, passed 100 tests.
  9196. 956.16 s [vector] postscanr': OK
  9197. 956.16 s [vector] +++ OK, passed 100 tests.
  9198. 956.17 s [vector] scanr: OK
  9199. 956.17 s [vector] +++ OK, passed 100 tests.
  9200. 956.18 s [vector] scanr': OK
  9201. 956.18 s [vector] +++ OK, passed 100 tests.
  9202. 956.18 s [vector] scanr1: OK
  9203. 956.18 s [vector] +++ OK, passed 100 tests.
  9204. 956.19 s [vector] scanr1': OK
  9205. 956.20 s [vector] +++ OK, passed 100 tests.
  9206. 956.20 s [vector] iscanr: OK
  9207. 956.20 s [vector] +++ OK, passed 100 tests.
  9208. 956.21 s [vector] iscanr': OK
  9209. 956.21 s [vector] +++ OK, passed 100 tests.
  9210. 956.21 s [vector] mut_read: OK
  9211. 956.21 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9212. 956.21 s [vector] mut_write: OK
  9213. 956.21 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9214. 956.21 s [vector] mut_modify: OK
  9215. 956.21 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9216. 956.21 s [vector] mut_generate: OK
  9217. 956.22 s [vector] +++ OK, passed 100 tests.
  9218. 956.24 s [vector] mut_generateM: OK (0.02s)
  9219. 956.24 s [vector] +++ OK, passed 100 tests.
  9220. 956.28 s [vector] mut_mapM_: OK (0.04s)
  9221. 956.28 s [vector] +++ OK, passed 100 tests.
  9222. 956.30 s [vector] mut_imapM_: OK (0.03s)
  9223. 956.30 s [vector] +++ OK, passed 100 tests.
  9224. 956.34 s [vector] mut_forM_: OK (0.04s)
  9225. 956.34 s [vector] +++ OK, passed 100 tests.
  9226. 956.38 s [vector] mut_iforM_: OK (0.03s)
  9227. 956.38 s [vector] +++ OK, passed 100 tests.
  9228. 956.38 s [vector] mut_foldr: OK
  9229. 956.38 s [vector] +++ OK, passed 100 tests.
  9230. 956.38 s [vector] mut_foldr': OK
  9231. 956.38 s [vector] +++ OK, passed 100 tests.
  9232. 956.39 s [vector] mut_foldl: OK
  9233. 956.39 s [vector] +++ OK, passed 100 tests.
  9234. 956.40 s [vector] mut_foldl': OK
  9235. 956.40 s [vector] +++ OK, passed 100 tests.
  9236. 956.41 s [vector] mut_ifoldr: OK
  9237. 956.41 s [vector] +++ OK, passed 100 tests.
  9238. 956.42 s [vector] mut_ifoldr': OK
  9239. 956.42 s [vector] +++ OK, passed 100 tests.
  9240. 956.44 s [vector] mut_ifoldl: OK (0.01s)
  9241. 956.44 s [vector] +++ OK, passed 100 tests.
  9242. 956.44 s [vector] mut_ifoldl': OK
  9243. 956.44 s [vector] +++ OK, passed 100 tests.
  9244. 956.44 s [vector] mut_foldM: OK
  9245. 956.45 s [vector] +++ OK, passed 100 tests.
  9246. 956.45 s [vector] mut_foldM': OK
  9247. 956.46 s [vector] +++ OK, passed 100 tests.
  9248. 956.46 s [vector] mut_foldrM: OK
  9249. 956.46 s [vector] +++ OK, passed 100 tests.
  9250. 956.48 s [vector] mut_foldrM': OK
  9251. 956.48 s [vector] +++ OK, passed 100 tests.
  9252. 956.48 s [vector] mut_ifoldM: OK
  9253. 956.48 s [vector] +++ OK, passed 100 tests.
  9254. 956.49 s [vector] mut_ifoldM': OK
  9255. 956.49 s [vector] +++ OK, passed 100 tests.
  9256. 956.50 s [vector] mut_ifoldrM: OK
  9257. 956.50 s [vector] +++ OK, passed 100 tests.
  9258. 956.50 s [vector] mut_ifoldrM': OK
  9259. 956.50 s [vector] +++ OK, passed 100 tests.
  9260. 956.50 s [vector] compare: OK
  9261. 956.50 s [vector] +++ OK, passed 100 tests.
  9262. 956.51 s [vector] maximum: OK
  9263. 956.51 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9264. 956.51 s [vector] minimum: OK
  9265. 956.51 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9266. 956.51 s [vector] minIndex: OK
  9267. 956.51 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9268. 956.51 s [vector] maxIndex: OK
  9269. 956.51 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9270. 956.51 s [vector] maximumBy: OK
  9271. 956.51 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9272. 956.51 s [vector] minimumBy: OK
  9273. 956.51 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9274. 956.51 s [vector] maximumOn: OK
  9275. 956.51 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9276. 956.51 s [vector] minimumOn: OK
  9277. 956.51 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9278. 956.51 s [vector] maxIndexBy: OK
  9279. 956.51 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9280. 956.51 s [vector] minIndexBy: OK
  9281. 956.51 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9282. 956.51 s [vector] ListFirstMaxIndexWins: OK
  9283. 956.51 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9284. 956.51 s [vector] FalseListFirstMaxIndexWins: OK
  9285. 956.51 s [vector] +++ OK, failed as expected. (after 1 test):
  9286. 956.51 s [vector] Exception:
  9287. 956.51 s [vector] Prelude.foldr1: empty list
  9288. 956.51 s [vector] CallStack (from HasCallStack):
  9289. 956.51 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  9290. 956.51 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  9291. 956.51 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  9292. 956.51 s [vector] []
  9293. 956.52 s [vector] zip: OK
  9294. 956.52 s [vector] +++ OK, passed 100 tests.
  9295. 956.52 s [vector] zip3: OK
  9296. 956.52 s [vector] +++ OK, passed 100 tests.
  9297. 956.52 s [vector] unzip: OK
  9298. 956.52 s [vector] +++ OK, passed 100 tests.
  9299. 956.52 s [vector] unzip3: OK
  9300. 956.52 s [vector] +++ OK, passed 100 tests.
  9301. 956.53 s [vector] indexed: OK
  9302. 956.53 s [vector] +++ OK, passed 100 tests.
  9303. 956.53 s [vector] update: OK
  9304. 956.53 s [vector] +++ OK, passed 100 tests.
  9305. 956.53 s [vector] mempty: OK
  9306. 956.53 s [vector] +++ OK, passed 100 tests.
  9307. 956.54 s [vector] mappend: OK
  9308. 956.54 s [vector] +++ OK, passed 100 tests.
  9309. 956.56 s [vector] mconcat: OK (0.02s)
  9310. 956.56 s [vector] +++ OK, passed 100 tests.
  9311. 956.56 s [vector] glength: OK
  9312. 956.56 s [vector] +++ OK, passed 100 tests.
  9313. 956.56 s [vector] sum: OK
  9314. 956.56 s [vector] +++ OK, passed 100 tests.
  9315. 956.56 s [vector] product: OK
  9316. 956.56 s [vector] +++ OK, passed 100 tests.
  9317. 956.56 s [vector] enumFromN: OK
  9318. 956.56 s [vector] +++ OK, passed 100 tests.
  9319. 956.56 s [vector] enumFromThenN: OK
  9320. 956.56 s [vector] +++ OK, passed 100 tests.
  9321. 956.56 s [vector] enumFromTo: OK
  9322. 956.56 s [vector] +++ OK, passed 100 tests.
  9323. 956.56 s [vector] enumFromThenTo: OK
  9324. 956.56 s [vector] +++ OK, passed 100 tests; 3 discarded.
  9325. 956.56 s [vector] (Double)
  9326. 956.56 s [vector] fromList.toList == id: OK
  9327. 956.56 s [vector] +++ OK, passed 100 tests.
  9328. 956.56 s [vector] toList.fromList == id: OK
  9329. 956.56 s [vector] +++ OK, passed 100 tests.
  9330. 956.57 s [vector] unstream.stream == id: OK
  9331. 956.57 s [vector] +++ OK, passed 100 tests.
  9332. 956.57 s [vector] stream.unstream == id: OK
  9333. 956.57 s [vector] +++ OK, passed 100 tests.
  9334. 956.57 s [vector] eq: OK
  9335. 956.57 s [vector] +++ OK, passed 100 tests.
  9336. 956.57 s [vector] length: OK
  9337. 956.57 s [vector] +++ OK, passed 100 tests.
  9338. 956.57 s [vector] null: OK
  9339. 956.57 s [vector] +++ OK, passed 100 tests.
  9340. 956.57 s [vector] index: OK
  9341. 956.57 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9342. 956.57 s [vector] safeIndex: OK
  9343. 956.57 s [vector] +++ OK, passed 100 tests.
  9344. 956.57 s [vector] head: OK
  9345. 956.57 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9346. 956.57 s [vector] last: OK
  9347. 956.57 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9348. 956.57 s [vector] unsafeIndex: OK
  9349. 956.57 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9350. 956.57 s [vector] unsafeHead: OK
  9351. 956.57 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9352. 956.57 s [vector] unsafeLast: OK
  9353. 956.57 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9354. 956.57 s [vector] slice: OK
  9355. 956.58 s [vector] +++ OK, passed 100 tests.
  9356. 956.58 s [vector] init: OK
  9357. 956.58 s [vector] +++ OK, passed 100 tests; 12 discarded.
  9358. 956.58 s [vector] tail: OK
  9359. 956.58 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9360. 956.58 s [vector] take: OK
  9361. 956.58 s [vector] +++ OK, passed 100 tests.
  9362. 956.58 s [vector] drop: OK
  9363. 956.58 s [vector] +++ OK, passed 100 tests.
  9364. 956.58 s [vector] splitAt: OK
  9365. 956.58 s [vector] +++ OK, passed 100 tests.
  9366. 956.58 s [vector] empty: OK
  9367. 956.58 s [vector] +++ OK, passed 100 tests.
  9368. 956.58 s [vector] singleton: OK
  9369. 956.58 s [vector] +++ OK, passed 100 tests.
  9370. 956.58 s [vector] replicate: OK
  9371. 956.59 s [vector] +++ OK, passed 100 tests.
  9372. 956.59 s [vector] generate: OK
  9373. 956.59 s [vector] +++ OK, passed 100 tests.
  9374. 956.60 s [vector] iterateN: OK
  9375. 956.60 s [vector] +++ OK, passed 100 tests.
  9376. 956.62 s [vector] iterateNM: OK (0.02s)
  9377. 956.62 s [vector] +++ OK, passed 100 tests.
  9378. 956.64 s [vector] generateM: OK (0.02s)
  9379. 956.64 s [vector] +++ OK, passed 100 tests.
  9380. 956.64 s [vector] replicateM: OK
  9381. 956.64 s [vector] +++ OK, passed 100 tests.
  9382. 956.64 s [vector] create: OK
  9383. 956.64 s [vector] +++ OK, passed 100 tests.
  9384. 956.65 s [vector] createT: OK
  9385. 956.65 s [vector] +++ OK, passed 100 tests.
  9386. 956.65 s [vector] unfoldr: OK
  9387. 956.65 s [vector] +++ OK, passed 100 tests.
  9388. 956.65 s [vector] unfoldrN: OK
  9389. 956.65 s [vector] +++ OK, passed 100 tests.
  9390. 956.65 s [vector] unfoldrExactN: OK
  9391. 956.65 s [vector] +++ OK, passed 100 tests.
  9392. 956.65 s [vector] unfoldrM: OK
  9393. 956.65 s [vector] +++ OK, passed 100 tests.
  9394. 956.66 s [vector] unfoldrNM: OK
  9395. 956.66 s [vector] +++ OK, passed 100 tests.
  9396. 956.68 s [vector] unfoldrExactNM: OK (0.03s)
  9397. 956.68 s [vector] +++ OK, passed 100 tests.
  9398. 956.70 s [vector] constructN: OK (0.01s)
  9399. 956.70 s [vector] +++ OK, passed 100 tests.
  9400. 956.71 s [vector] constructrN: OK (0.01s)
  9401. 956.71 s [vector] +++ OK, passed 100 tests.
  9402. 956.72 s [vector] cons: OK
  9403. 956.72 s [vector] +++ OK, passed 100 tests.
  9404. 956.72 s [vector] snoc: OK
  9405. 956.72 s [vector] +++ OK, passed 100 tests.
  9406. 956.72 s [vector] append: OK
  9407. 956.72 s [vector] +++ OK, passed 100 tests.
  9408. 956.73 s [vector] concat: OK (0.02s)
  9409. 956.74 s [vector] +++ OK, passed 100 tests.
  9410. 956.74 s [vector] force: OK
  9411. 956.74 s [vector] +++ OK, passed 100 tests.
  9412. 956.74 s [vector] upd: OK
  9413. 956.75 s [vector] +++ OK, passed 100 tests.
  9414. 956.75 s [vector] accum: OK (0.01s)
  9415. 956.75 s [vector] +++ OK, passed 100 tests.
  9416. 956.75 s [vector] reverse: OK
  9417. 956.76 s [vector] +++ OK, passed 100 tests.
  9418. 956.76 s [vector] backpermute: OK
  9419. 956.76 s [vector] +++ OK, passed 100 tests.
  9420. 956.76 s [vector] map: OK
  9421. 956.77 s [vector] +++ OK, passed 100 tests.
  9422. 956.77 s [vector] imap: OK
  9423. 956.77 s [vector] +++ OK, passed 100 tests.
  9424. 956.78 s [vector] concatMap: OK
  9425. 956.78 s [vector] +++ OK, passed 100 tests.
  9426. 956.80 s [vector] mapM: OK
  9427. 956.80 s [vector] +++ OK, passed 100 tests.
  9428. 956.82 s [vector] mapM_: OK (0.04s)
  9429. 956.82 s [vector] +++ OK, passed 100 tests.
  9430. 956.84 s [vector] forM: OK
  9431. 956.84 s [vector] +++ OK, passed 100 tests.
  9432. 956.86 s [vector] forM_: OK (0.03s)
  9433. 956.86 s [vector] +++ OK, passed 100 tests.
  9434. 956.88 s [vector] imapM: OK
  9435. 956.88 s [vector] +++ OK, passed 100 tests.
  9436. 956.91 s [vector] imapM_: OK (0.04s)
  9437. 956.92 s [vector] +++ OK, passed 100 tests.
  9438. 956.92 s [vector] zipWith: OK
  9439. 956.92 s [vector] +++ OK, passed 100 tests.
  9440. 956.93 s [vector] zipWith3: OK (0.01s)
  9441. 956.93 s [vector] +++ OK, passed 100 tests.
  9442. 956.94 s [vector] izipWith: OK
  9443. 956.94 s [vector] +++ OK, passed 100 tests.
  9444. 956.94 s [vector] izipWith3: OK
  9445. 956.95 s [vector] +++ OK, passed 100 tests.
  9446. 956.95 s [vector] izipWithM: OK
  9447. 956.96 s [vector] +++ OK, passed 100 tests.
  9448. 956.99 s [vector] izipWithM_: OK (0.03s)
  9449. 957.00 s [vector] +++ OK, passed 100 tests.
  9450. 957.00 s [vector] zipWithM: OK
  9451. 957.00 s [vector] +++ OK, passed 100 tests.
  9452. 957.03 s [vector] zipWithM_: OK (0.03s)
  9453. 957.04 s [vector] +++ OK, passed 100 tests.
  9454. 957.04 s [vector] filter: OK
  9455. 957.04 s [vector] +++ OK, passed 100 tests.
  9456. 957.04 s [vector] ifilter: OK
  9457. 957.04 s [vector] +++ OK, passed 100 tests.
  9458. 957.09 s [vector] filterM: OK (0.05s)
  9459. 957.10 s [vector] +++ OK, passed 100 tests.
  9460. 957.10 s [vector] uniq: OK
  9461. 957.10 s [vector] +++ OK, passed 100 tests.
  9462. 957.10 s [vector] mapMaybe: OK
  9463. 957.10 s [vector] +++ OK, passed 100 tests.
  9464. 957.10 s [vector] imapMaybe: OK
  9465. 957.10 s [vector] +++ OK, passed 100 tests.
  9466. 957.11 s [vector] takeWhile: OK
  9467. 957.11 s [vector] +++ OK, passed 100 tests.
  9468. 957.11 s [vector] dropWhile: OK
  9469. 957.11 s [vector] +++ OK, passed 100 tests.
  9470. 957.12 s [vector] partition: OK
  9471. 957.12 s [vector] +++ OK, passed 100 tests.
  9472. 957.12 s [vector] partitionWith: OK
  9473. 957.12 s [vector] +++ OK, passed 100 tests.
  9474. 957.12 s [vector] span: OK
  9475. 957.12 s [vector] +++ OK, passed 100 tests.
  9476. 957.12 s [vector] break: OK
  9477. 957.12 s [vector] +++ OK, passed 100 tests.
  9478. 957.12 s [vector] spanR: OK
  9479. 957.12 s [vector] +++ OK, passed 100 tests.
  9480. 957.12 s [vector] breakR: OK
  9481. 957.12 s [vector] +++ OK, passed 100 tests.
  9482. 957.13 s [vector] groupBy: OK
  9483. 957.13 s [vector] +++ OK, passed 100 tests.
  9484. 957.13 s [vector] elem: OK
  9485. 957.13 s [vector] +++ OK, passed 100 tests.
  9486. 957.13 s [vector] notElem: OK
  9487. 957.13 s [vector] +++ OK, passed 100 tests.
  9488. 957.14 s [vector] find: OK
  9489. 957.14 s [vector] +++ OK, passed 100 tests.
  9490. 957.14 s [vector] findIndex: OK
  9491. 957.14 s [vector] +++ OK, passed 100 tests.
  9492. 957.14 s [vector] findIndexR: OK
  9493. 957.14 s [vector] +++ OK, passed 100 tests.
  9494. 957.14 s [vector] findIndices: OK
  9495. 957.14 s [vector] +++ OK, passed 100 tests.
  9496. 957.14 s [vector] elemIndex: OK
  9497. 957.14 s [vector] +++ OK, passed 100 tests.
  9498. 957.14 s [vector] elemIndices: OK
  9499. 957.16 s [vector] +++ OK, passed 100 tests.
  9500. 957.16 s [vector] foldl: OK (0.01s)
  9501. 957.16 s [vector] +++ OK, passed 100 tests.
  9502. 957.18 s [vector] foldl1: OK (0.01s)
  9503. 957.18 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9504. 957.18 s [vector] foldl': OK (0.01s)
  9505. 957.18 s [vector] +++ OK, passed 100 tests.
  9506. 957.20 s [vector] foldl1': OK (0.01s)
  9507. 957.20 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9508. 957.21 s [vector] foldr: OK (0.01s)
  9509. 957.21 s [vector] +++ OK, passed 100 tests.
  9510. 957.22 s [vector] foldr1: OK (0.01s)
  9511. 957.22 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9512. 957.24 s [vector] foldr': OK (0.01s)
  9513. 957.24 s [vector] +++ OK, passed 100 tests.
  9514. 957.24 s [vector] foldr1': OK (0.01s)
  9515. 957.24 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9516. 957.26 s [vector] ifoldl: OK (0.01s)
  9517. 957.26 s [vector] +++ OK, passed 100 tests.
  9518. 957.28 s [vector] ifoldl': OK (0.01s)
  9519. 957.28 s [vector] +++ OK, passed 100 tests.
  9520. 957.28 s [vector] ifoldr: OK (0.01s)
  9521. 957.28 s [vector] +++ OK, passed 100 tests.
  9522. 957.30 s [vector] ifoldr': OK (0.01s)
  9523. 957.30 s [vector] +++ OK, passed 100 tests.
  9524. 957.31 s [vector] ifoldM: OK (0.01s)
  9525. 957.31 s [vector] +++ OK, passed 100 tests.
  9526. 957.32 s [vector] ifoldM': OK
  9527. 957.32 s [vector] +++ OK, passed 100 tests.
  9528. 957.38 s [vector] ifoldM_: OK (0.04s)
  9529. 957.38 s [vector] +++ OK, passed 100 tests.
  9530. 957.41 s [vector] ifoldM'_: OK (0.04s)
  9531. 957.41 s [vector] +++ OK, passed 100 tests.
  9532. 957.41 s [vector] all: OK
  9533. 957.41 s [vector] +++ OK, passed 100 tests.
  9534. 957.41 s [vector] any: OK
  9535. 957.42 s [vector] +++ OK, passed 100 tests.
  9536. 957.42 s [vector] prescanl: OK (0.01s)
  9537. 957.43 s [vector] +++ OK, passed 100 tests.
  9538. 957.44 s [vector] prescanl': OK (0.01s)
  9539. 957.44 s [vector] +++ OK, passed 100 tests.
  9540. 957.46 s [vector] postscanl: OK (0.01s)
  9541. 957.46 s [vector] +++ OK, passed 100 tests.
  9542. 957.47 s [vector] postscanl': OK (0.01s)
  9543. 957.48 s [vector] +++ OK, passed 100 tests.
  9544. 957.48 s [vector] scanl: OK (0.02s)
  9545. 957.48 s [vector] +++ OK, passed 100 tests.
  9546. 957.49 s [vector] scanl': OK (0.01s)
  9547. 957.49 s [vector] +++ OK, passed 100 tests.
  9548. 957.51 s [vector] scanl1: OK
  9549. 957.52 s [vector] +++ OK, passed 100 tests.
  9550. 957.52 s [vector] scanl1': OK (0.01s)
  9551. 957.53 s [vector] +++ OK, passed 100 tests.
  9552. 957.54 s [vector] iscanl: OK (0.01s)
  9553. 957.54 s [vector] +++ OK, passed 100 tests.
  9554. 957.55 s [vector] iscanl': OK (0.01s)
  9555. 957.55 s [vector] +++ OK, passed 100 tests.
  9556. 957.56 s [vector] prescanr: OK (0.01s)
  9557. 957.56 s [vector] +++ OK, passed 100 tests.
  9558. 957.58 s [vector] prescanr': OK (0.01s)
  9559. 957.58 s [vector] +++ OK, passed 100 tests.
  9560. 957.58 s [vector] postscanr: OK (0.01s)
  9561. 957.58 s [vector] +++ OK, passed 100 tests.
  9562. 957.60 s [vector] postscanr': OK (0.01s)
  9563. 957.60 s [vector] +++ OK, passed 100 tests.
  9564. 957.61 s [vector] scanr: OK (0.01s)
  9565. 957.61 s [vector] +++ OK, passed 100 tests.
  9566. 957.62 s [vector] scanr': OK (0.01s)
  9567. 957.62 s [vector] +++ OK, passed 100 tests.
  9568. 957.63 s [vector] scanr1: OK
  9569. 957.64 s [vector] +++ OK, passed 100 tests.
  9570. 957.64 s [vector] scanr1': OK
  9571. 957.65 s [vector] +++ OK, passed 100 tests.
  9572. 957.66 s [vector] iscanr: OK (0.01s)
  9573. 957.66 s [vector] +++ OK, passed 100 tests.
  9574. 957.66 s [vector] iscanr': OK (0.01s)
  9575. 957.66 s [vector] +++ OK, passed 100 tests.
  9576. 957.66 s [vector] mut_read: OK
  9577. 957.68 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9578. 957.68 s [vector] mut_write: OK
  9579. 957.68 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9580. 957.68 s [vector] mut_modify: OK
  9581. 957.68 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9582. 957.68 s [vector] mut_generate: OK
  9583. 957.68 s [vector] +++ OK, passed 100 tests.
  9584. 957.68 s [vector] mut_generateM: OK (0.02s)
  9585. 957.68 s [vector] +++ OK, passed 100 tests.
  9586. 957.72 s [vector] mut_mapM_: OK (0.03s)
  9587. 957.72 s [vector] +++ OK, passed 100 tests.
  9588. 957.76 s [vector] mut_imapM_: OK (0.04s)
  9589. 957.76 s [vector] +++ OK, passed 100 tests.
  9590. 957.80 s [vector] mut_forM_: OK (0.03s)
  9591. 957.80 s [vector] +++ OK, passed 100 tests.
  9592. 957.84 s [vector] mut_iforM_: OK (0.04s)
  9593. 957.84 s [vector] +++ OK, passed 100 tests.
  9594. 957.84 s [vector] mut_foldr: OK (0.01s)
  9595. 957.85 s [vector] +++ OK, passed 100 tests.
  9596. 957.86 s [vector] mut_foldr': OK (0.01s)
  9597. 957.86 s [vector] +++ OK, passed 100 tests.
  9598. 957.88 s [vector] mut_foldl: OK (0.01s)
  9599. 957.88 s [vector] +++ OK, passed 100 tests.
  9600. 957.88 s [vector] mut_foldl': OK (0.01s)
  9601. 957.88 s [vector] +++ OK, passed 100 tests.
  9602. 957.90 s [vector] mut_ifoldr: OK (0.02s)
  9603. 957.90 s [vector] +++ OK, passed 100 tests.
  9604. 957.92 s [vector] mut_ifoldr': OK (0.01s)
  9605. 957.92 s [vector] +++ OK, passed 100 tests.
  9606. 957.93 s [vector] mut_ifoldl: OK (0.01s)
  9607. 957.93 s [vector] +++ OK, passed 100 tests.
  9608. 957.94 s [vector] mut_ifoldl': OK (0.01s)
  9609. 957.94 s [vector] +++ OK, passed 100 tests.
  9610. 957.96 s [vector] mut_foldM: OK (0.01s)
  9611. 957.96 s [vector] +++ OK, passed 100 tests.
  9612. 957.97 s [vector] mut_foldM': OK (0.01s)
  9613. 957.97 s [vector] +++ OK, passed 100 tests.
  9614. 957.98 s [vector] mut_foldrM: OK (0.01s)
  9615. 957.98 s [vector] +++ OK, passed 100 tests.
  9616. 958.00 s [vector] mut_foldrM': OK (0.01s)
  9617. 958.00 s [vector] +++ OK, passed 100 tests.
  9618. 958.00 s [vector] mut_ifoldM: OK (0.02s)
  9619. 958.00 s [vector] +++ OK, passed 100 tests.
  9620. 958.02 s [vector] mut_ifoldM': OK (0.02s)
  9621. 958.02 s [vector] +++ OK, passed 100 tests.
  9622. 958.04 s [vector] mut_ifoldrM: OK (0.01s)
  9623. 958.04 s [vector] +++ OK, passed 100 tests.
  9624. 958.05 s [vector] mut_ifoldrM': OK (0.02s)
  9625. 958.05 s [vector] +++ OK, passed 100 tests.
  9626. 958.05 s [vector] compare: OK
  9627. 958.05 s [vector] +++ OK, passed 100 tests.
  9628. 958.05 s [vector] maximum: OK
  9629. 958.05 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9630. 958.05 s [vector] minimum: OK
  9631. 958.05 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9632. 958.05 s [vector] minIndex: OK
  9633. 958.05 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9634. 958.05 s [vector] maxIndex: OK
  9635. 958.05 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9636. 958.05 s [vector] maximumBy: OK
  9637. 958.05 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9638. 958.05 s [vector] minimumBy: OK
  9639. 958.05 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9640. 958.05 s [vector] maximumOn: OK
  9641. 958.06 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9642. 958.06 s [vector] minimumOn: OK
  9643. 958.06 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9644. 958.06 s [vector] maxIndexBy: OK
  9645. 958.06 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9646. 958.06 s [vector] minIndexBy: OK
  9647. 958.06 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9648. 958.06 s [vector] ListFirstMaxIndexWins: OK
  9649. 958.06 s [vector] +++ OK, passed 100 tests; 12 discarded.
  9650. 958.06 s [vector] FalseListFirstMaxIndexWins: OK
  9651. 958.06 s [vector] +++ OK, failed as expected. (after 1 test):
  9652. 958.06 s [vector] Exception:
  9653. 958.06 s [vector] Prelude.foldr1: empty list
  9654. 958.06 s [vector] CallStack (from HasCallStack):
  9655. 958.06 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  9656. 958.06 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  9657. 958.06 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  9658. 958.06 s [vector] []
  9659. 958.06 s [vector] zip: OK
  9660. 958.06 s [vector] +++ OK, passed 100 tests.
  9661. 958.07 s [vector] zip3: OK
  9662. 958.07 s [vector] +++ OK, passed 100 tests.
  9663. 958.07 s [vector] unzip: OK
  9664. 958.07 s [vector] +++ OK, passed 100 tests.
  9665. 958.07 s [vector] unzip3: OK
  9666. 958.07 s [vector] +++ OK, passed 100 tests.
  9667. 958.07 s [vector] indexed: OK
  9668. 958.07 s [vector] +++ OK, passed 100 tests.
  9669. 958.08 s [vector] update: OK
  9670. 958.08 s [vector] +++ OK, passed 100 tests.
  9671. 958.08 s [vector] mempty: OK
  9672. 958.08 s [vector] +++ OK, passed 100 tests.
  9673. 958.08 s [vector] mappend: OK
  9674. 958.08 s [vector] +++ OK, passed 100 tests.
  9675. 958.10 s [vector] mconcat: OK (0.02s)
  9676. 958.10 s [vector] +++ OK, passed 100 tests.
  9677. 958.10 s [vector] glength: OK
  9678. 958.10 s [vector] +++ OK, passed 100 tests.
  9679. 958.10 s [vector] sum: OK
  9680. 958.10 s [vector] +++ OK, passed 100 tests.
  9681. 958.10 s [vector] product: OK
  9682. 958.10 s [vector] +++ OK, passed 100 tests.
  9683. 958.10 s [vector] enumFromN: OK
  9684. 958.11 s [vector] +++ OK, passed 100 tests.
  9685. 958.11 s [vector] enumFromThenN: OK
  9686. 958.11 s [vector] +++ OK, passed 100 tests.
  9687. 958.11 s [vector] enumFromTo: OK
  9688. 958.11 s [vector] +++ OK, passed 100 tests.
  9689. 958.11 s [vector] enumFromThenTo: OK
  9690. 958.11 s [vector] +++ OK, passed 100 tests; 3 discarded.
  9691. 958.11 s [vector] (Int,Bool)
  9692. 958.11 s [vector] fromList.toList == id: OK
  9693. 958.11 s [vector] +++ OK, passed 100 tests.
  9694. 958.11 s [vector] toList.fromList == id: OK
  9695. 958.11 s [vector] +++ OK, passed 100 tests.
  9696. 958.11 s [vector] unstream.stream == id: OK
  9697. 958.11 s [vector] +++ OK, passed 100 tests.
  9698. 958.11 s [vector] stream.unstream == id: OK
  9699. 958.11 s [vector] +++ OK, passed 100 tests.
  9700. 958.11 s [vector] eq: OK
  9701. 958.11 s [vector] +++ OK, passed 100 tests.
  9702. 958.12 s [vector] length: OK
  9703. 958.12 s [vector] +++ OK, passed 100 tests.
  9704. 958.12 s [vector] null: OK
  9705. 958.12 s [vector] +++ OK, passed 100 tests.
  9706. 958.12 s [vector] index: OK
  9707. 958.12 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9708. 958.12 s [vector] safeIndex: OK
  9709. 958.12 s [vector] +++ OK, passed 100 tests.
  9710. 958.12 s [vector] head: OK
  9711. 958.12 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9712. 958.12 s [vector] last: OK
  9713. 958.12 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9714. 958.12 s [vector] unsafeIndex: OK
  9715. 958.12 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9716. 958.12 s [vector] unsafeHead: OK
  9717. 958.12 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9718. 958.12 s [vector] unsafeLast: OK
  9719. 958.12 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9720. 958.13 s [vector] slice: OK
  9721. 958.13 s [vector] +++ OK, passed 100 tests.
  9722. 958.13 s [vector] init: OK
  9723. 958.13 s [vector] +++ OK, passed 100 tests; 11 discarded.
  9724. 958.13 s [vector] tail: OK
  9725. 958.13 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9726. 958.13 s [vector] take: OK
  9727. 958.13 s [vector] +++ OK, passed 100 tests.
  9728. 958.13 s [vector] drop: OK
  9729. 958.13 s [vector] +++ OK, passed 100 tests.
  9730. 958.13 s [vector] splitAt: OK
  9731. 958.13 s [vector] +++ OK, passed 100 tests.
  9732. 958.13 s [vector] empty: OK
  9733. 958.13 s [vector] +++ OK, passed 100 tests.
  9734. 958.13 s [vector] singleton: OK
  9735. 958.13 s [vector] +++ OK, passed 100 tests.
  9736. 958.13 s [vector] replicate: OK
  9737. 958.13 s [vector] +++ OK, passed 100 tests.
  9738. 958.14 s [vector] generate: OK
  9739. 958.14 s [vector] +++ OK, passed 100 tests.
  9740. 958.14 s [vector] iterateN: OK
  9741. 958.14 s [vector] +++ OK, passed 100 tests.
  9742. 958.20 s [vector] iterateNM: OK (0.05s)
  9743. 958.20 s [vector] +++ OK, passed 100 tests.
  9744. 958.24 s [vector] generateM: OK (0.03s)
  9745. 958.24 s [vector] +++ OK, passed 100 tests.
  9746. 958.24 s [vector] replicateM: OK (0.01s)
  9747. 958.24 s [vector] +++ OK, passed 100 tests.
  9748. 958.24 s [vector] create: OK
  9749. 958.24 s [vector] +++ OK, passed 100 tests.
  9750. 958.24 s [vector] createT: OK
  9751. 958.24 s [vector] +++ OK, passed 100 tests.
  9752. 958.24 s [vector] unfoldr: OK
  9753. 958.24 s [vector] +++ OK, passed 100 tests.
  9754. 958.24 s [vector] unfoldrN: OK
  9755. 958.26 s [vector] +++ OK, passed 100 tests.
  9756. 958.26 s [vector] unfoldrExactN: OK
  9757. 958.26 s [vector] +++ OK, passed 100 tests.
  9758. 958.26 s [vector] unfoldrM: OK (0.01s)
  9759. 958.26 s [vector] +++ OK, passed 100 tests.
  9760. 958.26 s [vector] unfoldrNM: OK
  9761. 958.26 s [vector] +++ OK, passed 100 tests.
  9762. 958.29 s [vector] unfoldrExactNM: OK (0.03s)
  9763. 958.30 s [vector] +++ OK, passed 100 tests.
  9764. 958.30 s [vector] constructN: OK
  9765. 958.30 s [vector] +++ OK, passed 100 tests.
  9766. 958.30 s [vector] constructrN: OK
  9767. 958.30 s [vector] +++ OK, passed 100 tests.
  9768. 958.31 s [vector] cons: OK
  9769. 958.32 s [vector] +++ OK, passed 100 tests.
  9770. 958.32 s [vector] snoc: OK
  9771. 958.32 s [vector] +++ OK, passed 100 tests.
  9772. 958.32 s [vector] append: OK
  9773. 958.32 s [vector] +++ OK, passed 100 tests.
  9774. 958.35 s [vector] concat: OK (0.04s)
  9775. 958.35 s [vector] +++ OK, passed 100 tests.
  9776. 958.35 s [vector] force: OK
  9777. 958.35 s [vector] +++ OK, passed 100 tests.
  9778. 958.36 s [vector] upd: OK
  9779. 958.36 s [vector] +++ OK, passed 100 tests.
  9780. 958.36 s [vector] accum: OK
  9781. 958.37 s [vector] +++ OK, passed 100 tests.
  9782. 958.38 s [vector] reverse: OK
  9783. 958.38 s [vector] +++ OK, passed 100 tests.
  9784. 958.38 s [vector] backpermute: OK
  9785. 958.39 s [vector] +++ OK, passed 100 tests.
  9786. 958.39 s [vector] map: OK
  9787. 958.39 s [vector] +++ OK, passed 100 tests.
  9788. 958.39 s [vector] imap: OK
  9789. 958.40 s [vector] +++ OK, passed 100 tests.
  9790. 958.40 s [vector] concatMap: OK
  9791. 958.40 s [vector] +++ OK, passed 100 tests.
  9792. 958.41 s [vector] mapM: OK
  9793. 958.41 s [vector] +++ OK, passed 100 tests.
  9794. 958.42 s [vector] mapM_: OK (0.03s)
  9795. 958.42 s [vector] +++ OK, passed 100 tests.
  9796. 958.42 s [vector] forM: OK
  9797. 958.44 s [vector] +++ OK, passed 100 tests.
  9798. 958.46 s [vector] forM_: OK (0.03s)
  9799. 958.46 s [vector] +++ OK, passed 100 tests.
  9800. 958.46 s [vector] imapM: OK
  9801. 958.46 s [vector] +++ OK, passed 100 tests.
  9802. 958.50 s [vector] imapM_: OK (0.04s)
  9803. 958.50 s [vector] +++ OK, passed 100 tests.
  9804. 958.50 s [vector] zipWith: OK
  9805. 958.51 s [vector] +++ OK, passed 100 tests.
  9806. 958.52 s [vector] zipWith3: OK
  9807. 958.52 s [vector] +++ OK, passed 100 tests.
  9808. 958.52 s [vector] izipWith: OK
  9809. 958.54 s [vector] +++ OK, passed 100 tests.
  9810. 958.54 s [vector] izipWith3: OK
  9811. 958.54 s [vector] +++ OK, passed 100 tests.
  9812. 958.55 s [vector] izipWithM: OK
  9813. 958.55 s [vector] +++ OK, passed 100 tests.
  9814. 958.56 s [vector] izipWithM_: OK (0.02s)
  9815. 958.56 s [vector] +++ OK, passed 100 tests.
  9816. 958.56 s [vector] zipWithM: OK
  9817. 958.57 s [vector] +++ OK, passed 100 tests.
  9818. 958.58 s [vector] zipWithM_: OK (0.02s)
  9819. 958.58 s [vector] +++ OK, passed 100 tests.
  9820. 958.58 s [vector] filter: OK
  9821. 958.58 s [vector] +++ OK, passed 100 tests.
  9822. 958.58 s [vector] ifilter: OK
  9823. 958.58 s [vector] +++ OK, passed 100 tests.
  9824. 958.63 s [vector] filterM: OK (0.02s)
  9825. 958.63 s [vector] +++ OK, passed 100 tests.
  9826. 958.63 s [vector] uniq: OK
  9827. 958.63 s [vector] +++ OK, passed 100 tests.
  9828. 958.64 s [vector] mapMaybe: OK
  9829. 958.64 s [vector] +++ OK, passed 100 tests.
  9830. 958.64 s [vector] imapMaybe: OK
  9831. 958.64 s [vector] +++ OK, passed 100 tests.
  9832. 958.64 s [vector] takeWhile: OK
  9833. 958.64 s [vector] +++ OK, passed 100 tests.
  9834. 958.65 s [vector] dropWhile: OK
  9835. 958.65 s [vector] +++ OK, passed 100 tests.
  9836. 958.66 s [vector] partition: OK
  9837. 958.66 s [vector] +++ OK, passed 100 tests.
  9838. 958.66 s [vector] partitionWith: OK
  9839. 958.66 s [vector] +++ OK, passed 100 tests.
  9840. 958.67 s [vector] span: OK
  9841. 958.67 s [vector] +++ OK, passed 100 tests.
  9842. 958.67 s [vector] break: OK
  9843. 958.67 s [vector] +++ OK, passed 100 tests.
  9844. 958.67 s [vector] spanR: OK
  9845. 958.67 s [vector] +++ OK, passed 100 tests.
  9846. 958.67 s [vector] breakR: OK
  9847. 958.67 s [vector] +++ OK, passed 100 tests.
  9848. 958.68 s [vector] groupBy: OK
  9849. 958.68 s [vector] +++ OK, passed 100 tests.
  9850. 958.68 s [vector] elem: OK
  9851. 958.68 s [vector] +++ OK, passed 100 tests.
  9852. 958.68 s [vector] notElem: OK
  9853. 958.68 s [vector] +++ OK, passed 100 tests.
  9854. 958.68 s [vector] find: OK
  9855. 958.68 s [vector] +++ OK, passed 100 tests.
  9856. 958.68 s [vector] findIndex: OK
  9857. 958.68 s [vector] +++ OK, passed 100 tests.
  9858. 958.68 s [vector] findIndexR: OK
  9859. 958.68 s [vector] +++ OK, passed 100 tests.
  9860. 958.68 s [vector] findIndices: OK
  9861. 958.68 s [vector] +++ OK, passed 100 tests.
  9862. 958.69 s [vector] elemIndex: OK
  9863. 958.69 s [vector] +++ OK, passed 100 tests.
  9864. 958.69 s [vector] elemIndices: OK
  9865. 958.69 s [vector] +++ OK, passed 100 tests.
  9866. 958.69 s [vector] foldl: OK
  9867. 958.69 s [vector] +++ OK, passed 100 tests.
  9868. 958.69 s [vector] foldl1: OK
  9869. 958.69 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9870. 958.70 s [vector] foldl': OK
  9871. 958.70 s [vector] +++ OK, passed 100 tests.
  9872. 958.70 s [vector] foldl1': OK
  9873. 958.70 s [vector] +++ OK, passed 100 tests; 12 discarded.
  9874. 958.70 s [vector] foldr: OK
  9875. 958.70 s [vector] +++ OK, passed 100 tests.
  9876. 958.71 s [vector] foldr1: OK
  9877. 958.71 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9878. 958.71 s [vector] foldr': OK
  9879. 958.71 s [vector] +++ OK, passed 100 tests.
  9880. 958.72 s [vector] foldr1': OK
  9881. 958.72 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9882. 958.73 s [vector] ifoldl: OK
  9883. 958.73 s [vector] +++ OK, passed 100 tests.
  9884. 958.74 s [vector] ifoldl': OK
  9885. 958.74 s [vector] +++ OK, passed 100 tests.
  9886. 958.75 s [vector] ifoldr: OK
  9887. 958.75 s [vector] +++ OK, passed 100 tests.
  9888. 958.75 s [vector] ifoldr': OK
  9889. 958.75 s [vector] +++ OK, passed 100 tests.
  9890. 958.75 s [vector] ifoldM: OK
  9891. 958.75 s [vector] +++ OK, passed 100 tests.
  9892. 958.76 s [vector] ifoldM': OK
  9893. 958.76 s [vector] +++ OK, passed 100 tests.
  9894. 958.78 s [vector] ifoldM_: OK (0.03s)
  9895. 958.78 s [vector] +++ OK, passed 100 tests.
  9896. 958.82 s [vector] ifoldM'_: OK (0.02s)
  9897. 958.82 s [vector] +++ OK, passed 100 tests.
  9898. 958.82 s [vector] all: OK
  9899. 958.82 s [vector] +++ OK, passed 100 tests.
  9900. 958.84 s [vector] any: OK
  9901. 958.84 s [vector] +++ OK, passed 100 tests.
  9902. 958.84 s [vector] prescanl: OK
  9903. 958.84 s [vector] +++ OK, passed 100 tests.
  9904. 958.86 s [vector] prescanl': OK
  9905. 958.86 s [vector] +++ OK, passed 100 tests.
  9906. 958.86 s [vector] postscanl: OK
  9907. 958.86 s [vector] +++ OK, passed 100 tests.
  9908. 958.87 s [vector] postscanl': OK
  9909. 959.01 s [vector] +++ OK, passed 100 tests.
  9910. 959.01 s [vector] scanl: OK
  9911. 959.01 s [vector] +++ OK, passed 100 tests.
  9912. 959.01 s [vector] scanl': OK
  9913. 959.01 s [vector] +++ OK, passed 100 tests.
  9914. 959.01 s [vector] scanl1: OK
  9915. 959.01 s [vector] +++ OK, passed 100 tests.
  9916. 959.01 s [vector] scanl1': OK
  9917. 959.01 s [vector] +++ OK, passed 100 tests.
  9918. 959.01 s [vector] iscanl: OK
  9919. 959.01 s [vector] +++ OK, passed 100 tests.
  9920. 959.01 s [vector] iscanl': OK
  9921. 959.01 s [vector] +++ OK, passed 100 tests.
  9922. 959.01 s [vector] prescanr: OK
  9923. 959.01 s [vector] +++ OK, passed 100 tests.
  9924. 959.01 s [vector] prescanr': OK
  9925. 959.01 s [vector] +++ OK, passed 100 tests.
  9926. 959.01 s [vector] postscanr: OK
  9927. 959.01 s [vector] +++ OK, passed 100 tests.
  9928. 959.01 s [vector] postscanr': OK
  9929. 959.01 s [vector] +++ OK, passed 100 tests.
  9930. 959.01 s [vector] scanr: OK
  9931. 959.01 s [vector] +++ OK, passed 100 tests.
  9932. 959.01 s [vector] scanr': OK
  9933. 959.01 s [vector] +++ OK, passed 100 tests.
  9934. 959.01 s [vector] scanr1: OK
  9935. 959.01 s [vector] +++ OK, passed 100 tests.
  9936. 959.01 s [vector] scanr1': OK
  9937. 959.01 s [vector] +++ OK, passed 100 tests.
  9938. 959.01 s [vector] iscanr: OK
  9939. 959.01 s [vector] +++ OK, passed 100 tests.
  9940. 959.01 s [vector] iscanr': OK
  9941. 959.01 s [vector] +++ OK, passed 100 tests.
  9942. 959.01 s [vector] mut_read: OK
  9943. 959.01 s [vector] +++ OK, passed 100 tests; 12 discarded.
  9944. 959.01 s [vector] mut_write: OK
  9945. 959.01 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9946. 959.01 s [vector] mut_modify: OK
  9947. 959.01 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9948. 959.01 s [vector] mut_generate: OK
  9949. 959.01 s [vector] +++ OK, passed 100 tests.
  9950. 959.01 s [vector] mut_generateM: OK (0.01s)
  9951. 959.01 s [vector] +++ OK, passed 100 tests.
  9952. 959.01 s [vector] mut_mapM_: OK (0.03s)
  9953. 959.01 s [vector] +++ OK, passed 100 tests.
  9954. 959.02 s [vector] mut_imapM_: OK (0.03s)
  9955. 959.02 s [vector] +++ OK, passed 100 tests.
  9956. 959.05 s [vector] mut_forM_: OK
  9957. 959.05 s [vector] +++ OK, passed 100 tests.
  9958. 959.09 s [vector] mut_iforM_: OK (0.03s)
  9959. 959.09 s [vector] +++ OK, passed 100 tests.
  9960. 959.10 s [vector] mut_foldr: OK (0.01s)
  9961. 959.10 s [vector] +++ OK, passed 100 tests.
  9962. 959.11 s [vector] mut_foldr': OK
  9963. 959.11 s [vector] +++ OK, passed 100 tests.
  9964. 959.12 s [vector] mut_foldl: OK
  9965. 959.12 s [vector] +++ OK, passed 100 tests.
  9966. 959.12 s [vector] mut_foldl': OK
  9967. 959.12 s [vector] +++ OK, passed 100 tests.
  9968. 959.12 s [vector] mut_ifoldr: OK
  9969. 959.12 s [vector] +++ OK, passed 100 tests.
  9970. 959.13 s [vector] mut_ifoldr': OK
  9971. 959.14 s [vector] +++ OK, passed 100 tests.
  9972. 959.14 s [vector] mut_ifoldl: OK
  9973. 959.14 s [vector] +++ OK, passed 100 tests.
  9974. 959.16 s [vector] mut_ifoldl': OK
  9975. 959.16 s [vector] +++ OK, passed 100 tests.
  9976. 959.17 s [vector] mut_foldM: OK
  9977. 959.17 s [vector] +++ OK, passed 100 tests.
  9978. 959.18 s [vector] mut_foldM': OK
  9979. 959.18 s [vector] +++ OK, passed 100 tests.
  9980. 959.18 s [vector] mut_foldrM: OK
  9981. 959.18 s [vector] +++ OK, passed 100 tests.
  9982. 959.18 s [vector] mut_foldrM': OK
  9983. 959.18 s [vector] +++ OK, passed 100 tests.
  9984. 959.18 s [vector] mut_ifoldM: OK
  9985. 959.18 s [vector] +++ OK, passed 100 tests.
  9986. 959.18 s [vector] mut_ifoldM': OK
  9987. 959.18 s [vector] +++ OK, passed 100 tests.
  9988. 959.18 s [vector] mut_ifoldrM: OK
  9989. 959.18 s [vector] +++ OK, passed 100 tests.
  9990. 959.18 s [vector] mut_ifoldrM': OK
  9991. 959.18 s [vector] +++ OK, passed 100 tests.
  9992. 959.19 s [vector] compare: OK
  9993. 959.19 s [vector] +++ OK, passed 100 tests.
  9994. 959.19 s [vector] maximum: OK
  9995. 959.19 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9996. 959.19 s [vector] minimum: OK
  9997. 959.19 s [vector] +++ OK, passed 100 tests; 25 discarded.
  9998. 959.19 s [vector] minIndex: OK
  9999. 959.19 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10000. 959.19 s [vector] maxIndex: OK
  10001. 959.19 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10002. 959.19 s [vector] maximumBy: OK
  10003. 959.19 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10004. 959.19 s [vector] minimumBy: OK
  10005. 959.19 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10006. 959.19 s [vector] maximumOn: OK
  10007. 959.19 s [vector] +++ OK, passed 100 tests; 22 discarded.
  10008. 959.19 s [vector] minimumOn: OK
  10009. 959.19 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10010. 959.19 s [vector] maxIndexBy: OK
  10011. 959.19 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10012. 959.20 s [vector] minIndexBy: OK
  10013. 959.20 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10014. 959.20 s [vector] ListFirstMaxIndexWins: OK
  10015. 959.20 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10016. 959.21 s [vector] FalseListFirstMaxIndexWins: OK
  10017. 959.21 s [vector] +++ OK, failed as expected. (after 1 test):
  10018. 959.21 s [vector] Exception:
  10019. 959.21 s [vector] Prelude.foldr1: empty list
  10020. 959.21 s [vector] CallStack (from HasCallStack):
  10021. 959.21 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  10022. 959.21 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  10023. 959.21 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  10024. 959.21 s [vector] []
  10025. 959.21 s [vector] zip: OK
  10026. 959.21 s [vector] +++ OK, passed 100 tests.
  10027. 959.21 s [vector] zip3: OK
  10028. 959.21 s [vector] +++ OK, passed 100 tests.
  10029. 959.21 s [vector] unzip: OK
  10030. 959.21 s [vector] +++ OK, passed 100 tests.
  10031. 959.22 s [vector] unzip3: OK
  10032. 959.22 s [vector] +++ OK, passed 100 tests.
  10033. 959.22 s [vector] indexed: OK
  10034. 959.22 s [vector] +++ OK, passed 100 tests.
  10035. 959.22 s [vector] update: OK
  10036. 959.22 s [vector] +++ OK, passed 100 tests.
  10037. 959.22 s [vector] mempty: OK
  10038. 959.22 s [vector] +++ OK, passed 100 tests.
  10039. 959.22 s [vector] mappend: OK
  10040. 959.22 s [vector] +++ OK, passed 100 tests.
  10041. 959.26 s [vector] mconcat: OK (0.02s)
  10042. 959.26 s [vector] +++ OK, passed 100 tests.
  10043. 959.26 s [vector] glength: OK
  10044. 959.26 s [vector] +++ OK, passed 100 tests.
  10045. 959.26 s [vector] (Int,Bool,Int)
  10046. 959.27 s [vector] fromList.toList == id: OK
  10047. 959.27 s [vector] +++ OK, passed 100 tests.
  10048. 959.27 s [vector] toList.fromList == id: OK
  10049. 959.27 s [vector] +++ OK, passed 100 tests.
  10050. 959.27 s [vector] unstream.stream == id: OK
  10051. 959.27 s [vector] +++ OK, passed 100 tests.
  10052. 959.27 s [vector] stream.unstream == id: OK
  10053. 959.27 s [vector] +++ OK, passed 100 tests.
  10054. 959.27 s [vector] eq: OK
  10055. 959.28 s [vector] +++ OK, passed 100 tests.
  10056. 959.28 s [vector] length: OK
  10057. 959.28 s [vector] +++ OK, passed 100 tests.
  10058. 959.28 s [vector] null: OK
  10059. 959.28 s [vector] +++ OK, passed 100 tests.
  10060. 959.28 s [vector] index: OK
  10061. 959.28 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10062. 959.28 s [vector] safeIndex: OK
  10063. 959.28 s [vector] +++ OK, passed 100 tests.
  10064. 959.28 s [vector] head: OK
  10065. 959.28 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10066. 959.28 s [vector] last: OK
  10067. 959.28 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10068. 959.28 s [vector] unsafeIndex: OK
  10069. 959.28 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10070. 959.28 s [vector] unsafeHead: OK
  10071. 959.28 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10072. 959.28 s [vector] unsafeLast: OK
  10073. 959.28 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10074. 959.29 s [vector] slice: OK
  10075. 959.29 s [vector] +++ OK, passed 100 tests.
  10076. 959.29 s [vector] init: OK
  10077. 959.29 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10078. 959.29 s [vector] tail: OK
  10079. 959.29 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10080. 959.29 s [vector] take: OK
  10081. 959.29 s [vector] +++ OK, passed 100 tests.
  10082. 959.29 s [vector] drop: OK
  10083. 959.29 s [vector] +++ OK, passed 100 tests.
  10084. 959.29 s [vector] splitAt: OK
  10085. 959.29 s [vector] +++ OK, passed 100 tests.
  10086. 959.30 s [vector] empty: OK
  10087. 959.30 s [vector] +++ OK, passed 100 tests.
  10088. 959.30 s [vector] singleton: OK
  10089. 959.30 s [vector] +++ OK, passed 100 tests.
  10090. 959.30 s [vector] replicate: OK
  10091. 959.30 s [vector] +++ OK, passed 100 tests.
  10092. 959.30 s [vector] generate: OK
  10093. 959.30 s [vector] +++ OK, passed 100 tests.
  10094. 959.30 s [vector] iterateN: OK
  10095. 959.30 s [vector] +++ OK, passed 100 tests.
  10096. 959.34 s [vector] iterateNM: OK (0.02s)
  10097. 959.34 s [vector] +++ OK, passed 100 tests.
  10098. 959.36 s [vector] generateM: OK (0.04s)
  10099. 959.36 s [vector] +++ OK, passed 100 tests.
  10100. 959.38 s [vector] replicateM: OK (0.01s)
  10101. 959.38 s [vector] +++ OK, passed 100 tests.
  10102. 959.38 s [vector] create: OK
  10103. 959.38 s [vector] +++ OK, passed 100 tests.
  10104. 959.38 s [vector] createT: OK
  10105. 959.38 s [vector] +++ OK, passed 100 tests.
  10106. 959.38 s [vector] unfoldr: OK
  10107. 959.38 s [vector] +++ OK, passed 100 tests.
  10108. 959.38 s [vector] unfoldrN: OK
  10109. 959.38 s [vector] +++ OK, passed 100 tests.
  10110. 959.38 s [vector] unfoldrExactN: OK
  10111. 959.38 s [vector] +++ OK, passed 100 tests.
  10112. 959.39 s [vector] unfoldrM: OK
  10113. 959.39 s [vector] +++ OK, passed 100 tests.
  10114. 959.40 s [vector] unfoldrNM: OK
  10115. 959.41 s [vector] +++ OK, passed 100 tests.
  10116. 959.45 s [vector] unfoldrExactNM: OK (0.05s)
  10117. 959.46 s [vector] +++ OK, passed 100 tests.
  10118. 959.46 s [vector] constructN: OK
  10119. 959.46 s [vector] +++ OK, passed 100 tests.
  10120. 959.47 s [vector] constructrN: OK
  10121. 959.47 s [vector] +++ OK, passed 100 tests.
  10122. 959.48 s [vector] cons: OK
  10123. 959.48 s [vector] +++ OK, passed 100 tests.
  10124. 959.48 s [vector] snoc: OK
  10125. 959.48 s [vector] +++ OK, passed 100 tests.
  10126. 959.48 s [vector] append: OK
  10127. 959.48 s [vector] +++ OK, passed 100 tests.
  10128. 959.53 s [vector] concat: OK (0.06s)
  10129. 959.53 s [vector] +++ OK, passed 100 tests.
  10130. 959.53 s [vector] force: OK
  10131. 959.53 s [vector] +++ OK, passed 100 tests.
  10132. 959.54 s [vector] upd: OK
  10133. 959.54 s [vector] +++ OK, passed 100 tests.
  10134. 959.55 s [vector] accum: OK (0.01s)
  10135. 959.55 s [vector] +++ OK, passed 100 tests.
  10136. 959.56 s [vector] reverse: OK
  10137. 959.56 s [vector] +++ OK, passed 100 tests.
  10138. 959.57 s [vector] backpermute: OK
  10139. 959.57 s [vector] +++ OK, passed 100 tests.
  10140. 959.58 s [vector] map: OK
  10141. 959.58 s [vector] +++ OK, passed 100 tests.
  10142. 959.58 s [vector] imap: OK
  10143. 959.59 s [vector] +++ OK, passed 100 tests.
  10144. 959.59 s [vector] concatMap: OK
  10145. 959.59 s [vector] +++ OK, passed 100 tests.
  10146. 959.59 s [vector] mapM: OK
  10147. 959.59 s [vector] +++ OK, passed 100 tests.
  10148. 959.64 s [vector] mapM_: OK (0.05s)
  10149. 959.64 s [vector] +++ OK, passed 100 tests.
  10150. 959.64 s [vector] forM: OK
  10151. 959.64 s [vector] +++ OK, passed 100 tests.
  10152. 959.68 s [vector] forM_: OK (0.04s)
  10153. 959.68 s [vector] +++ OK, passed 100 tests.
  10154. 959.69 s [vector] imapM: OK
  10155. 959.69 s [vector] +++ OK, passed 100 tests.
  10156. 959.74 s [vector] imapM_: OK (0.05s)
  10157. 959.74 s [vector] +++ OK, passed 100 tests.
  10158. 959.74 s [vector] zipWith: OK
  10159. 959.74 s [vector] +++ OK, passed 100 tests.
  10160. 959.76 s [vector] zipWith3: OK
  10161. 959.76 s [vector] +++ OK, passed 100 tests.
  10162. 959.76 s [vector] izipWith: OK
  10163. 959.77 s [vector] +++ OK, passed 100 tests.
  10164. 959.77 s [vector] izipWith3: OK
  10165. 959.77 s [vector] +++ OK, passed 100 tests.
  10166. 959.78 s [vector] izipWithM: OK (0.01s)
  10167. 959.78 s [vector] +++ OK, passed 100 tests.
  10168. 959.82 s [vector] izipWithM_: OK (0.04s)
  10169. 959.82 s [vector] +++ OK, passed 100 tests.
  10170. 959.82 s [vector] zipWithM: OK
  10171. 959.82 s [vector] +++ OK, passed 100 tests.
  10172. 959.86 s [vector] zipWithM_: OK (0.03s)
  10173. 959.86 s [vector] +++ OK, passed 100 tests.
  10174. 959.86 s [vector] filter: OK
  10175. 959.87 s [vector] +++ OK, passed 100 tests.
  10176. 959.88 s [vector] ifilter: OK
  10177. 959.88 s [vector] +++ OK, passed 100 tests.
  10178. 959.94 s [vector] filterM: OK (0.07s)
  10179. 959.94 s [vector] +++ OK, passed 100 tests.
  10180. 959.94 s [vector] uniq: OK
  10181. 959.94 s [vector] +++ OK, passed 100 tests.
  10182. 959.95 s [vector] mapMaybe: OK
  10183. 959.95 s [vector] +++ OK, passed 100 tests.
  10184. 959.96 s [vector] imapMaybe: OK
  10185. 959.96 s [vector] +++ OK, passed 100 tests.
  10186. 959.96 s [vector] takeWhile: OK
  10187. 959.97 s [vector] +++ OK, passed 100 tests.
  10188. 959.97 s [vector] dropWhile: OK
  10189. 959.97 s [vector] +++ OK, passed 100 tests.
  10190. 959.97 s [vector] partition: OK
  10191. 959.97 s [vector] +++ OK, passed 100 tests.
  10192. 959.98 s [vector] partitionWith: OK
  10193. 959.98 s [vector] +++ OK, passed 100 tests.
  10194. 959.99 s [vector] span: OK
  10195. 959.99 s [vector] +++ OK, passed 100 tests.
  10196. 959.99 s [vector] break: OK
  10197. 959.99 s [vector] +++ OK, passed 100 tests.
  10198. 959.99 s [vector] spanR: OK
  10199. 959.99 s [vector] +++ OK, passed 100 tests.
  10200. 959.99 s [vector] breakR: OK
  10201. 959.99 s [vector] +++ OK, passed 100 tests.
  10202. 959.99 s [vector] groupBy: OK
  10203. 959.99 s [vector] +++ OK, passed 100 tests.
  10204. 959.99 s [vector] elem: OK
  10205. 959.99 s [vector] +++ OK, passed 100 tests.
  10206. 959.99 s [vector] notElem: OK
  10207. 959.99 s [vector] +++ OK, passed 100 tests.
  10208. 959.99 s [vector] find: OK
  10209. 959.99 s [vector] +++ OK, passed 100 tests.
  10210. 959.99 s [vector] findIndex: OK
  10211. 959.99 s [vector] +++ OK, passed 100 tests.
  10212. 959.99 s [vector] findIndexR: OK
  10213. 959.99 s [vector] +++ OK, passed 100 tests.
  10214. 960.00 s [vector] findIndices: OK
  10215. 960.00 s [vector] +++ OK, passed 100 tests.
  10216. 960.00 s [vector] elemIndex: OK
  10217. 960.00 s [vector] +++ OK, passed 100 tests.
  10218. 960.00 s [vector] elemIndices: OK
  10219. 960.00 s [vector] +++ OK, passed 100 tests.
  10220. 960.01 s [vector] foldl: OK
  10221. 960.02 s [vector] +++ OK, passed 100 tests.
  10222. 960.02 s [vector] foldl1: OK
  10223. 960.02 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10224. 960.03 s [vector] foldl': OK
  10225. 960.03 s [vector] +++ OK, passed 100 tests.
  10226. 960.04 s [vector] foldl1': OK
  10227. 960.04 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10228. 960.04 s [vector] foldr: OK
  10229. 960.04 s [vector] +++ OK, passed 100 tests.
  10230. 960.05 s [vector] foldr1: OK
  10231. 960.06 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10232. 960.06 s [vector] foldr': OK
  10233. 960.06 s [vector] +++ OK, passed 100 tests.
  10234. 960.07 s [vector] foldr1': OK
  10235. 960.07 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10236. 960.07 s [vector] ifoldl: OK
  10237. 960.08 s [vector] +++ OK, passed 100 tests.
  10238. 960.08 s [vector] ifoldl': OK
  10239. 960.08 s [vector] +++ OK, passed 100 tests.
  10240. 960.09 s [vector] ifoldr: OK
  10241. 960.09 s [vector] +++ OK, passed 100 tests.
  10242. 960.10 s [vector] ifoldr': OK
  10243. 960.10 s [vector] +++ OK, passed 100 tests.
  10244. 960.10 s [vector] ifoldM: OK
  10245. 960.10 s [vector] +++ OK, passed 100 tests.
  10246. 960.12 s [vector] ifoldM': OK
  10247. 960.12 s [vector] +++ OK, passed 100 tests.
  10248. 960.16 s [vector] ifoldM_: OK (0.05s)
  10249. 960.16 s [vector] +++ OK, passed 100 tests.
  10250. 960.20 s [vector] ifoldM'_: OK (0.04s)
  10251. 960.20 s [vector] +++ OK, passed 100 tests.
  10252. 960.20 s [vector] all: OK
  10253. 960.20 s [vector] +++ OK, passed 100 tests.
  10254. 960.21 s [vector] any: OK
  10255. 960.22 s [vector] +++ OK, passed 100 tests.
  10256. 960.22 s [vector] prescanl: OK
  10257. 960.22 s [vector] +++ OK, passed 100 tests.
  10258. 960.23 s [vector] prescanl': OK
  10259. 960.23 s [vector] +++ OK, passed 100 tests.
  10260. 960.23 s [vector] postscanl: OK
  10261. 960.23 s [vector] +++ OK, passed 100 tests.
  10262. 960.24 s [vector] postscanl': OK
  10263. 960.24 s [vector] +++ OK, passed 100 tests.
  10264. 960.25 s [vector] scanl: OK
  10265. 960.25 s [vector] +++ OK, passed 100 tests.
  10266. 960.26 s [vector] scanl': OK
  10267. 960.26 s [vector] +++ OK, passed 100 tests.
  10268. 960.27 s [vector] scanl1: OK
  10269. 960.28 s [vector] +++ OK, passed 100 tests.
  10270. 960.28 s [vector] scanl1': OK
  10271. 960.28 s [vector] +++ OK, passed 100 tests.
  10272. 960.28 s [vector] iscanl: OK
  10273. 960.28 s [vector] +++ OK, passed 100 tests.
  10274. 960.30 s [vector] iscanl': OK (0.01s)
  10275. 960.30 s [vector] +++ OK, passed 100 tests.
  10276. 960.30 s [vector] prescanr: OK
  10277. 960.31 s [vector] +++ OK, passed 100 tests.
  10278. 960.31 s [vector] prescanr': OK
  10279. 960.31 s [vector] +++ OK, passed 100 tests.
  10280. 960.32 s [vector] postscanr: OK
  10281. 960.32 s [vector] +++ OK, passed 100 tests.
  10282. 960.32 s [vector] postscanr': OK
  10283. 960.32 s [vector] +++ OK, passed 100 tests.
  10284. 960.34 s [vector] scanr: OK
  10285. 960.34 s [vector] +++ OK, passed 100 tests.
  10286. 960.34 s [vector] scanr': OK
  10287. 960.34 s [vector] +++ OK, passed 100 tests.
  10288. 960.35 s [vector] scanr1: OK
  10289. 960.35 s [vector] +++ OK, passed 100 tests.
  10290. 960.36 s [vector] scanr1': OK
  10291. 960.36 s [vector] +++ OK, passed 100 tests.
  10292. 960.37 s [vector] iscanr: OK
  10293. 960.38 s [vector] +++ OK, passed 100 tests.
  10294. 960.38 s [vector] iscanr': OK
  10295. 960.38 s [vector] +++ OK, passed 100 tests.
  10296. 960.38 s [vector] mut_read: OK
  10297. 960.38 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10298. 960.38 s [vector] mut_write: OK
  10299. 960.38 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10300. 960.38 s [vector] mut_modify: OK
  10301. 960.38 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10302. 960.41 s [vector] mut_generate: OK
  10303. 960.41 s [vector] +++ OK, passed 100 tests.
  10304. 960.42 s [vector] mut_generateM: OK (0.04s)
  10305. 960.42 s [vector] +++ OK, passed 100 tests.
  10306. 960.48 s [vector] mut_mapM_: OK (0.06s)
  10307. 960.48 s [vector] +++ OK, passed 100 tests.
  10308. 960.54 s [vector] mut_imapM_: OK (0.05s)
  10309. 960.54 s [vector] +++ OK, passed 100 tests.
  10310. 960.58 s [vector] mut_forM_: OK (0.05s)
  10311. 960.58 s [vector] +++ OK, passed 100 tests.
  10312. 960.64 s [vector] mut_iforM_: OK (0.06s)
  10313. 960.64 s [vector] +++ OK, passed 100 tests.
  10314. 960.66 s [vector] mut_foldr: OK (0.01s)
  10315. 960.66 s [vector] +++ OK, passed 100 tests.
  10316. 960.66 s [vector] mut_foldr': OK
  10317. 960.66 s [vector] +++ OK, passed 100 tests.
  10318. 960.67 s [vector] mut_foldl: OK
  10319. 960.68 s [vector] +++ OK, passed 100 tests.
  10320. 960.68 s [vector] mut_foldl': OK
  10321. 960.68 s [vector] +++ OK, passed 100 tests.
  10322. 960.68 s [vector] mut_ifoldr: OK
  10323. 960.68 s [vector] +++ OK, passed 100 tests.
  10324. 960.69 s [vector] mut_ifoldr': OK
  10325. 960.69 s [vector] +++ OK, passed 100 tests.
  10326. 960.70 s [vector] mut_ifoldl: OK
  10327. 960.70 s [vector] +++ OK, passed 100 tests.
  10328. 960.72 s [vector] mut_ifoldl': OK
  10329. 960.72 s [vector] +++ OK, passed 100 tests.
  10330. 960.72 s [vector] mut_foldM: OK
  10331. 960.72 s [vector] +++ OK, passed 100 tests.
  10332. 960.72 s [vector] mut_foldM': OK
  10333. 960.73 s [vector] +++ OK, passed 100 tests.
  10334. 960.73 s [vector] mut_foldrM: OK
  10335. 960.73 s [vector] +++ OK, passed 100 tests.
  10336. 960.74 s [vector] mut_foldrM': OK
  10337. 960.74 s [vector] +++ OK, passed 100 tests.
  10338. 960.75 s [vector] mut_ifoldM: OK
  10339. 960.75 s [vector] +++ OK, passed 100 tests.
  10340. 960.76 s [vector] mut_ifoldM': OK
  10341. 960.76 s [vector] +++ OK, passed 100 tests.
  10342. 960.77 s [vector] mut_ifoldrM: OK
  10343. 960.77 s [vector] +++ OK, passed 100 tests.
  10344. 960.77 s [vector] mut_ifoldrM': OK
  10345. 960.77 s [vector] +++ OK, passed 100 tests.
  10346. 960.78 s [vector] compare: OK
  10347. 960.78 s [vector] +++ OK, passed 100 tests.
  10348. 960.78 s [vector] maximum: OK
  10349. 960.78 s [vector] +++ OK, passed 100 tests; 25 discarded.
  10350. 960.78 s [vector] minimum: OK
  10351. 960.78 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10352. 960.78 s [vector] minIndex: OK
  10353. 960.78 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10354. 960.78 s [vector] maxIndex: OK
  10355. 960.78 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10356. 960.79 s [vector] maximumBy: OK
  10357. 960.79 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10358. 960.79 s [vector] minimumBy: OK
  10359. 960.79 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10360. 960.79 s [vector] maximumOn: OK
  10361. 960.79 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10362. 960.79 s [vector] minimumOn: OK
  10363. 960.79 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10364. 960.79 s [vector] maxIndexBy: OK
  10365. 960.79 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10366. 960.79 s [vector] minIndexBy: OK
  10367. 960.79 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10368. 960.79 s [vector] ListFirstMaxIndexWins: OK
  10369. 960.79 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10370. 960.79 s [vector] FalseListFirstMaxIndexWins: OK
  10371. 960.80 s [vector] +++ OK, failed as expected. (after 1 test):
  10372. 960.80 s [vector] Exception:
  10373. 960.80 s [vector] Prelude.foldr1: empty list
  10374. 960.80 s [vector] CallStack (from HasCallStack):
  10375. 960.80 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  10376. 960.80 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  10377. 960.80 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  10378. 960.80 s [vector] []
  10379. 960.80 s [vector] zip: OK
  10380. 960.80 s [vector] +++ OK, passed 100 tests.
  10381. 960.81 s [vector] zip3: OK
  10382. 960.81 s [vector] +++ OK, passed 100 tests.
  10383. 960.82 s [vector] unzip: OK
  10384. 960.82 s [vector] +++ OK, passed 100 tests.
  10385. 960.82 s [vector] unzip3: OK
  10386. 960.82 s [vector] +++ OK, passed 100 tests.
  10387. 960.82 s [vector] indexed: OK
  10388. 960.82 s [vector] +++ OK, passed 100 tests.
  10389. 960.83 s [vector] update: OK
  10390. 960.83 s [vector] +++ OK, passed 100 tests.
  10391. 960.84 s [vector] mempty: OK
  10392. 960.84 s [vector] +++ OK, passed 100 tests.
  10393. 960.84 s [vector] mappend: OK
  10394. 960.84 s [vector] +++ OK, passed 100 tests.
  10395. 960.91 s [vector] mconcat: OK (0.07s)
  10396. 960.91 s [vector] +++ OK, passed 100 tests.
  10397. 960.91 s [vector] glength: OK
  10398. 960.91 s [vector] +++ OK, passed 100 tests.
  10399. 960.91 s [vector] unstream
  10400. 960.91 s [vector] unstream == vunstream (exact): OK
  10401. 960.92 s [vector] +++ OK, passed 100 tests.
  10402. 960.92 s [vector] unstream == vunstream (unknown): OK
  10403. 960.92 s [vector] +++ OK, passed 100 tests.
  10404. 960.92 s [vector] unstreamR ~= vunstream (exact): OK
  10405. 960.92 s [vector] +++ OK, passed 100 tests.
  10406. 960.92 s [vector] unstreamR ~= vunstream (unknown): OK
  10407. 960.92 s [vector] +++ OK, passed 100 tests.
  10408. 960.92 s [vector] Data.Vector.Storable.Vector Alignment
  10409. 960.92 s [vector] Aligned Double: OK
  10410. 960.92 s [vector] Aligned Int: OK
  10411. 960.92 s [vector] Regression tests
  10412. 960.92 s [vector] enumFromTo crash #188
  10413. 960.92 s [vector] Word8: OK
  10414. 960.92 s [vector] Word16: OK
  10415. 960.92 s [vector] Word32: OK
  10416. 960.92 s [vector] Word64: OK
  10417. 960.92 s [vector] Word: OK
  10418. 960.92 s [vector] Int8: OK
  10419. 960.92 s [vector] Int16: OK
  10420. 960.92 s [vector] Int32: OK
  10421. 960.92 s [vector] Int64: OK
  10422. 960.92 s [vector] Int: OK
  10423. 960.92 s [vector] Char: OK
  10424. 960.92 s [vector] Negative tests
  10425. 960.92 s [vector] slice out of bounds #257
  10426. 960.92 s [vector] Boxed
  10427. 960.92 s [vector] Negative ix: OK
  10428. 960.92 s [vector] Negative size: OK
  10429. 960.92 s [vector] Negative ix and size: OK
  10430. 960.92 s [vector] Too large ix: OK
  10431. 960.92 s [vector] Too large size: OK
  10432. 960.92 s [vector] Too large ix and size: OK
  10433. 960.92 s [vector] Overflow: OK
  10434. 960.92 s [vector] OutOfMemory: OK
  10435. 960.92 s [vector] Primitive
  10436. 960.92 s [vector] Negative ix: OK
  10437. 960.92 s [vector] Negative size: OK
  10438. 960.92 s [vector] Negative ix and size: OK
  10439. 960.92 s [vector] Too large ix: OK
  10440. 960.92 s [vector] Too large size: OK
  10441. 960.92 s [vector] Too large ix and size: OK
  10442. 960.92 s [vector] Overflow: OK
  10443. 960.92 s [vector] OutOfMemory: OK
  10444. 960.92 s [vector] Storable
  10445. 960.92 s [vector] Negative ix: OK
  10446. 960.92 s [vector] Negative size: OK
  10447. 960.92 s [vector] Negative ix and size: OK
  10448. 960.92 s [vector] Too large ix: OK
  10449. 960.92 s [vector] Too large size: OK
  10450. 960.92 s [vector] Too large ix and size: OK
  10451. 960.92 s [vector] Overflow: OK
  10452. 960.92 s [vector] OutOfMemory: OK
  10453. 960.92 s [vector] Unboxed
  10454. 960.92 s [vector] Negative ix: OK
  10455. 960.92 s [vector] Negative size: OK
  10456. 960.92 s [vector] Negative ix and size: OK
  10457. 960.92 s [vector] Too large ix: OK
  10458. 960.92 s [vector] Too large size: OK
  10459. 960.92 s [vector] Too large ix and size: OK
  10460. 960.92 s [vector] Overflow: OK
  10461. 960.92 s [vector] OutOfMemory: OK
  10462. 960.92 s [vector] take #282
  10463. 960.92 s [vector] Boxed: OK
  10464. 960.92 s [vector] Primitive: OK
  10465. 960.92 s [vector] Storable: OK
  10466. 960.92 s [vector] Unboxed: OK
  10467. 960.92 s [vector] Data.Vector
  10468. 960.92 s [vector] MonadFix: OK
  10469. 960.92 s [vector] toFromArray: OK
  10470. 960.92 s [vector] toFromArraySlice: OK
  10471. 960.92 s [vector] toFromArraySliceUnsafe: OK
  10472. 960.92 s [vector] toFromMutableArray: OK
  10473. 960.92 s [vector] Data.Vector.Mutable (Move): OK
  10474. 960.92 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10475. 960.92 s [vector] Data.Vector.Primitive.Mutable (Move): OK
  10476. 960.93 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10477. 960.93 s [vector] Data.Vector.Unboxed.Mutable (Move): OK
  10478. 960.93 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10479. 960.93 s [vector] Data.Vector.Storable.Mutable (Move): OK
  10480. 960.94 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10481. 960.94 s [vector] Data.Vector.Generic.Mutable (nextPermutation): OK
  10482. 960.94 s [vector] +++ OK, passed 100 tests.
  10483. 960.94 s [vector] Data.Vector.Generic.Mutable (prevPermutation): OK
  10484. 960.95 s [vector] +++ OK, passed 100 tests.
  10485. 960.95 s [vector] Data.Vector.Generic.Mutable (nextPermutation then prevPermutation = id): OK
  10486. 960.95 s [vector] +++ OK, passed 100 tests.
  10487. 960.95 s [vector] Data.Vector.Generic.Mutable (prevPermutation then nextPermutation = id): OK
  10488. 960.95 s [vector] +++ OK, passed 100 tests.
  10489. 960.95 s [vector]
  10490. 960.95 s [vector] All 2808 tests passed (14.83s)
  10491. 960.96 s [vector] Test suite vector-tests-O0: PASS
  10492. 960.96 s [vector] Test suite logged to: dist/test/vector-0.13.2.0-vector-tests-O0.log
  10493. 960.96 s [vector] Test suite vector-tests-O2: RUNNING...
  10494. 961.18 s [vector] toplevel
  10495. 961.18 s [vector] Data.Vector.Fusion.Bundle
  10496. 961.18 s [vector] fromList.toList == id: OK
  10497. 961.18 s [vector] +++ OK, passed 100 tests.
  10498. 961.19 s [vector] toList.fromList == id: OK
  10499. 961.19 s [vector] +++ OK, passed 100 tests.
  10500. 961.19 s [vector] eq: OK
  10501. 961.19 s [vector] +++ OK, passed 100 tests.
  10502. 961.19 s [vector] length: OK
  10503. 961.19 s [vector] +++ OK, passed 100 tests.
  10504. 961.19 s [vector] null: OK
  10505. 961.19 s [vector] +++ OK, passed 100 tests.
  10506. 961.19 s [vector] empty: OK
  10507. 961.19 s [vector] +++ OK, passed 100 tests.
  10508. 961.19 s [vector] singleton: OK
  10509. 961.19 s [vector] +++ OK, passed 100 tests.
  10510. 961.19 s [vector] replicate: OK
  10511. 961.19 s [vector] +++ OK, passed 100 tests.
  10512. 961.19 s [vector] cons: OK
  10513. 961.19 s [vector] +++ OK, passed 100 tests.
  10514. 961.19 s [vector] snoc: OK
  10515. 961.19 s [vector] +++ OK, passed 100 tests.
  10516. 961.19 s [vector] append: OK
  10517. 961.19 s [vector] +++ OK, passed 100 tests.
  10518. 961.19 s [vector] head: OK
  10519. 961.19 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10520. 961.19 s [vector] last: OK
  10521. 961.19 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10522. 961.19 s [vector] index: OK
  10523. 961.19 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10524. 961.19 s [vector] extract: OK
  10525. 961.19 s [vector] +++ OK, passed 100 tests.
  10526. 961.19 s [vector] init: OK
  10527. 961.19 s [vector] +++ OK, passed 100 tests; 21 discarded.
  10528. 961.19 s [vector] tail: OK
  10529. 961.19 s [vector] +++ OK, passed 100 tests; 22 discarded.
  10530. 961.19 s [vector] take: OK
  10531. 961.19 s [vector] +++ OK, passed 100 tests.
  10532. 961.19 s [vector] drop: OK
  10533. 961.19 s [vector] +++ OK, passed 100 tests.
  10534. 961.19 s [vector] map: OK
  10535. 961.19 s [vector] +++ OK, passed 100 tests.
  10536. 961.19 s [vector] zipWith: OK
  10537. 961.19 s [vector] +++ OK, passed 100 tests.
  10538. 961.19 s [vector] zipWith3: OK
  10539. 961.19 s [vector] +++ OK, passed 100 tests.
  10540. 961.19 s [vector] filter: OK
  10541. 961.19 s [vector] +++ OK, passed 100 tests.
  10542. 961.19 s [vector] takeWhile: OK
  10543. 961.19 s [vector] +++ OK, passed 100 tests.
  10544. 961.19 s [vector] dropWhile: OK
  10545. 961.19 s [vector] +++ OK, passed 100 tests.
  10546. 961.19 s [vector] elem: OK
  10547. 961.19 s [vector] +++ OK, passed 100 tests.
  10548. 961.19 s [vector] notElem: OK
  10549. 961.19 s [vector] +++ OK, passed 100 tests.
  10550. 961.19 s [vector] find: OK
  10551. 961.19 s [vector] +++ OK, passed 100 tests.
  10552. 961.19 s [vector] findIndex: OK
  10553. 961.19 s [vector] +++ OK, passed 100 tests.
  10554. 961.19 s [vector] foldl: OK
  10555. 961.19 s [vector] +++ OK, passed 100 tests.
  10556. 961.19 s [vector] foldl1: OK
  10557. 961.19 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10558. 961.19 s [vector] foldl': OK
  10559. 961.19 s [vector] +++ OK, passed 100 tests.
  10560. 961.19 s [vector] foldl1': OK
  10561. 961.19 s [vector] +++ OK, passed 100 tests; 21 discarded.
  10562. 961.19 s [vector] foldr: OK
  10563. 961.19 s [vector] +++ OK, passed 100 tests.
  10564. 961.19 s [vector] foldr1: OK
  10565. 961.19 s [vector] +++ OK, passed 100 tests; 11 discarded.
  10566. 961.19 s [vector] prescanl: OK
  10567. 961.19 s [vector] +++ OK, passed 100 tests.
  10568. 961.19 s [vector] prescanl': OK
  10569. 961.19 s [vector] +++ OK, passed 100 tests.
  10570. 961.19 s [vector] postscanl: OK
  10571. 961.19 s [vector] +++ OK, passed 100 tests.
  10572. 961.19 s [vector] postscanl': OK
  10573. 961.19 s [vector] +++ OK, passed 100 tests.
  10574. 961.19 s [vector] scanl: OK
  10575. 961.19 s [vector] +++ OK, passed 100 tests.
  10576. 961.19 s [vector] scanl': OK
  10577. 961.19 s [vector] +++ OK, passed 100 tests.
  10578. 961.19 s [vector] scanl1: OK
  10579. 961.19 s [vector] +++ OK, passed 100 tests; 21 discarded.
  10580. 961.19 s [vector] scanl1': OK
  10581. 961.19 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10582. 961.19 s [vector] concatMap: OK
  10583. 961.19 s [vector] +++ OK, passed 100 tests.
  10584. 961.19 s [vector] unfoldr: OK
  10585. 961.19 s [vector] +++ OK, passed 100 tests.
  10586. 961.19 s [vector] and: OK
  10587. 961.19 s [vector] +++ OK, passed 100 tests.
  10588. 961.19 s [vector] or: OK
  10589. 961.19 s [vector] +++ OK, passed 100 tests.
  10590. 961.20 s [vector] Tests.Vector.Boxed
  10591. 961.20 s [vector] Bool
  10592. 961.20 s [vector] fromList.toList == id: OK
  10593. 961.20 s [vector] +++ OK, passed 100 tests.
  10594. 961.20 s [vector] toList.fromList == id: OK
  10595. 961.20 s [vector] +++ OK, passed 100 tests.
  10596. 961.20 s [vector] unstream.stream == id: OK
  10597. 961.20 s [vector] +++ OK, passed 100 tests.
  10598. 961.20 s [vector] stream.unstream == id: OK
  10599. 961.20 s [vector] +++ OK, passed 100 tests.
  10600. 961.20 s [vector] eq: OK
  10601. 961.20 s [vector] +++ OK, passed 100 tests.
  10602. 961.20 s [vector] length: OK
  10603. 961.20 s [vector] +++ OK, passed 100 tests.
  10604. 961.20 s [vector] null: OK
  10605. 961.20 s [vector] +++ OK, passed 100 tests.
  10606. 961.20 s [vector] index: OK
  10607. 961.20 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10608. 961.20 s [vector] safeIndex: OK
  10609. 961.20 s [vector] +++ OK, passed 100 tests.
  10610. 961.20 s [vector] head: OK
  10611. 961.20 s [vector] +++ OK, passed 100 tests; 21 discarded.
  10612. 961.20 s [vector] last: OK
  10613. 961.20 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10614. 961.20 s [vector] unsafeIndex: OK
  10615. 961.20 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10616. 961.20 s [vector] unsafeHead: OK
  10617. 961.20 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10618. 961.20 s [vector] unsafeLast: OK
  10619. 961.20 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10620. 961.20 s [vector] slice: OK
  10621. 961.20 s [vector] +++ OK, passed 100 tests.
  10622. 961.20 s [vector] init: OK
  10623. 961.20 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10624. 961.20 s [vector] tail: OK
  10625. 961.20 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10626. 961.20 s [vector] take: OK
  10627. 961.20 s [vector] +++ OK, passed 100 tests.
  10628. 961.20 s [vector] drop: OK
  10629. 961.20 s [vector] +++ OK, passed 100 tests.
  10630. 961.20 s [vector] splitAt: OK
  10631. 961.20 s [vector] +++ OK, passed 100 tests.
  10632. 961.20 s [vector] empty: OK
  10633. 961.20 s [vector] +++ OK, passed 100 tests.
  10634. 961.20 s [vector] singleton: OK
  10635. 961.20 s [vector] +++ OK, passed 100 tests.
  10636. 961.20 s [vector] replicate: OK
  10637. 961.20 s [vector] +++ OK, passed 100 tests.
  10638. 961.20 s [vector] generate: OK
  10639. 961.20 s [vector] +++ OK, passed 100 tests.
  10640. 961.20 s [vector] iterateN: OK
  10641. 961.20 s [vector] +++ OK, passed 100 tests.
  10642. 961.20 s [vector] iterateNM: OK (0.01s)
  10643. 961.20 s [vector] +++ OK, passed 100 tests.
  10644. 961.20 s [vector] generateM: OK (0.02s)
  10645. 961.20 s [vector] +++ OK, passed 100 tests.
  10646. 961.20 s [vector] replicateM: OK (0.01s)
  10647. 961.20 s [vector] +++ OK, passed 100 tests.
  10648. 961.20 s [vector] create: OK
  10649. 961.20 s [vector] +++ OK, passed 100 tests.
  10650. 961.20 s [vector] createT: OK
  10651. 961.20 s [vector] +++ OK, passed 100 tests.
  10652. 961.20 s [vector] unfoldr: OK
  10653. 961.20 s [vector] +++ OK, passed 100 tests.
  10654. 961.20 s [vector] unfoldrN: OK
  10655. 961.20 s [vector] +++ OK, passed 100 tests.
  10656. 961.20 s [vector] unfoldrExactN: OK
  10657. 961.20 s [vector] +++ OK, passed 100 tests.
  10658. 961.20 s [vector] unfoldrM: OK
  10659. 961.20 s [vector] +++ OK, passed 100 tests.
  10660. 961.20 s [vector] unfoldrNM: OK
  10661. 961.20 s [vector] +++ OK, passed 100 tests.
  10662. 961.20 s [vector] unfoldrExactNM: OK (0.02s)
  10663. 961.20 s [vector] +++ OK, passed 100 tests.
  10664. 961.20 s [vector] constructN: OK
  10665. 961.20 s [vector] +++ OK, passed 100 tests.
  10666. 961.20 s [vector] constructrN: OK
  10667. 961.20 s [vector] +++ OK, passed 100 tests.
  10668. 961.20 s [vector] cons: OK
  10669. 961.20 s [vector] +++ OK, passed 100 tests.
  10670. 961.20 s [vector] snoc: OK
  10671. 961.20 s [vector] +++ OK, passed 100 tests.
  10672. 961.20 s [vector] append: OK
  10673. 961.20 s [vector] +++ OK, passed 100 tests.
  10674. 961.20 s [vector] concat: OK
  10675. 961.20 s [vector] +++ OK, passed 100 tests.
  10676. 961.20 s [vector] force: OK
  10677. 961.20 s [vector] +++ OK, passed 100 tests.
  10678. 961.20 s [vector] upd: OK
  10679. 961.20 s [vector] +++ OK, passed 100 tests.
  10680. 961.20 s [vector] accum: OK
  10681. 961.20 s [vector] +++ OK, passed 100 tests.
  10682. 961.20 s [vector] reverse: OK
  10683. 961.20 s [vector] +++ OK, passed 100 tests.
  10684. 961.20 s [vector] backpermute: OK
  10685. 961.20 s [vector] +++ OK, passed 100 tests.
  10686. 961.20 s [vector] map: OK
  10687. 961.20 s [vector] +++ OK, passed 100 tests.
  10688. 961.20 s [vector] imap: OK
  10689. 961.20 s [vector] +++ OK, passed 100 tests.
  10690. 961.20 s [vector] concatMap: OK
  10691. 961.20 s [vector] +++ OK, passed 100 tests.
  10692. 961.20 s [vector] mapM: OK
  10693. 961.20 s [vector] +++ OK, passed 100 tests.
  10694. 961.20 s [vector] mapM_: OK (0.01s)
  10695. 961.20 s [vector] +++ OK, passed 100 tests.
  10696. 961.20 s [vector] forM: OK
  10697. 961.20 s [vector] +++ OK, passed 100 tests.
  10698. 961.20 s [vector] forM_: OK
  10699. 961.20 s [vector] +++ OK, passed 100 tests.
  10700. 961.20 s [vector] imapM: OK
  10701. 961.20 s [vector] +++ OK, passed 100 tests.
  10702. 961.20 s [vector] imapM_: OK (0.01s)
  10703. 961.20 s [vector] +++ OK, passed 100 tests.
  10704. 961.20 s [vector] zipWith: OK
  10705. 961.20 s [vector] +++ OK, passed 100 tests.
  10706. 961.20 s [vector] zipWith3: OK
  10707. 961.20 s [vector] +++ OK, passed 100 tests.
  10708. 961.21 s [vector] izipWith: OK
  10709. 961.21 s [vector] +++ OK, passed 100 tests.
  10710. 961.21 s [vector] izipWith3: OK
  10711. 961.21 s [vector] +++ OK, passed 100 tests.
  10712. 961.21 s [vector] izipWithM: OK
  10713. 961.21 s [vector] +++ OK, passed 100 tests.
  10714. 961.21 s [vector] izipWithM_: OK (0.02s)
  10715. 961.21 s [vector] +++ OK, passed 100 tests.
  10716. 961.21 s [vector] zipWithM: OK
  10717. 961.21 s [vector] +++ OK, passed 100 tests.
  10718. 961.21 s [vector] zipWithM_: OK
  10719. 961.21 s [vector] +++ OK, passed 100 tests.
  10720. 961.21 s [vector] filter: OK
  10721. 961.21 s [vector] +++ OK, passed 100 tests.
  10722. 961.21 s [vector] ifilter: OK
  10723. 961.21 s [vector] +++ OK, passed 100 tests.
  10724. 961.22 s [vector] filterM: OK (0.02s)
  10725. 961.22 s [vector] +++ OK, passed 100 tests.
  10726. 961.22 s [vector] uniq: OK
  10727. 961.22 s [vector] +++ OK, passed 100 tests.
  10728. 961.22 s [vector] mapMaybe: OK
  10729. 961.22 s [vector] +++ OK, passed 100 tests.
  10730. 961.22 s [vector] imapMaybe: OK
  10731. 961.22 s [vector] +++ OK, passed 100 tests.
  10732. 961.22 s [vector] takeWhile: OK
  10733. 961.22 s [vector] +++ OK, passed 100 tests.
  10734. 961.22 s [vector] dropWhile: OK
  10735. 961.22 s [vector] +++ OK, passed 100 tests.
  10736. 961.22 s [vector] partition: OK
  10737. 961.22 s [vector] +++ OK, passed 100 tests.
  10738. 961.23 s [vector] partitionWith: OK
  10739. 961.23 s [vector] +++ OK, passed 100 tests.
  10740. 961.23 s [vector] span: OK
  10741. 961.23 s [vector] +++ OK, passed 100 tests.
  10742. 961.23 s [vector] break: OK
  10743. 961.23 s [vector] +++ OK, passed 100 tests.
  10744. 961.23 s [vector] spanR: OK
  10745. 961.23 s [vector] +++ OK, passed 100 tests.
  10746. 961.23 s [vector] breakR: OK
  10747. 961.23 s [vector] +++ OK, passed 100 tests.
  10748. 961.23 s [vector] groupBy: OK
  10749. 961.23 s [vector] +++ OK, passed 100 tests.
  10750. 961.23 s [vector] elem: OK
  10751. 961.23 s [vector] +++ OK, passed 100 tests.
  10752. 961.23 s [vector] notElem: OK
  10753. 961.23 s [vector] +++ OK, passed 100 tests.
  10754. 961.23 s [vector] find: OK
  10755. 961.23 s [vector] +++ OK, passed 100 tests.
  10756. 961.23 s [vector] findIndex: OK
  10757. 961.23 s [vector] +++ OK, passed 100 tests.
  10758. 961.23 s [vector] findIndexR: OK
  10759. 961.23 s [vector] +++ OK, passed 100 tests.
  10760. 961.23 s [vector] findIndices: OK
  10761. 961.23 s [vector] +++ OK, passed 100 tests.
  10762. 961.23 s [vector] elemIndex: OK
  10763. 961.24 s [vector] +++ OK, passed 100 tests.
  10764. 961.24 s [vector] elemIndices: OK
  10765. 961.24 s [vector] +++ OK, passed 100 tests.
  10766. 961.24 s [vector] foldl: OK
  10767. 961.24 s [vector] +++ OK, passed 100 tests.
  10768. 961.24 s [vector] foldl1: OK
  10769. 961.24 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10770. 961.24 s [vector] foldl': OK
  10771. 961.24 s [vector] +++ OK, passed 100 tests.
  10772. 961.24 s [vector] foldl1': OK
  10773. 961.24 s [vector] +++ OK, passed 100 tests; 11 discarded.
  10774. 961.24 s [vector] foldr: OK
  10775. 961.24 s [vector] +++ OK, passed 100 tests.
  10776. 961.24 s [vector] foldr1: OK
  10777. 961.24 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10778. 961.24 s [vector] foldr': OK
  10779. 961.24 s [vector] +++ OK, passed 100 tests.
  10780. 961.25 s [vector] foldr1': OK
  10781. 961.25 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10782. 961.25 s [vector] ifoldl: OK
  10783. 961.25 s [vector] +++ OK, passed 100 tests.
  10784. 961.25 s [vector] ifoldl': OK
  10785. 961.25 s [vector] +++ OK, passed 100 tests.
  10786. 961.25 s [vector] ifoldr: OK
  10787. 961.25 s [vector] +++ OK, passed 100 tests.
  10788. 961.25 s [vector] ifoldr': OK
  10789. 961.25 s [vector] +++ OK, passed 100 tests.
  10790. 961.25 s [vector] ifoldM: OK
  10791. 961.25 s [vector] +++ OK, passed 100 tests.
  10792. 961.26 s [vector] ifoldM': OK
  10793. 961.27 s [vector] +++ OK, passed 100 tests.
  10794. 961.27 s [vector] ifoldM_: OK (0.01s)
  10795. 961.27 s [vector] +++ OK, passed 100 tests.
  10796. 961.27 s [vector] ifoldM'_: OK
  10797. 961.27 s [vector] +++ OK, passed 100 tests.
  10798. 961.27 s [vector] all: OK
  10799. 961.27 s [vector] +++ OK, passed 100 tests.
  10800. 961.28 s [vector] any: OK
  10801. 961.28 s [vector] +++ OK, passed 100 tests.
  10802. 961.28 s [vector] prescanl: OK
  10803. 961.28 s [vector] +++ OK, passed 100 tests.
  10804. 961.28 s [vector] prescanl': OK
  10805. 961.28 s [vector] +++ OK, passed 100 tests.
  10806. 961.28 s [vector] postscanl: OK
  10807. 961.28 s [vector] +++ OK, passed 100 tests.
  10808. 961.28 s [vector] postscanl': OK
  10809. 961.28 s [vector] +++ OK, passed 100 tests.
  10810. 961.28 s [vector] scanl: OK
  10811. 961.28 s [vector] +++ OK, passed 100 tests.
  10812. 961.28 s [vector] scanl': OK
  10813. 961.28 s [vector] +++ OK, passed 100 tests.
  10814. 961.29 s [vector] scanl1: OK
  10815. 961.29 s [vector] +++ OK, passed 100 tests.
  10816. 961.29 s [vector] scanl1': OK
  10817. 961.29 s [vector] +++ OK, passed 100 tests.
  10818. 961.29 s [vector] iscanl: OK
  10819. 961.29 s [vector] +++ OK, passed 100 tests.
  10820. 961.29 s [vector] iscanl': OK
  10821. 961.29 s [vector] +++ OK, passed 100 tests.
  10822. 961.29 s [vector] prescanr: OK
  10823. 961.29 s [vector] +++ OK, passed 100 tests.
  10824. 961.30 s [vector] prescanr': OK
  10825. 961.30 s [vector] +++ OK, passed 100 tests.
  10826. 961.30 s [vector] postscanr: OK
  10827. 961.30 s [vector] +++ OK, passed 100 tests.
  10828. 961.30 s [vector] postscanr': OK
  10829. 961.30 s [vector] +++ OK, passed 100 tests.
  10830. 961.30 s [vector] scanr: OK
  10831. 961.30 s [vector] +++ OK, passed 100 tests.
  10832. 961.30 s [vector] scanr': OK
  10833. 961.30 s [vector] +++ OK, passed 100 tests.
  10834. 961.30 s [vector] scanr1: OK
  10835. 961.30 s [vector] +++ OK, passed 100 tests.
  10836. 961.30 s [vector] scanr1': OK
  10837. 961.30 s [vector] +++ OK, passed 100 tests.
  10838. 961.30 s [vector] iscanr: OK
  10839. 961.30 s [vector] +++ OK, passed 100 tests.
  10840. 961.30 s [vector] iscanr': OK
  10841. 961.30 s [vector] +++ OK, passed 100 tests.
  10842. 961.30 s [vector] mut_read: OK
  10843. 961.31 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10844. 961.31 s [vector] mut_write: OK
  10845. 961.31 s [vector] +++ OK, passed 100 tests; 22 discarded.
  10846. 961.31 s [vector] mut_modify: OK
  10847. 961.31 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10848. 961.31 s [vector] mut_generate: OK
  10849. 961.31 s [vector] +++ OK, passed 100 tests.
  10850. 961.31 s [vector] mut_generateM: OK
  10851. 961.31 s [vector] +++ OK, passed 100 tests.
  10852. 961.32 s [vector] mut_mapM_: OK
  10853. 961.32 s [vector] +++ OK, passed 100 tests.
  10854. 961.33 s [vector] mut_imapM_: OK
  10855. 961.33 s [vector] +++ OK, passed 100 tests.
  10856. 961.34 s [vector] mut_forM_: OK
  10857. 961.34 s [vector] +++ OK, passed 100 tests.
  10858. 961.35 s [vector] mut_iforM_: OK
  10859. 961.35 s [vector] +++ OK, passed 100 tests.
  10860. 961.35 s [vector] mut_foldr: OK
  10861. 961.35 s [vector] +++ OK, passed 100 tests.
  10862. 961.35 s [vector] mut_foldr': OK
  10863. 961.35 s [vector] +++ OK, passed 100 tests.
  10864. 961.35 s [vector] mut_foldl: OK
  10865. 961.35 s [vector] +++ OK, passed 100 tests.
  10866. 961.35 s [vector] mut_foldl': OK
  10867. 961.35 s [vector] +++ OK, passed 100 tests.
  10868. 961.35 s [vector] mut_ifoldr: OK
  10869. 961.35 s [vector] +++ OK, passed 100 tests.
  10870. 961.35 s [vector] mut_ifoldr': OK
  10871. 961.36 s [vector] +++ OK, passed 100 tests.
  10872. 961.36 s [vector] mut_ifoldl: OK
  10873. 961.36 s [vector] +++ OK, passed 100 tests.
  10874. 961.36 s [vector] mut_ifoldl': OK
  10875. 961.36 s [vector] +++ OK, passed 100 tests.
  10876. 961.36 s [vector] mut_foldM: OK
  10877. 961.36 s [vector] +++ OK, passed 100 tests.
  10878. 961.36 s [vector] mut_foldM': OK
  10879. 961.36 s [vector] +++ OK, passed 100 tests.
  10880. 961.36 s [vector] mut_foldrM: OK
  10881. 961.36 s [vector] +++ OK, passed 100 tests.
  10882. 961.36 s [vector] mut_foldrM': OK
  10883. 961.36 s [vector] +++ OK, passed 100 tests.
  10884. 961.36 s [vector] mut_ifoldM: OK
  10885. 961.36 s [vector] +++ OK, passed 100 tests.
  10886. 961.37 s [vector] mut_ifoldM': OK
  10887. 961.37 s [vector] +++ OK, passed 100 tests.
  10888. 961.37 s [vector] mut_ifoldrM: OK
  10889. 961.37 s [vector] +++ OK, passed 100 tests.
  10890. 961.37 s [vector] mut_ifoldrM': OK
  10891. 961.37 s [vector] +++ OK, passed 100 tests.
  10892. 961.37 s [vector] compare: OK
  10893. 961.37 s [vector] +++ OK, passed 100 tests.
  10894. 961.37 s [vector] maximum: OK
  10895. 961.37 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10896. 961.37 s [vector] minimum: OK
  10897. 961.37 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10898. 961.37 s [vector] minIndex: OK
  10899. 961.37 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10900. 961.37 s [vector] maxIndex: OK
  10901. 961.37 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10902. 961.37 s [vector] maximumBy: OK
  10903. 961.37 s [vector] +++ OK, passed 100 tests; 22 discarded.
  10904. 961.37 s [vector] minimumBy: OK
  10905. 961.37 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10906. 961.37 s [vector] maximumOn: OK
  10907. 961.37 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10908. 961.37 s [vector] minimumOn: OK
  10909. 961.37 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10910. 961.37 s [vector] maxIndexBy: OK
  10911. 961.37 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10912. 961.37 s [vector] minIndexBy: OK
  10913. 961.37 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10914. 961.37 s [vector] ListFirstMaxIndexWins: OK
  10915. 961.37 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10916. 961.38 s [vector] FalseListFirstMaxIndexWins: OK
  10917. 961.38 s [vector] +++ OK, failed as expected. (after 1 test):
  10918. 961.38 s [vector] Exception:
  10919. 961.38 s [vector] Prelude.foldr1: empty list
  10920. 961.38 s [vector] CallStack (from HasCallStack):
  10921. 961.38 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  10922. 961.38 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  10923. 961.38 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  10924. 961.38 s [vector] []
  10925. 961.38 s [vector] zip: OK
  10926. 961.38 s [vector] +++ OK, passed 100 tests.
  10927. 961.38 s [vector] zip3: OK
  10928. 961.38 s [vector] +++ OK, passed 100 tests.
  10929. 961.38 s [vector] unzip: OK
  10930. 961.38 s [vector] +++ OK, passed 100 tests.
  10931. 961.38 s [vector] unzip3: OK
  10932. 961.38 s [vector] +++ OK, passed 100 tests.
  10933. 961.38 s [vector] indexed: OK
  10934. 961.38 s [vector] +++ OK, passed 100 tests.
  10935. 961.39 s [vector] update: OK
  10936. 961.39 s [vector] +++ OK, passed 100 tests.
  10937. 961.39 s [vector] concat: OK
  10938. 961.39 s [vector] +++ OK, passed 100 tests.
  10939. 961.39 s [vector] mempty: OK
  10940. 961.39 s [vector] +++ OK, passed 100 tests.
  10941. 961.39 s [vector] mappend: OK
  10942. 961.39 s [vector] +++ OK, passed 100 tests.
  10943. 961.39 s [vector] mconcat: OK
  10944. 961.39 s [vector] +++ OK, passed 100 tests.
  10945. 961.39 s [vector] fmap: OK
  10946. 961.39 s [vector] +++ OK, passed 100 tests.
  10947. 961.40 s [vector] return: OK
  10948. 961.40 s [vector] +++ OK, passed 100 tests.
  10949. 961.40 s [vector] bind: OK
  10950. 961.40 s [vector] +++ OK, passed 100 tests.
  10951. 961.40 s [vector] mzip: OK
  10952. 961.40 s [vector] +++ OK, passed 100 tests.
  10953. 961.40 s [vector] munzip: OK
  10954. 961.40 s [vector] +++ OK, passed 100 tests.
  10955. 961.41 s [vector] applicative_pure: OK
  10956. 961.41 s [vector] +++ OK, passed 100 tests.
  10957. 961.42 s [vector] applicative_appl: OK (0.01s)
  10958. 961.42 s [vector] +++ OK, passed 100 tests.
  10959. 961.42 s [vector] alternative_empty: OK
  10960. 961.42 s [vector] +++ OK, passed 100 tests.
  10961. 961.42 s [vector] alternative_or: OK
  10962. 961.43 s [vector] +++ OK, passed 100 tests.
  10963. 961.45 s [vector] sequence: OK (0.02s)
  10964. 961.45 s [vector] +++ OK, passed 100 tests.
  10965. 961.45 s [vector] sequence_: OK
  10966. 961.45 s [vector] +++ OK, passed 100 tests.
  10967. 961.45 s [vector] glength: OK
  10968. 961.45 s [vector] +++ OK, passed 100 tests.
  10969. 961.45 s [vector] and: OK
  10970. 961.45 s [vector] +++ OK, passed 100 tests.
  10971. 961.45 s [vector] or: OK
  10972. 961.45 s [vector] +++ OK, passed 100 tests.
  10973. 961.45 s [vector] Int
  10974. 961.45 s [vector] fromList.toList == id: OK
  10975. 961.45 s [vector] +++ OK, passed 100 tests.
  10976. 961.45 s [vector] toList.fromList == id: OK
  10977. 961.45 s [vector] +++ OK, passed 100 tests.
  10978. 961.45 s [vector] unstream.stream == id: OK
  10979. 961.45 s [vector] +++ OK, passed 100 tests.
  10980. 961.45 s [vector] stream.unstream == id: OK
  10981. 961.45 s [vector] +++ OK, passed 100 tests.
  10982. 961.45 s [vector] eq: OK
  10983. 961.45 s [vector] +++ OK, passed 100 tests.
  10984. 961.45 s [vector] length: OK
  10985. 961.45 s [vector] +++ OK, passed 100 tests.
  10986. 961.45 s [vector] null: OK
  10987. 961.45 s [vector] +++ OK, passed 100 tests.
  10988. 961.45 s [vector] index: OK
  10989. 961.45 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10990. 961.46 s [vector] safeIndex: OK
  10991. 961.46 s [vector] +++ OK, passed 100 tests.
  10992. 961.46 s [vector] head: OK
  10993. 961.46 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10994. 961.46 s [vector] last: OK
  10995. 961.46 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10996. 961.46 s [vector] unsafeIndex: OK
  10997. 961.46 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10998. 961.46 s [vector] unsafeHead: OK
  10999. 961.46 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11000. 961.46 s [vector] unsafeLast: OK
  11001. 961.46 s [vector] +++ OK, passed 100 tests; 10 discarded.
  11002. 961.46 s [vector] slice: OK
  11003. 961.46 s [vector] +++ OK, passed 100 tests.
  11004. 961.46 s [vector] init: OK
  11005. 961.46 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11006. 961.46 s [vector] tail: OK
  11007. 961.46 s [vector] +++ OK, passed 100 tests; 21 discarded.
  11008. 961.46 s [vector] take: OK
  11009. 961.46 s [vector] +++ OK, passed 100 tests.
  11010. 961.46 s [vector] drop: OK
  11011. 961.46 s [vector] +++ OK, passed 100 tests.
  11012. 961.46 s [vector] splitAt: OK
  11013. 961.46 s [vector] +++ OK, passed 100 tests.
  11014. 961.46 s [vector] empty: OK
  11015. 961.46 s [vector] +++ OK, passed 100 tests.
  11016. 961.46 s [vector] singleton: OK
  11017. 961.46 s [vector] +++ OK, passed 100 tests.
  11018. 961.46 s [vector] replicate: OK
  11019. 961.46 s [vector] +++ OK, passed 100 tests.
  11020. 961.47 s [vector] generate: OK
  11021. 961.47 s [vector] +++ OK, passed 100 tests.
  11022. 961.47 s [vector] iterateN: OK
  11023. 961.47 s [vector] +++ OK, passed 100 tests.
  11024. 961.47 s [vector] iterateNM: OK
  11025. 961.47 s [vector] +++ OK, passed 100 tests.
  11026. 961.50 s [vector] generateM: OK (0.02s)
  11027. 961.50 s [vector] +++ OK, passed 100 tests.
  11028. 961.50 s [vector] replicateM: OK
  11029. 961.50 s [vector] +++ OK, passed 100 tests.
  11030. 961.50 s [vector] create: OK
  11031. 961.50 s [vector] +++ OK, passed 100 tests.
  11032. 961.50 s [vector] createT: OK
  11033. 961.50 s [vector] +++ OK, passed 100 tests.
  11034. 961.50 s [vector] unfoldr: OK
  11035. 961.50 s [vector] +++ OK, passed 100 tests.
  11036. 961.50 s [vector] unfoldrN: OK
  11037. 961.51 s [vector] +++ OK, passed 100 tests.
  11038. 961.51 s [vector] unfoldrExactN: OK
  11039. 961.51 s [vector] +++ OK, passed 100 tests.
  11040. 961.51 s [vector] unfoldrM: OK
  11041. 961.51 s [vector] +++ OK, passed 100 tests.
  11042. 961.51 s [vector] unfoldrNM: OK
  11043. 961.51 s [vector] +++ OK, passed 100 tests.
  11044. 961.52 s [vector] unfoldrExactNM: OK
  11045. 961.52 s [vector] +++ OK, passed 100 tests.
  11046. 961.52 s [vector] constructN: OK
  11047. 961.52 s [vector] +++ OK, passed 100 tests.
  11048. 961.52 s [vector] constructrN: OK
  11049. 961.52 s [vector] +++ OK, passed 100 tests.
  11050. 961.52 s [vector] cons: OK
  11051. 961.52 s [vector] +++ OK, passed 100 tests.
  11052. 961.52 s [vector] snoc: OK
  11053. 961.53 s [vector] +++ OK, passed 100 tests.
  11054. 961.53 s [vector] append: OK
  11055. 961.53 s [vector] +++ OK, passed 100 tests.
  11056. 961.54 s [vector] concat: OK (0.02s)
  11057. 961.54 s [vector] +++ OK, passed 100 tests.
  11058. 961.54 s [vector] force: OK
  11059. 961.54 s [vector] +++ OK, passed 100 tests.
  11060. 961.54 s [vector] upd: OK
  11061. 961.55 s [vector] +++ OK, passed 100 tests.
  11062. 961.55 s [vector] accum: OK
  11063. 961.55 s [vector] +++ OK, passed 100 tests.
  11064. 961.55 s [vector] reverse: OK
  11065. 961.55 s [vector] +++ OK, passed 100 tests.
  11066. 961.55 s [vector] backpermute: OK
  11067. 961.55 s [vector] +++ OK, passed 100 tests.
  11068. 961.55 s [vector] map: OK
  11069. 961.56 s [vector] +++ OK, passed 100 tests.
  11070. 961.57 s [vector] imap: OK
  11071. 961.57 s [vector] +++ OK, passed 100 tests.
  11072. 961.57 s [vector] concatMap: OK
  11073. 961.57 s [vector] +++ OK, passed 100 tests.
  11074. 961.57 s [vector] mapM: OK
  11075. 961.57 s [vector] +++ OK, passed 100 tests.
  11076. 961.57 s [vector] mapM_: OK (0.01s)
  11077. 961.57 s [vector] +++ OK, passed 100 tests.
  11078. 961.57 s [vector] forM: OK
  11079. 961.57 s [vector] +++ OK, passed 100 tests.
  11080. 961.59 s [vector] forM_: OK
  11081. 961.59 s [vector] +++ OK, passed 100 tests.
  11082. 961.59 s [vector] imapM: OK
  11083. 961.59 s [vector] +++ OK, passed 100 tests.
  11084. 961.61 s [vector] imapM_: OK
  11085. 961.61 s [vector] +++ OK, passed 100 tests.
  11086. 961.62 s [vector] zipWith: OK
  11087. 961.62 s [vector] +++ OK, passed 100 tests.
  11088. 961.62 s [vector] zipWith3: OK
  11089. 961.62 s [vector] +++ OK, passed 100 tests.
  11090. 961.62 s [vector] izipWith: OK
  11091. 961.62 s [vector] +++ OK, passed 100 tests.
  11092. 961.62 s [vector] izipWith3: OK
  11093. 961.62 s [vector] +++ OK, passed 100 tests.
  11094. 961.62 s [vector] izipWithM: OK
  11095. 961.62 s [vector] +++ OK, passed 100 tests.
  11096. 961.64 s [vector] izipWithM_: OK
  11097. 961.64 s [vector] +++ OK, passed 100 tests.
  11098. 961.64 s [vector] zipWithM: OK
  11099. 961.64 s [vector] +++ OK, passed 100 tests.
  11100. 961.65 s [vector] zipWithM_: OK (0.01s)
  11101. 961.65 s [vector] +++ OK, passed 100 tests.
  11102. 961.65 s [vector] filter: OK
  11103. 961.65 s [vector] +++ OK, passed 100 tests.
  11104. 961.65 s [vector] ifilter: OK
  11105. 961.65 s [vector] +++ OK, passed 100 tests.
  11106. 961.68 s [vector] filterM: OK
  11107. 961.68 s [vector] +++ OK, passed 100 tests.
  11108. 961.68 s [vector] uniq: OK
  11109. 961.68 s [vector] +++ OK, passed 100 tests.
  11110. 961.68 s [vector] mapMaybe: OK
  11111. 961.68 s [vector] +++ OK, passed 100 tests.
  11112. 961.69 s [vector] imapMaybe: OK
  11113. 961.69 s [vector] +++ OK, passed 100 tests.
  11114. 961.69 s [vector] takeWhile: OK
  11115. 961.69 s [vector] +++ OK, passed 100 tests.
  11116. 961.69 s [vector] dropWhile: OK
  11117. 961.69 s [vector] +++ OK, passed 100 tests.
  11118. 961.69 s [vector] partition: OK
  11119. 961.69 s [vector] +++ OK, passed 100 tests.
  11120. 961.69 s [vector] partitionWith: OK
  11121. 961.69 s [vector] +++ OK, passed 100 tests.
  11122. 961.69 s [vector] span: OK
  11123. 961.69 s [vector] +++ OK, passed 100 tests.
  11124. 961.69 s [vector] break: OK
  11125. 961.69 s [vector] +++ OK, passed 100 tests.
  11126. 961.69 s [vector] spanR: OK
  11127. 961.69 s [vector] +++ OK, passed 100 tests.
  11128. 961.69 s [vector] breakR: OK
  11129. 961.69 s [vector] +++ OK, passed 100 tests.
  11130. 961.70 s [vector] groupBy: OK
  11131. 961.70 s [vector] +++ OK, passed 100 tests.
  11132. 961.70 s [vector] elem: OK
  11133. 961.70 s [vector] +++ OK, passed 100 tests.
  11134. 961.70 s [vector] notElem: OK
  11135. 961.70 s [vector] +++ OK, passed 100 tests.
  11136. 961.70 s [vector] find: OK
  11137. 961.70 s [vector] +++ OK, passed 100 tests.
  11138. 961.70 s [vector] findIndex: OK
  11139. 961.70 s [vector] +++ OK, passed 100 tests.
  11140. 961.70 s [vector] findIndexR: OK
  11141. 961.70 s [vector] +++ OK, passed 100 tests.
  11142. 961.70 s [vector] findIndices: OK
  11143. 961.70 s [vector] +++ OK, passed 100 tests.
  11144. 961.70 s [vector] elemIndex: OK
  11145. 961.70 s [vector] +++ OK, passed 100 tests.
  11146. 961.70 s [vector] elemIndices: OK
  11147. 961.70 s [vector] +++ OK, passed 100 tests.
  11148. 961.70 s [vector] foldl: OK
  11149. 961.70 s [vector] +++ OK, passed 100 tests.
  11150. 961.71 s [vector] foldl1: OK
  11151. 961.71 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11152. 961.71 s [vector] foldl': OK
  11153. 961.71 s [vector] +++ OK, passed 100 tests.
  11154. 961.71 s [vector] foldl1': OK
  11155. 961.71 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11156. 961.71 s [vector] foldr: OK
  11157. 961.71 s [vector] +++ OK, passed 100 tests.
  11158. 961.71 s [vector] foldr1: OK
  11159. 961.71 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11160. 961.71 s [vector] foldr': OK
  11161. 961.72 s [vector] +++ OK, passed 100 tests.
  11162. 961.72 s [vector] foldr1': OK
  11163. 961.72 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11164. 961.72 s [vector] ifoldl: OK
  11165. 961.72 s [vector] +++ OK, passed 100 tests.
  11166. 961.72 s [vector] ifoldl': OK
  11167. 961.73 s [vector] +++ OK, passed 100 tests.
  11168. 961.73 s [vector] ifoldr: OK
  11169. 961.73 s [vector] +++ OK, passed 100 tests.
  11170. 961.73 s [vector] ifoldr': OK
  11171. 961.73 s [vector] +++ OK, passed 100 tests.
  11172. 961.73 s [vector] ifoldM: OK
  11173. 961.73 s [vector] +++ OK, passed 100 tests.
  11174. 961.73 s [vector] ifoldM': OK
  11175. 961.75 s [vector] +++ OK, passed 100 tests.
  11176. 961.75 s [vector] ifoldM_: OK (0.02s)
  11177. 961.75 s [vector] +++ OK, passed 100 tests.
  11178. 961.77 s [vector] ifoldM'_: OK (0.02s)
  11179. 961.77 s [vector] +++ OK, passed 100 tests.
  11180. 961.77 s [vector] all: OK
  11181. 961.77 s [vector] +++ OK, passed 100 tests.
  11182. 961.77 s [vector] any: OK
  11183. 961.77 s [vector] +++ OK, passed 100 tests.
  11184. 961.77 s [vector] prescanl: OK
  11185. 961.77 s [vector] +++ OK, passed 100 tests.
  11186. 961.78 s [vector] prescanl': OK
  11187. 961.78 s [vector] +++ OK, passed 100 tests.
  11188. 961.78 s [vector] postscanl: OK
  11189. 961.78 s [vector] +++ OK, passed 100 tests.
  11190. 961.78 s [vector] postscanl': OK
  11191. 961.78 s [vector] +++ OK, passed 100 tests.
  11192. 961.78 s [vector] scanl: OK
  11193. 961.78 s [vector] +++ OK, passed 100 tests.
  11194. 961.78 s [vector] scanl': OK
  11195. 961.78 s [vector] +++ OK, passed 100 tests.
  11196. 961.78 s [vector] scanl1: OK
  11197. 961.79 s [vector] +++ OK, passed 100 tests.
  11198. 961.79 s [vector] scanl1': OK
  11199. 961.79 s [vector] +++ OK, passed 100 tests.
  11200. 961.79 s [vector] iscanl: OK
  11201. 961.79 s [vector] +++ OK, passed 100 tests.
  11202. 961.80 s [vector] iscanl': OK
  11203. 961.80 s [vector] +++ OK, passed 100 tests.
  11204. 961.80 s [vector] prescanr: OK
  11205. 961.80 s [vector] +++ OK, passed 100 tests.
  11206. 961.80 s [vector] prescanr': OK
  11207. 961.80 s [vector] +++ OK, passed 100 tests.
  11208. 961.80 s [vector] postscanr: OK
  11209. 961.80 s [vector] +++ OK, passed 100 tests.
  11210. 961.81 s [vector] postscanr': OK
  11211. 961.81 s [vector] +++ OK, passed 100 tests.
  11212. 961.81 s [vector] scanr: OK
  11213. 961.81 s [vector] +++ OK, passed 100 tests.
  11214. 961.81 s [vector] scanr': OK
  11215. 961.81 s [vector] +++ OK, passed 100 tests.
  11216. 961.82 s [vector] scanr1: OK
  11217. 961.82 s [vector] +++ OK, passed 100 tests.
  11218. 961.82 s [vector] scanr1': OK
  11219. 961.82 s [vector] +++ OK, passed 100 tests.
  11220. 961.82 s [vector] iscanr: OK
  11221. 961.82 s [vector] +++ OK, passed 100 tests.
  11222. 961.82 s [vector] iscanr': OK
  11223. 961.82 s [vector] +++ OK, passed 100 tests.
  11224. 961.82 s [vector] mut_read: OK
  11225. 961.82 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11226. 961.82 s [vector] mut_write: OK
  11227. 961.82 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11228. 961.82 s [vector] mut_modify: OK
  11229. 961.82 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11230. 961.83 s [vector] mut_generate: OK
  11231. 961.83 s [vector] +++ OK, passed 100 tests.
  11232. 961.85 s [vector] mut_generateM: OK
  11233. 961.85 s [vector] +++ OK, passed 100 tests.
  11234. 961.85 s [vector] mut_mapM_: OK (0.02s)
  11235. 961.85 s [vector] +++ OK, passed 100 tests.
  11236. 961.87 s [vector] mut_imapM_: OK (0.02s)
  11237. 961.87 s [vector] +++ OK, passed 100 tests.
  11238. 961.89 s [vector] mut_forM_: OK (0.02s)
  11239. 961.89 s [vector] +++ OK, passed 100 tests.
  11240. 961.90 s [vector] mut_iforM_: OK (0.01s)
  11241. 961.90 s [vector] +++ OK, passed 100 tests.
  11242. 961.90 s [vector] mut_foldr: OK
  11243. 961.90 s [vector] +++ OK, passed 100 tests.
  11244. 961.90 s [vector] mut_foldr': OK
  11245. 961.91 s [vector] +++ OK, passed 100 tests.
  11246. 961.91 s [vector] mut_foldl: OK
  11247. 961.91 s [vector] +++ OK, passed 100 tests.
  11248. 961.91 s [vector] mut_foldl': OK
  11249. 961.91 s [vector] +++ OK, passed 100 tests.
  11250. 961.91 s [vector] mut_ifoldr: OK
  11251. 961.91 s [vector] +++ OK, passed 100 tests.
  11252. 961.91 s [vector] mut_ifoldr': OK
  11253. 961.91 s [vector] +++ OK, passed 100 tests.
  11254. 961.91 s [vector] mut_ifoldl: OK
  11255. 961.91 s [vector] +++ OK, passed 100 tests.
  11256. 961.92 s [vector] mut_ifoldl': OK
  11257. 961.92 s [vector] +++ OK, passed 100 tests.
  11258. 961.92 s [vector] mut_foldM: OK
  11259. 961.92 s [vector] +++ OK, passed 100 tests.
  11260. 961.92 s [vector] mut_foldM': OK
  11261. 961.92 s [vector] +++ OK, passed 100 tests.
  11262. 961.92 s [vector] mut_foldrM: OK
  11263. 961.92 s [vector] +++ OK, passed 100 tests.
  11264. 961.93 s [vector] mut_foldrM': OK
  11265. 961.93 s [vector] +++ OK, passed 100 tests.
  11266. 961.93 s [vector] mut_ifoldM: OK
  11267. 961.93 s [vector] +++ OK, passed 100 tests.
  11268. 961.93 s [vector] mut_ifoldM': OK
  11269. 961.93 s [vector] +++ OK, passed 100 tests.
  11270. 961.93 s [vector] mut_ifoldrM: OK
  11271. 961.94 s [vector] +++ OK, passed 100 tests.
  11272. 961.94 s [vector] mut_ifoldrM': OK
  11273. 961.94 s [vector] +++ OK, passed 100 tests.
  11274. 961.94 s [vector] compare: OK
  11275. 961.94 s [vector] +++ OK, passed 100 tests.
  11276. 961.94 s [vector] maximum: OK
  11277. 961.94 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11278. 961.94 s [vector] minimum: OK
  11279. 961.94 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11280. 961.94 s [vector] minIndex: OK
  11281. 961.94 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11282. 961.94 s [vector] maxIndex: OK
  11283. 961.94 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11284. 961.94 s [vector] maximumBy: OK
  11285. 961.94 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11286. 961.94 s [vector] minimumBy: OK
  11287. 961.94 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11288. 961.94 s [vector] maximumOn: OK
  11289. 961.94 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11290. 961.94 s [vector] minimumOn: OK
  11291. 961.94 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11292. 961.94 s [vector] maxIndexBy: OK
  11293. 961.94 s [vector] +++ OK, passed 100 tests; 20 discarded.
  11294. 961.94 s [vector] minIndexBy: OK
  11295. 961.94 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11296. 961.94 s [vector] ListFirstMaxIndexWins: OK
  11297. 961.94 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11298. 961.94 s [vector] FalseListFirstMaxIndexWins: OK
  11299. 961.94 s [vector] +++ OK, failed as expected. (after 1 test):
  11300. 961.94 s [vector] Exception:
  11301. 961.94 s [vector] Prelude.foldr1: empty list
  11302. 961.94 s [vector] CallStack (from HasCallStack):
  11303. 961.94 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  11304. 961.94 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  11305. 961.94 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  11306. 961.94 s [vector] []
  11307. 961.94 s [vector] zip: OK
  11308. 961.94 s [vector] +++ OK, passed 100 tests.
  11309. 961.94 s [vector] zip3: OK
  11310. 961.94 s [vector] +++ OK, passed 100 tests.
  11311. 961.95 s [vector] unzip: OK
  11312. 961.95 s [vector] +++ OK, passed 100 tests.
  11313. 961.95 s [vector] unzip3: OK
  11314. 961.95 s [vector] +++ OK, passed 100 tests.
  11315. 961.95 s [vector] indexed: OK
  11316. 961.95 s [vector] +++ OK, passed 100 tests.
  11317. 961.95 s [vector] update: OK
  11318. 961.95 s [vector] +++ OK, passed 100 tests.
  11319. 961.96 s [vector] concat: OK
  11320. 961.96 s [vector] +++ OK, passed 100 tests.
  11321. 961.96 s [vector] mempty: OK
  11322. 961.96 s [vector] +++ OK, passed 100 tests.
  11323. 961.96 s [vector] mappend: OK
  11324. 961.96 s [vector] +++ OK, passed 100 tests.
  11325. 961.96 s [vector] mconcat: OK
  11326. 961.97 s [vector] +++ OK, passed 100 tests.
  11327. 961.97 s [vector] fmap: OK
  11328. 961.97 s [vector] +++ OK, passed 100 tests.
  11329. 961.97 s [vector] return: OK
  11330. 961.97 s [vector] +++ OK, passed 100 tests.
  11331. 961.98 s [vector] bind: OK (0.01s)
  11332. 961.98 s [vector] +++ OK, passed 100 tests.
  11333. 961.98 s [vector] mzip: OK
  11334. 961.98 s [vector] +++ OK, passed 100 tests.
  11335. 961.98 s [vector] munzip: OK
  11336. 961.98 s [vector] +++ OK, passed 100 tests.
  11337. 961.98 s [vector] applicative_pure: OK
  11338. 961.99 s [vector] +++ OK, passed 100 tests.
  11339. 962.01 s [vector] applicative_appl: OK (0.03s)
  11340. 962.01 s [vector] +++ OK, passed 100 tests.
  11341. 962.01 s [vector] alternative_empty: OK
  11342. 962.01 s [vector] +++ OK, passed 100 tests.
  11343. 962.01 s [vector] alternative_or: OK
  11344. 962.01 s [vector] +++ OK, passed 100 tests.
  11345. 962.05 s [vector] sequence: OK (0.04s)
  11346. 962.05 s [vector] +++ OK, passed 100 tests.
  11347. 962.05 s [vector] sequence_: OK
  11348. 962.05 s [vector] +++ OK, passed 100 tests.
  11349. 962.06 s [vector] glength: OK
  11350. 962.06 s [vector] +++ OK, passed 100 tests.
  11351. 962.06 s [vector] sum: OK
  11352. 962.06 s [vector] +++ OK, passed 100 tests.
  11353. 962.06 s [vector] product: OK
  11354. 962.06 s [vector] +++ OK, passed 100 tests.
  11355. 962.06 s [vector] enumFromN: OK
  11356. 962.06 s [vector] +++ OK, passed 100 tests.
  11357. 962.06 s [vector] enumFromThenN: OK
  11358. 962.06 s [vector] +++ OK, passed 100 tests.
  11359. 962.06 s [vector] enumFromTo: OK
  11360. 962.06 s [vector] +++ OK, passed 100 tests.
  11361. 962.06 s [vector] enumFromThenTo: OK
  11362. 962.06 s [vector] +++ OK, passed 100 tests; 11 discarded.
  11363. 962.06 s [vector] unstream
  11364. 962.06 s [vector] unstream == vunstream (exact): OK
  11365. 962.06 s [vector] +++ OK, passed 100 tests.
  11366. 962.06 s [vector] unstream == vunstream (unknown): OK
  11367. 962.06 s [vector] +++ OK, passed 100 tests.
  11368. 962.06 s [vector] unstreamR ~= vunstream (exact): OK
  11369. 962.06 s [vector] +++ OK, passed 100 tests.
  11370. 962.06 s [vector] unstreamR ~= vunstream (unknown): OK
  11371. 962.06 s [vector] +++ OK, passed 100 tests.
  11372. 962.06 s [vector] Tests.Vector.Primitive
  11373. 962.06 s [vector] Int
  11374. 962.06 s [vector] fromList.toList == id: OK
  11375. 962.06 s [vector] +++ OK, passed 100 tests.
  11376. 962.06 s [vector] toList.fromList == id: OK
  11377. 962.06 s [vector] +++ OK, passed 100 tests.
  11378. 962.06 s [vector] unstream.stream == id: OK
  11379. 962.06 s [vector] +++ OK, passed 100 tests.
  11380. 962.06 s [vector] stream.unstream == id: OK
  11381. 962.06 s [vector] +++ OK, passed 100 tests.
  11382. 962.06 s [vector] eq: OK
  11383. 962.06 s [vector] +++ OK, passed 100 tests.
  11384. 962.06 s [vector] length: OK
  11385. 962.06 s [vector] +++ OK, passed 100 tests.
  11386. 962.06 s [vector] null: OK
  11387. 962.06 s [vector] +++ OK, passed 100 tests.
  11388. 962.06 s [vector] index: OK
  11389. 962.06 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11390. 962.06 s [vector] safeIndex: OK
  11391. 962.06 s [vector] +++ OK, passed 100 tests.
  11392. 962.06 s [vector] head: OK
  11393. 962.06 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11394. 962.06 s [vector] last: OK
  11395. 962.07 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11396. 962.07 s [vector] unsafeIndex: OK
  11397. 962.07 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11398. 962.07 s [vector] unsafeHead: OK
  11399. 962.07 s [vector] +++ OK, passed 100 tests; 20 discarded.
  11400. 962.07 s [vector] unsafeLast: OK
  11401. 962.07 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11402. 962.07 s [vector] slice: OK
  11403. 962.07 s [vector] +++ OK, passed 100 tests.
  11404. 962.07 s [vector] init: OK
  11405. 962.07 s [vector] +++ OK, passed 100 tests; 21 discarded.
  11406. 962.07 s [vector] tail: OK
  11407. 962.07 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11408. 962.07 s [vector] take: OK
  11409. 962.07 s [vector] +++ OK, passed 100 tests.
  11410. 962.07 s [vector] drop: OK
  11411. 962.07 s [vector] +++ OK, passed 100 tests.
  11412. 962.07 s [vector] splitAt: OK
  11413. 962.07 s [vector] +++ OK, passed 100 tests.
  11414. 962.07 s [vector] empty: OK
  11415. 962.07 s [vector] +++ OK, passed 100 tests.
  11416. 962.07 s [vector] singleton: OK
  11417. 962.07 s [vector] +++ OK, passed 100 tests.
  11418. 962.07 s [vector] replicate: OK
  11419. 962.07 s [vector] +++ OK, passed 100 tests.
  11420. 962.07 s [vector] generate: OK
  11421. 962.07 s [vector] +++ OK, passed 100 tests.
  11422. 962.09 s [vector] iterateN: OK
  11423. 962.09 s [vector] +++ OK, passed 100 tests.
  11424. 962.09 s [vector] iterateNM: OK (0.01s)
  11425. 962.09 s [vector] +++ OK, passed 100 tests.
  11426. 962.13 s [vector] generateM: OK (0.03s)
  11427. 962.13 s [vector] +++ OK, passed 100 tests.
  11428. 962.13 s [vector] replicateM: OK (0.01s)
  11429. 962.13 s [vector] +++ OK, passed 100 tests.
  11430. 962.13 s [vector] create: OK
  11431. 962.13 s [vector] +++ OK, passed 100 tests.
  11432. 962.13 s [vector] createT: OK
  11433. 962.13 s [vector] +++ OK, passed 100 tests.
  11434. 962.13 s [vector] unfoldr: OK
  11435. 962.13 s [vector] +++ OK, passed 100 tests.
  11436. 962.14 s [vector] unfoldrN: OK
  11437. 962.14 s [vector] +++ OK, passed 100 tests.
  11438. 962.14 s [vector] unfoldrExactN: OK
  11439. 962.14 s [vector] +++ OK, passed 100 tests.
  11440. 962.14 s [vector] unfoldrM: OK
  11441. 962.14 s [vector] +++ OK, passed 100 tests.
  11442. 962.14 s [vector] unfoldrNM: OK
  11443. 962.14 s [vector] +++ OK, passed 100 tests.
  11444. 962.17 s [vector] unfoldrExactNM: OK (0.03s)
  11445. 962.17 s [vector] +++ OK, passed 100 tests.
  11446. 962.17 s [vector] constructN: OK
  11447. 962.17 s [vector] +++ OK, passed 100 tests.
  11448. 962.17 s [vector] constructrN: OK
  11449. 962.17 s [vector] +++ OK, passed 100 tests.
  11450. 962.17 s [vector] cons: OK
  11451. 962.17 s [vector] +++ OK, passed 100 tests.
  11452. 962.17 s [vector] snoc: OK
  11453. 962.18 s [vector] +++ OK, passed 100 tests.
  11454. 962.19 s [vector] append: OK
  11455. 962.19 s [vector] +++ OK, passed 100 tests.
  11456. 962.19 s [vector] concat: OK (0.02s)
  11457. 962.19 s [vector] +++ OK, passed 100 tests.
  11458. 962.19 s [vector] force: OK
  11459. 962.19 s [vector] +++ OK, passed 100 tests.
  11460. 962.20 s [vector] upd: OK
  11461. 962.20 s [vector] +++ OK, passed 100 tests.
  11462. 962.20 s [vector] accum: OK
  11463. 962.20 s [vector] +++ OK, passed 100 tests.
  11464. 962.20 s [vector] reverse: OK
  11465. 962.20 s [vector] +++ OK, passed 100 tests.
  11466. 962.20 s [vector] backpermute: OK
  11467. 962.20 s [vector] +++ OK, passed 100 tests.
  11468. 962.20 s [vector] map: OK
  11469. 962.20 s [vector] +++ OK, passed 100 tests.
  11470. 962.21 s [vector] imap: OK
  11471. 962.21 s [vector] +++ OK, passed 100 tests.
  11472. 962.21 s [vector] concatMap: OK
  11473. 962.21 s [vector] +++ OK, passed 100 tests.
  11474. 962.21 s [vector] mapM: OK
  11475. 962.21 s [vector] +++ OK, passed 100 tests.
  11476. 962.22 s [vector] mapM_: OK (0.02s)
  11477. 962.22 s [vector] +++ OK, passed 100 tests.
  11478. 962.23 s [vector] forM: OK
  11479. 962.23 s [vector] +++ OK, passed 100 tests.
  11480. 962.25 s [vector] forM_: OK (0.02s)
  11481. 962.25 s [vector] +++ OK, passed 100 tests.
  11482. 962.25 s [vector] imapM: OK
  11483. 962.25 s [vector] +++ OK, passed 100 tests.
  11484. 962.27 s [vector] imapM_: OK (0.02s)
  11485. 962.27 s [vector] +++ OK, passed 100 tests.
  11486. 962.27 s [vector] zipWith: OK
  11487. 962.27 s [vector] +++ OK, passed 100 tests.
  11488. 962.27 s [vector] zipWith3: OK
  11489. 962.27 s [vector] +++ OK, passed 100 tests.
  11490. 962.27 s [vector] izipWith: OK
  11491. 962.27 s [vector] +++ OK, passed 100 tests.
  11492. 962.28 s [vector] izipWith3: OK
  11493. 962.28 s [vector] +++ OK, passed 100 tests.
  11494. 962.28 s [vector] izipWithM: OK
  11495. 962.28 s [vector] +++ OK, passed 100 tests.
  11496. 962.29 s [vector] izipWithM_: OK (0.01s)
  11497. 962.29 s [vector] +++ OK, passed 100 tests.
  11498. 962.29 s [vector] zipWithM: OK
  11499. 962.30 s [vector] +++ OK, passed 100 tests.
  11500. 962.30 s [vector] zipWithM_: OK (0.01s)
  11501. 962.30 s [vector] +++ OK, passed 100 tests.
  11502. 962.30 s [vector] filter: OK
  11503. 962.31 s [vector] +++ OK, passed 100 tests.
  11504. 962.31 s [vector] ifilter: OK
  11505. 962.31 s [vector] +++ OK, passed 100 tests.
  11506. 962.33 s [vector] filterM: OK (0.02s)
  11507. 962.33 s [vector] +++ OK, passed 100 tests.
  11508. 962.33 s [vector] uniq: OK
  11509. 962.33 s [vector] +++ OK, passed 100 tests.
  11510. 962.33 s [vector] mapMaybe: OK
  11511. 962.33 s [vector] +++ OK, passed 100 tests.
  11512. 962.33 s [vector] imapMaybe: OK
  11513. 962.33 s [vector] +++ OK, passed 100 tests.
  11514. 962.33 s [vector] takeWhile: OK
  11515. 962.33 s [vector] +++ OK, passed 100 tests.
  11516. 962.33 s [vector] dropWhile: OK
  11517. 962.34 s [vector] +++ OK, passed 100 tests.
  11518. 962.34 s [vector] partition: OK
  11519. 962.34 s [vector] +++ OK, passed 100 tests.
  11520. 962.34 s [vector] partitionWith: OK
  11521. 962.34 s [vector] +++ OK, passed 100 tests.
  11522. 962.34 s [vector] span: OK
  11523. 962.34 s [vector] +++ OK, passed 100 tests.
  11524. 962.34 s [vector] break: OK
  11525. 962.34 s [vector] +++ OK, passed 100 tests.
  11526. 962.34 s [vector] spanR: OK
  11527. 962.34 s [vector] +++ OK, passed 100 tests.
  11528. 962.34 s [vector] breakR: OK
  11529. 962.34 s [vector] +++ OK, passed 100 tests.
  11530. 962.34 s [vector] groupBy: OK
  11531. 962.34 s [vector] +++ OK, passed 100 tests.
  11532. 962.34 s [vector] elem: OK
  11533. 962.34 s [vector] +++ OK, passed 100 tests.
  11534. 962.34 s [vector] notElem: OK
  11535. 962.35 s [vector] +++ OK, passed 100 tests.
  11536. 962.35 s [vector] find: OK
  11537. 962.35 s [vector] +++ OK, passed 100 tests.
  11538. 962.35 s [vector] findIndex: OK
  11539. 962.35 s [vector] +++ OK, passed 100 tests.
  11540. 962.35 s [vector] findIndexR: OK
  11541. 962.35 s [vector] +++ OK, passed 100 tests.
  11542. 962.35 s [vector] findIndices: OK
  11543. 962.35 s [vector] +++ OK, passed 100 tests.
  11544. 962.35 s [vector] elemIndex: OK
  11545. 962.35 s [vector] +++ OK, passed 100 tests.
  11546. 962.35 s [vector] elemIndices: OK
  11547. 962.35 s [vector] +++ OK, passed 100 tests.
  11548. 962.35 s [vector] foldl: OK
  11549. 962.35 s [vector] +++ OK, passed 100 tests.
  11550. 962.35 s [vector] foldl1: OK
  11551. 962.36 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11552. 962.36 s [vector] foldl': OK
  11553. 962.36 s [vector] +++ OK, passed 100 tests.
  11554. 962.36 s [vector] foldl1': OK
  11555. 962.36 s [vector] +++ OK, passed 100 tests; 20 discarded.
  11556. 962.36 s [vector] foldr: OK
  11557. 962.36 s [vector] +++ OK, passed 100 tests.
  11558. 962.36 s [vector] foldr1: OK
  11559. 962.36 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11560. 962.37 s [vector] foldr': OK
  11561. 962.37 s [vector] +++ OK, passed 100 tests.
  11562. 962.37 s [vector] foldr1': OK
  11563. 962.37 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11564. 962.37 s [vector] ifoldl: OK
  11565. 962.37 s [vector] +++ OK, passed 100 tests.
  11566. 962.37 s [vector] ifoldl': OK
  11567. 962.37 s [vector] +++ OK, passed 100 tests.
  11568. 962.38 s [vector] ifoldr: OK
  11569. 962.38 s [vector] +++ OK, passed 100 tests.
  11570. 962.38 s [vector] ifoldr': OK
  11571. 962.38 s [vector] +++ OK, passed 100 tests.
  11572. 962.38 s [vector] ifoldM: OK
  11573. 962.38 s [vector] +++ OK, passed 100 tests.
  11574. 962.39 s [vector] ifoldM': OK
  11575. 962.39 s [vector] +++ OK, passed 100 tests.
  11576. 962.41 s [vector] ifoldM_: OK (0.02s)
  11577. 962.41 s [vector] +++ OK, passed 100 tests.
  11578. 962.42 s [vector] ifoldM'_: OK (0.02s)
  11579. 962.42 s [vector] +++ OK, passed 100 tests.
  11580. 962.42 s [vector] all: OK
  11581. 962.42 s [vector] +++ OK, passed 100 tests.
  11582. 962.42 s [vector] any: OK
  11583. 962.42 s [vector] +++ OK, passed 100 tests.
  11584. 962.42 s [vector] prescanl: OK
  11585. 962.42 s [vector] +++ OK, passed 100 tests.
  11586. 962.42 s [vector] prescanl': OK
  11587. 962.42 s [vector] +++ OK, passed 100 tests.
  11588. 962.43 s [vector] postscanl: OK
  11589. 962.43 s [vector] +++ OK, passed 100 tests.
  11590. 962.43 s [vector] postscanl': OK
  11591. 962.43 s [vector] +++ OK, passed 100 tests.
  11592. 962.43 s [vector] scanl: OK
  11593. 962.43 s [vector] +++ OK, passed 100 tests.
  11594. 962.44 s [vector] scanl': OK
  11595. 962.44 s [vector] +++ OK, passed 100 tests.
  11596. 962.44 s [vector] scanl1: OK
  11597. 962.44 s [vector] +++ OK, passed 100 tests.
  11598. 962.44 s [vector] scanl1': OK
  11599. 962.44 s [vector] +++ OK, passed 100 tests.
  11600. 962.44 s [vector] iscanl: OK
  11601. 962.44 s [vector] +++ OK, passed 100 tests.
  11602. 962.45 s [vector] iscanl': OK
  11603. 962.45 s [vector] +++ OK, passed 100 tests.
  11604. 962.45 s [vector] prescanr: OK
  11605. 962.45 s [vector] +++ OK, passed 100 tests.
  11606. 962.45 s [vector] prescanr': OK
  11607. 962.45 s [vector] +++ OK, passed 100 tests.
  11608. 962.46 s [vector] postscanr: OK
  11609. 962.46 s [vector] +++ OK, passed 100 tests.
  11610. 962.46 s [vector] postscanr': OK
  11611. 962.46 s [vector] +++ OK, passed 100 tests.
  11612. 962.46 s [vector] scanr: OK
  11613. 962.46 s [vector] +++ OK, passed 100 tests.
  11614. 962.46 s [vector] scanr': OK
  11615. 962.46 s [vector] +++ OK, passed 100 tests.
  11616. 962.47 s [vector] scanr1: OK
  11617. 962.47 s [vector] +++ OK, passed 100 tests.
  11618. 962.47 s [vector] scanr1': OK
  11619. 962.47 s [vector] +++ OK, passed 100 tests.
  11620. 962.47 s [vector] iscanr: OK
  11621. 962.47 s [vector] +++ OK, passed 100 tests.
  11622. 962.47 s [vector] iscanr': OK
  11623. 962.47 s [vector] +++ OK, passed 100 tests.
  11624. 962.47 s [vector] mut_read: OK
  11625. 962.47 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11626. 962.47 s [vector] mut_write: OK
  11627. 962.47 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11628. 962.48 s [vector] mut_modify: OK
  11629. 962.48 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11630. 962.48 s [vector] mut_generate: OK
  11631. 962.48 s [vector] +++ OK, passed 100 tests.
  11632. 962.49 s [vector] mut_generateM: OK (0.01s)
  11633. 962.49 s [vector] +++ OK, passed 100 tests.
  11634. 962.51 s [vector] mut_mapM_: OK (0.01s)
  11635. 962.51 s [vector] +++ OK, passed 100 tests.
  11636. 962.52 s [vector] mut_imapM_: OK (0.02s)
  11637. 962.52 s [vector] +++ OK, passed 100 tests.
  11638. 962.54 s [vector] mut_forM_: OK
  11639. 962.54 s [vector] +++ OK, passed 100 tests.
  11640. 962.55 s [vector] mut_iforM_: OK (0.01s)
  11641. 962.55 s [vector] +++ OK, passed 100 tests.
  11642. 962.55 s [vector] mut_foldr: OK
  11643. 962.55 s [vector] +++ OK, passed 100 tests.
  11644. 962.55 s [vector] mut_foldr': OK
  11645. 962.55 s [vector] +++ OK, passed 100 tests.
  11646. 962.56 s [vector] mut_foldl: OK
  11647. 962.56 s [vector] +++ OK, passed 100 tests.
  11648. 962.56 s [vector] mut_foldl': OK
  11649. 962.56 s [vector] +++ OK, passed 100 tests.
  11650. 962.56 s [vector] mut_ifoldr: OK
  11651. 962.56 s [vector] +++ OK, passed 100 tests.
  11652. 962.57 s [vector] mut_ifoldr': OK
  11653. 962.57 s [vector] +++ OK, passed 100 tests.
  11654. 962.57 s [vector] mut_ifoldl: OK
  11655. 962.57 s [vector] +++ OK, passed 100 tests.
  11656. 962.57 s [vector] mut_ifoldl': OK
  11657. 962.57 s [vector] +++ OK, passed 100 tests.
  11658. 962.57 s [vector] mut_foldM: OK
  11659. 962.58 s [vector] +++ OK, passed 100 tests.
  11660. 962.58 s [vector] mut_foldM': OK
  11661. 962.58 s [vector] +++ OK, passed 100 tests.
  11662. 962.58 s [vector] mut_foldrM: OK
  11663. 962.58 s [vector] +++ OK, passed 100 tests.
  11664. 962.58 s [vector] mut_foldrM': OK
  11665. 962.58 s [vector] +++ OK, passed 100 tests.
  11666. 962.58 s [vector] mut_ifoldM: OK
  11667. 962.59 s [vector] +++ OK, passed 100 tests.
  11668. 962.59 s [vector] mut_ifoldM': OK
  11669. 962.59 s [vector] +++ OK, passed 100 tests.
  11670. 962.59 s [vector] mut_ifoldrM: OK
  11671. 962.59 s [vector] +++ OK, passed 100 tests.
  11672. 962.59 s [vector] mut_ifoldrM': OK
  11673. 962.59 s [vector] +++ OK, passed 100 tests.
  11674. 962.59 s [vector] compare: OK
  11675. 962.59 s [vector] +++ OK, passed 100 tests.
  11676. 962.59 s [vector] maximum: OK
  11677. 962.59 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11678. 962.59 s [vector] minimum: OK
  11679. 962.59 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11680. 962.59 s [vector] minIndex: OK
  11681. 962.59 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11682. 962.59 s [vector] maxIndex: OK
  11683. 962.59 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11684. 962.59 s [vector] maximumBy: OK
  11685. 962.59 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11686. 962.59 s [vector] minimumBy: OK
  11687. 962.59 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11688. 962.60 s [vector] maximumOn: OK
  11689. 962.60 s [vector] +++ OK, passed 100 tests; 20 discarded.
  11690. 962.60 s [vector] minimumOn: OK
  11691. 962.60 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11692. 962.60 s [vector] maxIndexBy: OK
  11693. 962.60 s [vector] +++ OK, passed 100 tests; 23 discarded.
  11694. 962.60 s [vector] minIndexBy: OK
  11695. 962.60 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11696. 962.60 s [vector] ListFirstMaxIndexWins: OK
  11697. 962.60 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11698. 962.60 s [vector] FalseListFirstMaxIndexWins: OK
  11699. 962.60 s [vector] +++ OK, failed as expected. (after 1 test):
  11700. 962.60 s [vector] Exception:
  11701. 962.60 s [vector] Prelude.foldr1: empty list
  11702. 962.60 s [vector] CallStack (from HasCallStack):
  11703. 962.60 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  11704. 962.60 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  11705. 962.60 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  11706. 962.60 s [vector] []
  11707. 962.60 s [vector] mempty: OK
  11708. 962.60 s [vector] +++ OK, passed 100 tests.
  11709. 962.60 s [vector] mappend: OK
  11710. 962.61 s [vector] +++ OK, passed 100 tests.
  11711. 962.61 s [vector] mconcat: OK (0.01s)
  11712. 962.61 s [vector] +++ OK, passed 100 tests.
  11713. 962.61 s [vector] glength: OK
  11714. 962.61 s [vector] +++ OK, passed 100 tests.
  11715. 962.61 s [vector] sum: OK
  11716. 962.61 s [vector] +++ OK, passed 100 tests.
  11717. 962.61 s [vector] product: OK
  11718. 962.61 s [vector] +++ OK, passed 100 tests.
  11719. 962.61 s [vector] enumFromN: OK
  11720. 962.61 s [vector] +++ OK, passed 100 tests.
  11721. 962.61 s [vector] enumFromThenN: OK
  11722. 962.61 s [vector] +++ OK, passed 100 tests.
  11723. 962.61 s [vector] enumFromTo: OK
  11724. 962.61 s [vector] +++ OK, passed 100 tests.
  11725. 962.62 s [vector] enumFromThenTo: OK
  11726. 962.62 s [vector] +++ OK, passed 100 tests; 12 discarded.
  11727. 962.62 s [vector] Double
  11728. 962.62 s [vector] fromList.toList == id: OK
  11729. 962.62 s [vector] +++ OK, passed 100 tests.
  11730. 962.62 s [vector] toList.fromList == id: OK
  11731. 962.62 s [vector] +++ OK, passed 100 tests.
  11732. 962.62 s [vector] unstream.stream == id: OK
  11733. 962.62 s [vector] +++ OK, passed 100 tests.
  11734. 962.62 s [vector] stream.unstream == id: OK
  11735. 962.62 s [vector] +++ OK, passed 100 tests.
  11736. 962.62 s [vector] eq: OK
  11737. 962.62 s [vector] +++ OK, passed 100 tests.
  11738. 962.62 s [vector] length: OK
  11739. 962.62 s [vector] +++ OK, passed 100 tests.
  11740. 962.62 s [vector] null: OK
  11741. 962.62 s [vector] +++ OK, passed 100 tests.
  11742. 962.62 s [vector] index: OK
  11743. 962.62 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11744. 962.62 s [vector] safeIndex: OK
  11745. 962.62 s [vector] +++ OK, passed 100 tests.
  11746. 962.62 s [vector] head: OK
  11747. 962.63 s [vector] +++ OK, passed 100 tests; 20 discarded.
  11748. 962.63 s [vector] last: OK
  11749. 962.63 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11750. 962.63 s [vector] unsafeIndex: OK
  11751. 962.63 s [vector] +++ OK, passed 100 tests; 10 discarded.
  11752. 962.63 s [vector] unsafeHead: OK
  11753. 962.63 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11754. 962.63 s [vector] unsafeLast: OK
  11755. 962.63 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11756. 962.63 s [vector] slice: OK
  11757. 962.63 s [vector] +++ OK, passed 100 tests.
  11758. 962.63 s [vector] init: OK
  11759. 962.63 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11760. 962.63 s [vector] tail: OK
  11761. 962.63 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11762. 962.63 s [vector] take: OK
  11763. 962.63 s [vector] +++ OK, passed 100 tests.
  11764. 962.63 s [vector] drop: OK
  11765. 962.63 s [vector] +++ OK, passed 100 tests.
  11766. 962.63 s [vector] splitAt: OK
  11767. 962.63 s [vector] +++ OK, passed 100 tests.
  11768. 962.63 s [vector] empty: OK
  11769. 962.64 s [vector] +++ OK, passed 100 tests.
  11770. 962.65 s [vector] singleton: OK
  11771. 962.65 s [vector] +++ OK, passed 100 tests.
  11772. 962.65 s [vector] replicate: OK
  11773. 962.65 s [vector] +++ OK, passed 100 tests.
  11774. 962.65 s [vector] generate: OK
  11775. 962.65 s [vector] +++ OK, passed 100 tests.
  11776. 962.65 s [vector] iterateN: OK
  11777. 962.65 s [vector] +++ OK, passed 100 tests.
  11778. 962.67 s [vector] iterateNM: OK (0.02s)
  11779. 962.67 s [vector] +++ OK, passed 100 tests.
  11780. 962.69 s [vector] generateM: OK (0.03s)
  11781. 962.69 s [vector] +++ OK, passed 100 tests.
  11782. 962.70 s [vector] replicateM: OK (0.01s)
  11783. 962.70 s [vector] +++ OK, passed 100 tests.
  11784. 962.70 s [vector] create: OK
  11785. 962.70 s [vector] +++ OK, passed 100 tests.
  11786. 962.70 s [vector] createT: OK
  11787. 962.70 s [vector] +++ OK, passed 100 tests.
  11788. 962.70 s [vector] unfoldr: OK
  11789. 962.70 s [vector] +++ OK, passed 100 tests.
  11790. 962.70 s [vector] unfoldrN: OK
  11791. 962.70 s [vector] +++ OK, passed 100 tests.
  11792. 962.71 s [vector] unfoldrExactN: OK
  11793. 962.71 s [vector] +++ OK, passed 100 tests.
  11794. 962.71 s [vector] unfoldrM: OK
  11795. 962.71 s [vector] +++ OK, passed 100 tests.
  11796. 962.71 s [vector] unfoldrNM: OK
  11797. 962.71 s [vector] +++ OK, passed 100 tests.
  11798. 962.73 s [vector] unfoldrExactNM: OK (0.02s)
  11799. 962.73 s [vector] +++ OK, passed 100 tests.
  11800. 962.75 s [vector] constructN: OK (0.02s)
  11801. 962.75 s [vector] +++ OK, passed 100 tests.
  11802. 962.75 s [vector] constructrN: OK (0.01s)
  11803. 962.75 s [vector] +++ OK, passed 100 tests.
  11804. 962.77 s [vector] cons: OK
  11805. 962.77 s [vector] +++ OK, passed 100 tests.
  11806. 962.77 s [vector] snoc: OK
  11807. 962.78 s [vector] +++ OK, passed 100 tests.
  11808. 962.78 s [vector] append: OK
  11809. 962.78 s [vector] +++ OK, passed 100 tests.
  11810. 962.78 s [vector] concat: OK (0.03s)
  11811. 962.79 s [vector] +++ OK, passed 100 tests.
  11812. 962.79 s [vector] force: OK
  11813. 962.79 s [vector] +++ OK, passed 100 tests.
  11814. 962.79 s [vector] upd: OK
  11815. 962.79 s [vector] +++ OK, passed 100 tests.
  11816. 962.80 s [vector] accum: OK (0.01s)
  11817. 962.80 s [vector] +++ OK, passed 100 tests.
  11818. 962.81 s [vector] reverse: OK
  11819. 962.81 s [vector] +++ OK, passed 100 tests.
  11820. 962.82 s [vector] backpermute: OK
  11821. 962.83 s [vector] +++ OK, passed 100 tests.
  11822. 962.83 s [vector] map: OK
  11823. 962.85 s [vector] +++ OK, passed 100 tests.
  11824. 962.85 s [vector] imap: OK
  11825. 962.85 s [vector] +++ OK, passed 100 tests.
  11826. 962.86 s [vector] concatMap: OK
  11827. 962.86 s [vector] +++ OK, passed 100 tests.
  11828. 962.86 s [vector] mapM: OK
  11829. 962.86 s [vector] +++ OK, passed 100 tests.
  11830. 962.87 s [vector] mapM_: OK (0.04s)
  11831. 962.87 s [vector] +++ OK, passed 100 tests.
  11832. 962.88 s [vector] forM: OK
  11833. 962.88 s [vector] +++ OK, passed 100 tests.
  11834. 962.91 s [vector] forM_: OK (0.03s)
  11835. 962.91 s [vector] +++ OK, passed 100 tests.
  11836. 962.93 s [vector] imapM: OK
  11837. 962.93 s [vector] +++ OK, passed 100 tests.
  11838. 962.96 s [vector] imapM_: OK (0.03s)
  11839. 962.97 s [vector] +++ OK, passed 100 tests.
  11840. 962.97 s [vector] zipWith: OK
  11841. 962.97 s [vector] +++ OK, passed 100 tests.
  11842. 962.98 s [vector] zipWith3: OK
  11843. 962.98 s [vector] +++ OK, passed 100 tests.
  11844. 962.99 s [vector] izipWith: OK (0.01s)
  11845. 962.99 s [vector] +++ OK, passed 100 tests.
  11846. 963.01 s [vector] izipWith3: OK (0.02s)
  11847. 963.01 s [vector] +++ OK, passed 100 tests.
  11848. 963.03 s [vector] izipWithM: OK (0.02s)
  11849. 963.03 s [vector] +++ OK, passed 100 tests.
  11850. 963.05 s [vector] izipWithM_: OK (0.02s)
  11851. 963.05 s [vector] +++ OK, passed 100 tests.
  11852. 963.05 s [vector] zipWithM: OK
  11853. 963.05 s [vector] +++ OK, passed 100 tests.
  11854. 963.08 s [vector] zipWithM_: OK (0.03s)
  11855. 963.08 s [vector] +++ OK, passed 100 tests.
  11856. 963.09 s [vector] filter: OK
  11857. 963.09 s [vector] +++ OK, passed 100 tests.
  11858. 963.09 s [vector] ifilter: OK
  11859. 963.09 s [vector] +++ OK, passed 100 tests.
  11860. 963.13 s [vector] filterM: OK (0.04s)
  11861. 963.13 s [vector] +++ OK, passed 100 tests.
  11862. 963.13 s [vector] uniq: OK
  11863. 963.14 s [vector] +++ OK, passed 100 tests.
  11864. 963.14 s [vector] mapMaybe: OK
  11865. 963.15 s [vector] +++ OK, passed 100 tests.
  11866. 963.15 s [vector] imapMaybe: OK
  11867. 963.15 s [vector] +++ OK, passed 100 tests.
  11868. 963.16 s [vector] takeWhile: OK
  11869. 963.16 s [vector] +++ OK, passed 100 tests.
  11870. 963.16 s [vector] dropWhile: OK
  11871. 963.17 s [vector] +++ OK, passed 100 tests.
  11872. 963.17 s [vector] partition: OK
  11873. 963.17 s [vector] +++ OK, passed 100 tests.
  11874. 963.17 s [vector] partitionWith: OK
  11875. 963.17 s [vector] +++ OK, passed 100 tests.
  11876. 963.17 s [vector] span: OK
  11877. 963.17 s [vector] +++ OK, passed 100 tests.
  11878. 963.18 s [vector] break: OK
  11879. 963.18 s [vector] +++ OK, passed 100 tests.
  11880. 963.18 s [vector] spanR: OK
  11881. 963.18 s [vector] +++ OK, passed 100 tests.
  11882. 963.18 s [vector] breakR: OK
  11883. 963.18 s [vector] +++ OK, passed 100 tests.
  11884. 963.18 s [vector] groupBy: OK
  11885. 963.18 s [vector] +++ OK, passed 100 tests.
  11886. 963.18 s [vector] elem: OK
  11887. 963.18 s [vector] +++ OK, passed 100 tests.
  11888. 963.18 s [vector] notElem: OK
  11889. 963.18 s [vector] +++ OK, passed 100 tests.
  11890. 963.19 s [vector] find: OK
  11891. 963.19 s [vector] +++ OK, passed 100 tests.
  11892. 963.19 s [vector] findIndex: OK
  11893. 963.19 s [vector] +++ OK, passed 100 tests.
  11894. 963.20 s [vector] findIndexR: OK
  11895. 963.20 s [vector] +++ OK, passed 100 tests.
  11896. 963.20 s [vector] findIndices: OK (0.01s)
  11897. 963.20 s [vector] +++ OK, passed 100 tests.
  11898. 963.20 s [vector] elemIndex: OK
  11899. 963.21 s [vector] +++ OK, passed 100 tests.
  11900. 963.21 s [vector] elemIndices: OK
  11901. 963.21 s [vector] +++ OK, passed 100 tests.
  11902. 963.22 s [vector] foldl: OK (0.02s)
  11903. 963.22 s [vector] +++ OK, passed 100 tests.
  11904. 963.23 s [vector] foldl1: OK (0.01s)
  11905. 963.23 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11906. 963.24 s [vector] foldl': OK (0.01s)
  11907. 963.24 s [vector] +++ OK, passed 100 tests.
  11908. 963.25 s [vector] foldl1': OK
  11909. 963.25 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11910. 963.27 s [vector] foldr: OK (0.01s)
  11911. 963.27 s [vector] +++ OK, passed 100 tests.
  11912. 963.29 s [vector] foldr1: OK (0.01s)
  11913. 963.29 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11914. 963.29 s [vector] foldr': OK (0.01s)
  11915. 963.29 s [vector] +++ OK, passed 100 tests.
  11916. 963.30 s [vector] foldr1': OK (0.01s)
  11917. 963.30 s [vector] +++ OK, passed 100 tests; 21 discarded.
  11918. 963.32 s [vector] ifoldl: OK
  11919. 963.32 s [vector] +++ OK, passed 100 tests.
  11920. 963.34 s [vector] ifoldl': OK (0.01s)
  11921. 963.35 s [vector] +++ OK, passed 100 tests.
  11922. 963.36 s [vector] ifoldr: OK (0.01s)
  11923. 963.36 s [vector] +++ OK, passed 100 tests.
  11924. 963.37 s [vector] ifoldr': OK (0.02s)
  11925. 963.37 s [vector] +++ OK, passed 100 tests.
  11926. 963.39 s [vector] ifoldM: OK (0.02s)
  11927. 963.39 s [vector] +++ OK, passed 100 tests.
  11928. 963.39 s [vector] ifoldM': OK (0.01s)
  11929. 963.39 s [vector] +++ OK, passed 100 tests.
  11930. 963.43 s [vector] ifoldM_: OK (0.04s)
  11931. 963.43 s [vector] +++ OK, passed 100 tests.
  11932. 963.46 s [vector] ifoldM'_: OK (0.04s)
  11933. 963.46 s [vector] +++ OK, passed 100 tests.
  11934. 963.46 s [vector] all: OK
  11935. 963.46 s [vector] +++ OK, passed 100 tests.
  11936. 963.46 s [vector] any: OK
  11937. 963.46 s [vector] +++ OK, passed 100 tests.
  11938. 963.49 s [vector] prescanl: OK (0.01s)
  11939. 963.49 s [vector] +++ OK, passed 100 tests.
  11940. 963.50 s [vector] prescanl': OK (0.01s)
  11941. 963.50 s [vector] +++ OK, passed 100 tests.
  11942. 963.51 s [vector] postscanl: OK (0.01s)
  11943. 963.51 s [vector] +++ OK, passed 100 tests.
  11944. 963.53 s [vector] postscanl': OK (0.01s)
  11945. 963.53 s [vector] +++ OK, passed 100 tests.
  11946. 963.53 s [vector] scanl: OK (0.01s)
  11947. 963.54 s [vector] +++ OK, passed 100 tests.
  11948. 963.55 s [vector] scanl': OK (0.01s)
  11949. 963.55 s [vector] +++ OK, passed 100 tests.
  11950. 963.55 s [vector] scanl1: OK
  11951. 963.56 s [vector] +++ OK, passed 100 tests.
  11952. 963.57 s [vector] scanl1': OK (0.02s)
  11953. 963.57 s [vector] +++ OK, passed 100 tests.
  11954. 963.59 s [vector] iscanl: OK (0.01s)
  11955. 963.59 s [vector] +++ OK, passed 100 tests.
  11956. 963.59 s [vector] iscanl': OK (0.01s)
  11957. 963.59 s [vector] +++ OK, passed 100 tests.
  11958. 963.61 s [vector] prescanr: OK (0.01s)
  11959. 963.61 s [vector] +++ OK, passed 100 tests.
  11960. 963.63 s [vector] prescanr': OK (0.01s)
  11961. 963.63 s [vector] +++ OK, passed 100 tests.
  11962. 963.63 s [vector] postscanr: OK (0.01s)
  11963. 963.63 s [vector] +++ OK, passed 100 tests.
  11964. 963.65 s [vector] postscanr': OK (0.01s)
  11965. 963.65 s [vector] +++ OK, passed 100 tests.
  11966. 963.67 s [vector] scanr: OK (0.01s)
  11967. 963.67 s [vector] +++ OK, passed 100 tests.
  11968. 963.67 s [vector] scanr': OK (0.01s)
  11969. 963.67 s [vector] +++ OK, passed 100 tests.
  11970. 963.69 s [vector] scanr1: OK (0.01s)
  11971. 963.69 s [vector] +++ OK, passed 100 tests.
  11972. 963.71 s [vector] scanr1': OK (0.01s)
  11973. 963.71 s [vector] +++ OK, passed 100 tests.
  11974. 963.71 s [vector] iscanr: OK (0.01s)
  11975. 963.71 s [vector] +++ OK, passed 100 tests.
  11976. 963.72 s [vector] iscanr': OK (0.01s)
  11977. 963.72 s [vector] +++ OK, passed 100 tests.
  11978. 963.72 s [vector] mut_read: OK
  11979. 963.72 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11980. 963.72 s [vector] mut_write: OK
  11981. 963.72 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11982. 963.72 s [vector] mut_modify: OK
  11983. 963.72 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11984. 963.72 s [vector] mut_generate: OK
  11985. 963.72 s [vector] +++ OK, passed 100 tests.
  11986. 963.75 s [vector] mut_generateM: OK (0.02s)
  11987. 963.75 s [vector] +++ OK, passed 100 tests.
  11988. 963.77 s [vector] mut_mapM_: OK (0.03s)
  11989. 963.77 s [vector] +++ OK, passed 100 tests.
  11990. 963.81 s [vector] mut_imapM_: OK (0.01s)
  11991. 963.81 s [vector] +++ OK, passed 100 tests.
  11992. 963.85 s [vector] mut_forM_: OK (0.04s)
  11993. 963.85 s [vector] +++ OK, passed 100 tests.
  11994. 963.89 s [vector] mut_iforM_: OK (0.04s)
  11995. 964.10 s [vector] +++ OK, passed 100 tests.
  11996. 964.10 s [vector] mut_foldr: OK (0.01s)
  11997. 964.10 s [vector] +++ OK, passed 100 tests.
  11998. 964.10 s [vector] mut_foldr': OK (0.01s)
  11999. 964.10 s [vector] +++ OK, passed 100 tests.
  12000. 964.10 s [vector] mut_foldl: OK (0.01s)
  12001. 964.10 s [vector] +++ OK, passed 100 tests.
  12002. 964.10 s [vector] mut_foldl': OK (0.01s)
  12003. 964.10 s [vector] +++ OK, passed 100 tests.
  12004. 964.10 s [vector] mut_ifoldr: OK (0.01s)
  12005. 964.10 s [vector] +++ OK, passed 100 tests.
  12006. 964.10 s [vector] mut_ifoldr': OK (0.01s)
  12007. 964.10 s [vector] +++ OK, passed 100 tests.
  12008. 964.10 s [vector] mut_ifoldl: OK (0.01s)
  12009. 964.10 s [vector] +++ OK, passed 100 tests.
  12010. 964.10 s [vector] mut_ifoldl': OK (0.01s)
  12011. 964.10 s [vector] +++ OK, passed 100 tests.
  12012. 964.10 s [vector] mut_foldM: OK (0.01s)
  12013. 964.10 s [vector] +++ OK, passed 100 tests.
  12014. 964.10 s [vector] mut_foldM': OK
  12015. 964.10 s [vector] +++ OK, passed 100 tests.
  12016. 964.10 s [vector] mut_foldrM: OK
  12017. 964.10 s [vector] +++ OK, passed 100 tests.
  12018. 964.10 s [vector] mut_foldrM': OK (0.01s)
  12019. 964.10 s [vector] +++ OK, passed 100 tests.
  12020. 964.10 s [vector] mut_ifoldM: OK (0.01s)
  12021. 964.10 s [vector] +++ OK, passed 100 tests.
  12022. 964.10 s [vector] mut_ifoldM': OK (0.01s)
  12023. 964.10 s [vector] +++ OK, passed 100 tests.
  12024. 964.10 s [vector] mut_ifoldrM: OK (0.01s)
  12025. 964.10 s [vector] +++ OK, passed 100 tests.
  12026. 964.10 s [vector] mut_ifoldrM': OK (0.01s)
  12027. 964.10 s [vector] +++ OK, passed 100 tests.
  12028. 964.10 s [vector] compare: OK
  12029. 964.10 s [vector] +++ OK, passed 100 tests.
  12030. 964.10 s [vector] maximum: OK
  12031. 964.10 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12032. 964.10 s [vector] minimum: OK
  12033. 964.10 s [vector] +++ OK, passed 100 tests; 20 discarded.
  12034. 964.10 s [vector] minIndex: OK
  12035. 964.10 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12036. 964.10 s [vector] maxIndex: OK
  12037. 964.10 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12038. 964.10 s [vector] maximumBy: OK
  12039. 964.10 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12040. 964.10 s [vector] minimumBy: OK
  12041. 964.10 s [vector] +++ OK, passed 100 tests; 11 discarded.
  12042. 964.10 s [vector] maximumOn: OK
  12043. 964.10 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12044. 964.10 s [vector] minimumOn: OK
  12045. 964.10 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12046. 964.10 s [vector] maxIndexBy: OK
  12047. 964.10 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12048. 964.10 s [vector] minIndexBy: OK
  12049. 964.10 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12050. 964.10 s [vector] ListFirstMaxIndexWins: OK
  12051. 964.10 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12052. 964.10 s [vector] FalseListFirstMaxIndexWins: OK
  12053. 964.10 s [vector] +++ OK, failed as expected. (after 1 test):
  12054. 964.10 s [vector] Exception:
  12055. 964.10 s [vector] Prelude.foldr1: empty list
  12056. 964.10 s [vector] CallStack (from HasCallStack):
  12057. 964.10 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  12058. 964.10 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  12059. 964.10 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  12060. 964.10 s [vector] []
  12061. 964.10 s [vector] mempty: OK
  12062. 964.10 s [vector] +++ OK, passed 100 tests.
  12063. 964.10 s [vector] mappend: OK
  12064. 964.11 s [vector] +++ OK, passed 100 tests.
  12065. 964.11 s [vector] mconcat: OK (0.02s)
  12066. 964.11 s [vector] +++ OK, passed 100 tests.
  12067. 964.11 s [vector] glength: OK
  12068. 964.11 s [vector] +++ OK, passed 100 tests.
  12069. 964.11 s [vector] sum: OK
  12070. 964.11 s [vector] +++ OK, passed 100 tests.
  12071. 964.11 s [vector] product: OK
  12072. 964.12 s [vector] +++ OK, passed 100 tests.
  12073. 964.12 s [vector] enumFromN: OK
  12074. 964.12 s [vector] +++ OK, passed 100 tests.
  12075. 964.12 s [vector] enumFromThenN: OK
  12076. 964.12 s [vector] +++ OK, passed 100 tests.
  12077. 964.12 s [vector] enumFromTo: OK
  12078. 964.12 s [vector] +++ OK, passed 100 tests.
  12079. 964.12 s [vector] enumFromThenTo: OK
  12080. 964.12 s [vector] +++ OK, passed 100 tests; 2 discarded.
  12081. 964.12 s [vector] unstream
  12082. 964.12 s [vector] unstream == vunstream (exact): OK
  12083. 964.12 s [vector] +++ OK, passed 100 tests.
  12084. 964.12 s [vector] unstream == vunstream (unknown): OK
  12085. 964.12 s [vector] +++ OK, passed 100 tests.
  12086. 964.12 s [vector] unstreamR ~= vunstream (exact): OK
  12087. 964.12 s [vector] +++ OK, passed 100 tests.
  12088. 964.12 s [vector] unstreamR ~= vunstream (unknown): OK
  12089. 964.12 s [vector] +++ OK, passed 100 tests.
  12090. 964.12 s [vector] Tests.Vector.Storable
  12091. 964.12 s [vector] Data.Vector.Storable.Vector (Int)
  12092. 964.12 s [vector] fromList.toList == id: OK
  12093. 964.12 s [vector] +++ OK, passed 100 tests.
  12094. 964.12 s [vector] toList.fromList == id: OK
  12095. 964.12 s [vector] +++ OK, passed 100 tests.
  12096. 964.12 s [vector] unstream.stream == id: OK
  12097. 964.12 s [vector] +++ OK, passed 100 tests.
  12098. 964.12 s [vector] stream.unstream == id: OK
  12099. 964.12 s [vector] +++ OK, passed 100 tests.
  12100. 964.12 s [vector] eq: OK
  12101. 964.12 s [vector] +++ OK, passed 100 tests.
  12102. 964.12 s [vector] length: OK
  12103. 964.12 s [vector] +++ OK, passed 100 tests.
  12104. 964.12 s [vector] null: OK
  12105. 964.12 s [vector] +++ OK, passed 100 tests.
  12106. 964.12 s [vector] index: OK
  12107. 964.12 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12108. 964.12 s [vector] safeIndex: OK
  12109. 964.12 s [vector] +++ OK, passed 100 tests.
  12110. 964.12 s [vector] head: OK
  12111. 964.12 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12112. 964.12 s [vector] last: OK
  12113. 964.12 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12114. 964.12 s [vector] unsafeIndex: OK
  12115. 964.12 s [vector] +++ OK, passed 100 tests; 11 discarded.
  12116. 964.12 s [vector] unsafeHead: OK
  12117. 964.13 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12118. 964.13 s [vector] unsafeLast: OK
  12119. 964.13 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12120. 964.13 s [vector] slice: OK
  12121. 964.13 s [vector] +++ OK, passed 100 tests.
  12122. 964.13 s [vector] init: OK
  12123. 964.13 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12124. 964.13 s [vector] tail: OK
  12125. 964.13 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12126. 964.13 s [vector] take: OK
  12127. 964.13 s [vector] +++ OK, passed 100 tests.
  12128. 964.13 s [vector] drop: OK
  12129. 964.13 s [vector] +++ OK, passed 100 tests.
  12130. 964.14 s [vector] splitAt: OK
  12131. 964.15 s [vector] +++ OK, passed 100 tests.
  12132. 964.15 s [vector] empty: OK
  12133. 964.15 s [vector] +++ OK, passed 100 tests.
  12134. 964.15 s [vector] singleton: OK
  12135. 964.15 s [vector] +++ OK, passed 100 tests.
  12136. 964.15 s [vector] replicate: OK
  12137. 964.15 s [vector] +++ OK, passed 100 tests.
  12138. 964.15 s [vector] generate: OK
  12139. 964.15 s [vector] +++ OK, passed 100 tests.
  12140. 964.15 s [vector] iterateN: OK
  12141. 964.15 s [vector] +++ OK, passed 100 tests.
  12142. 964.16 s [vector] iterateNM: OK
  12143. 964.16 s [vector] +++ OK, passed 100 tests.
  12144. 964.19 s [vector] generateM: OK (0.03s)
  12145. 964.19 s [vector] +++ OK, passed 100 tests.
  12146. 964.19 s [vector] replicateM: OK (0.01s)
  12147. 964.19 s [vector] +++ OK, passed 100 tests.
  12148. 964.20 s [vector] create: OK
  12149. 964.20 s [vector] +++ OK, passed 100 tests.
  12150. 964.20 s [vector] createT: OK (0.01s)
  12151. 964.20 s [vector] +++ OK, passed 100 tests.
  12152. 964.20 s [vector] unfoldr: OK
  12153. 964.20 s [vector] +++ OK, passed 100 tests.
  12154. 964.20 s [vector] unfoldrN: OK
  12155. 964.21 s [vector] +++ OK, passed 100 tests.
  12156. 964.21 s [vector] unfoldrExactN: OK
  12157. 964.21 s [vector] +++ OK, passed 100 tests.
  12158. 964.21 s [vector] unfoldrM: OK
  12159. 964.21 s [vector] +++ OK, passed 100 tests.
  12160. 964.23 s [vector] unfoldrNM: OK
  12161. 964.23 s [vector] +++ OK, passed 100 tests.
  12162. 964.24 s [vector] unfoldrExactNM: OK (0.02s)
  12163. 964.24 s [vector] +++ OK, passed 100 tests.
  12164. 964.24 s [vector] constructN: OK
  12165. 964.24 s [vector] +++ OK, passed 100 tests.
  12166. 964.25 s [vector] constructrN: OK
  12167. 964.25 s [vector] +++ OK, passed 100 tests.
  12168. 964.25 s [vector] cons: OK
  12169. 964.25 s [vector] +++ OK, passed 100 tests.
  12170. 964.25 s [vector] snoc: OK
  12171. 964.25 s [vector] +++ OK, passed 100 tests.
  12172. 964.25 s [vector] append: OK
  12173. 964.25 s [vector] +++ OK, passed 100 tests.
  12174. 964.26 s [vector] concat: OK (0.01s)
  12175. 964.26 s [vector] +++ OK, passed 100 tests.
  12176. 964.26 s [vector] force: OK
  12177. 964.26 s [vector] +++ OK, passed 100 tests.
  12178. 964.27 s [vector] upd: OK
  12179. 964.27 s [vector] +++ OK, passed 100 tests.
  12180. 964.28 s [vector] accum: OK
  12181. 964.28 s [vector] +++ OK, passed 100 tests.
  12182. 964.28 s [vector] reverse: OK
  12183. 964.29 s [vector] +++ OK, passed 100 tests.
  12184. 964.29 s [vector] backpermute: OK
  12185. 964.29 s [vector] +++ OK, passed 100 tests.
  12186. 964.29 s [vector] map: OK
  12187. 964.29 s [vector] +++ OK, passed 100 tests.
  12188. 964.29 s [vector] imap: OK
  12189. 964.30 s [vector] +++ OK, passed 100 tests.
  12190. 964.30 s [vector] concatMap: OK
  12191. 964.30 s [vector] +++ OK, passed 100 tests.
  12192. 964.31 s [vector] mapM: OK
  12193. 964.31 s [vector] +++ OK, passed 100 tests.
  12194. 964.31 s [vector] mapM_: OK (0.02s)
  12195. 964.31 s [vector] +++ OK, passed 100 tests.
  12196. 964.31 s [vector] forM: OK
  12197. 964.31 s [vector] +++ OK, passed 100 tests.
  12198. 964.32 s [vector] forM_: OK (0.02s)
  12199. 964.33 s [vector] +++ OK, passed 100 tests.
  12200. 964.33 s [vector] imapM: OK
  12201. 964.33 s [vector] +++ OK, passed 100 tests.
  12202. 964.34 s [vector] imapM_: OK (0.02s)
  12203. 964.34 s [vector] +++ OK, passed 100 tests.
  12204. 964.34 s [vector] zipWith: OK
  12205. 964.34 s [vector] +++ OK, passed 100 tests.
  12206. 964.34 s [vector] zipWith3: OK
  12207. 964.34 s [vector] +++ OK, passed 100 tests.
  12208. 964.34 s [vector] izipWith: OK
  12209. 964.34 s [vector] +++ OK, passed 100 tests.
  12210. 964.35 s [vector] izipWith3: OK
  12211. 964.35 s [vector] +++ OK, passed 100 tests.
  12212. 964.35 s [vector] izipWithM: OK
  12213. 964.35 s [vector] +++ OK, passed 100 tests.
  12214. 964.36 s [vector] izipWithM_: OK (0.01s)
  12215. 964.36 s [vector] +++ OK, passed 100 tests.
  12216. 964.36 s [vector] zipWithM: OK
  12217. 964.36 s [vector] +++ OK, passed 100 tests.
  12218. 964.37 s [vector] zipWithM_: OK (0.01s)
  12219. 964.37 s [vector] +++ OK, passed 100 tests.
  12220. 964.37 s [vector] filter: OK
  12221. 964.37 s [vector] +++ OK, passed 100 tests.
  12222. 964.37 s [vector] ifilter: OK
  12223. 964.37 s [vector] +++ OK, passed 100 tests.
  12224. 964.42 s [vector] filterM: OK (0.04s)
  12225. 964.42 s [vector] +++ OK, passed 100 tests.
  12226. 964.42 s [vector] uniq: OK
  12227. 964.42 s [vector] +++ OK, passed 100 tests.
  12228. 964.42 s [vector] mapMaybe: OK
  12229. 964.42 s [vector] +++ OK, passed 100 tests.
  12230. 964.42 s [vector] imapMaybe: OK
  12231. 964.42 s [vector] +++ OK, passed 100 tests.
  12232. 964.42 s [vector] takeWhile: OK
  12233. 964.42 s [vector] +++ OK, passed 100 tests.
  12234. 964.42 s [vector] dropWhile: OK
  12235. 964.42 s [vector] +++ OK, passed 100 tests.
  12236. 964.42 s [vector] partition: OK
  12237. 964.42 s [vector] +++ OK, passed 100 tests.
  12238. 964.42 s [vector] partitionWith: OK
  12239. 964.42 s [vector] +++ OK, passed 100 tests.
  12240. 964.43 s [vector] span: OK
  12241. 964.43 s [vector] +++ OK, passed 100 tests.
  12242. 964.43 s [vector] break: OK
  12243. 964.43 s [vector] +++ OK, passed 100 tests.
  12244. 964.43 s [vector] spanR: OK
  12245. 964.43 s [vector] +++ OK, passed 100 tests.
  12246. 964.43 s [vector] breakR: OK
  12247. 964.43 s [vector] +++ OK, passed 100 tests.
  12248. 964.43 s [vector] groupBy: OK
  12249. 964.43 s [vector] +++ OK, passed 100 tests.
  12250. 964.43 s [vector] elem: OK
  12251. 964.43 s [vector] +++ OK, passed 100 tests.
  12252. 964.43 s [vector] notElem: OK
  12253. 964.43 s [vector] +++ OK, passed 100 tests.
  12254. 964.43 s [vector] find: OK
  12255. 964.43 s [vector] +++ OK, passed 100 tests.
  12256. 964.43 s [vector] findIndex: OK
  12257. 964.43 s [vector] +++ OK, passed 100 tests.
  12258. 964.43 s [vector] findIndexR: OK
  12259. 964.43 s [vector] +++ OK, passed 100 tests.
  12260. 964.44 s [vector] findIndices: OK
  12261. 964.44 s [vector] +++ OK, passed 100 tests.
  12262. 964.44 s [vector] elemIndex: OK
  12263. 964.44 s [vector] +++ OK, passed 100 tests.
  12264. 964.44 s [vector] elemIndices: OK
  12265. 964.44 s [vector] +++ OK, passed 100 tests.
  12266. 964.44 s [vector] foldl: OK
  12267. 964.44 s [vector] +++ OK, passed 100 tests.
  12268. 964.44 s [vector] foldl1: OK
  12269. 964.44 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12270. 964.44 s [vector] foldl': OK
  12271. 964.44 s [vector] +++ OK, passed 100 tests.
  12272. 964.45 s [vector] foldl1': OK
  12273. 964.45 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12274. 964.45 s [vector] foldr: OK
  12275. 964.45 s [vector] +++ OK, passed 100 tests.
  12276. 964.45 s [vector] foldr1: OK
  12277. 964.45 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12278. 964.45 s [vector] foldr': OK
  12279. 964.46 s [vector] +++ OK, passed 100 tests.
  12280. 964.46 s [vector] foldr1': OK
  12281. 964.47 s [vector] +++ OK, passed 100 tests; 21 discarded.
  12282. 964.47 s [vector] ifoldl: OK
  12283. 964.47 s [vector] +++ OK, passed 100 tests.
  12284. 964.49 s [vector] ifoldl': OK
  12285. 964.49 s [vector] +++ OK, passed 100 tests.
  12286. 964.49 s [vector] ifoldr: OK
  12287. 964.49 s [vector] +++ OK, passed 100 tests.
  12288. 964.49 s [vector] ifoldr': OK
  12289. 964.49 s [vector] +++ OK, passed 100 tests.
  12290. 964.49 s [vector] ifoldM: OK
  12291. 964.49 s [vector] +++ OK, passed 100 tests.
  12292. 964.49 s [vector] ifoldM': OK
  12293. 964.49 s [vector] +++ OK, passed 100 tests.
  12294. 964.49 s [vector] ifoldM_: OK (0.01s)
  12295. 964.49 s [vector] +++ OK, passed 100 tests.
  12296. 964.50 s [vector] ifoldM'_: OK (0.01s)
  12297. 964.50 s [vector] +++ OK, passed 100 tests.
  12298. 964.50 s [vector] all: OK
  12299. 964.50 s [vector] +++ OK, passed 100 tests.
  12300. 964.51 s [vector] any: OK
  12301. 964.51 s [vector] +++ OK, passed 100 tests.
  12302. 964.51 s [vector] prescanl: OK
  12303. 964.51 s [vector] +++ OK, passed 100 tests.
  12304. 964.51 s [vector] prescanl': OK
  12305. 964.51 s [vector] +++ OK, passed 100 tests.
  12306. 964.51 s [vector] postscanl: OK
  12307. 964.51 s [vector] +++ OK, passed 100 tests.
  12308. 964.51 s [vector] postscanl': OK
  12309. 964.52 s [vector] +++ OK, passed 100 tests.
  12310. 964.52 s [vector] scanl: OK
  12311. 964.52 s [vector] +++ OK, passed 100 tests.
  12312. 964.52 s [vector] scanl': OK
  12313. 964.52 s [vector] +++ OK, passed 100 tests.
  12314. 964.52 s [vector] scanl1: OK
  12315. 964.52 s [vector] +++ OK, passed 100 tests.
  12316. 964.52 s [vector] scanl1': OK
  12317. 964.53 s [vector] +++ OK, passed 100 tests.
  12318. 964.53 s [vector] iscanl: OK
  12319. 964.53 s [vector] +++ OK, passed 100 tests.
  12320. 964.53 s [vector] iscanl': OK
  12321. 964.53 s [vector] +++ OK, passed 100 tests.
  12322. 964.53 s [vector] prescanr: OK
  12323. 964.54 s [vector] +++ OK, passed 100 tests.
  12324. 964.54 s [vector] prescanr': OK
  12325. 964.54 s [vector] +++ OK, passed 100 tests.
  12326. 964.54 s [vector] postscanr: OK
  12327. 964.54 s [vector] +++ OK, passed 100 tests.
  12328. 964.55 s [vector] postscanr': OK
  12329. 964.55 s [vector] +++ OK, passed 100 tests.
  12330. 964.55 s [vector] scanr: OK
  12331. 964.55 s [vector] +++ OK, passed 100 tests.
  12332. 964.55 s [vector] scanr': OK
  12333. 964.55 s [vector] +++ OK, passed 100 tests.
  12334. 964.55 s [vector] scanr1: OK
  12335. 964.55 s [vector] +++ OK, passed 100 tests.
  12336. 964.55 s [vector] scanr1': OK
  12337. 964.56 s [vector] +++ OK, passed 100 tests.
  12338. 964.56 s [vector] iscanr: OK
  12339. 964.56 s [vector] +++ OK, passed 100 tests.
  12340. 964.56 s [vector] iscanr': OK
  12341. 964.56 s [vector] +++ OK, passed 100 tests.
  12342. 964.56 s [vector] mut_read: OK
  12343. 964.56 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12344. 964.56 s [vector] mut_write: OK
  12345. 964.56 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12346. 964.56 s [vector] mut_modify: OK
  12347. 964.56 s [vector] +++ OK, passed 100 tests; 12 discarded.
  12348. 964.57 s [vector] mut_generate: OK
  12349. 964.57 s [vector] +++ OK, passed 100 tests.
  12350. 964.57 s [vector] mut_generateM: OK
  12351. 964.57 s [vector] +++ OK, passed 100 tests.
  12352. 964.59 s [vector] mut_mapM_: OK (0.02s)
  12353. 964.59 s [vector] +++ OK, passed 100 tests.
  12354. 964.61 s [vector] mut_imapM_: OK (0.02s)
  12355. 964.61 s [vector] +++ OK, passed 100 tests.
  12356. 964.63 s [vector] mut_forM_: OK (0.02s)
  12357. 964.63 s [vector] +++ OK, passed 100 tests.
  12358. 964.65 s [vector] mut_iforM_: OK (0.02s)
  12359. 964.65 s [vector] +++ OK, passed 100 tests.
  12360. 964.65 s [vector] mut_foldr: OK
  12361. 964.65 s [vector] +++ OK, passed 100 tests.
  12362. 964.66 s [vector] mut_foldr': OK
  12363. 964.66 s [vector] +++ OK, passed 100 tests.
  12364. 964.66 s [vector] mut_foldl: OK
  12365. 964.66 s [vector] +++ OK, passed 100 tests.
  12366. 964.66 s [vector] mut_foldl': OK
  12367. 964.66 s [vector] +++ OK, passed 100 tests.
  12368. 964.67 s [vector] mut_ifoldr: OK
  12369. 964.67 s [vector] +++ OK, passed 100 tests.
  12370. 964.67 s [vector] mut_ifoldr': OK
  12371. 964.67 s [vector] +++ OK, passed 100 tests.
  12372. 964.67 s [vector] mut_ifoldl: OK
  12373. 964.67 s [vector] +++ OK, passed 100 tests.
  12374. 964.67 s [vector] mut_ifoldl': OK
  12375. 964.67 s [vector] +++ OK, passed 100 tests.
  12376. 964.67 s [vector] mut_foldM: OK
  12377. 964.67 s [vector] +++ OK, passed 100 tests.
  12378. 964.67 s [vector] mut_foldM': OK
  12379. 964.68 s [vector] +++ OK, passed 100 tests.
  12380. 964.68 s [vector] mut_foldrM: OK
  12381. 964.69 s [vector] +++ OK, passed 100 tests.
  12382. 964.69 s [vector] mut_foldrM': OK
  12383. 964.69 s [vector] +++ OK, passed 100 tests.
  12384. 964.69 s [vector] mut_ifoldM: OK
  12385. 964.69 s [vector] +++ OK, passed 100 tests.
  12386. 964.70 s [vector] mut_ifoldM': OK
  12387. 964.70 s [vector] +++ OK, passed 100 tests.
  12388. 964.70 s [vector] mut_ifoldrM: OK
  12389. 964.70 s [vector] +++ OK, passed 100 tests.
  12390. 964.71 s [vector] mut_ifoldrM': OK
  12391. 964.71 s [vector] +++ OK, passed 100 tests.
  12392. 964.71 s [vector] compare: OK
  12393. 964.71 s [vector] +++ OK, passed 100 tests.
  12394. 964.71 s [vector] maximum: OK
  12395. 964.71 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12396. 964.71 s [vector] minimum: OK
  12397. 964.71 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12398. 964.71 s [vector] minIndex: OK
  12399. 964.71 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12400. 964.71 s [vector] maxIndex: OK
  12401. 964.71 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12402. 964.71 s [vector] maximumBy: OK
  12403. 964.71 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12404. 964.71 s [vector] minimumBy: OK
  12405. 964.71 s [vector] +++ OK, passed 100 tests; 20 discarded.
  12406. 964.72 s [vector] maximumOn: OK
  12407. 964.72 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12408. 964.72 s [vector] minimumOn: OK
  12409. 964.72 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12410. 964.72 s [vector] maxIndexBy: OK
  12411. 964.72 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12412. 964.72 s [vector] minIndexBy: OK
  12413. 964.72 s [vector] +++ OK, passed 100 tests; 12 discarded.
  12414. 964.72 s [vector] ListFirstMaxIndexWins: OK
  12415. 964.72 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12416. 964.72 s [vector] FalseListFirstMaxIndexWins: OK
  12417. 964.72 s [vector] +++ OK, failed as expected. (after 1 test):
  12418. 964.72 s [vector] Exception:
  12419. 964.72 s [vector] Prelude.foldr1: empty list
  12420. 964.72 s [vector] CallStack (from HasCallStack):
  12421. 964.72 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  12422. 964.72 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  12423. 964.72 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  12424. 964.72 s [vector] []
  12425. 964.73 s [vector] mempty: OK
  12426. 964.73 s [vector] +++ OK, passed 100 tests.
  12427. 964.73 s [vector] mappend: OK
  12428. 964.73 s [vector] +++ OK, passed 100 tests.
  12429. 964.74 s [vector] mconcat: OK (0.02s)
  12430. 964.74 s [vector] +++ OK, passed 100 tests.
  12431. 964.74 s [vector] glength: OK
  12432. 964.74 s [vector] +++ OK, passed 100 tests.
  12433. 964.74 s [vector] sum: OK
  12434. 964.74 s [vector] +++ OK, passed 100 tests.
  12435. 964.74 s [vector] product: OK
  12436. 964.74 s [vector] +++ OK, passed 100 tests.
  12437. 964.74 s [vector] enumFromN: OK
  12438. 964.74 s [vector] +++ OK, passed 100 tests.
  12439. 964.74 s [vector] enumFromThenN: OK
  12440. 964.74 s [vector] +++ OK, passed 100 tests.
  12441. 964.74 s [vector] enumFromTo: OK
  12442. 964.74 s [vector] +++ OK, passed 100 tests.
  12443. 964.74 s [vector] enumFromThenTo: OK
  12444. 964.74 s [vector] +++ OK, passed 100 tests; 12 discarded.
  12445. 964.74 s [vector] Data.Vector.Storable.Vector (Double)
  12446. 964.74 s [vector] fromList.toList == id: OK
  12447. 964.74 s [vector] +++ OK, passed 100 tests.
  12448. 964.74 s [vector] toList.fromList == id: OK
  12449. 964.74 s [vector] +++ OK, passed 100 tests.
  12450. 964.74 s [vector] unstream.stream == id: OK
  12451. 964.75 s [vector] +++ OK, passed 100 tests.
  12452. 964.75 s [vector] stream.unstream == id: OK
  12453. 964.75 s [vector] +++ OK, passed 100 tests.
  12454. 964.75 s [vector] eq: OK
  12455. 964.75 s [vector] +++ OK, passed 100 tests.
  12456. 964.75 s [vector] length: OK
  12457. 964.75 s [vector] +++ OK, passed 100 tests.
  12458. 964.75 s [vector] null: OK
  12459. 964.75 s [vector] +++ OK, passed 100 tests.
  12460. 964.75 s [vector] index: OK
  12461. 964.75 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12462. 964.75 s [vector] safeIndex: OK
  12463. 964.75 s [vector] +++ OK, passed 100 tests.
  12464. 964.75 s [vector] head: OK
  12465. 964.75 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12466. 964.75 s [vector] last: OK
  12467. 964.75 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12468. 964.75 s [vector] unsafeIndex: OK
  12469. 964.75 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12470. 964.76 s [vector] unsafeHead: OK
  12471. 964.76 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12472. 964.76 s [vector] unsafeLast: OK
  12473. 964.76 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12474. 964.76 s [vector] slice: OK
  12475. 964.76 s [vector] +++ OK, passed 100 tests.
  12476. 964.76 s [vector] init: OK
  12477. 964.76 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12478. 964.77 s [vector] tail: OK
  12479. 964.77 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12480. 964.77 s [vector] take: OK
  12481. 964.77 s [vector] +++ OK, passed 100 tests.
  12482. 964.77 s [vector] drop: OK
  12483. 964.77 s [vector] +++ OK, passed 100 tests.
  12484. 964.78 s [vector] splitAt: OK
  12485. 964.78 s [vector] +++ OK, passed 100 tests.
  12486. 964.78 s [vector] empty: OK
  12487. 964.78 s [vector] +++ OK, passed 100 tests.
  12488. 964.78 s [vector] singleton: OK
  12489. 964.79 s [vector] +++ OK, passed 100 tests.
  12490. 964.79 s [vector] replicate: OK
  12491. 964.79 s [vector] +++ OK, passed 100 tests.
  12492. 964.80 s [vector] generate: OK
  12493. 964.81 s [vector] +++ OK, passed 100 tests.
  12494. 964.81 s [vector] iterateN: OK
  12495. 964.81 s [vector] +++ OK, passed 100 tests.
  12496. 964.85 s [vector] iterateNM: OK (0.03s)
  12497. 964.85 s [vector] +++ OK, passed 100 tests.
  12498. 964.88 s [vector] generateM: OK (0.04s)
  12499. 964.88 s [vector] +++ OK, passed 100 tests.
  12500. 964.88 s [vector] replicateM: OK
  12501. 964.89 s [vector] +++ OK, passed 100 tests.
  12502. 964.89 s [vector] create: OK
  12503. 964.89 s [vector] +++ OK, passed 100 tests.
  12504. 964.89 s [vector] createT: OK
  12505. 964.89 s [vector] +++ OK, passed 100 tests.
  12506. 964.89 s [vector] unfoldr: OK
  12507. 964.89 s [vector] +++ OK, passed 100 tests.
  12508. 964.89 s [vector] unfoldrN: OK
  12509. 964.89 s [vector] +++ OK, passed 100 tests.
  12510. 964.89 s [vector] unfoldrExactN: OK
  12511. 964.89 s [vector] +++ OK, passed 100 tests.
  12512. 964.89 s [vector] unfoldrM: OK
  12513. 964.90 s [vector] +++ OK, passed 100 tests.
  12514. 964.90 s [vector] unfoldrNM: OK
  12515. 964.91 s [vector] +++ OK, passed 100 tests.
  12516. 964.93 s [vector] unfoldrExactNM: OK (0.02s)
  12517. 964.93 s [vector] +++ OK, passed 100 tests.
  12518. 964.95 s [vector] constructN: OK (0.02s)
  12519. 964.95 s [vector] +++ OK, passed 100 tests.
  12520. 964.98 s [vector] constructrN: OK (0.03s)
  12521. 964.98 s [vector] +++ OK, passed 100 tests.
  12522. 964.98 s [vector] cons: OK
  12523. 964.98 s [vector] +++ OK, passed 100 tests.
  12524. 964.99 s [vector] snoc: OK
  12525. 964.99 s [vector] +++ OK, passed 100 tests.
  12526. 965.00 s [vector] append: OK
  12527. 965.01 s [vector] +++ OK, passed 100 tests.
  12528. 965.05 s [vector] concat: OK (0.05s)
  12529. 965.05 s [vector] +++ OK, passed 100 tests.
  12530. 965.05 s [vector] force: OK
  12531. 965.05 s [vector] +++ OK, passed 100 tests.
  12532. 965.05 s [vector] upd: OK
  12533. 965.05 s [vector] +++ OK, passed 100 tests.
  12534. 965.06 s [vector] accum: OK (0.01s)
  12535. 965.06 s [vector] +++ OK, passed 100 tests.
  12536. 965.07 s [vector] reverse: OK
  12537. 965.07 s [vector] +++ OK, passed 100 tests.
  12538. 965.07 s [vector] backpermute: OK
  12539. 965.07 s [vector] +++ OK, passed 100 tests.
  12540. 965.07 s [vector] map: OK
  12541. 965.09 s [vector] +++ OK, passed 100 tests.
  12542. 965.09 s [vector] imap: OK (0.01s)
  12543. 965.09 s [vector] +++ OK, passed 100 tests.
  12544. 965.11 s [vector] concatMap: OK (0.02s)
  12545. 965.11 s [vector] +++ OK, passed 100 tests.
  12546. 965.13 s [vector] mapM: OK (0.02s)
  12547. 965.13 s [vector] +++ OK, passed 100 tests.
  12548. 965.21 s [vector] mapM_: OK (0.07s)
  12549. 965.21 s [vector] +++ OK, passed 100 tests.
  12550. 965.21 s [vector] forM: OK (0.01s)
  12551. 965.21 s [vector] +++ OK, passed 100 tests.
  12552. 965.25 s [vector] forM_: OK (0.04s)
  12553. 965.25 s [vector] +++ OK, passed 100 tests.
  12554. 965.25 s [vector] imapM: OK
  12555. 965.27 s [vector] +++ OK, passed 100 tests.
  12556. 965.31 s [vector] imapM_: OK (0.04s)
  12557. 965.31 s [vector] +++ OK, passed 100 tests.
  12558. 965.33 s [vector] zipWith: OK (0.02s)
  12559. 965.33 s [vector] +++ OK, passed 100 tests.
  12560. 965.35 s [vector] zipWith3: OK (0.02s)
  12561. 965.35 s [vector] +++ OK, passed 100 tests.
  12562. 965.38 s [vector] izipWith: OK (0.02s)
  12563. 965.38 s [vector] +++ OK, passed 100 tests.
  12564. 965.38 s [vector] izipWith3: OK (0.03s)
  12565. 965.38 s [vector] +++ OK, passed 100 tests.
  12566. 965.40 s [vector] izipWithM: OK
  12567. 965.40 s [vector] +++ OK, passed 100 tests.
  12568. 965.43 s [vector] izipWithM_: OK (0.03s)
  12569. 965.43 s [vector] +++ OK, passed 100 tests.
  12570. 965.44 s [vector] zipWithM: OK
  12571. 965.45 s [vector] +++ OK, passed 100 tests.
  12572. 965.47 s [vector] zipWithM_: OK (0.03s)
  12573. 965.47 s [vector] +++ OK, passed 100 tests.
  12574. 965.48 s [vector] filter: OK
  12575. 965.48 s [vector] +++ OK, passed 100 tests.
  12576. 965.48 s [vector] ifilter: OK
  12577. 965.49 s [vector] +++ OK, passed 100 tests.
  12578. 965.53 s [vector] filterM: OK (0.05s)
  12579. 965.53 s [vector] +++ OK, passed 100 tests.
  12580. 965.54 s [vector] uniq: OK
  12581. 965.54 s [vector] +++ OK, passed 100 tests.
  12582. 965.55 s [vector] mapMaybe: OK
  12583. 965.55 s [vector] +++ OK, passed 100 tests.
  12584. 965.55 s [vector] imapMaybe: OK
  12585. 965.55 s [vector] +++ OK, passed 100 tests.
  12586. 965.55 s [vector] takeWhile: OK
  12587. 965.55 s [vector] +++ OK, passed 100 tests.
  12588. 965.55 s [vector] dropWhile: OK
  12589. 965.55 s [vector] +++ OK, passed 100 tests.
  12590. 965.55 s [vector] partition: OK
  12591. 965.55 s [vector] +++ OK, passed 100 tests.
  12592. 965.56 s [vector] partitionWith: OK
  12593. 965.56 s [vector] +++ OK, passed 100 tests.
  12594. 965.56 s [vector] span: OK
  12595. 965.56 s [vector] +++ OK, passed 100 tests.
  12596. 965.56 s [vector] break: OK
  12597. 965.56 s [vector] +++ OK, passed 100 tests.
  12598. 965.57 s [vector] spanR: OK
  12599. 965.57 s [vector] +++ OK, passed 100 tests.
  12600. 965.57 s [vector] breakR: OK
  12601. 965.57 s [vector] +++ OK, passed 100 tests.
  12602. 965.58 s [vector] groupBy: OK
  12603. 965.58 s [vector] +++ OK, passed 100 tests.
  12604. 965.58 s [vector] elem: OK
  12605. 965.58 s [vector] +++ OK, passed 100 tests.
  12606. 965.58 s [vector] notElem: OK
  12607. 965.58 s [vector] +++ OK, passed 100 tests.
  12608. 965.58 s [vector] find: OK
  12609. 965.58 s [vector] +++ OK, passed 100 tests.
  12610. 965.58 s [vector] findIndex: OK
  12611. 965.58 s [vector] +++ OK, passed 100 tests.
  12612. 965.58 s [vector] findIndexR: OK
  12613. 965.59 s [vector] +++ OK, passed 100 tests.
  12614. 965.59 s [vector] findIndices: OK
  12615. 965.59 s [vector] +++ OK, passed 100 tests.
  12616. 965.59 s [vector] elemIndex: OK
  12617. 965.59 s [vector] +++ OK, passed 100 tests.
  12618. 965.59 s [vector] elemIndices: OK
  12619. 965.59 s [vector] +++ OK, passed 100 tests.
  12620. 965.61 s [vector] foldl: OK (0.01s)
  12621. 965.61 s [vector] +++ OK, passed 100 tests.
  12622. 965.62 s [vector] foldl1: OK (0.01s)
  12623. 965.63 s [vector] +++ OK, passed 100 tests; 20 discarded.
  12624. 965.63 s [vector] foldl': OK (0.01s)
  12625. 965.63 s [vector] +++ OK, passed 100 tests.
  12626. 965.63 s [vector] foldl1': OK (0.01s)
  12627. 965.63 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12628. 965.65 s [vector] foldr: OK
  12629. 965.65 s [vector] +++ OK, passed 100 tests.
  12630. 965.67 s [vector] foldr1: OK (0.01s)
  12631. 965.67 s [vector] +++ OK, passed 100 tests; 12 discarded.
  12632. 965.67 s [vector] foldr': OK (0.01s)
  12633. 965.67 s [vector] +++ OK, passed 100 tests.
  12634. 965.69 s [vector] foldr1': OK (0.01s)
  12635. 965.69 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12636. 965.71 s [vector] ifoldl: OK (0.02s)
  12637. 965.71 s [vector] +++ OK, passed 100 tests.
  12638. 965.73 s [vector] ifoldl': OK (0.02s)
  12639. 965.73 s [vector] +++ OK, passed 100 tests.
  12640. 965.75 s [vector] ifoldr: OK (0.03s)
  12641. 965.75 s [vector] +++ OK, passed 100 tests.
  12642. 965.79 s [vector] ifoldr': OK (0.03s)
  12643. 965.79 s [vector] +++ OK, passed 100 tests.
  12644. 965.82 s [vector] ifoldM: OK (0.03s)
  12645. 965.82 s [vector] +++ OK, passed 100 tests.
  12646. 965.83 s [vector] ifoldM': OK (0.03s)
  12647. 965.83 s [vector] +++ OK, passed 100 tests.
  12648. 965.89 s [vector] ifoldM_: OK (0.05s)
  12649. 965.89 s [vector] +++ OK, passed 100 tests.
  12650. 965.94 s [vector] ifoldM'_: OK (0.06s)
  12651. 965.94 s [vector] +++ OK, passed 100 tests.
  12652. 965.94 s [vector] all: OK
  12653. 965.94 s [vector] +++ OK, passed 100 tests.
  12654. 965.94 s [vector] any: OK
  12655. 965.95 s [vector] +++ OK, passed 100 tests.
  12656. 965.97 s [vector] prescanl: OK (0.02s)
  12657. 965.97 s [vector] +++ OK, passed 100 tests.
  12658. 965.99 s [vector] prescanl': OK (0.02s)
  12659. 965.99 s [vector] +++ OK, passed 100 tests.
  12660. 966.01 s [vector] postscanl: OK (0.03s)
  12661. 966.01 s [vector] +++ OK, passed 100 tests.
  12662. 966.03 s [vector] postscanl': OK (0.02s)
  12663. 966.03 s [vector] +++ OK, passed 100 tests.
  12664. 966.07 s [vector] scanl: OK (0.03s)
  12665. 966.07 s [vector] +++ OK, passed 100 tests.
  12666. 966.11 s [vector] scanl': OK (0.04s)
  12667. 966.11 s [vector] +++ OK, passed 100 tests.
  12668. 966.15 s [vector] scanl1: OK (0.03s)
  12669. 966.15 s [vector] +++ OK, passed 100 tests.
  12670. 966.17 s [vector] scanl1': OK (0.03s)
  12671. 966.18 s [vector] +++ OK, passed 100 tests.
  12672. 966.21 s [vector] iscanl: OK (0.04s)
  12673. 966.21 s [vector] +++ OK, passed 100 tests.
  12674. 966.24 s [vector] iscanl': OK (0.03s)
  12675. 966.24 s [vector] +++ OK, passed 100 tests.
  12676. 966.27 s [vector] prescanr: OK (0.04s)
  12677. 966.27 s [vector] +++ OK, passed 100 tests.
  12678. 966.31 s [vector] prescanr': OK (0.03s)
  12679. 966.31 s [vector] +++ OK, passed 100 tests.
  12680. 966.31 s [vector] postscanr: OK (0.01s)
  12681. 966.31 s [vector] +++ OK, passed 100 tests.
  12682. 966.33 s [vector] postscanr': OK (0.01s)
  12683. 966.33 s [vector] +++ OK, passed 100 tests.
  12684. 966.35 s [vector] scanr: OK (0.01s)
  12685. 966.35 s [vector] +++ OK, passed 100 tests.
  12686. 966.35 s [vector] scanr': OK (0.01s)
  12687. 966.35 s [vector] +++ OK, passed 100 tests.
  12688. 966.39 s [vector] scanr1: OK (0.03s)
  12689. 966.39 s [vector] +++ OK, passed 100 tests.
  12690. 966.41 s [vector] scanr1': OK (0.01s)
  12691. 966.41 s [vector] +++ OK, passed 100 tests.
  12692. 966.41 s [vector] iscanr: OK (0.01s)
  12693. 966.41 s [vector] +++ OK, passed 100 tests.
  12694. 966.44 s [vector] iscanr': OK (0.02s)
  12695. 966.44 s [vector] +++ OK, passed 100 tests.
  12696. 966.44 s [vector] mut_read: OK
  12697. 966.44 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12698. 966.44 s [vector] mut_write: OK
  12699. 966.44 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12700. 966.44 s [vector] mut_modify: OK
  12701. 966.44 s [vector] +++ OK, passed 100 tests; 26 discarded.
  12702. 966.45 s [vector] mut_generate: OK
  12703. 966.45 s [vector] +++ OK, passed 100 tests.
  12704. 966.47 s [vector] mut_generateM: OK (0.02s)
  12705. 966.47 s [vector] +++ OK, passed 100 tests.
  12706. 966.55 s [vector] mut_mapM_: OK (0.07s)
  12707. 966.55 s [vector] +++ OK, passed 100 tests.
  12708. 966.60 s [vector] mut_imapM_: OK (0.06s)
  12709. 966.60 s [vector] +++ OK, passed 100 tests.
  12710. 966.67 s [vector] mut_forM_: OK (0.05s)
  12711. 966.67 s [vector] +++ OK, passed 100 tests.
  12712. 966.71 s [vector] mut_iforM_: OK (0.05s)
  12713. 966.71 s [vector] +++ OK, passed 100 tests.
  12714. 966.73 s [vector] mut_foldr: OK (0.01s)
  12715. 966.73 s [vector] +++ OK, passed 100 tests.
  12716. 966.75 s [vector] mut_foldr': OK (0.02s)
  12717. 966.75 s [vector] +++ OK, passed 100 tests.
  12718. 966.77 s [vector] mut_foldl: OK (0.02s)
  12719. 966.77 s [vector] +++ OK, passed 100 tests.
  12720. 966.79 s [vector] mut_foldl': OK (0.02s)
  12721. 966.79 s [vector] +++ OK, passed 100 tests.
  12722. 966.81 s [vector] mut_ifoldr: OK (0.02s)
  12723. 966.81 s [vector] +++ OK, passed 100 tests.
  12724. 966.87 s [vector] mut_ifoldr': OK (0.03s)
  12725. 966.87 s [vector] +++ OK, passed 100 tests.
  12726. 966.87 s [vector] mut_ifoldl: OK (0.02s)
  12727. 966.87 s [vector] +++ OK, passed 100 tests.
  12728. 966.91 s [vector] mut_ifoldl': OK (0.02s)
  12729. 966.91 s [vector] +++ OK, passed 100 tests.
  12730. 966.91 s [vector] mut_foldM: OK (0.02s)
  12731. 966.91 s [vector] +++ OK, passed 100 tests.
  12732. 966.91 s [vector] mut_foldM': OK (0.01s)
  12733. 966.91 s [vector] +++ OK, passed 100 tests.
  12734. 966.93 s [vector] mut_foldrM: OK (0.02s)
  12735. 966.93 s [vector] +++ OK, passed 100 tests.
  12736. 966.95 s [vector] mut_foldrM': OK (0.02s)
  12737. 966.95 s [vector] +++ OK, passed 100 tests.
  12738. 966.97 s [vector] mut_ifoldM: OK (0.02s)
  12739. 966.98 s [vector] +++ OK, passed 100 tests.
  12740. 967.01 s [vector] mut_ifoldM': OK (0.03s)
  12741. 967.01 s [vector] +++ OK, passed 100 tests.
  12742. 967.03 s [vector] mut_ifoldrM: OK (0.03s)
  12743. 967.03 s [vector] +++ OK, passed 100 tests.
  12744. 967.06 s [vector] mut_ifoldrM': OK (0.02s)
  12745. 967.06 s [vector] +++ OK, passed 100 tests.
  12746. 967.06 s [vector] compare: OK
  12747. 967.06 s [vector] +++ OK, passed 100 tests.
  12748. 967.06 s [vector] maximum: OK
  12749. 967.06 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12750. 967.06 s [vector] minimum: OK
  12751. 967.06 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12752. 967.06 s [vector] minIndex: OK
  12753. 967.06 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12754. 967.06 s [vector] maxIndex: OK
  12755. 967.06 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12756. 967.07 s [vector] maximumBy: OK
  12757. 967.07 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12758. 967.07 s [vector] minimumBy: OK
  12759. 967.07 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12760. 967.07 s [vector] maximumOn: OK
  12761. 967.07 s [vector] +++ OK, passed 100 tests; 11 discarded.
  12762. 967.07 s [vector] minimumOn: OK
  12763. 967.07 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12764. 967.07 s [vector] maxIndexBy: OK
  12765. 967.07 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12766. 967.08 s [vector] minIndexBy: OK
  12767. 967.08 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12768. 967.08 s [vector] ListFirstMaxIndexWins: OK
  12769. 967.08 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12770. 967.08 s [vector] FalseListFirstMaxIndexWins: OK
  12771. 967.08 s [vector] +++ OK, failed as expected. (after 1 test):
  12772. 967.08 s [vector] Exception:
  12773. 967.08 s [vector] Prelude.foldr1: empty list
  12774. 967.08 s [vector] CallStack (from HasCallStack):
  12775. 967.08 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  12776. 967.08 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  12777. 967.08 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  12778. 967.08 s [vector] []
  12779. 967.08 s [vector] mempty: OK
  12780. 967.08 s [vector] +++ OK, passed 100 tests.
  12781. 967.09 s [vector] mappend: OK
  12782. 967.09 s [vector] +++ OK, passed 100 tests.
  12783. 967.11 s [vector] mconcat: OK (0.03s)
  12784. 967.11 s [vector] +++ OK, passed 100 tests.
  12785. 967.11 s [vector] glength: OK
  12786. 967.11 s [vector] +++ OK, passed 100 tests.
  12787. 967.11 s [vector] sum: OK
  12788. 967.11 s [vector] +++ OK, passed 100 tests.
  12789. 967.11 s [vector] product: OK
  12790. 967.12 s [vector] +++ OK, passed 100 tests.
  12791. 967.12 s [vector] enumFromN: OK
  12792. 967.12 s [vector] +++ OK, passed 100 tests.
  12793. 967.12 s [vector] enumFromThenN: OK
  12794. 967.12 s [vector] +++ OK, passed 100 tests.
  12795. 967.12 s [vector] enumFromTo: OK
  12796. 967.12 s [vector] +++ OK, passed 100 tests.
  12797. 967.12 s [vector] enumFromThenTo: OK
  12798. 967.12 s [vector] +++ OK, passed 100 tests; 6 discarded.
  12799. 967.12 s [vector] unstream
  12800. 967.12 s [vector] unstream == vunstream (exact): OK
  12801. 967.12 s [vector] +++ OK, passed 100 tests.
  12802. 967.12 s [vector] unstream == vunstream (unknown): OK
  12803. 967.12 s [vector] +++ OK, passed 100 tests.
  12804. 967.12 s [vector] unstreamR ~= vunstream (exact): OK
  12805. 967.12 s [vector] +++ OK, passed 100 tests.
  12806. 967.12 s [vector] unstreamR ~= vunstream (unknown): OK
  12807. 967.12 s [vector] +++ OK, passed 100 tests.
  12808. 967.12 s [vector] Tests.Vector.Strict
  12809. 967.12 s [vector] Bool
  12810. 967.12 s [vector] fromList.toList == id: OK
  12811. 967.12 s [vector] +++ OK, passed 100 tests.
  12812. 967.12 s [vector] toList.fromList == id: OK
  12813. 967.12 s [vector] +++ OK, passed 100 tests.
  12814. 967.12 s [vector] unstream.stream == id: OK
  12815. 967.12 s [vector] +++ OK, passed 100 tests.
  12816. 967.12 s [vector] stream.unstream == id: OK
  12817. 967.12 s [vector] +++ OK, passed 100 tests.
  12818. 967.12 s [vector] eq: OK
  12819. 967.12 s [vector] +++ OK, passed 100 tests.
  12820. 967.12 s [vector] length: OK
  12821. 967.12 s [vector] +++ OK, passed 100 tests.
  12822. 967.12 s [vector] null: OK
  12823. 967.12 s [vector] +++ OK, passed 100 tests.
  12824. 967.12 s [vector] index: OK
  12825. 967.12 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12826. 967.12 s [vector] safeIndex: OK
  12827. 967.12 s [vector] +++ OK, passed 100 tests.
  12828. 967.12 s [vector] head: OK
  12829. 967.12 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12830. 967.12 s [vector] last: OK
  12831. 967.12 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12832. 967.12 s [vector] unsafeIndex: OK
  12833. 967.12 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12834. 967.12 s [vector] unsafeHead: OK
  12835. 967.12 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12836. 967.12 s [vector] unsafeLast: OK
  12837. 967.12 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12838. 967.12 s [vector] slice: OK
  12839. 967.12 s [vector] +++ OK, passed 100 tests.
  12840. 967.12 s [vector] init: OK
  12841. 967.12 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12842. 967.12 s [vector] tail: OK
  12843. 967.12 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12844. 967.12 s [vector] take: OK
  12845. 967.12 s [vector] +++ OK, passed 100 tests.
  12846. 967.13 s [vector] drop: OK
  12847. 967.13 s [vector] +++ OK, passed 100 tests.
  12848. 967.13 s [vector] splitAt: OK
  12849. 967.13 s [vector] +++ OK, passed 100 tests.
  12850. 967.13 s [vector] empty: OK
  12851. 967.13 s [vector] +++ OK, passed 100 tests.
  12852. 967.13 s [vector] singleton: OK
  12853. 967.13 s [vector] +++ OK, passed 100 tests.
  12854. 967.13 s [vector] replicate: OK
  12855. 967.13 s [vector] +++ OK, passed 100 tests.
  12856. 967.13 s [vector] generate: OK
  12857. 967.13 s [vector] +++ OK, passed 100 tests.
  12858. 967.13 s [vector] iterateN: OK
  12859. 967.13 s [vector] +++ OK, passed 100 tests.
  12860. 967.15 s [vector] iterateNM: OK (0.02s)
  12861. 967.15 s [vector] +++ OK, passed 100 tests.
  12862. 967.18 s [vector] generateM: OK (0.02s)
  12863. 967.18 s [vector] +++ OK, passed 100 tests.
  12864. 967.19 s [vector] replicateM: OK (0.02s)
  12865. 967.19 s [vector] +++ OK, passed 100 tests.
  12866. 967.19 s [vector] create: OK
  12867. 967.19 s [vector] +++ OK, passed 100 tests.
  12868. 967.19 s [vector] createT: OK
  12869. 967.19 s [vector] +++ OK, passed 100 tests.
  12870. 967.19 s [vector] unfoldr: OK
  12871. 967.19 s [vector] +++ OK, passed 100 tests.
  12872. 967.19 s [vector] unfoldrN: OK
  12873. 967.19 s [vector] +++ OK, passed 100 tests.
  12874. 967.19 s [vector] unfoldrExactN: OK
  12875. 967.19 s [vector] +++ OK, passed 100 tests.
  12876. 967.19 s [vector] unfoldrM: OK
  12877. 967.19 s [vector] +++ OK, passed 100 tests.
  12878. 967.20 s [vector] unfoldrNM: OK
  12879. 967.20 s [vector] +++ OK, passed 100 tests.
  12880. 967.20 s [vector] unfoldrExactNM: OK
  12881. 967.21 s [vector] +++ OK, passed 100 tests.
  12882. 967.21 s [vector] constructN: OK
  12883. 967.21 s [vector] +++ OK, passed 100 tests.
  12884. 967.21 s [vector] constructrN: OK
  12885. 967.21 s [vector] +++ OK, passed 100 tests.
  12886. 967.21 s [vector] cons: OK
  12887. 967.21 s [vector] +++ OK, passed 100 tests.
  12888. 967.21 s [vector] snoc: OK
  12889. 967.21 s [vector] +++ OK, passed 100 tests.
  12890. 967.21 s [vector] append: OK
  12891. 967.23 s [vector] +++ OK, passed 100 tests.
  12892. 967.23 s [vector] concat: OK
  12893. 967.23 s [vector] +++ OK, passed 100 tests.
  12894. 967.23 s [vector] force: OK
  12895. 967.24 s [vector] +++ OK, passed 100 tests.
  12896. 967.24 s [vector] upd: OK
  12897. 967.24 s [vector] +++ OK, passed 100 tests.
  12898. 967.24 s [vector] accum: OK
  12899. 967.24 s [vector] +++ OK, passed 100 tests.
  12900. 967.25 s [vector] reverse: OK
  12901. 967.25 s [vector] +++ OK, passed 100 tests.
  12902. 967.25 s [vector] backpermute: OK
  12903. 967.25 s [vector] +++ OK, passed 100 tests.
  12904. 967.26 s [vector] map: OK
  12905. 967.26 s [vector] +++ OK, passed 100 tests.
  12906. 967.26 s [vector] imap: OK
  12907. 967.26 s [vector] +++ OK, passed 100 tests.
  12908. 967.27 s [vector] concatMap: OK
  12909. 967.27 s [vector] +++ OK, passed 100 tests.
  12910. 967.27 s [vector] mapM: OK
  12911. 967.27 s [vector] +++ OK, passed 100 tests.
  12912. 967.29 s [vector] mapM_: OK (0.02s)
  12913. 967.29 s [vector] +++ OK, passed 100 tests.
  12914. 967.29 s [vector] forM: OK
  12915. 967.29 s [vector] +++ OK, passed 100 tests.
  12916. 967.31 s [vector] forM_: OK (0.01s)
  12917. 967.31 s [vector] +++ OK, passed 100 tests.
  12918. 967.31 s [vector] imapM: OK
  12919. 967.31 s [vector] +++ OK, passed 100 tests.
  12920. 967.33 s [vector] imapM_: OK (0.02s)
  12921. 967.33 s [vector] +++ OK, passed 100 tests.
  12922. 967.33 s [vector] zipWith: OK
  12923. 967.33 s [vector] +++ OK, passed 100 tests.
  12924. 967.33 s [vector] zipWith3: OK
  12925. 967.33 s [vector] +++ OK, passed 100 tests.
  12926. 967.33 s [vector] izipWith: OK
  12927. 967.33 s [vector] +++ OK, passed 100 tests.
  12928. 967.33 s [vector] izipWith3: OK
  12929. 967.33 s [vector] +++ OK, passed 100 tests.
  12930. 967.33 s [vector] izipWithM: OK
  12931. 967.33 s [vector] +++ OK, passed 100 tests.
  12932. 967.34 s [vector] izipWithM_: OK
  12933. 967.34 s [vector] +++ OK, passed 100 tests.
  12934. 967.34 s [vector] zipWithM: OK
  12935. 967.34 s [vector] +++ OK, passed 100 tests.
  12936. 967.34 s [vector] zipWithM_: OK
  12937. 967.35 s [vector] +++ OK, passed 100 tests.
  12938. 967.35 s [vector] filter: OK
  12939. 967.35 s [vector] +++ OK, passed 100 tests.
  12940. 967.35 s [vector] ifilter: OK
  12941. 967.35 s [vector] +++ OK, passed 100 tests.
  12942. 967.39 s [vector] filterM: OK (0.02s)
  12943. 967.39 s [vector] +++ OK, passed 100 tests.
  12944. 967.40 s [vector] uniq: OK
  12945. 967.40 s [vector] +++ OK, passed 100 tests.
  12946. 967.40 s [vector] mapMaybe: OK (0.02s)
  12947. 967.40 s [vector] +++ OK, passed 100 tests.
  12948. 967.40 s [vector] imapMaybe: OK
  12949. 967.40 s [vector] +++ OK, passed 100 tests.
  12950. 967.40 s [vector] takeWhile: OK
  12951. 967.40 s [vector] +++ OK, passed 100 tests.
  12952. 967.40 s [vector] dropWhile: OK
  12953. 967.40 s [vector] +++ OK, passed 100 tests.
  12954. 967.40 s [vector] partition: OK
  12955. 967.41 s [vector] +++ OK, passed 100 tests.
  12956. 967.41 s [vector] partitionWith: OK
  12957. 967.41 s [vector] +++ OK, passed 100 tests.
  12958. 967.41 s [vector] span: OK
  12959. 967.41 s [vector] +++ OK, passed 100 tests.
  12960. 967.41 s [vector] break: OK
  12961. 967.42 s [vector] +++ OK, passed 100 tests.
  12962. 967.42 s [vector] spanR: OK
  12963. 967.42 s [vector] +++ OK, passed 100 tests.
  12964. 967.42 s [vector] breakR: OK
  12965. 967.42 s [vector] +++ OK, passed 100 tests.
  12966. 967.42 s [vector] groupBy: OK
  12967. 967.42 s [vector] +++ OK, passed 100 tests.
  12968. 967.43 s [vector] elem: OK
  12969. 967.43 s [vector] +++ OK, passed 100 tests.
  12970. 967.43 s [vector] notElem: OK
  12971. 967.43 s [vector] +++ OK, passed 100 tests.
  12972. 967.43 s [vector] find: OK
  12973. 967.43 s [vector] +++ OK, passed 100 tests.
  12974. 967.44 s [vector] findIndex: OK
  12975. 967.44 s [vector] +++ OK, passed 100 tests.
  12976. 967.44 s [vector] findIndexR: OK
  12977. 967.44 s [vector] +++ OK, passed 100 tests.
  12978. 967.44 s [vector] findIndices: OK
  12979. 967.44 s [vector] +++ OK, passed 100 tests.
  12980. 967.45 s [vector] elemIndex: OK
  12981. 967.45 s [vector] +++ OK, passed 100 tests.
  12982. 967.45 s [vector] elemIndices: OK
  12983. 967.45 s [vector] +++ OK, passed 100 tests.
  12984. 967.45 s [vector] foldl: OK
  12985. 967.45 s [vector] +++ OK, passed 100 tests.
  12986. 967.45 s [vector] foldl1: OK
  12987. 967.45 s [vector] +++ OK, passed 100 tests; 12 discarded.
  12988. 967.46 s [vector] foldl': OK
  12989. 967.46 s [vector] +++ OK, passed 100 tests.
  12990. 967.46 s [vector] foldl1': OK
  12991. 967.46 s [vector] +++ OK, passed 100 tests; 21 discarded.
  12992. 967.46 s [vector] foldr: OK
  12993. 967.46 s [vector] +++ OK, passed 100 tests.
  12994. 967.46 s [vector] foldr1: OK
  12995. 967.46 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12996. 967.46 s [vector] foldr': OK
  12997. 967.46 s [vector] +++ OK, passed 100 tests.
  12998. 967.46 s [vector] foldr1': OK
  12999. 967.46 s [vector] +++ OK, passed 100 tests; 11 discarded.
  13000. 967.46 s [vector] ifoldl: OK
  13001. 967.47 s [vector] +++ OK, passed 100 tests.
  13002. 967.47 s [vector] ifoldl': OK
  13003. 967.47 s [vector] +++ OK, passed 100 tests.
  13004. 967.47 s [vector] ifoldr: OK
  13005. 967.47 s [vector] +++ OK, passed 100 tests.
  13006. 967.47 s [vector] ifoldr': OK
  13007. 967.47 s [vector] +++ OK, passed 100 tests.
  13008. 967.47 s [vector] ifoldM: OK
  13009. 967.47 s [vector] +++ OK, passed 100 tests.
  13010. 967.49 s [vector] ifoldM': OK
  13011. 967.49 s [vector] +++ OK, passed 100 tests.
  13012. 967.49 s [vector] ifoldM_: OK (0.01s)
  13013. 967.49 s [vector] +++ OK, passed 100 tests.
  13014. 967.50 s [vector] ifoldM'_: OK
  13015. 967.50 s [vector] +++ OK, passed 100 tests.
  13016. 967.50 s [vector] all: OK
  13017. 967.50 s [vector] +++ OK, passed 100 tests.
  13018. 967.50 s [vector] any: OK
  13019. 967.50 s [vector] +++ OK, passed 100 tests.
  13020. 967.50 s [vector] prescanl: OK
  13021. 967.50 s [vector] +++ OK, passed 100 tests.
  13022. 967.50 s [vector] prescanl': OK
  13023. 967.50 s [vector] +++ OK, passed 100 tests.
  13024. 967.50 s [vector] postscanl: OK
  13025. 967.50 s [vector] +++ OK, passed 100 tests.
  13026. 967.50 s [vector] postscanl': OK
  13027. 967.51 s [vector] +++ OK, passed 100 tests.
  13028. 967.51 s [vector] scanl: OK
  13029. 967.51 s [vector] +++ OK, passed 100 tests.
  13030. 967.51 s [vector] scanl': OK
  13031. 967.51 s [vector] +++ OK, passed 100 tests.
  13032. 967.51 s [vector] scanl1: OK
  13033. 967.51 s [vector] +++ OK, passed 100 tests.
  13034. 967.51 s [vector] scanl1': OK
  13035. 967.51 s [vector] +++ OK, passed 100 tests.
  13036. 967.51 s [vector] iscanl: OK
  13037. 967.51 s [vector] +++ OK, passed 100 tests.
  13038. 967.51 s [vector] iscanl': OK
  13039. 967.52 s [vector] +++ OK, passed 100 tests.
  13040. 967.52 s [vector] prescanr: OK
  13041. 967.52 s [vector] +++ OK, passed 100 tests.
  13042. 967.52 s [vector] prescanr': OK
  13043. 967.52 s [vector] +++ OK, passed 100 tests.
  13044. 967.52 s [vector] postscanr: OK
  13045. 967.52 s [vector] +++ OK, passed 100 tests.
  13046. 967.52 s [vector] postscanr': OK
  13047. 967.52 s [vector] +++ OK, passed 100 tests.
  13048. 967.52 s [vector] scanr: OK
  13049. 967.52 s [vector] +++ OK, passed 100 tests.
  13050. 967.52 s [vector] scanr': OK
  13051. 967.52 s [vector] +++ OK, passed 100 tests.
  13052. 967.53 s [vector] scanr1: OK
  13053. 967.53 s [vector] +++ OK, passed 100 tests.
  13054. 967.53 s [vector] scanr1': OK
  13055. 967.53 s [vector] +++ OK, passed 100 tests.
  13056. 967.53 s [vector] iscanr: OK
  13057. 967.53 s [vector] +++ OK, passed 100 tests.
  13058. 967.53 s [vector] iscanr': OK
  13059. 967.53 s [vector] +++ OK, passed 100 tests.
  13060. 967.53 s [vector] mut_read: OK
  13061. 967.53 s [vector] +++ OK, passed 100 tests; 12 discarded.
  13062. 967.53 s [vector] mut_write: OK
  13063. 967.53 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13064. 967.53 s [vector] mut_modify: OK
  13065. 967.53 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13066. 967.53 s [vector] mut_generate: OK
  13067. 967.53 s [vector] +++ OK, passed 100 tests.
  13068. 967.54 s [vector] mut_generateM: OK
  13069. 967.55 s [vector] +++ OK, passed 100 tests.
  13070. 967.55 s [vector] mut_mapM_: OK
  13071. 967.55 s [vector] +++ OK, passed 100 tests.
  13072. 967.57 s [vector] mut_imapM_: OK (0.01s)
  13073. 967.57 s [vector] +++ OK, passed 100 tests.
  13074. 967.57 s [vector] mut_forM_: OK
  13075. 967.57 s [vector] +++ OK, passed 100 tests.
  13076. 967.58 s [vector] mut_iforM_: OK
  13077. 967.58 s [vector] +++ OK, passed 100 tests.
  13078. 967.58 s [vector] mut_foldr: OK
  13079. 967.58 s [vector] +++ OK, passed 100 tests.
  13080. 967.58 s [vector] mut_foldr': OK
  13081. 967.58 s [vector] +++ OK, passed 100 tests.
  13082. 967.58 s [vector] mut_foldl: OK
  13083. 967.58 s [vector] +++ OK, passed 100 tests.
  13084. 967.58 s [vector] mut_foldl': OK
  13085. 967.58 s [vector] +++ OK, passed 100 tests.
  13086. 967.59 s [vector] mut_ifoldr: OK
  13087. 967.59 s [vector] +++ OK, passed 100 tests.
  13088. 967.59 s [vector] mut_ifoldr': OK
  13089. 967.59 s [vector] +++ OK, passed 100 tests.
  13090. 967.59 s [vector] mut_ifoldl: OK
  13091. 967.59 s [vector] +++ OK, passed 100 tests.
  13092. 967.59 s [vector] mut_ifoldl': OK
  13093. 967.59 s [vector] +++ OK, passed 100 tests.
  13094. 967.59 s [vector] mut_foldM: OK
  13095. 967.59 s [vector] +++ OK, passed 100 tests.
  13096. 967.59 s [vector] mut_foldM': OK
  13097. 967.59 s [vector] +++ OK, passed 100 tests.
  13098. 967.59 s [vector] mut_foldrM: OK
  13099. 967.59 s [vector] +++ OK, passed 100 tests.
  13100. 967.59 s [vector] mut_foldrM': OK
  13101. 967.60 s [vector] +++ OK, passed 100 tests.
  13102. 967.60 s [vector] mut_ifoldM: OK
  13103. 967.60 s [vector] +++ OK, passed 100 tests.
  13104. 967.60 s [vector] mut_ifoldM': OK
  13105. 967.60 s [vector] +++ OK, passed 100 tests.
  13106. 967.60 s [vector] mut_ifoldrM: OK
  13107. 967.60 s [vector] +++ OK, passed 100 tests.
  13108. 967.60 s [vector] mut_ifoldrM': OK
  13109. 967.60 s [vector] +++ OK, passed 100 tests.
  13110. 967.60 s [vector] compare: OK
  13111. 967.60 s [vector] +++ OK, passed 100 tests.
  13112. 967.60 s [vector] maximum: OK
  13113. 967.60 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13114. 967.60 s [vector] minimum: OK
  13115. 967.60 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13116. 967.61 s [vector] minIndex: OK
  13117. 967.61 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13118. 967.61 s [vector] maxIndex: OK
  13119. 967.61 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13120. 967.61 s [vector] maximumBy: OK
  13121. 967.61 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13122. 967.61 s [vector] minimumBy: OK
  13123. 967.61 s [vector] +++ OK, passed 100 tests; 12 discarded.
  13124. 967.61 s [vector] maximumOn: OK
  13125. 967.61 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13126. 967.61 s [vector] minimumOn: OK
  13127. 967.61 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13128. 967.61 s [vector] maxIndexBy: OK
  13129. 967.61 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13130. 967.61 s [vector] minIndexBy: OK
  13131. 967.61 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13132. 967.61 s [vector] ListFirstMaxIndexWins: OK
  13133. 967.61 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13134. 967.61 s [vector] FalseListFirstMaxIndexWins: OK
  13135. 967.61 s [vector] +++ OK, failed as expected. (after 1 test):
  13136. 967.61 s [vector] Exception:
  13137. 967.61 s [vector] Prelude.foldr1: empty list
  13138. 967.61 s [vector] CallStack (from HasCallStack):
  13139. 967.61 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  13140. 967.61 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  13141. 967.61 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  13142. 967.61 s [vector] []
  13143. 967.61 s [vector] zip: OK
  13144. 967.61 s [vector] +++ OK, passed 100 tests.
  13145. 967.61 s [vector] zip3: OK
  13146. 967.61 s [vector] +++ OK, passed 100 tests.
  13147. 967.61 s [vector] unzip: OK
  13148. 967.61 s [vector] +++ OK, passed 100 tests.
  13149. 967.61 s [vector] unzip3: OK
  13150. 967.61 s [vector] +++ OK, passed 100 tests.
  13151. 967.61 s [vector] indexed: OK
  13152. 967.61 s [vector] +++ OK, passed 100 tests.
  13153. 967.61 s [vector] update: OK
  13154. 967.62 s [vector] +++ OK, passed 100 tests.
  13155. 967.62 s [vector] concat: OK
  13156. 967.62 s [vector] +++ OK, passed 100 tests.
  13157. 967.62 s [vector] mempty: OK
  13158. 967.62 s [vector] +++ OK, passed 100 tests.
  13159. 967.63 s [vector] mappend: OK
  13160. 967.63 s [vector] +++ OK, passed 100 tests.
  13161. 967.63 s [vector] mconcat: OK
  13162. 967.63 s [vector] +++ OK, passed 100 tests.
  13163. 967.63 s [vector] fmap: OK
  13164. 967.63 s [vector] +++ OK, passed 100 tests.
  13165. 967.63 s [vector] return: OK
  13166. 967.63 s [vector] +++ OK, passed 100 tests.
  13167. 967.64 s [vector] bind: OK (0.01s)
  13168. 967.64 s [vector] +++ OK, passed 100 tests.
  13169. 967.64 s [vector] mzip: OK
  13170. 967.64 s [vector] +++ OK, passed 100 tests.
  13171. 967.64 s [vector] munzip: OK
  13172. 967.64 s [vector] +++ OK, passed 100 tests.
  13173. 967.65 s [vector] applicative_pure: OK
  13174. 967.65 s [vector] +++ OK, passed 100 tests.
  13175. 967.65 s [vector] applicative_appl: OK
  13176. 967.65 s [vector] +++ OK, passed 100 tests.
  13177. 967.65 s [vector] alternative_empty: OK
  13178. 967.65 s [vector] +++ OK, passed 100 tests.
  13179. 967.65 s [vector] alternative_or: OK
  13180. 967.65 s [vector] +++ OK, passed 100 tests.
  13181. 967.67 s [vector] sequence: OK (0.02s)
  13182. 967.67 s [vector] +++ OK, passed 100 tests.
  13183. 967.68 s [vector] sequence_: OK
  13184. 967.68 s [vector] +++ OK, passed 100 tests.
  13185. 967.68 s [vector] glength: OK
  13186. 967.68 s [vector] +++ OK, passed 100 tests.
  13187. 967.68 s [vector] and: OK
  13188. 967.68 s [vector] +++ OK, passed 100 tests.
  13189. 967.68 s [vector] or: OK
  13190. 967.68 s [vector] +++ OK, passed 100 tests.
  13191. 967.68 s [vector] Int
  13192. 967.68 s [vector] fromList.toList == id: OK
  13193. 967.68 s [vector] +++ OK, passed 100 tests.
  13194. 967.68 s [vector] toList.fromList == id: OK
  13195. 967.68 s [vector] +++ OK, passed 100 tests.
  13196. 967.68 s [vector] unstream.stream == id: OK
  13197. 967.68 s [vector] +++ OK, passed 100 tests.
  13198. 967.68 s [vector] stream.unstream == id: OK
  13199. 967.68 s [vector] +++ OK, passed 100 tests.
  13200. 967.68 s [vector] eq: OK
  13201. 967.69 s [vector] +++ OK, passed 100 tests.
  13202. 967.69 s [vector] length: OK
  13203. 967.69 s [vector] +++ OK, passed 100 tests.
  13204. 967.69 s [vector] null: OK
  13205. 967.69 s [vector] +++ OK, passed 100 tests.
  13206. 967.69 s [vector] index: OK
  13207. 967.69 s [vector] +++ OK, passed 100 tests; 19 discarded.
  13208. 967.69 s [vector] safeIndex: OK
  13209. 967.69 s [vector] +++ OK, passed 100 tests.
  13210. 967.69 s [vector] head: OK
  13211. 967.69 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13212. 967.69 s [vector] last: OK
  13213. 967.69 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13214. 967.69 s [vector] unsafeIndex: OK
  13215. 967.69 s [vector] +++ OK, passed 100 tests; 19 discarded.
  13216. 967.69 s [vector] unsafeHead: OK
  13217. 967.69 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13218. 967.69 s [vector] unsafeLast: OK
  13219. 967.69 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13220. 967.69 s [vector] slice: OK
  13221. 967.69 s [vector] +++ OK, passed 100 tests.
  13222. 967.69 s [vector] init: OK
  13223. 967.69 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13224. 967.69 s [vector] tail: OK
  13225. 967.69 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13226. 967.69 s [vector] take: OK
  13227. 967.69 s [vector] +++ OK, passed 100 tests.
  13228. 967.69 s [vector] drop: OK
  13229. 967.69 s [vector] +++ OK, passed 100 tests.
  13230. 967.69 s [vector] splitAt: OK
  13231. 967.69 s [vector] +++ OK, passed 100 tests.
  13232. 967.69 s [vector] empty: OK
  13233. 967.69 s [vector] +++ OK, passed 100 tests.
  13234. 967.69 s [vector] singleton: OK
  13235. 967.69 s [vector] +++ OK, passed 100 tests.
  13236. 967.69 s [vector] replicate: OK
  13237. 967.69 s [vector] +++ OK, passed 100 tests.
  13238. 967.69 s [vector] generate: OK
  13239. 967.69 s [vector] +++ OK, passed 100 tests.
  13240. 967.69 s [vector] iterateN: OK
  13241. 967.71 s [vector] +++ OK, passed 100 tests.
  13242. 967.71 s [vector] iterateNM: OK (0.01s)
  13243. 967.71 s [vector] +++ OK, passed 100 tests.
  13244. 967.73 s [vector] generateM: OK (0.03s)
  13245. 967.73 s [vector] +++ OK, passed 100 tests.
  13246. 967.75 s [vector] replicateM: OK (0.01s)
  13247. 967.75 s [vector] +++ OK, passed 100 tests.
  13248. 967.75 s [vector] create: OK
  13249. 967.75 s [vector] +++ OK, passed 100 tests.
  13250. 967.75 s [vector] createT: OK
  13251. 967.75 s [vector] +++ OK, passed 100 tests.
  13252. 967.75 s [vector] unfoldr: OK
  13253. 967.75 s [vector] +++ OK, passed 100 tests.
  13254. 967.75 s [vector] unfoldrN: OK
  13255. 967.75 s [vector] +++ OK, passed 100 tests.
  13256. 967.75 s [vector] unfoldrExactN: OK
  13257. 967.75 s [vector] +++ OK, passed 100 tests.
  13258. 967.75 s [vector] unfoldrM: OK
  13259. 967.75 s [vector] +++ OK, passed 100 tests.
  13260. 967.75 s [vector] unfoldrNM: OK
  13261. 967.75 s [vector] +++ OK, passed 100 tests.
  13262. 967.77 s [vector] unfoldrExactNM: OK
  13263. 967.77 s [vector] +++ OK, passed 100 tests.
  13264. 967.77 s [vector] constructN: OK
  13265. 967.77 s [vector] +++ OK, passed 100 tests.
  13266. 967.77 s [vector] constructrN: OK
  13267. 967.77 s [vector] +++ OK, passed 100 tests.
  13268. 967.77 s [vector] cons: OK
  13269. 967.77 s [vector] +++ OK, passed 100 tests.
  13270. 967.77 s [vector] snoc: OK
  13271. 967.77 s [vector] +++ OK, passed 100 tests.
  13272. 967.77 s [vector] append: OK
  13273. 967.77 s [vector] +++ OK, passed 100 tests.
  13274. 967.78 s [vector] concat: OK (0.01s)
  13275. 967.78 s [vector] +++ OK, passed 100 tests.
  13276. 967.78 s [vector] force: OK
  13277. 967.78 s [vector] +++ OK, passed 100 tests.
  13278. 967.79 s [vector] upd: OK
  13279. 967.79 s [vector] +++ OK, passed 100 tests.
  13280. 967.79 s [vector] accum: OK
  13281. 967.79 s [vector] +++ OK, passed 100 tests.
  13282. 967.79 s [vector] reverse: OK
  13283. 967.79 s [vector] +++ OK, passed 100 tests.
  13284. 967.79 s [vector] backpermute: OK
  13285. 967.79 s [vector] +++ OK, passed 100 tests.
  13286. 967.79 s [vector] map: OK
  13287. 967.79 s [vector] +++ OK, passed 100 tests.
  13288. 967.80 s [vector] imap: OK
  13289. 967.80 s [vector] +++ OK, passed 100 tests.
  13290. 967.80 s [vector] concatMap: OK
  13291. 967.80 s [vector] +++ OK, passed 100 tests.
  13292. 967.81 s [vector] mapM: OK
  13293. 967.81 s [vector] +++ OK, passed 100 tests.
  13294. 967.83 s [vector] mapM_: OK (0.02s)
  13295. 967.83 s [vector] +++ OK, passed 100 tests.
  13296. 967.83 s [vector] forM: OK
  13297. 967.83 s [vector] +++ OK, passed 100 tests.
  13298. 967.85 s [vector] forM_: OK (0.02s)
  13299. 967.85 s [vector] +++ OK, passed 100 tests.
  13300. 967.86 s [vector] imapM: OK
  13301. 967.86 s [vector] +++ OK, passed 100 tests.
  13302. 967.88 s [vector] imapM_: OK (0.03s)
  13303. 967.88 s [vector] +++ OK, passed 100 tests.
  13304. 967.89 s [vector] zipWith: OK
  13305. 967.89 s [vector] +++ OK, passed 100 tests.
  13306. 967.90 s [vector] zipWith3: OK
  13307. 967.90 s [vector] +++ OK, passed 100 tests.
  13308. 967.91 s [vector] izipWith: OK
  13309. 967.91 s [vector] +++ OK, passed 100 tests.
  13310. 967.92 s [vector] izipWith3: OK
  13311. 967.92 s [vector] +++ OK, passed 100 tests.
  13312. 967.93 s [vector] izipWithM: OK
  13313. 967.93 s [vector] +++ OK, passed 100 tests.
  13314. 967.95 s [vector] izipWithM_: OK (0.02s)
  13315. 967.95 s [vector] +++ OK, passed 100 tests.
  13316. 967.95 s [vector] zipWithM: OK
  13317. 967.95 s [vector] +++ OK, passed 100 tests.
  13318. 967.97 s [vector] zipWithM_: OK (0.02s)
  13319. 967.97 s [vector] +++ OK, passed 100 tests.
  13320. 967.97 s [vector] filter: OK
  13321. 967.97 s [vector] +++ OK, passed 100 tests.
  13322. 967.98 s [vector] ifilter: OK
  13323. 967.98 s [vector] +++ OK, passed 100 tests.
  13324. 968.01 s [vector] filterM: OK (0.04s)
  13325. 968.01 s [vector] +++ OK, passed 100 tests.
  13326. 968.01 s [vector] uniq: OK
  13327. 968.01 s [vector] +++ OK, passed 100 tests.
  13328. 968.01 s [vector] mapMaybe: OK
  13329. 968.01 s [vector] +++ OK, passed 100 tests.
  13330. 968.01 s [vector] imapMaybe: OK
  13331. 968.01 s [vector] +++ OK, passed 100 tests.
  13332. 968.02 s [vector] takeWhile: OK
  13333. 968.02 s [vector] +++ OK, passed 100 tests.
  13334. 968.02 s [vector] dropWhile: OK
  13335. 968.02 s [vector] +++ OK, passed 100 tests.
  13336. 968.02 s [vector] partition: OK
  13337. 968.02 s [vector] +++ OK, passed 100 tests.
  13338. 968.02 s [vector] partitionWith: OK
  13339. 968.02 s [vector] +++ OK, passed 100 tests.
  13340. 968.02 s [vector] span: OK
  13341. 968.02 s [vector] +++ OK, passed 100 tests.
  13342. 968.02 s [vector] break: OK
  13343. 968.02 s [vector] +++ OK, passed 100 tests.
  13344. 968.02 s [vector] spanR: OK
  13345. 968.02 s [vector] +++ OK, passed 100 tests.
  13346. 968.02 s [vector] breakR: OK
  13347. 968.02 s [vector] +++ OK, passed 100 tests.
  13348. 968.02 s [vector] groupBy: OK
  13349. 968.02 s [vector] +++ OK, passed 100 tests.
  13350. 968.02 s [vector] elem: OK
  13351. 968.02 s [vector] +++ OK, passed 100 tests.
  13352. 968.03 s [vector] notElem: OK
  13353. 968.03 s [vector] +++ OK, passed 100 tests.
  13354. 968.03 s [vector] find: OK
  13355. 968.03 s [vector] +++ OK, passed 100 tests.
  13356. 968.03 s [vector] findIndex: OK
  13357. 968.03 s [vector] +++ OK, passed 100 tests.
  13358. 968.03 s [vector] findIndexR: OK
  13359. 968.03 s [vector] +++ OK, passed 100 tests.
  13360. 968.03 s [vector] findIndices: OK
  13361. 968.03 s [vector] +++ OK, passed 100 tests.
  13362. 968.03 s [vector] elemIndex: OK
  13363. 968.03 s [vector] +++ OK, passed 100 tests.
  13364. 968.03 s [vector] elemIndices: OK
  13365. 968.03 s [vector] +++ OK, passed 100 tests.
  13366. 968.03 s [vector] foldl: OK
  13367. 968.03 s [vector] +++ OK, passed 100 tests.
  13368. 968.03 s [vector] foldl1: OK
  13369. 968.03 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13370. 968.03 s [vector] foldl': OK
  13371. 968.03 s [vector] +++ OK, passed 100 tests.
  13372. 968.04 s [vector] foldl1': OK
  13373. 968.04 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13374. 968.04 s [vector] foldr: OK
  13375. 968.04 s [vector] +++ OK, passed 100 tests.
  13376. 968.05 s [vector] foldr1: OK
  13377. 968.05 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13378. 968.05 s [vector] foldr': OK
  13379. 968.05 s [vector] +++ OK, passed 100 tests.
  13380. 968.05 s [vector] foldr1': OK
  13381. 968.05 s [vector] +++ OK, passed 100 tests; 11 discarded.
  13382. 968.05 s [vector] ifoldl: OK
  13383. 968.05 s [vector] +++ OK, passed 100 tests.
  13384. 968.05 s [vector] ifoldl': OK
  13385. 968.07 s [vector] +++ OK, passed 100 tests.
  13386. 968.07 s [vector] ifoldr: OK (0.01s)
  13387. 968.07 s [vector] +++ OK, passed 100 tests.
  13388. 968.08 s [vector] ifoldr': OK
  13389. 968.08 s [vector] +++ OK, passed 100 tests.
  13390. 968.08 s [vector] ifoldM: OK
  13391. 968.08 s [vector] +++ OK, passed 100 tests.
  13392. 968.09 s [vector] ifoldM': OK
  13393. 968.09 s [vector] +++ OK, passed 100 tests.
  13394. 968.11 s [vector] ifoldM_: OK (0.02s)
  13395. 968.11 s [vector] +++ OK, passed 100 tests.
  13396. 968.12 s [vector] ifoldM'_: OK (0.02s)
  13397. 968.12 s [vector] +++ OK, passed 100 tests.
  13398. 968.13 s [vector] all: OK
  13399. 968.13 s [vector] +++ OK, passed 100 tests.
  13400. 968.13 s [vector] any: OK
  13401. 968.13 s [vector] +++ OK, passed 100 tests.
  13402. 968.13 s [vector] prescanl: OK
  13403. 968.13 s [vector] +++ OK, passed 100 tests.
  13404. 968.13 s [vector] prescanl': OK
  13405. 968.13 s [vector] +++ OK, passed 100 tests.
  13406. 968.14 s [vector] postscanl: OK
  13407. 968.14 s [vector] +++ OK, passed 100 tests.
  13408. 968.14 s [vector] postscanl': OK
  13409. 968.14 s [vector] +++ OK, passed 100 tests.
  13410. 968.14 s [vector] scanl: OK
  13411. 968.14 s [vector] +++ OK, passed 100 tests.
  13412. 968.14 s [vector] scanl': OK
  13413. 968.14 s [vector] +++ OK, passed 100 tests.
  13414. 968.15 s [vector] scanl1: OK
  13415. 968.15 s [vector] +++ OK, passed 100 tests.
  13416. 968.15 s [vector] scanl1': OK
  13417. 968.15 s [vector] +++ OK, passed 100 tests.
  13418. 968.15 s [vector] iscanl: OK
  13419. 968.15 s [vector] +++ OK, passed 100 tests.
  13420. 968.16 s [vector] iscanl': OK
  13421. 968.16 s [vector] +++ OK, passed 100 tests.
  13422. 968.16 s [vector] prescanr: OK
  13423. 968.16 s [vector] +++ OK, passed 100 tests.
  13424. 968.16 s [vector] prescanr': OK
  13425. 968.16 s [vector] +++ OK, passed 100 tests.
  13426. 968.17 s [vector] postscanr: OK
  13427. 968.17 s [vector] +++ OK, passed 100 tests.
  13428. 968.17 s [vector] postscanr': OK
  13429. 968.17 s [vector] +++ OK, passed 100 tests.
  13430. 968.17 s [vector] scanr: OK
  13431. 968.17 s [vector] +++ OK, passed 100 tests.
  13432. 968.17 s [vector] scanr': OK
  13433. 968.17 s [vector] +++ OK, passed 100 tests.
  13434. 968.17 s [vector] scanr1: OK
  13435. 968.17 s [vector] +++ OK, passed 100 tests.
  13436. 968.17 s [vector] scanr1': OK
  13437. 968.17 s [vector] +++ OK, passed 100 tests.
  13438. 968.18 s [vector] iscanr: OK
  13439. 968.18 s [vector] +++ OK, passed 100 tests.
  13440. 968.18 s [vector] iscanr': OK
  13441. 968.18 s [vector] +++ OK, passed 100 tests.
  13442. 968.19 s [vector] mut_read: OK
  13443. 968.19 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13444. 968.19 s [vector] mut_write: OK
  13445. 968.19 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13446. 968.19 s [vector] mut_modify: OK
  13447. 968.19 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13448. 968.19 s [vector] mut_generate: OK
  13449. 968.19 s [vector] +++ OK, passed 100 tests.
  13450. 968.19 s [vector] mut_generateM: OK
  13451. 968.19 s [vector] +++ OK, passed 100 tests.
  13452. 968.21 s [vector] mut_mapM_: OK (0.01s)
  13453. 968.21 s [vector] +++ OK, passed 100 tests.
  13454. 968.23 s [vector] mut_imapM_: OK (0.02s)
  13455. 968.23 s [vector] +++ OK, passed 100 tests.
  13456. 968.25 s [vector] mut_forM_: OK (0.02s)
  13457. 968.25 s [vector] +++ OK, passed 100 tests.
  13458. 968.26 s [vector] mut_iforM_: OK (0.03s)
  13459. 968.26 s [vector] +++ OK, passed 100 tests.
  13460. 968.26 s [vector] mut_foldr: OK
  13461. 968.27 s [vector] +++ OK, passed 100 tests.
  13462. 968.27 s [vector] mut_foldr': OK
  13463. 968.27 s [vector] +++ OK, passed 100 tests.
  13464. 968.27 s [vector] mut_foldl: OK
  13465. 968.28 s [vector] +++ OK, passed 100 tests.
  13466. 968.28 s [vector] mut_foldl': OK
  13467. 968.28 s [vector] +++ OK, passed 100 tests.
  13468. 968.29 s [vector] mut_ifoldr: OK
  13469. 968.29 s [vector] +++ OK, passed 100 tests.
  13470. 968.29 s [vector] mut_ifoldr': OK
  13471. 968.29 s [vector] +++ OK, passed 100 tests.
  13472. 968.29 s [vector] mut_ifoldl: OK
  13473. 968.29 s [vector] +++ OK, passed 100 tests.
  13474. 968.30 s [vector] mut_ifoldl': OK
  13475. 968.30 s [vector] +++ OK, passed 100 tests.
  13476. 968.30 s [vector] mut_foldM: OK
  13477. 968.30 s [vector] +++ OK, passed 100 tests.
  13478. 968.30 s [vector] mut_foldM': OK
  13479. 968.30 s [vector] +++ OK, passed 100 tests.
  13480. 968.30 s [vector] mut_foldrM: OK
  13481. 968.31 s [vector] +++ OK, passed 100 tests.
  13482. 968.31 s [vector] mut_foldrM': OK
  13483. 968.31 s [vector] +++ OK, passed 100 tests.
  13484. 968.31 s [vector] mut_ifoldM: OK
  13485. 968.31 s [vector] +++ OK, passed 100 tests.
  13486. 968.31 s [vector] mut_ifoldM': OK
  13487. 968.32 s [vector] +++ OK, passed 100 tests.
  13488. 968.32 s [vector] mut_ifoldrM: OK
  13489. 968.32 s [vector] +++ OK, passed 100 tests.
  13490. 968.32 s [vector] mut_ifoldrM': OK
  13491. 968.32 s [vector] +++ OK, passed 100 tests.
  13492. 968.32 s [vector] compare: OK
  13493. 968.32 s [vector] +++ OK, passed 100 tests.
  13494. 968.32 s [vector] maximum: OK
  13495. 968.32 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13496. 968.32 s [vector] minimum: OK
  13497. 968.32 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13498. 968.32 s [vector] minIndex: OK
  13499. 968.32 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13500. 968.32 s [vector] maxIndex: OK
  13501. 968.32 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13502. 968.32 s [vector] maximumBy: OK
  13503. 968.32 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13504. 968.32 s [vector] minimumBy: OK
  13505. 968.32 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13506. 968.32 s [vector] maximumOn: OK
  13507. 968.32 s [vector] +++ OK, passed 100 tests; 21 discarded.
  13508. 968.32 s [vector] minimumOn: OK
  13509. 968.32 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13510. 968.32 s [vector] maxIndexBy: OK
  13511. 968.32 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13512. 968.32 s [vector] minIndexBy: OK
  13513. 968.32 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13514. 968.32 s [vector] ListFirstMaxIndexWins: OK
  13515. 968.32 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13516. 968.32 s [vector] FalseListFirstMaxIndexWins: OK
  13517. 968.32 s [vector] +++ OK, failed as expected. (after 1 test):
  13518. 968.33 s [vector] Exception:
  13519. 968.33 s [vector] Prelude.foldr1: empty list
  13520. 968.33 s [vector] CallStack (from HasCallStack):
  13521. 968.33 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  13522. 968.33 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  13523. 968.33 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  13524. 968.33 s [vector] []
  13525. 968.33 s [vector] zip: OK
  13526. 968.33 s [vector] +++ OK, passed 100 tests.
  13527. 968.33 s [vector] zip3: OK
  13528. 968.33 s [vector] +++ OK, passed 100 tests.
  13529. 968.33 s [vector] unzip: OK
  13530. 968.33 s [vector] +++ OK, passed 100 tests.
  13531. 968.33 s [vector] unzip3: OK
  13532. 968.33 s [vector] +++ OK, passed 100 tests.
  13533. 968.33 s [vector] indexed: OK
  13534. 968.33 s [vector] +++ OK, passed 100 tests.
  13535. 968.33 s [vector] update: OK
  13536. 968.33 s [vector] +++ OK, passed 100 tests.
  13537. 968.34 s [vector] concat: OK
  13538. 968.34 s [vector] +++ OK, passed 100 tests.
  13539. 968.34 s [vector] mempty: OK
  13540. 968.34 s [vector] +++ OK, passed 100 tests.
  13541. 968.34 s [vector] mappend: OK
  13542. 968.35 s [vector] +++ OK, passed 100 tests.
  13543. 968.35 s [vector] mconcat: OK
  13544. 968.35 s [vector] +++ OK, passed 100 tests.
  13545. 968.35 s [vector] fmap: OK
  13546. 968.35 s [vector] +++ OK, passed 100 tests.
  13547. 968.35 s [vector] return: OK
  13548. 968.37 s [vector] +++ OK, passed 100 tests.
  13549. 968.37 s [vector] bind: OK (0.02s)
  13550. 968.37 s [vector] +++ OK, passed 100 tests.
  13551. 968.37 s [vector] mzip: OK
  13552. 968.37 s [vector] +++ OK, passed 100 tests.
  13553. 968.37 s [vector] munzip: OK
  13554. 968.37 s [vector] +++ OK, passed 100 tests.
  13555. 968.37 s [vector] applicative_pure: OK
  13556. 968.37 s [vector] +++ OK, passed 100 tests.
  13557. 968.42 s [vector] applicative_appl: OK (0.05s)
  13558. 968.42 s [vector] +++ OK, passed 100 tests.
  13559. 968.42 s [vector] alternative_empty: OK
  13560. 968.42 s [vector] +++ OK, passed 100 tests.
  13561. 968.42 s [vector] alternative_or: OK
  13562. 968.43 s [vector] +++ OK, passed 100 tests.
  13563. 968.47 s [vector] sequence: OK (0.04s)
  13564. 968.47 s [vector] +++ OK, passed 100 tests.
  13565. 968.47 s [vector] sequence_: OK (0.01s)
  13566. 968.47 s [vector] +++ OK, passed 100 tests.
  13567. 968.47 s [vector] glength: OK
  13568. 968.47 s [vector] +++ OK, passed 100 tests.
  13569. 968.47 s [vector] sum: OK
  13570. 968.47 s [vector] +++ OK, passed 100 tests.
  13571. 968.47 s [vector] product: OK
  13572. 968.47 s [vector] +++ OK, passed 100 tests.
  13573. 968.47 s [vector] enumFromN: OK
  13574. 968.47 s [vector] +++ OK, passed 100 tests.
  13575. 968.47 s [vector] enumFromThenN: OK
  13576. 968.47 s [vector] +++ OK, passed 100 tests.
  13577. 968.47 s [vector] enumFromTo: OK
  13578. 968.48 s [vector] +++ OK, passed 100 tests.
  13579. 968.48 s [vector] enumFromThenTo: OK
  13580. 968.48 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13581. 968.48 s [vector] unstream
  13582. 968.48 s [vector] unstream == vunstream (exact): OK
  13583. 968.48 s [vector] +++ OK, passed 100 tests.
  13584. 968.48 s [vector] unstream == vunstream (unknown): OK
  13585. 968.48 s [vector] +++ OK, passed 100 tests.
  13586. 968.48 s [vector] unstreamR ~= vunstream (exact): OK
  13587. 968.48 s [vector] +++ OK, passed 100 tests.
  13588. 968.48 s [vector] unstreamR ~= vunstream (unknown): OK
  13589. 968.48 s [vector] +++ OK, passed 100 tests.
  13590. 968.48 s [vector] Tests.Vector.Unboxed
  13591. 968.48 s [vector] ()
  13592. 968.48 s [vector] fromList.toList == id: OK
  13593. 968.48 s [vector] +++ OK, passed 100 tests.
  13594. 968.48 s [vector] toList.fromList == id: OK
  13595. 968.48 s [vector] +++ OK, passed 100 tests.
  13596. 968.48 s [vector] unstream.stream == id: OK
  13597. 968.48 s [vector] +++ OK, passed 100 tests.
  13598. 968.48 s [vector] stream.unstream == id: OK
  13599. 968.48 s [vector] +++ OK, passed 100 tests.
  13600. 968.48 s [vector] eq: OK
  13601. 968.48 s [vector] +++ OK, passed 100 tests.
  13602. 968.48 s [vector] length: OK
  13603. 968.48 s [vector] +++ OK, passed 100 tests.
  13604. 968.48 s [vector] null: OK
  13605. 968.48 s [vector] +++ OK, passed 100 tests.
  13606. 968.48 s [vector] index: OK
  13607. 968.48 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13608. 968.48 s [vector] safeIndex: OK
  13609. 968.48 s [vector] +++ OK, passed 100 tests.
  13610. 968.48 s [vector] head: OK
  13611. 968.48 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13612. 968.48 s [vector] last: OK
  13613. 968.48 s [vector] +++ OK, passed 100 tests; 12 discarded.
  13614. 968.48 s [vector] unsafeIndex: OK
  13615. 968.48 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13616. 968.48 s [vector] unsafeHead: OK
  13617. 968.48 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13618. 968.48 s [vector] unsafeLast: OK
  13619. 968.48 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13620. 968.48 s [vector] slice: OK
  13621. 968.48 s [vector] +++ OK, passed 100 tests.
  13622. 968.48 s [vector] init: OK
  13623. 968.48 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13624. 968.48 s [vector] tail: OK
  13625. 968.49 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13626. 968.49 s [vector] take: OK
  13627. 968.49 s [vector] +++ OK, passed 100 tests.
  13628. 968.49 s [vector] drop: OK
  13629. 968.49 s [vector] +++ OK, passed 100 tests.
  13630. 968.49 s [vector] splitAt: OK
  13631. 968.49 s [vector] +++ OK, passed 100 tests.
  13632. 968.49 s [vector] empty: OK
  13633. 968.49 s [vector] +++ OK, passed 100 tests.
  13634. 968.49 s [vector] singleton: OK
  13635. 968.49 s [vector] +++ OK, passed 100 tests.
  13636. 968.49 s [vector] replicate: OK
  13637. 968.49 s [vector] +++ OK, passed 100 tests.
  13638. 968.49 s [vector] generate: OK
  13639. 968.49 s [vector] +++ OK, passed 100 tests.
  13640. 968.49 s [vector] iterateN: OK
  13641. 968.49 s [vector] +++ OK, passed 100 tests.
  13642. 968.51 s [vector] iterateNM: OK (0.02s)
  13643. 968.51 s [vector] +++ OK, passed 100 tests.
  13644. 968.53 s [vector] generateM: OK (0.02s)
  13645. 968.53 s [vector] +++ OK, passed 100 tests.
  13646. 968.54 s [vector] replicateM: OK (0.01s)
  13647. 968.54 s [vector] +++ OK, passed 100 tests.
  13648. 968.54 s [vector] create: OK
  13649. 968.54 s [vector] +++ OK, passed 100 tests.
  13650. 968.54 s [vector] createT: OK
  13651. 968.54 s [vector] +++ OK, passed 100 tests.
  13652. 968.54 s [vector] unfoldr: OK
  13653. 968.54 s [vector] +++ OK, passed 100 tests.
  13654. 968.54 s [vector] unfoldrN: OK
  13655. 968.54 s [vector] +++ OK, passed 100 tests.
  13656. 968.54 s [vector] unfoldrExactN: OK
  13657. 968.55 s [vector] +++ OK, passed 100 tests.
  13658. 968.55 s [vector] unfoldrM: OK
  13659. 968.55 s [vector] +++ OK, passed 100 tests.
  13660. 968.55 s [vector] unfoldrNM: OK
  13661. 968.55 s [vector] +++ OK, passed 100 tests.
  13662. 968.57 s [vector] unfoldrExactNM: OK (0.01s)
  13663. 968.57 s [vector] +++ OK, passed 100 tests.
  13664. 968.57 s [vector] constructN: OK
  13665. 968.57 s [vector] +++ OK, passed 100 tests.
  13666. 968.57 s [vector] constructrN: OK
  13667. 968.57 s [vector] +++ OK, passed 100 tests.
  13668. 968.58 s [vector] cons: OK
  13669. 968.58 s [vector] +++ OK, passed 100 tests.
  13670. 968.58 s [vector] snoc: OK
  13671. 968.58 s [vector] +++ OK, passed 100 tests.
  13672. 968.58 s [vector] append: OK
  13673. 968.58 s [vector] +++ OK, passed 100 tests.
  13674. 968.59 s [vector] concat: OK
  13675. 968.59 s [vector] +++ OK, passed 100 tests.
  13676. 968.59 s [vector] force: OK
  13677. 968.59 s [vector] +++ OK, passed 100 tests.
  13678. 968.59 s [vector] upd: OK
  13679. 968.59 s [vector] +++ OK, passed 100 tests.
  13680. 968.59 s [vector] accum: OK
  13681. 968.59 s [vector] +++ OK, passed 100 tests.
  13682. 968.60 s [vector] reverse: OK
  13683. 968.60 s [vector] +++ OK, passed 100 tests.
  13684. 968.60 s [vector] backpermute: OK
  13685. 968.60 s [vector] +++ OK, passed 100 tests.
  13686. 968.60 s [vector] map: OK
  13687. 968.61 s [vector] +++ OK, passed 100 tests.
  13688. 968.61 s [vector] imap: OK
  13689. 968.61 s [vector] +++ OK, passed 100 tests.
  13690. 968.61 s [vector] concatMap: OK
  13691. 968.61 s [vector] +++ OK, passed 100 tests.
  13692. 968.61 s [vector] mapM: OK
  13693. 968.61 s [vector] +++ OK, passed 100 tests.
  13694. 968.61 s [vector] mapM_: OK
  13695. 968.61 s [vector] +++ OK, passed 100 tests.
  13696. 968.61 s [vector] forM: OK
  13697. 968.61 s [vector] +++ OK, passed 100 tests.
  13698. 968.62 s [vector] forM_: OK
  13699. 968.62 s [vector] +++ OK, passed 100 tests.
  13700. 968.62 s [vector] imapM: OK
  13701. 968.62 s [vector] +++ OK, passed 100 tests.
  13702. 968.63 s [vector] imapM_: OK
  13703. 968.63 s [vector] +++ OK, passed 100 tests.
  13704. 968.63 s [vector] zipWith: OK
  13705. 968.63 s [vector] +++ OK, passed 100 tests.
  13706. 968.63 s [vector] zipWith3: OK
  13707. 968.63 s [vector] +++ OK, passed 100 tests.
  13708. 968.63 s [vector] izipWith: OK
  13709. 968.63 s [vector] +++ OK, passed 100 tests.
  13710. 968.64 s [vector] izipWith3: OK
  13711. 968.64 s [vector] +++ OK, passed 100 tests.
  13712. 968.64 s [vector] izipWithM: OK
  13713. 968.64 s [vector] +++ OK, passed 100 tests.
  13714. 968.64 s [vector] izipWithM_: OK
  13715. 968.64 s [vector] +++ OK, passed 100 tests.
  13716. 968.65 s [vector] zipWithM: OK
  13717. 968.65 s [vector] +++ OK, passed 100 tests.
  13718. 968.65 s [vector] zipWithM_: OK
  13719. 968.65 s [vector] +++ OK, passed 100 tests.
  13720. 968.65 s [vector] filter: OK
  13721. 968.65 s [vector] +++ OK, passed 100 tests.
  13722. 968.65 s [vector] ifilter: OK
  13723. 968.65 s [vector] +++ OK, passed 100 tests.
  13724. 968.67 s [vector] filterM: OK (0.02s)
  13725. 968.67 s [vector] +++ OK, passed 100 tests.
  13726. 968.67 s [vector] uniq: OK
  13727. 968.67 s [vector] +++ OK, passed 100 tests.
  13728. 968.67 s [vector] mapMaybe: OK
  13729. 968.67 s [vector] +++ OK, passed 100 tests.
  13730. 968.67 s [vector] imapMaybe: OK
  13731. 968.67 s [vector] +++ OK, passed 100 tests.
  13732. 968.67 s [vector] takeWhile: OK
  13733. 968.67 s [vector] +++ OK, passed 100 tests.
  13734. 968.67 s [vector] dropWhile: OK
  13735. 968.67 s [vector] +++ OK, passed 100 tests.
  13736. 968.67 s [vector] partition: OK
  13737. 968.67 s [vector] +++ OK, passed 100 tests.
  13738. 968.67 s [vector] partitionWith: OK
  13739. 968.67 s [vector] +++ OK, passed 100 tests.
  13740. 968.67 s [vector] span: OK
  13741. 968.67 s [vector] +++ OK, passed 100 tests.
  13742. 968.68 s [vector] break: OK
  13743. 968.68 s [vector] +++ OK, passed 100 tests.
  13744. 968.68 s [vector] spanR: OK
  13745. 968.68 s [vector] +++ OK, passed 100 tests.
  13746. 968.68 s [vector] breakR: OK
  13747. 968.68 s [vector] +++ OK, passed 100 tests.
  13748. 968.68 s [vector] groupBy: OK
  13749. 968.68 s [vector] +++ OK, passed 100 tests.
  13750. 968.68 s [vector] elem: OK
  13751. 968.68 s [vector] +++ OK, passed 100 tests.
  13752. 968.68 s [vector] notElem: OK
  13753. 968.68 s [vector] +++ OK, passed 100 tests.
  13754. 968.68 s [vector] find: OK
  13755. 968.68 s [vector] +++ OK, passed 100 tests.
  13756. 968.68 s [vector] findIndex: OK
  13757. 968.68 s [vector] +++ OK, passed 100 tests.
  13758. 968.68 s [vector] findIndexR: OK
  13759. 968.68 s [vector] +++ OK, passed 100 tests.
  13760. 968.68 s [vector] findIndices: OK
  13761. 968.68 s [vector] +++ OK, passed 100 tests.
  13762. 968.68 s [vector] elemIndex: OK
  13763. 968.68 s [vector] +++ OK, passed 100 tests.
  13764. 968.68 s [vector] elemIndices: OK
  13765. 968.68 s [vector] +++ OK, passed 100 tests.
  13766. 968.68 s [vector] foldl: OK
  13767. 968.68 s [vector] +++ OK, passed 100 tests.
  13768. 968.68 s [vector] foldl1: OK
  13769. 968.68 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13770. 968.68 s [vector] foldl': OK
  13771. 968.68 s [vector] +++ OK, passed 100 tests.
  13772. 968.68 s [vector] foldl1': OK
  13773. 968.68 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13774. 968.68 s [vector] foldr: OK
  13775. 968.68 s [vector] +++ OK, passed 100 tests.
  13776. 968.68 s [vector] foldr1: OK
  13777. 968.68 s [vector] +++ OK, passed 100 tests; 12 discarded.
  13778. 968.68 s [vector] foldr': OK
  13779. 968.68 s [vector] +++ OK, passed 100 tests.
  13780. 968.68 s [vector] foldr1': OK
  13781. 968.69 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13782. 968.69 s [vector] ifoldl: OK
  13783. 968.69 s [vector] +++ OK, passed 100 tests.
  13784. 968.69 s [vector] ifoldl': OK
  13785. 968.69 s [vector] +++ OK, passed 100 tests.
  13786. 968.69 s [vector] ifoldr: OK
  13787. 968.69 s [vector] +++ OK, passed 100 tests.
  13788. 968.69 s [vector] ifoldr': OK
  13789. 968.69 s [vector] +++ OK, passed 100 tests.
  13790. 968.69 s [vector] ifoldM: OK
  13791. 968.69 s [vector] +++ OK, passed 100 tests.
  13792. 968.69 s [vector] ifoldM': OK
  13793. 968.69 s [vector] +++ OK, passed 100 tests.
  13794. 968.70 s [vector] ifoldM_: OK
  13795. 968.70 s [vector] +++ OK, passed 100 tests.
  13796. 968.71 s [vector] ifoldM'_: OK
  13797. 968.71 s [vector] +++ OK, passed 100 tests.
  13798. 968.71 s [vector] all: OK
  13799. 968.71 s [vector] +++ OK, passed 100 tests.
  13800. 968.71 s [vector] any: OK
  13801. 968.71 s [vector] +++ OK, passed 100 tests.
  13802. 968.71 s [vector] prescanl: OK
  13803. 968.71 s [vector] +++ OK, passed 100 tests.
  13804. 968.71 s [vector] prescanl': OK
  13805. 968.71 s [vector] +++ OK, passed 100 tests.
  13806. 968.71 s [vector] postscanl: OK
  13807. 968.71 s [vector] +++ OK, passed 100 tests.
  13808. 968.71 s [vector] postscanl': OK
  13809. 968.71 s [vector] +++ OK, passed 100 tests.
  13810. 968.71 s [vector] scanl: OK
  13811. 968.71 s [vector] +++ OK, passed 100 tests.
  13812. 968.71 s [vector] scanl': OK
  13813. 968.71 s [vector] +++ OK, passed 100 tests.
  13814. 968.71 s [vector] scanl1: OK
  13815. 968.71 s [vector] +++ OK, passed 100 tests.
  13816. 968.71 s [vector] scanl1': OK
  13817. 968.71 s [vector] +++ OK, passed 100 tests.
  13818. 968.71 s [vector] iscanl: OK
  13819. 968.71 s [vector] +++ OK, passed 100 tests.
  13820. 968.72 s [vector] iscanl': OK
  13821. 968.72 s [vector] +++ OK, passed 100 tests.
  13822. 968.72 s [vector] prescanr: OK
  13823. 968.72 s [vector] +++ OK, passed 100 tests.
  13824. 968.72 s [vector] prescanr': OK
  13825. 968.72 s [vector] +++ OK, passed 100 tests.
  13826. 968.72 s [vector] postscanr: OK
  13827. 968.72 s [vector] +++ OK, passed 100 tests.
  13828. 968.72 s [vector] postscanr': OK
  13829. 968.72 s [vector] +++ OK, passed 100 tests.
  13830. 968.72 s [vector] scanr: OK
  13831. 968.72 s [vector] +++ OK, passed 100 tests.
  13832. 968.72 s [vector] scanr': OK
  13833. 968.72 s [vector] +++ OK, passed 100 tests.
  13834. 968.72 s [vector] scanr1: OK
  13835. 968.72 s [vector] +++ OK, passed 100 tests.
  13836. 968.72 s [vector] scanr1': OK
  13837. 968.72 s [vector] +++ OK, passed 100 tests.
  13838. 968.72 s [vector] iscanr: OK
  13839. 968.72 s [vector] +++ OK, passed 100 tests.
  13840. 968.72 s [vector] iscanr': OK
  13841. 968.72 s [vector] +++ OK, passed 100 tests.
  13842. 968.72 s [vector] mut_read: OK
  13843. 968.72 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13844. 968.72 s [vector] mut_write: OK
  13845. 968.72 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13846. 968.73 s [vector] mut_modify: OK
  13847. 968.73 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13848. 968.73 s [vector] mut_generate: OK
  13849. 968.73 s [vector] +++ OK, passed 100 tests.
  13850. 968.74 s [vector] mut_generateM: OK
  13851. 968.74 s [vector] +++ OK, passed 100 tests.
  13852. 968.74 s [vector] mut_mapM_: OK
  13853. 968.75 s [vector] +++ OK, passed 100 tests.
  13854. 968.75 s [vector] mut_imapM_: OK
  13855. 968.75 s [vector] +++ OK, passed 100 tests.
  13856. 968.76 s [vector] mut_forM_: OK
  13857. 968.76 s [vector] +++ OK, passed 100 tests.
  13858. 968.76 s [vector] mut_iforM_: OK
  13859. 968.76 s [vector] +++ OK, passed 100 tests.
  13860. 968.76 s [vector] mut_foldr: OK
  13861. 968.76 s [vector] +++ OK, passed 100 tests.
  13862. 968.77 s [vector] mut_foldr': OK
  13863. 968.77 s [vector] +++ OK, passed 100 tests.
  13864. 968.77 s [vector] mut_foldl: OK
  13865. 968.77 s [vector] +++ OK, passed 100 tests.
  13866. 968.77 s [vector] mut_foldl': OK
  13867. 968.77 s [vector] +++ OK, passed 100 tests.
  13868. 968.77 s [vector] mut_ifoldr: OK
  13869. 968.77 s [vector] +++ OK, passed 100 tests.
  13870. 968.77 s [vector] mut_ifoldr': OK
  13871. 968.77 s [vector] +++ OK, passed 100 tests.
  13872. 968.77 s [vector] mut_ifoldl: OK
  13873. 968.77 s [vector] +++ OK, passed 100 tests.
  13874. 968.77 s [vector] mut_ifoldl': OK
  13875. 968.77 s [vector] +++ OK, passed 100 tests.
  13876. 968.77 s [vector] mut_foldM: OK
  13877. 968.77 s [vector] +++ OK, passed 100 tests.
  13878. 968.77 s [vector] mut_foldM': OK
  13879. 968.77 s [vector] +++ OK, passed 100 tests.
  13880. 968.77 s [vector] mut_foldrM: OK
  13881. 968.77 s [vector] +++ OK, passed 100 tests.
  13882. 968.77 s [vector] mut_foldrM': OK
  13883. 968.77 s [vector] +++ OK, passed 100 tests.
  13884. 968.77 s [vector] mut_ifoldM: OK
  13885. 968.77 s [vector] +++ OK, passed 100 tests.
  13886. 968.77 s [vector] mut_ifoldM': OK
  13887. 968.77 s [vector] +++ OK, passed 100 tests.
  13888. 968.77 s [vector] mut_ifoldrM: OK
  13889. 968.77 s [vector] +++ OK, passed 100 tests.
  13890. 968.77 s [vector] mut_ifoldrM': OK
  13891. 968.77 s [vector] +++ OK, passed 100 tests.
  13892. 968.77 s [vector] compare: OK
  13893. 968.77 s [vector] +++ OK, passed 100 tests.
  13894. 968.77 s [vector] maximum: OK
  13895. 968.77 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13896. 968.77 s [vector] minimum: OK
  13897. 968.77 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13898. 968.77 s [vector] minIndex: OK
  13899. 968.77 s [vector] +++ OK, passed 100 tests; 11 discarded.
  13900. 968.77 s [vector] maxIndex: OK
  13901. 968.78 s [vector] +++ OK, passed 100 tests; 11 discarded.
  13902. 968.78 s [vector] maximumBy: OK
  13903. 968.78 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13904. 968.78 s [vector] minimumBy: OK
  13905. 968.78 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13906. 968.78 s [vector] maximumOn: OK
  13907. 968.78 s [vector] +++ OK, passed 100 tests; 12 discarded.
  13908. 968.78 s [vector] minimumOn: OK
  13909. 968.78 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13910. 968.78 s [vector] maxIndexBy: OK
  13911. 968.78 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13912. 968.78 s [vector] minIndexBy: OK
  13913. 968.78 s [vector] +++ OK, passed 100 tests; 19 discarded.
  13914. 968.78 s [vector] ListFirstMaxIndexWins: OK
  13915. 968.78 s [vector] +++ OK, passed 100 tests; 20 discarded.
  13916. 968.78 s [vector] FalseListFirstMaxIndexWins: OK
  13917. 968.78 s [vector] +++ OK, failed as expected. (after 1 test):
  13918. 968.78 s [vector] Exception:
  13919. 968.78 s [vector] Prelude.foldr1: empty list
  13920. 968.78 s [vector] CallStack (from HasCallStack):
  13921. 968.78 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  13922. 968.78 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  13923. 968.78 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  13924. 968.78 s [vector] []
  13925. 968.78 s [vector] zip: OK
  13926. 968.78 s [vector] +++ OK, passed 100 tests.
  13927. 968.78 s [vector] zip3: OK
  13928. 968.78 s [vector] +++ OK, passed 100 tests.
  13929. 968.78 s [vector] unzip: OK
  13930. 968.78 s [vector] +++ OK, passed 100 tests.
  13931. 968.78 s [vector] unzip3: OK
  13932. 968.78 s [vector] +++ OK, passed 100 tests.
  13933. 968.78 s [vector] indexed: OK
  13934. 968.78 s [vector] +++ OK, passed 100 tests.
  13935. 968.78 s [vector] update: OK
  13936. 968.78 s [vector] +++ OK, passed 100 tests.
  13937. 968.79 s [vector] mempty: OK
  13938. 968.79 s [vector] +++ OK, passed 100 tests.
  13939. 968.79 s [vector] mappend: OK
  13940. 968.79 s [vector] +++ OK, passed 100 tests.
  13941. 968.80 s [vector] mconcat: OK
  13942. 968.80 s [vector] +++ OK, passed 100 tests.
  13943. 968.80 s [vector] glength: OK
  13944. 968.80 s [vector] +++ OK, passed 100 tests.
  13945. 968.80 s [vector] (Bool)
  13946. 968.80 s [vector] fromList.toList == id: OK
  13947. 968.80 s [vector] +++ OK, passed 100 tests.
  13948. 968.80 s [vector] toList.fromList == id: OK
  13949. 968.80 s [vector] +++ OK, passed 100 tests.
  13950. 968.80 s [vector] unstream.stream == id: OK
  13951. 968.80 s [vector] +++ OK, passed 100 tests.
  13952. 968.80 s [vector] stream.unstream == id: OK
  13953. 968.80 s [vector] +++ OK, passed 100 tests.
  13954. 968.80 s [vector] eq: OK
  13955. 968.80 s [vector] +++ OK, passed 100 tests.
  13956. 968.80 s [vector] length: OK
  13957. 968.80 s [vector] +++ OK, passed 100 tests.
  13958. 968.80 s [vector] null: OK
  13959. 968.80 s [vector] +++ OK, passed 100 tests.
  13960. 968.80 s [vector] index: OK
  13961. 968.80 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13962. 968.80 s [vector] safeIndex: OK
  13963. 968.80 s [vector] +++ OK, passed 100 tests.
  13964. 968.80 s [vector] head: OK
  13965. 968.80 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13966. 968.80 s [vector] last: OK
  13967. 968.80 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13968. 968.80 s [vector] unsafeIndex: OK
  13969. 968.80 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13970. 968.80 s [vector] unsafeHead: OK
  13971. 968.80 s [vector] +++ OK, passed 100 tests; 19 discarded.
  13972. 968.80 s [vector] unsafeLast: OK
  13973. 968.80 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13974. 968.80 s [vector] slice: OK
  13975. 968.80 s [vector] +++ OK, passed 100 tests.
  13976. 968.80 s [vector] init: OK
  13977. 968.80 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13978. 968.80 s [vector] tail: OK
  13979. 968.80 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13980. 968.80 s [vector] take: OK
  13981. 968.81 s [vector] +++ OK, passed 100 tests.
  13982. 968.81 s [vector] drop: OK
  13983. 968.81 s [vector] +++ OK, passed 100 tests.
  13984. 968.81 s [vector] splitAt: OK
  13985. 968.81 s [vector] +++ OK, passed 100 tests.
  13986. 968.81 s [vector] empty: OK
  13987. 968.81 s [vector] +++ OK, passed 100 tests.
  13988. 968.81 s [vector] singleton: OK
  13989. 968.81 s [vector] +++ OK, passed 100 tests.
  13990. 968.81 s [vector] replicate: OK
  13991. 968.81 s [vector] +++ OK, passed 100 tests.
  13992. 968.81 s [vector] generate: OK
  13993. 968.81 s [vector] +++ OK, passed 100 tests.
  13994. 968.81 s [vector] iterateN: OK
  13995. 968.81 s [vector] +++ OK, passed 100 tests.
  13996. 968.82 s [vector] iterateNM: OK (0.01s)
  13997. 968.82 s [vector] +++ OK, passed 100 tests.
  13998. 968.85 s [vector] generateM: OK
  13999. 968.85 s [vector] +++ OK, passed 100 tests.
  14000. 968.85 s [vector] replicateM: OK
  14001. 968.85 s [vector] +++ OK, passed 100 tests.
  14002. 968.85 s [vector] create: OK
  14003. 968.85 s [vector] +++ OK, passed 100 tests.
  14004. 968.85 s [vector] createT: OK
  14005. 968.85 s [vector] +++ OK, passed 100 tests.
  14006. 968.85 s [vector] unfoldr: OK
  14007. 968.85 s [vector] +++ OK, passed 100 tests.
  14008. 968.85 s [vector] unfoldrN: OK
  14009. 968.85 s [vector] +++ OK, passed 100 tests.
  14010. 968.85 s [vector] unfoldrExactN: OK
  14011. 968.86 s [vector] +++ OK, passed 100 tests.
  14012. 968.86 s [vector] unfoldrM: OK
  14013. 968.86 s [vector] +++ OK, passed 100 tests.
  14014. 968.86 s [vector] unfoldrNM: OK
  14015. 968.86 s [vector] +++ OK, passed 100 tests.
  14016. 968.87 s [vector] unfoldrExactNM: OK
  14017. 968.87 s [vector] +++ OK, passed 100 tests.
  14018. 968.88 s [vector] constructN: OK
  14019. 968.89 s [vector] +++ OK, passed 100 tests.
  14020. 968.89 s [vector] constructrN: OK
  14021. 968.89 s [vector] +++ OK, passed 100 tests.
  14022. 968.89 s [vector] cons: OK
  14023. 968.89 s [vector] +++ OK, passed 100 tests.
  14024. 969.08 s [vector] snoc: OK
  14025. 969.08 s [vector] +++ OK, passed 100 tests.
  14026. 969.08 s [vector] append: OK
  14027. 969.08 s [vector] +++ OK, passed 100 tests.
  14028. 969.08 s [vector] concat: OK (0.01s)
  14029. 969.08 s [vector] +++ OK, passed 100 tests.
  14030. 969.08 s [vector] force: OK
  14031. 969.08 s [vector] +++ OK, passed 100 tests.
  14032. 969.08 s [vector] upd: OK
  14033. 969.08 s [vector] +++ OK, passed 100 tests.
  14034. 969.08 s [vector] accum: OK
  14035. 969.08 s [vector] +++ OK, passed 100 tests.
  14036. 969.08 s [vector] reverse: OK
  14037. 969.08 s [vector] +++ OK, passed 100 tests.
  14038. 969.08 s [vector] backpermute: OK
  14039. 969.08 s [vector] +++ OK, passed 100 tests.
  14040. 969.08 s [vector] map: OK
  14041. 969.08 s [vector] +++ OK, passed 100 tests.
  14042. 969.08 s [vector] imap: OK
  14043. 969.08 s [vector] +++ OK, passed 100 tests.
  14044. 969.08 s [vector] concatMap: OK
  14045. 969.08 s [vector] +++ OK, passed 100 tests.
  14046. 969.08 s [vector] mapM: OK
  14047. 969.08 s [vector] +++ OK, passed 100 tests.
  14048. 969.08 s [vector] mapM_: OK
  14049. 969.08 s [vector] +++ OK, passed 100 tests.
  14050. 969.08 s [vector] forM: OK
  14051. 969.08 s [vector] +++ OK, passed 100 tests.
  14052. 969.08 s [vector] forM_: OK
  14053. 969.08 s [vector] +++ OK, passed 100 tests.
  14054. 969.08 s [vector] imapM: OK
  14055. 969.08 s [vector] +++ OK, passed 100 tests.
  14056. 969.08 s [vector] imapM_: OK
  14057. 969.08 s [vector] +++ OK, passed 100 tests.
  14058. 969.08 s [vector] zipWith: OK
  14059. 969.08 s [vector] +++ OK, passed 100 tests.
  14060. 969.08 s [vector] zipWith3: OK
  14061. 969.08 s [vector] +++ OK, passed 100 tests.
  14062. 969.08 s [vector] izipWith: OK
  14063. 969.08 s [vector] +++ OK, passed 100 tests.
  14064. 969.08 s [vector] izipWith3: OK
  14065. 969.08 s [vector] +++ OK, passed 100 tests.
  14066. 969.08 s [vector] izipWithM: OK
  14067. 969.08 s [vector] +++ OK, passed 100 tests.
  14068. 969.08 s [vector] izipWithM_: OK
  14069. 969.08 s [vector] +++ OK, passed 100 tests.
  14070. 969.08 s [vector] zipWithM: OK
  14071. 969.08 s [vector] +++ OK, passed 100 tests.
  14072. 969.08 s [vector] zipWithM_: OK
  14073. 969.08 s [vector] +++ OK, passed 100 tests.
  14074. 969.08 s [vector] filter: OK
  14075. 969.08 s [vector] +++ OK, passed 100 tests.
  14076. 969.08 s [vector] ifilter: OK
  14077. 969.08 s [vector] +++ OK, passed 100 tests.
  14078. 969.08 s [vector] filterM: OK (0.03s)
  14079. 969.08 s [vector] +++ OK, passed 100 tests.
  14080. 969.08 s [vector] uniq: OK
  14081. 969.08 s [vector] +++ OK, passed 100 tests.
  14082. 969.08 s [vector] mapMaybe: OK
  14083. 969.08 s [vector] +++ OK, passed 100 tests.
  14084. 969.08 s [vector] imapMaybe: OK
  14085. 969.08 s [vector] +++ OK, passed 100 tests.
  14086. 969.08 s [vector] takeWhile: OK
  14087. 969.08 s [vector] +++ OK, passed 100 tests.
  14088. 969.08 s [vector] dropWhile: OK
  14089. 969.08 s [vector] +++ OK, passed 100 tests.
  14090. 969.08 s [vector] partition: OK
  14091. 969.08 s [vector] +++ OK, passed 100 tests.
  14092. 969.08 s [vector] partitionWith: OK
  14093. 969.08 s [vector] +++ OK, passed 100 tests.
  14094. 969.08 s [vector] span: OK
  14095. 969.08 s [vector] +++ OK, passed 100 tests.
  14096. 969.08 s [vector] break: OK
  14097. 969.08 s [vector] +++ OK, passed 100 tests.
  14098. 969.08 s [vector] spanR: OK
  14099. 969.08 s [vector] +++ OK, passed 100 tests.
  14100. 969.08 s [vector] breakR: OK
  14101. 969.08 s [vector] +++ OK, passed 100 tests.
  14102. 969.08 s [vector] groupBy: OK
  14103. 969.08 s [vector] +++ OK, passed 100 tests.
  14104. 969.08 s [vector] elem: OK
  14105. 969.08 s [vector] +++ OK, passed 100 tests.
  14106. 969.08 s [vector] notElem: OK
  14107. 969.08 s [vector] +++ OK, passed 100 tests.
  14108. 969.08 s [vector] find: OK
  14109. 969.08 s [vector] +++ OK, passed 100 tests.
  14110. 969.08 s [vector] findIndex: OK
  14111. 969.08 s [vector] +++ OK, passed 100 tests.
  14112. 969.08 s [vector] findIndexR: OK
  14113. 969.08 s [vector] +++ OK, passed 100 tests.
  14114. 969.08 s [vector] findIndices: OK
  14115. 969.08 s [vector] +++ OK, passed 100 tests.
  14116. 969.08 s [vector] elemIndex: OK
  14117. 969.08 s [vector] +++ OK, passed 100 tests.
  14118. 969.08 s [vector] elemIndices: OK
  14119. 969.08 s [vector] +++ OK, passed 100 tests.
  14120. 969.08 s [vector] foldl: OK
  14121. 969.08 s [vector] +++ OK, passed 100 tests.
  14122. 969.08 s [vector] foldl1: OK
  14123. 969.08 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14124. 969.08 s [vector] foldl': OK
  14125. 969.08 s [vector] +++ OK, passed 100 tests.
  14126. 969.08 s [vector] foldl1': OK
  14127. 969.08 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14128. 969.08 s [vector] foldr: OK
  14129. 969.08 s [vector] +++ OK, passed 100 tests.
  14130. 969.08 s [vector] foldr1: OK
  14131. 969.08 s [vector] +++ OK, passed 100 tests; 19 discarded.
  14132. 969.08 s [vector] foldr': OK
  14133. 969.08 s [vector] +++ OK, passed 100 tests.
  14134. 969.08 s [vector] foldr1': OK
  14135. 969.08 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14136. 969.08 s [vector] ifoldl: OK
  14137. 969.08 s [vector] +++ OK, passed 100 tests.
  14138. 969.08 s [vector] ifoldl': OK
  14139. 969.08 s [vector] +++ OK, passed 100 tests.
  14140. 969.08 s [vector] ifoldr: OK
  14141. 969.08 s [vector] +++ OK, passed 100 tests.
  14142. 969.08 s [vector] ifoldr': OK
  14143. 969.08 s [vector] +++ OK, passed 100 tests.
  14144. 969.08 s [vector] ifoldM: OK
  14145. 969.08 s [vector] +++ OK, passed 100 tests.
  14146. 969.08 s [vector] ifoldM': OK
  14147. 969.08 s [vector] +++ OK, passed 100 tests.
  14148. 969.08 s [vector] ifoldM_: OK (0.01s)
  14149. 969.08 s [vector] +++ OK, passed 100 tests.
  14150. 969.08 s [vector] ifoldM'_: OK
  14151. 969.08 s [vector] +++ OK, passed 100 tests.
  14152. 969.08 s [vector] all: OK
  14153. 969.08 s [vector] +++ OK, passed 100 tests.
  14154. 969.08 s [vector] any: OK
  14155. 969.08 s [vector] +++ OK, passed 100 tests.
  14156. 969.08 s [vector] prescanl: OK
  14157. 969.08 s [vector] +++ OK, passed 100 tests.
  14158. 969.08 s [vector] prescanl': OK
  14159. 969.08 s [vector] +++ OK, passed 100 tests.
  14160. 969.08 s [vector] postscanl: OK
  14161. 969.09 s [vector] +++ OK, passed 100 tests.
  14162. 969.09 s [vector] postscanl': OK
  14163. 969.09 s [vector] +++ OK, passed 100 tests.
  14164. 969.09 s [vector] scanl: OK
  14165. 969.09 s [vector] +++ OK, passed 100 tests.
  14166. 969.09 s [vector] scanl': OK
  14167. 969.09 s [vector] +++ OK, passed 100 tests.
  14168. 969.09 s [vector] scanl1: OK
  14169. 969.09 s [vector] +++ OK, passed 100 tests.
  14170. 969.09 s [vector] scanl1': OK
  14171. 969.09 s [vector] +++ OK, passed 100 tests.
  14172. 969.09 s [vector] iscanl: OK
  14173. 969.09 s [vector] +++ OK, passed 100 tests.
  14174. 969.09 s [vector] iscanl': OK
  14175. 969.09 s [vector] +++ OK, passed 100 tests.
  14176. 969.09 s [vector] prescanr: OK
  14177. 969.09 s [vector] +++ OK, passed 100 tests.
  14178. 969.09 s [vector] prescanr': OK
  14179. 969.09 s [vector] +++ OK, passed 100 tests.
  14180. 969.09 s [vector] postscanr: OK
  14181. 969.09 s [vector] +++ OK, passed 100 tests.
  14182. 969.09 s [vector] postscanr': OK
  14183. 969.09 s [vector] +++ OK, passed 100 tests.
  14184. 969.09 s [vector] scanr: OK
  14185. 969.10 s [vector] +++ OK, passed 100 tests.
  14186. 969.10 s [vector] scanr': OK
  14187. 969.10 s [vector] +++ OK, passed 100 tests.
  14188. 969.10 s [vector] scanr1: OK
  14189. 969.10 s [vector] +++ OK, passed 100 tests.
  14190. 969.10 s [vector] scanr1': OK
  14191. 969.10 s [vector] +++ OK, passed 100 tests.
  14192. 969.10 s [vector] iscanr: OK
  14193. 969.10 s [vector] +++ OK, passed 100 tests.
  14194. 969.10 s [vector] iscanr': OK
  14195. 969.10 s [vector] +++ OK, passed 100 tests.
  14196. 969.10 s [vector] mut_read: OK
  14197. 969.10 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14198. 969.10 s [vector] mut_write: OK
  14199. 969.11 s [vector] +++ OK, passed 100 tests; 23 discarded.
  14200. 969.11 s [vector] mut_modify: OK
  14201. 969.11 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14202. 969.11 s [vector] mut_generate: OK
  14203. 969.11 s [vector] +++ OK, passed 100 tests.
  14204. 969.11 s [vector] mut_generateM: OK
  14205. 969.11 s [vector] +++ OK, passed 100 tests.
  14206. 969.13 s [vector] mut_mapM_: OK
  14207. 969.13 s [vector] +++ OK, passed 100 tests.
  14208. 969.13 s [vector] mut_imapM_: OK (0.01s)
  14209. 969.13 s [vector] +++ OK, passed 100 tests.
  14210. 969.15 s [vector] mut_forM_: OK (0.01s)
  14211. 969.15 s [vector] +++ OK, passed 100 tests.
  14212. 969.16 s [vector] mut_iforM_: OK (0.01s)
  14213. 969.16 s [vector] +++ OK, passed 100 tests.
  14214. 969.16 s [vector] mut_foldr: OK
  14215. 969.16 s [vector] +++ OK, passed 100 tests.
  14216. 969.16 s [vector] mut_foldr': OK
  14217. 969.16 s [vector] +++ OK, passed 100 tests.
  14218. 969.16 s [vector] mut_foldl: OK
  14219. 969.16 s [vector] +++ OK, passed 100 tests.
  14220. 969.17 s [vector] mut_foldl': OK
  14221. 969.17 s [vector] +++ OK, passed 100 tests.
  14222. 969.17 s [vector] mut_ifoldr: OK
  14223. 969.17 s [vector] +++ OK, passed 100 tests.
  14224. 969.17 s [vector] mut_ifoldr': OK
  14225. 969.17 s [vector] +++ OK, passed 100 tests.
  14226. 969.17 s [vector] mut_ifoldl: OK
  14227. 969.17 s [vector] +++ OK, passed 100 tests.
  14228. 969.17 s [vector] mut_ifoldl': OK
  14229. 969.17 s [vector] +++ OK, passed 100 tests.
  14230. 969.17 s [vector] mut_foldM: OK
  14231. 969.17 s [vector] +++ OK, passed 100 tests.
  14232. 969.17 s [vector] mut_foldM': OK
  14233. 969.17 s [vector] +++ OK, passed 100 tests.
  14234. 969.17 s [vector] mut_foldrM: OK
  14235. 969.18 s [vector] +++ OK, passed 100 tests.
  14236. 969.18 s [vector] mut_foldrM': OK
  14237. 969.18 s [vector] +++ OK, passed 100 tests.
  14238. 969.18 s [vector] mut_ifoldM: OK
  14239. 969.18 s [vector] +++ OK, passed 100 tests.
  14240. 969.18 s [vector] mut_ifoldM': OK
  14241. 969.18 s [vector] +++ OK, passed 100 tests.
  14242. 969.18 s [vector] mut_ifoldrM: OK
  14243. 969.18 s [vector] +++ OK, passed 100 tests.
  14244. 969.18 s [vector] mut_ifoldrM': OK
  14245. 969.18 s [vector] +++ OK, passed 100 tests.
  14246. 969.18 s [vector] compare: OK
  14247. 969.18 s [vector] +++ OK, passed 100 tests.
  14248. 969.18 s [vector] maximum: OK
  14249. 969.18 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14250. 969.18 s [vector] minimum: OK
  14251. 969.18 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14252. 969.18 s [vector] minIndex: OK
  14253. 969.18 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14254. 969.18 s [vector] maxIndex: OK
  14255. 969.18 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14256. 969.18 s [vector] maximumBy: OK
  14257. 969.18 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14258. 969.18 s [vector] minimumBy: OK
  14259. 969.18 s [vector] +++ OK, passed 100 tests; 22 discarded.
  14260. 969.18 s [vector] maximumOn: OK
  14261. 969.18 s [vector] +++ OK, passed 100 tests; 13 discarded.
  14262. 969.18 s [vector] minimumOn: OK
  14263. 969.18 s [vector] +++ OK, passed 100 tests; 10 discarded.
  14264. 969.18 s [vector] maxIndexBy: OK
  14265. 969.18 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14266. 969.18 s [vector] minIndexBy: OK
  14267. 969.18 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14268. 969.18 s [vector] ListFirstMaxIndexWins: OK
  14269. 969.18 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14270. 969.19 s [vector] FalseListFirstMaxIndexWins: OK
  14271. 969.19 s [vector] +++ OK, failed as expected. (after 1 test):
  14272. 969.19 s [vector] Exception:
  14273. 969.19 s [vector] Prelude.foldr1: empty list
  14274. 969.19 s [vector] CallStack (from HasCallStack):
  14275. 969.19 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  14276. 969.19 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  14277. 969.19 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  14278. 969.19 s [vector] []
  14279. 969.19 s [vector] zip: OK
  14280. 969.19 s [vector] +++ OK, passed 100 tests.
  14281. 969.19 s [vector] zip3: OK
  14282. 969.19 s [vector] +++ OK, passed 100 tests.
  14283. 969.19 s [vector] unzip: OK
  14284. 969.19 s [vector] +++ OK, passed 100 tests.
  14285. 969.19 s [vector] unzip3: OK
  14286. 969.19 s [vector] +++ OK, passed 100 tests.
  14287. 969.19 s [vector] indexed: OK
  14288. 969.19 s [vector] +++ OK, passed 100 tests.
  14289. 969.19 s [vector] update: OK
  14290. 969.19 s [vector] +++ OK, passed 100 tests.
  14291. 969.19 s [vector] mempty: OK
  14292. 969.19 s [vector] +++ OK, passed 100 tests.
  14293. 969.19 s [vector] mappend: OK
  14294. 969.19 s [vector] +++ OK, passed 100 tests.
  14295. 969.21 s [vector] mconcat: OK (0.01s)
  14296. 969.21 s [vector] +++ OK, passed 100 tests.
  14297. 969.21 s [vector] glength: OK
  14298. 969.21 s [vector] +++ OK, passed 100 tests.
  14299. 969.21 s [vector] and: OK
  14300. 969.21 s [vector] +++ OK, passed 100 tests.
  14301. 969.21 s [vector] or: OK
  14302. 969.21 s [vector] +++ OK, passed 100 tests.
  14303. 969.21 s [vector] (Int)
  14304. 969.21 s [vector] fromList.toList == id: OK
  14305. 969.21 s [vector] +++ OK, passed 100 tests.
  14306. 969.21 s [vector] toList.fromList == id: OK
  14307. 969.21 s [vector] +++ OK, passed 100 tests.
  14308. 969.21 s [vector] unstream.stream == id: OK
  14309. 969.21 s [vector] +++ OK, passed 100 tests.
  14310. 969.21 s [vector] stream.unstream == id: OK
  14311. 969.21 s [vector] +++ OK, passed 100 tests.
  14312. 969.21 s [vector] eq: OK
  14313. 969.21 s [vector] +++ OK, passed 100 tests.
  14314. 969.21 s [vector] length: OK
  14315. 969.21 s [vector] +++ OK, passed 100 tests.
  14316. 969.21 s [vector] null: OK
  14317. 969.21 s [vector] +++ OK, passed 100 tests.
  14318. 969.21 s [vector] index: OK
  14319. 969.21 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14320. 969.21 s [vector] safeIndex: OK
  14321. 969.21 s [vector] +++ OK, passed 100 tests.
  14322. 969.21 s [vector] head: OK
  14323. 969.21 s [vector] +++ OK, passed 100 tests; 13 discarded.
  14324. 969.21 s [vector] last: OK
  14325. 969.21 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14326. 969.21 s [vector] unsafeIndex: OK
  14327. 969.21 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14328. 969.22 s [vector] unsafeHead: OK
  14329. 969.22 s [vector] +++ OK, passed 100 tests; 19 discarded.
  14330. 969.22 s [vector] unsafeLast: OK
  14331. 969.22 s [vector] +++ OK, passed 100 tests; 19 discarded.
  14332. 969.22 s [vector] slice: OK
  14333. 969.22 s [vector] +++ OK, passed 100 tests.
  14334. 969.22 s [vector] init: OK
  14335. 969.22 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14336. 969.22 s [vector] tail: OK
  14337. 969.22 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14338. 969.22 s [vector] take: OK
  14339. 969.22 s [vector] +++ OK, passed 100 tests.
  14340. 969.22 s [vector] drop: OK
  14341. 969.22 s [vector] +++ OK, passed 100 tests.
  14342. 969.22 s [vector] splitAt: OK
  14343. 969.22 s [vector] +++ OK, passed 100 tests.
  14344. 969.22 s [vector] empty: OK
  14345. 969.22 s [vector] +++ OK, passed 100 tests.
  14346. 969.22 s [vector] singleton: OK
  14347. 969.22 s [vector] +++ OK, passed 100 tests.
  14348. 969.22 s [vector] replicate: OK
  14349. 969.22 s [vector] +++ OK, passed 100 tests.
  14350. 969.22 s [vector] generate: OK
  14351. 969.22 s [vector] +++ OK, passed 100 tests.
  14352. 969.23 s [vector] iterateN: OK
  14353. 969.23 s [vector] +++ OK, passed 100 tests.
  14354. 969.23 s [vector] iterateNM: OK (0.01s)
  14355. 969.23 s [vector] +++ OK, passed 100 tests.
  14356. 969.27 s [vector] generateM: OK (0.01s)
  14357. 969.27 s [vector] +++ OK, passed 100 tests.
  14358. 969.27 s [vector] replicateM: OK (0.01s)
  14359. 969.27 s [vector] +++ OK, passed 100 tests.
  14360. 969.27 s [vector] create: OK
  14361. 969.27 s [vector] +++ OK, passed 100 tests.
  14362. 969.28 s [vector] createT: OK
  14363. 969.28 s [vector] +++ OK, passed 100 tests.
  14364. 969.28 s [vector] unfoldr: OK
  14365. 969.28 s [vector] +++ OK, passed 100 tests.
  14366. 969.28 s [vector] unfoldrN: OK
  14367. 969.28 s [vector] +++ OK, passed 100 tests.
  14368. 969.28 s [vector] unfoldrExactN: OK
  14369. 969.28 s [vector] +++ OK, passed 100 tests.
  14370. 969.28 s [vector] unfoldrM: OK
  14371. 969.28 s [vector] +++ OK, passed 100 tests.
  14372. 969.29 s [vector] unfoldrNM: OK
  14373. 969.29 s [vector] +++ OK, passed 100 tests.
  14374. 969.31 s [vector] unfoldrExactNM: OK (0.03s)
  14375. 969.31 s [vector] +++ OK, passed 100 tests.
  14376. 969.31 s [vector] constructN: OK
  14377. 969.31 s [vector] +++ OK, passed 100 tests.
  14378. 969.31 s [vector] constructrN: OK
  14379. 969.32 s [vector] +++ OK, passed 100 tests.
  14380. 969.32 s [vector] cons: OK
  14381. 969.32 s [vector] +++ OK, passed 100 tests.
  14382. 969.32 s [vector] snoc: OK
  14383. 969.32 s [vector] +++ OK, passed 100 tests.
  14384. 969.32 s [vector] append: OK
  14385. 969.33 s [vector] +++ OK, passed 100 tests.
  14386. 969.33 s [vector] concat: OK (0.02s)
  14387. 969.33 s [vector] +++ OK, passed 100 tests.
  14388. 969.33 s [vector] force: OK
  14389. 969.34 s [vector] +++ OK, passed 100 tests.
  14390. 969.34 s [vector] upd: OK
  14391. 969.34 s [vector] +++ OK, passed 100 tests.
  14392. 969.34 s [vector] accum: OK
  14393. 969.34 s [vector] +++ OK, passed 100 tests.
  14394. 969.34 s [vector] reverse: OK
  14395. 969.34 s [vector] +++ OK, passed 100 tests.
  14396. 969.34 s [vector] backpermute: OK
  14397. 969.34 s [vector] +++ OK, passed 100 tests.
  14398. 969.35 s [vector] map: OK
  14399. 969.35 s [vector] +++ OK, passed 100 tests.
  14400. 969.35 s [vector] imap: OK
  14401. 969.35 s [vector] +++ OK, passed 100 tests.
  14402. 969.35 s [vector] concatMap: OK
  14403. 969.36 s [vector] +++ OK, passed 100 tests.
  14404. 969.37 s [vector] mapM: OK
  14405. 969.37 s [vector] +++ OK, passed 100 tests.
  14406. 969.37 s [vector] mapM_: OK (0.01s)
  14407. 969.37 s [vector] +++ OK, passed 100 tests.
  14408. 969.37 s [vector] forM: OK
  14409. 969.37 s [vector] +++ OK, passed 100 tests.
  14410. 969.38 s [vector] forM_: OK (0.01s)
  14411. 969.39 s [vector] +++ OK, passed 100 tests.
  14412. 969.39 s [vector] imapM: OK
  14413. 969.39 s [vector] +++ OK, passed 100 tests.
  14414. 969.40 s [vector] imapM_: OK (0.02s)
  14415. 969.40 s [vector] +++ OK, passed 100 tests.
  14416. 969.40 s [vector] zipWith: OK
  14417. 969.40 s [vector] +++ OK, passed 100 tests.
  14418. 969.41 s [vector] zipWith3: OK
  14419. 969.41 s [vector] +++ OK, passed 100 tests.
  14420. 969.41 s [vector] izipWith: OK
  14421. 969.41 s [vector] +++ OK, passed 100 tests.
  14422. 969.41 s [vector] izipWith3: OK
  14423. 969.41 s [vector] +++ OK, passed 100 tests.
  14424. 969.41 s [vector] izipWithM: OK
  14425. 969.42 s [vector] +++ OK, passed 100 tests.
  14426. 969.43 s [vector] izipWithM_: OK (0.01s)
  14427. 969.43 s [vector] +++ OK, passed 100 tests.
  14428. 969.43 s [vector] zipWithM: OK
  14429. 969.43 s [vector] +++ OK, passed 100 tests.
  14430. 969.44 s [vector] zipWithM_: OK (0.01s)
  14431. 969.44 s [vector] +++ OK, passed 100 tests.
  14432. 969.44 s [vector] filter: OK
  14433. 969.44 s [vector] +++ OK, passed 100 tests.
  14434. 969.45 s [vector] ifilter: OK
  14435. 969.45 s [vector] +++ OK, passed 100 tests.
  14436. 969.47 s [vector] filterM: OK (0.03s)
  14437. 969.47 s [vector] +++ OK, passed 100 tests.
  14438. 969.47 s [vector] uniq: OK
  14439. 969.47 s [vector] +++ OK, passed 100 tests.
  14440. 969.47 s [vector] mapMaybe: OK
  14441. 969.48 s [vector] +++ OK, passed 100 tests.
  14442. 969.48 s [vector] imapMaybe: OK
  14443. 969.48 s [vector] +++ OK, passed 100 tests.
  14444. 969.48 s [vector] takeWhile: OK
  14445. 969.48 s [vector] +++ OK, passed 100 tests.
  14446. 969.48 s [vector] dropWhile: OK
  14447. 969.48 s [vector] +++ OK, passed 100 tests.
  14448. 969.48 s [vector] partition: OK
  14449. 969.48 s [vector] +++ OK, passed 100 tests.
  14450. 969.48 s [vector] partitionWith: OK
  14451. 969.48 s [vector] +++ OK, passed 100 tests.
  14452. 969.48 s [vector] span: OK
  14453. 969.48 s [vector] +++ OK, passed 100 tests.
  14454. 969.48 s [vector] break: OK
  14455. 969.48 s [vector] +++ OK, passed 100 tests.
  14456. 969.48 s [vector] spanR: OK
  14457. 969.48 s [vector] +++ OK, passed 100 tests.
  14458. 969.48 s [vector] breakR: OK
  14459. 969.49 s [vector] +++ OK, passed 100 tests.
  14460. 969.49 s [vector] groupBy: OK
  14461. 969.49 s [vector] +++ OK, passed 100 tests.
  14462. 969.49 s [vector] elem: OK
  14463. 969.49 s [vector] +++ OK, passed 100 tests.
  14464. 969.49 s [vector] notElem: OK
  14465. 969.49 s [vector] +++ OK, passed 100 tests.
  14466. 969.49 s [vector] find: OK
  14467. 969.49 s [vector] +++ OK, passed 100 tests.
  14468. 969.49 s [vector] findIndex: OK
  14469. 969.49 s [vector] +++ OK, passed 100 tests.
  14470. 969.49 s [vector] findIndexR: OK
  14471. 969.49 s [vector] +++ OK, passed 100 tests.
  14472. 969.49 s [vector] findIndices: OK
  14473. 969.49 s [vector] +++ OK, passed 100 tests.
  14474. 969.49 s [vector] elemIndex: OK
  14475. 969.49 s [vector] +++ OK, passed 100 tests.
  14476. 969.50 s [vector] elemIndices: OK
  14477. 969.50 s [vector] +++ OK, passed 100 tests.
  14478. 969.50 s [vector] foldl: OK
  14479. 969.50 s [vector] +++ OK, passed 100 tests.
  14480. 969.50 s [vector] foldl1: OK
  14481. 969.50 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14482. 969.50 s [vector] foldl': OK
  14483. 969.50 s [vector] +++ OK, passed 100 tests.
  14484. 969.50 s [vector] foldl1': OK
  14485. 969.51 s [vector] +++ OK, passed 100 tests; 22 discarded.
  14486. 969.51 s [vector] foldr: OK
  14487. 969.51 s [vector] +++ OK, passed 100 tests.
  14488. 969.51 s [vector] foldr1: OK
  14489. 969.51 s [vector] +++ OK, passed 100 tests; 19 discarded.
  14490. 969.51 s [vector] foldr': OK
  14491. 969.51 s [vector] +++ OK, passed 100 tests.
  14492. 969.51 s [vector] foldr1': OK
  14493. 969.52 s [vector] +++ OK, passed 100 tests; 19 discarded.
  14494. 969.52 s [vector] ifoldl: OK
  14495. 969.52 s [vector] +++ OK, passed 100 tests.
  14496. 969.52 s [vector] ifoldl': OK
  14497. 969.52 s [vector] +++ OK, passed 100 tests.
  14498. 969.52 s [vector] ifoldr: OK
  14499. 969.52 s [vector] +++ OK, passed 100 tests.
  14500. 969.53 s [vector] ifoldr': OK
  14501. 969.53 s [vector] +++ OK, passed 100 tests.
  14502. 969.53 s [vector] ifoldM: OK
  14503. 969.53 s [vector] +++ OK, passed 100 tests.
  14504. 969.53 s [vector] ifoldM': OK
  14505. 969.53 s [vector] +++ OK, passed 100 tests.
  14506. 969.55 s [vector] ifoldM_: OK (0.02s)
  14507. 969.55 s [vector] +++ OK, passed 100 tests.
  14508. 969.57 s [vector] ifoldM'_: OK (0.02s)
  14509. 969.57 s [vector] +++ OK, passed 100 tests.
  14510. 969.57 s [vector] all: OK
  14511. 969.57 s [vector] +++ OK, passed 100 tests.
  14512. 969.57 s [vector] any: OK
  14513. 969.57 s [vector] +++ OK, passed 100 tests.
  14514. 969.58 s [vector] prescanl: OK
  14515. 969.58 s [vector] +++ OK, passed 100 tests.
  14516. 969.58 s [vector] prescanl': OK
  14517. 969.58 s [vector] +++ OK, passed 100 tests.
  14518. 969.58 s [vector] postscanl: OK
  14519. 969.58 s [vector] +++ OK, passed 100 tests.
  14520. 969.58 s [vector] postscanl': OK
  14521. 969.58 s [vector] +++ OK, passed 100 tests.
  14522. 969.58 s [vector] scanl: OK
  14523. 969.59 s [vector] +++ OK, passed 100 tests.
  14524. 969.59 s [vector] scanl': OK
  14525. 969.59 s [vector] +++ OK, passed 100 tests.
  14526. 969.59 s [vector] scanl1: OK
  14527. 969.59 s [vector] +++ OK, passed 100 tests.
  14528. 969.59 s [vector] scanl1': OK
  14529. 969.59 s [vector] +++ OK, passed 100 tests.
  14530. 969.59 s [vector] iscanl: OK
  14531. 969.59 s [vector] +++ OK, passed 100 tests.
  14532. 969.60 s [vector] iscanl': OK
  14533. 969.60 s [vector] +++ OK, passed 100 tests.
  14534. 969.60 s [vector] prescanr: OK
  14535. 969.60 s [vector] +++ OK, passed 100 tests.
  14536. 969.60 s [vector] prescanr': OK
  14537. 969.61 s [vector] +++ OK, passed 100 tests.
  14538. 969.61 s [vector] postscanr: OK
  14539. 969.61 s [vector] +++ OK, passed 100 tests.
  14540. 969.61 s [vector] postscanr': OK
  14541. 969.61 s [vector] +++ OK, passed 100 tests.
  14542. 969.61 s [vector] scanr: OK
  14543. 969.61 s [vector] +++ OK, passed 100 tests.
  14544. 969.61 s [vector] scanr': OK
  14545. 969.61 s [vector] +++ OK, passed 100 tests.
  14546. 969.61 s [vector] scanr1: OK
  14547. 969.61 s [vector] +++ OK, passed 100 tests.
  14548. 969.62 s [vector] scanr1': OK
  14549. 969.62 s [vector] +++ OK, passed 100 tests.
  14550. 969.62 s [vector] iscanr: OK
  14551. 969.62 s [vector] +++ OK, passed 100 tests.
  14552. 969.62 s [vector] iscanr': OK
  14553. 969.62 s [vector] +++ OK, passed 100 tests.
  14554. 969.62 s [vector] mut_read: OK
  14555. 969.63 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14556. 969.63 s [vector] mut_write: OK
  14557. 969.63 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14558. 969.63 s [vector] mut_modify: OK
  14559. 969.63 s [vector] +++ OK, passed 100 tests; 19 discarded.
  14560. 969.63 s [vector] mut_generate: OK
  14561. 969.63 s [vector] +++ OK, passed 100 tests.
  14562. 969.65 s [vector] mut_generateM: OK
  14563. 969.65 s [vector] +++ OK, passed 100 tests.
  14564. 969.65 s [vector] mut_mapM_: OK (0.01s)
  14565. 969.65 s [vector] +++ OK, passed 100 tests.
  14566. 969.66 s [vector] mut_imapM_: OK (0.01s)
  14567. 969.66 s [vector] +++ OK, passed 100 tests.
  14568. 969.68 s [vector] mut_forM_: OK
  14569. 969.68 s [vector] +++ OK, passed 100 tests.
  14570. 969.70 s [vector] mut_iforM_: OK (0.02s)
  14571. 969.70 s [vector] +++ OK, passed 100 tests.
  14572. 969.70 s [vector] mut_foldr: OK
  14573. 969.70 s [vector] +++ OK, passed 100 tests.
  14574. 969.70 s [vector] mut_foldr': OK
  14575. 969.70 s [vector] +++ OK, passed 100 tests.
  14576. 969.70 s [vector] mut_foldl: OK
  14577. 969.71 s [vector] +++ OK, passed 100 tests.
  14578. 969.71 s [vector] mut_foldl': OK
  14579. 969.71 s [vector] +++ OK, passed 100 tests.
  14580. 969.71 s [vector] mut_ifoldr: OK
  14581. 969.71 s [vector] +++ OK, passed 100 tests.
  14582. 969.71 s [vector] mut_ifoldr': OK
  14583. 969.71 s [vector] +++ OK, passed 100 tests.
  14584. 969.71 s [vector] mut_ifoldl: OK
  14585. 969.71 s [vector] +++ OK, passed 100 tests.
  14586. 969.72 s [vector] mut_ifoldl': OK
  14587. 969.72 s [vector] +++ OK, passed 100 tests.
  14588. 969.72 s [vector] mut_foldM: OK
  14589. 969.72 s [vector] +++ OK, passed 100 tests.
  14590. 969.72 s [vector] mut_foldM': OK
  14591. 969.72 s [vector] +++ OK, passed 100 tests.
  14592. 969.73 s [vector] mut_foldrM: OK
  14593. 969.73 s [vector] +++ OK, passed 100 tests.
  14594. 969.73 s [vector] mut_foldrM': OK
  14595. 969.73 s [vector] +++ OK, passed 100 tests.
  14596. 969.73 s [vector] mut_ifoldM: OK
  14597. 969.73 s [vector] +++ OK, passed 100 tests.
  14598. 969.74 s [vector] mut_ifoldM': OK
  14599. 969.74 s [vector] +++ OK, passed 100 tests.
  14600. 969.74 s [vector] mut_ifoldrM: OK
  14601. 969.74 s [vector] +++ OK, passed 100 tests.
  14602. 969.74 s [vector] mut_ifoldrM': OK
  14603. 969.74 s [vector] +++ OK, passed 100 tests.
  14604. 969.74 s [vector] compare: OK
  14605. 969.74 s [vector] +++ OK, passed 100 tests.
  14606. 969.74 s [vector] maximum: OK
  14607. 969.74 s [vector] +++ OK, passed 100 tests; 20 discarded.
  14608. 969.74 s [vector] minimum: OK
  14609. 969.74 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14610. 969.75 s [vector] minIndex: OK
  14611. 969.75 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14612. 969.75 s [vector] maxIndex: OK
  14613. 969.75 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14614. 969.75 s [vector] maximumBy: OK
  14615. 969.75 s [vector] +++ OK, passed 100 tests; 24 discarded.
  14616. 969.75 s [vector] minimumBy: OK
  14617. 969.75 s [vector] +++ OK, passed 100 tests; 20 discarded.
  14618. 969.75 s [vector] maximumOn: OK
  14619. 969.75 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14620. 969.75 s [vector] minimumOn: OK
  14621. 969.75 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14622. 969.75 s [vector] maxIndexBy: OK
  14623. 969.75 s [vector] +++ OK, passed 100 tests; 19 discarded.
  14624. 969.75 s [vector] minIndexBy: OK
  14625. 969.75 s [vector] +++ OK, passed 100 tests; 19 discarded.
  14626. 969.75 s [vector] ListFirstMaxIndexWins: OK
  14627. 969.75 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14628. 969.75 s [vector] FalseListFirstMaxIndexWins: OK
  14629. 969.75 s [vector] +++ OK, failed as expected. (after 1 test):
  14630. 969.75 s [vector] Exception:
  14631. 969.75 s [vector] Prelude.foldr1: empty list
  14632. 969.75 s [vector] CallStack (from HasCallStack):
  14633. 969.75 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  14634. 969.75 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  14635. 969.75 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  14636. 969.75 s [vector] []
  14637. 969.75 s [vector] zip: OK
  14638. 969.75 s [vector] +++ OK, passed 100 tests.
  14639. 969.75 s [vector] zip3: OK
  14640. 969.75 s [vector] +++ OK, passed 100 tests.
  14641. 969.75 s [vector] unzip: OK
  14642. 969.75 s [vector] +++ OK, passed 100 tests.
  14643. 969.76 s [vector] unzip3: OK
  14644. 969.76 s [vector] +++ OK, passed 100 tests.
  14645. 969.76 s [vector] indexed: OK
  14646. 969.76 s [vector] +++ OK, passed 100 tests.
  14647. 969.76 s [vector] update: OK
  14648. 969.76 s [vector] +++ OK, passed 100 tests.
  14649. 969.76 s [vector] mempty: OK
  14650. 969.76 s [vector] +++ OK, passed 100 tests.
  14651. 969.76 s [vector] mappend: OK
  14652. 969.77 s [vector] +++ OK, passed 100 tests.
  14653. 969.78 s [vector] mconcat: OK (0.02s)
  14654. 969.78 s [vector] +++ OK, passed 100 tests.
  14655. 969.78 s [vector] glength: OK
  14656. 969.78 s [vector] +++ OK, passed 100 tests.
  14657. 969.78 s [vector] sum: OK
  14658. 969.78 s [vector] +++ OK, passed 100 tests.
  14659. 969.78 s [vector] product: OK
  14660. 969.78 s [vector] +++ OK, passed 100 tests.
  14661. 969.78 s [vector] enumFromN: OK
  14662. 969.78 s [vector] +++ OK, passed 100 tests.
  14663. 969.78 s [vector] enumFromThenN: OK
  14664. 969.78 s [vector] +++ OK, passed 100 tests.
  14665. 969.78 s [vector] enumFromTo: OK
  14666. 969.78 s [vector] +++ OK, passed 100 tests.
  14667. 969.78 s [vector] enumFromThenTo: OK
  14668. 969.78 s [vector] +++ OK, passed 100 tests; 12 discarded.
  14669. 969.78 s [vector] (Float)
  14670. 969.78 s [vector] fromList.toList == id: OK
  14671. 969.78 s [vector] +++ OK, passed 100 tests.
  14672. 969.79 s [vector] toList.fromList == id: OK
  14673. 969.79 s [vector] +++ OK, passed 100 tests.
  14674. 969.79 s [vector] unstream.stream == id: OK
  14675. 969.79 s [vector] +++ OK, passed 100 tests.
  14676. 969.79 s [vector] stream.unstream == id: OK
  14677. 969.79 s [vector] +++ OK, passed 100 tests.
  14678. 969.79 s [vector] eq: OK
  14679. 969.79 s [vector] +++ OK, passed 100 tests.
  14680. 969.79 s [vector] length: OK
  14681. 969.79 s [vector] +++ OK, passed 100 tests.
  14682. 969.79 s [vector] null: OK
  14683. 969.79 s [vector] +++ OK, passed 100 tests.
  14684. 969.79 s [vector] index: OK
  14685. 969.79 s [vector] +++ OK, passed 100 tests; 12 discarded.
  14686. 969.79 s [vector] safeIndex: OK
  14687. 969.79 s [vector] +++ OK, passed 100 tests.
  14688. 969.79 s [vector] head: OK
  14689. 969.79 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14690. 969.79 s [vector] last: OK
  14691. 969.79 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14692. 969.79 s [vector] unsafeIndex: OK
  14693. 969.79 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14694. 969.79 s [vector] unsafeHead: OK
  14695. 969.80 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14696. 969.80 s [vector] unsafeLast: OK
  14697. 969.80 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14698. 969.80 s [vector] slice: OK
  14699. 969.80 s [vector] +++ OK, passed 100 tests.
  14700. 969.80 s [vector] init: OK
  14701. 969.80 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14702. 969.80 s [vector] tail: OK
  14703. 969.80 s [vector] +++ OK, passed 100 tests; 20 discarded.
  14704. 969.80 s [vector] take: OK
  14705. 969.80 s [vector] +++ OK, passed 100 tests.
  14706. 969.80 s [vector] drop: OK
  14707. 969.80 s [vector] +++ OK, passed 100 tests.
  14708. 969.80 s [vector] splitAt: OK
  14709. 969.80 s [vector] +++ OK, passed 100 tests.
  14710. 969.80 s [vector] empty: OK
  14711. 969.80 s [vector] +++ OK, passed 100 tests.
  14712. 969.80 s [vector] singleton: OK
  14713. 969.80 s [vector] +++ OK, passed 100 tests.
  14714. 969.80 s [vector] replicate: OK
  14715. 969.80 s [vector] +++ OK, passed 100 tests.
  14716. 969.80 s [vector] generate: OK
  14717. 969.81 s [vector] +++ OK, passed 100 tests.
  14718. 969.81 s [vector] iterateN: OK
  14719. 969.81 s [vector] +++ OK, passed 100 tests.
  14720. 969.83 s [vector] iterateNM: OK (0.01s)
  14721. 969.83 s [vector] +++ OK, passed 100 tests.
  14722. 969.86 s [vector] generateM: OK (0.04s)
  14723. 969.86 s [vector] +++ OK, passed 100 tests.
  14724. 969.86 s [vector] replicateM: OK
  14725. 969.86 s [vector] +++ OK, passed 100 tests.
  14726. 969.86 s [vector] create: OK
  14727. 969.87 s [vector] +++ OK, passed 100 tests.
  14728. 969.87 s [vector] createT: OK
  14729. 969.87 s [vector] +++ OK, passed 100 tests.
  14730. 969.87 s [vector] unfoldr: OK
  14731. 969.87 s [vector] +++ OK, passed 100 tests.
  14732. 969.87 s [vector] unfoldrN: OK
  14733. 969.87 s [vector] +++ OK, passed 100 tests.
  14734. 969.87 s [vector] unfoldrExactN: OK
  14735. 969.87 s [vector] +++ OK, passed 100 tests.
  14736. 969.87 s [vector] unfoldrM: OK
  14737. 969.87 s [vector] +++ OK, passed 100 tests.
  14738. 969.87 s [vector] unfoldrNM: OK
  14739. 969.87 s [vector] +++ OK, passed 100 tests.
  14740. 969.90 s [vector] unfoldrExactNM: OK (0.02s)
  14741. 969.90 s [vector] +++ OK, passed 100 tests.
  14742. 969.90 s [vector] constructN: OK
  14743. 969.91 s [vector] +++ OK, passed 100 tests.
  14744. 969.91 s [vector] constructrN: OK
  14745. 969.91 s [vector] +++ OK, passed 100 tests.
  14746. 969.93 s [vector] cons: OK
  14747. 969.93 s [vector] +++ OK, passed 100 tests.
  14748. 969.93 s [vector] snoc: OK
  14749. 969.93 s [vector] +++ OK, passed 100 tests.
  14750. 969.93 s [vector] append: OK
  14751. 969.93 s [vector] +++ OK, passed 100 tests.
  14752. 969.94 s [vector] concat: OK (0.02s)
  14753. 969.94 s [vector] +++ OK, passed 100 tests.
  14754. 969.94 s [vector] force: OK
  14755. 969.94 s [vector] +++ OK, passed 100 tests.
  14756. 969.94 s [vector] upd: OK
  14757. 969.95 s [vector] +++ OK, passed 100 tests.
  14758. 969.95 s [vector] accum: OK
  14759. 969.95 s [vector] +++ OK, passed 100 tests.
  14760. 969.95 s [vector] reverse: OK
  14761. 969.95 s [vector] +++ OK, passed 100 tests.
  14762. 969.95 s [vector] backpermute: OK
  14763. 969.96 s [vector] +++ OK, passed 100 tests.
  14764. 969.97 s [vector] map: OK
  14765. 969.97 s [vector] +++ OK, passed 100 tests.
  14766. 969.97 s [vector] imap: OK
  14767. 969.97 s [vector] +++ OK, passed 100 tests.
  14768. 969.98 s [vector] concatMap: OK
  14769. 969.98 s [vector] +++ OK, passed 100 tests.
  14770. 969.98 s [vector] mapM: OK
  14771. 969.99 s [vector] +++ OK, passed 100 tests.
  14772. 970.01 s [vector] mapM_: OK (0.03s)
  14773. 970.01 s [vector] +++ OK, passed 100 tests.
  14774. 970.03 s [vector] forM: OK
  14775. 970.03 s [vector] +++ OK, passed 100 tests.
  14776. 970.05 s [vector] forM_: OK (0.03s)
  14777. 970.05 s [vector] +++ OK, passed 100 tests.
  14778. 970.07 s [vector] imapM: OK
  14779. 970.07 s [vector] +++ OK, passed 100 tests.
  14780. 970.09 s [vector] imapM_: OK (0.04s)
  14781. 970.09 s [vector] +++ OK, passed 100 tests.
  14782. 970.09 s [vector] zipWith: OK
  14783. 970.09 s [vector] +++ OK, passed 100 tests.
  14784. 970.10 s [vector] zipWith3: OK
  14785. 970.10 s [vector] +++ OK, passed 100 tests.
  14786. 970.10 s [vector] izipWith: OK
  14787. 970.11 s [vector] +++ OK, passed 100 tests.
  14788. 970.11 s [vector] izipWith3: OK
  14789. 970.12 s [vector] +++ OK, passed 100 tests.
  14790. 970.13 s [vector] izipWithM: OK
  14791. 970.13 s [vector] +++ OK, passed 100 tests.
  14792. 970.15 s [vector] izipWithM_: OK (0.02s)
  14793. 970.15 s [vector] +++ OK, passed 100 tests.
  14794. 970.15 s [vector] zipWithM: OK
  14795. 970.15 s [vector] +++ OK, passed 100 tests.
  14796. 970.17 s [vector] zipWithM_: OK (0.02s)
  14797. 970.17 s [vector] +++ OK, passed 100 tests.
  14798. 970.18 s [vector] filter: OK
  14799. 970.19 s [vector] +++ OK, passed 100 tests.
  14800. 970.19 s [vector] ifilter: OK
  14801. 970.19 s [vector] +++ OK, passed 100 tests.
  14802. 970.22 s [vector] filterM: OK (0.04s)
  14803. 970.22 s [vector] +++ OK, passed 100 tests.
  14804. 970.23 s [vector] uniq: OK
  14805. 970.23 s [vector] +++ OK, passed 100 tests.
  14806. 970.23 s [vector] mapMaybe: OK
  14807. 970.23 s [vector] +++ OK, passed 100 tests.
  14808. 970.23 s [vector] imapMaybe: OK
  14809. 970.23 s [vector] +++ OK, passed 100 tests.
  14810. 970.23 s [vector] takeWhile: OK
  14811. 970.24 s [vector] +++ OK, passed 100 tests.
  14812. 970.24 s [vector] dropWhile: OK
  14813. 970.24 s [vector] +++ OK, passed 100 tests.
  14814. 970.24 s [vector] partition: OK
  14815. 970.25 s [vector] +++ OK, passed 100 tests.
  14816. 970.25 s [vector] partitionWith: OK
  14817. 970.25 s [vector] +++ OK, passed 100 tests.
  14818. 970.25 s [vector] span: OK
  14819. 970.25 s [vector] +++ OK, passed 100 tests.
  14820. 970.25 s [vector] break: OK
  14821. 970.25 s [vector] +++ OK, passed 100 tests.
  14822. 970.25 s [vector] spanR: OK
  14823. 970.25 s [vector] +++ OK, passed 100 tests.
  14824. 970.25 s [vector] breakR: OK
  14825. 970.25 s [vector] +++ OK, passed 100 tests.
  14826. 970.25 s [vector] groupBy: OK
  14827. 970.25 s [vector] +++ OK, passed 100 tests.
  14828. 970.25 s [vector] elem: OK
  14829. 970.25 s [vector] +++ OK, passed 100 tests.
  14830. 970.25 s [vector] notElem: OK
  14831. 970.25 s [vector] +++ OK, passed 100 tests.
  14832. 970.25 s [vector] find: OK
  14833. 970.25 s [vector] +++ OK, passed 100 tests.
  14834. 970.25 s [vector] findIndex: OK
  14835. 970.25 s [vector] +++ OK, passed 100 tests.
  14836. 970.26 s [vector] findIndexR: OK
  14837. 970.26 s [vector] +++ OK, passed 100 tests.
  14838. 970.26 s [vector] findIndices: OK
  14839. 970.26 s [vector] +++ OK, passed 100 tests.
  14840. 970.26 s [vector] elemIndex: OK
  14841. 970.26 s [vector] +++ OK, passed 100 tests.
  14842. 970.27 s [vector] elemIndices: OK
  14843. 970.27 s [vector] +++ OK, passed 100 tests.
  14844. 970.27 s [vector] foldl: OK
  14845. 970.27 s [vector] +++ OK, passed 100 tests.
  14846. 970.28 s [vector] foldl1: OK
  14847. 970.28 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14848. 970.28 s [vector] foldl': OK
  14849. 970.28 s [vector] +++ OK, passed 100 tests.
  14850. 970.29 s [vector] foldl1': OK
  14851. 970.29 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14852. 970.30 s [vector] foldr: OK
  14853. 970.31 s [vector] +++ OK, passed 100 tests.
  14854. 970.31 s [vector] foldr1: OK
  14855. 970.32 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14856. 970.32 s [vector] foldr': OK
  14857. 970.32 s [vector] +++ OK, passed 100 tests.
  14858. 970.32 s [vector] foldr1': OK
  14859. 970.32 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14860. 970.33 s [vector] ifoldl: OK
  14861. 970.33 s [vector] +++ OK, passed 100 tests.
  14862. 970.33 s [vector] ifoldl': OK
  14863. 970.33 s [vector] +++ OK, passed 100 tests.
  14864. 970.35 s [vector] ifoldr: OK
  14865. 970.35 s [vector] +++ OK, passed 100 tests.
  14866. 970.35 s [vector] ifoldr': OK
  14867. 970.36 s [vector] +++ OK, passed 100 tests.
  14868. 970.37 s [vector] ifoldM: OK
  14869. 970.37 s [vector] +++ OK, passed 100 tests.
  14870. 970.37 s [vector] ifoldM': OK
  14871. 970.37 s [vector] +++ OK, passed 100 tests.
  14872. 970.39 s [vector] ifoldM_: OK (0.03s)
  14873. 970.39 s [vector] +++ OK, passed 100 tests.
  14874. 970.43 s [vector] ifoldM'_: OK (0.02s)
  14875. 970.43 s [vector] +++ OK, passed 100 tests.
  14876. 970.43 s [vector] all: OK
  14877. 970.43 s [vector] +++ OK, passed 100 tests.
  14878. 970.43 s [vector] any: OK
  14879. 970.43 s [vector] +++ OK, passed 100 tests.
  14880. 970.44 s [vector] prescanl: OK
  14881. 970.44 s [vector] +++ OK, passed 100 tests.
  14882. 970.44 s [vector] prescanl': OK
  14883. 970.44 s [vector] +++ OK, passed 100 tests.
  14884. 970.46 s [vector] postscanl: OK (0.01s)
  14885. 970.46 s [vector] +++ OK, passed 100 tests.
  14886. 970.46 s [vector] postscanl': OK
  14887. 970.46 s [vector] +++ OK, passed 100 tests.
  14888. 970.47 s [vector] scanl: OK
  14889. 970.47 s [vector] +++ OK, passed 100 tests.
  14890. 970.48 s [vector] scanl': OK
  14891. 970.49 s [vector] +++ OK, passed 100 tests.
  14892. 970.49 s [vector] scanl1: OK
  14893. 970.49 s [vector] +++ OK, passed 100 tests.
  14894. 970.49 s [vector] scanl1': OK
  14895. 970.49 s [vector] +++ OK, passed 100 tests.
  14896. 970.50 s [vector] iscanl: OK
  14897. 970.50 s [vector] +++ OK, passed 100 tests.
  14898. 970.50 s [vector] iscanl': OK
  14899. 970.50 s [vector] +++ OK, passed 100 tests.
  14900. 970.51 s [vector] prescanr: OK
  14901. 970.51 s [vector] +++ OK, passed 100 tests.
  14902. 970.52 s [vector] prescanr': OK
  14903. 970.52 s [vector] +++ OK, passed 100 tests.
  14904. 970.53 s [vector] postscanr: OK
  14905. 970.53 s [vector] +++ OK, passed 100 tests.
  14906. 970.54 s [vector] postscanr': OK
  14907. 970.54 s [vector] +++ OK, passed 100 tests.
  14908. 970.54 s [vector] scanr: OK
  14909. 970.55 s [vector] +++ OK, passed 100 tests.
  14910. 970.55 s [vector] scanr': OK
  14911. 970.55 s [vector] +++ OK, passed 100 tests.
  14912. 970.56 s [vector] scanr1: OK
  14913. 970.56 s [vector] +++ OK, passed 100 tests.
  14914. 970.57 s [vector] scanr1': OK
  14915. 970.57 s [vector] +++ OK, passed 100 tests.
  14916. 970.58 s [vector] iscanr: OK
  14917. 970.58 s [vector] +++ OK, passed 100 tests.
  14918. 970.58 s [vector] iscanr': OK
  14919. 970.58 s [vector] +++ OK, passed 100 tests.
  14920. 970.58 s [vector] mut_read: OK
  14921. 970.58 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14922. 970.58 s [vector] mut_write: OK
  14923. 970.58 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14924. 970.59 s [vector] mut_modify: OK
  14925. 970.59 s [vector] +++ OK, passed 100 tests; 19 discarded.
  14926. 970.60 s [vector] mut_generate: OK
  14927. 970.60 s [vector] +++ OK, passed 100 tests.
  14928. 970.61 s [vector] mut_generateM: OK (0.02s)
  14929. 970.61 s [vector] +++ OK, passed 100 tests.
  14930. 970.63 s [vector] mut_mapM_: OK (0.03s)
  14931. 970.63 s [vector] +++ OK, passed 100 tests.
  14932. 970.69 s [vector] mut_imapM_: OK (0.04s)
  14933. 970.69 s [vector] +++ OK, passed 100 tests.
  14934. 970.71 s [vector] mut_forM_: OK (0.04s)
  14935. 970.71 s [vector] +++ OK, passed 100 tests.
  14936. 970.75 s [vector] mut_iforM_: OK (0.03s)
  14937. 970.75 s [vector] +++ OK, passed 100 tests.
  14938. 970.75 s [vector] mut_foldr: OK
  14939. 970.76 s [vector] +++ OK, passed 100 tests.
  14940. 970.76 s [vector] mut_foldr': OK
  14941. 970.76 s [vector] +++ OK, passed 100 tests.
  14942. 970.77 s [vector] mut_foldl: OK
  14943. 970.77 s [vector] +++ OK, passed 100 tests.
  14944. 970.77 s [vector] mut_foldl': OK
  14945. 970.77 s [vector] +++ OK, passed 100 tests.
  14946. 970.78 s [vector] mut_ifoldr: OK
  14947. 970.79 s [vector] +++ OK, passed 100 tests.
  14948. 970.79 s [vector] mut_ifoldr': OK
  14949. 970.79 s [vector] +++ OK, passed 100 tests.
  14950. 970.79 s [vector] mut_ifoldl: OK
  14951. 970.80 s [vector] +++ OK, passed 100 tests.
  14952. 970.81 s [vector] mut_ifoldl': OK
  14953. 970.81 s [vector] +++ OK, passed 100 tests.
  14954. 970.81 s [vector] mut_foldM: OK
  14955. 970.81 s [vector] +++ OK, passed 100 tests.
  14956. 970.82 s [vector] mut_foldM': OK
  14957. 970.82 s [vector] +++ OK, passed 100 tests.
  14958. 970.83 s [vector] mut_foldrM: OK
  14959. 970.83 s [vector] +++ OK, passed 100 tests.
  14960. 970.83 s [vector] mut_foldrM': OK
  14961. 970.84 s [vector] +++ OK, passed 100 tests.
  14962. 970.84 s [vector] mut_ifoldM: OK
  14963. 970.85 s [vector] +++ OK, passed 100 tests.
  14964. 970.85 s [vector] mut_ifoldM': OK
  14965. 970.85 s [vector] +++ OK, passed 100 tests.
  14966. 970.86 s [vector] mut_ifoldrM: OK
  14967. 970.86 s [vector] +++ OK, passed 100 tests.
  14968. 970.86 s [vector] mut_ifoldrM': OK
  14969. 970.86 s [vector] +++ OK, passed 100 tests.
  14970. 970.86 s [vector] compare: OK
  14971. 970.86 s [vector] +++ OK, passed 100 tests.
  14972. 970.86 s [vector] maximum: OK
  14973. 970.86 s [vector] +++ OK, passed 100 tests; 22 discarded.
  14974. 970.86 s [vector] minimum: OK
  14975. 970.86 s [vector] +++ OK, passed 100 tests; 24 discarded.
  14976. 970.86 s [vector] minIndex: OK
  14977. 970.86 s [vector] +++ OK, passed 100 tests; 11 discarded.
  14978. 970.87 s [vector] maxIndex: OK
  14979. 970.87 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14980. 970.87 s [vector] maximumBy: OK
  14981. 970.87 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14982. 970.87 s [vector] minimumBy: OK
  14983. 970.87 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14984. 970.87 s [vector] maximumOn: OK
  14985. 970.87 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14986. 970.87 s [vector] minimumOn: OK
  14987. 970.87 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14988. 970.87 s [vector] maxIndexBy: OK
  14989. 970.87 s [vector] +++ OK, passed 100 tests; 12 discarded.
  14990. 970.87 s [vector] minIndexBy: OK
  14991. 970.87 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14992. 970.87 s [vector] ListFirstMaxIndexWins: OK
  14993. 970.87 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14994. 970.87 s [vector] FalseListFirstMaxIndexWins: OK
  14995. 970.87 s [vector] +++ OK, failed as expected. (after 1 test):
  14996. 970.87 s [vector] Exception:
  14997. 970.87 s [vector] Prelude.foldr1: empty list
  14998. 970.87 s [vector] CallStack (from HasCallStack):
  14999. 970.87 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  15000. 970.87 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  15001. 970.87 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  15002. 970.87 s [vector] []
  15003. 970.87 s [vector] zip: OK
  15004. 970.88 s [vector] +++ OK, passed 100 tests.
  15005. 970.88 s [vector] zip3: OK
  15006. 970.88 s [vector] +++ OK, passed 100 tests.
  15007. 970.88 s [vector] unzip: OK
  15008. 970.88 s [vector] +++ OK, passed 100 tests.
  15009. 970.88 s [vector] unzip3: OK
  15010. 970.88 s [vector] +++ OK, passed 100 tests.
  15011. 970.88 s [vector] indexed: OK
  15012. 970.88 s [vector] +++ OK, passed 100 tests.
  15013. 970.89 s [vector] update: OK
  15014. 970.89 s [vector] +++ OK, passed 100 tests.
  15015. 970.89 s [vector] mempty: OK
  15016. 970.89 s [vector] +++ OK, passed 100 tests.
  15017. 970.89 s [vector] mappend: OK
  15018. 970.89 s [vector] +++ OK, passed 100 tests.
  15019. 970.91 s [vector] mconcat: OK (0.03s)
  15020. 970.91 s [vector] +++ OK, passed 100 tests.
  15021. 970.91 s [vector] glength: OK
  15022. 970.91 s [vector] +++ OK, passed 100 tests.
  15023. 970.91 s [vector] sum: OK
  15024. 970.91 s [vector] +++ OK, passed 100 tests.
  15025. 970.92 s [vector] product: OK
  15026. 970.92 s [vector] +++ OK, passed 100 tests.
  15027. 970.92 s [vector] enumFromN: OK
  15028. 970.92 s [vector] +++ OK, passed 100 tests.
  15029. 970.92 s [vector] enumFromThenN: OK
  15030. 970.92 s [vector] +++ OK, passed 100 tests.
  15031. 970.92 s [vector] enumFromTo: OK
  15032. 970.92 s [vector] +++ OK, passed 100 tests.
  15033. 970.92 s [vector] enumFromThenTo: OK
  15034. 970.92 s [vector] +++ OK, passed 100 tests; 4 discarded.
  15035. 970.92 s [vector] (Double)
  15036. 970.92 s [vector] fromList.toList == id: OK
  15037. 970.92 s [vector] +++ OK, passed 100 tests.
  15038. 970.92 s [vector] toList.fromList == id: OK
  15039. 970.92 s [vector] +++ OK, passed 100 tests.
  15040. 970.92 s [vector] unstream.stream == id: OK
  15041. 970.92 s [vector] +++ OK, passed 100 tests.
  15042. 970.92 s [vector] stream.unstream == id: OK
  15043. 970.92 s [vector] +++ OK, passed 100 tests.
  15044. 970.92 s [vector] eq: OK
  15045. 970.92 s [vector] +++ OK, passed 100 tests.
  15046. 970.92 s [vector] length: OK
  15047. 970.92 s [vector] +++ OK, passed 100 tests.
  15048. 970.92 s [vector] null: OK
  15049. 970.92 s [vector] +++ OK, passed 100 tests.
  15050. 970.92 s [vector] index: OK
  15051. 970.92 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15052. 970.93 s [vector] safeIndex: OK
  15053. 970.93 s [vector] +++ OK, passed 100 tests.
  15054. 970.93 s [vector] head: OK
  15055. 970.93 s [vector] +++ OK, passed 100 tests; 18 discarded.
  15056. 970.93 s [vector] last: OK
  15057. 970.93 s [vector] +++ OK, passed 100 tests; 17 discarded.
  15058. 970.93 s [vector] unsafeIndex: OK
  15059. 970.93 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15060. 970.93 s [vector] unsafeHead: OK
  15061. 970.93 s [vector] +++ OK, passed 100 tests; 18 discarded.
  15062. 970.93 s [vector] unsafeLast: OK
  15063. 970.93 s [vector] +++ OK, passed 100 tests; 17 discarded.
  15064. 970.93 s [vector] slice: OK
  15065. 970.93 s [vector] +++ OK, passed 100 tests.
  15066. 970.93 s [vector] init: OK
  15067. 970.93 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15068. 970.93 s [vector] tail: OK
  15069. 970.93 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15070. 970.93 s [vector] take: OK
  15071. 970.93 s [vector] +++ OK, passed 100 tests.
  15072. 970.93 s [vector] drop: OK
  15073. 970.93 s [vector] +++ OK, passed 100 tests.
  15074. 970.93 s [vector] splitAt: OK
  15075. 970.93 s [vector] +++ OK, passed 100 tests.
  15076. 970.93 s [vector] empty: OK
  15077. 970.93 s [vector] +++ OK, passed 100 tests.
  15078. 970.94 s [vector] singleton: OK
  15079. 970.94 s [vector] +++ OK, passed 100 tests.
  15080. 970.94 s [vector] replicate: OK
  15081. 970.94 s [vector] +++ OK, passed 100 tests.
  15082. 970.94 s [vector] generate: OK
  15083. 970.94 s [vector] +++ OK, passed 100 tests.
  15084. 970.94 s [vector] iterateN: OK
  15085. 970.95 s [vector] +++ OK, passed 100 tests.
  15086. 970.97 s [vector] iterateNM: OK (0.02s)
  15087. 970.97 s [vector] +++ OK, passed 100 tests.
  15088. 970.99 s [vector] generateM: OK (0.02s)
  15089. 970.99 s [vector] +++ OK, passed 100 tests.
  15090. 970.99 s [vector] replicateM: OK (0.01s)
  15091. 970.99 s [vector] +++ OK, passed 100 tests.
  15092. 970.99 s [vector] create: OK
  15093. 970.99 s [vector] +++ OK, passed 100 tests.
  15094. 970.99 s [vector] createT: OK
  15095. 970.99 s [vector] +++ OK, passed 100 tests.
  15096. 970.99 s [vector] unfoldr: OK
  15097. 970.99 s [vector] +++ OK, passed 100 tests.
  15098. 970.99 s [vector] unfoldrN: OK
  15099. 970.99 s [vector] +++ OK, passed 100 tests.
  15100. 971.00 s [vector] unfoldrExactN: OK
  15101. 971.00 s [vector] +++ OK, passed 100 tests.
  15102. 971.01 s [vector] unfoldrM: OK
  15103. 971.01 s [vector] +++ OK, passed 100 tests.
  15104. 971.01 s [vector] unfoldrNM: OK
  15105. 971.01 s [vector] +++ OK, passed 100 tests.
  15106. 971.02 s [vector] unfoldrExactNM: OK (0.01s)
  15107. 971.02 s [vector] +++ OK, passed 100 tests.
  15108. 971.03 s [vector] constructN: OK (0.01s)
  15109. 971.03 s [vector] +++ OK, passed 100 tests.
  15110. 971.03 s [vector] constructrN: OK
  15111. 971.03 s [vector] +++ OK, passed 100 tests.
  15112. 971.04 s [vector] cons: OK
  15113. 971.04 s [vector] +++ OK, passed 100 tests.
  15114. 971.04 s [vector] snoc: OK
  15115. 971.04 s [vector] +++ OK, passed 100 tests.
  15116. 971.04 s [vector] append: OK
  15117. 971.05 s [vector] +++ OK, passed 100 tests.
  15118. 971.06 s [vector] concat: OK (0.02s)
  15119. 971.06 s [vector] +++ OK, passed 100 tests.
  15120. 971.06 s [vector] force: OK
  15121. 971.06 s [vector] +++ OK, passed 100 tests.
  15122. 971.06 s [vector] upd: OK
  15123. 971.06 s [vector] +++ OK, passed 100 tests.
  15124. 971.08 s [vector] accum: OK (0.01s)
  15125. 971.08 s [vector] +++ OK, passed 100 tests.
  15126. 971.08 s [vector] reverse: OK
  15127. 971.08 s [vector] +++ OK, passed 100 tests.
  15128. 971.08 s [vector] backpermute: OK
  15129. 971.08 s [vector] +++ OK, passed 100 tests.
  15130. 971.09 s [vector] map: OK
  15131. 971.09 s [vector] +++ OK, passed 100 tests.
  15132. 971.09 s [vector] imap: OK
  15133. 971.09 s [vector] +++ OK, passed 100 tests.
  15134. 971.10 s [vector] concatMap: OK
  15135. 971.10 s [vector] +++ OK, passed 100 tests.
  15136. 971.11 s [vector] mapM: OK
  15137. 971.11 s [vector] +++ OK, passed 100 tests.
  15138. 971.14 s [vector] mapM_: OK (0.03s)
  15139. 971.14 s [vector] +++ OK, passed 100 tests.
  15140. 971.15 s [vector] forM: OK
  15141. 971.15 s [vector] +++ OK, passed 100 tests.
  15142. 971.19 s [vector] forM_: OK (0.03s)
  15143. 971.19 s [vector] +++ OK, passed 100 tests.
  15144. 971.19 s [vector] imapM: OK
  15145. 971.19 s [vector] +++ OK, passed 100 tests.
  15146. 971.23 s [vector] imapM_: OK (0.04s)
  15147. 971.23 s [vector] +++ OK, passed 100 tests.
  15148. 971.24 s [vector] zipWith: OK
  15149. 971.25 s [vector] +++ OK, passed 100 tests.
  15150. 971.25 s [vector] zipWith3: OK (0.01s)
  15151. 971.25 s [vector] +++ OK, passed 100 tests.
  15152. 971.25 s [vector] izipWith: OK
  15153. 971.26 s [vector] +++ OK, passed 100 tests.
  15154. 971.27 s [vector] izipWith3: OK (0.01s)
  15155. 971.27 s [vector] +++ OK, passed 100 tests.
  15156. 971.29 s [vector] izipWithM: OK
  15157. 971.29 s [vector] +++ OK, passed 100 tests.
  15158. 971.31 s [vector] izipWithM_: OK (0.03s)
  15159. 971.31 s [vector] +++ OK, passed 100 tests.
  15160. 971.33 s [vector] zipWithM: OK (0.01s)
  15161. 971.33 s [vector] +++ OK, passed 100 tests.
  15162. 971.34 s [vector] zipWithM_: OK (0.02s)
  15163. 971.35 s [vector] +++ OK, passed 100 tests.
  15164. 971.35 s [vector] filter: OK
  15165. 971.35 s [vector] +++ OK, passed 100 tests.
  15166. 971.35 s [vector] ifilter: OK
  15167. 971.35 s [vector] +++ OK, passed 100 tests.
  15168. 971.39 s [vector] filterM: OK (0.04s)
  15169. 971.39 s [vector] +++ OK, passed 100 tests.
  15170. 971.39 s [vector] uniq: OK
  15171. 971.39 s [vector] +++ OK, passed 100 tests.
  15172. 971.40 s [vector] mapMaybe: OK
  15173. 971.40 s [vector] +++ OK, passed 100 tests.
  15174. 971.40 s [vector] imapMaybe: OK
  15175. 971.40 s [vector] +++ OK, passed 100 tests.
  15176. 971.40 s [vector] takeWhile: OK
  15177. 971.40 s [vector] +++ OK, passed 100 tests.
  15178. 971.40 s [vector] dropWhile: OK
  15179. 971.40 s [vector] +++ OK, passed 100 tests.
  15180. 971.41 s [vector] partition: OK
  15181. 971.41 s [vector] +++ OK, passed 100 tests.
  15182. 971.42 s [vector] partitionWith: OK
  15183. 971.42 s [vector] +++ OK, passed 100 tests.
  15184. 971.42 s [vector] span: OK
  15185. 971.42 s [vector] +++ OK, passed 100 tests.
  15186. 971.42 s [vector] break: OK
  15187. 971.42 s [vector] +++ OK, passed 100 tests.
  15188. 971.42 s [vector] spanR: OK
  15189. 971.42 s [vector] +++ OK, passed 100 tests.
  15190. 971.42 s [vector] breakR: OK
  15191. 971.43 s [vector] +++ OK, passed 100 tests.
  15192. 971.43 s [vector] groupBy: OK
  15193. 971.43 s [vector] +++ OK, passed 100 tests.
  15194. 971.43 s [vector] elem: OK
  15195. 971.43 s [vector] +++ OK, passed 100 tests.
  15196. 971.43 s [vector] notElem: OK
  15197. 971.43 s [vector] +++ OK, passed 100 tests.
  15198. 971.44 s [vector] find: OK
  15199. 971.44 s [vector] +++ OK, passed 100 tests.
  15200. 971.44 s [vector] findIndex: OK
  15201. 971.44 s [vector] +++ OK, passed 100 tests.
  15202. 971.44 s [vector] findIndexR: OK
  15203. 971.44 s [vector] +++ OK, passed 100 tests.
  15204. 971.44 s [vector] findIndices: OK
  15205. 971.44 s [vector] +++ OK, passed 100 tests.
  15206. 971.44 s [vector] elemIndex: OK
  15207. 971.44 s [vector] +++ OK, passed 100 tests.
  15208. 971.44 s [vector] elemIndices: OK
  15209. 971.45 s [vector] +++ OK, passed 100 tests.
  15210. 971.47 s [vector] foldl: OK (0.01s)
  15211. 971.47 s [vector] +++ OK, passed 100 tests.
  15212. 971.47 s [vector] foldl1: OK (0.01s)
  15213. 971.47 s [vector] +++ OK, passed 100 tests; 19 discarded.
  15214. 971.49 s [vector] foldl': OK (0.01s)
  15215. 971.49 s [vector] +++ OK, passed 100 tests.
  15216. 971.51 s [vector] foldl1': OK (0.01s)
  15217. 971.51 s [vector] +++ OK, passed 100 tests; 18 discarded.
  15218. 971.51 s [vector] foldr: OK (0.01s)
  15219. 971.51 s [vector] +++ OK, passed 100 tests.
  15220. 971.53 s [vector] foldr1: OK (0.01s)
  15221. 971.53 s [vector] +++ OK, passed 100 tests; 12 discarded.
  15222. 971.54 s [vector] foldr': OK (0.01s)
  15223. 971.54 s [vector] +++ OK, passed 100 tests.
  15224. 971.55 s [vector] foldr1': OK (0.02s)
  15225. 971.55 s [vector] +++ OK, passed 100 tests; 13 discarded.
  15226. 971.57 s [vector] ifoldl: OK (0.01s)
  15227. 971.57 s [vector] +++ OK, passed 100 tests.
  15228. 971.58 s [vector] ifoldl': OK (0.01s)
  15229. 971.58 s [vector] +++ OK, passed 100 tests.
  15230. 971.59 s [vector] ifoldr: OK (0.01s)
  15231. 971.59 s [vector] +++ OK, passed 100 tests.
  15232. 971.59 s [vector] ifoldr': OK
  15233. 971.59 s [vector] +++ OK, passed 100 tests.
  15234. 971.61 s [vector] ifoldM: OK (0.01s)
  15235. 971.61 s [vector] +++ OK, passed 100 tests.
  15236. 971.63 s [vector] ifoldM': OK (0.01s)
  15237. 971.63 s [vector] +++ OK, passed 100 tests.
  15238. 971.65 s [vector] ifoldM_: OK (0.03s)
  15239. 971.65 s [vector] +++ OK, passed 100 tests.
  15240. 971.68 s [vector] ifoldM'_: OK (0.03s)
  15241. 971.68 s [vector] +++ OK, passed 100 tests.
  15242. 971.68 s [vector] all: OK
  15243. 971.68 s [vector] +++ OK, passed 100 tests.
  15244. 971.68 s [vector] any: OK
  15245. 971.68 s [vector] +++ OK, passed 100 tests.
  15246. 971.71 s [vector] prescanl: OK (0.01s)
  15247. 971.71 s [vector] +++ OK, passed 100 tests.
  15248. 971.72 s [vector] prescanl': OK (0.01s)
  15249. 971.72 s [vector] +++ OK, passed 100 tests.
  15250. 971.73 s [vector] postscanl: OK (0.01s)
  15251. 971.73 s [vector] +++ OK, passed 100 tests.
  15252. 971.75 s [vector] postscanl': OK (0.01s)
  15253. 971.75 s [vector] +++ OK, passed 100 tests.
  15254. 971.75 s [vector] scanl: OK (0.01s)
  15255. 971.75 s [vector] +++ OK, passed 100 tests.
  15256. 971.77 s [vector] scanl': OK (0.01s)
  15257. 971.77 s [vector] +++ OK, passed 100 tests.
  15258. 971.78 s [vector] scanl1: OK (0.01s)
  15259. 971.79 s [vector] +++ OK, passed 100 tests.
  15260. 971.79 s [vector] scanl1': OK (0.01s)
  15261. 971.79 s [vector] +++ OK, passed 100 tests.
  15262. 971.81 s [vector] iscanl: OK (0.01s)
  15263. 971.81 s [vector] +++ OK, passed 100 tests.
  15264. 971.81 s [vector] iscanl': OK (0.01s)
  15265. 971.81 s [vector] +++ OK, passed 100 tests.
  15266. 971.83 s [vector] prescanr: OK (0.01s)
  15267. 971.83 s [vector] +++ OK, passed 100 tests.
  15268. 971.84 s [vector] prescanr': OK (0.01s)
  15269. 971.84 s [vector] +++ OK, passed 100 tests.
  15270. 971.85 s [vector] postscanr: OK (0.01s)
  15271. 971.85 s [vector] +++ OK, passed 100 tests.
  15272. 971.87 s [vector] postscanr': OK (0.01s)
  15273. 971.87 s [vector] +++ OK, passed 100 tests.
  15274. 971.87 s [vector] scanr: OK (0.01s)
  15275. 971.87 s [vector] +++ OK, passed 100 tests.
  15276. 971.89 s [vector] scanr': OK (0.01s)
  15277. 971.89 s [vector] +++ OK, passed 100 tests.
  15278. 971.90 s [vector] scanr1: OK (0.01s)
  15279. 971.90 s [vector] +++ OK, passed 100 tests.
  15280. 971.91 s [vector] scanr1': OK (0.01s)
  15281. 971.91 s [vector] +++ OK, passed 100 tests.
  15282. 971.92 s [vector] iscanr: OK (0.01s)
  15283. 971.92 s [vector] +++ OK, passed 100 tests.
  15284. 971.93 s [vector] iscanr': OK (0.01s)
  15285. 971.93 s [vector] +++ OK, passed 100 tests.
  15286. 971.93 s [vector] mut_read: OK
  15287. 971.93 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15288. 971.93 s [vector] mut_write: OK
  15289. 971.93 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15290. 971.93 s [vector] mut_modify: OK
  15291. 971.93 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15292. 971.93 s [vector] mut_generate: OK
  15293. 971.93 s [vector] +++ OK, passed 100 tests.
  15294. 971.95 s [vector] mut_generateM: OK (0.02s)
  15295. 971.95 s [vector] +++ OK, passed 100 tests.
  15296. 971.99 s [vector] mut_mapM_: OK (0.03s)
  15297. 971.99 s [vector] +++ OK, passed 100 tests.
  15298. 972.03 s [vector] mut_imapM_: OK (0.03s)
  15299. 972.03 s [vector] +++ OK, passed 100 tests.
  15300. 972.05 s [vector] mut_forM_: OK (0.03s)
  15301. 972.05 s [vector] +++ OK, passed 100 tests.
  15302. 972.08 s [vector] mut_iforM_: OK (0.04s)
  15303. 972.08 s [vector] +++ OK, passed 100 tests.
  15304. 972.10 s [vector] mut_foldr: OK
  15305. 972.10 s [vector] +++ OK, passed 100 tests.
  15306. 972.11 s [vector] mut_foldr': OK (0.01s)
  15307. 972.11 s [vector] +++ OK, passed 100 tests.
  15308. 972.13 s [vector] mut_foldl: OK (0.01s)
  15309. 972.13 s [vector] +++ OK, passed 100 tests.
  15310. 972.13 s [vector] mut_foldl': OK (0.01s)
  15311. 972.13 s [vector] +++ OK, passed 100 tests.
  15312. 972.15 s [vector] mut_ifoldr: OK (0.01s)
  15313. 972.15 s [vector] +++ OK, passed 100 tests.
  15314. 972.15 s [vector] mut_ifoldr': OK (0.01s)
  15315. 972.15 s [vector] +++ OK, passed 100 tests.
  15316. 972.17 s [vector] mut_ifoldl: OK
  15317. 972.17 s [vector] +++ OK, passed 100 tests.
  15318. 972.19 s [vector] mut_ifoldl': OK (0.01s)
  15319. 972.19 s [vector] +++ OK, passed 100 tests.
  15320. 972.19 s [vector] mut_foldM: OK (0.01s)
  15321. 972.19 s [vector] +++ OK, passed 100 tests.
  15322. 972.21 s [vector] mut_foldM': OK (0.01s)
  15323. 972.21 s [vector] +++ OK, passed 100 tests.
  15324. 972.21 s [vector] mut_foldrM: OK (0.01s)
  15325. 972.21 s [vector] +++ OK, passed 100 tests.
  15326. 972.23 s [vector] mut_foldrM': OK (0.01s)
  15327. 972.23 s [vector] +++ OK, passed 100 tests.
  15328. 972.25 s [vector] mut_ifoldM: OK (0.01s)
  15329. 972.25 s [vector] +++ OK, passed 100 tests.
  15330. 972.25 s [vector] mut_ifoldM': OK (0.01s)
  15331. 972.25 s [vector] +++ OK, passed 100 tests.
  15332. 972.27 s [vector] mut_ifoldrM: OK (0.01s)
  15333. 972.27 s [vector] +++ OK, passed 100 tests.
  15334. 972.27 s [vector] mut_ifoldrM': OK (0.01s)
  15335. 972.27 s [vector] +++ OK, passed 100 tests.
  15336. 972.27 s [vector] compare: OK
  15337. 972.27 s [vector] +++ OK, passed 100 tests.
  15338. 972.27 s [vector] maximum: OK
  15339. 972.27 s [vector] +++ OK, passed 100 tests; 23 discarded.
  15340. 972.27 s [vector] minimum: OK
  15341. 972.27 s [vector] +++ OK, passed 100 tests; 20 discarded.
  15342. 972.27 s [vector] minIndex: OK
  15343. 972.27 s [vector] +++ OK, passed 100 tests; 18 discarded.
  15344. 972.27 s [vector] maxIndex: OK
  15345. 972.27 s [vector] +++ OK, passed 100 tests; 19 discarded.
  15346. 972.27 s [vector] maximumBy: OK
  15347. 972.27 s [vector] +++ OK, passed 100 tests; 18 discarded.
  15348. 972.28 s [vector] minimumBy: OK
  15349. 972.28 s [vector] +++ OK, passed 100 tests; 21 discarded.
  15350. 972.28 s [vector] maximumOn: OK
  15351. 972.28 s [vector] +++ OK, passed 100 tests; 18 discarded.
  15352. 972.28 s [vector] minimumOn: OK
  15353. 972.28 s [vector] +++ OK, passed 100 tests; 22 discarded.
  15354. 972.28 s [vector] maxIndexBy: OK
  15355. 972.28 s [vector] +++ OK, passed 100 tests; 20 discarded.
  15356. 972.28 s [vector] minIndexBy: OK
  15357. 972.28 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15358. 972.28 s [vector] ListFirstMaxIndexWins: OK
  15359. 972.28 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15360. 972.28 s [vector] FalseListFirstMaxIndexWins: OK
  15361. 972.28 s [vector] +++ OK, failed as expected. (after 1 test):
  15362. 972.28 s [vector] Exception:
  15363. 972.28 s [vector] Prelude.foldr1: empty list
  15364. 972.28 s [vector] CallStack (from HasCallStack):
  15365. 972.28 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  15366. 972.28 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  15367. 972.28 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  15368. 972.28 s [vector] []
  15369. 972.28 s [vector] zip: OK
  15370. 972.28 s [vector] +++ OK, passed 100 tests.
  15371. 972.29 s [vector] zip3: OK
  15372. 972.29 s [vector] +++ OK, passed 100 tests.
  15373. 972.29 s [vector] unzip: OK
  15374. 972.29 s [vector] +++ OK, passed 100 tests.
  15375. 972.29 s [vector] unzip3: OK
  15376. 972.29 s [vector] +++ OK, passed 100 tests.
  15377. 972.29 s [vector] indexed: OK
  15378. 972.29 s [vector] +++ OK, passed 100 tests.
  15379. 972.29 s [vector] update: OK
  15380. 972.29 s [vector] +++ OK, passed 100 tests.
  15381. 972.29 s [vector] mempty: OK
  15382. 972.29 s [vector] +++ OK, passed 100 tests.
  15383. 972.31 s [vector] mappend: OK
  15384. 972.31 s [vector] +++ OK, passed 100 tests.
  15385. 972.32 s [vector] mconcat: OK (0.02s)
  15386. 972.32 s [vector] +++ OK, passed 100 tests.
  15387. 972.32 s [vector] glength: OK
  15388. 972.32 s [vector] +++ OK, passed 100 tests.
  15389. 972.32 s [vector] sum: OK
  15390. 972.32 s [vector] +++ OK, passed 100 tests.
  15391. 972.32 s [vector] product: OK
  15392. 972.32 s [vector] +++ OK, passed 100 tests.
  15393. 972.32 s [vector] enumFromN: OK
  15394. 972.32 s [vector] +++ OK, passed 100 tests.
  15395. 972.32 s [vector] enumFromThenN: OK
  15396. 972.32 s [vector] +++ OK, passed 100 tests.
  15397. 972.32 s [vector] enumFromTo: OK
  15398. 972.32 s [vector] +++ OK, passed 100 tests.
  15399. 972.32 s [vector] enumFromThenTo: OK
  15400. 972.32 s [vector] +++ OK, passed 100 tests; 3 discarded.
  15401. 972.32 s [vector] (Int,Bool)
  15402. 972.32 s [vector] fromList.toList == id: OK
  15403. 972.32 s [vector] +++ OK, passed 100 tests.
  15404. 972.32 s [vector] toList.fromList == id: OK
  15405. 972.32 s [vector] +++ OK, passed 100 tests.
  15406. 972.32 s [vector] unstream.stream == id: OK
  15407. 972.32 s [vector] +++ OK, passed 100 tests.
  15408. 972.32 s [vector] stream.unstream == id: OK
  15409. 972.32 s [vector] +++ OK, passed 100 tests.
  15410. 972.32 s [vector] eq: OK
  15411. 972.33 s [vector] +++ OK, passed 100 tests.
  15412. 972.33 s [vector] length: OK
  15413. 972.33 s [vector] +++ OK, passed 100 tests.
  15414. 972.33 s [vector] null: OK
  15415. 972.33 s [vector] +++ OK, passed 100 tests.
  15416. 972.33 s [vector] index: OK
  15417. 972.33 s [vector] +++ OK, passed 100 tests; 19 discarded.
  15418. 972.33 s [vector] safeIndex: OK
  15419. 972.33 s [vector] +++ OK, passed 100 tests.
  15420. 972.33 s [vector] head: OK
  15421. 972.33 s [vector] +++ OK, passed 100 tests; 12 discarded.
  15422. 972.33 s [vector] last: OK
  15423. 972.33 s [vector] +++ OK, passed 100 tests; 13 discarded.
  15424. 972.33 s [vector] unsafeIndex: OK
  15425. 972.33 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15426. 972.33 s [vector] unsafeHead: OK
  15427. 972.33 s [vector] +++ OK, passed 100 tests; 20 discarded.
  15428. 972.33 s [vector] unsafeLast: OK
  15429. 972.34 s [vector] +++ OK, passed 100 tests; 17 discarded.
  15430. 972.34 s [vector] slice: OK
  15431. 972.34 s [vector] +++ OK, passed 100 tests.
  15432. 972.34 s [vector] init: OK
  15433. 972.34 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15434. 972.34 s [vector] tail: OK
  15435. 972.34 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15436. 972.34 s [vector] take: OK
  15437. 972.34 s [vector] +++ OK, passed 100 tests.
  15438. 972.34 s [vector] drop: OK
  15439. 972.34 s [vector] +++ OK, passed 100 tests.
  15440. 972.35 s [vector] splitAt: OK
  15441. 972.35 s [vector] +++ OK, passed 100 tests.
  15442. 972.37 s [vector] empty: OK
  15443. 972.37 s [vector] +++ OK, passed 100 tests.
  15444. 972.37 s [vector] singleton: OK
  15445. 972.37 s [vector] +++ OK, passed 100 tests.
  15446. 972.37 s [vector] replicate: OK
  15447. 972.37 s [vector] +++ OK, passed 100 tests.
  15448. 972.38 s [vector] generate: OK
  15449. 972.38 s [vector] +++ OK, passed 100 tests.
  15450. 972.38 s [vector] iterateN: OK
  15451. 972.38 s [vector] +++ OK, passed 100 tests.
  15452. 972.38 s [vector] iterateNM: OK
  15453. 972.38 s [vector] +++ OK, passed 100 tests.
  15454. 972.39 s [vector] generateM: OK (0.03s)
  15455. 972.39 s [vector] +++ OK, passed 100 tests.
  15456. 972.40 s [vector] replicateM: OK (0.01s)
  15457. 972.40 s [vector] +++ OK, passed 100 tests.
  15458. 972.40 s [vector] create: OK
  15459. 972.40 s [vector] +++ OK, passed 100 tests.
  15460. 972.40 s [vector] createT: OK
  15461. 972.40 s [vector] +++ OK, passed 100 tests.
  15462. 972.40 s [vector] unfoldr: OK
  15463. 972.40 s [vector] +++ OK, passed 100 tests.
  15464. 972.41 s [vector] unfoldrN: OK
  15465. 972.41 s [vector] +++ OK, passed 100 tests.
  15466. 972.41 s [vector] unfoldrExactN: OK
  15467. 972.41 s [vector] +++ OK, passed 100 tests.
  15468. 972.41 s [vector] unfoldrM: OK
  15469. 972.41 s [vector] +++ OK, passed 100 tests.
  15470. 972.41 s [vector] unfoldrNM: OK
  15471. 972.41 s [vector] +++ OK, passed 100 tests.
  15472. 972.44 s [vector] unfoldrExactNM: OK (0.02s)
  15473. 972.44 s [vector] +++ OK, passed 100 tests.
  15474. 972.44 s [vector] constructN: OK
  15475. 972.45 s [vector] +++ OK, passed 100 tests.
  15476. 972.45 s [vector] constructrN: OK
  15477. 972.45 s [vector] +++ OK, passed 100 tests.
  15478. 972.45 s [vector] cons: OK
  15479. 972.45 s [vector] +++ OK, passed 100 tests.
  15480. 972.45 s [vector] snoc: OK
  15481. 972.45 s [vector] +++ OK, passed 100 tests.
  15482. 972.45 s [vector] append: OK
  15483. 972.47 s [vector] +++ OK, passed 100 tests.
  15484. 972.49 s [vector] concat: OK (0.04s)
  15485. 972.49 s [vector] +++ OK, passed 100 tests.
  15486. 972.49 s [vector] force: OK
  15487. 972.49 s [vector] +++ OK, passed 100 tests.
  15488. 972.49 s [vector] upd: OK
  15489. 972.49 s [vector] +++ OK, passed 100 tests.
  15490. 972.50 s [vector] accum: OK
  15491. 972.50 s [vector] +++ OK, passed 100 tests.
  15492. 972.50 s [vector] reverse: OK
  15493. 972.50 s [vector] +++ OK, passed 100 tests.
  15494. 972.50 s [vector] backpermute: OK
  15495. 972.50 s [vector] +++ OK, passed 100 tests.
  15496. 972.51 s [vector] map: OK
  15497. 972.51 s [vector] +++ OK, passed 100 tests.
  15498. 972.52 s [vector] imap: OK
  15499. 972.52 s [vector] +++ OK, passed 100 tests.
  15500. 972.52 s [vector] concatMap: OK
  15501. 972.52 s [vector] +++ OK, passed 100 tests.
  15502. 972.52 s [vector] mapM: OK
  15503. 972.52 s [vector] +++ OK, passed 100 tests.
  15504. 972.55 s [vector] mapM_: OK (0.03s)
  15505. 972.55 s [vector] +++ OK, passed 100 tests.
  15506. 972.57 s [vector] forM: OK
  15507. 972.57 s [vector] +++ OK, passed 100 tests.
  15508. 972.58 s [vector] forM_: OK (0.03s)
  15509. 972.58 s [vector] +++ OK, passed 100 tests.
  15510. 972.59 s [vector] imapM: OK
  15511. 972.59 s [vector] +++ OK, passed 100 tests.
  15512. 972.62 s [vector] imapM_: OK (0.03s)
  15513. 972.62 s [vector] +++ OK, passed 100 tests.
  15514. 972.62 s [vector] zipWith: OK
  15515. 972.62 s [vector] +++ OK, passed 100 tests.
  15516. 972.62 s [vector] zipWith3: OK
  15517. 972.62 s [vector] +++ OK, passed 100 tests.
  15518. 972.63 s [vector] izipWith: OK
  15519. 972.63 s [vector] +++ OK, passed 100 tests.
  15520. 972.63 s [vector] izipWith3: OK
  15521. 972.63 s [vector] +++ OK, passed 100 tests.
  15522. 972.63 s [vector] izipWithM: OK
  15523. 972.63 s [vector] +++ OK, passed 100 tests.
  15524. 972.66 s [vector] izipWithM_: OK (0.02s)
  15525. 972.66 s [vector] +++ OK, passed 100 tests.
  15526. 972.66 s [vector] zipWithM: OK
  15527. 972.67 s [vector] +++ OK, passed 100 tests.
  15528. 972.68 s [vector] zipWithM_: OK (0.02s)
  15529. 972.68 s [vector] +++ OK, passed 100 tests.
  15530. 972.69 s [vector] filter: OK
  15531. 972.69 s [vector] +++ OK, passed 100 tests.
  15532. 972.69 s [vector] ifilter: OK
  15533. 972.69 s [vector] +++ OK, passed 100 tests.
  15534. 972.72 s [vector] filterM: OK (0.03s)
  15535. 972.72 s [vector] +++ OK, passed 100 tests.
  15536. 972.72 s [vector] uniq: OK
  15537. 972.72 s [vector] +++ OK, passed 100 tests.
  15538. 972.72 s [vector] mapMaybe: OK
  15539. 972.72 s [vector] +++ OK, passed 100 tests.
  15540. 972.73 s [vector] imapMaybe: OK
  15541. 972.73 s [vector] +++ OK, passed 100 tests.
  15542. 972.73 s [vector] takeWhile: OK
  15543. 972.73 s [vector] +++ OK, passed 100 tests.
  15544. 972.73 s [vector] dropWhile: OK
  15545. 972.73 s [vector] +++ OK, passed 100 tests.
  15546. 972.74 s [vector] partition: OK
  15547. 972.74 s [vector] +++ OK, passed 100 tests.
  15548. 972.74 s [vector] partitionWith: OK
  15549. 972.74 s [vector] +++ OK, passed 100 tests.
  15550. 972.74 s [vector] span: OK
  15551. 972.74 s [vector] +++ OK, passed 100 tests.
  15552. 972.74 s [vector] break: OK
  15553. 972.74 s [vector] +++ OK, passed 100 tests.
  15554. 972.74 s [vector] spanR: OK
  15555. 972.75 s [vector] +++ OK, passed 100 tests.
  15556. 972.75 s [vector] breakR: OK
  15557. 972.75 s [vector] +++ OK, passed 100 tests.
  15558. 972.75 s [vector] groupBy: OK
  15559. 972.75 s [vector] +++ OK, passed 100 tests.
  15560. 972.76 s [vector] elem: OK
  15561. 972.76 s [vector] +++ OK, passed 100 tests.
  15562. 972.76 s [vector] notElem: OK
  15563. 972.76 s [vector] +++ OK, passed 100 tests.
  15564. 972.76 s [vector] find: OK
  15565. 972.76 s [vector] +++ OK, passed 100 tests.
  15566. 972.76 s [vector] findIndex: OK
  15567. 972.76 s [vector] +++ OK, passed 100 tests.
  15568. 972.76 s [vector] findIndexR: OK
  15569. 972.76 s [vector] +++ OK, passed 100 tests.
  15570. 972.76 s [vector] findIndices: OK
  15571. 972.76 s [vector] +++ OK, passed 100 tests.
  15572. 972.76 s [vector] elemIndex: OK
  15573. 972.76 s [vector] +++ OK, passed 100 tests.
  15574. 972.76 s [vector] elemIndices: OK
  15575. 972.77 s [vector] +++ OK, passed 100 tests.
  15576. 972.77 s [vector] foldl: OK
  15577. 972.77 s [vector] +++ OK, passed 100 tests.
  15578. 972.77 s [vector] foldl1: OK
  15579. 972.77 s [vector] +++ OK, passed 100 tests; 13 discarded.
  15580. 972.77 s [vector] foldl': OK
  15581. 972.77 s [vector] +++ OK, passed 100 tests.
  15582. 972.78 s [vector] foldl1': OK
  15583. 972.78 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15584. 972.78 s [vector] foldr: OK
  15585. 972.78 s [vector] +++ OK, passed 100 tests.
  15586. 972.79 s [vector] foldr1: OK
  15587. 972.79 s [vector] +++ OK, passed 100 tests; 13 discarded.
  15588. 972.79 s [vector] foldr': OK
  15589. 972.79 s [vector] +++ OK, passed 100 tests.
  15590. 972.79 s [vector] foldr1': OK
  15591. 972.79 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15592. 972.80 s [vector] ifoldl: OK
  15593. 972.80 s [vector] +++ OK, passed 100 tests.
  15594. 972.80 s [vector] ifoldl': OK
  15595. 972.80 s [vector] +++ OK, passed 100 tests.
  15596. 972.81 s [vector] ifoldr: OK
  15597. 972.81 s [vector] +++ OK, passed 100 tests.
  15598. 972.81 s [vector] ifoldr': OK
  15599. 972.81 s [vector] +++ OK, passed 100 tests.
  15600. 972.81 s [vector] ifoldM: OK
  15601. 972.82 s [vector] +++ OK, passed 100 tests.
  15602. 972.83 s [vector] ifoldM': OK
  15603. 972.83 s [vector] +++ OK, passed 100 tests.
  15604. 972.85 s [vector] ifoldM_: OK (0.02s)
  15605. 972.85 s [vector] +++ OK, passed 100 tests.
  15606. 972.86 s [vector] ifoldM'_: OK (0.02s)
  15607. 972.86 s [vector] +++ OK, passed 100 tests.
  15608. 972.86 s [vector] all: OK
  15609. 972.86 s [vector] +++ OK, passed 100 tests.
  15610. 972.87 s [vector] any: OK
  15611. 972.87 s [vector] +++ OK, passed 100 tests.
  15612. 972.87 s [vector] prescanl: OK
  15613. 972.87 s [vector] +++ OK, passed 100 tests.
  15614. 972.88 s [vector] prescanl': OK
  15615. 972.88 s [vector] +++ OK, passed 100 tests.
  15616. 972.88 s [vector] postscanl: OK
  15617. 972.88 s [vector] +++ OK, passed 100 tests.
  15618. 972.88 s [vector] postscanl': OK
  15619. 972.88 s [vector] +++ OK, passed 100 tests.
  15620. 972.89 s [vector] scanl: OK
  15621. 972.89 s [vector] +++ OK, passed 100 tests.
  15622. 972.89 s [vector] scanl': OK
  15623. 972.89 s [vector] +++ OK, passed 100 tests.
  15624. 972.90 s [vector] scanl1: OK
  15625. 972.90 s [vector] +++ OK, passed 100 tests.
  15626. 972.91 s [vector] scanl1': OK
  15627. 972.91 s [vector] +++ OK, passed 100 tests.
  15628. 972.91 s [vector] iscanl: OK
  15629. 972.91 s [vector] +++ OK, passed 100 tests.
  15630. 972.92 s [vector] iscanl': OK
  15631. 972.92 s [vector] +++ OK, passed 100 tests.
  15632. 972.92 s [vector] prescanr: OK
  15633. 972.92 s [vector] +++ OK, passed 100 tests.
  15634. 972.93 s [vector] prescanr': OK
  15635. 972.93 s [vector] +++ OK, passed 100 tests.
  15636. 972.94 s [vector] postscanr: OK
  15637. 972.94 s [vector] +++ OK, passed 100 tests.
  15638. 972.94 s [vector] postscanr': OK
  15639. 972.94 s [vector] +++ OK, passed 100 tests.
  15640. 972.94 s [vector] scanr: OK
  15641. 972.94 s [vector] +++ OK, passed 100 tests.
  15642. 972.94 s [vector] scanr': OK
  15643. 972.95 s [vector] +++ OK, passed 100 tests.
  15644. 972.95 s [vector] scanr1: OK
  15645. 972.95 s [vector] +++ OK, passed 100 tests.
  15646. 972.95 s [vector] scanr1': OK
  15647. 972.95 s [vector] +++ OK, passed 100 tests.
  15648. 972.96 s [vector] iscanr: OK
  15649. 972.96 s [vector] +++ OK, passed 100 tests.
  15650. 972.96 s [vector] iscanr': OK
  15651. 972.96 s [vector] +++ OK, passed 100 tests.
  15652. 972.96 s [vector] mut_read: OK
  15653. 972.96 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15654. 972.96 s [vector] mut_write: OK
  15655. 972.96 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15656. 972.97 s [vector] mut_modify: OK
  15657. 972.97 s [vector] +++ OK, passed 100 tests; 13 discarded.
  15658. 972.97 s [vector] mut_generate: OK
  15659. 972.97 s [vector] +++ OK, passed 100 tests.
  15660. 972.99 s [vector] mut_generateM: OK (0.02s)
  15661. 972.99 s [vector] +++ OK, passed 100 tests.
  15662. 973.03 s [vector] mut_mapM_: OK (0.02s)
  15663. 973.03 s [vector] +++ OK, passed 100 tests.
  15664. 973.05 s [vector] mut_imapM_: OK (0.02s)
  15665. 973.05 s [vector] +++ OK, passed 100 tests.
  15666. 973.07 s [vector] mut_forM_: OK (0.02s)
  15667. 973.07 s [vector] +++ OK, passed 100 tests.
  15668. 973.09 s [vector] mut_iforM_: OK (0.03s)
  15669. 973.09 s [vector] +++ OK, passed 100 tests.
  15670. 973.09 s [vector] mut_foldr: OK
  15671. 973.10 s [vector] +++ OK, passed 100 tests.
  15672. 973.10 s [vector] mut_foldr': OK
  15673. 973.11 s [vector] +++ OK, passed 100 tests.
  15674. 973.11 s [vector] mut_foldl: OK
  15675. 973.12 s [vector] +++ OK, passed 100 tests.
  15676. 973.12 s [vector] mut_foldl': OK
  15677. 973.12 s [vector] +++ OK, passed 100 tests.
  15678. 973.12 s [vector] mut_ifoldr: OK
  15679. 973.13 s [vector] +++ OK, passed 100 tests.
  15680. 973.13 s [vector] mut_ifoldr': OK
  15681. 973.13 s [vector] +++ OK, passed 100 tests.
  15682. 973.13 s [vector] mut_ifoldl: OK
  15683. 973.13 s [vector] +++ OK, passed 100 tests.
  15684. 973.13 s [vector] mut_ifoldl': OK
  15685. 973.13 s [vector] +++ OK, passed 100 tests.
  15686. 973.13 s [vector] mut_foldM: OK
  15687. 973.13 s [vector] +++ OK, passed 100 tests.
  15688. 973.13 s [vector] mut_foldM': OK
  15689. 973.13 s [vector] +++ OK, passed 100 tests.
  15690. 973.13 s [vector] mut_foldrM: OK
  15691. 973.13 s [vector] +++ OK, passed 100 tests.
  15692. 973.13 s [vector] mut_foldrM': OK
  15693. 973.14 s [vector] +++ OK, passed 100 tests.
  15694. 973.14 s [vector] mut_ifoldM: OK
  15695. 973.15 s [vector] +++ OK, passed 100 tests.
  15696. 973.15 s [vector] mut_ifoldM': OK
  15697. 973.15 s [vector] +++ OK, passed 100 tests.
  15698. 973.15 s [vector] mut_ifoldrM: OK
  15699. 973.15 s [vector] +++ OK, passed 100 tests.
  15700. 973.15 s [vector] mut_ifoldrM': OK
  15701. 973.15 s [vector] +++ OK, passed 100 tests.
  15702. 973.15 s [vector] compare: OK
  15703. 973.15 s [vector] +++ OK, passed 100 tests.
  15704. 973.15 s [vector] maximum: OK
  15705. 973.15 s [vector] +++ OK, passed 100 tests; 12 discarded.
  15706. 973.15 s [vector] minimum: OK
  15707. 973.15 s [vector] +++ OK, passed 100 tests; 17 discarded.
  15708. 973.15 s [vector] minIndex: OK
  15709. 973.15 s [vector] +++ OK, passed 100 tests; 11 discarded.
  15710. 973.15 s [vector] maxIndex: OK
  15711. 973.15 s [vector] +++ OK, passed 100 tests; 18 discarded.
  15712. 973.15 s [vector] maximumBy: OK
  15713. 973.15 s [vector] +++ OK, passed 100 tests; 19 discarded.
  15714. 973.15 s [vector] minimumBy: OK
  15715. 973.16 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15716. 973.16 s [vector] maximumOn: OK
  15717. 973.16 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15718. 973.16 s [vector] minimumOn: OK
  15719. 973.16 s [vector] +++ OK, passed 100 tests; 17 discarded.
  15720. 973.16 s [vector] maxIndexBy: OK
  15721. 973.16 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15722. 973.16 s [vector] minIndexBy: OK
  15723. 973.16 s [vector] +++ OK, passed 100 tests; 12 discarded.
  15724. 973.16 s [vector] ListFirstMaxIndexWins: OK
  15725. 973.16 s [vector] +++ OK, passed 100 tests; 18 discarded.
  15726. 973.16 s [vector] FalseListFirstMaxIndexWins: OK
  15727. 973.16 s [vector] +++ OK, failed as expected. (after 1 test):
  15728. 973.16 s [vector] Exception:
  15729. 973.16 s [vector] Prelude.foldr1: empty list
  15730. 973.16 s [vector] CallStack (from HasCallStack):
  15731. 973.16 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  15732. 973.16 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  15733. 973.16 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  15734. 973.16 s [vector] []
  15735. 973.16 s [vector] zip: OK
  15736. 973.16 s [vector] +++ OK, passed 100 tests.
  15737. 973.16 s [vector] zip3: OK
  15738. 973.16 s [vector] +++ OK, passed 100 tests.
  15739. 973.17 s [vector] unzip: OK
  15740. 973.17 s [vector] +++ OK, passed 100 tests.
  15741. 973.17 s [vector] unzip3: OK
  15742. 973.17 s [vector] +++ OK, passed 100 tests.
  15743. 973.17 s [vector] indexed: OK
  15744. 973.17 s [vector] +++ OK, passed 100 tests.
  15745. 973.17 s [vector] update: OK
  15746. 973.18 s [vector] +++ OK, passed 100 tests.
  15747. 973.18 s [vector] mempty: OK
  15748. 973.18 s [vector] +++ OK, passed 100 tests.
  15749. 973.19 s [vector] mappend: OK
  15750. 973.19 s [vector] +++ OK, passed 100 tests.
  15751. 973.21 s [vector] mconcat: OK (0.03s)
  15752. 973.22 s [vector] +++ OK, passed 100 tests.
  15753. 973.22 s [vector] glength: OK
  15754. 973.22 s [vector] +++ OK, passed 100 tests.
  15755. 973.22 s [vector] (Int,Bool,Int)
  15756. 973.22 s [vector] fromList.toList == id: OK
  15757. 973.22 s [vector] +++ OK, passed 100 tests.
  15758. 973.22 s [vector] toList.fromList == id: OK
  15759. 973.22 s [vector] +++ OK, passed 100 tests.
  15760. 973.22 s [vector] unstream.stream == id: OK
  15761. 973.22 s [vector] +++ OK, passed 100 tests.
  15762. 973.22 s [vector] stream.unstream == id: OK
  15763. 973.22 s [vector] +++ OK, passed 100 tests.
  15764. 973.22 s [vector] eq: OK
  15765. 973.22 s [vector] +++ OK, passed 100 tests.
  15766. 973.22 s [vector] length: OK
  15767. 973.22 s [vector] +++ OK, passed 100 tests.
  15768. 973.22 s [vector] null: OK
  15769. 973.23 s [vector] +++ OK, passed 100 tests.
  15770. 973.23 s [vector] index: OK
  15771. 973.23 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15772. 973.23 s [vector] safeIndex: OK
  15773. 973.23 s [vector] +++ OK, passed 100 tests.
  15774. 973.23 s [vector] head: OK
  15775. 973.23 s [vector] +++ OK, passed 100 tests; 17 discarded.
  15776. 973.23 s [vector] last: OK
  15777. 973.23 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15778. 973.23 s [vector] unsafeIndex: OK
  15779. 973.23 s [vector] +++ OK, passed 100 tests; 13 discarded.
  15780. 973.23 s [vector] unsafeHead: OK
  15781. 973.23 s [vector] +++ OK, passed 100 tests; 18 discarded.
  15782. 973.23 s [vector] unsafeLast: OK
  15783. 973.23 s [vector] +++ OK, passed 100 tests; 12 discarded.
  15784. 973.23 s [vector] slice: OK
  15785. 973.23 s [vector] +++ OK, passed 100 tests.
  15786. 973.23 s [vector] init: OK
  15787. 973.24 s [vector] +++ OK, passed 100 tests; 19 discarded.
  15788. 973.24 s [vector] tail: OK
  15789. 973.24 s [vector] +++ OK, passed 100 tests; 13 discarded.
  15790. 973.24 s [vector] take: OK
  15791. 973.24 s [vector] +++ OK, passed 100 tests.
  15792. 973.24 s [vector] drop: OK
  15793. 973.24 s [vector] +++ OK, passed 100 tests.
  15794. 973.24 s [vector] splitAt: OK
  15795. 973.24 s [vector] +++ OK, passed 100 tests.
  15796. 973.24 s [vector] empty: OK
  15797. 973.24 s [vector] +++ OK, passed 100 tests.
  15798. 973.24 s [vector] singleton: OK
  15799. 973.24 s [vector] +++ OK, passed 100 tests.
  15800. 973.24 s [vector] replicate: OK
  15801. 973.24 s [vector] +++ OK, passed 100 tests.
  15802. 973.25 s [vector] generate: OK
  15803. 973.25 s [vector] +++ OK, passed 100 tests.
  15804. 973.25 s [vector] iterateN: OK
  15805. 973.25 s [vector] +++ OK, passed 100 tests.
  15806. 973.27 s [vector] iterateNM: OK (0.02s)
  15807. 973.27 s [vector] +++ OK, passed 100 tests.
  15808. 973.31 s [vector] generateM: OK (0.04s)
  15809. 973.31 s [vector] +++ OK, passed 100 tests.
  15810. 973.33 s [vector] replicateM: OK (0.01s)
  15811. 973.33 s [vector] +++ OK, passed 100 tests.
  15812. 973.33 s [vector] create: OK
  15813. 973.33 s [vector] +++ OK, passed 100 tests.
  15814. 973.33 s [vector] createT: OK
  15815. 973.33 s [vector] +++ OK, passed 100 tests.
  15816. 973.33 s [vector] unfoldr: OK
  15817. 973.33 s [vector] +++ OK, passed 100 tests.
  15818. 973.33 s [vector] unfoldrN: OK
  15819. 973.33 s [vector] +++ OK, passed 100 tests.
  15820. 973.33 s [vector] unfoldrExactN: OK
  15821. 973.33 s [vector] +++ OK, passed 100 tests.
  15822. 973.33 s [vector] unfoldrM: OK
  15823. 973.33 s [vector] +++ OK, passed 100 tests.
  15824. 973.33 s [vector] unfoldrNM: OK
  15825. 973.33 s [vector] +++ OK, passed 100 tests.
  15826. 973.37 s [vector] unfoldrExactNM: OK (0.02s)
  15827. 973.37 s [vector] +++ OK, passed 100 tests.
  15828. 973.37 s [vector] constructN: OK
  15829. 973.37 s [vector] +++ OK, passed 100 tests.
  15830. 973.38 s [vector] constructrN: OK
  15831. 973.38 s [vector] +++ OK, passed 100 tests.
  15832. 973.38 s [vector] cons: OK
  15833. 973.38 s [vector] +++ OK, passed 100 tests.
  15834. 973.39 s [vector] snoc: OK
  15835. 973.39 s [vector] +++ OK, passed 100 tests.
  15836. 973.39 s [vector] append: OK
  15837. 973.39 s [vector] +++ OK, passed 100 tests.
  15838. 973.43 s [vector] concat: OK (0.05s)
  15839. 973.44 s [vector] +++ OK, passed 100 tests.
  15840. 973.45 s [vector] force: OK
  15841. 973.45 s [vector] +++ OK, passed 100 tests.
  15842. 973.46 s [vector] upd: OK
  15843. 973.47 s [vector] +++ OK, passed 100 tests.
  15844. 973.47 s [vector] accum: OK
  15845. 973.47 s [vector] +++ OK, passed 100 tests.
  15846. 973.47 s [vector] reverse: OK
  15847. 973.47 s [vector] +++ OK, passed 100 tests.
  15848. 973.47 s [vector] backpermute: OK
  15849. 973.47 s [vector] +++ OK, passed 100 tests.
  15850. 973.47 s [vector] map: OK
  15851. 973.47 s [vector] +++ OK, passed 100 tests.
  15852. 973.47 s [vector] imap: OK
  15853. 973.47 s [vector] +++ OK, passed 100 tests.
  15854. 973.48 s [vector] concatMap: OK
  15855. 973.48 s [vector] +++ OK, passed 100 tests.
  15856. 973.48 s [vector] mapM: OK
  15857. 973.48 s [vector] +++ OK, passed 100 tests.
  15858. 973.53 s [vector] mapM_: OK (0.03s)
  15859. 973.53 s [vector] +++ OK, passed 100 tests.
  15860. 973.53 s [vector] forM: OK
  15861. 973.53 s [vector] +++ OK, passed 100 tests.
  15862. 973.57 s [vector] forM_: OK (0.04s)
  15863. 973.57 s [vector] +++ OK, passed 100 tests.
  15864. 973.57 s [vector] imapM: OK
  15865. 973.57 s [vector] +++ OK, passed 100 tests.
  15866. 973.62 s [vector] imapM_: OK (0.05s)
  15867. 973.62 s [vector] +++ OK, passed 100 tests.
  15868. 973.63 s [vector] zipWith: OK
  15869. 973.63 s [vector] +++ OK, passed 100 tests.
  15870. 973.63 s [vector] zipWith3: OK
  15871. 973.63 s [vector] +++ OK, passed 100 tests.
  15872. 973.64 s [vector] izipWith: OK
  15873. 973.64 s [vector] +++ OK, passed 100 tests.
  15874. 973.64 s [vector] izipWith3: OK
  15875. 973.64 s [vector] +++ OK, passed 100 tests.
  15876. 973.65 s [vector] izipWithM: OK
  15877. 973.65 s [vector] +++ OK, passed 100 tests.
  15878. 973.69 s [vector] izipWithM_: OK (0.03s)
  15879. 973.69 s [vector] +++ OK, passed 100 tests.
  15880. 973.69 s [vector] zipWithM: OK
  15881. 973.69 s [vector] +++ OK, passed 100 tests.
  15882. 973.72 s [vector] zipWithM_: OK (0.03s)
  15883. 973.72 s [vector] +++ OK, passed 100 tests.
  15884. 973.72 s [vector] filter: OK
  15885. 973.72 s [vector] +++ OK, passed 100 tests.
  15886. 973.73 s [vector] ifilter: OK
  15887. 973.73 s [vector] +++ OK, passed 100 tests.
  15888. 973.78 s [vector] filterM: OK (0.06s)
  15889. 973.79 s [vector] +++ OK, passed 100 tests.
  15890. 973.79 s [vector] uniq: OK
  15891. 973.79 s [vector] +++ OK, passed 100 tests.
  15892. 973.79 s [vector] mapMaybe: OK
  15893. 973.79 s [vector] +++ OK, passed 100 tests.
  15894. 973.80 s [vector] imapMaybe: OK
  15895. 973.80 s [vector] +++ OK, passed 100 tests.
  15896. 973.80 s [vector] takeWhile: OK
  15897. 973.80 s [vector] +++ OK, passed 100 tests.
  15898. 973.80 s [vector] dropWhile: OK
  15899. 973.80 s [vector] +++ OK, passed 100 tests.
  15900. 973.80 s [vector] partition: OK
  15901. 973.80 s [vector] +++ OK, passed 100 tests.
  15902. 973.81 s [vector] partitionWith: OK
  15903. 973.82 s [vector] +++ OK, passed 100 tests.
  15904. 973.82 s [vector] span: OK
  15905. 973.82 s [vector] +++ OK, passed 100 tests.
  15906. 973.83 s [vector] break: OK
  15907. 973.83 s [vector] +++ OK, passed 100 tests.
  15908. 973.83 s [vector] spanR: OK
  15909. 973.83 s [vector] +++ OK, passed 100 tests.
  15910. 973.83 s [vector] breakR: OK
  15911. 973.83 s [vector] +++ OK, passed 100 tests.
  15912. 973.83 s [vector] groupBy: OK
  15913. 973.83 s [vector] +++ OK, passed 100 tests.
  15914. 973.83 s [vector] elem: OK
  15915. 973.83 s [vector] +++ OK, passed 100 tests.
  15916. 973.83 s [vector] notElem: OK
  15917. 973.83 s [vector] +++ OK, passed 100 tests.
  15918. 973.84 s [vector] find: OK
  15919. 973.84 s [vector] +++ OK, passed 100 tests.
  15920. 973.84 s [vector] findIndex: OK
  15921. 973.84 s [vector] +++ OK, passed 100 tests.
  15922. 973.84 s [vector] findIndexR: OK
  15923. 973.84 s [vector] +++ OK, passed 100 tests.
  15924. 973.85 s [vector] findIndices: OK
  15925. 973.85 s [vector] +++ OK, passed 100 tests.
  15926. 973.85 s [vector] elemIndex: OK
  15927. 973.85 s [vector] +++ OK, passed 100 tests.
  15928. 973.85 s [vector] elemIndices: OK
  15929. 973.85 s [vector] +++ OK, passed 100 tests.
  15930. 973.85 s [vector] foldl: OK
  15931. 973.85 s [vector] +++ OK, passed 100 tests.
  15932. 973.85 s [vector] foldl1: OK
  15933. 973.85 s [vector] +++ OK, passed 100 tests; 18 discarded.
  15934. 973.86 s [vector] foldl': OK
  15935. 973.86 s [vector] +++ OK, passed 100 tests.
  15936. 973.86 s [vector] foldl1': OK
  15937. 973.86 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15938. 973.87 s [vector] foldr: OK
  15939. 973.87 s [vector] +++ OK, passed 100 tests.
  15940. 973.88 s [vector] foldr1: OK
  15941. 973.88 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15942. 973.88 s [vector] foldr': OK
  15943. 973.88 s [vector] +++ OK, passed 100 tests.
  15944. 973.89 s [vector] foldr1': OK
  15945. 973.89 s [vector] +++ OK, passed 100 tests; 17 discarded.
  15946. 973.89 s [vector] ifoldl: OK
  15947. 973.89 s [vector] +++ OK, passed 100 tests.
  15948. 973.90 s [vector] ifoldl': OK
  15949. 973.90 s [vector] +++ OK, passed 100 tests.
  15950. 974.05 s [vector] ifoldr: OK
  15951. 974.05 s [vector] +++ OK, passed 100 tests.
  15952. 974.05 s [vector] ifoldr': OK
  15953. 974.05 s [vector] +++ OK, passed 100 tests.
  15954. 974.05 s [vector] ifoldM: OK
  15955. 974.05 s [vector] +++ OK, passed 100 tests.
  15956. 974.05 s [vector] ifoldM': OK
  15957. 974.05 s [vector] +++ OK, passed 100 tests.
  15958. 974.05 s [vector] ifoldM_: OK (0.04s)
  15959. 974.05 s [vector] +++ OK, passed 100 tests.
  15960. 974.05 s [vector] ifoldM'_: OK (0.04s)
  15961. 974.05 s [vector] +++ OK, passed 100 tests.
  15962. 974.05 s [vector] all: OK
  15963. 974.05 s [vector] +++ OK, passed 100 tests.
  15964. 974.05 s [vector] any: OK
  15965. 974.05 s [vector] +++ OK, passed 100 tests.
  15966. 974.05 s [vector] prescanl: OK
  15967. 974.05 s [vector] +++ OK, passed 100 tests.
  15968. 974.05 s [vector] prescanl': OK
  15969. 974.05 s [vector] +++ OK, passed 100 tests.
  15970. 974.05 s [vector] postscanl: OK
  15971. 974.05 s [vector] +++ OK, passed 100 tests.
  15972. 974.05 s [vector] postscanl': OK
  15973. 974.05 s [vector] +++ OK, passed 100 tests.
  15974. 974.05 s [vector] scanl: OK
  15975. 974.05 s [vector] +++ OK, passed 100 tests.
  15976. 974.05 s [vector] scanl': OK
  15977. 974.05 s [vector] +++ OK, passed 100 tests.
  15978. 974.05 s [vector] scanl1: OK
  15979. 974.05 s [vector] +++ OK, passed 100 tests.
  15980. 974.07 s [vector] scanl1': OK
  15981. 974.07 s [vector] +++ OK, passed 100 tests.
  15982. 974.07 s [vector] iscanl: OK
  15983. 974.07 s [vector] +++ OK, passed 100 tests.
  15984. 974.07 s [vector] iscanl': OK
  15985. 974.07 s [vector] +++ OK, passed 100 tests.
  15986. 974.09 s [vector] prescanr: OK
  15987. 974.09 s [vector] +++ OK, passed 100 tests.
  15988. 974.09 s [vector] prescanr': OK
  15989. 974.09 s [vector] +++ OK, passed 100 tests.
  15990. 974.10 s [vector] postscanr: OK
  15991. 974.11 s [vector] +++ OK, passed 100 tests.
  15992. 974.12 s [vector] postscanr': OK
  15993. 974.12 s [vector] +++ OK, passed 100 tests.
  15994. 974.12 s [vector] scanr: OK (0.01s)
  15995. 974.13 s [vector] +++ OK, passed 100 tests.
  15996. 974.13 s [vector] scanr': OK
  15997. 974.13 s [vector] +++ OK, passed 100 tests.
  15998. 974.13 s [vector] scanr1: OK
  15999. 974.13 s [vector] +++ OK, passed 100 tests.
  16000. 974.14 s [vector] scanr1': OK
  16001. 974.14 s [vector] +++ OK, passed 100 tests.
  16002. 974.15 s [vector] iscanr: OK
  16003. 974.15 s [vector] +++ OK, passed 100 tests.
  16004. 974.15 s [vector] iscanr': OK
  16005. 974.15 s [vector] +++ OK, passed 100 tests.
  16006. 974.15 s [vector] mut_read: OK
  16007. 974.16 s [vector] +++ OK, passed 100 tests; 12 discarded.
  16008. 974.16 s [vector] mut_write: OK
  16009. 974.17 s [vector] +++ OK, passed 100 tests; 18 discarded.
  16010. 974.17 s [vector] mut_modify: OK
  16011. 974.17 s [vector] +++ OK, passed 100 tests; 13 discarded.
  16012. 974.17 s [vector] mut_generate: OK
  16013. 974.18 s [vector] +++ OK, passed 100 tests.
  16014. 974.19 s [vector] mut_generateM: OK (0.03s)
  16015. 974.19 s [vector] +++ OK, passed 100 tests.
  16016. 974.25 s [vector] mut_mapM_: OK (0.04s)
  16017. 974.25 s [vector] +++ OK, passed 100 tests.
  16018. 974.29 s [vector] mut_imapM_: OK (0.04s)
  16019. 974.29 s [vector] +++ OK, passed 100 tests.
  16020. 974.33 s [vector] mut_forM_: OK (0.04s)
  16021. 974.33 s [vector] +++ OK, passed 100 tests.
  16022. 974.37 s [vector] mut_iforM_: OK (0.05s)
  16023. 974.37 s [vector] +++ OK, passed 100 tests.
  16024. 974.37 s [vector] mut_foldr: OK
  16025. 974.38 s [vector] +++ OK, passed 100 tests.
  16026. 974.39 s [vector] mut_foldr': OK
  16027. 974.39 s [vector] +++ OK, passed 100 tests.
  16028. 974.39 s [vector] mut_foldl: OK
  16029. 974.39 s [vector] +++ OK, passed 100 tests.
  16030. 974.40 s [vector] mut_foldl': OK
  16031. 974.41 s [vector] +++ OK, passed 100 tests.
  16032. 974.41 s [vector] mut_ifoldr: OK
  16033. 974.41 s [vector] +++ OK, passed 100 tests.
  16034. 974.41 s [vector] mut_ifoldr': OK
  16035. 974.41 s [vector] +++ OK, passed 100 tests.
  16036. 974.42 s [vector] mut_ifoldl: OK
  16037. 974.43 s [vector] +++ OK, passed 100 tests.
  16038. 974.43 s [vector] mut_ifoldl': OK
  16039. 974.43 s [vector] +++ OK, passed 100 tests.
  16040. 974.43 s [vector] mut_foldM: OK
  16041. 974.43 s [vector] +++ OK, passed 100 tests.
  16042. 974.43 s [vector] mut_foldM': OK
  16043. 974.43 s [vector] +++ OK, passed 100 tests.
  16044. 974.43 s [vector] mut_foldrM: OK
  16045. 974.43 s [vector] +++ OK, passed 100 tests.
  16046. 974.43 s [vector] mut_foldrM': OK
  16047. 974.44 s [vector] +++ OK, passed 100 tests.
  16048. 974.45 s [vector] mut_ifoldM: OK
  16049. 974.45 s [vector] +++ OK, passed 100 tests.
  16050. 974.45 s [vector] mut_ifoldM': OK
  16051. 974.45 s [vector] +++ OK, passed 100 tests.
  16052. 974.46 s [vector] mut_ifoldrM: OK
  16053. 974.46 s [vector] +++ OK, passed 100 tests.
  16054. 974.46 s [vector] mut_ifoldrM': OK
  16055. 974.46 s [vector] +++ OK, passed 100 tests.
  16056. 974.46 s [vector] compare: OK
  16057. 974.46 s [vector] +++ OK, passed 100 tests.
  16058. 974.47 s [vector] maximum: OK
  16059. 974.47 s [vector] +++ OK, passed 100 tests; 14 discarded.
  16060. 974.47 s [vector] minimum: OK
  16061. 974.47 s [vector] +++ OK, passed 100 tests; 18 discarded.
  16062. 974.47 s [vector] minIndex: OK
  16063. 974.47 s [vector] +++ OK, passed 100 tests; 15 discarded.
  16064. 974.47 s [vector] maxIndex: OK
  16065. 974.47 s [vector] +++ OK, passed 100 tests; 16 discarded.
  16066. 974.47 s [vector] maximumBy: OK
  16067. 974.47 s [vector] +++ OK, passed 100 tests; 13 discarded.
  16068. 974.47 s [vector] minimumBy: OK
  16069. 974.47 s [vector] +++ OK, passed 100 tests; 18 discarded.
  16070. 974.47 s [vector] maximumOn: OK
  16071. 974.47 s [vector] +++ OK, passed 100 tests; 14 discarded.
  16072. 974.47 s [vector] minimumOn: OK
  16073. 974.47 s [vector] +++ OK, passed 100 tests; 13 discarded.
  16074. 974.48 s [vector] maxIndexBy: OK
  16075. 974.48 s [vector] +++ OK, passed 100 tests; 20 discarded.
  16076. 974.48 s [vector] minIndexBy: OK
  16077. 974.48 s [vector] +++ OK, passed 100 tests; 16 discarded.
  16078. 974.48 s [vector] ListFirstMaxIndexWins: OK
  16079. 974.48 s [vector] +++ OK, passed 100 tests; 20 discarded.
  16080. 974.48 s [vector] FalseListFirstMaxIndexWins: OK
  16081. 974.49 s [vector] +++ OK, failed as expected. (after 1 test):
  16082. 974.49 s [vector] Exception:
  16083. 974.49 s [vector] Prelude.foldr1: empty list
  16084. 974.49 s [vector] CallStack (from HasCallStack):
  16085. 974.49 s [vector] error, called at libraries/ghc-internal/src/GHC/Internal/List.hs:2030:3 in ghc-internal:GHC.Internal.List
  16086. 974.49 s [vector] errorEmptyList, called at libraries/ghc-internal/src/GHC/Internal/List.hs:705:30 in ghc-internal:GHC.Internal.List
  16087. 974.49 s [vector] foldr1, called at libraries/ghc-internal/src/GHC/Internal/Data/Foldable.hs:687:15 in ghc-internal:GHC.Internal.Data.Foldable
  16088. 974.49 s [vector] []
  16089. 974.49 s [vector] zip: OK
  16090. 974.49 s [vector] +++ OK, passed 100 tests.
  16091. 974.49 s [vector] zip3: OK
  16092. 974.50 s [vector] +++ OK, passed 100 tests.
  16093. 974.50 s [vector] unzip: OK
  16094. 974.50 s [vector] +++ OK, passed 100 tests.
  16095. 974.50 s [vector] unzip3: OK
  16096. 974.50 s [vector] +++ OK, passed 100 tests.
  16097. 974.50 s [vector] indexed: OK
  16098. 974.50 s [vector] +++ OK, passed 100 tests.
  16099. 974.51 s [vector] update: OK
  16100. 974.51 s [vector] +++ OK, passed 100 tests.
  16101. 974.51 s [vector] mempty: OK
  16102. 974.51 s [vector] +++ OK, passed 100 tests.
  16103. 974.51 s [vector] mappend: OK
  16104. 974.51 s [vector] +++ OK, passed 100 tests.
  16105. 974.56 s [vector] mconcat: OK (0.05s)
  16106. 974.56 s [vector] +++ OK, passed 100 tests.
  16107. 974.56 s [vector] glength: OK
  16108. 974.56 s [vector] +++ OK, passed 100 tests.
  16109. 974.56 s [vector] unstream
  16110. 974.56 s [vector] unstream == vunstream (exact): OK
  16111. 974.56 s [vector] +++ OK, passed 100 tests.
  16112. 974.56 s [vector] unstream == vunstream (unknown): OK
  16113. 974.56 s [vector] +++ OK, passed 100 tests.
  16114. 974.56 s [vector] unstreamR ~= vunstream (exact): OK
  16115. 974.56 s [vector] +++ OK, passed 100 tests.
  16116. 974.56 s [vector] unstreamR ~= vunstream (unknown): OK
  16117. 974.56 s [vector] +++ OK, passed 100 tests.
  16118. 974.56 s [vector] Data.Vector.Storable.Vector Alignment
  16119. 974.56 s [vector] Aligned Double: OK
  16120. 974.56 s [vector] Aligned Int: OK
  16121. 974.56 s [vector] Regression tests
  16122. 974.56 s [vector] enumFromTo crash #188
  16123. 974.56 s [vector] Word8: OK
  16124. 974.56 s [vector] Word16: OK
  16125. 974.56 s [vector] Word32: OK
  16126. 974.56 s [vector] Word64: OK
  16127. 974.56 s [vector] Word: OK
  16128. 974.56 s [vector] Int8: OK
  16129. 974.56 s [vector] Int16: OK
  16130. 974.56 s [vector] Int32: OK
  16131. 974.56 s [vector] Int64: OK
  16132. 974.56 s [vector] Int: OK
  16133. 974.57 s [vector] Char: OK
  16134. 974.57 s [vector] Negative tests
  16135. 974.57 s [vector] slice out of bounds #257
  16136. 974.57 s [vector] Boxed
  16137. 974.57 s [vector] Negative ix: OK
  16138. 974.57 s [vector] Negative size: OK
  16139. 974.57 s [vector] Negative ix and size: OK
  16140. 974.57 s [vector] Too large ix: OK
  16141. 974.57 s [vector] Too large size: OK
  16142. 974.57 s [vector] Too large ix and size: OK
  16143. 974.57 s [vector] Overflow: OK
  16144. 974.57 s [vector] OutOfMemory: OK
  16145. 974.57 s [vector] Primitive
  16146. 974.57 s [vector] Negative ix: OK
  16147. 974.57 s [vector] Negative size: OK
  16148. 974.57 s [vector] Negative ix and size: OK
  16149. 974.57 s [vector] Too large ix: OK
  16150. 974.57 s [vector] Too large size: OK
  16151. 974.57 s [vector] Too large ix and size: OK
  16152. 974.57 s [vector] Overflow: OK
  16153. 974.57 s [vector] OutOfMemory: OK
  16154. 974.57 s [vector] Storable
  16155. 974.57 s [vector] Negative ix: OK
  16156. 974.57 s [vector] Negative size: OK
  16157. 974.57 s [vector] Negative ix and size: OK
  16158. 974.57 s [vector] Too large ix: OK
  16159. 974.57 s [vector] Too large size: OK
  16160. 974.57 s [vector] Too large ix and size: OK
  16161. 974.57 s [vector] Overflow: OK
  16162. 974.57 s [vector] OutOfMemory: OK
  16163. 974.57 s [vector] Unboxed
  16164. 974.57 s [vector] Negative ix: OK
  16165. 974.57 s [vector] Negative size: OK
  16166. 974.57 s [vector] Negative ix and size: OK
  16167. 974.57 s [vector] Too large ix: OK
  16168. 974.57 s [vector] Too large size: OK
  16169. 974.57 s [vector] Too large ix and size: OK
  16170. 974.57 s [vector] Overflow: OK
  16171. 974.57 s [vector] OutOfMemory: OK
  16172. 974.57 s [vector] take #282
  16173. 974.57 s [vector] Boxed: OK
  16174. 974.57 s [vector] Primitive: OK
  16175. 974.57 s [vector] Storable: OK
  16176. 974.57 s [vector] Unboxed: OK
  16177. 974.57 s [vector] Data.Vector
  16178. 974.57 s [vector] MonadFix: OK
  16179. 974.57 s [vector] toFromArray: OK
  16180. 974.57 s [vector] toFromArraySlice: OK
  16181. 974.57 s [vector] toFromArraySliceUnsafe: OK
  16182. 974.57 s [vector] toFromMutableArray: OK
  16183. 974.57 s [vector] Data.Vector.Mutable (Move): OK
  16184. 974.57 s [vector] +++ OK, passed 100 tests; 23 discarded.
  16185. 974.57 s [vector] Data.Vector.Primitive.Mutable (Move): OK
  16186. 974.57 s [vector] +++ OK, passed 100 tests; 17 discarded.
  16187. 974.57 s [vector] Data.Vector.Unboxed.Mutable (Move): OK
  16188. 974.58 s [vector] +++ OK, passed 100 tests; 14 discarded.
  16189. 974.58 s [vector] Data.Vector.Storable.Mutable (Move): OK
  16190. 974.58 s [vector] +++ OK, passed 100 tests; 21 discarded.
  16191. 974.58 s [vector] Data.Vector.Generic.Mutable (nextPermutation): OK
  16192. 974.58 s [vector] +++ OK, passed 100 tests.
  16193. 974.58 s [vector] Data.Vector.Generic.Mutable (prevPermutation): OK
  16194. 974.58 s [vector] +++ OK, passed 100 tests.
  16195. 974.58 s [vector] Data.Vector.Generic.Mutable (nextPermutation then prevPermutation = id): OK
  16196. 974.58 s [vector] +++ OK, passed 100 tests.
  16197. 974.58 s [vector] Data.Vector.Generic.Mutable (prevPermutation then nextPermutation = id): OK
  16198. 974.58 s [vector] +++ OK, passed 100 tests.
  16199. 974.58 s [vector]
  16200. 974.58 s [vector] All 2808 tests passed (13.61s)
  16201. 974.59 s [vector] Test suite vector-tests-O2: PASS
  16202. 974.59 s [vector] Test suite logged to: dist/test/vector-0.13.2.0-vector-tests-O2.log
  16203. 974.59 s [vector] 2 of 2 test suites (2 of 2 test cases) passed.
  16204. 974.60 s [vector] Phase: haddockPhase
  16205. 974.60 s [vector] Phase: installPhase
  16206. 974.70 s [vector] Installing library in /nix/store/bbyrw13yswg4p9yknixq0criplfzk75i-vector-0.13.2.0/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-1e2a/vector-0.13.2.0-6XtMmq2Ff9ODcKEbpcqiG
  16207. 975.46 s [vector] Installing internal library benchmarks-O2 in /nix/store/bbyrw13yswg4p9yknixq0criplfzk75i-vector-0.13.2.0/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-1e2a/vector-0.13.2.0-LslaBhDvA2lAi0aUqn9WaN-benchmarks-O2
  16208. 975.80 s [vector] Phase: fixupPhase
  16209. 975.82 s [vector] shrinking RPATHs of ELF executables and libraries in /nix/store/bbyrw13yswg4p9yknixq0criplfzk75i-vector-0.13.2.0
  16210. 975.82 s [vector] shrinking /nix/store/bbyrw13yswg4p9yknixq0criplfzk75i-vector-0.13.2.0/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-1e2a/libHSvector-0.13.2.0-LslaBhDvA2lAi0aUqn9WaN-benchmarks-O2-ghc9.10.2.so
  16211. 975.83 s [vector] shrinking /nix/store/bbyrw13yswg4p9yknixq0criplfzk75i-vector-0.13.2.0/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-1e2a/libHSvector-0.13.2.0-6XtMmq2Ff9ODcKEbpcqiG-ghc9.10.2.so
  16212. 975.88 s [vector] checking for references to /build/ in /nix/store/bbyrw13yswg4p9yknixq0criplfzk75i-vector-0.13.2.0...
  16213. 975.95 s [vector] patching script interpreter paths in /nix/store/bbyrw13yswg4p9yknixq0criplfzk75i-vector-0.13.2.0
  16214. 975.95 s [vector] stripping (with command strip and flags -S -p) in /nix/store/bbyrw13yswg4p9yknixq0criplfzk75i-vector-0.13.2.0/lib
  16215. 976.94 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/bbyrw13yswg4p9yknixq0criplfzk75i-vector-0.13.2.0
  16216. 977.41 s [post-build-hook] Pushing 1 paths (97 are already present) using zstd to cache sellout ⏳
  16217. 977.41 s [post-build-hook]
  16218. 977.77 s [post-build-hook] Pushing /nix/store/bbyrw13yswg4p9yknixq0criplfzk75i-vector-0.13.2.0 (58.13 MiB)
  16219. 979.45 s [post-build-hook]
  16220. 979.45 s [post-build-hook] All done.
  16221. 979.46 s [post-build-hook] Uploading to the NixCI cache: /nix/store/bbyrw13yswg4p9yknixq0criplfzk75i-vector-0.13.2.0
  16222. 979.52 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  16223. 979.53 s [post-build-hook] copying 1 paths...
  16224. 979.53 s [post-build-hook] copying path '/nix/store/bbyrw13yswg4p9yknixq0criplfzk75i-vector-0.13.2.0' to 'https://cache.nix-ci.com'...
  16225. 993.85 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  16226. 994.03 s [post-build-hook] copying 1 paths...
  16227. 994.03 s [post-build-hook] copying path '/nix/store/l54v7jb93wxsnka80ly33hr8kr8903h2-vector-0.13.2.0.drv' to 'https://cache.nix-ci.com'...
  16228. 994.18 s Progress: 9 of 19 built, 177 of 177 downloaded from cache
  16229. 994.23 s Building nothunks
  16230. 994.39 s [nothunks] Phase: setupCompilerEnvironmentPhase
  16231. 994.40 s [nothunks] Build with /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2.
  16232. 994.63 s [nothunks] Phase: unpackPhase
  16233. 994.63 s [nothunks] unpacking source archive /nix/store/y2bnhvmx2j2igw7ad1jf22kp1dlk8pg2-nothunks-0.3.1.tar.gz
  16234. 994.64 s [nothunks] source root is nothunks-0.3.1
  16235. 994.64 s [nothunks] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "nothunks-0.3.1/test/Test/NoThunks/Class.hs"
  16236. 994.65 s [nothunks] Phase: patchPhase
  16237. 994.65 s [nothunks] Replace Cabal file with edited version from mirror://hackage/nothunks-0.3.1/revision/1.cabal.
  16238. 994.66 s [nothunks] Run jailbreak-cabal to lift version restrictions on build inputs.
  16239. 994.67 s [nothunks] Phase: compileBuildDriverPhase
  16240. 994.67 s [nothunks] setupCompileFlags: -package-db=/build/tmp.o7QfpQN5of/setup-package.conf.d -threaded
  16241. 994.73 s [nothunks] [1 of 2] Compiling Main ( /nix/store/4mdp8nhyfddh7bllbi7xszz7k9955n79-Setup.hs, /build/tmp.o7QfpQN5of/Main.o )
  16242. 994.78 s [nothunks] [2 of 2] Linking Setup
  16243. 996.32 s [nothunks] Phase: updateAutotoolsGnuConfigScriptsPhase
  16244. 996.39 s [nothunks] Phase: configurePhase
  16245. 996.47 s [nothunks] configureFlags: --verbose --prefix=/nix/store/j545lkl3cl3ydlg3r3yaql1n9wpap8iw-nothunks-0.3.1 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/jdnz15bpa8n2gdz9p1267irb5vr0b8km-nothunks-0.3.1-doc/share/doc/nothunks-0.3.1 --with-gcc=gcc --package-db=/build/tmp.o7QfpQN5of/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
  16246. 996.48 s [nothunks] Using Parsec parser
  16247. 996.48 s [nothunks] Configuring nothunks-0.3.1...
  16248. 996.82 s [nothunks] Flags chosen: bytestring=True, text=True, vector=True
  16249. 997.06 s [nothunks] Dependency base: using base-4.20.1.0
  16250. 997.06 s [nothunks] Dependency bytestring >=0.10 && <0.13: using bytestring-0.12.2.0
  16251. 997.06 s [nothunks] Dependency containers: using containers-0.7
  16252. 997.06 s [nothunks] Dependency ghc-heap: using ghc-heap-9.10.2
  16253. 997.06 s [nothunks] Dependency stm: using stm-2.5.3.1
  16254. 997.06 s [nothunks] Dependency text >=1.2 && <1.3 || >=2 && <2.2: using text-2.1.2
  16255. 997.06 s [nothunks] Dependency time: using time-1.12.2
  16256. 997.06 s [nothunks] Dependency vector >=0.12 && <0.14: using vector-0.13.2.0
  16257. 997.06 s [nothunks] Dependency wherefrom-compat >=0.1.1 && <0.3: using wherefrom-compat-0.1.1.1
  16258. 997.06 s [nothunks] Dependency base: using base-4.20.1.0
  16259. 997.06 s [nothunks] Dependency containers: using containers-0.7
  16260. 997.06 s [nothunks] Dependency ghc-prim: using ghc-prim-0.12.0
  16261. 997.06 s [nothunks] Dependency hedgehog: using hedgehog-1.5
  16262. 997.06 s [nothunks] Dependency nothunks: using nothunks-0.3.1
  16263. 997.06 s [nothunks] Dependency random: using random-1.2.1.3
  16264. 997.06 s [nothunks] Dependency stm: using stm-2.5.3.1
  16265. 997.06 s [nothunks] Dependency tasty: using tasty-1.5.3
  16266. 997.06 s [nothunks] Dependency tasty-hedgehog: using tasty-hedgehog-1.4.0.2
  16267. 997.06 s [nothunks] Source component graph:
  16268. 997.06 s [nothunks] component lib
  16269. 997.06 s [nothunks] component test:nothunks-test dependency lib
  16270. 997.06 s [nothunks] Configured component graph:
  16271. 997.06 s [nothunks] component nothunks-0.3.1-JclDwO1OSVN8NoUC8h77Nl
  16272. 997.06 s [nothunks] include base-4.20.1.0-2277
  16273. 997.06 s [nothunks] include bytestring-0.12.2.0-5835
  16274. 997.06 s [nothunks] include containers-0.7-dff9
  16275. 997.06 s [nothunks] include ghc-heap-9.10.2-b1cc
  16276. 997.06 s [nothunks] include stm-2.5.3.1-34bd
  16277. 997.06 s [nothunks] include text-2.1.2-9845
  16278. 997.06 s [nothunks] include time-1.12.2-18ff
  16279. 997.06 s [nothunks] include vector-0.13.2.0-6XtMmq2Ff9ODcKEbpcqiG
  16280. 997.06 s [nothunks] include wherefrom-compat-0.1.1.1-BzIWPGfnrGo5EJk3zhr4KG
  16281. 997.06 s [nothunks] component nothunks-0.3.1-LOMnYFfmFasBcf7juFeu9C-nothunks-test
  16282. 997.06 s [nothunks] include base-4.20.1.0-2277
  16283. 997.06 s [nothunks] include containers-0.7-dff9
  16284. 997.06 s [nothunks] include ghc-prim-0.12.0-ee9f
  16285. 997.06 s [nothunks] include hedgehog-1.5-EfuEQGiebWdHenxPcHRkuA
  16286. 997.06 s [nothunks] include nothunks-0.3.1-JclDwO1OSVN8NoUC8h77Nl
  16287. 997.06 s [nothunks] include random-1.2.1.3-8klJqjF3xhRCzBrgK1uJlY
  16288. 997.06 s [nothunks] include stm-2.5.3.1-34bd
  16289. 997.06 s [nothunks] include tasty-1.5.3-6lJNZiPO6mr1IBj9i5AbbV
  16290. 997.06 s [nothunks] include tasty-hedgehog-1.4.0.2-AqVjIOOYTu26neXIfiNVSp
  16291. 997.06 s [nothunks] Linked component graph:
  16292. 997.06 s [nothunks] unit nothunks-0.3.1-JclDwO1OSVN8NoUC8h77Nl
  16293. 997.06 s [nothunks] include base-4.20.1.0-2277
  16294. 997.06 s [nothunks] include bytestring-0.12.2.0-5835
  16295. 997.06 s [nothunks] include containers-0.7-dff9
  16296. 997.06 s [nothunks] include ghc-heap-9.10.2-b1cc
  16297. 997.06 s [nothunks] include stm-2.5.3.1-34bd
  16298. 997.06 s [nothunks] include text-2.1.2-9845
  16299. 997.06 s [nothunks] include time-1.12.2-18ff
  16300. 997.06 s [nothunks] include vector-0.13.2.0-6XtMmq2Ff9ODcKEbpcqiG
  16301. 997.06 s [nothunks] include wherefrom-compat-0.1.1.1-BzIWPGfnrGo5EJk3zhr4KG
  16302. 997.06 s [nothunks] NoThunks.Class=nothunks-0.3.1-JclDwO1OSVN8NoUC8h77Nl:NoThunks.Class
  16303. 997.06 s [nothunks] unit nothunks-0.3.1-LOMnYFfmFasBcf7juFeu9C-nothunks-test
  16304. 997.06 s [nothunks] include base-4.20.1.0-2277
  16305. 997.06 s [nothunks] include containers-0.7-dff9
  16306. 997.06 s [nothunks] include ghc-prim-0.12.0-ee9f
  16307. 997.06 s [nothunks] include hedgehog-1.5-EfuEQGiebWdHenxPcHRkuA
  16308. 997.06 s [nothunks] include nothunks-0.3.1-JclDwO1OSVN8NoUC8h77Nl
  16309. 997.06 s [nothunks] include random-1.2.1.3-8klJqjF3xhRCzBrgK1uJlY
  16310. 997.06 s [nothunks] include stm-2.5.3.1-34bd
  16311. 997.06 s [nothunks] include tasty-1.5.3-6lJNZiPO6mr1IBj9i5AbbV
  16312. 997.06 s [nothunks] include tasty-hedgehog-1.4.0.2-AqVjIOOYTu26neXIfiNVSp
  16313. 997.06 s [nothunks] Ready component graph:
  16314. 997.06 s [nothunks] definite nothunks-0.3.1-JclDwO1OSVN8NoUC8h77Nl
  16315. 997.06 s [nothunks] depends base-4.20.1.0-2277
  16316. 997.06 s [nothunks] depends bytestring-0.12.2.0-5835
  16317. 997.06 s [nothunks] depends containers-0.7-dff9
  16318. 997.06 s [nothunks] depends ghc-heap-9.10.2-b1cc
  16319. 997.06 s [nothunks] depends stm-2.5.3.1-34bd
  16320. 997.06 s [nothunks] depends text-2.1.2-9845
  16321. 997.06 s [nothunks] depends time-1.12.2-18ff
  16322. 997.06 s [nothunks] depends vector-0.13.2.0-6XtMmq2Ff9ODcKEbpcqiG
  16323. 997.06 s [nothunks] depends wherefrom-compat-0.1.1.1-BzIWPGfnrGo5EJk3zhr4KG
  16324. 997.06 s [nothunks] definite nothunks-0.3.1-LOMnYFfmFasBcf7juFeu9C-nothunks-test
  16325. 997.06 s [nothunks] depends base-4.20.1.0-2277
  16326. 997.06 s [nothunks] depends containers-0.7-dff9
  16327. 997.06 s [nothunks] depends ghc-prim-0.12.0-ee9f
  16328. 997.06 s [nothunks] depends hedgehog-1.5-EfuEQGiebWdHenxPcHRkuA
  16329. 997.06 s [nothunks] depends nothunks-0.3.1-JclDwO1OSVN8NoUC8h77Nl
  16330. 997.06 s [nothunks] depends random-1.2.1.3-8klJqjF3xhRCzBrgK1uJlY
  16331. 997.06 s [nothunks] depends stm-2.5.3.1-34bd
  16332. 997.06 s [nothunks] depends tasty-1.5.3-6lJNZiPO6mr1IBj9i5AbbV
  16333. 997.06 s [nothunks] depends tasty-hedgehog-1.4.0.2-AqVjIOOYTu26neXIfiNVSp
  16334. 997.06 s [nothunks] Using Cabal-3.12.1.0 compiled by ghc-9.10
  16335. 997.06 s [nothunks] Using compiler: ghc-9.10.2
  16336. 997.07 s [nothunks] Using install prefix:
  16337. 997.07 s [nothunks] /nix/store/j545lkl3cl3ydlg3r3yaql1n9wpap8iw-nothunks-0.3.1
  16338. 997.07 s [nothunks] Executables installed in:
  16339. 997.07 s [nothunks] /nix/store/j545lkl3cl3ydlg3r3yaql1n9wpap8iw-nothunks-0.3.1/bin
  16340. 997.07 s [nothunks] Libraries installed in:
  16341. 997.07 s [nothunks] /nix/store/j545lkl3cl3ydlg3r3yaql1n9wpap8iw-nothunks-0.3.1/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-1e2a/nothunks-0.3.1-JclDwO1OSVN8NoUC8h77Nl
  16342. 997.07 s [nothunks] Dynamic Libraries installed in:
  16343. 997.07 s [nothunks] /nix/store/j545lkl3cl3ydlg3r3yaql1n9wpap8iw-nothunks-0.3.1/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-1e2a
  16344. 997.07 s [nothunks] Private executables installed in:
  16345. 997.07 s [nothunks] /nix/store/j545lkl3cl3ydlg3r3yaql1n9wpap8iw-nothunks-0.3.1/libexec/x86_64-linux-ghc-9.10.2-1e2a/nothunks-0.3.1
  16346. 997.07 s [nothunks] Data files installed in:
  16347. 997.07 s [nothunks] /nix/store/j545lkl3cl3ydlg3r3yaql1n9wpap8iw-nothunks-0.3.1/share/x86_64-linux-ghc-9.10.2-1e2a/nothunks-0.3.1
  16348. 997.07 s [nothunks] Documentation installed in:
  16349. 997.07 s [nothunks] /nix/store/jdnz15bpa8n2gdz9p1267irb5vr0b8km-nothunks-0.3.1-doc/share/doc/nothunks-0.3.1
  16350. 997.07 s [nothunks] Configuration files installed in:
  16351. 997.07 s [nothunks] /nix/store/j545lkl3cl3ydlg3r3yaql1n9wpap8iw-nothunks-0.3.1/etc
  16352. 997.07 s [nothunks] No alex found
  16353. 997.07 s [nothunks] Using ar found on system at:
  16354. 997.07 s [nothunks] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
  16355. 997.07 s [nothunks] No c2hs found
  16356. 997.07 s [nothunks] No cpphs found
  16357. 997.07 s [nothunks] No doctest found
  16358. 997.07 s [nothunks] Using gcc version 14.3.0 given by user at:
  16359. 997.07 s [nothunks] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
  16360. 997.07 s [nothunks] Using ghc version 9.10.2 found on system at:
  16361. 997.07 s [nothunks] /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/bin/ghc
  16362. 997.07 s [nothunks] Using ghc-pkg version 9.10.2 found on system at:
  16363. 997.07 s [nothunks] /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/bin/ghc-pkg-9.10.2
  16364. 997.07 s [nothunks] No ghcjs found
  16365. 997.07 s [nothunks] No ghcjs-pkg found
  16366. 997.07 s [nothunks] No greencard found
  16367. 997.07 s [nothunks] Using haddock version 2.31.0 found on system at:
  16368. 997.07 s [nothunks] /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/bin/haddock-ghc-9.10.2
  16369. 997.07 s [nothunks] No happy found
  16370. 997.07 s [nothunks] Using haskell-suite found on system at: haskell-suite-dummy-location
  16371. 997.07 s [nothunks] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  16372. 997.07 s [nothunks] No hmake found
  16373. 997.07 s [nothunks] Using hpc version 0.69 found on system at:
  16374. 997.07 s [nothunks] /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/bin/hpc-ghc-9.10.2
  16375. 997.07 s [nothunks] Using hsc2hs version 0.68.10 found on system at:
  16376. 997.07 s [nothunks] /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/bin/hsc2hs-ghc-9.10.2
  16377. 997.07 s [nothunks] Using hscolour version 1.25 found on system at:
  16378. 997.07 s [nothunks] /nix/store/kb4afndnwdxxc5ps9k8xv0jzd0a9y8n5-hscolour-1.25/bin/HsColour
  16379. 997.07 s [nothunks] No jhc found
  16380. 997.07 s [nothunks] Using ld found on system at:
  16381. 997.07 s [nothunks] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/ld
  16382. 997.07 s [nothunks] No pkg-config found
  16383. 997.07 s [nothunks] Using runghc version 9.10.2 found on system at:
  16384. 997.07 s [nothunks] /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/bin/runghc-9.10.2
  16385. 997.07 s [nothunks] Using strip version 2.44 found on system at:
  16386. 997.07 s [nothunks] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
  16387. 997.07 s [nothunks] Using tar found on system at:
  16388. 997.07 s [nothunks] /nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
  16389. 997.07 s [nothunks] No uhc found
  16390. 997.26 s [nothunks] Phase: buildPhase
  16391. 997.40 s [nothunks] Preprocessing library for nothunks-0.3.1...
  16392. 997.40 s [nothunks] Building library for nothunks-0.3.1...
  16393. 997.56 s [nothunks] [1 of 1] Compiling NoThunks.Class ( src/NoThunks/Class.hs, dist/build/NoThunks/Class.o, dist/build/NoThunks/Class.dyn_o )
  16394. 1000.15 s [nothunks] [1 of 1] Compiling NoThunks.Class ( src/NoThunks/Class.hs, dist/build/NoThunks/Class.p_o )
  16395. 1003.45 s [nothunks] Preprocessing test suite 'nothunks-test' for nothunks-0.3.1...
  16396. 1003.45 s [nothunks] Building test suite 'nothunks-test' for nothunks-0.3.1...
  16397. 1003.55 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 )
  16398. 1005.64 s [nothunks] [2 of 2] Compiling Main ( test/Main.hs, dist/build/nothunks-test/nothunks-test-tmp/Main.o )
  16399. 1005.93 s [nothunks] [3 of 3] Linking dist/build/nothunks-test/nothunks-test
  16400. 1006.88 s [nothunks] Phase: checkPhase
  16401. 1007.23 s [nothunks] Running 1 test suites...
  16402. 1007.23 s [nothunks] Test suite nothunks-test: RUNNING...
  16403. 1007.24 s [nothunks] Tests
  16404. 1007.24 s [nothunks] NoThunks.Class
  16405. 1007.24 s [nothunks] Sanity
  16406. 1007.24 s [nothunks] IntNotNF: OK
  16407. 1007.24 s [nothunks] ✓ <interactive> passed 1 test.
  16408. 1007.24 s [nothunks] IntIsNF: OK
  16409. 1007.24 s [nothunks] ✓ <interactive> passed 1 test.
  16410. 1007.24 s [nothunks] Pair: OK
  16411. 1007.24 s [nothunks] ✓ <interactive> passed 1 test.
  16412. 1007.24 s [nothunks] Sum: OK
  16413. 1007.24 s [nothunks] ✓ <interactive> passed 1 test.
  16414. 1007.24 s [nothunks] Fn: OK
  16415. 1007.24 s [nothunks] ✓ <interactive> passed 1 test.
  16416. 1007.24 s [nothunks] IO: OK
  16417. 1007.25 s [nothunks] ✓ <interactive> passed 1 test.
  16418. 1007.25 s [nothunks] InspectHeap
  16419. 1007.27 s [nothunks] Int: OK (0.02s)
  16420. 1007.27 s [nothunks] ✓ <interactive> passed 1000 tests.
  16421. 1007.27 s [nothunks] Just ["Int"] 49% █████████▊··········
  16422. 1007.27 s [nothunks] Nothing 51% ██████████▏·········
  16423. 1007.29 s [nothunks] IntInt: OK (0.02s)
  16424. 1007.29 s [nothunks] ✓ <interactive> passed 1000 tests.
  16425. 1007.29 s [nothunks] Just ["Int","Tuple2"] 38% ███████▋············
  16426. 1007.29 s [nothunks] Just ["Tuple2"] 50% █████████▉··········
  16427. 1007.29 s [nothunks] Nothing 12% ██▎·················
  16428. 1007.31 s [nothunks] SumInt: OK (0.02s)
  16429. 1007.31 s [nothunks] ✓ <interactive> passed 1000 tests.
  16430. 1007.31 s [nothunks] Just ["Either"] 33% ██████▌·············
  16431. 1007.31 s [nothunks] Just ["Int","Either"] 32% ██████▌·············
  16432. 1007.31 s [nothunks] Nothing 35% ██████▉·············
  16433. 1007.33 s [nothunks] ListInt: OK (0.02s)
  16434. 1007.33 s [nothunks] ✓ <interactive> passed 1000 tests.
  16435. 1007.33 s [nothunks] Just ["Int","List"] 21% ████················
  16436. 1007.33 s [nothunks] Just ["List"] 45% █████████···········
  16437. 1007.33 s [nothunks] Nothing 34% ██████▊·············
  16438. 1007.35 s [nothunks] IntListInt: OK (0.03s)
  16439. 1007.35 s [nothunks] ✓ <interactive> passed 1000 tests.
  16440. 1007.35 s [nothunks] Just ["Int","List","Tuple2"] 5% ▉···················
  16441. 1007.35 s [nothunks] Just ["Int","Tuple2"] 25% █████···············
  16442. 1007.35 s [nothunks] Just ["List","Tuple2"] 11% ██▎·················
  16443. 1007.35 s [nothunks] Just ["Tuple2"] 51% ██████████▏·········
  16444. 1007.35 s [nothunks] Nothing 8% █▋··················
  16445. 1007.37 s [nothunks] SeqInt: ✗ EXPECTED FAILURE failed at test/Test/NoThunks/Class.hs:179:7
  16446. 1007.37 s [nothunks] after 7 tests.
  16447. 1007.37 s [nothunks] shrink path: 7:
  16448. 1007.37 s [nothunks] Just ["Int","Seq"] 14% ██▊·················
  16449. 1007.37 s [nothunks] Nothing 71% ██████████████▎·····
  16450. 1007.37 s [nothunks]
  16451. 1007.37 s [nothunks] ┏━━ test/Test/NoThunks/Class.hs ━━━
  16452. 1007.37 s [nothunks] 166 ┃ testWithModel :: forall a. FromModel a
  16453. 1007.37 s [nothunks] 167 ┃ => (Maybe ThunkInfo -> Maybe [String] -> Bool)
  16454. 1007.37 s [nothunks] 168 ┃ -> Proxy a
  16455. 1007.37 s [nothunks] 169 ┃ -- ^ Compare @ThunkInfo@. When we use 'noThunks' this
  16456. 1007.37 s [nothunks] 170 ┃ -- can just be @(==)@; however, when we use 'isNormalForm', the
  16457. 1007.37 s [nothunks] 171 ┃ -- context we will get from the model will be too detailed.
  16458. 1007.37 s [nothunks] 172 ┃ -> Property
  16459. 1007.37 s [nothunks] 173 ┃ testWithModel compareInfo _proxy = withTests 1000 $ property $ do
  16460. 1007.37 s [nothunks] 174 ┃ m :: Model a <- forAll genModel
  16461. 1007.37 s [nothunks] ┃ │ Wrap
  16462. 1007.37 s [nothunks] ┃ │ { unwrap =
  16463. 1007.37 s [nothunks] ┃ │ SeqEnqueue
  16464. 1007.37 s [nothunks] ┃ │ (IntValue 0)
  16465. 1007.37 s [nothunks] ┃ │ (SeqEnqueue
  16466. 1007.37 s [nothunks] ┃ │ (IntValue 0)
  16467. 1007.37 s [nothunks] ┃ │ (SeqEnqueue
  16468. 1007.37 s [nothunks] ┃ │ (IntValue 0)
  16469. 1007.37 s [nothunks] ┃ │ (SeqEnqueue
  16470. 1007.37 s [nothunks] ┃ │ (IntValue 0)
  16471. 1007.37 s [nothunks] ┃ │ (SeqEnqueue (IntValue 0) (SeqEnqueue (IntValue 0) SeqEmpty)))))
  16472. 1007.37 s [nothunks] ┃ │ }
  16473. 1007.37 s [nothunks] 175 ┃ collect $ modelUnexpected [] m
  16474. 1007.37 s [nothunks] 176 ┃ fromModel m $ \a -> do
  16475. 1007.37 s [nothunks] 177 ┃ annotate $ show $ modelIsNF [] m
  16476. 1007.37 s [nothunks] ┃ │ IsNF
  16477. 1007.37 s [nothunks] 178 ┃ isNF <- liftIO $ noThunks [] a
  16478. 1007.37 s [nothunks] 179 ┃ Hedgehog.diff isNF compareInfo (modelUnexpected [] m)
  16479. 1007.37 s [nothunks] ┃ ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  16480. 1007.37 s [nothunks] ┃ │ ━━━ Failed (- lhs) (+ rhs) ━━━
  16481. 1007.37 s [nothunks] ┃ │ - Just
  16482. 1007.37 s [nothunks] ┃ │ - ThunkInfo
  16483. 1007.37 s [nothunks] ┃ │ - { thunkContext = [ "..." , "Seq Int" ] , thunkInfo = Nothing }
  16484. 1007.37 s [nothunks] ┃ │ + Nothing
  16485. 1007.37 s [nothunks]
  16486. 1007.37 s [nothunks] This failure can be reproduced by running:
  16487. 1007.37 s [nothunks] > recheckAt (Seed 5554325341364420000 15918101956193872957) "7:" EXPECTED FAILURE
  16488. 1007.37 s [nothunks]
  16489. 1007.37 s [nothunks] OK (0.02s)
  16490. 1007.37 s [nothunks] ✓ <interactive> passed 1 test.
  16491. 1007.37 s [nothunks] Model
  16492. 1007.39 s [nothunks] Int: OK (0.01s)
  16493. 1007.39 s [nothunks] ✓ <interactive> passed 1000 tests.
  16494. 1007.39 s [nothunks] Just ["Int"] 51% ██████████▏·········
  16495. 1007.39 s [nothunks] Nothing 49% █████████▊··········
  16496. 1007.41 s [nothunks] IntInt: OK (0.02s)
  16497. 1007.41 s [nothunks] ✓ <interactive> passed 1000 tests.
  16498. 1007.41 s [nothunks] Just ["Int","Tuple2"] 36% ███████▏············
  16499. 1007.41 s [nothunks] Just ["Tuple2"] 51% ██████████▏·········
  16500. 1007.41 s [nothunks] Nothing 13% ██▌·················
  16501. 1007.43 s [nothunks] SumInt: OK (0.02s)
  16502. 1007.43 s [nothunks] ✓ <interactive> passed 1000 tests.
  16503. 1007.43 s [nothunks] Just ["Either"] 32% ██████▎·············
  16504. 1007.43 s [nothunks] Just ["Int","Either"] 33% ██████▌·············
  16505. 1007.43 s [nothunks] Nothing 35% ███████·············
  16506. 1007.45 s [nothunks] ListInt: OK (0.02s)
  16507. 1007.45 s [nothunks] ✓ <interactive> passed 1000 tests.
  16508. 1007.45 s [nothunks] Just ["Int","List"] 23% ████▌···············
  16509. 1007.45 s [nothunks] Just ["List"] 44% ████████▋···········
  16510. 1007.45 s [nothunks] Nothing 34% ██████▋·············
  16511. 1007.47 s [nothunks] IntListInt: OK (0.03s)
  16512. 1007.47 s [nothunks] ✓ <interactive> passed 1000 tests.
  16513. 1007.47 s [nothunks] Just ["Int","List","Tuple2"] 6% █▎··················
  16514. 1007.47 s [nothunks] Just ["Int","Tuple2"] 25% ████▉···············
  16515. 1007.47 s [nothunks] Just ["List","Tuple2"] 12% ██▎·················
  16516. 1007.47 s [nothunks] Just ["Tuple2"] 49% █████████▉··········
  16517. 1007.47 s [nothunks] Nothing 8% █▌··················
  16518. 1007.55 s [nothunks] SeqInt: OK (0.08s)
  16519. 1007.55 s [nothunks] ✓ <interactive> passed 1000 tests.
  16520. 1007.55 s [nothunks] Just ["Int","Seq"] 48% █████████▋··········
  16521. 1007.55 s [nothunks] Nothing 52% ██████████▎·········
  16522. 1007.57 s [nothunks] AllowThunksIn: OK (0.02s)
  16523. 1007.57 s [nothunks] ✓ <interactive> passed 1000 tests.
  16524. 1007.57 s [nothunks] Just ["Int","field2","Record"] 24% ████▉···············
  16525. 1007.57 s [nothunks] Just ["Record"] 51% ██████████▏·········
  16526. 1007.57 s [nothunks] Nothing 25% ████▉···············
  16527. 1007.59 s [nothunks] Fn: OK (0.01s)
  16528. 1007.59 s [nothunks] ✓ <interactive> passed 1000 tests.
  16529. 1007.59 s [nothunks] Just ["->"] 27% █████▎··············
  16530. 1007.59 s [nothunks] Nothing 73% ██████████████▋·····
  16531. 1007.59 s [nothunks] IO: OK (0.01s)
  16532. 1007.59 s [nothunks] ✓ <interactive> passed 1000 tests.
  16533. 1007.59 s [nothunks] Just ["IO"] 24% ████▊···············
  16534. 1007.59 s [nothunks] Nothing 76% ███████████████▏····
  16535. 1007.61 s [nothunks] ThunkFreeFn: OK (0.01s)
  16536. 1007.61 s [nothunks] ✓ <interactive> passed 1000 tests.
  16537. 1007.61 s [nothunks] Just ["->"] 26% █████▎··············
  16538. 1007.61 s [nothunks] Just ["...","->"] 36% ███████▏············
  16539. 1007.61 s [nothunks] Nothing 38% ███████▌············
  16540. 1007.61 s [nothunks] ThunkFreeIO: OK (0.01s)
  16541. 1007.61 s [nothunks] ✓ <interactive> passed 1000 tests.
  16542. 1007.61 s [nothunks] Just ["...","IO"] 38% ███████▋············
  16543. 1007.61 s [nothunks] Just ["IO"] 26% █████▏··············
  16544. 1007.61 s [nothunks] Nothing 35% ███████·············
  16545. 1007.61 s [nothunks] MutableVars
  16546. 1007.61 s [nothunks] IORef
  16547. 1007.61 s [nothunks] NotNF: OK
  16548. 1007.61 s [nothunks] ✓ <interactive> passed 1 test.
  16549. 1007.61 s [nothunks] NF: OK
  16550. 1007.61 s [nothunks] ✓ <interactive> passed 1 test.
  16551. 1007.61 s [nothunks] NotNFPure: OK
  16552. 1007.61 s [nothunks] ✓ <interactive> passed 1 test.
  16553. 1007.61 s [nothunks] NFPure: OK
  16554. 1007.61 s [nothunks] ✓ <interactive> passed 1 test.
  16555. 1007.61 s [nothunks] NotNFAtomically: OK
  16556. 1007.61 s [nothunks] ✓ <interactive> passed 1 test.
  16557. 1007.61 s [nothunks] NFAtomically: OK
  16558. 1007.61 s [nothunks] ✓ <interactive> passed 1 test.
  16559. 1007.61 s [nothunks] MVar
  16560. 1007.61 s [nothunks] NotNF: OK
  16561. 1007.61 s [nothunks] ✓ <interactive> passed 1 test.
  16562. 1007.61 s [nothunks] NF: OK
  16563. 1007.61 s [nothunks] ✓ <interactive> passed 1 test.
  16564. 1007.61 s [nothunks] NotNFPure: OK
  16565. 1007.61 s [nothunks] ✓ <interactive> passed 1 test.
  16566. 1007.61 s [nothunks] NFPure: OK
  16567. 1007.61 s [nothunks] ✓ <interactive> passed 1 test.
  16568. 1007.61 s [nothunks] NotNFAtomically: OK
  16569. 1007.61 s [nothunks] ✓ <interactive> passed 1 test.
  16570. 1007.61 s [nothunks] NFAtomically: OK
  16571. 1007.61 s [nothunks] ✓ <interactive> passed 1 test.
  16572. 1007.61 s [nothunks] TVar
  16573. 1007.61 s [nothunks] NotNF: OK
  16574. 1007.61 s [nothunks] ✓ <interactive> passed 1 test.
  16575. 1007.61 s [nothunks] NF: OK
  16576. 1007.61 s [nothunks] ✓ <interactive> passed 1 test.
  16577. 1007.61 s [nothunks] NotNFPure: OK
  16578. 1007.61 s [nothunks] ✓ <interactive> passed 1 test.
  16579. 1007.61 s [nothunks] NFPure: OK
  16580. 1007.61 s [nothunks] ✓ <interactive> passed 1 test.
  16581. 1007.61 s [nothunks] NotNFAtomically: OK
  16582. 1007.61 s [nothunks] ✓ <interactive> passed 1 test.
  16583. 1007.61 s [nothunks] NFAtomically: OK
  16584. 1007.62 s [nothunks] ✓ <interactive> passed 1 test.
  16585. 1007.62 s [nothunks]
  16586. 1007.62 s [nothunks] All 41 tests passed (0.38s)
  16587. 1007.62 s [nothunks] Test suite nothunks-test: PASS
  16588. 1007.62 s [nothunks] Test suite logged to: dist/test/nothunks-0.3.1-nothunks-test.log
  16589. 1007.62 s [nothunks] 1 of 1 test suites (1 of 1 test cases) passed.
  16590. 1007.63 s [nothunks] Phase: haddockPhase
  16591. 1007.78 s [nothunks] Preprocessing library for nothunks-0.3.1...
  16592. 1007.78 s [nothunks] Running Haddock on library for nothunks-0.3.1...
  16593. 1007.78 s [nothunks] Warning: The documentation for the following packages are not installed. No
  16594. 1007.78 s [nothunks] links will be generated to these packages: vector-0.13.2.0
  16595. 1008.00 s [nothunks] [1 of 1] Compiling NoThunks.Class ( src/NoThunks/Class.hs, nothing )
  16596. 1008.51 s [nothunks] Haddock coverage:
  16597. 1008.51 s [nothunks] Warning: 'AllowThunksIn' is ambiguous. It is defined
  16598. 1008.51 s [nothunks] * at src/NoThunks/Class.hs:334:48
  16599. 1008.51 s [nothunks] * at src/NoThunks/Class.hs:334:1
  16600. 1008.51 s [nothunks] You may be able to disambiguate the identifier by qualifying it or
  16601. 1008.51 s [nothunks] by specifying the type/value namespace explicitly.
  16602. 1008.51 s [nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:334:1
  16603. 1008.51 s [nothunks] Warning: 'InspectHeap' is ambiguous. It is defined
  16604. 1008.51 s [nothunks] * at src/NoThunks/Class.hs:353:25
  16605. 1008.51 s [nothunks] * at src/NoThunks/Class.hs:353:1
  16606. 1008.51 s [nothunks] You may be able to disambiguate the identifier by qualifying it or
  16607. 1008.51 s [nothunks] by specifying the type/value namespace explicitly.
  16608. 1008.51 s [nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:353:1
  16609. 1008.51 s [nothunks] Warning: 'InspectHeapNamed' is ambiguous. It is defined
  16610. 1008.51 s [nothunks] * at src/NoThunks/Class.hs:358:47
  16611. 1008.51 s [nothunks] * at src/NoThunks/Class.hs:358:1
  16612. 1008.51 s [nothunks] You may be able to disambiguate the identifier by qualifying it or
  16613. 1008.51 s [nothunks] by specifying the type/value namespace explicitly.
  16614. 1008.51 s [nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:358:1
  16615. 1008.51 s [nothunks] Warning: 'OnlyCheckWhnf' is ambiguous. It is defined
  16616. 1008.51 s [nothunks] * at src/NoThunks/Class.hs:308:27
  16617. 1008.51 s [nothunks] * at src/NoThunks/Class.hs:308:1
  16618. 1008.51 s [nothunks] You may be able to disambiguate the identifier by qualifying it or
  16619. 1008.51 s [nothunks] by specifying the type/value namespace explicitly.
  16620. 1008.51 s [nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:308:1
  16621. 1008.51 s [nothunks] Warning: 'ThunkInfo' is ambiguous. It is defined
  16622. 1008.51 s [nothunks] * at src/NoThunks/Class.hs:230:18
  16623. 1008.51 s [nothunks] * at src/NoThunks/Class.hs:230:1
  16624. 1008.51 s [nothunks] You may be able to disambiguate the identifier by qualifying it or
  16625. 1008.51 s [nothunks] by specifying the type/value namespace explicitly.
  16626. 1008.51 s [nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:230:1
  16627. 1008.51 s [nothunks] Warning: 'GHC' is out of scope.
  16628. 1008.51 s [nothunks] If you qualify the identifier, haddock can try to link it anyway.
  16629. 1008.51 s [nothunks] Warning: 'a' is out of scope.
  16630. 1008.51 s [nothunks] If you qualify the identifier, haddock can try to link it anyway.
  16631. 1008.52 s [nothunks] 95% ( 20 / 21) in 'NoThunks.Class'
  16632. 1008.52 s [nothunks] Missing documentation for:
  16633. 1008.52 s [nothunks] Module header
  16634. 1008.93 s [nothunks] Warning: NoThunks.Class: could not find link destinations for:
  16635. 1008.93 s [nothunks] - Data.Vector.Vector
  16636. 1008.93 s [nothunks] - Data.Vector.Unboxed.Base.Vector
  16637. 1008.93 s [nothunks] - NoThunks.Class.HasFields
  16638. 1008.93 s [nothunks] - NoThunks.Class.Elem
  16639. 1008.93 s [nothunks] - NoThunks.Class.GShowTypeOf
  16640. 1008.93 s [nothunks] - NoThunks.Class.GWRecordField
  16641. 1008.93 s [nothunks] - NoThunks.Class.checkContainsThunks
  16642. 1013.38 s [nothunks] Documentation created: dist/doc/html/nothunks/,
  16643. 1013.38 s [nothunks] dist/doc/html/nothunks/nothunks.txt
  16644. 1013.45 s [nothunks] Preprocessing test suite 'nothunks-test' for nothunks-0.3.1...
  16645. 1013.48 s [nothunks] Phase: installPhase
  16646. 1013.52 s [nothunks] Installing library in /nix/store/j545lkl3cl3ydlg3r3yaql1n9wpap8iw-nothunks-0.3.1/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-1e2a/nothunks-0.3.1-JclDwO1OSVN8NoUC8h77Nl
  16647. 1013.77 s [nothunks] Phase: fixupPhase
  16648. 1013.79 s [nothunks] shrinking RPATHs of ELF executables and libraries in /nix/store/j545lkl3cl3ydlg3r3yaql1n9wpap8iw-nothunks-0.3.1
  16649. 1013.79 s [nothunks] shrinking /nix/store/j545lkl3cl3ydlg3r3yaql1n9wpap8iw-nothunks-0.3.1/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-1e2a/libHSnothunks-0.3.1-JclDwO1OSVN8NoUC8h77Nl-ghc9.10.2.so
  16650. 1013.79 s [nothunks] checking for references to /build/ in /nix/store/j545lkl3cl3ydlg3r3yaql1n9wpap8iw-nothunks-0.3.1...
  16651. 1013.81 s [nothunks] patching script interpreter paths in /nix/store/j545lkl3cl3ydlg3r3yaql1n9wpap8iw-nothunks-0.3.1
  16652. 1013.82 s [nothunks] stripping (with command strip and flags -S -p) in /nix/store/j545lkl3cl3ydlg3r3yaql1n9wpap8iw-nothunks-0.3.1/lib
  16653. 1013.88 s [nothunks] shrinking RPATHs of ELF executables and libraries in /nix/store/jdnz15bpa8n2gdz9p1267irb5vr0b8km-nothunks-0.3.1-doc
  16654. 1013.89 s [nothunks] checking for references to /build/ in /nix/store/jdnz15bpa8n2gdz9p1267irb5vr0b8km-nothunks-0.3.1-doc...
  16655. 1013.91 s [nothunks] patching script interpreter paths in /nix/store/jdnz15bpa8n2gdz9p1267irb5vr0b8km-nothunks-0.3.1-doc
  16656. 1014.02 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/j545lkl3cl3ydlg3r3yaql1n9wpap8iw-nothunks-0.3.1 /nix/store/jdnz15bpa8n2gdz9p1267irb5vr0b8km-nothunks-0.3.1-doc
  16657. 1014.49 s [post-build-hook] Pushing 2 paths (100 are already present) using zstd to cache sellout ⏳
  16658. 1014.49 s [post-build-hook]
  16659. 1014.88 s [post-build-hook] Pushing /nix/store/jdnz15bpa8n2gdz9p1267irb5vr0b8km-nothunks-0.3.1-doc (838.24 KiB)
  16660. 1014.90 s [post-build-hook] Pushing /nix/store/j545lkl3cl3ydlg3r3yaql1n9wpap8iw-nothunks-0.3.1 (2.85 MiB)
  16661. 1016.41 s [post-build-hook]
  16662. 1016.41 s [post-build-hook] All done.
  16663. 1016.43 s [post-build-hook] Uploading to the NixCI cache: /nix/store/j545lkl3cl3ydlg3r3yaql1n9wpap8iw-nothunks-0.3.1 /nix/store/jdnz15bpa8n2gdz9p1267irb5vr0b8km-nothunks-0.3.1-doc
  16664. 1016.48 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  16665. 1016.65 s [post-build-hook] copying 4 paths...
  16666. 1016.65 s [post-build-hook] copying path '/nix/store/bggsprs8r47x5cwvrbh0l19rfsfxzgmc-wherefrom-compat-0.1.1.1-doc' to 'https://cache.nix-ci.com'...
  16667. 1016.81 s [post-build-hook] copying path '/nix/store/jdnz15bpa8n2gdz9p1267irb5vr0b8km-nothunks-0.3.1-doc' to 'https://cache.nix-ci.com'...
  16668. 1016.81 s [post-build-hook] copying path '/nix/store/70qv44lmsr59sa6yirmwfl88lba20569-wherefrom-compat-0.1.1.1' to 'https://cache.nix-ci.com'...
  16669. 1017.27 s [post-build-hook] copying path '/nix/store/j545lkl3cl3ydlg3r3yaql1n9wpap8iw-nothunks-0.3.1' to 'https://cache.nix-ci.com'...
  16670. 1017.97 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  16671. 1018.15 s [post-build-hook] copying 1 paths...
  16672. 1018.15 s [post-build-hook] copying path '/nix/store/5ghs8f6dj8frm1b0xyqd5qqfmayl3w3m-nothunks-0.3.1.drv' to 'https://cache.nix-ci.com'...
  16673. 1018.33 s Progress: 10 of 19 built, 177 of 177 downloaded from cache
  16674. 1018.37 s Building unordered-containers
  16675. 1018.50 s [unordered-containers] Phase: setupCompilerEnvironmentPhase
  16676. 1018.56 s [unordered-containers] Build with /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2.
  16677. 1018.76 s [unordered-containers] Phase: unpackPhase
  16678. 1018.77 s [unordered-containers] unpacking source archive /nix/store/3jhrx7bdq3fc4fyqvqr344f82lb9n9iv-unordered-containers-0.2.20.1.tar.gz
  16679. 1018.78 s [unordered-containers] source root is unordered-containers-0.2.20.1
  16680. 1018.78 s [unordered-containers] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "unordered-containers-0.2.20.1/unordered-containers.cabal"
  16681. 1018.79 s [unordered-containers] Phase: patchPhase
  16682. 1018.80 s [unordered-containers] Phase: compileBuildDriverPhase
  16683. 1018.80 s [unordered-containers] setupCompileFlags: -package-db=/build/tmp.suPaoQJbYf/setup-package.conf.d -threaded
  16684. 1018.86 s [unordered-containers] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.suPaoQJbYf/Main.o )
  16685. 1018.91 s [unordered-containers] [2 of 2] Linking Setup
  16686. 1020.33 s [unordered-containers] Phase: updateAutotoolsGnuConfigScriptsPhase
  16687. 1020.34 s [unordered-containers] Phase: configurePhase
  16688. 1020.35 s [unordered-containers] configureFlags: --verbose --prefix=/nix/store/av8acxc312ry26l7zqwhzyg2xvckvabj-unordered-containers-0.2.20.1 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/wsdg7zkx5dx38g5nffv3rrn0scbczx3r-unordered-containers-0.2.20.1-doc/share/doc/unordered-containers-0.2.20.1 --with-gcc=gcc --package-db=/build/tmp.suPaoQJbYf/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
  16689. 1020.36 s [unordered-containers] Using Parsec parser
  16690. 1020.36 s [unordered-containers] Configuring unordered-containers-0.2.20.1...
  16691. 1020.75 s [unordered-containers] Flags chosen: debug=False
  16692. 1021.09 s [unordered-containers] Dependency base >=4.10 && <5: using base-4.20.1.0
  16693. 1021.09 s [unordered-containers] Dependency deepseq >=1.4.3: using deepseq-1.5.0.0
  16694. 1021.09 s [unordered-containers] Dependency hashable >=1.4 && <1.6: using hashable-1.5.0.0
  16695. 1021.09 s [unordered-containers] Dependency template-haskell <2.24: using template-haskell-2.22.0.0
  16696. 1021.09 s [unordered-containers] Dependency ChasingBottoms: using ChasingBottoms-1.3.1.17
  16697. 1021.09 s [unordered-containers] Dependency HUnit: using HUnit-1.6.2.0
  16698. 1021.09 s [unordered-containers] Dependency QuickCheck >=2.4.0.1: using QuickCheck-2.15.0.1
  16699. 1021.09 s [unordered-containers] Dependency base: using base-4.20.1.0
  16700. 1021.09 s [unordered-containers] Dependency containers >=0.5.8: using containers-0.7
  16701. 1021.09 s [unordered-containers] Dependency hashable: using hashable-1.5.0.0
  16702. 1021.09 s [unordered-containers] Dependency nothunks >=0.1.3: using nothunks-0.3.1
  16703. 1021.09 s [unordered-containers] Dependency random: using random-1.2.1.3
  16704. 1021.09 s [unordered-containers] Dependency tasty >=1.4.0.3: using tasty-1.5.3
  16705. 1021.09 s [unordered-containers] Dependency tasty-hunit >=0.10.0.3: using tasty-hunit-0.10.2
  16706. 1021.09 s [unordered-containers] Dependency tasty-quickcheck >=0.10.1.2: using tasty-quickcheck-0.11.1
  16707. 1021.09 s [unordered-containers] Dependency unordered-containers: using unordered-containers-0.2.20.1
  16708. 1021.09 s [unordered-containers] Source component graph:
  16709. 1021.09 s [unordered-containers] component lib
  16710. 1021.09 s [unordered-containers] component test:unordered-containers-tests dependency lib
  16711. 1021.09 s [unordered-containers] Configured component graph:
  16712. 1021.09 s [unordered-containers] component unordered-containers-0.2.20.1-191HHq0EiVBAwoS0jzVXN0
  16713. 1021.09 s [unordered-containers] include base-4.20.1.0-2277
  16714. 1021.09 s [unordered-containers] include deepseq-1.5.0.0-f20c
  16715. 1021.09 s [unordered-containers] include hashable-1.5.0.0-JQMp8nD7eXDLx6QkBmTwVb
  16716. 1021.09 s [unordered-containers] include template-haskell-2.22.0.0-2a41
  16717. 1021.09 s [unordered-containers] component unordered-containers-0.2.20.1-KsThoGX5oX3Vo8AC8U3Dz-unordered-containers-tests
  16718. 1021.09 s [unordered-containers] include ChasingBottoms-1.3.1.17-7Wd6yUgATgzEShSHbuONFM
  16719. 1021.09 s [unordered-containers] include HUnit-1.6.2.0-5oiOKRYRGyM8sVZY2GPYrG
  16720. 1021.09 s [unordered-containers] include QuickCheck-2.15.0.1-stTt2BXNne46QxWHi9NgG
  16721. 1021.09 s [unordered-containers] include base-4.20.1.0-2277
  16722. 1021.09 s [unordered-containers] include containers-0.7-dff9
  16723. 1021.09 s [unordered-containers] include hashable-1.5.0.0-JQMp8nD7eXDLx6QkBmTwVb
  16724. 1021.09 s [unordered-containers] include nothunks-0.3.1-JclDwO1OSVN8NoUC8h77Nl
  16725. 1021.10 s [unordered-containers] include random-1.2.1.3-8klJqjF3xhRCzBrgK1uJlY
  16726. 1021.10 s [unordered-containers] include tasty-1.5.3-6lJNZiPO6mr1IBj9i5AbbV
  16727. 1021.10 s [unordered-containers] include tasty-hunit-0.10.2-ApRuPpVuRf9mwaiocwfO9
  16728. 1021.10 s [unordered-containers] include tasty-quickcheck-0.11.1-DepBLPMHb7DnNfDS8A0JQ
  16729. 1021.10 s [unordered-containers] include unordered-containers-0.2.20.1-191HHq0EiVBAwoS0jzVXN0
  16730. 1021.10 s [unordered-containers] Linked component graph:
  16731. 1021.10 s [unordered-containers] unit unordered-containers-0.2.20.1-191HHq0EiVBAwoS0jzVXN0
  16732. 1021.10 s [unordered-containers] include base-4.20.1.0-2277
  16733. 1021.10 s [unordered-containers] include deepseq-1.5.0.0-f20c
  16734. 1021.10 s [unordered-containers] include hashable-1.5.0.0-JQMp8nD7eXDLx6QkBmTwVb
  16735. 1021.10 s [unordered-containers] include template-haskell-2.22.0.0-2a41
  16736. 1021.10 s [unordered-containers] Data.HashMap.Internal=unordered-containers-0.2.20.1-191HHq0EiVBAwoS0jzVXN0:Data.HashMap.Internal,Data.HashMap.Internal.Array=unordered-containers-0.2.20.1-191HHq0EiVBAwoS0jzVXN0:Data.HashMap.Internal.Array,Data.HashMap.Internal.Debug=unordered-containers-0.2.20.1-191HHq0EiVBAwoS0jzVXN0:Data.HashMap.Internal.Debug,Data.HashMap.Internal.List=unordered-containers-0.2.20.1-191HHq0EiVBAwoS0jzVXN0:Data.HashMap.Internal.List,Data.HashMap.Internal.Strict=unordered-containers-0.2.20.1-191HHq0EiVBAwoS0jzVXN0:Data.HashMap.Internal.Strict,Data.HashMap.Lazy=unordered-containers-0.2.20.1-191HHq0EiVBAwoS0jzVXN0:Data.HashMap.Lazy,Data.HashMap.Strict=unordered-containers-0.2.20.1-191HHq0EiVBAwoS0jzVXN0:Data.HashMap.Strict,Data.HashSet=unordered-containers-0.2.20.1-191HHq0EiVBAwoS0jzVXN0:Data.HashSet,Data.HashSet.Internal=unordered-containers-0.2.20.1-191HHq0EiVBAwoS0jzVXN0:Data.HashSet.Internal
  16737. 1021.10 s [unordered-containers] unit unordered-containers-0.2.20.1-KsThoGX5oX3Vo8AC8U3Dz-unordered-containers-tests
  16738. 1021.10 s [unordered-containers] include ChasingBottoms-1.3.1.17-7Wd6yUgATgzEShSHbuONFM
  16739. 1021.10 s [unordered-containers] include HUnit-1.6.2.0-5oiOKRYRGyM8sVZY2GPYrG
  16740. 1021.10 s [unordered-containers] include QuickCheck-2.15.0.1-stTt2BXNne46QxWHi9NgG
  16741. 1021.10 s [unordered-containers] include base-4.20.1.0-2277
  16742. 1021.10 s [unordered-containers] include containers-0.7-dff9
  16743. 1021.10 s [unordered-containers] include hashable-1.5.0.0-JQMp8nD7eXDLx6QkBmTwVb
  16744. 1021.10 s [unordered-containers] include nothunks-0.3.1-JclDwO1OSVN8NoUC8h77Nl
  16745. 1021.10 s [unordered-containers] include random-1.2.1.3-8klJqjF3xhRCzBrgK1uJlY
  16746. 1021.10 s [unordered-containers] include tasty-1.5.3-6lJNZiPO6mr1IBj9i5AbbV
  16747. 1021.10 s [unordered-containers] include tasty-hunit-0.10.2-ApRuPpVuRf9mwaiocwfO9
  16748. 1021.10 s [unordered-containers] include tasty-quickcheck-0.11.1-DepBLPMHb7DnNfDS8A0JQ
  16749. 1021.10 s [unordered-containers] include unordered-containers-0.2.20.1-191HHq0EiVBAwoS0jzVXN0
  16750. 1021.10 s [unordered-containers] Ready component graph:
  16751. 1021.10 s [unordered-containers] definite unordered-containers-0.2.20.1-191HHq0EiVBAwoS0jzVXN0
  16752. 1021.10 s [unordered-containers] depends base-4.20.1.0-2277
  16753. 1021.10 s [unordered-containers] depends deepseq-1.5.0.0-f20c
  16754. 1021.10 s [unordered-containers] depends hashable-1.5.0.0-JQMp8nD7eXDLx6QkBmTwVb
  16755. 1021.10 s [unordered-containers] depends template-haskell-2.22.0.0-2a41
  16756. 1021.10 s [unordered-containers] definite unordered-containers-0.2.20.1-KsThoGX5oX3Vo8AC8U3Dz-unordered-containers-tests
  16757. 1021.10 s [unordered-containers] depends ChasingBottoms-1.3.1.17-7Wd6yUgATgzEShSHbuONFM
  16758. 1021.10 s [unordered-containers] depends HUnit-1.6.2.0-5oiOKRYRGyM8sVZY2GPYrG
  16759. 1021.10 s [unordered-containers] depends QuickCheck-2.15.0.1-stTt2BXNne46QxWHi9NgG
  16760. 1021.10 s [unordered-containers] depends base-4.20.1.0-2277
  16761. 1021.10 s [unordered-containers] depends containers-0.7-dff9
  16762. 1021.10 s [unordered-containers] depends hashable-1.5.0.0-JQMp8nD7eXDLx6QkBmTwVb
  16763. 1021.10 s [unordered-containers] depends nothunks-0.3.1-JclDwO1OSVN8NoUC8h77Nl
  16764. 1021.10 s [unordered-containers] depends random-1.2.1.3-8klJqjF3xhRCzBrgK1uJlY
  16765. 1021.10 s [unordered-containers] depends tasty-1.5.3-6lJNZiPO6mr1IBj9i5AbbV
  16766. 1021.10 s [unordered-containers] depends tasty-hunit-0.10.2-ApRuPpVuRf9mwaiocwfO9
  16767. 1021.10 s [unordered-containers] depends tasty-quickcheck-0.11.1-DepBLPMHb7DnNfDS8A0JQ
  16768. 1021.10 s [unordered-containers] depends unordered-containers-0.2.20.1-191HHq0EiVBAwoS0jzVXN0
  16769. 1021.10 s [unordered-containers] Using Cabal-3.12.1.0 compiled by ghc-9.10
  16770. 1021.10 s [unordered-containers] Using compiler: ghc-9.10.2
  16771. 1021.10 s [unordered-containers] Using install prefix:
  16772. 1021.10 s [unordered-containers] /nix/store/av8acxc312ry26l7zqwhzyg2xvckvabj-unordered-containers-0.2.20.1
  16773. 1021.10 s [unordered-containers] Executables installed in:
  16774. 1021.10 s [unordered-containers] /nix/store/av8acxc312ry26l7zqwhzyg2xvckvabj-unordered-containers-0.2.20.1/bin
  16775. 1021.10 s [unordered-containers] Libraries installed in:
  16776. 1021.10 s [unordered-containers] /nix/store/av8acxc312ry26l7zqwhzyg2xvckvabj-unordered-containers-0.2.20.1/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-1e2a/unordered-containers-0.2.20.1-191HHq0EiVBAwoS0jzVXN0
  16777. 1021.10 s [unordered-containers] Dynamic Libraries installed in:
  16778. 1021.10 s [unordered-containers] /nix/store/av8acxc312ry26l7zqwhzyg2xvckvabj-unordered-containers-0.2.20.1/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-1e2a
  16779. 1021.10 s [unordered-containers] Private executables installed in:
  16780. 1021.10 s [unordered-containers] /nix/store/av8acxc312ry26l7zqwhzyg2xvckvabj-unordered-containers-0.2.20.1/libexec/x86_64-linux-ghc-9.10.2-1e2a/unordered-containers-0.2.20.1
  16781. 1021.10 s [unordered-containers] Data files installed in:
  16782. 1021.10 s [unordered-containers] /nix/store/av8acxc312ry26l7zqwhzyg2xvckvabj-unordered-containers-0.2.20.1/share/x86_64-linux-ghc-9.10.2-1e2a/unordered-containers-0.2.20.1
  16783. 1021.10 s [unordered-containers] Documentation installed in:
  16784. 1021.10 s [unordered-containers] /nix/store/wsdg7zkx5dx38g5nffv3rrn0scbczx3r-unordered-containers-0.2.20.1-doc/share/doc/unordered-containers-0.2.20.1
  16785. 1021.10 s [unordered-containers] Configuration files installed in:
  16786. 1021.10 s [unordered-containers] /nix/store/av8acxc312ry26l7zqwhzyg2xvckvabj-unordered-containers-0.2.20.1/etc
  16787. 1021.10 s [unordered-containers] No alex found
  16788. 1021.10 s [unordered-containers] Using ar found on system at:
  16789. 1021.10 s [unordered-containers] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
  16790. 1021.10 s [unordered-containers] No c2hs found
  16791. 1021.10 s [unordered-containers] No cpphs found
  16792. 1021.10 s [unordered-containers] No doctest found
  16793. 1021.10 s [unordered-containers] Using gcc version 14.3.0 given by user at:
  16794. 1021.10 s [unordered-containers] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
  16795. 1021.10 s [unordered-containers] Using ghc version 9.10.2 found on system at:
  16796. 1021.10 s [unordered-containers] /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/bin/ghc
  16797. 1021.10 s [unordered-containers] Using ghc-pkg version 9.10.2 found on system at:
  16798. 1021.10 s [unordered-containers] /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/bin/ghc-pkg-9.10.2
  16799. 1021.10 s [unordered-containers] No ghcjs found
  16800. 1021.10 s [unordered-containers] No ghcjs-pkg found
  16801. 1021.10 s [unordered-containers] No greencard found
  16802. 1021.10 s [unordered-containers] Using haddock version 2.31.0 found on system at:
  16803. 1021.10 s [unordered-containers] /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/bin/haddock-ghc-9.10.2
  16804. 1021.10 s [unordered-containers] No happy found
  16805. 1021.10 s [unordered-containers] Using haskell-suite found on system at: haskell-suite-dummy-location
  16806. 1021.10 s [unordered-containers] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  16807. 1021.10 s [unordered-containers] No hmake found
  16808. 1021.10 s [unordered-containers] Using hpc version 0.69 found on system at:
  16809. 1021.10 s [unordered-containers] /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/bin/hpc-ghc-9.10.2
  16810. 1021.10 s [unordered-containers] Using hsc2hs version 0.68.10 found on system at:
  16811. 1021.10 s [unordered-containers] /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/bin/hsc2hs-ghc-9.10.2
  16812. 1021.10 s [unordered-containers] Using hscolour version 1.25 found on system at:
  16813. 1021.10 s [unordered-containers] /nix/store/kb4afndnwdxxc5ps9k8xv0jzd0a9y8n5-hscolour-1.25/bin/HsColour
  16814. 1021.10 s [unordered-containers] No jhc found
  16815. 1021.10 s [unordered-containers] Using ld found on system at:
  16816. 1021.10 s [unordered-containers] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/ld
  16817. 1021.10 s [unordered-containers] No pkg-config found
  16818. 1021.10 s [unordered-containers] Using runghc version 9.10.2 found on system at:
  16819. 1021.10 s [unordered-containers] /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/bin/runghc-9.10.2
  16820. 1021.10 s [unordered-containers] Using strip version 2.44 found on system at:
  16821. 1021.10 s [unordered-containers] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
  16822. 1021.10 s [unordered-containers] Using tar found on system at:
  16823. 1021.10 s [unordered-containers] /nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
  16824. 1021.10 s [unordered-containers] No uhc found
  16825. 1021.25 s [unordered-containers] Phase: buildPhase
  16826. 1021.31 s [unordered-containers] Preprocessing library for unordered-containers-0.2.20.1...
  16827. 1021.32 s [unordered-containers] Building library for unordered-containers-0.2.20.1...
  16828. 1021.41 s [unordered-containers] Data/HashMap/Internal.hs:12:14-23: warning: [GHC-53692] [-Wdeprecated-flags]
  16829. 1021.41 s [unordered-containers] -XTypeInType is deprecated: use -XDataKinds and -XPolyKinds instead
  16830. 1021.41 s [unordered-containers] |
  16831. 1021.41 s [unordered-containers] 12 | {-# LANGUAGE TypeInType #-}
  16832. 1021.41 s [unordered-containers] | ^^^^^^^^^^
  16833. 1021.41 s [unordered-containers]
  16834. 1021.63 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 )
  16835. 1021.81 s [unordered-containers] Data/HashMap/Internal/Array.hs:83:1-35: warning: [GHC-66111] [-Wunused-imports]
  16836. 1021.81 s [unordered-containers] The import of ‘Control.Applicative’ is redundant
  16837. 1021.81 s [unordered-containers] except perhaps to import instances from ‘Control.Applicative’
  16838. 1021.81 s [unordered-containers] To import instances alone, use: import Control.Applicative()
  16839. 1021.81 s [unordered-containers] |
  16840. 1021.81 s [unordered-containers] 83 | import Control.Applicative (liftA2)
  16841. 1021.81 s [unordered-containers] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  16842. 1021.81 s [unordered-containers]
  16843. 1022.68 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 )
  16844. 1022.68 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 )
  16845. 1029.54 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 )
  16846. 1029.84 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 )
  16847. 1031.86 s [unordered-containers] [6 of 9] Compiling Data.HashSet.Internal ( Data/HashSet/Internal.hs, dist/build/Data/HashSet/Internal.o, dist/build/Data/HashSet/Internal.dyn_o )
  16848. 1031.86 s [unordered-containers] [7 of 9] Compiling Data.HashSet ( Data/HashSet.hs, dist/build/Data/HashSet.o, dist/build/Data/HashSet.dyn_o )
  16849. 1031.86 s [unordered-containers] [8 of 9] Compiling Data.HashMap.Strict ( Data/HashMap/Strict.hs, dist/build/Data/HashMap/Strict.o, dist/build/Data/HashMap/Strict.dyn_o )
  16850. 1031.88 s [unordered-containers] [9 of 9] Compiling Data.HashMap.Lazy ( Data/HashMap/Lazy.hs, dist/build/Data/HashMap/Lazy.o, dist/build/Data/HashMap/Lazy.dyn_o )
  16851. 1032.11 s [unordered-containers] Data/HashMap/Internal.hs:12:14-23: warning: [GHC-53692] [-Wdeprecated-flags]
  16852. 1032.11 s [unordered-containers] -XTypeInType is deprecated: use -XDataKinds and -XPolyKinds instead
  16853. 1032.11 s [unordered-containers] |
  16854. 1032.11 s [unordered-containers] 12 | {-# LANGUAGE TypeInType #-}
  16855. 1032.11 s [unordered-containers] | ^^^^^^^^^^
  16856. 1032.11 s [unordered-containers]
  16857. 1032.34 s [unordered-containers] [1 of 9] Compiling Data.HashMap.Internal.Array ( Data/HashMap/Internal/Array.hs, dist/build/Data/HashMap/Internal/Array.p_o )
  16858. 1032.53 s [unordered-containers] Data/HashMap/Internal/Array.hs:83:1-35: warning: [GHC-66111] [-Wunused-imports]
  16859. 1032.53 s [unordered-containers] The import of ‘Control.Applicative’ is redundant
  16860. 1032.53 s [unordered-containers] except perhaps to import instances from ‘Control.Applicative’
  16861. 1032.53 s [unordered-containers] To import instances alone, use: import Control.Applicative()
  16862. 1032.53 s [unordered-containers] |
  16863. 1032.53 s [unordered-containers] 83 | import Control.Applicative (liftA2)
  16864. 1032.53 s [unordered-containers] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  16865. 1032.53 s [unordered-containers]
  16866. 1033.29 s [unordered-containers] [2 of 9] Compiling Data.HashMap.Internal.List ( Data/HashMap/Internal/List.hs, dist/build/Data/HashMap/Internal/List.p_o )
  16867. 1033.29 s [unordered-containers] [3 of 9] Compiling Data.HashMap.Internal ( Data/HashMap/Internal.hs, dist/build/Data/HashMap/Internal.p_o )
  16868. 1041.89 s [unordered-containers] [4 of 9] Compiling Data.HashMap.Internal.Debug ( Data/HashMap/Internal/Debug.hs, dist/build/Data/HashMap/Internal/Debug.p_o )
  16869. 1042.43 s [unordered-containers] [5 of 9] Compiling Data.HashMap.Internal.Strict ( Data/HashMap/Internal/Strict.hs, dist/build/Data/HashMap/Internal/Strict.p_o )
  16870. 1044.50 s [unordered-containers] [6 of 9] Compiling Data.HashSet.Internal ( Data/HashSet/Internal.hs, dist/build/Data/HashSet/Internal.p_o )
  16871. 1044.50 s [unordered-containers] [7 of 9] Compiling Data.HashSet ( Data/HashSet.hs, dist/build/Data/HashSet.p_o )
  16872. 1044.50 s [unordered-containers] [8 of 9] Compiling Data.HashMap.Strict ( Data/HashMap/Strict.hs, dist/build/Data/HashMap/Strict.p_o )
  16873. 1044.61 s [unordered-containers] [9 of 9] Compiling Data.HashMap.Lazy ( Data/HashMap/Lazy.hs, dist/build/Data/HashMap/Lazy.p_o )
  16874. 1045.91 s [unordered-containers] Preprocessing test suite 'unordered-containers-tests' for unordered-containers-0.2.20.1...
  16875. 1045.91 s [unordered-containers] Building test suite 'unordered-containers-tests' for unordered-containers-0.2.20.1...
  16876. 1046.06 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 )
  16877. 1046.27 s [unordered-containers] [2 of 9] Compiling Regressions ( tests/Regressions.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Regressions.o )
  16878. 1046.27 s [unordered-containers] tests/Regressions.hs:93:16: warning: [GHC-63394] [-Wx-partial]
  16879. 1046.27 s [unordered-containers] In the use of ‘head’
  16880. 1046.27 s [unordered-containers] (imported from Prelude, but defined in GHC.Internal.List):
  16881. 1046.27 s [unordered-containers] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  16882. 1046.27 s [unordered-containers] |
  16883. 1046.27 s [unordered-containers] 93 | k = head keys
  16884. 1046.27 s [unordered-containers] | ^^^^
  16885. 1046.27 s [unordered-containers]
  16886. 1048.38 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 )
  16887. 1048.39 s [unordered-containers] [4 of 9] Compiling Strictness ( tests/Strictness.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Strictness.o )
  16888. 1048.39 s [unordered-containers] tests/Strictness.hs:7:1: warning: [GHC-66111] [-Wunused-imports]
  16889. 1048.39 s [unordered-containers] The import of ‘Data.Foldable’ is redundant
  16890. 1048.39 s [unordered-containers] except perhaps to import instances from ‘Data.Foldable’
  16891. 1048.39 s [unordered-containers] To import instances alone, use: import Data.Foldable()
  16892. 1048.39 s [unordered-containers] |
  16893. 1048.39 s [unordered-containers] 7 | import Data.Foldable (foldl')
  16894. 1048.39 s [unordered-containers] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  16895. 1048.39 s [unordered-containers]
  16896. 1048.39 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 )
  16897. 1048.39 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 )
  16898. 1053.82 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 )
  16899. 1053.83 s [unordered-containers] [8 of 9] Compiling Properties ( tests/Properties.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Properties.o )
  16900. 1053.87 s [unordered-containers] [9 of 9] Compiling Main ( tests/Main.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Main.o )
  16901. 1054.27 s [unordered-containers] [10 of 10] Linking dist/build/unordered-containers-tests/unordered-containers-tests
  16902. 1055.10 s [unordered-containers] buildPhase completed in 34 seconds
  16903. 1055.10 s [unordered-containers] Phase: checkPhase
  16904. 1055.34 s [unordered-containers] Running 1 test suites...
  16905. 1055.34 s [unordered-containers] Test suite unordered-containers-tests: RUNNING...
  16906. 1055.35 s [unordered-containers] All
  16907. 1055.35 s [unordered-containers] Properties
  16908. 1055.35 s [unordered-containers] Data.HashMap.Lazy
  16909. 1055.35 s [unordered-containers] instances
  16910. 1055.35 s [unordered-containers] Eq
  16911. 1055.36 s [unordered-containers] ==: OK
  16912. 1055.36 s [unordered-containers] +++ OK, passed 100 tests.
  16913. 1055.36 s [unordered-containers] /=: OK (0.01s)
  16914. 1055.36 s [unordered-containers] +++ OK, passed 100 tests.
  16915. 1055.36 s [unordered-containers] Ord
  16916. 1055.36 s [unordered-containers] compare reflexive: OK
  16917. 1055.36 s [unordered-containers] +++ OK, passed 100 tests.
  16918. 1055.36 s [unordered-containers] compare transitive: OK (0.01s)
  16919. 1055.36 s [unordered-containers] +++ OK, passed 100 tests.
  16920. 1055.36 s [unordered-containers] compare antisymmetric: OK
  16921. 1055.36 s [unordered-containers] +++ OK, passed 100 tests.
  16922. 1055.36 s [unordered-containers] Ord => Eq: OK
  16923. 1055.36 s [unordered-containers] +++ OK, passed 100 tests.
  16924. 1055.45 s [unordered-containers] Read/Show: OK (0.10s)
  16925. 1055.45 s [unordered-containers] +++ OK, passed 100 tests.
  16926. 1055.45 s [unordered-containers] Functor: OK (0.03s)
  16927. 1055.45 s [unordered-containers] +++ OK, passed 100 tests.
  16928. 1055.45 s [unordered-containers] Foldable: OK (0.02s)
  16929. 1055.45 s [unordered-containers] +++ OK, passed 100 tests.
  16930. 1055.45 s [unordered-containers] Bifoldable
  16931. 1055.45 s [unordered-containers] bifoldMap: OK (0.01s)
  16932. 1055.45 s [unordered-containers] +++ OK, passed 100 tests.
  16933. 1055.45 s [unordered-containers] bifoldr: OK (0.02s)
  16934. 1055.45 s [unordered-containers] +++ OK, passed 100 tests.
  16935. 1055.45 s [unordered-containers] bifoldl: OK (0.01s)
  16936. 1055.45 s [unordered-containers] +++ OK, passed 100 tests.
  16937. 1055.45 s [unordered-containers] Hashable: OK (0.01s)
  16938. 1055.45 s [unordered-containers] +++ OK, passed 100 tests.
  16939. 1055.45 s [unordered-containers] empty
  16940. 1055.45 s [unordered-containers] valid: OK
  16941. 1055.45 s [unordered-containers] +++ OK, passed 1 test.
  16942. 1055.45 s [unordered-containers] singleton
  16943. 1055.45 s [unordered-containers] valid: OK
  16944. 1055.45 s [unordered-containers] +++ OK, passed 100 tests.
  16945. 1055.45 s [unordered-containers] size: OK
  16946. 1055.45 s [unordered-containers] +++ OK, passed 100 tests.
  16947. 1055.46 s [unordered-containers] member: OK
  16948. 1055.46 s [unordered-containers] +++ OK, passed 100 tests.
  16949. 1055.46 s [unordered-containers] lookup: OK
  16950. 1055.46 s [unordered-containers] +++ OK, passed 100 tests.
  16951. 1055.46 s [unordered-containers] !?: OK
  16952. 1055.46 s [unordered-containers] +++ OK, passed 100 tests.
  16953. 1055.46 s [unordered-containers] insert
  16954. 1055.46 s [unordered-containers] model: OK (0.01s)
  16955. 1055.46 s [unordered-containers] +++ OK, passed 100 tests.
  16956. 1055.46 s [unordered-containers] valid: OK
  16957. 1055.46 s [unordered-containers] +++ OK, passed 100 tests.
  16958. 1055.46 s [unordered-containers] insertWith
  16959. 1055.46 s [unordered-containers] insertWith: OK
  16960. 1055.46 s [unordered-containers] +++ OK, passed 100 tests.
  16961. 1055.46 s [unordered-containers] valid: OK
  16962. 1055.46 s [unordered-containers] +++ OK, passed 100 tests.
  16963. 1055.46 s [unordered-containers] delete
  16964. 1055.46 s [unordered-containers] model: OK (0.01s)
  16965. 1055.46 s [unordered-containers] +++ OK, passed 100 tests.
  16966. 1055.46 s [unordered-containers] valid: OK
  16967. 1055.46 s [unordered-containers] +++ OK, passed 100 tests.
  16968. 1055.46 s [unordered-containers] adjust
  16969. 1055.46 s [unordered-containers] model: OK
  16970. 1055.46 s [unordered-containers] +++ OK, passed 100 tests.
  16971. 1055.46 s [unordered-containers] valid: OK
  16972. 1055.46 s [unordered-containers] +++ OK, passed 100 tests.
  16973. 1055.46 s [unordered-containers] update
  16974. 1055.46 s [unordered-containers] model: OK
  16975. 1055.46 s [unordered-containers] +++ OK, passed 100 tests.
  16976. 1055.46 s [unordered-containers] valid: OK
  16977. 1055.46 s [unordered-containers] +++ OK, passed 100 tests.
  16978. 1055.46 s [unordered-containers] alter
  16979. 1055.46 s [unordered-containers] model: OK
  16980. 1055.46 s [unordered-containers] +++ OK, passed 100 tests.
  16981. 1055.46 s [unordered-containers] valid: OK
  16982. 1055.46 s [unordered-containers] +++ OK, passed 100 tests.
  16983. 1055.46 s [unordered-containers] alterF
  16984. 1055.46 s [unordered-containers] model
  16985. 1055.46 s [unordered-containers] []: OK (0.03s)
  16986. 1055.46 s [unordered-containers] +++ OK, passed 100 tests.
  16987. 1055.46 s [unordered-containers] adjust: OK
  16988. 1055.46 s [unordered-containers] +++ OK, passed 100 tests.
  16989. 1055.46 s [unordered-containers] insert: OK
  16990. 1055.46 s [unordered-containers] +++ OK, passed 100 tests.
  16991. 1055.46 s [unordered-containers] insertWith: OK
  16992. 1055.46 s [unordered-containers] +++ OK, passed 100 tests.
  16993. 1055.46 s [unordered-containers] delete: OK
  16994. 1055.46 s [unordered-containers] +++ OK, passed 100 tests.
  16995. 1055.46 s [unordered-containers] lookup: OK
  16996. 1055.46 s [unordered-containers] +++ OK, passed 100 tests.
  16997. 1055.46 s [unordered-containers] valid: OK (0.01s)
  16998. 1055.46 s [unordered-containers] +++ OK, passed 100 tests.
  16999. 1055.46 s [unordered-containers] isSubmapOf
  17000. 1055.46 s [unordered-containers] model: OK (0.01s)
  17001. 1055.46 s [unordered-containers] +++ OK, passed 100 tests.
  17002. 1055.46 s [unordered-containers] m ⊆ m: OK
  17003. 1055.46 s [unordered-containers] +++ OK, passed 100 tests.
  17004. 1055.46 s [unordered-containers] m1 ⊆ m1 ∪ m2: OK
  17005. 1055.46 s [unordered-containers] +++ OK, passed 100 tests.
  17006. 1055.46 s [unordered-containers] m1\m2 ⊆ m1: OK (0.02s)
  17007. 1055.46 s [unordered-containers] +++ OK, passed 100 tests.
  17008. 1055.46 s [unordered-containers] m1 ∩ m2 ≠ ∅ ⇒ m1 ⊈ m1\m2 : OK
  17009. 1055.46 s [unordered-containers] +++ OK, passed 100 tests; 123 discarded.
  17010. 1055.46 s [unordered-containers] delete k m ⊆ m: OK
  17011. 1055.46 s [unordered-containers] +++ OK, passed 100 tests; 18 discarded.
  17012. 1055.46 s [unordered-containers] m ⊈ delete k m : OK
  17013. 1055.46 s [unordered-containers] +++ OK, passed 100 tests; 16 discarded.
  17014. 1055.46 s [unordered-containers] k ∉ m ⇒ m ⊆ insert k v m: OK
  17015. 1055.46 s [unordered-containers] +++ OK, passed 100 tests; 11 discarded.
  17016. 1055.46 s [unordered-containers] k ∉ m ⇒ insert k v m ⊈ m: OK
  17017. 1055.46 s [unordered-containers] +++ OK, passed 100 tests; 13 discarded.
  17018. 1055.46 s [unordered-containers] union
  17019. 1055.46 s [unordered-containers] model: OK (0.02s)
  17020. 1055.46 s [unordered-containers] +++ OK, passed 100 tests.
  17021. 1055.46 s [unordered-containers] valid: OK
  17022. 1055.46 s [unordered-containers] +++ OK, passed 100 tests.
  17023. 1055.46 s [unordered-containers] unionWith
  17024. 1055.46 s [unordered-containers] model: OK (0.02s)
  17025. 1055.46 s [unordered-containers] +++ OK, passed 100 tests.
  17026. 1055.46 s [unordered-containers] valid: OK
  17027. 1055.46 s [unordered-containers] +++ OK, passed 100 tests.
  17028. 1055.46 s [unordered-containers] unionWithKey
  17029. 1055.46 s [unordered-containers] model: OK (0.03s)
  17030. 1055.46 s [unordered-containers] +++ OK, passed 100 tests.
  17031. 1055.46 s [unordered-containers] valid: OK
  17032. 1055.46 s [unordered-containers] +++ OK, passed 100 tests.
  17033. 1055.46 s [unordered-containers] unions
  17034. 1055.84 s [unordered-containers] model: OK (0.46s)
  17035. 1055.84 s [unordered-containers] +++ OK, passed 100 tests.
  17036. 1055.84 s [unordered-containers] valid: OK (0.25s)
  17037. 1055.84 s [unordered-containers] +++ OK, passed 100 tests.
  17038. 1055.84 s [unordered-containers] difference
  17039. 1055.84 s [unordered-containers] model: OK
  17040. 1055.84 s [unordered-containers] +++ OK, passed 100 tests.
  17041. 1055.84 s [unordered-containers] valid: OK (0.01s)
  17042. 1055.84 s [unordered-containers] +++ OK, passed 100 tests.
  17043. 1055.84 s [unordered-containers] differenceWith
  17044. 1055.84 s [unordered-containers] model: OK (0.02s)
  17045. 1055.84 s [unordered-containers] +++ OK, passed 100 tests.
  17046. 1055.84 s [unordered-containers] valid: OK
  17047. 1055.84 s [unordered-containers] +++ OK, passed 100 tests.
  17048. 1055.84 s [unordered-containers] intersection
  17049. 1055.84 s [unordered-containers] model: OK (0.01s)
  17050. 1055.84 s [unordered-containers] +++ OK, passed 100 tests.
  17051. 1055.84 s [unordered-containers] valid: OK (0.01s)
  17052. 1055.84 s [unordered-containers] +++ OK, passed 100 tests.
  17053. 1055.84 s [unordered-containers] intersectionWith
  17054. 1055.84 s [unordered-containers] model: OK (0.01s)
  17055. 1055.84 s [unordered-containers] +++ OK, passed 100 tests.
  17056. 1055.84 s [unordered-containers] valid: OK
  17057. 1055.84 s [unordered-containers] +++ OK, passed 100 tests.
  17058. 1055.84 s [unordered-containers] intersectionWithKey
  17059. 1055.84 s [unordered-containers] model: OK (0.03s)
  17060. 1055.84 s [unordered-containers] +++ OK, passed 100 tests.
  17061. 1055.84 s [unordered-containers] valid: OK
  17062. 1055.84 s [unordered-containers] +++ OK, passed 100 tests.
  17063. 1055.84 s [unordered-containers] compose
  17064. 1055.84 s [unordered-containers] valid: OK (0.01s)
  17065. 1055.84 s [unordered-containers] +++ OK, passed 100 tests.
  17066. 1055.84 s [unordered-containers] map
  17067. 1055.84 s [unordered-containers] model: OK (0.02s)
  17068. 1055.84 s [unordered-containers] +++ OK, passed 100 tests.
  17069. 1055.84 s [unordered-containers] valid: OK
  17070. 1055.84 s [unordered-containers] +++ OK, passed 100 tests.
  17071. 1055.84 s [unordered-containers] traverseWithKey
  17072. 1055.84 s [unordered-containers] model: OK (0.13s)
  17073. 1055.84 s [unordered-containers] +++ OK, passed 100 tests.
  17074. 1055.84 s [unordered-containers] valid: OK
  17075. 1055.84 s [unordered-containers] +++ OK, passed 100 tests.
  17076. 1055.84 s [unordered-containers] mapKeys
  17077. 1055.84 s [unordered-containers] model: OK
  17078. 1055.84 s [unordered-containers] +++ OK, passed 100 tests.
  17079. 1055.84 s [unordered-containers] valid: OK (0.12s)
  17080. 1055.84 s [unordered-containers] +++ OK, passed 100 tests.
  17081. 1055.84 s [unordered-containers] foldr: OK
  17082. 1055.84 s [unordered-containers] +++ OK, passed 100 tests.
  17083. 1055.84 s [unordered-containers] foldl: OK (0.01s)
  17084. 1055.84 s [unordered-containers] +++ OK, passed 100 tests.
  17085. 1055.84 s [unordered-containers] foldrWithKey: OK
  17086. 1055.84 s [unordered-containers] +++ OK, passed 100 tests.
  17087. 1055.84 s [unordered-containers] foldlWithKey: OK
  17088. 1055.84 s [unordered-containers] +++ OK, passed 100 tests.
  17089. 1055.84 s [unordered-containers] foldrWithKey': OK
  17090. 1055.84 s [unordered-containers] +++ OK, passed 100 tests.
  17091. 1055.84 s [unordered-containers] foldlWithKey': OK
  17092. 1055.84 s [unordered-containers] +++ OK, passed 100 tests.
  17093. 1055.84 s [unordered-containers] foldl': OK (0.01s)
  17094. 1055.84 s [unordered-containers] +++ OK, passed 100 tests.
  17095. 1055.84 s [unordered-containers] foldr': OK
  17096. 1055.84 s [unordered-containers] +++ OK, passed 100 tests.
  17097. 1055.84 s [unordered-containers] foldMapWithKey: OK
  17098. 1055.84 s [unordered-containers] +++ OK, passed 100 tests.
  17099. 1055.84 s [unordered-containers] filter
  17100. 1055.84 s [unordered-containers] model: OK (0.05s)
  17101. 1055.84 s [unordered-containers] +++ OK, passed 100 tests.
  17102. 1055.84 s [unordered-containers] valid: OK (0.01s)
  17103. 1055.84 s [unordered-containers] +++ OK, passed 100 tests.
  17104. 1055.84 s [unordered-containers] filterWithKey
  17105. 1055.89 s [unordered-containers] model: OK (0.49s)
  17106. 1055.89 s [unordered-containers] +++ OK, passed 100 tests.
  17107. 1055.89 s [unordered-containers] valid: OK (0.21s)
  17108. 1055.89 s [unordered-containers] +++ OK, passed 100 tests.
  17109. 1055.89 s [unordered-containers] mapMaybe
  17110. 1055.89 s [unordered-containers] model: OK (0.03s)
  17111. 1055.89 s [unordered-containers] +++ OK, passed 100 tests.
  17112. 1055.89 s [unordered-containers] valid: OK (0.02s)
  17113. 1055.89 s [unordered-containers] +++ OK, passed 100 tests.
  17114. 1055.89 s [unordered-containers] mapMaybeWithKey
  17115. 1055.89 s [unordered-containers] model: OK (0.49s)
  17116. 1055.89 s [unordered-containers] +++ OK, passed 100 tests.
  17117. 1055.89 s [unordered-containers] valid: OK (0.24s)
  17118. 1055.89 s [unordered-containers] +++ OK, passed 100 tests.
  17119. 1055.89 s [unordered-containers] elems: OK (0.02s)
  17120. 1055.89 s [unordered-containers] +++ OK, passed 100 tests.
  17121. 1055.89 s [unordered-containers] keys: OK
  17122. 1055.89 s [unordered-containers] +++ OK, passed 100 tests.
  17123. 1055.89 s [unordered-containers] fromList
  17124. 1055.89 s [unordered-containers] model: OK (0.01s)
  17125. 1055.89 s [unordered-containers] +++ OK, passed 100 tests.
  17126. 1055.89 s [unordered-containers] valid: OK
  17127. 1055.89 s [unordered-containers] +++ OK, passed 100 tests.
  17128. 1055.89 s [unordered-containers] fromListWith
  17129. 1055.89 s [unordered-containers] model: OK
  17130. 1055.89 s [unordered-containers] +++ OK, passed 100 tests.
  17131. 1055.89 s [unordered-containers] valid: OK
  17132. 1055.89 s [unordered-containers] +++ OK, passed 100 tests.
  17133. 1055.89 s [unordered-containers] fromListWithKey
  17134. 1055.89 s [unordered-containers] model: OK (0.01s)
  17135. 1055.89 s [unordered-containers] +++ OK, passed 100 tests.
  17136. 1055.89 s [unordered-containers] valid: OK (0.01s)
  17137. 1055.89 s [unordered-containers] +++ OK, passed 100 tests.
  17138. 1055.89 s [unordered-containers] toList: OK
  17139. 1055.89 s [unordered-containers] +++ OK, passed 100 tests.
  17140. 1055.89 s [unordered-containers] Data.HashMap.Strict
  17141. 1055.89 s [unordered-containers] instances
  17142. 1055.89 s [unordered-containers] Eq
  17143. 1055.89 s [unordered-containers] ==: OK (0.02s)
  17144. 1055.89 s [unordered-containers] +++ OK, passed 100 tests.
  17145. 1055.89 s [unordered-containers] /=: OK (0.02s)
  17146. 1055.89 s [unordered-containers] +++ OK, passed 100 tests.
  17147. 1055.89 s [unordered-containers] Ord
  17148. 1055.89 s [unordered-containers] compare reflexive: OK (0.01s)
  17149. 1055.89 s [unordered-containers] +++ OK, passed 100 tests.
  17150. 1055.89 s [unordered-containers] compare transitive: OK (0.03s)
  17151. 1055.89 s [unordered-containers] +++ OK, passed 100 tests.
  17152. 1055.89 s [unordered-containers] compare antisymmetric: OK (0.02s)
  17153. 1055.89 s [unordered-containers] +++ OK, passed 100 tests.
  17154. 1055.89 s [unordered-containers] Ord => Eq: OK (0.01s)
  17155. 1055.89 s [unordered-containers] +++ OK, passed 100 tests.
  17156. 1055.89 s [unordered-containers] Read/Show: OK (0.11s)
  17157. 1055.89 s [unordered-containers] +++ OK, passed 100 tests.
  17158. 1055.89 s [unordered-containers] Functor: OK (0.03s)
  17159. 1055.89 s [unordered-containers] +++ OK, passed 100 tests.
  17160. 1055.89 s [unordered-containers] Foldable: OK
  17161. 1055.89 s [unordered-containers] +++ OK, passed 100 tests.
  17162. 1055.89 s [unordered-containers] Bifoldable
  17163. 1055.89 s [unordered-containers] bifoldMap: OK (0.01s)
  17164. 1055.89 s [unordered-containers] +++ OK, passed 100 tests.
  17165. 1055.89 s [unordered-containers] bifoldr: OK
  17166. 1055.89 s [unordered-containers] +++ OK, passed 100 tests.
  17167. 1055.89 s [unordered-containers] bifoldl: OK
  17168. 1055.89 s [unordered-containers] +++ OK, passed 100 tests.
  17169. 1055.89 s [unordered-containers] Hashable: OK (0.02s)
  17170. 1055.89 s [unordered-containers] +++ OK, passed 100 tests.
  17171. 1055.89 s [unordered-containers] empty
  17172. 1055.89 s [unordered-containers] valid: OK
  17173. 1055.89 s [unordered-containers] +++ OK, passed 1 test.
  17174. 1055.89 s [unordered-containers] singleton
  17175. 1055.89 s [unordered-containers] valid: OK
  17176. 1055.89 s [unordered-containers] +++ OK, passed 100 tests.
  17177. 1055.89 s [unordered-containers] size: OK
  17178. 1055.89 s [unordered-containers] +++ OK, passed 100 tests.
  17179. 1055.89 s [unordered-containers] member: OK
  17180. 1055.89 s [unordered-containers] +++ OK, passed 100 tests.
  17181. 1055.89 s [unordered-containers] lookup: OK
  17182. 1055.89 s [unordered-containers] +++ OK, passed 100 tests.
  17183. 1055.89 s [unordered-containers] !?: OK (0.01s)
  17184. 1055.89 s [unordered-containers] +++ OK, passed 100 tests.
  17185. 1055.89 s [unordered-containers] insert
  17186. 1055.89 s [unordered-containers] model: OK (0.01s)
  17187. 1055.89 s [unordered-containers] +++ OK, passed 100 tests.
  17188. 1055.89 s [unordered-containers] valid: OK
  17189. 1055.89 s [unordered-containers] +++ OK, passed 100 tests.
  17190. 1055.89 s [unordered-containers] insertWith
  17191. 1055.89 s [unordered-containers] insertWith: OK (0.02s)
  17192. 1055.89 s [unordered-containers] +++ OK, passed 100 tests.
  17193. 1055.89 s [unordered-containers] valid: OK
  17194. 1055.89 s [unordered-containers] +++ OK, passed 100 tests.
  17195. 1055.89 s [unordered-containers] delete
  17196. 1055.90 s [unordered-containers] model: OK (0.01s)
  17197. 1055.90 s [unordered-containers] +++ OK, passed 100 tests.
  17198. 1055.90 s [unordered-containers] valid: OK (0.01s)
  17199. 1055.90 s [unordered-containers] +++ OK, passed 100 tests.
  17200. 1055.90 s [unordered-containers] adjust
  17201. 1055.90 s [unordered-containers] model: OK (0.01s)
  17202. 1055.90 s [unordered-containers] +++ OK, passed 100 tests.
  17203. 1055.90 s [unordered-containers] valid: OK
  17204. 1055.90 s [unordered-containers] +++ OK, passed 100 tests.
  17205. 1055.90 s [unordered-containers] update
  17206. 1055.90 s [unordered-containers] model: OK (0.01s)
  17207. 1055.90 s [unordered-containers] +++ OK, passed 100 tests.
  17208. 1055.90 s [unordered-containers] valid: OK
  17209. 1055.90 s [unordered-containers] +++ OK, passed 100 tests.
  17210. 1055.90 s [unordered-containers] alter
  17211. 1055.90 s [unordered-containers] model: OK
  17212. 1055.90 s [unordered-containers] +++ OK, passed 100 tests.
  17213. 1055.90 s [unordered-containers] valid: OK
  17214. 1055.90 s [unordered-containers] +++ OK, passed 100 tests.
  17215. 1055.90 s [unordered-containers] alterF
  17216. 1055.90 s [unordered-containers] model
  17217. 1055.90 s [unordered-containers] []: OK (0.09s)
  17218. 1055.90 s [unordered-containers] +++ OK, passed 100 tests.
  17219. 1055.90 s [unordered-containers] adjust: OK (0.02s)
  17220. 1055.90 s [unordered-containers] +++ OK, passed 100 tests.
  17221. 1055.90 s [unordered-containers] insert: OK (0.01s)
  17222. 1055.90 s [unordered-containers] +++ OK, passed 100 tests.
  17223. 1055.90 s [unordered-containers] insertWith: OK (0.01s)
  17224. 1055.90 s [unordered-containers] +++ OK, passed 100 tests.
  17225. 1055.90 s [unordered-containers] delete: OK (0.01s)
  17226. 1055.90 s [unordered-containers] +++ OK, passed 100 tests.
  17227. 1055.90 s [unordered-containers] lookup: OK (0.01s)
  17228. 1055.90 s [unordered-containers] +++ OK, passed 100 tests.
  17229. 1055.90 s [unordered-containers] valid: OK (0.03s)
  17230. 1055.90 s [unordered-containers] +++ OK, passed 100 tests.
  17231. 1055.90 s [unordered-containers] isSubmapOf
  17232. 1055.90 s [unordered-containers] model: OK (0.01s)
  17233. 1055.90 s [unordered-containers] +++ OK, passed 100 tests.
  17234. 1055.90 s [unordered-containers] m ⊆ m: OK
  17235. 1055.90 s [unordered-containers] +++ OK, passed 100 tests.
  17236. 1055.90 s [unordered-containers] m1 ⊆ m1 ∪ m2: OK (0.02s)
  17237. 1055.90 s [unordered-containers] +++ OK, passed 100 tests.
  17238. 1055.90 s [unordered-containers] m1\m2 ⊆ m1: OK (0.01s)
  17239. 1055.90 s [unordered-containers] +++ OK, passed 100 tests.
  17240. 1055.90 s [unordered-containers] m1 ∩ m2 ≠ ∅ ⇒ m1 ⊈ m1\m2 : OK (0.02s)
  17241. 1055.90 s [unordered-containers] +++ OK, passed 100 tests; 135 discarded.
  17242. 1055.90 s [unordered-containers] delete k m ⊆ m: OK (0.01s)
  17243. 1055.90 s [unordered-containers] +++ OK, passed 100 tests; 25 discarded.
  17244. 1055.90 s [unordered-containers] m ⊈ delete k m : OK
  17245. 1055.90 s [unordered-containers] +++ OK, passed 100 tests; 15 discarded.
  17246. 1055.90 s [unordered-containers] k ∉ m ⇒ m ⊆ insert k v m: OK
  17247. 1055.90 s [unordered-containers] +++ OK, passed 100 tests; 10 discarded.
  17248. 1055.90 s [unordered-containers] k ∉ m ⇒ insert k v m ⊈ m: OK
  17249. 1055.90 s [unordered-containers] +++ OK, passed 100 tests; 13 discarded.
  17250. 1055.90 s [unordered-containers] union
  17251. 1055.90 s [unordered-containers] model: OK (0.03s)
  17252. 1055.90 s [unordered-containers] +++ OK, passed 100 tests.
  17253. 1055.90 s [unordered-containers] valid: OK (0.01s)
  17254. 1055.90 s [unordered-containers] +++ OK, passed 100 tests.
  17255. 1055.90 s [unordered-containers] unionWith
  17256. 1055.90 s [unordered-containers] model: OK (0.04s)
  17257. 1055.90 s [unordered-containers] +++ OK, passed 100 tests.
  17258. 1055.90 s [unordered-containers] valid: OK
  17259. 1055.90 s [unordered-containers] +++ OK, passed 100 tests.
  17260. 1055.90 s [unordered-containers] unionWithKey
  17261. 1055.90 s [unordered-containers] model: OK (0.06s)
  17262. 1055.90 s [unordered-containers] +++ OK, passed 100 tests.
  17263. 1055.90 s [unordered-containers] valid: OK (0.04s)
  17264. 1055.90 s [unordered-containers] +++ OK, passed 100 tests.
  17265. 1055.90 s [unordered-containers] unions
  17266. 1056.00 s [unordered-containers] model: OK (0.49s)
  17267. 1056.00 s [unordered-containers] +++ OK, passed 100 tests.
  17268. 1056.00 s [unordered-containers] valid: OK (0.36s)
  17269. 1056.00 s [unordered-containers] +++ OK, passed 100 tests.
  17270. 1056.00 s [unordered-containers] difference
  17271. 1056.00 s [unordered-containers] model: OK (0.02s)
  17272. 1056.00 s [unordered-containers] +++ OK, passed 100 tests.
  17273. 1056.00 s [unordered-containers] valid: OK (0.01s)
  17274. 1056.00 s [unordered-containers] +++ OK, passed 100 tests.
  17275. 1056.00 s [unordered-containers] differenceWith
  17276. 1056.00 s [unordered-containers] model: OK (0.04s)
  17277. 1056.00 s [unordered-containers] +++ OK, passed 100 tests.
  17278. 1056.00 s [unordered-containers] valid: OK (0.03s)
  17279. 1056.00 s [unordered-containers] +++ OK, passed 100 tests.
  17280. 1056.00 s [unordered-containers] intersection
  17281. 1056.00 s [unordered-containers] model: OK (0.02s)
  17282. 1056.00 s [unordered-containers] +++ OK, passed 100 tests.
  17283. 1056.00 s [unordered-containers] valid: OK (0.01s)
  17284. 1056.00 s [unordered-containers] +++ OK, passed 100 tests.
  17285. 1056.00 s [unordered-containers] intersectionWith
  17286. 1056.00 s [unordered-containers] model: OK (0.04s)
  17287. 1056.00 s [unordered-containers] +++ OK, passed 100 tests.
  17288. 1056.00 s [unordered-containers] valid: OK (0.02s)
  17289. 1056.00 s [unordered-containers] +++ OK, passed 100 tests.
  17290. 1056.00 s [unordered-containers] intersectionWithKey
  17291. 1056.00 s [unordered-containers] model: OK (0.07s)
  17292. 1056.00 s [unordered-containers] +++ OK, passed 100 tests.
  17293. 1056.00 s [unordered-containers] valid: OK (0.04s)
  17294. 1056.00 s [unordered-containers] +++ OK, passed 100 tests.
  17295. 1056.00 s [unordered-containers] compose
  17296. 1056.00 s [unordered-containers] valid: OK (0.02s)
  17297. 1056.00 s [unordered-containers] +++ OK, passed 100 tests.
  17298. 1056.00 s [unordered-containers] map
  17299. 1056.00 s [unordered-containers] model: OK (0.04s)
  17300. 1056.00 s [unordered-containers] +++ OK, passed 100 tests.
  17301. 1056.00 s [unordered-containers] valid: OK (0.03s)
  17302. 1056.00 s [unordered-containers] +++ OK, passed 100 tests.
  17303. 1056.00 s [unordered-containers] traverseWithKey
  17304. 1056.00 s [unordered-containers] model: OK (0.07s)
  17305. 1056.00 s [unordered-containers] +++ OK, passed 100 tests.
  17306. 1056.00 s [unordered-containers] valid: OK (0.01s)
  17307. 1056.00 s [unordered-containers] +++ OK, passed 100 tests.
  17308. 1056.00 s [unordered-containers] mapKeys
  17309. 1056.00 s [unordered-containers] model: OK (0.01s)
  17310. 1056.00 s [unordered-containers] +++ OK, passed 100 tests.
  17311. 1056.00 s [unordered-containers] valid: OK (0.22s)
  17312. 1056.00 s [unordered-containers] +++ OK, passed 100 tests.
  17313. 1056.00 s [unordered-containers] foldr: OK (0.01s)
  17314. 1056.00 s [unordered-containers] +++ OK, passed 100 tests.
  17315. 1056.00 s [unordered-containers] foldl: OK (0.01s)
  17316. 1056.00 s [unordered-containers] +++ OK, passed 100 tests.
  17317. 1056.00 s [unordered-containers] foldrWithKey: OK
  17318. 1056.00 s [unordered-containers] +++ OK, passed 100 tests.
  17319. 1056.00 s [unordered-containers] foldlWithKey: OK
  17320. 1056.00 s [unordered-containers] +++ OK, passed 100 tests.
  17321. 1056.00 s [unordered-containers] foldrWithKey': OK
  17322. 1056.00 s [unordered-containers] +++ OK, passed 100 tests.
  17323. 1056.00 s [unordered-containers] foldlWithKey': OK
  17324. 1056.00 s [unordered-containers] +++ OK, passed 100 tests.
  17325. 1056.00 s [unordered-containers] foldl': OK (0.02s)
  17326. 1056.00 s [unordered-containers] +++ OK, passed 100 tests.
  17327. 1056.00 s [unordered-containers] foldr': OK (0.01s)
  17328. 1056.01 s [unordered-containers] +++ OK, passed 100 tests.
  17329. 1056.01 s [unordered-containers] foldMapWithKey: OK (0.01s)
  17330. 1056.01 s [unordered-containers] +++ OK, passed 100 tests.
  17331. 1056.01 s [unordered-containers] filter
  17332. 1056.01 s [unordered-containers] model: OK (0.05s)
  17333. 1056.01 s [unordered-containers] +++ OK, passed 100 tests.
  17334. 1056.01 s [unordered-containers] valid: OK (0.03s)
  17335. 1056.01 s [unordered-containers] +++ OK, passed 100 tests.
  17336. 1056.01 s [unordered-containers] filterWithKey
  17337. 1056.01 s [unordered-containers] model: OK (0.38s)
  17338. 1056.01 s [unordered-containers] +++ OK, passed 100 tests.
  17339. 1056.01 s [unordered-containers] valid: OK (0.29s)
  17340. 1056.01 s [unordered-containers] +++ OK, passed 100 tests.
  17341. 1056.01 s [unordered-containers] mapMaybe
  17342. 1056.01 s [unordered-containers] model: OK (0.04s)
  17343. 1056.01 s [unordered-containers] +++ OK, passed 100 tests.
  17344. 1056.01 s [unordered-containers] valid: OK (0.02s)
  17345. 1056.01 s [unordered-containers] +++ OK, passed 100 tests.
  17346. 1056.01 s [unordered-containers] mapMaybeWithKey
  17347. 1056.02 s [unordered-containers] model: OK (0.39s)
  17348. 1056.02 s [unordered-containers] +++ OK, passed 100 tests.
  17349. 1056.02 s [unordered-containers] valid: OK (0.26s)
  17350. 1056.02 s [unordered-containers] +++ OK, passed 100 tests.
  17351. 1056.02 s [unordered-containers] elems: OK
  17352. 1056.02 s [unordered-containers] +++ OK, passed 100 tests.
  17353. 1056.02 s [unordered-containers] keys: OK (0.01s)
  17354. 1056.02 s [unordered-containers] +++ OK, passed 100 tests.
  17355. 1056.02 s [unordered-containers] fromList
  17356. 1056.02 s [unordered-containers] model: OK (0.01s)
  17357. 1056.02 s [unordered-containers] +++ OK, passed 100 tests.
  17358. 1056.02 s [unordered-containers] valid: OK
  17359. 1056.02 s [unordered-containers] +++ OK, passed 100 tests.
  17360. 1056.02 s [unordered-containers] fromListWith
  17361. 1056.02 s [unordered-containers] model: OK
  17362. 1056.02 s [unordered-containers] +++ OK, passed 100 tests.
  17363. 1056.02 s [unordered-containers] valid: OK (0.02s)
  17364. 1056.02 s [unordered-containers] +++ OK, passed 100 tests.
  17365. 1056.02 s [unordered-containers] fromListWithKey
  17366. 1056.02 s [unordered-containers] model: OK
  17367. 1056.02 s [unordered-containers] +++ OK, passed 100 tests.
  17368. 1056.02 s [unordered-containers] valid: OK (0.02s)
  17369. 1056.02 s [unordered-containers] +++ OK, passed 100 tests.
  17370. 1056.02 s [unordered-containers] toList: OK (0.01s)
  17371. 1056.02 s [unordered-containers] +++ OK, passed 100 tests.
  17372. 1056.02 s [unordered-containers] Data.HashSet
  17373. 1056.02 s [unordered-containers] instances
  17374. 1056.02 s [unordered-containers] Eq
  17375. 1056.02 s [unordered-containers] ==: OK
  17376. 1056.02 s [unordered-containers] +++ OK, passed 100 tests.
  17377. 1056.02 s [unordered-containers] == permutations: OK (0.02s)
  17378. 1056.02 s [unordered-containers] +++ OK, passed 100 tests.
  17379. 1056.02 s [unordered-containers] /=: OK (0.02s)
  17380. 1056.02 s [unordered-containers] +++ OK, passed 100 tests.
  17381. 1056.02 s [unordered-containers] Ord
  17382. 1056.02 s [unordered-containers] compare reflexive: OK
  17383. 1056.02 s [unordered-containers] +++ OK, passed 100 tests.
  17384. 1056.02 s [unordered-containers] compare transitive: OK
  17385. 1056.02 s [unordered-containers] +++ OK, passed 100 tests.
  17386. 1056.02 s [unordered-containers] compare antisymmetric: OK (0.02s)
  17387. 1056.02 s [unordered-containers] +++ OK, passed 100 tests.
  17388. 1056.02 s [unordered-containers] Ord => Eq: OK (0.02s)
  17389. 1056.02 s [unordered-containers] +++ OK, passed 100 tests.
  17390. 1056.02 s [unordered-containers] Read/Show: OK (0.17s)
  17391. 1056.02 s [unordered-containers] +++ OK, passed 100 tests.
  17392. 1056.02 s [unordered-containers] Foldable: OK (0.01s)
  17393. 1056.02 s [unordered-containers] +++ OK, passed 100 tests.
  17394. 1056.02 s [unordered-containers] Hashable: OK (0.02s)
  17395. 1056.02 s [unordered-containers] +++ OK, passed 100 tests.
  17396. 1056.02 s [unordered-containers] size: OK
  17397. 1056.02 s [unordered-containers] +++ OK, passed 100 tests.
  17398. 1056.02 s [unordered-containers] member: OK
  17399. 1056.02 s [unordered-containers] +++ OK, passed 100 tests.
  17400. 1056.02 s [unordered-containers] insert: OK (0.01s)
  17401. 1056.02 s [unordered-containers] +++ OK, passed 100 tests.
  17402. 1056.02 s [unordered-containers] delete: OK (0.02s)
  17403. 1056.02 s [unordered-containers] +++ OK, passed 100 tests.
  17404. 1056.02 s [unordered-containers] union: OK (0.02s)
  17405. 1056.02 s [unordered-containers] +++ OK, passed 100 tests.
  17406. 1056.02 s [unordered-containers] map: OK (0.29s)
  17407. 1056.02 s [unordered-containers] +++ OK, passed 100 tests.
  17408. 1056.02 s [unordered-containers] foldr: OK (0.01s)
  17409. 1056.02 s [unordered-containers] +++ OK, passed 100 tests.
  17410. 1056.02 s [unordered-containers] foldl': OK (0.01s)
  17411. 1056.02 s [unordered-containers] +++ OK, passed 100 tests.
  17412. 1056.02 s [unordered-containers] filter: OK (0.27s)
  17413. 1056.02 s [unordered-containers] +++ OK, passed 100 tests.
  17414. 1056.02 s [unordered-containers] toList: OK (0.01s)
  17415. 1056.02 s [unordered-containers] +++ OK, passed 100 tests.
  17416. 1056.02 s [unordered-containers] Data.HashMap.Internal.List
  17417. 1056.02 s [unordered-containers] isPermutationBy: OK (0.01s)
  17418. 1056.02 s [unordered-containers] +++ OK, passed 100 tests.
  17419. 1056.02 s [unordered-containers] isPermutationBy of different length: OK
  17420. 1056.02 s [unordered-containers] +++ OK, passed 100 tests; 13 discarded.
  17421. 1056.02 s [unordered-containers] pUnorderedCompare: OK (0.05s)
  17422. 1056.02 s [unordered-containers] +++ OK, passed 100 tests.
  17423. 1056.02 s [unordered-containers] modelUnorderedCompare
  17424. 1056.02 s [unordered-containers] reflexive: OK
  17425. 1056.02 s [unordered-containers] +++ OK, passed 100 tests.
  17426. 1056.02 s [unordered-containers] anti-symmetric: OK
  17427. 1056.02 s [unordered-containers] +++ OK, passed 100 tests.
  17428. 1056.02 s [unordered-containers] transitive: OK
  17429. 1056.02 s [unordered-containers] +++ OK, passed 100 tests.
  17430. 1056.02 s [unordered-containers] Regression tests
  17431. 1056.02 s [unordered-containers] issue32: OK
  17432. 1056.02 s [unordered-containers] issue39a: OK
  17433. 1056.02 s [unordered-containers] issue39b: OK
  17434. 1056.02 s [unordered-containers] +++ OK, passed 100 tests.
  17435. 1056.02 s [unordered-containers] issue254 lazy: OK
  17436. 1056.02 s [unordered-containers] issue254 strict: OK
  17437. 1056.02 s [unordered-containers] issue379
  17438. 1056.02 s [unordered-containers] Lazy.unionWith: OK
  17439. 1056.02 s [unordered-containers] union: OK
  17440. 1056.02 s [unordered-containers] Strict.unionWith: OK
  17441. 1056.02 s [unordered-containers] Strict.unionWithKey: OK
  17442. 1056.02 s [unordered-containers] issue381
  17443. 1056.02 s [unordered-containers] mapMaybe: OK
  17444. 1056.02 s [unordered-containers] mapMaybeWithKey: OK
  17445. 1056.02 s [unordered-containers] issue382: OK
  17446. 1056.02 s [unordered-containers] issue383: OK
  17447. 1056.02 s [unordered-containers] issue420: OK
  17448. 1056.02 s [unordered-containers] issue491
  17449. 1056.02 s [unordered-containers] 1: OK
  17450. 1056.02 s [unordered-containers] 2: OK
  17451. 1056.02 s [unordered-containers] 3: OK
  17452. 1056.02 s [unordered-containers] Strictness
  17453. 1056.02 s [unordered-containers] HashMap.Strict
  17454. 1056.02 s [unordered-containers] singleton is key-strict: OK
  17455. 1056.02 s [unordered-containers] +++ OK, passed 100 tests.
  17456. 1056.02 s [unordered-containers] singleton is value-strict: OK
  17457. 1056.02 s [unordered-containers] +++ OK, passed 100 tests.
  17458. 1056.02 s [unordered-containers] member is key-strict: OK
  17459. 1056.02 s [unordered-containers] +++ OK, passed 100 tests.
  17460. 1056.02 s [unordered-containers] lookup is key-strict: OK
  17461. 1056.02 s [unordered-containers] +++ OK, passed 100 tests.
  17462. 1056.02 s [unordered-containers] lookupDefault is key-strict: OK
  17463. 1056.02 s [unordered-containers] +++ OK, passed 100 tests.
  17464. 1056.02 s [unordered-containers] findWithDefault is key-strict: OK
  17465. 1056.02 s [unordered-containers] +++ OK, passed 100 tests.
  17466. 1056.02 s [unordered-containers] ! is key-strict: OK
  17467. 1056.02 s [unordered-containers] +++ OK, passed 100 tests.
  17468. 1056.02 s [unordered-containers] delete is key-strict: OK
  17469. 1056.02 s [unordered-containers] +++ OK, passed 100 tests.
  17470. 1056.02 s [unordered-containers] adjust is key-strict: OK
  17471. 1056.02 s [unordered-containers] +++ OK, passed 100 tests.
  17472. 1056.02 s [unordered-containers] adjust is value-strict: OK (0.01s)
  17473. 1056.02 s [unordered-containers] +++ OK, passed 100 tests.
  17474. 1056.02 s [unordered-containers] insert is key-strict: OK
  17475. 1056.02 s [unordered-containers] +++ OK, passed 100 tests.
  17476. 1056.02 s [unordered-containers] insert is value-strict: OK
  17477. 1056.02 s [unordered-containers] +++ OK, passed 100 tests.
  17478. 1056.02 s [unordered-containers] insertWith is key-strict: OK
  17479. 1056.02 s [unordered-containers] +++ OK, passed 100 tests.
  17480. 1056.02 s [unordered-containers] insertWith is value-strict: OK (0.02s)
  17481. 1056.02 s [unordered-containers] +++ OK, passed 100 tests.
  17482. 1056.02 s [unordered-containers] fromList is key-strict: OK
  17483. 1056.02 s [unordered-containers] +++ OK, passed 100 tests.
  17484. 1056.02 s [unordered-containers] fromList is value-strict: OK
  17485. 1056.02 s [unordered-containers] +++ OK, passed 100 tests.
  17486. 1056.02 s [unordered-containers] fromListWith is key-strict: OK
  17487. 1056.02 s [unordered-containers] +++ OK, passed 100 tests.
  17488. 1056.02 s [unordered-containers] fromListWith is value-strict: OK
  17489. 1056.02 s [unordered-containers] +++ OK, passed 100 tests.
  17490. 1056.02 s [unordered-containers]
  17491. 1056.02 s [unordered-containers] All 257 tests passed (0.68s)
  17492. 1056.03 s [unordered-containers] Test suite unordered-containers-tests: PASS
  17493. 1056.03 s [unordered-containers] Test suite logged to:
  17494. 1056.03 s [unordered-containers] dist/test/unordered-containers-0.2.20.1-unordered-containers-tests.log
  17495. 1056.03 s [unordered-containers] 1 of 1 test suites (1 of 1 test cases) passed.
  17496. 1056.04 s [unordered-containers] Phase: haddockPhase
  17497. 1056.17 s [unordered-containers] Preprocessing library for unordered-containers-0.2.20.1...
  17498. 1056.17 s [unordered-containers] Running Haddock on library for unordered-containers-0.2.20.1...
  17499. 1056.42 s [unordered-containers] Data/HashMap/Internal.hs:12:14-23: warning: [GHC-53692] [-Wdeprecated-flags]
  17500. 1056.42 s [unordered-containers] -XTypeInType is deprecated: use -XDataKinds and -XPolyKinds instead
  17501. 1056.42 s [unordered-containers] |
  17502. 1056.42 s [unordered-containers] 12 | {-# LANGUAGE TypeInType #-}
  17503. 1056.42 s [unordered-containers] | ^^^^^^^^^^
  17504. 1056.42 s [unordered-containers]
  17505. 1057.07 s [unordered-containers] [1 of 9] Compiling Data.HashMap.Internal.Array ( Data/HashMap/Internal/Array.hs, nothing )
  17506. 1057.33 s [unordered-containers] Data/HashMap/Internal/Array.hs:83:1-35: warning: [GHC-66111] [-Wunused-imports]
  17507. 1057.33 s [unordered-containers] The import of ‘Control.Applicative’ is redundant
  17508. 1057.33 s [unordered-containers] except perhaps to import instances from ‘Control.Applicative’
  17509. 1057.33 s [unordered-containers] To import instances alone, use: import Control.Applicative()
  17510. 1057.33 s [unordered-containers] |
  17511. 1057.33 s [unordered-containers] 83 | import Control.Applicative (liftA2)
  17512. 1057.33 s [unordered-containers] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  17513. 1057.33 s [unordered-containers]
  17514. 1057.33 s [unordered-containers] [2 of 9] Compiling Data.HashMap.Internal.List ( Data/HashMap/Internal/List.hs, nothing )
  17515. 1057.35 s [unordered-containers] [3 of 9] Compiling Data.HashMap.Internal ( Data/HashMap/Internal.hs, nothing )
  17516. 1058.11 s [unordered-containers] [4 of 9] Compiling Data.HashMap.Internal.Debug ( Data/HashMap/Internal/Debug.hs, nothing )
  17517. 1058.14 s [unordered-containers] [5 of 9] Compiling Data.HashMap.Internal.Strict ( Data/HashMap/Internal/Strict.hs, nothing )
  17518. 1058.25 s [unordered-containers] [6 of 9] Compiling Data.HashSet.Internal ( Data/HashSet/Internal.hs, nothing )
  17519. 1058.31 s [unordered-containers] [7 of 9] Compiling Data.HashSet ( Data/HashSet.hs, nothing )
  17520. 1058.31 s [unordered-containers] [8 of 9] Compiling Data.HashMap.Strict ( Data/HashMap/Strict.hs, nothing )
  17521. 1058.31 s [unordered-containers] [9 of 9] Compiling Data.HashMap.Lazy ( Data/HashMap/Lazy.hs, nothing )
  17522. 1058.31 s [unordered-containers] Haddock coverage:
  17523. 1058.32 s [unordered-containers] 33% ( 16 / 48) in 'Data.HashMap.Internal.Array'
  17524. 1058.32 s [unordered-containers] Missing documentation for:
  17525. 1058.32 s [unordered-containers] Array (Data/HashMap/Internal/Array.hs:125)
  17526. 1058.32 s [unordered-containers] MArray (Data/HashMap/Internal/Array.hs:157)
  17527. 1058.32 s [unordered-containers] new_ (Data/HashMap/Internal/Array.hs:208)
  17528. 1058.32 s [unordered-containers] singleton (Data/HashMap/Internal/Array.hs:225)
  17529. 1058.32 s [unordered-containers] singletonM (Data/HashMap/Internal/Array.hs:229)
  17530. 1058.32 s [unordered-containers] snoc (Data/HashMap/Internal/Array.hs:233)
  17531. 1058.32 s [unordered-containers] pair (Data/HashMap/Internal/Array.hs:242)
  17532. 1058.32 s [unordered-containers] length (Data/HashMap/Internal/Array.hs:154)
  17533. 1058.32 s [unordered-containers] lengthM (Data/HashMap/Internal/Array.hs:162)
  17534. 1058.32 s [unordered-containers] read (Data/HashMap/Internal/Array.hs:249)
  17535. 1058.32 s [unordered-containers] write (Data/HashMap/Internal/Array.hs:255)
  17536. 1058.32 s [unordered-containers] index (Data/HashMap/Internal/Array.hs:262)
  17537. 1058.32 s [unordered-containers] indexM (Data/HashMap/Internal/Array.hs:274)
  17538. 1058.32 s [unordered-containers] index# (Data/HashMap/Internal/Array.hs:268)
  17539. 1058.32 s [unordered-containers] sameArray1 (Data/HashMap/Internal/Array.hs:140)
  17540. 1058.32 s [unordered-containers] unsafeFreeze (Data/HashMap/Internal/Array.hs:280)
  17541. 1058.32 s [unordered-containers] unsafeThaw (Data/HashMap/Internal/Array.hs:286)
  17542. 1058.32 s [unordered-containers] unsafeSameArray (Data/HashMap/Internal/Array.hs:136)
  17543. 1058.32 s [unordered-containers] run (Data/HashMap/Internal/Array.hs:292)
  17544. 1058.32 s [unordered-containers] cloneM (Data/HashMap/Internal/Array.hs:314)
  17545. 1058.32 s [unordered-containers] foldl (Data/HashMap/Internal/Array.hs:404)
  17546. 1058.32 s [unordered-containers] foldl' (Data/HashMap/Internal/Array.hs:375)
  17547. 1058.32 s [unordered-containers] foldr (Data/HashMap/Internal/Array.hs:394)
  17548. 1058.32 s [unordered-containers] foldr' (Data/HashMap/Internal/Array.hs:385)
  17549. 1058.32 s [unordered-containers] foldMap (Data/HashMap/Internal/Array.hs:417)
  17550. 1058.32 s [unordered-containers] thaw (Data/HashMap/Internal/Array.hs:436)
  17551. 1058.32 s [unordered-containers] map (Data/HashMap/Internal/Array.hs:461)
  17552. 1058.32 s [unordered-containers] traverse (Data/HashMap/Internal/Array.hs:537)
  17553. 1058.32 s [unordered-containers] traverse' (Data/HashMap/Internal/Array.hs:553)
  17554. 1058.32 s [unordered-containers] toList (Data/HashMap/Internal/Array.hs:529)
  17555. 1058.32 s [unordered-containers] fromList (Data/HashMap/Internal/Array.hs:494)
  17556. 1058.32 s [unordered-containers] fromList' (Data/HashMap/Internal/Array.hs:506)
  17557. 1058.32 s [unordered-containers] 25% ( 1 / 4) in 'Data.HashMap.Internal.List'
  17558. 1058.32 s [unordered-containers] Missing documentation for:
  17559. 1058.32 s [unordered-containers] isPermutationBy (Data/HashMap/Internal/List.hs:40)
  17560. 1058.32 s [unordered-containers] deleteBy (Data/HashMap/Internal/List.hs:83)
  17561. 1058.32 s [unordered-containers] unorderedCompare (Data/HashMap/Internal/List.hs:68)
  17562. 1058.32 s [unordered-containers] Warning: 'Leaf' is ambiguous. It is defined
  17563. 1058.32 s [unordered-containers] * at Data/HashMap/Internal.hs:227:7
  17564. 1058.32 s [unordered-containers] * at Data/HashMap/Internal.hs:187:1
  17565. 1058.32 s [unordered-containers] You may be able to disambiguate the identifier by qualifying it or
  17566. 1058.32 s [unordered-containers] by specifying the type/value namespace explicitly.
  17567. 1058.32 s [unordered-containers] Defaulting to the one defined at Data/HashMap/Internal.hs:187:1
  17568. 1058.32 s [unordered-containers] Warning: 'at' is out of scope.
  17569. 1058.32 s [unordered-containers] If you qualify the identifier, haddock can try to link it anyway.
  17570. 1058.33 s [unordered-containers] 88% ( 93 /105) in 'Data.HashMap.Internal'
  17571. 1058.33 s [unordered-containers] Missing documentation for:
  17572. 1058.33 s [unordered-containers] Leaf (Data/HashMap/Internal.hs:187)
  17573. 1058.33 s [unordered-containers] intersectionWithKey# (Data/HashMap/Internal.hs:1859)
  17574. 1058.33 s [unordered-containers] updateOrConcatWithKey (Data/HashMap/Internal.hs:2373)
  17575. 1058.33 s [unordered-containers] equalKeys (Data/HashMap/Internal.hs:513)
  17576. 1058.33 s [unordered-containers] equalKeys1 (Data/HashMap/Internal.hs:497)
  17577. 1058.33 s [unordered-containers] lookupRecordCollision (Data/HashMap/Internal.hs:680)
  17578. 1058.33 s [unordered-containers] LookupRes (Data/HashMap/Internal.hs:659)
  17579. 1058.33 s [unordered-containers] lookupResToMaybe (Data/HashMap/Internal.hs:662)
  17580. 1058.33 s [unordered-containers] insert' (Data/HashMap/Internal.hs:808)
  17581. 1058.33 s [unordered-containers] delete' (Data/HashMap/Internal.hs:1126)
  17582. 1058.33 s [unordered-containers] insertNewKey (Data/HashMap/Internal.hs:850)
  17583. 1058.33 s [unordered-containers] insertKeyExists (Data/HashMap/Internal.hs:885)
  17584. 1058.33 s [unordered-containers] 50% ( 3 / 6) in 'Data.HashMap.Internal.Debug'
  17585. 1058.33 s [unordered-containers] Missing documentation for:
  17586. 1058.33 s [unordered-containers] valid (Data/HashMap/Internal/Debug.hs:98)
  17587. 1058.33 s [unordered-containers] Validity (Data/HashMap/Internal/Debug.hs:43)
  17588. 1058.33 s [unordered-containers] SubHashPath (Data/HashMap/Internal/Debug.hs:75)
  17589. 1058.33 s [unordered-containers] Warning: 'lookup' is out of scope.
  17590. 1058.33 s [unordered-containers] If you qualify the identifier, haddock can try to link it anyway.
  17591. 1058.33 s [unordered-containers] Warning: 'at' is out of scope.
  17592. 1058.33 s [unordered-containers] If you qualify the identifier, haddock can try to link it anyway.
  17593. 1058.34 s [unordered-containers] 100% ( 67 / 67) in 'Data.HashMap.Internal.Strict'
  17594. 1058.34 s [unordered-containers] Warning: 'HashSet' is ambiguous. It is defined
  17595. 1058.34 s [unordered-containers] * at Data/HashSet/Internal.hs:112:21
  17596. 1058.34 s [unordered-containers] * at Data/HashSet/Internal.hs:112:1
  17597. 1058.34 s [unordered-containers] You may be able to disambiguate the identifier by qualifying it or
  17598. 1058.34 s [unordered-containers] by specifying the type/value namespace explicitly.
  17599. 1058.34 s [unordered-containers] Defaulting to the one defined at Data/HashSet/Internal.hs:112:1
  17600. 1058.34 s [unordered-containers] 100% ( 35 / 35) in 'Data.HashSet.Internal'
  17601. 1058.34 s [unordered-containers] Warning: 'HashSet' is ambiguous. It is defined
  17602. 1058.34 s [unordered-containers] * at Data/HashSet/Internal.hs:112:21
  17603. 1058.34 s [unordered-containers] * at Data/HashSet/Internal.hs:112:1
  17604. 1058.34 s [unordered-containers] You may be able to disambiguate the identifier by qualifying it or
  17605. 1058.34 s [unordered-containers] by specifying the type/value namespace explicitly.
  17606. 1058.34 s [unordered-containers] Defaulting to the one defined at Data/HashSet/Internal.hs:112:1
  17607. 1058.34 s [unordered-containers] 100% ( 32 / 32) in 'Data.HashSet'
  17608. 1058.35 s [unordered-containers] 100% ( 69 / 69) in 'Data.HashMap.Strict'
  17609. 1058.35 s [unordered-containers] 100% ( 69 / 69) in 'Data.HashMap.Lazy'
  17610. 1058.55 s [unordered-containers] Warning: Data.HashMap.Internal: could not find link destinations for:
  17611. 1058.55 s [unordered-containers] - Data.HashMap.Internal.D:R:ItemHashMap
  17612. 1058.56 s [unordered-containers] Warning: Data.HashMap.Internal.Strict: could not find link destinations for:
  17613. 1058.56 s [unordered-containers] - Data.HashMap.Internal.D:R:ItemHashMap
  17614. 1058.56 s [unordered-containers] Warning: Data.HashSet.Internal: could not find link destinations for:
  17615. 1058.56 s [unordered-containers] - Data.HashSet.Internal.D:R:ItemHashSet
  17616. 1058.56 s [unordered-containers] Warning: Data.HashSet: could not find link destinations for:
  17617. 1058.56 s [unordered-containers] - Data.HashSet.Internal.D:R:ItemHashSet
  17618. 1058.57 s [unordered-containers] Warning: Data.HashMap.Strict: could not find link destinations for:
  17619. 1058.57 s [unordered-containers] - Data.HashMap.Internal.D:R:ItemHashMap
  17620. 1058.57 s [unordered-containers] Warning: Data.HashMap.Lazy: could not find link destinations for:
  17621. 1058.57 s [unordered-containers] - Data.HashMap.Internal.D:R:ItemHashMap
  17622. 1062.98 s [unordered-containers] Documentation created: dist/doc/html/unordered-containers/,
  17623. 1062.98 s [unordered-containers] dist/doc/html/unordered-containers/unordered-containers.txt
  17624. 1063.05 s [unordered-containers] Preprocessing test suite 'unordered-containers-tests' for unordered-containers-0.2.20.1...
  17625. 1063.05 s [unordered-containers] Phase: installPhase
  17626. 1063.11 s [unordered-containers] Installing library in /nix/store/av8acxc312ry26l7zqwhzyg2xvckvabj-unordered-containers-0.2.20.1/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-1e2a/unordered-containers-0.2.20.1-191HHq0EiVBAwoS0jzVXN0
  17627. 1063.44 s [unordered-containers] Phase: fixupPhase
  17628. 1063.46 s [unordered-containers] shrinking RPATHs of ELF executables and libraries in /nix/store/av8acxc312ry26l7zqwhzyg2xvckvabj-unordered-containers-0.2.20.1
  17629. 1063.47 s [unordered-containers] shrinking /nix/store/av8acxc312ry26l7zqwhzyg2xvckvabj-unordered-containers-0.2.20.1/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-1e2a/libHSunordered-containers-0.2.20.1-191HHq0EiVBAwoS0jzVXN0-ghc9.10.2.so
  17630. 1063.48 s [unordered-containers] checking for references to /build/ in /nix/store/av8acxc312ry26l7zqwhzyg2xvckvabj-unordered-containers-0.2.20.1...
  17631. 1063.50 s [unordered-containers] patching script interpreter paths in /nix/store/av8acxc312ry26l7zqwhzyg2xvckvabj-unordered-containers-0.2.20.1
  17632. 1063.50 s [unordered-containers] stripping (with command strip and flags -S -p) in /nix/store/av8acxc312ry26l7zqwhzyg2xvckvabj-unordered-containers-0.2.20.1/lib
  17633. 1063.62 s [unordered-containers] shrinking RPATHs of ELF executables and libraries in /nix/store/wsdg7zkx5dx38g5nffv3rrn0scbczx3r-unordered-containers-0.2.20.1-doc
  17634. 1063.63 s [unordered-containers] checking for references to /build/ in /nix/store/wsdg7zkx5dx38g5nffv3rrn0scbczx3r-unordered-containers-0.2.20.1-doc...
  17635. 1063.66 s [unordered-containers] patching script interpreter paths in /nix/store/wsdg7zkx5dx38g5nffv3rrn0scbczx3r-unordered-containers-0.2.20.1-doc
  17636. 1063.76 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/av8acxc312ry26l7zqwhzyg2xvckvabj-unordered-containers-0.2.20.1 /nix/store/wsdg7zkx5dx38g5nffv3rrn0scbczx3r-unordered-containers-0.2.20.1-doc
  17637. 1064.19 s [post-build-hook] Pushing 3 paths (71 are already present) using zstd to cache sellout ⏳
  17638. 1064.19 s [post-build-hook]
  17639. 1064.57 s [post-build-hook] Pushing /nix/store/av8acxc312ry26l7zqwhzyg2xvckvabj-unordered-containers-0.2.20.1 (9.33 MiB)
  17640. 1064.58 s [post-build-hook] Pushing /nix/store/k3qc3y1f6i8g2dgz5z0cf00dj4xc5rrv-gcc-14.3.0 (245.49 MiB)
  17641. 1064.59 s [post-build-hook] Pushing /nix/store/wsdg7zkx5dx38g5nffv3rrn0scbczx3r-unordered-containers-0.2.20.1-doc (4.46 MiB)
  17642. 1069.52 s [post-build-hook]
  17643. 1069.52 s [post-build-hook] All done.
  17644. 1069.56 s [post-build-hook] Uploading to the NixCI cache: /nix/store/av8acxc312ry26l7zqwhzyg2xvckvabj-unordered-containers-0.2.20.1 /nix/store/wsdg7zkx5dx38g5nffv3rrn0scbczx3r-unordered-containers-0.2.20.1-doc
  17645. 1069.61 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  17646. 1069.78 s [post-build-hook] copying 2 paths...
  17647. 1069.78 s [post-build-hook] copying path '/nix/store/wsdg7zkx5dx38g5nffv3rrn0scbczx3r-unordered-containers-0.2.20.1-doc' to 'https://cache.nix-ci.com'...
  17648. 1070.35 s [post-build-hook] copying path '/nix/store/av8acxc312ry26l7zqwhzyg2xvckvabj-unordered-containers-0.2.20.1' to 'https://cache.nix-ci.com'...
  17649. 1072.66 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  17650. 1072.88 s [post-build-hook] copying 1 paths...
  17651. 1072.88 s [post-build-hook] copying path '/nix/store/4nn6j8mmfcxxaygrqv7qybgdcskk0lf6-unordered-containers-0.2.20.1.drv' to 'https://cache.nix-ci.com'...
  17652. 1073.02 s Progress: 11 of 19 built, 177 of 177 downloaded from cache
  17653. 1073.06 s Building quickcheck-instances
  17654. 1073.20 s [quickcheck-instances] Phase: setupCompilerEnvironmentPhase
  17655. 1073.21 s [quickcheck-instances] Build with /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2.
  17656. 1073.41 s [quickcheck-instances] Phase: unpackPhase
  17657. 1073.41 s [quickcheck-instances] unpacking source archive /nix/store/ix9xgbag8470whifn4mzlsji4yz8vrc1-quickcheck-instances-0.3.33.tar.gz
  17658. 1073.42 s [quickcheck-instances] source root is quickcheck-instances-0.3.33
  17659. 1073.43 s [quickcheck-instances] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "quickcheck-instances-0.3.33/test/Tests.hs"
  17660. 1073.43 s [quickcheck-instances] Phase: patchPhase
  17661. 1073.44 s [quickcheck-instances] Replace Cabal file with edited version from mirror://hackage/quickcheck-instances-0.3.33/revision/1.cabal.
  17662. 1073.45 s [quickcheck-instances] Phase: compileBuildDriverPhase
  17663. 1073.45 s [quickcheck-instances] setupCompileFlags: -package-db=/build/tmp.igmuGM4bKR/setup-package.conf.d -threaded
  17664. 1073.51 s [quickcheck-instances] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.igmuGM4bKR/Main.o )
  17665. 1073.57 s [quickcheck-instances] [2 of 2] Linking Setup
  17666. 1074.82 s [quickcheck-instances] Phase: updateAutotoolsGnuConfigScriptsPhase
  17667. 1074.83 s [quickcheck-instances] Phase: configurePhase
  17668. 1074.85 s [quickcheck-instances] configureFlags: --verbose --prefix=/nix/store/9ndc767d68lxqzwwjmmcv1z8gffhirdm-quickcheck-instances-0.3.33 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/ijhakcdvg5h0zrmdf07h53z7bzpm6vki-quickcheck-instances-0.3.33-doc/share/doc/quickcheck-instances-0.3.33 --with-gcc=gcc --package-db=/build/tmp.igmuGM4bKR/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
  17669. 1074.85 s [quickcheck-instances] Using Parsec parser
  17670. 1074.85 s [quickcheck-instances] Configuring quickcheck-instances-0.3.33...
  17671. 1075.45 s [quickcheck-instances] Dependency OneTuple >=0.4.2 && <0.5: using OneTuple-0.4.2
  17672. 1075.45 s [quickcheck-instances] Dependency QuickCheck >=2.14.2 && <2.16.1: using QuickCheck-2.15.0.1
  17673. 1075.45 s [quickcheck-instances] Dependency array >=0.5.3.0 && <0.6: using array-0.5.8.0
  17674. 1075.45 s [quickcheck-instances] Dependency base >=4.12.0.0 && <4.22: using base-4.20.1.0
  17675. 1075.45 s [quickcheck-instances] Dependency bytestring >=0.10.8.2 && <0.13: using bytestring-0.12.2.0
  17676. 1075.45 s [quickcheck-instances] Dependency case-insensitive >=1.2.0.11 && <1.3: using case-insensitive-1.2.1.0
  17677. 1075.45 s [quickcheck-instances] Dependency containers >=0.6.0.1 && <0.8: using containers-0.7
  17678. 1075.45 s [quickcheck-instances] Dependency data-fix >=0.3 && <0.4: using data-fix-0.3.4
  17679. 1075.45 s [quickcheck-instances] Dependency hashable >=1.4.4.0 && <1.6: using hashable-1.5.0.0
  17680. 1075.45 s [quickcheck-instances] Dependency integer-logarithms >=1.0.3.1 && <1.1: using
  17681. 1075.45 s [quickcheck-instances] integer-logarithms-1.0.4
  17682. 1075.45 s [quickcheck-instances] Dependency old-time >=1.1.0.0 && <1.2: using old-time-1.1.0.4
  17683. 1075.45 s [quickcheck-instances] Dependency primitive >=0.9.0.0 && <0.10: using primitive-0.9.1.0
  17684. 1075.45 s [quickcheck-instances] Dependency scientific >=0.3.8.0 && <0.4: using scientific-0.3.8.0
  17685. 1075.45 s [quickcheck-instances] Dependency splitmix >=0.1.0.5 && <0.2: using splitmix-0.1.3.1
  17686. 1075.45 s [quickcheck-instances] Dependency strict >=0.5 && <0.6: using strict-0.5.1
  17687. 1075.45 s [quickcheck-instances] Dependency tagged >=0.8.8 && <0.9: using tagged-0.8.9
  17688. 1075.45 s [quickcheck-instances] Dependency text >=1.2.3.0 && <1.3 || >=2.0 && <2.2: using text-2.1.2
  17689. 1075.45 s [quickcheck-instances] Dependency text-short >=0.1.4 && <0.2: using text-short-0.1.6
  17690. 1075.45 s [quickcheck-instances] Dependency these >=1.2.1 && <1.3: using these-1.2.1
  17691. 1075.45 s [quickcheck-instances] Dependency time-compat >=1.9.4 && <1.10: using time-compat-1.9.8
  17692. 1075.45 s [quickcheck-instances] Dependency transformers >=0.5.6.2 && <0.7: using transformers-0.6.1.1
  17693. 1075.45 s [quickcheck-instances] Dependency unordered-containers >=0.2.20 && <0.3: using
  17694. 1075.45 s [quickcheck-instances] unordered-containers-0.2.20.1
  17695. 1075.45 s [quickcheck-instances] Dependency uuid-types >=1.0.6 && <1.1: using uuid-types-1.0.6
  17696. 1075.45 s [quickcheck-instances] Dependency vector >=0.13.2.0 && <0.14: using vector-0.13.2.0
  17697. 1075.45 s [quickcheck-instances] Dependency QuickCheck: using QuickCheck-2.15.0.1
  17698. 1075.46 s [quickcheck-instances] Dependency base: using base-4.20.1.0
  17699. 1075.46 s [quickcheck-instances] Dependency containers: using containers-0.7
  17700. 1075.46 s [quickcheck-instances] Dependency primitive: using primitive-0.9.1.0
  17701. 1075.46 s [quickcheck-instances] Dependency quickcheck-instances: using quickcheck-instances-0.3.33
  17702. 1075.46 s [quickcheck-instances] Dependency tagged: using tagged-0.8.9
  17703. 1075.46 s [quickcheck-instances] Dependency uuid-types: using uuid-types-1.0.6
  17704. 1075.46 s [quickcheck-instances] Source component graph:
  17705. 1075.46 s [quickcheck-instances] component lib
  17706. 1075.46 s [quickcheck-instances] component test:self-test dependency lib
  17707. 1075.46 s [quickcheck-instances] Configured component graph:
  17708. 1075.46 s [quickcheck-instances] component quickcheck-instances-0.3.33-J59fUUft4T8JJJI5spwjev
  17709. 1075.46 s [quickcheck-instances] include OneTuple-0.4.2-JXxhL2OL5tjGExQz5UE7Yk
  17710. 1075.46 s [quickcheck-instances] include QuickCheck-2.15.0.1-stTt2BXNne46QxWHi9NgG
  17711. 1075.46 s [quickcheck-instances] include array-0.5.8.0-e5b8
  17712. 1075.46 s [quickcheck-instances] include base-4.20.1.0-2277
  17713. 1075.46 s [quickcheck-instances] include bytestring-0.12.2.0-5835
  17714. 1075.46 s [quickcheck-instances] include case-insensitive-1.2.1.0-8H7esbRy2UCBUil0sLvVlI
  17715. 1075.46 s [quickcheck-instances] include containers-0.7-dff9
  17716. 1075.46 s [quickcheck-instances] include data-fix-0.3.4-3hn52AC715mJFr0vKeYH6L
  17717. 1075.46 s [quickcheck-instances] include hashable-1.5.0.0-JQMp8nD7eXDLx6QkBmTwVb
  17718. 1075.46 s [quickcheck-instances] include integer-logarithms-1.0.4-39SBB10DspgDjETPDZsVaX
  17719. 1075.46 s [quickcheck-instances] include old-time-1.1.0.4-DcZ4hmZH6w2DP8nkqOwDtf
  17720. 1075.46 s [quickcheck-instances] include primitive-0.9.1.0-IS0Uswzbk4H38TsU65qNKd
  17721. 1075.46 s [quickcheck-instances] include scientific-0.3.8.0-BE3VKgb7IR0IoRVN3ZPgyv
  17722. 1075.46 s [quickcheck-instances] include splitmix-0.1.3.1-7qtx0sl3HRfIJ6ksMlgiix
  17723. 1075.46 s [quickcheck-instances] include strict-0.5.1-7Cn8BpU8oLiHFMkgUfNpfE
  17724. 1075.46 s [quickcheck-instances] include tagged-0.8.9-IiEnBtlgdt02QnWYmv5cw9
  17725. 1075.46 s [quickcheck-instances] include text-2.1.2-9845
  17726. 1075.46 s [quickcheck-instances] include text-short-0.1.6-4t3tUWj3Vh5dGMxtcuKBb
  17727. 1075.46 s [quickcheck-instances] include these-1.2.1-2cgg8rWbmGu6xKp0FOGi7d
  17728. 1075.46 s [quickcheck-instances] include time-compat-1.9.8-3GQl8sq7BeGLOx0SxE9i0H
  17729. 1075.46 s [quickcheck-instances] include transformers-0.6.1.1-407f
  17730. 1075.46 s [quickcheck-instances] include unordered-containers-0.2.20.1-191HHq0EiVBAwoS0jzVXN0
  17731. 1075.46 s [quickcheck-instances] include uuid-types-1.0.6-7l8q6nkYx5I1DURoLXVxPR
  17732. 1075.46 s [quickcheck-instances] include vector-0.13.2.0-6XtMmq2Ff9ODcKEbpcqiG
  17733. 1075.46 s [quickcheck-instances] component quickcheck-instances-0.3.33-2lWbcDVJsiNAXLFjE1ME67-self-test
  17734. 1075.46 s [quickcheck-instances] include QuickCheck-2.15.0.1-stTt2BXNne46QxWHi9NgG
  17735. 1075.46 s [quickcheck-instances] include base-4.20.1.0-2277
  17736. 1075.46 s [quickcheck-instances] include containers-0.7-dff9
  17737. 1075.46 s [quickcheck-instances] include primitive-0.9.1.0-IS0Uswzbk4H38TsU65qNKd
  17738. 1075.46 s [quickcheck-instances] include quickcheck-instances-0.3.33-J59fUUft4T8JJJI5spwjev
  17739. 1075.46 s [quickcheck-instances] include tagged-0.8.9-IiEnBtlgdt02QnWYmv5cw9
  17740. 1075.46 s [quickcheck-instances] include uuid-types-1.0.6-7l8q6nkYx5I1DURoLXVxPR
  17741. 1075.46 s [quickcheck-instances] Linked component graph:
  17742. 1075.46 s [quickcheck-instances] unit quickcheck-instances-0.3.33-J59fUUft4T8JJJI5spwjev
  17743. 1075.46 s [quickcheck-instances] include OneTuple-0.4.2-JXxhL2OL5tjGExQz5UE7Yk
  17744. 1075.46 s [quickcheck-instances] include QuickCheck-2.15.0.1-stTt2BXNne46QxWHi9NgG
  17745. 1075.46 s [quickcheck-instances] include array-0.5.8.0-e5b8
  17746. 1075.46 s [quickcheck-instances] include base-4.20.1.0-2277
  17747. 1075.46 s [quickcheck-instances] include bytestring-0.12.2.0-5835
  17748. 1075.46 s [quickcheck-instances] include case-insensitive-1.2.1.0-8H7esbRy2UCBUil0sLvVlI
  17749. 1075.46 s [quickcheck-instances] include containers-0.7-dff9
  17750. 1075.46 s [quickcheck-instances] include data-fix-0.3.4-3hn52AC715mJFr0vKeYH6L
  17751. 1075.46 s [quickcheck-instances] include hashable-1.5.0.0-JQMp8nD7eXDLx6QkBmTwVb
  17752. 1075.46 s [quickcheck-instances] include integer-logarithms-1.0.4-39SBB10DspgDjETPDZsVaX
  17753. 1075.46 s [quickcheck-instances] include old-time-1.1.0.4-DcZ4hmZH6w2DP8nkqOwDtf
  17754. 1075.46 s [quickcheck-instances] include primitive-0.9.1.0-IS0Uswzbk4H38TsU65qNKd
  17755. 1075.46 s [quickcheck-instances] include scientific-0.3.8.0-BE3VKgb7IR0IoRVN3ZPgyv
  17756. 1075.46 s [quickcheck-instances] include splitmix-0.1.3.1-7qtx0sl3HRfIJ6ksMlgiix
  17757. 1075.46 s [quickcheck-instances] include strict-0.5.1-7Cn8BpU8oLiHFMkgUfNpfE
  17758. 1075.46 s [quickcheck-instances] include tagged-0.8.9-IiEnBtlgdt02QnWYmv5cw9
  17759. 1075.46 s [quickcheck-instances] include text-2.1.2-9845
  17760. 1075.46 s [quickcheck-instances] include text-short-0.1.6-4t3tUWj3Vh5dGMxtcuKBb
  17761. 1075.46 s [quickcheck-instances] include these-1.2.1-2cgg8rWbmGu6xKp0FOGi7d
  17762. 1075.46 s [quickcheck-instances] include time-compat-1.9.8-3GQl8sq7BeGLOx0SxE9i0H
  17763. 1075.46 s [quickcheck-instances] include transformers-0.6.1.1-407f
  17764. 1075.46 s [quickcheck-instances] include unordered-containers-0.2.20.1-191HHq0EiVBAwoS0jzVXN0
  17765. 1075.46 s [quickcheck-instances] include uuid-types-1.0.6-7l8q6nkYx5I1DURoLXVxPR
  17766. 1075.46 s [quickcheck-instances] include vector-0.13.2.0-6XtMmq2Ff9ODcKEbpcqiG
  17767. 1075.46 s [quickcheck-instances] Test.QuickCheck.Instances=quickcheck-instances-0.3.33-J59fUUft4T8JJJI5spwjev:Test.QuickCheck.Instances,Test.QuickCheck.Instances.Array=quickcheck-instances-0.3.33-J59fUUft4T8JJJI5spwjev:Test.QuickCheck.Instances.Array,Test.QuickCheck.Instances.Array.Byte=quickcheck-instances-0.3.33-J59fUUft4T8JJJI5spwjev:Test.QuickCheck.Instances.Array.Byte,Test.QuickCheck.Instances.ByteString=quickcheck-instances-0.3.33-J59fUUft4T8JJJI5spwjev:Test.QuickCheck.Instances.ByteString,Test.QuickCheck.Instances.CaseInsensitive=quickcheck-instances-0.3.33-J59fUUft4T8JJJI5spwjev:Test.QuickCheck.Instances.CaseInsensitive,Test.QuickCheck.Instances.Containers=quickcheck-instances-0.3.33-J59fUUft4T8JJJI5spwjev:Test.QuickCheck.Instances.Containers,Test.QuickCheck.Instances.DataFix=quickcheck-instances-0.3.33-J59fUUft4T8JJJI5spwjev:Test.QuickCheck.Instances.DataFix,Test.QuickCheck.Instances.Hashable=quickcheck-instances-0.3.33-J59fUUft4T8JJJI5spwjev:Test.QuickCheck.Instances.Hashable,Test.QuickCheck.Instances.Natural=quickcheck-instances-0.3.33-J59fUUft4T8JJJI5spwjev:Test.QuickCheck.Instances.Natural,Test.QuickCheck.Instances.OldTime=quickcheck-instances-0.3.33-J59fUUft4T8JJJI5spwjev:Test.QuickCheck.Instances.OldTime,Test.QuickCheck.Instances.Primitive=quickcheck-instances-0.3.33-J59fUUft4T8JJJI5spwjev:Test.QuickCheck.Instances.Primitive,Test.QuickCheck.Instances.Scientific=quickcheck-instances-0.3.33-J59fUUft4T8JJJI5spwjev:Test.QuickCheck.Instances.Scientific,Test.QuickCheck.Instances.Semigroup=quickcheck-instances-0.3.33-J59fUUft4T8JJJI5spwjev:Test.QuickCheck.Instances.Semigroup,Test.QuickCheck.Instances.Solo=quickcheck-instances-0.3.33-J59fUUft4T8JJJI5spwjev:Test.QuickCheck.Instances.Solo,Test.QuickCheck.Instances.Strict=quickcheck-instances-0.3.33-J59fUUft4T8JJJI5spwjev:Test.QuickCheck.Instances.Strict,Test.QuickCheck.Instances.Tagged=quickcheck-instances-0.3.33-J59fUUft4T8JJJI5spwjev:Test.QuickCheck.Instances.Tagged,Test.QuickCheck.Instances.Text=quickcheck-instances-0.3.33-J59fUUft4T8JJJI5spwjev:Test.QuickCheck.Instances.Text,Test.QuickCheck.Instances.Text.Short=quickcheck-instances-0.3.33-J59fUUft4T8JJJI5spwjev:Test.QuickCheck.Instances.Text.Short,Test.QuickCheck.Instances.These=quickcheck-instances-0.3.33-J59fUUft4T8JJJI5spwjev:Test.QuickCheck.Instances.These,Test.QuickCheck.Instances.Time=quickcheck-instances-0.3.33-J59fUUft4T8JJJI5spwjev:Test.QuickCheck.Instances.Time,Test.QuickCheck.Instances.Transformer=quickcheck-instances-0.3.33-J59fUUft4T8JJJI5spwjev:Test.QuickCheck.Instances.Transformer,Test.QuickCheck.Instances.UUID=quickcheck-instances-0.3.33-J59fUUft4T8JJJI5spwjev:Test.QuickCheck.Instances.UUID,Test.QuickCheck.Instances.UnorderedContainers=quickcheck-instances-0.3.33-J59fUUft4T8JJJI5spwjev:Test.QuickCheck.Instances.UnorderedContainers,Test.QuickCheck.Instances.Vector=quickcheck-instances-0.3.33-J59fUUft4T8JJJI5spwjev:Test.QuickCheck.Instances.Vector,Test.QuickCheck.Instances.Void=quickcheck-instances-0.3.33-J59fUUft4T8JJJI5spwjev:Test.QuickCheck.Instances.Void
  17768. 1075.46 s [quickcheck-instances] unit quickcheck-instances-0.3.33-2lWbcDVJsiNAXLFjE1ME67-self-test
  17769. 1075.46 s [quickcheck-instances] include QuickCheck-2.15.0.1-stTt2BXNne46QxWHi9NgG
  17770. 1075.47 s [quickcheck-instances] include base-4.20.1.0-2277
  17771. 1075.47 s [quickcheck-instances] include containers-0.7-dff9
  17772. 1075.47 s [quickcheck-instances] include primitive-0.9.1.0-IS0Uswzbk4H38TsU65qNKd
  17773. 1075.47 s [quickcheck-instances] include quickcheck-instances-0.3.33-J59fUUft4T8JJJI5spwjev
  17774. 1075.47 s [quickcheck-instances] include tagged-0.8.9-IiEnBtlgdt02QnWYmv5cw9
  17775. 1075.47 s [quickcheck-instances] include uuid-types-1.0.6-7l8q6nkYx5I1DURoLXVxPR
  17776. 1075.47 s [quickcheck-instances] Ready component graph:
  17777. 1075.47 s [quickcheck-instances] definite quickcheck-instances-0.3.33-J59fUUft4T8JJJI5spwjev
  17778. 1075.47 s [quickcheck-instances] depends OneTuple-0.4.2-JXxhL2OL5tjGExQz5UE7Yk
  17779. 1075.47 s [quickcheck-instances] depends QuickCheck-2.15.0.1-stTt2BXNne46QxWHi9NgG
  17780. 1075.47 s [quickcheck-instances] depends array-0.5.8.0-e5b8
  17781. 1075.47 s [quickcheck-instances] depends base-4.20.1.0-2277
  17782. 1075.47 s [quickcheck-instances] depends bytestring-0.12.2.0-5835
  17783. 1075.47 s [quickcheck-instances] depends case-insensitive-1.2.1.0-8H7esbRy2UCBUil0sLvVlI
  17784. 1075.47 s [quickcheck-instances] depends containers-0.7-dff9
  17785. 1075.47 s [quickcheck-instances] depends data-fix-0.3.4-3hn52AC715mJFr0vKeYH6L
  17786. 1075.47 s [quickcheck-instances] depends hashable-1.5.0.0-JQMp8nD7eXDLx6QkBmTwVb
  17787. 1075.47 s [quickcheck-instances] depends integer-logarithms-1.0.4-39SBB10DspgDjETPDZsVaX
  17788. 1075.47 s [quickcheck-instances] depends old-time-1.1.0.4-DcZ4hmZH6w2DP8nkqOwDtf
  17789. 1075.47 s [quickcheck-instances] depends primitive-0.9.1.0-IS0Uswzbk4H38TsU65qNKd
  17790. 1075.47 s [quickcheck-instances] depends scientific-0.3.8.0-BE3VKgb7IR0IoRVN3ZPgyv
  17791. 1075.47 s [quickcheck-instances] depends splitmix-0.1.3.1-7qtx0sl3HRfIJ6ksMlgiix
  17792. 1075.47 s [quickcheck-instances] depends strict-0.5.1-7Cn8BpU8oLiHFMkgUfNpfE
  17793. 1075.47 s [quickcheck-instances] depends tagged-0.8.9-IiEnBtlgdt02QnWYmv5cw9
  17794. 1075.47 s [quickcheck-instances] depends text-2.1.2-9845
  17795. 1075.47 s [quickcheck-instances] depends text-short-0.1.6-4t3tUWj3Vh5dGMxtcuKBb
  17796. 1075.47 s [quickcheck-instances] depends these-1.2.1-2cgg8rWbmGu6xKp0FOGi7d
  17797. 1075.47 s [quickcheck-instances] depends time-compat-1.9.8-3GQl8sq7BeGLOx0SxE9i0H
  17798. 1075.47 s [quickcheck-instances] depends transformers-0.6.1.1-407f
  17799. 1075.47 s [quickcheck-instances] depends unordered-containers-0.2.20.1-191HHq0EiVBAwoS0jzVXN0
  17800. 1075.47 s [quickcheck-instances] depends uuid-types-1.0.6-7l8q6nkYx5I1DURoLXVxPR
  17801. 1075.47 s [quickcheck-instances] depends vector-0.13.2.0-6XtMmq2Ff9ODcKEbpcqiG
  17802. 1075.47 s [quickcheck-instances] definite quickcheck-instances-0.3.33-2lWbcDVJsiNAXLFjE1ME67-self-test
  17803. 1075.47 s [quickcheck-instances] depends QuickCheck-2.15.0.1-stTt2BXNne46QxWHi9NgG
  17804. 1075.47 s [quickcheck-instances] depends base-4.20.1.0-2277
  17805. 1075.47 s [quickcheck-instances] depends containers-0.7-dff9
  17806. 1075.47 s [quickcheck-instances] depends primitive-0.9.1.0-IS0Uswzbk4H38TsU65qNKd
  17807. 1075.47 s [quickcheck-instances] depends quickcheck-instances-0.3.33-J59fUUft4T8JJJI5spwjev
  17808. 1075.47 s [quickcheck-instances] depends tagged-0.8.9-IiEnBtlgdt02QnWYmv5cw9
  17809. 1075.47 s [quickcheck-instances] depends uuid-types-1.0.6-7l8q6nkYx5I1DURoLXVxPR
  17810. 1075.47 s [quickcheck-instances] Using Cabal-3.12.1.0 compiled by ghc-9.10
  17811. 1075.47 s [quickcheck-instances] Using compiler: ghc-9.10.2
  17812. 1075.47 s [quickcheck-instances] Using install prefix:
  17813. 1075.47 s [quickcheck-instances] /nix/store/9ndc767d68lxqzwwjmmcv1z8gffhirdm-quickcheck-instances-0.3.33
  17814. 1075.47 s [quickcheck-instances] Executables installed in:
  17815. 1075.47 s [quickcheck-instances] /nix/store/9ndc767d68lxqzwwjmmcv1z8gffhirdm-quickcheck-instances-0.3.33/bin
  17816. 1075.47 s [quickcheck-instances] Libraries installed in:
  17817. 1075.47 s [quickcheck-instances] /nix/store/9ndc767d68lxqzwwjmmcv1z8gffhirdm-quickcheck-instances-0.3.33/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-1e2a/quickcheck-instances-0.3.33-J59fUUft4T8JJJI5spwjev
  17818. 1075.47 s [quickcheck-instances] Dynamic Libraries installed in:
  17819. 1075.47 s [quickcheck-instances] /nix/store/9ndc767d68lxqzwwjmmcv1z8gffhirdm-quickcheck-instances-0.3.33/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-1e2a
  17820. 1075.47 s [quickcheck-instances] Private executables installed in:
  17821. 1075.47 s [quickcheck-instances] /nix/store/9ndc767d68lxqzwwjmmcv1z8gffhirdm-quickcheck-instances-0.3.33/libexec/x86_64-linux-ghc-9.10.2-1e2a/quickcheck-instances-0.3.33
  17822. 1075.47 s [quickcheck-instances] Data files installed in:
  17823. 1075.47 s [quickcheck-instances] /nix/store/9ndc767d68lxqzwwjmmcv1z8gffhirdm-quickcheck-instances-0.3.33/share/x86_64-linux-ghc-9.10.2-1e2a/quickcheck-instances-0.3.33
  17824. 1075.47 s [quickcheck-instances] Documentation installed in:
  17825. 1075.47 s [quickcheck-instances] /nix/store/ijhakcdvg5h0zrmdf07h53z7bzpm6vki-quickcheck-instances-0.3.33-doc/share/doc/quickcheck-instances-0.3.33
  17826. 1075.47 s [quickcheck-instances] Configuration files installed in:
  17827. 1075.47 s [quickcheck-instances] /nix/store/9ndc767d68lxqzwwjmmcv1z8gffhirdm-quickcheck-instances-0.3.33/etc
  17828. 1075.47 s [quickcheck-instances] No alex found
  17829. 1075.47 s [quickcheck-instances] Using ar found on system at:
  17830. 1075.47 s [quickcheck-instances] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
  17831. 1075.47 s [quickcheck-instances] No c2hs found
  17832. 1075.47 s [quickcheck-instances] No cpphs found
  17833. 1075.47 s [quickcheck-instances] No doctest found
  17834. 1075.47 s [quickcheck-instances] Using gcc version 14.3.0 given by user at:
  17835. 1075.47 s [quickcheck-instances] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
  17836. 1075.47 s [quickcheck-instances] Using ghc version 9.10.2 found on system at:
  17837. 1075.47 s [quickcheck-instances] /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/bin/ghc
  17838. 1075.47 s [quickcheck-instances] Using ghc-pkg version 9.10.2 found on system at:
  17839. 1075.47 s [quickcheck-instances] /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/bin/ghc-pkg-9.10.2
  17840. 1075.47 s [quickcheck-instances] No ghcjs found
  17841. 1075.47 s [quickcheck-instances] No ghcjs-pkg found
  17842. 1075.47 s [quickcheck-instances] No greencard found
  17843. 1075.47 s [quickcheck-instances] Using haddock version 2.31.0 found on system at:
  17844. 1075.47 s [quickcheck-instances] /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/bin/haddock-ghc-9.10.2
  17845. 1075.47 s [quickcheck-instances] No happy found
  17846. 1075.47 s [quickcheck-instances] Using haskell-suite found on system at: haskell-suite-dummy-location
  17847. 1075.47 s [quickcheck-instances] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  17848. 1075.47 s [quickcheck-instances] No hmake found
  17849. 1075.47 s [quickcheck-instances] Using hpc version 0.69 found on system at:
  17850. 1075.47 s [quickcheck-instances] /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/bin/hpc-ghc-9.10.2
  17851. 1075.47 s [quickcheck-instances] Using hsc2hs version 0.68.10 found on system at:
  17852. 1075.47 s [quickcheck-instances] /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/bin/hsc2hs-ghc-9.10.2
  17853. 1075.47 s [quickcheck-instances] Using hscolour version 1.25 found on system at:
  17854. 1075.47 s [quickcheck-instances] /nix/store/kb4afndnwdxxc5ps9k8xv0jzd0a9y8n5-hscolour-1.25/bin/HsColour
  17855. 1075.47 s [quickcheck-instances] No jhc found
  17856. 1075.47 s [quickcheck-instances] Using ld found on system at:
  17857. 1075.47 s [quickcheck-instances] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/ld
  17858. 1075.47 s [quickcheck-instances] No pkg-config found
  17859. 1075.47 s [quickcheck-instances] Using runghc version 9.10.2 found on system at:
  17860. 1075.47 s [quickcheck-instances] /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/bin/runghc-9.10.2
  17861. 1075.47 s [quickcheck-instances] Using strip version 2.44 found on system at:
  17862. 1075.47 s [quickcheck-instances] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
  17863. 1075.47 s [quickcheck-instances] Using tar found on system at:
  17864. 1075.47 s [quickcheck-instances] /nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
  17865. 1075.47 s [quickcheck-instances] No uhc found
  17866. 1075.58 s [quickcheck-instances] Phase: buildPhase
  17867. 1075.63 s [quickcheck-instances] Preprocessing library for quickcheck-instances-0.3.33...
  17868. 1075.64 s [quickcheck-instances] Building library for quickcheck-instances-0.3.33...
  17869. 1075.76 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 )
  17870. 1075.80 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 )
  17871. 1075.81 s [quickcheck-instances] [ 3 of 26] Compiling Test.QuickCheck.Instances.CaseInsensitive ( src/Test/QuickCheck/Instances/CaseInsensitive.hs, dist/build/Test/QuickCheck/Instances/CaseInsensitive.o, dist/build/Test/QuickCheck/Instances/CaseInsensitive.dyn_o )
  17872. 1076.04 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 )
  17873. 1076.06 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 )
  17874. 1076.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 )
  17875. 1076.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 )
  17876. 1076.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 )
  17877. 1076.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 )
  17878. 1076.40 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 )
  17879. 1076.40 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 )
  17880. 1076.40 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 )
  17881. 1076.40 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 )
  17882. 1076.40 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 )
  17883. 1076.40 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 )
  17884. 1076.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 )
  17885. 1076.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 )
  17886. 1076.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 )
  17887. 1076.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 )
  17888. 1076.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 )
  17889. 1076.82 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 )
  17890. 1076.82 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 )
  17891. 1076.82 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 )
  17892. 1076.82 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 )
  17893. 1076.82 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 )
  17894. 1076.83 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 )
  17895. 1077.13 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 )
  17896. 1077.26 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 )
  17897. 1077.62 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 )
  17898. 1077.88 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 )
  17899. 1077.93 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 )
  17900. 1077.93 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 )
  17901. 1077.93 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 )
  17902. 1077.93 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 )
  17903. 1077.93 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 )
  17904. 1077.93 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 )
  17905. 1077.93 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 )
  17906. 1077.93 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 )
  17907. 1077.93 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 )
  17908. 1077.93 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 )
  17909. 1077.93 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 )
  17910. 1077.94 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 )
  17911. 1077.94 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 )
  17912. 1077.94 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 )
  17913. 1077.94 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 )
  17914. 1078.01 s [quickcheck-instances] [20 of 26] Compiling Test.QuickCheck.Instances.Time ( src/Test/QuickCheck/Instances/Time.hs, dist/build/Test/QuickCheck/Instances/Time.p_o )
  17915. 1078.42 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 )
  17916. 1078.42 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 )
  17917. 1078.42 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 )
  17918. 1078.42 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 )
  17919. 1078.42 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 )
  17920. 1078.42 s [quickcheck-instances] [26 of 26] Compiling Test.QuickCheck.Instances ( src/Test/QuickCheck/Instances.hs, dist/build/Test/QuickCheck/Instances.p_o )
  17921. 1080.08 s [quickcheck-instances] Preprocessing test suite 'self-test' for quickcheck-instances-0.3.33...
  17922. 1080.08 s [quickcheck-instances] Building test suite 'self-test' for quickcheck-instances-0.3.33...
  17923. 1080.15 s [quickcheck-instances] [1 of 1] Compiling Main ( test/Tests.hs, dist/build/self-test/self-test-tmp/Main.o )
  17924. 1080.41 s [quickcheck-instances] [2 of 2] Linking dist/build/self-test/self-test
  17925. 1081.12 s [quickcheck-instances] Phase: checkPhase
  17926. 1081.39 s [quickcheck-instances] Running 1 test suites...
  17927. 1081.39 s [quickcheck-instances] Test suite self-test: RUNNING...
  17928. 1081.40 s [quickcheck-instances] +++ OK, passed 100 tests.
  17929. 1081.40 s [quickcheck-instances] +++ OK, passed 100 tests.
  17930. 1081.40 s [quickcheck-instances] +++ OK, passed 100 tests.
  17931. 1081.40 s [quickcheck-instances] +++ OK, passed 100 tests.
  17932. 1081.40 s [quickcheck-instances] +++ OK, passed 100 tests.
  17933. 1081.40 s [quickcheck-instances] Test suite self-test: PASS
  17934. 1081.40 s [quickcheck-instances] Test suite logged to: dist/test/quickcheck-instances-0.3.33-self-test.log
  17935. 1081.40 s [quickcheck-instances] 1 of 1 test suites (1 of 1 test cases) passed.
  17936. 1081.41 s [quickcheck-instances] Phase: haddockPhase
  17937. 1081.57 s [quickcheck-instances] Preprocessing library for quickcheck-instances-0.3.33...
  17938. 1081.57 s [quickcheck-instances] Running Haddock on library for quickcheck-instances-0.3.33...
  17939. 1081.58 s [quickcheck-instances] Warning: The documentation for the following packages are not installed. No
  17940. 1081.58 s [quickcheck-instances] links will be generated to these packages: vector-0.13.2.0
  17941. 1081.83 s [quickcheck-instances] [ 1 of 26] Compiling Test.QuickCheck.Instances.Containers ( src/Test/QuickCheck/Instances/Containers.hs, nothing )
  17942. 1081.84 s [quickcheck-instances] [ 2 of 26] Compiling Test.QuickCheck.Instances.CustomPrelude ( src/Test/QuickCheck/Instances/CustomPrelude.hs, nothing )
  17943. 1081.86 s [quickcheck-instances] [ 3 of 26] Compiling Test.QuickCheck.Instances.CaseInsensitive ( src/Test/QuickCheck/Instances/CaseInsensitive.hs, nothing )
  17944. 1081.98 s [quickcheck-instances] [ 4 of 26] Compiling Test.QuickCheck.Instances.ByteString ( src/Test/QuickCheck/Instances/ByteString.hs, nothing )
  17945. 1082.01 s [quickcheck-instances] [ 5 of 26] Compiling Test.QuickCheck.Instances.Array ( src/Test/QuickCheck/Instances/Array.hs, nothing )
  17946. 1082.03 s [quickcheck-instances] [ 6 of 26] Compiling Test.QuickCheck.Instances.DataFix ( src/Test/QuickCheck/Instances/DataFix.hs, nothing )
  17947. 1082.05 s [quickcheck-instances] [ 7 of 26] Compiling Test.QuickCheck.Instances.Hashable ( src/Test/QuickCheck/Instances/Hashable.hs, nothing )
  17948. 1082.06 s [quickcheck-instances] [ 8 of 26] Compiling Test.QuickCheck.Instances.Natural ( src/Test/QuickCheck/Instances/Natural.hs, nothing )
  17949. 1082.06 s [quickcheck-instances] [ 9 of 26] Compiling Test.QuickCheck.Instances.OldTime ( src/Test/QuickCheck/Instances/OldTime.hs, nothing )
  17950. 1082.08 s [quickcheck-instances] [10 of 26] Compiling Test.QuickCheck.Instances.Primitive ( src/Test/QuickCheck/Instances/Primitive.hs, nothing )
  17951. 1082.12 s [quickcheck-instances] [11 of 26] Compiling Test.QuickCheck.Instances.Array.Byte ( src/Test/QuickCheck/Instances/Array/Byte.hs, nothing )
  17952. 1082.12 s [quickcheck-instances] [12 of 26] Compiling Test.QuickCheck.Instances.Scientific ( src/Test/QuickCheck/Instances/Scientific.hs, nothing )
  17953. 1082.23 s [quickcheck-instances] [13 of 26] Compiling Test.QuickCheck.Instances.Semigroup ( src/Test/QuickCheck/Instances/Semigroup.hs, nothing )
  17954. 1082.25 s [quickcheck-instances] [14 of 26] Compiling Test.QuickCheck.Instances.Solo ( src/Test/QuickCheck/Instances/Solo.hs, nothing )
  17955. 1082.26 s [quickcheck-instances] [15 of 26] Compiling Test.QuickCheck.Instances.Strict ( src/Test/QuickCheck/Instances/Strict.hs, nothing )
  17956. 1082.29 s [quickcheck-instances] [16 of 26] Compiling Test.QuickCheck.Instances.Tagged ( src/Test/QuickCheck/Instances/Tagged.hs, nothing )
  17957. 1082.33 s [quickcheck-instances] [17 of 26] Compiling Test.QuickCheck.Instances.Text ( src/Test/QuickCheck/Instances/Text.hs, nothing )
  17958. 1082.34 s [quickcheck-instances] [18 of 26] Compiling Test.QuickCheck.Instances.Text.Short ( src/Test/QuickCheck/Instances/Text/Short.hs, nothing )
  17959. 1082.35 s [quickcheck-instances] [19 of 26] Compiling Test.QuickCheck.Instances.These ( src/Test/QuickCheck/Instances/These.hs, nothing )
  17960. 1082.36 s [quickcheck-instances] [20 of 26] Compiling Test.QuickCheck.Instances.Time ( src/Test/QuickCheck/Instances/Time.hs, nothing )
  17961. 1082.43 s [quickcheck-instances] [21 of 26] Compiling Test.QuickCheck.Instances.Transformer ( src/Test/QuickCheck/Instances/Transformer.hs, nothing )
  17962. 1082.45 s [quickcheck-instances] [22 of 26] Compiling Test.QuickCheck.Instances.UUID ( src/Test/QuickCheck/Instances/UUID.hs, nothing )
  17963. 1082.46 s [quickcheck-instances] [23 of 26] Compiling Test.QuickCheck.Instances.UnorderedContainers ( src/Test/QuickCheck/Instances/UnorderedContainers.hs, nothing )
  17964. 1082.47 s [quickcheck-instances] [24 of 26] Compiling Test.QuickCheck.Instances.Vector ( src/Test/QuickCheck/Instances/Vector.hs, nothing )
  17965. 1082.63 s [quickcheck-instances] [25 of 26] Compiling Test.QuickCheck.Instances.Void ( src/Test/QuickCheck/Instances/Void.hs, nothing )
  17966. 1082.64 s [quickcheck-instances] [26 of 26] Compiling Test.QuickCheck.Instances ( src/Test/QuickCheck/Instances.hs, nothing )
  17967. 1082.64 s [quickcheck-instances] Haddock coverage:
  17968. 1082.64 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Containers'
  17969. 1082.64 s [quickcheck-instances] Missing documentation for:
  17970. 1082.64 s [quickcheck-instances] Module header
  17971. 1082.65 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.CaseInsensitive'
  17972. 1082.65 s [quickcheck-instances] Missing documentation for:
  17973. 1082.65 s [quickcheck-instances] Module header
  17974. 1082.65 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.ByteString'
  17975. 1082.65 s [quickcheck-instances] Missing documentation for:
  17976. 1082.65 s [quickcheck-instances] Module header
  17977. 1082.65 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Array'
  17978. 1082.65 s [quickcheck-instances] Missing documentation for:
  17979. 1082.65 s [quickcheck-instances] Module header
  17980. 1082.65 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.DataFix'
  17981. 1082.65 s [quickcheck-instances] Missing documentation for:
  17982. 1082.65 s [quickcheck-instances] Module header
  17983. 1082.65 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Hashable'
  17984. 1082.65 s [quickcheck-instances] Missing documentation for:
  17985. 1082.65 s [quickcheck-instances] Module header
  17986. 1082.65 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Natural'
  17987. 1082.65 s [quickcheck-instances] Missing documentation for:
  17988. 1082.65 s [quickcheck-instances] Module header
  17989. 1082.65 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.OldTime'
  17990. 1082.65 s [quickcheck-instances] Missing documentation for:
  17991. 1082.65 s [quickcheck-instances] Module header
  17992. 1082.65 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Primitive'
  17993. 1082.65 s [quickcheck-instances] Missing documentation for:
  17994. 1082.65 s [quickcheck-instances] Module header
  17995. 1082.65 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Array.Byte'
  17996. 1082.65 s [quickcheck-instances] Missing documentation for:
  17997. 1082.65 s [quickcheck-instances] Module header
  17998. 1082.65 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Scientific'
  17999. 1082.65 s [quickcheck-instances] Missing documentation for:
  18000. 1082.65 s [quickcheck-instances] Module header
  18001. 1082.65 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Semigroup'
  18002. 1082.65 s [quickcheck-instances] Missing documentation for:
  18003. 1082.65 s [quickcheck-instances] Module header
  18004. 1082.65 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Solo'
  18005. 1082.65 s [quickcheck-instances] Missing documentation for:
  18006. 1082.65 s [quickcheck-instances] Module header
  18007. 1082.65 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Strict'
  18008. 1082.65 s [quickcheck-instances] Missing documentation for:
  18009. 1082.65 s [quickcheck-instances] Module header
  18010. 1082.65 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Tagged'
  18011. 1082.65 s [quickcheck-instances] Missing documentation for:
  18012. 1082.65 s [quickcheck-instances] Module header
  18013. 1082.65 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Text'
  18014. 1082.65 s [quickcheck-instances] Missing documentation for:
  18015. 1082.65 s [quickcheck-instances] Module header
  18016. 1082.65 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Text.Short'
  18017. 1082.65 s [quickcheck-instances] Missing documentation for:
  18018. 1082.65 s [quickcheck-instances] Module header
  18019. 1082.65 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.These'
  18020. 1082.65 s [quickcheck-instances] Missing documentation for:
  18021. 1082.65 s [quickcheck-instances] Module header
  18022. 1082.65 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Time'
  18023. 1082.65 s [quickcheck-instances] Missing documentation for:
  18024. 1082.65 s [quickcheck-instances] Module header
  18025. 1082.65 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Transformer'
  18026. 1082.65 s [quickcheck-instances] Missing documentation for:
  18027. 1082.65 s [quickcheck-instances] Module header
  18028. 1082.65 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.UUID'
  18029. 1082.65 s [quickcheck-instances] Missing documentation for:
  18030. 1082.65 s [quickcheck-instances] Module header
  18031. 1082.65 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.UnorderedContainers'
  18032. 1082.65 s [quickcheck-instances] Missing documentation for:
  18033. 1082.65 s [quickcheck-instances] Module header
  18034. 1082.65 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Vector'
  18035. 1082.65 s [quickcheck-instances] Missing documentation for:
  18036. 1082.65 s [quickcheck-instances] Module header
  18037. 1082.65 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Void'
  18038. 1082.65 s [quickcheck-instances] Missing documentation for:
  18039. 1082.65 s [quickcheck-instances] Module header
  18040. 1082.65 s [quickcheck-instances] 100% ( 1 / 1) in 'Test.QuickCheck.Instances'
  18041. 1083.18 s [quickcheck-instances] Warning: Test.QuickCheck.Instances.Vector: could not find link destinations for:
  18042. 1083.18 s [quickcheck-instances] - Data.Vector.Vector
  18043. 1083.18 s [quickcheck-instances] - Data.Vector.Primitive.Vector
  18044. 1083.18 s [quickcheck-instances] - Data.Vector.Storable.Vector
  18045. 1083.18 s [quickcheck-instances] - Data.Vector.Unboxed.Base.Unbox
  18046. 1083.18 s [quickcheck-instances] - Data.Vector.Unboxed.Base.Vector
  18047. 1083.18 s [quickcheck-instances] - Data.Vector.Strict.Vector
  18048. 1087.69 s [quickcheck-instances] Documentation created: dist/doc/html/quickcheck-instances/,
  18049. 1087.69 s [quickcheck-instances] dist/doc/html/quickcheck-instances/quickcheck-instances.txt
  18050. 1087.76 s [quickcheck-instances] Preprocessing test suite 'self-test' for quickcheck-instances-0.3.33...
  18051. 1087.76 s [quickcheck-instances] Phase: installPhase
  18052. 1087.82 s [quickcheck-instances] Installing library in /nix/store/9ndc767d68lxqzwwjmmcv1z8gffhirdm-quickcheck-instances-0.3.33/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-1e2a/quickcheck-instances-0.3.33-J59fUUft4T8JJJI5spwjev
  18053. 1088.25 s [quickcheck-instances] Phase: fixupPhase
  18054. 1088.27 s [quickcheck-instances] shrinking RPATHs of ELF executables and libraries in /nix/store/9ndc767d68lxqzwwjmmcv1z8gffhirdm-quickcheck-instances-0.3.33
  18055. 1088.27 s [quickcheck-instances] shrinking /nix/store/9ndc767d68lxqzwwjmmcv1z8gffhirdm-quickcheck-instances-0.3.33/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-1e2a/libHSquickcheck-instances-0.3.33-J59fUUft4T8JJJI5spwjev-ghc9.10.2.so
  18056. 1088.30 s [quickcheck-instances] checking for references to /build/ in /nix/store/9ndc767d68lxqzwwjmmcv1z8gffhirdm-quickcheck-instances-0.3.33...
  18057. 1088.33 s [quickcheck-instances] patching script interpreter paths in /nix/store/9ndc767d68lxqzwwjmmcv1z8gffhirdm-quickcheck-instances-0.3.33
  18058. 1088.33 s [quickcheck-instances] stripping (with command strip and flags -S -p) in /nix/store/9ndc767d68lxqzwwjmmcv1z8gffhirdm-quickcheck-instances-0.3.33/lib
  18059. 1088.45 s [quickcheck-instances] shrinking RPATHs of ELF executables and libraries in /nix/store/ijhakcdvg5h0zrmdf07h53z7bzpm6vki-quickcheck-instances-0.3.33-doc
  18060. 1088.46 s [quickcheck-instances] checking for references to /build/ in /nix/store/ijhakcdvg5h0zrmdf07h53z7bzpm6vki-quickcheck-instances-0.3.33-doc...
  18061. 1088.49 s [quickcheck-instances] patching script interpreter paths in /nix/store/ijhakcdvg5h0zrmdf07h53z7bzpm6vki-quickcheck-instances-0.3.33-doc
  18062. 1088.60 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/9ndc767d68lxqzwwjmmcv1z8gffhirdm-quickcheck-instances-0.3.33 /nix/store/ijhakcdvg5h0zrmdf07h53z7bzpm6vki-quickcheck-instances-0.3.33-doc
  18063. 1089.15 s [post-build-hook] Pushing 2 paths (132 are already present) using zstd to cache sellout ⏳
  18064. 1089.15 s [post-build-hook]
  18065. 1089.53 s [post-build-hook] Pushing /nix/store/9ndc767d68lxqzwwjmmcv1z8gffhirdm-quickcheck-instances-0.3.33 (5.53 MiB)
  18066. 1089.55 s [post-build-hook] Pushing /nix/store/ijhakcdvg5h0zrmdf07h53z7bzpm6vki-quickcheck-instances-0.3.33-doc (1.51 MiB)
  18067. 1091.32 s [post-build-hook]
  18068. 1091.32 s [post-build-hook] All done.
  18069. 1091.33 s [post-build-hook] Uploading to the NixCI cache: /nix/store/9ndc767d68lxqzwwjmmcv1z8gffhirdm-quickcheck-instances-0.3.33 /nix/store/ijhakcdvg5h0zrmdf07h53z7bzpm6vki-quickcheck-instances-0.3.33-doc
  18070. 1091.38 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  18071. 1091.56 s [post-build-hook] copying 2 paths...
  18072. 1091.56 s [post-build-hook] copying path '/nix/store/ijhakcdvg5h0zrmdf07h53z7bzpm6vki-quickcheck-instances-0.3.33-doc' to 'https://cache.nix-ci.com'...
  18073. 1091.84 s [post-build-hook] copying path '/nix/store/9ndc767d68lxqzwwjmmcv1z8gffhirdm-quickcheck-instances-0.3.33' to 'https://cache.nix-ci.com'...
  18074. 1093.11 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  18075. 1093.29 s [post-build-hook] copying 1 paths...
  18076. 1093.31 s [post-build-hook] copying path '/nix/store/9yifh8cp007kldqbm61bysr4c272cf94-quickcheck-instances-0.3.33.drv' to 'https://cache.nix-ci.com'...
  18077. 1093.46 s Progress: 12 of 19 built, 177 of 177 downloaded from cache
  18078. 1093.51 s Building extra
  18079. 1093.66 s [extra] Phase: setupCompilerEnvironmentPhase
  18080. 1093.66 s [extra] Build with /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2.
  18081. 1093.87 s [extra] Phase: unpackPhase
  18082. 1093.88 s [extra] unpacking source archive /nix/store/3nprda3kdyhj8zkmv2z32yi6n0gwc966-extra-1.8.1.tar.gz
  18083. 1093.88 s [extra] source root is extra-1.8.1
  18084. 1093.89 s [extra] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "extra-1.8.1/test/TestUtil.hs"
  18085. 1093.90 s [extra] Phase: patchPhase
  18086. 1093.90 s [extra] Phase: compileBuildDriverPhase
  18087. 1093.91 s [extra] setupCompileFlags: -package-db=/build/tmp.RQMbFnumpj/setup-package.conf.d -threaded
  18088. 1093.97 s [extra] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.RQMbFnumpj/Main.o )
  18089. 1094.02 s [extra] [2 of 2] Linking Setup
  18090. 1095.29 s [extra] Phase: updateAutotoolsGnuConfigScriptsPhase
  18091. 1095.30 s [extra] Phase: configurePhase
  18092. 1095.31 s [extra] configureFlags: --verbose --prefix=/nix/store/xgscik0zpf693pfhrgbi40sxw06843v5-extra-1.8.1 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/l1nwy71yzn0dp9z6qh5i6g78myi2hal3-extra-1.8.1-doc/share/doc/extra-1.8.1 --with-gcc=gcc --package-db=/build/tmp.RQMbFnumpj/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
  18093. 1095.31 s [extra] Using Parsec parser
  18094. 1095.31 s [extra] Configuring extra-1.8.1...
  18095. 1095.91 s [extra] Dependency base >=4.9 && <5: using base-4.20.1.0
  18096. 1095.91 s [extra] Dependency clock >=0.7: using clock-0.8.4
  18097. 1095.91 s [extra] Dependency directory: using directory-1.3.8.5
  18098. 1095.91 s [extra] Dependency filepath: using filepath-1.5.4.0
  18099. 1095.91 s [extra] Dependency process: using process-1.6.25.0
  18100. 1095.91 s [extra] Dependency time: using time-1.12.2
  18101. 1095.91 s [extra] Dependency unix: using unix-2.8.6.0
  18102. 1095.91 s [extra] Dependency QuickCheck >=2.10: using QuickCheck-2.15.0.1
  18103. 1095.91 s [extra] Dependency base >=4 && <5: using base-4.20.1.0
  18104. 1095.91 s [extra] Dependency directory: using directory-1.3.8.5
  18105. 1095.91 s [extra] Dependency extra: using extra-1.8.1
  18106. 1095.91 s [extra] Dependency filepath: using filepath-1.5.4.0
  18107. 1095.91 s [extra] Dependency quickcheck-instances >=0.3.17: using quickcheck-instances-0.3.33
  18108. 1095.91 s [extra] Dependency unix: using unix-2.8.6.0
  18109. 1095.91 s [extra] Source component graph:
  18110. 1095.91 s [extra] component lib
  18111. 1095.91 s [extra] component test:extra-test dependency lib
  18112. 1095.91 s [extra] Configured component graph:
  18113. 1095.91 s [extra] component extra-1.8.1-K2veo5mnkQk4ZLinPLkzz1
  18114. 1095.91 s [extra] include base-4.20.1.0-2277
  18115. 1095.91 s [extra] include clock-0.8.4-IOjihXqVwfJE6Oi0LlMmXK
  18116. 1095.91 s [extra] include directory-1.3.8.5-ad1a
  18117. 1095.91 s [extra] include filepath-1.5.4.0-590e
  18118. 1095.91 s [extra] include process-1.6.25.0-d21a
  18119. 1095.91 s [extra] include time-1.12.2-18ff
  18120. 1095.91 s [extra] include unix-2.8.6.0-bc28
  18121. 1095.91 s [extra] component extra-1.8.1-6nTB9Xv1WLM8J6eEvCNq52-extra-test
  18122. 1095.91 s [extra] include QuickCheck-2.15.0.1-stTt2BXNne46QxWHi9NgG
  18123. 1095.91 s [extra] include base-4.20.1.0-2277
  18124. 1095.91 s [extra] include directory-1.3.8.5-ad1a
  18125. 1095.91 s [extra] include extra-1.8.1-K2veo5mnkQk4ZLinPLkzz1
  18126. 1095.91 s [extra] include filepath-1.5.4.0-590e
  18127. 1095.91 s [extra] include quickcheck-instances-0.3.33-J59fUUft4T8JJJI5spwjev
  18128. 1095.91 s [extra] include unix-2.8.6.0-bc28
  18129. 1095.91 s [extra] Linked component graph:
  18130. 1095.91 s [extra] unit extra-1.8.1-K2veo5mnkQk4ZLinPLkzz1
  18131. 1095.91 s [extra] include base-4.20.1.0-2277
  18132. 1095.91 s [extra] include clock-0.8.4-IOjihXqVwfJE6Oi0LlMmXK
  18133. 1095.91 s [extra] include directory-1.3.8.5-ad1a
  18134. 1095.91 s [extra] include filepath-1.5.4.0-590e
  18135. 1095.91 s [extra] include process-1.6.25.0-d21a
  18136. 1095.91 s [extra] include time-1.12.2-18ff
  18137. 1095.91 s [extra] include unix-2.8.6.0-bc28
  18138. 1095.91 s [extra] Control.Concurrent.Extra=extra-1.8.1-K2veo5mnkQk4ZLinPLkzz1:Control.Concurrent.Extra,Control.Exception.Extra=extra-1.8.1-K2veo5mnkQk4ZLinPLkzz1:Control.Exception.Extra,Control.Monad.Extra=extra-1.8.1-K2veo5mnkQk4ZLinPLkzz1:Control.Monad.Extra,Data.Either.Extra=extra-1.8.1-K2veo5mnkQk4ZLinPLkzz1:Data.Either.Extra,Data.Foldable.Extra=extra-1.8.1-K2veo5mnkQk4ZLinPLkzz1:Data.Foldable.Extra,Data.IORef.Extra=extra-1.8.1-K2veo5mnkQk4ZLinPLkzz1:Data.IORef.Extra,Data.List.Extra=extra-1.8.1-K2veo5mnkQk4ZLinPLkzz1:Data.List.Extra,Data.List.NonEmpty.Extra=extra-1.8.1-K2veo5mnkQk4ZLinPLkzz1:Data.List.NonEmpty.Extra,Data.Monoid.Extra=extra-1.8.1-K2veo5mnkQk4ZLinPLkzz1:Data.Monoid.Extra,Data.Tuple.Extra=extra-1.8.1-K2veo5mnkQk4ZLinPLkzz1:Data.Tuple.Extra,Data.Typeable.Extra=extra-1.8.1-K2veo5mnkQk4ZLinPLkzz1:Data.Typeable.Extra,Data.Version.Extra=extra-1.8.1-K2veo5mnkQk4ZLinPLkzz1:Data.Version.Extra,Extra=extra-1.8.1-K2veo5mnkQk4ZLinPLkzz1:Extra,Numeric.Extra=extra-1.8.1-K2veo5mnkQk4ZLinPLkzz1:Numeric.Extra,System.Directory.Extra=extra-1.8.1-K2veo5mnkQk4ZLinPLkzz1:System.Directory.Extra,System.Environment.Extra=extra-1.8.1-K2veo5mnkQk4ZLinPLkzz1:System.Environment.Extra,System.IO.Extra=extra-1.8.1-K2veo5mnkQk4ZLinPLkzz1:System.IO.Extra,System.Info.Extra=extra-1.8.1-K2veo5mnkQk4ZLinPLkzz1:System.Info.Extra,System.Process.Extra=extra-1.8.1-K2veo5mnkQk4ZLinPLkzz1:System.Process.Extra,System.Time.Extra=extra-1.8.1-K2veo5mnkQk4ZLinPLkzz1:System.Time.Extra,Text.Read.Extra=extra-1.8.1-K2veo5mnkQk4ZLinPLkzz1:Text.Read.Extra
  18139. 1095.91 s [extra] unit extra-1.8.1-6nTB9Xv1WLM8J6eEvCNq52-extra-test
  18140. 1095.91 s [extra] include QuickCheck-2.15.0.1-stTt2BXNne46QxWHi9NgG
  18141. 1095.91 s [extra] include base-4.20.1.0-2277
  18142. 1095.91 s [extra] include directory-1.3.8.5-ad1a
  18143. 1095.91 s [extra] include extra-1.8.1-K2veo5mnkQk4ZLinPLkzz1
  18144. 1095.91 s [extra] include filepath-1.5.4.0-590e
  18145. 1095.91 s [extra] include quickcheck-instances-0.3.33-J59fUUft4T8JJJI5spwjev
  18146. 1095.91 s [extra] include unix-2.8.6.0-bc28
  18147. 1095.91 s [extra] Ready component graph:
  18148. 1095.91 s [extra] definite extra-1.8.1-K2veo5mnkQk4ZLinPLkzz1
  18149. 1095.91 s [extra] depends base-4.20.1.0-2277
  18150. 1095.91 s [extra] depends clock-0.8.4-IOjihXqVwfJE6Oi0LlMmXK
  18151. 1095.91 s [extra] depends directory-1.3.8.5-ad1a
  18152. 1095.91 s [extra] depends filepath-1.5.4.0-590e
  18153. 1095.91 s [extra] depends process-1.6.25.0-d21a
  18154. 1095.91 s [extra] depends time-1.12.2-18ff
  18155. 1095.91 s [extra] depends unix-2.8.6.0-bc28
  18156. 1095.91 s [extra] definite extra-1.8.1-6nTB9Xv1WLM8J6eEvCNq52-extra-test
  18157. 1095.91 s [extra] depends QuickCheck-2.15.0.1-stTt2BXNne46QxWHi9NgG
  18158. 1095.91 s [extra] depends base-4.20.1.0-2277
  18159. 1095.91 s [extra] depends directory-1.3.8.5-ad1a
  18160. 1095.91 s [extra] depends extra-1.8.1-K2veo5mnkQk4ZLinPLkzz1
  18161. 1095.91 s [extra] depends filepath-1.5.4.0-590e
  18162. 1095.91 s [extra] depends quickcheck-instances-0.3.33-J59fUUft4T8JJJI5spwjev
  18163. 1095.91 s [extra] depends unix-2.8.6.0-bc28
  18164. 1095.91 s [extra] Using Cabal-3.12.1.0 compiled by ghc-9.10
  18165. 1095.91 s [extra] Using compiler: ghc-9.10.2
  18166. 1095.91 s [extra] Using install prefix: /nix/store/xgscik0zpf693pfhrgbi40sxw06843v5-extra-1.8.1
  18167. 1095.91 s [extra] Executables installed in:
  18168. 1095.91 s [extra] /nix/store/xgscik0zpf693pfhrgbi40sxw06843v5-extra-1.8.1/bin
  18169. 1095.91 s [extra] Libraries installed in:
  18170. 1095.91 s [extra] /nix/store/xgscik0zpf693pfhrgbi40sxw06843v5-extra-1.8.1/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-1e2a/extra-1.8.1-K2veo5mnkQk4ZLinPLkzz1
  18171. 1095.91 s [extra] Dynamic Libraries installed in:
  18172. 1095.91 s [extra] /nix/store/xgscik0zpf693pfhrgbi40sxw06843v5-extra-1.8.1/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-1e2a
  18173. 1095.91 s [extra] Private executables installed in:
  18174. 1095.91 s [extra] /nix/store/xgscik0zpf693pfhrgbi40sxw06843v5-extra-1.8.1/libexec/x86_64-linux-ghc-9.10.2-1e2a/extra-1.8.1
  18175. 1095.91 s [extra] Data files installed in:
  18176. 1095.91 s [extra] /nix/store/xgscik0zpf693pfhrgbi40sxw06843v5-extra-1.8.1/share/x86_64-linux-ghc-9.10.2-1e2a/extra-1.8.1
  18177. 1095.91 s [extra] Documentation installed in:
  18178. 1095.91 s [extra] /nix/store/l1nwy71yzn0dp9z6qh5i6g78myi2hal3-extra-1.8.1-doc/share/doc/extra-1.8.1
  18179. 1095.91 s [extra] Configuration files installed in:
  18180. 1095.91 s [extra] /nix/store/xgscik0zpf693pfhrgbi40sxw06843v5-extra-1.8.1/etc
  18181. 1095.91 s [extra] No alex found
  18182. 1095.91 s [extra] Using ar found on system at:
  18183. 1095.91 s [extra] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
  18184. 1095.91 s [extra] No c2hs found
  18185. 1095.91 s [extra] No cpphs found
  18186. 1095.91 s [extra] No doctest found
  18187. 1095.91 s [extra] Using gcc version 14.3.0 given by user at:
  18188. 1095.91 s [extra] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
  18189. 1095.91 s [extra] Using ghc version 9.10.2 found on system at:
  18190. 1095.91 s [extra] /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/bin/ghc
  18191. 1095.91 s [extra] Using ghc-pkg version 9.10.2 found on system at:
  18192. 1095.91 s [extra] /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/bin/ghc-pkg-9.10.2
  18193. 1095.91 s [extra] No ghcjs found
  18194. 1095.91 s [extra] No ghcjs-pkg found
  18195. 1095.91 s [extra] No greencard found
  18196. 1095.91 s [extra] Using haddock version 2.31.0 found on system at:
  18197. 1095.91 s [extra] /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/bin/haddock-ghc-9.10.2
  18198. 1095.91 s [extra] No happy found
  18199. 1095.91 s [extra] Using haskell-suite found on system at: haskell-suite-dummy-location
  18200. 1095.91 s [extra] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  18201. 1095.91 s [extra] No hmake found
  18202. 1095.91 s [extra] Using hpc version 0.69 found on system at:
  18203. 1095.91 s [extra] /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/bin/hpc-ghc-9.10.2
  18204. 1095.91 s [extra] Using hsc2hs version 0.68.10 found on system at:
  18205. 1095.91 s [extra] /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/bin/hsc2hs-ghc-9.10.2
  18206. 1095.91 s [extra] Using hscolour version 1.25 found on system at:
  18207. 1095.91 s [extra] /nix/store/kb4afndnwdxxc5ps9k8xv0jzd0a9y8n5-hscolour-1.25/bin/HsColour
  18208. 1095.91 s [extra] No jhc found
  18209. 1095.91 s [extra] Using ld found on system at:
  18210. 1095.91 s [extra] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/ld
  18211. 1095.91 s [extra] No pkg-config found
  18212. 1095.91 s [extra] Using runghc version 9.10.2 found on system at:
  18213. 1095.91 s [extra] /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/bin/runghc-9.10.2
  18214. 1095.91 s [extra] Using strip version 2.44 found on system at:
  18215. 1095.91 s [extra] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
  18216. 1095.91 s [extra] Using tar found on system at:
  18217. 1095.91 s [extra] /nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
  18218. 1095.91 s [extra] No uhc found
  18219. 1096.04 s [extra] Phase: buildPhase
  18220. 1096.09 s [extra] Preprocessing library for extra-1.8.1...
  18221. 1096.10 s [extra] Building library for extra-1.8.1...
  18222. 1096.35 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 )
  18223. 1096.45 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 )
  18224. 1096.45 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 )
  18225. 1096.46 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 )
  18226. 1096.46 s [extra] [ 5 of 22] Compiling Numeric.Extra ( src/Numeric/Extra.hs, dist/build/Numeric/Extra.o, dist/build/Numeric/Extra.dyn_o )
  18227. 1096.46 s [extra] [ 6 of 22] Compiling Partial ( src/Partial.hs, dist/build/Partial.o, dist/build/Partial.dyn_o )
  18228. 1096.46 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 )
  18229. 1097.40 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 )
  18230. 1097.44 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 )
  18231. 1097.53 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 )
  18232. 1097.53 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 )
  18233. 1097.53 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 )
  18234. 1097.70 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 )
  18235. 1097.78 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 )
  18236. 1097.93 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 )
  18237. 1097.93 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 )
  18238. 1097.93 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 )
  18239. 1098.09 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 )
  18240. 1098.09 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 )
  18241. 1098.14 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 )
  18242. 1098.14 s [extra] [21 of 22] Compiling Extra ( src/Extra.hs, dist/build/Extra.o, dist/build/Extra.dyn_o )
  18243. 1098.20 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 )
  18244. 1098.61 s [extra] [ 1 of 22] Compiling Data.IORef.Extra ( src/Data/IORef/Extra.hs, dist/build/Data/IORef/Extra.p_o )
  18245. 1098.97 s [extra] [ 2 of 22] Compiling Data.Monoid.Extra ( src/Data/Monoid/Extra.hs, dist/build/Data/Monoid/Extra.p_o )
  18246. 1099.01 s [extra] [ 3 of 22] Compiling Data.Tuple.Extra ( src/Data/Tuple/Extra.hs, dist/build/Data/Tuple/Extra.p_o )
  18247. 1099.01 s [extra] [ 4 of 22] Compiling Data.Typeable.Extra ( src/Data/Typeable/Extra.hs, dist/build/Data/Typeable/Extra.p_o )
  18248. 1099.01 s [extra] [ 5 of 22] Compiling Numeric.Extra ( src/Numeric/Extra.hs, dist/build/Numeric/Extra.p_o )
  18249. 1099.01 s [extra] [ 6 of 22] Compiling Partial ( src/Partial.hs, dist/build/Partial.p_o )
  18250. 1099.01 s [extra] [ 7 of 22] Compiling Data.List.Extra ( src/Data/List/Extra.hs, dist/build/Data/List/Extra.p_o )
  18251. 1100.01 s [extra] [ 8 of 22] Compiling Data.Version.Extra ( src/Data/Version/Extra.hs, dist/build/Data/Version/Extra.p_o )
  18252. 1100.16 s [extra] [ 9 of 22] Compiling Data.List.NonEmpty.Extra ( src/Data/List/NonEmpty/Extra.hs, dist/build/Data/List/NonEmpty/Extra.p_o )
  18253. 1100.23 s [extra] [10 of 22] Compiling Data.Either.Extra ( src/Data/Either/Extra.hs, dist/build/Data/Either/Extra.p_o )
  18254. 1100.23 s [extra] [11 of 22] Compiling Control.Exception.Extra ( src/Control/Exception/Extra.hs, dist/build/Control/Exception/Extra.p_o )
  18255. 1100.23 s [extra] [12 of 22] Compiling Control.Monad.Extra ( src/Control/Monad/Extra.hs, dist/build/Control/Monad/Extra.p_o )
  18256. 1100.52 s [extra] [13 of 22] Compiling Data.Foldable.Extra ( src/Data/Foldable/Extra.hs, dist/build/Data/Foldable/Extra.p_o )
  18257. 1100.68 s [extra] [14 of 22] Compiling Control.Concurrent.Extra ( src/Control/Concurrent/Extra.hs, dist/build/Control/Concurrent/Extra.p_o )
  18258. 1100.82 s [extra] [15 of 22] Compiling System.Directory.Extra ( src/System/Directory/Extra.hs, dist/build/System/Directory/Extra.p_o )
  18259. 1100.82 s [extra] [16 of 22] Compiling System.Environment.Extra ( src/System/Environment/Extra.hs, dist/build/System/Environment/Extra.p_o )
  18260. 1100.82 s [extra] [17 of 22] Compiling System.IO.Extra ( src/System/IO/Extra.hs, dist/build/System/IO/Extra.p_o )
  18261. 1101.09 s [extra] [18 of 22] Compiling System.Info.Extra ( src/System/Info/Extra.hs, dist/build/System/Info/Extra.p_o )
  18262. 1101.09 s [extra] [19 of 22] Compiling System.Process.Extra ( src/System/Process/Extra.hs, dist/build/System/Process/Extra.p_o )
  18263. 1101.23 s [extra] [20 of 22] Compiling System.Time.Extra ( src/System/Time/Extra.hs, dist/build/System/Time/Extra.p_o )
  18264. 1101.23 s [extra] [21 of 22] Compiling Extra ( src/Extra.hs, dist/build/Extra.p_o )
  18265. 1101.37 s [extra] [22 of 22] Compiling Text.Read.Extra ( src/Text/Read/Extra.hs, dist/build/Text/Read/Extra.p_o )
  18266. 1103.00 s [extra] Preprocessing test suite 'extra-test' for extra-1.8.1...
  18267. 1103.00 s [extra] Building test suite 'extra-test' for extra-1.8.1...
  18268. 1103.06 s [extra] [1 of 4] Compiling TestUtil ( test/TestUtil.hs, dist/build/extra-test/extra-test-tmp/TestUtil.o )
  18269. 1103.42 s [extra] [2 of 4] Compiling TestGen ( test/TestGen.hs, dist/build/extra-test/extra-test-tmp/TestGen.o )
  18270. 1105.11 s [extra] [3 of 4] Compiling TestCustom ( test/TestCustom.hs, dist/build/extra-test/extra-test-tmp/TestCustom.o )
  18271. 1105.13 s [extra] [4 of 4] Compiling Test ( test/Test.hs, dist/build/extra-test/extra-test-tmp/Test.o )
  18272. 1105.40 s [extra] [5 of 5] Linking dist/build/extra-test/extra-test
  18273. 1106.08 s [extra] Phase: checkPhase
  18274. 1106.32 s [extra] Running 1 test suites...
  18275. 1106.32 s [extra] Test suite extra-test: RUNNING...
  18276. 1106.32 s [extra] withTempFile
  18277. 1106.32 s [extra] +++ OK, passed 100 tests.
  18278. 1106.32 s [extra] captureOutput
  18279. 1106.32 s [extra] +++ OK, passed 100 tests.
  18280. 1106.32 s [extra] \(x :: IO Int) -> void (once x) == pure ()
  18281. 1106.35 s [extra] +++ OK, passed 100 tests.
  18282. 1106.35 s [extra] \(x :: IO Int) -> join (once x) == x
  18283. 1106.38 s [extra] +++ OK, passed 100 tests.
  18284. 1106.38 s [extra] \(x :: IO Int) -> (do y <- once x; y; y) == x
  18285. 1106.40 s [extra] +++ OK, passed 100 tests.
  18286. 1106.40 s [extra] \(x :: IO Int) -> (do y <- once x; y ||| y) == x
  18287. 1106.44 s [extra] +++ OK, passed 100 tests.
  18288. 1106.44 s [extra] \(x :: IO Int) -> join (onceFork x) == x
  18289. 1106.47 s [extra] +++ OK, passed 100 tests.
  18290. 1106.47 s [extra] \(x :: IO Int) -> (do a <- onceFork x; a; a) == x
  18291. 1106.50 s [extra] +++ OK, passed 100 tests.
  18292. 1106.50 s [extra] stringException "test" == pure "test"
  18293. 1106.50 s [extra] +++ OK, passed 100 tests.
  18294. 1106.50 s [extra] stringException ("test" ++ undefined) == pure "test<Exception>"
  18295. 1106.50 s [extra] +++ OK, passed 100 tests.
  18296. 1106.50 s [extra] stringException ("test" ++ undefined ++ "hello") == pure "test<Exception>"
  18297. 1106.50 s [extra] +++ OK, passed 100 tests.
  18298. 1106.50 s [extra] stringException ['t','e','s','t',undefined] == pure "test<Exception>"
  18299. 1106.50 s [extra] +++ OK, passed 100 tests.
  18300. 1106.50 s [extra] ignore (print 1) == print 1
  18301. 1106.50 s [extra] +++ OK, passed 100 tests.
  18302. 1106.50 s [extra] ignore (fail "die") == pure ()
  18303. 1106.50 s [extra] +++ OK, passed 100 tests.
  18304. 1106.50 s [extra] catch (errorIO "Hello") (\(ErrorCall x) -> pure x) == pure "Hello"
  18305. 1106.50 s [extra] +++ OK, passed 100 tests.
  18306. 1106.50 s [extra] seq (errorIO "foo") (print 1) == print 1
  18307. 1106.50 s [extra] +++ OK, passed 100 tests.
  18308. 1106.50 s [extra] catch (assertIO True >> pure 1) (\(x :: AssertionFailed) -> pure 2) == pure 1
  18309. 1106.50 s [extra] +++ OK, passed 100 tests.
  18310. 1106.50 s [extra] seq (assertIO False) (print 1) == print 1
  18311. 1106.50 s [extra] +++ OK, passed 100 tests.
  18312. 1106.50 s [extra] retry 1 (print "x") == print "x"
  18313. 1106.50 s [extra] +++ OK, passed 100 tests.
  18314. 1106.50 s [extra] retry 3 (fail "die") == fail "die"
  18315. 1106.50 s [extra] +++ OK, passed 100 tests.
  18316. 1106.50 s [extra] whenJust Nothing print == pure ()
  18317. 1106.50 s [extra] +++ OK, passed 100 tests.
  18318. 1106.50 s [extra] whenJust (Just 1) print == print 1
  18319. 1106.50 s [extra] +++ OK, passed 100 tests.
  18320. 1106.50 s [extra] pureIf @Maybe True 5 == Just 5
  18321. 1106.50 s [extra] +++ OK, passed 100 tests.
  18322. 1106.50 s [extra] pureIf @Maybe False 5 == Nothing
  18323. 1106.50 s [extra] +++ OK, passed 100 tests.
  18324. 1106.50 s [extra] pureIf @[] True 5 == [5]
  18325. 1106.50 s [extra] +++ OK, passed 100 tests.
  18326. 1106.50 s [extra] pureIf @[] False 5 == []
  18327. 1106.50 s [extra] +++ OK, passed 100 tests.
  18328. 1106.50 s [extra] whenMaybe True (print 1) == fmap Just (print 1)
  18329. 1106.50 s [extra] +++ OK, passed 100 tests.
  18330. 1106.50 s [extra] whenMaybe False (print 1) == pure Nothing
  18331. 1106.50 s [extra] +++ OK, passed 100 tests.
  18332. 1106.50 s [extra] \(x :: Maybe ()) -> unit x == x
  18333. 1106.50 s [extra] +++ OK, passed 100 tests.
  18334. 1106.50 s [extra] guarded even 2 == [2]
  18335. 1106.50 s [extra] +++ OK, passed 100 tests.
  18336. 1106.50 s [extra] guarded odd 2 == Nothing
  18337. 1106.50 s [extra] +++ OK, passed 100 tests.
  18338. 1106.50 s [extra] guarded (not.null) "My Name" == Just "My Name"
  18339. 1106.51 s [extra] +++ OK, passed 100 tests.
  18340. 1106.51 s [extra] guardedA (return . even) 42 == Just [42]
  18341. 1106.51 s [extra] +++ OK, passed 100 tests.
  18342. 1106.51 s [extra] guardedA (return . odd) 42 == Just []
  18343. 1106.51 s [extra] +++ OK, passed 100 tests.
  18344. 1106.51 s [extra] guardedA (const Nothing) 42 == (Nothing :: Maybe [Int])
  18345. 1106.51 s [extra] +++ OK, passed 100 tests.
  18346. 1106.51 s [extra] fold1M (\x y -> Just x) [] == undefined
  18347. 1106.51 s [extra] +++ OK, passed 100 tests.
  18348. 1106.51 s [extra] fold1M (\x y -> Just $ x + y) [1, 2, 3] == Just 6
  18349. 1106.51 s [extra] +++ OK, passed 100 tests.
  18350. 1106.51 s [extra] partitionM (Just . even) [1,2,3] == Just ([2], [1,3])
  18351. 1106.51 s [extra] +++ OK, passed 100 tests.
  18352. 1106.51 s [extra] partitionM (const Nothing) [1,2,3] == Nothing
  18353. 1106.51 s [extra] +++ OK, passed 100 tests.
  18354. 1106.51 s [extra] loop (\x -> if x < 10 then Left $ x * 2 else Right $ show x) 1 == "16"
  18355. 1106.51 s [extra] +++ OK, passed 100 tests.
  18356. 1106.51 s [extra] Just True ||^ undefined == Just True
  18357. 1106.51 s [extra] +++ OK, passed 100 tests.
  18358. 1106.51 s [extra] Just False ||^ Just True == Just True
  18359. 1106.51 s [extra] +++ OK, passed 100 tests.
  18360. 1106.51 s [extra] Just False ||^ Just False == Just False
  18361. 1106.51 s [extra] +++ OK, passed 100 tests.
  18362. 1106.51 s [extra] Just False &&^ undefined == Just False
  18363. 1106.51 s [extra] +++ OK, passed 100 tests.
  18364. 1106.51 s [extra] Just True &&^ Just True == Just True
  18365. 1106.51 s [extra] +++ OK, passed 100 tests.
  18366. 1106.51 s [extra] Just True &&^ Just False == Just False
  18367. 1106.51 s [extra] +++ OK, passed 100 tests.
  18368. 1106.51 s [extra] anyM Just [False,True ,undefined] == Just True
  18369. 1106.51 s [extra] +++ OK, passed 100 tests.
  18370. 1106.51 s [extra] anyM Just [False,False,undefined] == undefined
  18371. 1106.51 s [extra] +++ OK, passed 100 tests.
  18372. 1106.51 s [extra] \(f :: Int -> Maybe Bool) xs -> anyM f xs == orM (map f xs)
  18373. 1106.51 s [extra] +++ OK, passed 100 tests.
  18374. 1106.51 s [extra] allM Just [True,False,undefined] == Just False
  18375. 1106.51 s [extra] +++ OK, passed 100 tests.
  18376. 1106.51 s [extra] allM Just [True,True ,undefined] == undefined
  18377. 1106.51 s [extra] +++ OK, passed 100 tests.
  18378. 1106.51 s [extra] \(f :: Int -> Maybe Bool) xs -> anyM f xs == orM (map f xs)
  18379. 1106.51 s [extra] +++ OK, passed 100 tests.
  18380. 1106.51 s [extra] orM [Just False,Just True ,undefined] == Just True
  18381. 1106.51 s [extra] +++ OK, passed 100 tests.
  18382. 1106.51 s [extra] orM [Just False,Just False,undefined] == undefined
  18383. 1106.51 s [extra] +++ OK, passed 100 tests.
  18384. 1106.51 s [extra] \xs -> Just (or xs) == orM (map Just xs)
  18385. 1106.51 s [extra] +++ OK, passed 100 tests.
  18386. 1106.51 s [extra] andM [Just True,Just False,undefined] == Just False
  18387. 1106.51 s [extra] +++ OK, passed 100 tests.
  18388. 1106.51 s [extra] andM [Just True,Just True ,undefined] == undefined
  18389. 1106.51 s [extra] +++ OK, passed 100 tests.
  18390. 1106.51 s [extra] \xs -> Just (and xs) == andM (map Just xs)
  18391. 1106.51 s [extra] +++ OK, passed 100 tests.
  18392. 1106.51 s [extra] findM (Just . isUpper) "teST" == Just (Just 'S')
  18393. 1106.51 s [extra] +++ OK, passed 100 tests.
  18394. 1106.51 s [extra] findM (Just . isUpper) "test" == Just Nothing
  18395. 1106.51 s [extra] +++ OK, passed 100 tests.
  18396. 1106.51 s [extra] findM (Just . const True) ["x",undefined] == Just (Just "x")
  18397. 1106.51 s [extra] +++ OK, passed 100 tests.
  18398. 1106.51 s [extra] fromLeft 1 (Left 3) == 3
  18399. 1106.51 s [extra] +++ OK, passed 100 tests.
  18400. 1106.51 s [extra] fromLeft 1 (Right "foo") == 1
  18401. 1106.51 s [extra] +++ OK, passed 100 tests.
  18402. 1106.51 s [extra] fromRight 1 (Right 3) == 3
  18403. 1106.51 s [extra] +++ OK, passed 100 tests.
  18404. 1106.51 s [extra] fromRight 1 (Left "foo") == 1
  18405. 1106.51 s [extra] +++ OK, passed 100 tests.
  18406. 1106.51 s [extra] \x -> fromLeft' (Left x) == x
  18407. 1106.52 s [extra] +++ OK, passed 100 tests.
  18408. 1106.52 s [extra] \x -> fromLeft' (Right x) == undefined
  18409. 1106.52 s [extra] +++ OK, passed 100 tests.
  18410. 1106.52 s [extra] \x -> fromRight' (Right x) == x
  18411. 1106.52 s [extra] +++ OK, passed 100 tests.
  18412. 1106.52 s [extra] \x -> fromRight' (Left x) == undefined
  18413. 1106.52 s [extra] +++ OK, passed 100 tests.
  18414. 1106.52 s [extra] \x -> fromEither (Left x ) == x
  18415. 1106.52 s [extra] +++ OK, passed 100 tests.
  18416. 1106.52 s [extra] \x -> fromEither (Right x) == x
  18417. 1106.52 s [extra] +++ OK, passed 100 tests.
  18418. 1106.52 s [extra] \a b -> maybeToEither a (Just b) == Right b
  18419. 1106.52 s [extra] +++ OK, passed 100 tests.
  18420. 1106.52 s [extra] \a -> maybeToEither a Nothing == Left a
  18421. 1106.52 s [extra] +++ OK, passed 100 tests.
  18422. 1106.52 s [extra] \x -> eitherToMaybe (Left x) == Nothing
  18423. 1106.52 s [extra] +++ OK, passed 100 tests.
  18424. 1106.52 s [extra] \x -> eitherToMaybe (Right x) == Just x
  18425. 1106.52 s [extra] +++ OK, passed 100 tests.
  18426. 1106.52 s [extra] mapLeft show (Left 1) == Left "1"
  18427. 1106.52 s [extra] +++ OK, passed 100 tests.
  18428. 1106.52 s [extra] mapLeft show (Right True) == Right True
  18429. 1106.52 s [extra] +++ OK, passed 100 tests.
  18430. 1106.52 s [extra] mapRight show (Left 1) == Left 1
  18431. 1106.52 s [extra] +++ OK, passed 100 tests.
  18432. 1106.52 s [extra] mapRight show (Right True) == Right "True"
  18433. 1106.52 s [extra] +++ OK, passed 100 tests.
  18434. 1106.52 s [extra] \xs -> repeatedly (splitAt 3) xs == chunksOf 3 xs
  18435. 1106.52 s [extra] +++ OK, passed 100 tests.
  18436. 1106.52 s [extra] \xs -> repeatedly word1 (trim xs) == words xs
  18437. 1106.52 s [extra] +++ OK, passed 100 tests.
  18438. 1106.52 s [extra] \xs -> repeatedly line1 xs == lines xs
  18439. 1106.52 s [extra] +++ OK, passed 100 tests.
  18440. 1106.52 s [extra] disjoint [1,2,3] [4,5] == True
  18441. 1106.52 s [extra] +++ OK, passed 100 tests.
  18442. 1106.52 s [extra] disjoint [1,2,3] [4,1] == False
  18443. 1106.52 s [extra] +++ OK, passed 100 tests.
  18444. 1106.52 s [extra] disjointOrd [1,2,3] [4,5] == True
  18445. 1106.52 s [extra] +++ OK, passed 100 tests.
  18446. 1106.52 s [extra] disjointOrd [1,2,3] [4,1] == False
  18447. 1106.52 s [extra] +++ OK, passed 100 tests.
  18448. 1106.52 s [extra] disjointOrdBy (compare `on` (`mod` 7)) [1,2,3] [4,5] == True
  18449. 1106.52 s [extra] +++ OK, passed 100 tests.
  18450. 1106.52 s [extra] disjointOrdBy (compare `on` (`mod` 7)) [1,2,3] [4,8] == False
  18451. 1106.52 s [extra] +++ OK, passed 100 tests.
  18452. 1106.52 s [extra] anySame [1,1,2] == True
  18453. 1106.52 s [extra] +++ OK, passed 100 tests.
  18454. 1106.52 s [extra] anySame [1,2,3] == False
  18455. 1106.52 s [extra] +++ OK, passed 100 tests.
  18456. 1106.52 s [extra] anySame (1:2:1:undefined) == True
  18457. 1106.52 s [extra] +++ OK, passed 100 tests.
  18458. 1106.52 s [extra] anySame [] == False
  18459. 1106.52 s [extra] +++ OK, passed 100 tests.
  18460. 1106.52 s [extra] \xs -> anySame xs == (length (nub xs) < length xs)
  18461. 1106.52 s [extra] +++ OK, passed 100 tests.
  18462. 1106.52 s [extra] allSame [1,1,2] == False
  18463. 1106.52 s [extra] +++ OK, passed 100 tests.
  18464. 1106.52 s [extra] allSame [1,1,1] == True
  18465. 1106.52 s [extra] +++ OK, passed 100 tests.
  18466. 1106.52 s [extra] allSame [1] == True
  18467. 1106.52 s [extra] +++ OK, passed 100 tests.
  18468. 1106.52 s [extra] allSame [] == True
  18469. 1106.52 s [extra] +++ OK, passed 100 tests.
  18470. 1106.52 s [extra] allSame (1:1:2:undefined) == False
  18471. 1106.52 s [extra] +++ OK, passed 100 tests.
  18472. 1106.52 s [extra] \xs -> allSame xs == (length (nub xs) <= 1)
  18473. 1106.52 s [extra] +++ OK, passed 100 tests.
  18474. 1106.52 s [extra] headDef 1 [] == 1
  18475. 1106.52 s [extra] +++ OK, passed 100 tests.
  18476. 1106.52 s [extra] headDef 1 [2,3,4] == 2
  18477. 1106.52 s [extra] +++ OK, passed 100 tests.
  18478. 1106.52 s [extra] \x xs -> headDef x xs == fromMaybe x (listToMaybe xs)
  18479. 1106.52 s [extra] +++ OK, passed 100 tests.
  18480. 1106.52 s [extra] lastDef 1 [] == 1
  18481. 1106.52 s [extra] +++ OK, passed 100 tests.
  18482. 1106.52 s [extra] lastDef 1 [2,3,4] == 4
  18483. 1106.52 s [extra] +++ OK, passed 100 tests.
  18484. 1106.52 s [extra] \x xs -> lastDef x xs == last (x:xs)
  18485. 1106.52 s [extra] +++ OK, passed 100 tests.
  18486. 1106.52 s [extra] [2,3,4] !? 1 == Just 3
  18487. 1106.52 s [extra] +++ OK, passed 100 tests.
  18488. 1106.52 s [extra] [2,3,4] !? (-1) == Nothing
  18489. 1106.52 s [extra] +++ OK, passed 100 tests.
  18490. 1106.52 s [extra] [] !? 0 == Nothing
  18491. 1106.52 s [extra] +++ OK, passed 100 tests.
  18492. 1106.52 s [extra] notNull [] == False
  18493. 1106.52 s [extra] +++ OK, passed 100 tests.
  18494. 1106.52 s [extra] notNull [1] == True
  18495. 1106.52 s [extra] +++ OK, passed 100 tests.
  18496. 1106.52 s [extra] \xs -> notNull xs == not (null xs)
  18497. 1106.52 s [extra] +++ OK, passed 100 tests.
  18498. 1106.52 s [extra] list 1 (\v _ -> v - 2) [5,6,7] == 3
  18499. 1106.52 s [extra] +++ OK, passed 100 tests.
  18500. 1106.53 s [extra] list 1 (\v _ -> v - 2) [] == 1
  18501. 1106.53 s [extra] +++ OK, passed 100 tests.
  18502. 1106.53 s [extra] \nil cons xs -> maybe nil (uncurry cons) (uncons xs) == list nil cons xs
  18503. 1106.53 s [extra] +++ OK, passed 100 tests.
  18504. 1106.53 s [extra] unsnoc "test" == Just ("tes",'t')
  18505. 1106.53 s [extra] +++ OK, passed 100 tests.
  18506. 1106.53 s [extra] unsnoc "" == Nothing
  18507. 1106.53 s [extra] +++ OK, passed 100 tests.
  18508. 1106.53 s [extra] \xs -> unsnoc xs == if null xs then Nothing else Just (init xs, last xs)
  18509. 1106.53 s [extra] +++ OK, passed 100 tests.
  18510. 1106.53 s [extra] cons 't' "est" == "test"
  18511. 1106.53 s [extra] +++ OK, passed 100 tests.
  18512. 1106.53 s [extra] \x xs -> uncons (cons x xs) == Just (x,xs)
  18513. 1106.53 s [extra] +++ OK, passed 100 tests.
  18514. 1106.53 s [extra] snoc "tes" 't' == "test"
  18515. 1106.53 s [extra] +++ OK, passed 100 tests.
  18516. 1106.53 s [extra] \xs x -> unsnoc (snoc xs x) == Just (xs,x)
  18517. 1106.53 s [extra] +++ OK, passed 100 tests.
  18518. 1106.53 s [extra] enumerate == [False, True]
  18519. 1106.53 s [extra] +++ OK, passed 100 tests.
  18520. 1106.53 s [extra] takeEnd 3 "hello" == "llo"
  18521. 1106.53 s [extra] +++ OK, passed 100 tests.
  18522. 1106.53 s [extra] takeEnd 5 "bye" == "bye"
  18523. 1106.53 s [extra] +++ OK, passed 100 tests.
  18524. 1106.53 s [extra] takeEnd (-1) "bye" == ""
  18525. 1106.53 s [extra] +++ OK, passed 100 tests.
  18526. 1106.53 s [extra] \i xs -> takeEnd i xs `isSuffixOf` xs
  18527. 1106.53 s [extra] +++ OK, passed 100 tests.
  18528. 1106.53 s [extra] \i xs -> length (takeEnd i xs) == min (max 0 i) (length xs)
  18529. 1106.53 s [extra] +++ OK, passed 100 tests.
  18530. 1106.53 s [extra] dropEnd 3 "hello" == "he"
  18531. 1106.53 s [extra] +++ OK, passed 100 tests.
  18532. 1106.53 s [extra] dropEnd 5 "bye" == ""
  18533. 1106.53 s [extra] +++ OK, passed 100 tests.
  18534. 1106.53 s [extra] dropEnd (-1) "bye" == "bye"
  18535. 1106.53 s [extra] +++ OK, passed 100 tests.
  18536. 1106.53 s [extra] \i xs -> dropEnd i xs `isPrefixOf` xs
  18537. 1106.53 s [extra] +++ OK, passed 100 tests.
  18538. 1106.53 s [extra] \i xs -> length (dropEnd i xs) == max 0 (length xs - max 0 i)
  18539. 1106.53 s [extra] +++ OK, passed 100 tests.
  18540. 1106.53 s [extra] \i -> take 3 (dropEnd 5 [i..]) == take 3 [i..]
  18541. 1106.53 s [extra] +++ OK, passed 100 tests.
  18542. 1106.53 s [extra] splitAtEnd 3 "hello" == ("he","llo")
  18543. 1106.53 s [extra] +++ OK, passed 100 tests.
  18544. 1106.53 s [extra] splitAtEnd 3 "he" == ("", "he")
  18545. 1106.53 s [extra] +++ OK, passed 100 tests.
  18546. 1106.53 s [extra] \i xs -> uncurry (++) (splitAt i xs) == xs
  18547. 1106.53 s [extra] +++ OK, passed 100 tests.
  18548. 1106.53 s [extra] \i xs -> splitAtEnd i xs == (dropEnd i xs, takeEnd i xs)
  18549. 1106.53 s [extra] +++ OK, passed 100 tests.
  18550. 1106.53 s [extra] \i xs -> zip [i..] xs == zipFrom i xs
  18551. 1106.53 s [extra] +++ OK, passed 100 tests.
  18552. 1106.53 s [extra] zipFrom False [1..3] == [(False,1),(True, 2)]
  18553. 1106.53 s [extra] +++ OK, passed 100 tests.
  18554. 1106.53 s [extra] \i xs -> zipWithFrom (,) i xs == zipFrom i xs
  18555. 1106.53 s [extra] +++ OK, passed 100 tests.
  18556. 1106.53 s [extra] concatUnzip [("a","AB"),("bc","C")] == ("abc","ABC")
  18557. 1106.53 s [extra] +++ OK, passed 100 tests.
  18558. 1106.53 s [extra] concatUnzip3 [("a","AB",""),("bc","C","123")] == ("abc","ABC","123")
  18559. 1106.53 s [extra] +++ OK, passed 100 tests.
  18560. 1106.53 s [extra] takeWhileEnd even [2,3,4,6] == [4,6]
  18561. 1106.53 s [extra] +++ OK, passed 100 tests.
  18562. 1106.53 s [extra] trim " hello " == "hello"
  18563. 1106.53 s [extra] +++ OK, passed 100 tests.
  18564. 1106.53 s [extra] trimStart " hello " == "hello "
  18565. 1106.53 s [extra] +++ OK, passed 100 tests.
  18566. 1106.53 s [extra] trimEnd " hello " == " hello"
  18567. 1106.53 s [extra] +++ OK, passed 100 tests.
  18568. 1106.53 s [extra] \s -> trim s == trimEnd (trimStart s)
  18569. 1106.53 s [extra] +++ OK, passed 100 tests.
  18570. 1106.53 s [extra] lower "This is A TEST" == "this is a test"
  18571. 1106.53 s [extra] +++ OK, passed 100 tests.
  18572. 1106.53 s [extra] lower "" == ""
  18573. 1106.53 s [extra] +++ OK, passed 100 tests.
  18574. 1106.53 s [extra] upper "This is A TEST" == "THIS IS A TEST"
  18575. 1106.53 s [extra] +++ OK, passed 100 tests.
  18576. 1106.53 s [extra] upper "" == ""
  18577. 1106.53 s [extra] +++ OK, passed 100 tests.
  18578. 1106.53 s [extra] word1 "" == ("", "")
  18579. 1106.53 s [extra] +++ OK, passed 100 tests.
  18580. 1106.53 s [extra] word1 "keyword rest of string" == ("keyword","rest of string")
  18581. 1106.53 s [extra] +++ OK, passed 100 tests.
  18582. 1106.54 s [extra] word1 " keyword\n rest of string" == ("keyword","rest of string")
  18583. 1106.54 s [extra] +++ OK, passed 100 tests.
  18584. 1106.54 s [extra] \s -> fst (word1 s) == concat (take 1 $ words s)
  18585. 1106.54 s [extra] +++ OK, passed 100 tests.
  18586. 1106.54 s [extra] \s -> words (snd $ word1 s) == drop 1 (words s)
  18587. 1106.54 s [extra] +++ OK, passed 100 tests.
  18588. 1106.54 s [extra] line1 "" == ("", "")
  18589. 1106.54 s [extra] +++ OK, passed 100 tests.
  18590. 1106.54 s [extra] line1 "test" == ("test","")
  18591. 1106.54 s [extra] +++ OK, passed 100 tests.
  18592. 1106.54 s [extra] line1 "test\n" == ("test","")
  18593. 1106.54 s [extra] +++ OK, passed 100 tests.
  18594. 1106.54 s [extra] line1 "test\nrest" == ("test","rest")
  18595. 1106.54 s [extra] +++ OK, passed 100 tests.
  18596. 1106.54 s [extra] line1 "test\nrest\nmore" == ("test","rest\nmore")
  18597. 1106.54 s [extra] +++ OK, passed 100 tests.
  18598. 1106.54 s [extra] escapeHTML "this is a test" == "this is a test"
  18599. 1106.54 s [extra] +++ OK, passed 100 tests.
  18600. 1106.54 s [extra] escapeHTML "<b>\"g&t\"</n>" == "&lt;b&gt;&quot;g&amp;t&quot;&lt;/n&gt;"
  18601. 1106.54 s [extra] +++ OK, passed 100 tests.
  18602. 1106.54 s [extra] escapeHTML "t'was another test" == "t&#39;was another test"
  18603. 1106.54 s [extra] +++ OK, passed 100 tests.
  18604. 1106.54 s [extra] \xs -> unescapeHTML (escapeHTML xs) == xs
  18605. 1106.54 s [extra] +++ OK, passed 100 tests.
  18606. 1106.54 s [extra] escapeJSON "this is a test" == "this is a test"
  18607. 1106.54 s [extra] +++ OK, passed 100 tests.
  18608. 1106.54 s [extra] escapeJSON "\ttab\nnewline\\" == "\\ttab\\nnewline\\\\"
  18609. 1106.54 s [extra] +++ OK, passed 100 tests.
  18610. 1106.54 s [extra] escapeJSON "\ESC[0mHello" == "\\u001b[0mHello"
  18611. 1106.54 s [extra] +++ OK, passed 100 tests.
  18612. 1106.54 s [extra] \xs -> unescapeJSON (escapeJSON xs) == xs
  18613. 1106.54 s [extra] +++ OK, passed 100 tests.
  18614. 1106.54 s [extra] groupOn abs [1,-1,2] == [[1,-1], [2]]
  18615. 1106.54 s [extra] +++ OK, passed 100 tests.
  18616. 1106.54 s [extra] groupOnKey abs [1,-1,2] == [(1, [1,-1]), (2, [2])]
  18617. 1106.54 s [extra] +++ OK, passed 100 tests.
  18618. 1106.54 s [extra] maximumOn id [] == undefined
  18619. 1106.54 s [extra] +++ OK, passed 100 tests.
  18620. 1106.54 s [extra] maximumOn length ["test","extra","a"] == "extra"
  18621. 1106.54 s [extra] +++ OK, passed 100 tests.
  18622. 1106.54 s [extra] minimumOn id [] == undefined
  18623. 1106.54 s [extra] +++ OK, passed 100 tests.
  18624. 1106.54 s [extra] minimumOn length ["test","extra","a"] == "a"
  18625. 1106.54 s [extra] +++ OK, passed 100 tests.
  18626. 1106.54 s [extra] groupSort [(1,'t'),(3,'t'),(2,'e'),(2,'s')] == [(1,"t"),(2,"es"),(3,"t")]
  18627. 1106.54 s [extra] +++ OK, passed 100 tests.
  18628. 1106.54 s [extra] \xs -> map fst (groupSort xs) == sort (nub (map fst xs))
  18629. 1106.54 s [extra] +++ OK, passed 100 tests.
  18630. 1106.54 s [extra] \xs -> concatMap snd (groupSort xs) == map snd (sortOn fst xs)
  18631. 1106.54 s [extra] +++ OK, passed 100 tests.
  18632. 1106.54 s [extra] groupSortOn length ["test","of","sized","item"] == [["of"],["test","item"],["sized"]]
  18633. 1106.54 s [extra] +++ OK, passed 100 tests.
  18634. 1106.54 s [extra] groupSortBy (compare `on` length) ["test","of","sized","item"] == [["of"],["test","item"],["sized"]]
  18635. 1106.54 s [extra] +++ OK, passed 100 tests.
  18636. 1106.54 s [extra] sum' [1, 2, 3] == 6
  18637. 1106.54 s [extra] +++ OK, passed 100 tests.
  18638. 1106.54 s [extra] sumOn' read ["1", "2", "3"] == 6
  18639. 1106.54 s [extra] +++ OK, passed 100 tests.
  18640. 1106.54 s [extra] product' [1, 2, 4] == 8
  18641. 1106.54 s [extra] +++ OK, passed 100 tests.
  18642. 1106.54 s [extra] productOn' read ["1", "2", "4"] == 8
  18643. 1106.54 s [extra] +++ OK, passed 100 tests.
  18644. 1106.55 s [extra] merge "ace" "bd" == "abcde"
  18645. 1106.55 s [extra] +++ OK, passed 100 tests.
  18646. 1106.55 s [extra] \xs ys -> merge (sort xs) (sort ys) == sort (xs ++ ys)
  18647. 1106.55 s [extra] +++ OK, passed 100 tests.
  18648. 1106.55 s [extra] replace "el" "_" "Hello Bella" == "H_lo B_la"
  18649. 1106.55 s [extra] +++ OK, passed 100 tests.
  18650. 1106.55 s [extra] replace "el" "e" "Hello" == "Helo"
  18651. 1106.55 s [extra] +++ OK, passed 100 tests.
  18652. 1106.55 s [extra] replace "" "x" "Hello" == "xHxexlxlxox"
  18653. 1106.55 s [extra] +++ OK, passed 100 tests.
  18654. 1106.55 s [extra] replace "" "x" "" == "x"
  18655. 1106.55 s [extra] +++ OK, passed 100 tests.
  18656. 1106.55 s [extra] \xs ys -> replace xs xs ys == ys
  18657. 1106.55 s [extra] +++ OK, passed 100 tests.
  18658. 1106.55 s [extra] breakEnd isLower "youRE" == ("you","RE")
  18659. 1106.55 s [extra] +++ OK, passed 100 tests.
  18660. 1106.55 s [extra] breakEnd isLower "youre" == ("youre","")
  18661. 1106.55 s [extra] +++ OK, passed 100 tests.
  18662. 1106.55 s [extra] breakEnd isLower "YOURE" == ("","YOURE")
  18663. 1106.55 s [extra] +++ OK, passed 100 tests.
  18664. 1106.55 s [extra] \f xs -> breakEnd (not . f) xs == spanEnd f xs
  18665. 1106.55 s [extra] +++ OK, passed 100 tests.
  18666. 1106.55 s [extra] spanEnd isUpper "youRE" == ("you","RE")
  18667. 1106.55 s [extra] +++ OK, passed 100 tests.
  18668. 1106.55 s [extra] spanEnd (not . isSpace) "x y z" == ("x y ","z")
  18669. 1106.55 s [extra] +++ OK, passed 100 tests.
  18670. 1106.55 s [extra] \f xs -> uncurry (++) (spanEnd f xs) == xs
  18671. 1106.55 s [extra] +++ OK, passed 100 tests.
  18672. 1106.55 s [extra] \f xs -> spanEnd f xs == swap (both reverse (span f (reverse xs)))
  18673. 1106.55 s [extra] +++ OK, passed 100 tests.
  18674. 1106.55 s [extra] wordsBy (== ':') "::xyz:abc::123::" == ["xyz","abc","123"]
  18675. 1106.55 s [extra] +++ OK, passed 100 tests.
  18676. 1106.55 s [extra] \s -> wordsBy isSpace s == words s
  18677. 1106.55 s [extra] +++ OK, passed 100 tests.
  18678. 1106.55 s [extra] linesBy (== ':') "::xyz:abc::123::" == ["","","xyz","abc","","123",""]
  18679. 1106.55 s [extra] +++ OK, passed 100 tests.
  18680. 1106.55 s [extra] \s -> linesBy (== '\n') s == lines s
  18681. 1106.55 s [extra] +++ OK, passed 100 tests.
  18682. 1106.55 s [extra] linesBy (== ';') "my;list;here;" == ["my","list","here"]
  18683. 1106.55 s [extra] +++ OK, passed 100 tests.
  18684. 1106.55 s [extra] firstJust id [Nothing,Just 3] == Just 3
  18685. 1106.55 s [extra] +++ OK, passed 100 tests.
  18686. 1106.55 s [extra] firstJust id [Nothing,Nothing] == Nothing
  18687. 1106.55 s [extra] +++ OK, passed 100 tests.
  18688. 1106.55 s [extra] drop1 "" == ""
  18689. 1106.55 s [extra] +++ OK, passed 100 tests.
  18690. 1106.55 s [extra] drop1 "test" == "est"
  18691. 1106.55 s [extra] +++ OK, passed 100 tests.
  18692. 1106.55 s [extra] \xs -> drop 1 xs == drop1 xs
  18693. 1106.55 s [extra] +++ OK, passed 100 tests.
  18694. 1106.55 s [extra] dropEnd1 "" == ""
  18695. 1106.55 s [extra] +++ OK, passed 100 tests.
  18696. 1106.55 s [extra] dropEnd1 "test" == "tes"
  18697. 1106.55 s [extra] +++ OK, passed 100 tests.
  18698. 1106.55 s [extra] \xs -> dropEnd 1 xs == dropEnd1 xs
  18699. 1106.55 s [extra] +++ OK, passed 100 tests.
  18700. 1106.55 s [extra] mconcatMap Sum [1,2,3] == Sum 6
  18701. 1106.55 s [extra] +++ OK, passed 100 tests.
  18702. 1106.55 s [extra] \f xs -> mconcatMap f xs == concatMap f xs
  18703. 1106.57 s [extra] +++ OK, passed 100 tests.
  18704. 1106.57 s [extra] breakOn "::" "a::b::c" == ("a", "::b::c")
  18705. 1106.57 s [extra] +++ OK, passed 100 tests.
  18706. 1106.57 s [extra] breakOn "/" "foobar" == ("foobar", "")
  18707. 1106.57 s [extra] +++ OK, passed 100 tests.
  18708. 1106.57 s [extra] \needle haystack -> let (prefix,match) = breakOn needle haystack in prefix ++ match == haystack
  18709. 1106.57 s [extra] +++ OK, passed 100 tests.
  18710. 1106.57 s [extra] breakOnEnd "::" "a::b::c" == ("a::b::", "c")
  18711. 1106.57 s [extra] +++ OK, passed 100 tests.
  18712. 1106.57 s [extra] splitOn "\r\n" "a\r\nb\r\nd\r\ne" == ["a","b","d","e"]
  18713. 1106.57 s [extra] +++ OK, passed 100 tests.
  18714. 1106.57 s [extra] splitOn "aaa" "aaaXaaaXaaaXaaa" == ["","X","X","X",""]
  18715. 1106.57 s [extra] +++ OK, passed 100 tests.
  18716. 1106.57 s [extra] splitOn "x" "x" == ["",""]
  18717. 1106.57 s [extra] +++ OK, passed 100 tests.
  18718. 1106.57 s [extra] splitOn "x" "" == [""]
  18719. 1106.57 s [extra] +++ OK, passed 100 tests.
  18720. 1106.57 s [extra] \s x -> s /= "" ==> intercalate s (splitOn s x) == x
  18721. 1106.57 s [extra] +++ OK, passed 100 tests; 15 discarded.
  18722. 1106.57 s [extra] \c x -> splitOn [c] x == split (==c) x
  18723. 1106.57 s [extra] +++ OK, passed 100 tests.
  18724. 1106.57 s [extra] split (== 'a') "aabbaca" == ["","","bb","c",""]
  18725. 1106.57 s [extra] +++ OK, passed 100 tests.
  18726. 1106.57 s [extra] split (== 'a') "" == [""]
  18727. 1106.57 s [extra] +++ OK, passed 100 tests.
  18728. 1106.57 s [extra] split (== ':') "::xyz:abc::123::" == ["","","xyz","abc","","123","",""]
  18729. 1106.57 s [extra] +++ OK, passed 100 tests.
  18730. 1106.57 s [extra] split (== ',') "my,list,here" == ["my","list","here"]
  18731. 1106.57 s [extra] +++ OK, passed 100 tests.
  18732. 1106.57 s [extra] dropWhileEnd isSpace "ab cde " == "ab cde"
  18733. 1106.57 s [extra] +++ OK, passed 100 tests.
  18734. 1106.57 s [extra] dropWhileEnd' isSpace "ab cde " == "ab cde"
  18735. 1106.57 s [extra] +++ OK, passed 100 tests.
  18736. 1106.57 s [extra] last (dropWhileEnd even [undefined,3]) == undefined
  18737. 1106.57 s [extra] +++ OK, passed 100 tests.
  18738. 1106.57 s [extra] last (dropWhileEnd' even [undefined,3]) == 3
  18739. 1106.57 s [extra] +++ OK, passed 100 tests.
  18740. 1106.57 s [extra] head (dropWhileEnd even (3:undefined)) == 3
  18741. 1106.57 s [extra] +++ OK, passed 100 tests.
  18742. 1106.57 s [extra] head (dropWhileEnd' even (3:undefined)) == undefined
  18743. 1106.57 s [extra] +++ OK, passed 100 tests.
  18744. 1106.57 s [extra] dropPrefix "Mr. " "Mr. Men" == "Men"
  18745. 1106.57 s [extra] +++ OK, passed 100 tests.
  18746. 1106.57 s [extra] dropPrefix "Mr. " "Dr. Men" == "Dr. Men"
  18747. 1106.57 s [extra] +++ OK, passed 100 tests.
  18748. 1106.57 s [extra] dropSuffix "!" "Hello World!" == "Hello World"
  18749. 1106.57 s [extra] +++ OK, passed 100 tests.
  18750. 1106.57 s [extra] dropSuffix "!" "Hello World!!" == "Hello World!"
  18751. 1106.57 s [extra] +++ OK, passed 100 tests.
  18752. 1106.57 s [extra] dropSuffix "!" "Hello World." == "Hello World."
  18753. 1106.57 s [extra] +++ OK, passed 100 tests.
  18754. 1106.57 s [extra] stripSuffix "bar" "foobar" == Just "foo"
  18755. 1106.57 s [extra] +++ OK, passed 100 tests.
  18756. 1106.57 s [extra] stripSuffix "" "baz" == Just "baz"
  18757. 1106.57 s [extra] +++ OK, passed 100 tests.
  18758. 1106.57 s [extra] stripSuffix "foo" "quux" == Nothing
  18759. 1106.57 s [extra] +++ OK, passed 100 tests.
  18760. 1106.57 s [extra] stripInfix "::" "a::b::c" == Just ("a", "b::c")
  18761. 1106.57 s [extra] +++ OK, passed 100 tests.
  18762. 1106.57 s [extra] stripInfix "/" "foobar" == Nothing
  18763. 1106.57 s [extra] +++ OK, passed 100 tests.
  18764. 1106.57 s [extra] stripInfixEnd "::" "a::b::c" == Just ("a::b", "c")
  18765. 1106.57 s [extra] +++ OK, passed 100 tests.
  18766. 1106.57 s [extra] chunksOf 3 "my test" == ["my ","tes","t"]
  18767. 1106.57 s [extra] +++ OK, passed 100 tests.
  18768. 1106.57 s [extra] chunksOf 3 "mytest" == ["myt","est"]
  18769. 1106.57 s [extra] +++ OK, passed 100 tests.
  18770. 1106.57 s [extra] chunksOf 8 "" == []
  18771. 1106.57 s [extra] +++ OK, passed 100 tests.
  18772. 1106.57 s [extra] chunksOf 0 "test" == undefined
  18773. 1106.57 s [extra] +++ OK, passed 100 tests.
  18774. 1106.57 s [extra] nubSort "this is a test" == " aehist"
  18775. 1106.57 s [extra] +++ OK, passed 100 tests.
  18776. 1106.57 s [extra] \xs -> nubSort xs == nub (sort xs)
  18777. 1106.57 s [extra] +++ OK, passed 100 tests.
  18778. 1106.57 s [extra] nubSortOn length ["a","test","of","this"] == ["a","of","test"]
  18779. 1106.57 s [extra] +++ OK, passed 100 tests.
  18780. 1106.57 s [extra] nubSortBy (compare `on` length) ["a","test","of","this"] == ["a","of","test"]
  18781. 1106.57 s [extra] +++ OK, passed 100 tests.
  18782. 1106.57 s [extra] nubOrd "this is a test" == "this ae"
  18783. 1106.57 s [extra] +++ OK, passed 100 tests.
  18784. 1106.57 s [extra] nubOrd (take 4 ("this" ++ undefined)) == "this"
  18785. 1106.57 s [extra] +++ OK, passed 100 tests.
  18786. 1106.57 s [extra] \xs -> nubOrd xs == nub xs
  18787. 1106.58 s [extra] +++ OK, passed 100 tests.
  18788. 1106.58 s [extra] nubOrdOn length ["a","test","of","this"] == ["a","test","of"]
  18789. 1106.58 s [extra] +++ OK, passed 100 tests.
  18790. 1106.58 s [extra] nubOrdBy (compare `on` length) ["a","test","of","this"] == ["a","test","of"]
  18791. 1106.58 s [extra] +++ OK, passed 100 tests.
  18792. 1106.58 s [extra] zipWithLongest (,) "a" "xyz" == [(Just 'a', Just 'x'), (Nothing, Just 'y'), (Nothing, Just 'z')]
  18793. 1106.58 s [extra] +++ OK, passed 100 tests.
  18794. 1106.58 s [extra] zipWithLongest (,) "a" "x" == [(Just 'a', Just 'x')]
  18795. 1106.58 s [extra] +++ OK, passed 100 tests.
  18796. 1106.58 s [extra] zipWithLongest (,) "" "x" == [(Nothing, Just 'x')]
  18797. 1106.58 s [extra] +++ OK, passed 100 tests.
  18798. 1106.58 s [extra] comparingLength [1,2,3] [False] == GT
  18799. 1106.58 s [extra] +++ OK, passed 100 tests.
  18800. 1106.58 s [extra] comparingLength [1,2] "ab" == EQ
  18801. 1106.58 s [extra] +++ OK, passed 100 tests.
  18802. 1106.58 s [extra] \(xs :: [Int]) (ys :: [Int]) -> comparingLength xs ys == Data.Ord.comparing length xs ys
  18803. 1106.58 s [extra] +++ OK, passed 100 tests.
  18804. 1106.58 s [extra] comparingLength [1,2] (1:2:3:undefined) == LT
  18805. 1106.58 s [extra] +++ OK, passed 100 tests.
  18806. 1106.58 s [extra] comparingLength (1:2:3:undefined) [1,2] == GT
  18807. 1106.58 s [extra] +++ OK, passed 100 tests.
  18808. 1106.58 s [extra] mwhen True "test" == "test"
  18809. 1106.58 s [extra] +++ OK, passed 100 tests.
  18810. 1106.58 s [extra] mwhen False "test" == ""
  18811. 1106.58 s [extra] +++ OK, passed 100 tests.
  18812. 1106.58 s [extra] first succ (1,"test") == (2,"test")
  18813. 1106.58 s [extra] +++ OK, passed 100 tests.
  18814. 1106.58 s [extra] second reverse (1,"test") == (1,"tset")
  18815. 1106.58 s [extra] +++ OK, passed 100 tests.
  18816. 1106.58 s [extra] firstM (\x -> [x-1, x+1]) (1,"test") == [(0,"test"),(2,"test")]
  18817. 1106.58 s [extra] +++ OK, passed 100 tests.
  18818. 1106.58 s [extra] secondM (\x -> [reverse x, x]) (1,"test") == [(1,"tset"),(1,"test")]
  18819. 1106.58 s [extra] +++ OK, passed 100 tests.
  18820. 1106.58 s [extra] (succ *** reverse) (1,"test") == (2,"tset")
  18821. 1106.58 s [extra] +++ OK, passed 100 tests.
  18822. 1106.58 s [extra] (succ &&& pred) 1 == (2,0)
  18823. 1106.58 s [extra] +++ OK, passed 100 tests.
  18824. 1106.58 s [extra] dupe 12 == (12, 12)
  18825. 1106.58 s [extra] +++ OK, passed 100 tests.
  18826. 1106.58 s [extra] both succ (1,2) == (2,3)
  18827. 1106.58 s [extra] +++ OK, passed 100 tests.
  18828. 1106.58 s [extra] first3 succ (1,1,1) == (2,1,1)
  18829. 1106.58 s [extra] +++ OK, passed 100 tests.
  18830. 1106.58 s [extra] second3 succ (1,1,1) == (1,2,1)
  18831. 1106.58 s [extra] +++ OK, passed 100 tests.
  18832. 1106.58 s [extra] third3 succ (1,1,1) == (1,1,2)
  18833. 1106.58 s [extra] +++ OK, passed 100 tests.
  18834. 1106.58 s [extra] \x -> readVersion (showVersion x) == x
  18835. 1106.58 s [extra] +++ OK, passed 100 tests.
  18836. 1106.58 s [extra] readVersion "hello" == undefined
  18837. 1106.58 s [extra] +++ OK, passed 100 tests.
  18838. 1106.58 s [extra] showDP 4 pi == "3.1416"
  18839. 1106.58 s [extra] +++ OK, passed 100 tests.
  18840. 1106.58 s [extra] showDP 0 pi == "3"
  18841. 1106.58 s [extra] +++ OK, passed 100 tests.
  18842. 1106.58 s [extra] showDP 2 3 == "3.00"
  18843. 1106.58 s [extra] +++ OK, passed 100 tests.
  18844. 1106.58 s [extra] withTempDir $ \dir -> do writeFile (dir </> "foo.txt") ""; withCurrentDirectory dir $ doesFileExist "foo.txt"
  18845. 1106.58 s [extra] +++ OK, passed 100 tests.
  18846. 1106.58 s [extra] withTempDir $ \dir -> do writeFile (dir </> "test.txt") ""; (== [dir </> "test.txt"]) <$> listContents dir
  18847. 1106.58 s [extra] +++ OK, passed 100 tests.
  18848. 1106.58 s [extra] listTest listContents ["bar.txt","foo/baz.txt","zoo"] ["bar.txt","foo","zoo"]
  18849. 1106.58 s [extra] +++ OK, passed 100 tests.
  18850. 1106.58 s [extra] listTest listDirectories ["bar.txt","foo/baz.txt","zoo"] ["foo"]
  18851. 1106.58 s [extra] +++ OK, passed 100 tests.
  18852. 1106.58 s [extra] listTest listFiles ["bar.txt","foo/baz.txt","zoo"] ["bar.txt","zoo"]
  18853. 1106.58 s [extra] +++ OK, passed 100 tests.
  18854. 1106.58 s [extra] listTest listFilesRecursive ["bar.txt","zoo","foo" </> "baz.txt"] ["bar.txt","zoo","foo" </> "baz.txt"]
  18855. 1106.58 s [extra] +++ OK, passed 100 tests.
  18856. 1106.58 s [extra] listTest (listFilesInside $ pure . not . isPrefixOf "." . takeFileName) ["bar.txt","foo" </> "baz.txt",".foo" </> "baz2.txt", "zoo"] ["bar.txt","zoo","foo" </> "baz.txt"]
  18857. 1106.58 s [extra] +++ OK, passed 100 tests.
  18858. 1106.58 s [extra] listTest (listFilesInside $ const $ pure False) ["bar.txt"] []
  18859. 1106.58 s [extra] +++ OK, passed 100 tests.
  18860. 1106.58 s [extra] isWindows == (os == "mingw32")
  18861. 1106.58 s [extra] +++ OK, passed 100 tests.
  18862. 1106.58 s [extra] \(filter isHexDigit -> s) -> fmap (== s) $ withTempFile $ \file -> do writeFile file s; readFile' file
  18863. 1106.60 s [extra] +++ OK, passed 100 tests.
  18864. 1106.60 s [extra] \s -> withTempFile $ \file -> do writeFileUTF8 file s; fmap (== s) $ readFileUTF8' file
  18865. 1106.62 s [extra] +++ OK, passed 100 tests.
  18866. 1106.62 s [extra] \(ASCIIString s) -> withTempFile $ \file -> do writeFileBinary file s; fmap (== s) $ readFileBinary' file
  18867. 1106.63 s [extra] +++ OK, passed 100 tests.
  18868. 1106.63 s [extra] captureOutput (print 1) == pure ("1\n",())
  18869. 1106.63 s [extra] +++ OK, passed 100 tests.
  18870. 1106.63 s [extra] withTempFile doesFileExist == pure True
  18871. 1106.63 s [extra] +++ OK, passed 100 tests.
  18872. 1106.63 s [extra] (doesFileExist =<< withTempFile pure) == pure False
  18873. 1106.63 s [extra] +++ OK, passed 100 tests.
  18874. 1106.63 s [extra] withTempFile readFile' == pure ""
  18875. 1106.63 s [extra] +++ OK, passed 100 tests.
  18876. 1106.63 s [extra] withTempDir doesDirectoryExist == pure True
  18877. 1106.63 s [extra] +++ OK, passed 100 tests.
  18878. 1106.63 s [extra] (doesDirectoryExist =<< withTempDir pure) == pure False
  18879. 1106.63 s [extra] +++ OK, passed 100 tests.
  18880. 1106.63 s [extra] withTempDir listFiles == pure []
  18881. 1106.63 s [extra] +++ OK, passed 100 tests.
  18882. 1106.64 s [extra] fileEq "does_not_exist1" "does_not_exist2" == undefined
  18883. 1106.64 s [extra] +++ OK, passed 100 tests.
  18884. 1106.64 s [extra] fileEq "does_not_exist" "does_not_exist" == undefined
  18885. 1106.64 s [extra] +++ OK, passed 100 tests.
  18886. 1106.64 s [extra] withTempFile $ \f1 -> fileEq "does_not_exist" f1 == undefined
  18887. 1106.64 s [extra] +++ OK, passed 100 tests.
  18888. 1106.64 s [extra] withTempFile $ \f1 -> withTempFile $ \f2 -> fileEq f1 f2
  18889. 1106.64 s [extra] +++ OK, passed 100 tests.
  18890. 1106.64 s [extra] withTempFile $ \f1 -> withTempFile $ \f2 -> writeFile f1 "a" >> writeFile f2 "a" >> fileEq f1 f2
  18891. 1106.64 s [extra] +++ OK, passed 100 tests.
  18892. 1106.64 s [extra] withTempFile $ \f1 -> withTempFile $ \f2 -> writeFile f1 "a" >> writeFile f2 "b" >> notM (fileEq f1 f2)
  18893. 1106.64 s [extra] +++ OK, passed 100 tests.
  18894. 1106.64 s [extra] fmap (round . fst) (duration $ sleep 1) == pure 1
  18895. 1107.64 s [extra] +++ OK, passed 100 tests.
  18896. 1107.64 s [extra] timeout (-3) (print 1) == pure Nothing
  18897. 1107.64 s [extra] +++ OK, passed 100 tests.
  18898. 1107.64 s [extra] timeout 0.1 (print 1) == fmap Just (print 1)
  18899. 1107.64 s [extra] +++ OK, passed 100 tests.
  18900. 1107.64 s [extra] do (t, _) <- duration $ timeout 0.1 $ sleep 1000; print t; pure $ t < 1
  18901. 1107.74 s [extra] 0.10030109400000001
  18902. 1107.74 s [extra] +++ OK, passed 100 tests.
  18903. 1107.74 s [extra] timeout 0.1 (sleep 2 >> print 1) == pure Nothing
  18904. 1107.84 s [extra] +++ OK, passed 100 tests.
  18905. 1107.84 s [extra] showDuration 3.435 == "3.44s"
  18906. 1107.84 s [extra] +++ OK, passed 100 tests.
  18907. 1107.84 s [extra] showDuration 623.8 == "10m24s"
  18908. 1107.84 s [extra] +++ OK, passed 100 tests.
  18909. 1107.84 s [extra] showDuration 62003.8 == "17h13m"
  18910. 1107.84 s [extra] +++ OK, passed 100 tests.
  18911. 1107.84 s [extra] showDuration 1e8 == "27777h47m"
  18912. 1107.84 s [extra] +++ OK, passed 100 tests.
  18913. 1107.84 s [extra] do f <- offsetTime; xs <- replicateM 10 f; pure $ xs == sort xs
  18914. 1107.84 s [extra] +++ OK, passed 100 tests.
  18915. 1107.84 s [extra] do (a,_) <- duration $ sleep 1; pure $ a >= 1 && a <= 1.5
  18916. 1108.84 s [extra] +++ OK, passed 100 tests.
  18917. 1108.84 s [extra] Extra export
  18918. 1108.84 s [extra] +++ OK, passed 100 tests.
  18919. 1108.84 s [extra] withTempFile
  18920. 1108.85 s [extra] ....done
  18921. 1108.85 s [extra] withTempDir
  18922. 1108.87 s [extra] ....done
  18923. 1108.87 s [extra] retry
  18924. 1108.87 s [extra] +++ OK, passed 100 tests.
  18925. 1108.87 s [extra] barrier
  18926. 1108.87 s [extra] Success (325 tests)
  18927. 1108.89 s [extra] Test suite extra-test: PASS
  18928. 1108.89 s [extra] Test suite logged to: dist/test/extra-1.8.1-extra-test.log
  18929. 1108.89 s [extra] 1 of 1 test suites (1 of 1 test cases) passed.
  18930. 1108.90 s [extra] Phase: haddockPhase
  18931. 1109.07 s [extra] Preprocessing library for extra-1.8.1...
  18932. 1109.07 s [extra] Running Haddock on library for extra-1.8.1...
  18933. 1109.47 s [extra] [ 1 of 22] Compiling Data.IORef.Extra ( src/Data/IORef/Extra.hs, nothing )
  18934. 1109.49 s [extra] [ 2 of 22] Compiling Data.Monoid.Extra ( src/Data/Monoid/Extra.hs, nothing )
  18935. 1109.50 s [extra] [ 3 of 22] Compiling Data.Tuple.Extra ( src/Data/Tuple/Extra.hs, nothing )
  18936. 1109.52 s [extra] [ 4 of 22] Compiling Data.Typeable.Extra ( src/Data/Typeable/Extra.hs, nothing )
  18937. 1109.53 s [extra] [ 5 of 22] Compiling Numeric.Extra ( src/Numeric/Extra.hs, nothing )
  18938. 1109.60 s [extra] [ 6 of 22] Compiling Partial ( src/Partial.hs, nothing )
  18939. 1109.60 s [extra] [ 7 of 22] Compiling Data.List.Extra ( src/Data/List/Extra.hs, nothing )
  18940. 1109.74 s [extra] [ 8 of 22] Compiling Data.Version.Extra ( src/Data/Version/Extra.hs, nothing )
  18941. 1109.74 s [extra] [ 9 of 22] Compiling Data.List.NonEmpty.Extra ( src/Data/List/NonEmpty/Extra.hs, nothing )
  18942. 1109.84 s [extra] [10 of 22] Compiling Data.Either.Extra ( src/Data/Either/Extra.hs, nothing )
  18943. 1109.85 s [extra] [11 of 22] Compiling Control.Exception.Extra ( src/Control/Exception/Extra.hs, nothing )
  18944. 1109.89 s [extra] [12 of 22] Compiling Control.Monad.Extra ( src/Control/Monad/Extra.hs, nothing )
  18945. 1110.01 s [extra] [13 of 22] Compiling Data.Foldable.Extra ( src/Data/Foldable/Extra.hs, nothing )
  18946. 1110.03 s [extra] [14 of 22] Compiling Control.Concurrent.Extra ( src/Control/Concurrent/Extra.hs, nothing )
  18947. 1110.09 s [extra] [15 of 22] Compiling System.Directory.Extra ( src/System/Directory/Extra.hs, nothing )
  18948. 1110.14 s [extra] [16 of 22] Compiling System.Environment.Extra ( src/System/Environment/Extra.hs, nothing )
  18949. 1110.21 s [extra] [17 of 22] Compiling System.IO.Extra ( src/System/IO/Extra.hs, nothing )
  18950. 1110.31 s [extra] [18 of 22] Compiling System.Info.Extra ( src/System/Info/Extra.hs, nothing )
  18951. 1110.31 s [extra] [19 of 22] Compiling System.Process.Extra ( src/System/Process/Extra.hs, nothing )
  18952. 1110.33 s [extra] [20 of 22] Compiling System.Time.Extra ( src/System/Time/Extra.hs, nothing )
  18953. 1110.36 s [extra] [21 of 22] Compiling Extra ( src/Extra.hs, nothing )
  18954. 1110.45 s [extra] [22 of 22] Compiling Text.Read.Extra ( src/Text/Read/Extra.hs, nothing )
  18955. 1110.45 s [extra] Haddock coverage:
  18956. 1110.46 s [extra] 100% ( 6 / 6) in 'Data.IORef.Extra'
  18957. 1110.46 s [extra] 100% ( 4 / 4) in 'Data.Monoid.Extra'
  18958. 1110.46 s [extra] Warning: 'Arrow' is out of scope.
  18959. 1110.46 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  18960. 1110.46 s [extra] 100% ( 22 / 22) in 'Data.Tuple.Extra'
  18961. 1110.46 s [extra] 100% ( 2 / 2) in 'Data.Typeable.Extra'
  18962. 1110.46 s [extra] 100% ( 7 / 7) in 'Numeric.Extra'
  18963. 1110.47 s [extra] Warning: '(:)' is out of scope.
  18964. 1110.47 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  18965. 1110.47 s [extra] Warning: 'unzip' is ambiguous. It is defined
  18966. 1110.47 s [extra] * in ‘GHC.Internal.Data.Functor’
  18967. 1110.47 s [extra] * in ‘GHC.Internal.List’
  18968. 1110.47 s [extra] You may be able to disambiguate the identifier by qualifying it or
  18969. 1110.47 s [extra] by specifying the type/value namespace explicitly.
  18970. 1110.47 s [extra] Defaulting to the one defined in ‘GHC.Internal.List’
  18971. 1110.47 s [extra] Warning: 'firstJustM' is out of scope.
  18972. 1110.47 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  18973. 1110.48 s [extra] 100% ( 85 / 85) in 'Data.List.Extra'
  18974. 1110.48 s [extra] Warning: 'Version' is ambiguous. It is defined
  18975. 1110.48 s [extra] * in ‘GHC.Internal.Data.Version’
  18976. 1110.48 s [extra] * in ‘GHC.Internal.Data.Version’
  18977. 1110.48 s [extra] You may be able to disambiguate the identifier by qualifying it or
  18978. 1110.48 s [extra] by specifying the type/value namespace explicitly.
  18979. 1110.48 s [extra] Defaulting to the one defined in ‘GHC.Internal.Data.Version’
  18980. 1110.48 s [extra] 100% ( 3 / 3) in 'Data.Version.Extra'
  18981. 1110.48 s [extra] Warning: 'length' is ambiguous. It is defined
  18982. 1110.48 s [extra] * in ‘Data.List.NonEmpty’
  18983. 1110.48 s [extra] * in ‘GHC.Internal.Data.Foldable’
  18984. 1110.48 s [extra] You may be able to disambiguate the identifier by qualifying it or
  18985. 1110.48 s [extra] by specifying the type/value namespace explicitly.
  18986. 1110.48 s [extra] Defaulting to the one defined in ‘GHC.Internal.Data.Foldable’
  18987. 1110.48 s [extra] 100% ( 23 / 23) in 'Data.List.NonEmpty.Extra'
  18988. 1110.48 s [extra] Warning: 'fromJust' is out of scope.
  18989. 1110.48 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  18990. 1110.48 s [extra] 100% ( 11 / 11) in 'Data.Either.Extra'
  18991. 1110.48 s [extra] Warning: 'ErrorCall' is ambiguous. It is defined
  18992. 1110.48 s [extra] * in ‘GHC.Internal.Exception’
  18993. 1110.48 s [extra] * in ‘GHC.Internal.Exception’
  18994. 1110.48 s [extra] You may be able to disambiguate the identifier by qualifying it or
  18995. 1110.48 s [extra] by specifying the type/value namespace explicitly.
  18996. 1110.48 s [extra] Defaulting to the one defined in ‘GHC.Internal.Exception’
  18997. 1110.48 s [extra] Warning: 'AssertionFailed' is ambiguous. It is defined
  18998. 1110.48 s [extra] * in ‘GHC.Internal.IO.Exception’
  18999. 1110.48 s [extra] * in ‘GHC.Internal.IO.Exception’
  19000. 1110.48 s [extra] You may be able to disambiguate the identifier by qualifying it or
  19001. 1110.48 s [extra] by specifying the type/value namespace explicitly.
  19002. 1110.48 s [extra] Defaulting to the one defined in ‘GHC.Internal.IO.Exception’
  19003. 1110.48 s [extra] Warning: 'SomeException' is ambiguous. It is defined
  19004. 1110.48 s [extra] * in ‘GHC.Internal.Exception.Type’
  19005. 1110.49 s [extra] * in ‘GHC.Internal.Exception.Type’
  19006. 1110.49 s [extra] You may be able to disambiguate the identifier by qualifying it or
  19007. 1110.49 s [extra] by specifying the type/value namespace explicitly.
  19008. 1110.49 s [extra] Defaulting to the one defined in ‘GHC.Internal.Exception.Type’
  19009. 1110.49 s [extra] 100% ( 21 / 21) in 'Control.Exception.Extra'
  19010. 1110.49 s [extra] Warning: 'partition' is out of scope.
  19011. 1110.49 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  19012. 1110.49 s [extra] Warning: 'mconcatMap' is out of scope.
  19013. 1110.49 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  19014. 1110.49 s [extra] Warning: 'find' is out of scope.
  19015. 1110.49 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  19016. 1110.49 s [extra] 100% ( 40 / 40) in 'Control.Monad.Extra'
  19017. 1110.49 s [extra] 92% ( 13 / 14) in 'Data.Foldable.Extra'
  19018. 1110.49 s [extra] Missing documentation for:
  19019. 1110.49 s [extra] Module header
  19020. 1110.49 s [extra] Warning: 'Lock' is ambiguous. It is defined
  19021. 1110.49 s [extra] * at src/Control/Concurrent/Extra.hs:106:16
  19022. 1110.49 s [extra] * at src/Control/Concurrent/Extra.hs:106:1
  19023. 1110.49 s [extra] You may be able to disambiguate the identifier by qualifying it or
  19024. 1110.49 s [extra] by specifying the type/value namespace explicitly.
  19025. 1110.49 s [extra] Defaulting to the one defined at src/Control/Concurrent/Extra.hs:106:1
  19026. 1110.49 s [extra] Warning: 'Var' is ambiguous. It is defined
  19027. 1110.49 s [extra] * at src/Control/Concurrent/Extra.hs:146:17
  19028. 1110.49 s [extra] * at src/Control/Concurrent/Extra.hs:146:1
  19029. 1110.49 s [extra] You may be able to disambiguate the identifier by qualifying it or
  19030. 1110.49 s [extra] by specifying the type/value namespace explicitly.
  19031. 1110.49 s [extra] Defaulting to the one defined at src/Control/Concurrent/Extra.hs:146:1
  19032. 1110.49 s [extra] Warning: 'Barrier' is ambiguous. It is defined
  19033. 1110.49 s [extra] * at src/Control/Concurrent/Extra.hs:210:21
  19034. 1110.49 s [extra] * at src/Control/Concurrent/Extra.hs:210:1
  19035. 1110.49 s [extra] You may be able to disambiguate the identifier by qualifying it or
  19036. 1110.49 s [extra] by specifying the type/value namespace explicitly.
  19037. 1110.49 s [extra] Defaulting to the one defined at src/Control/Concurrent/Extra.hs:210:1
  19038. 1110.50 s [extra] 100% ( 27 / 27) in 'Control.Concurrent.Extra'
  19039. 1110.50 s [extra] 100% ( 8 / 8) in 'System.Directory.Extra'
  19040. 1110.50 s [extra] 100% ( 2 / 2) in 'System.Environment.Extra'
  19041. 1110.50 s [extra] 100% ( 26 / 26) in 'System.IO.Extra'
  19042. 1110.50 s [extra] 100% ( 4 / 4) in 'System.Info.Extra'
  19043. 1110.50 s [extra] 100% ( 5 / 5) in 'System.Process.Extra'
  19044. 1110.50 s [extra] 100% ( 8 / 8) in 'System.Time.Extra'
  19045. 1110.51 s [extra] 100% (270 /270) in 'Extra'
  19046. 1110.51 s [extra] 100% ( 2 / 2) in 'Text.Read.Extra'
  19047. 1115.76 s [extra] Documentation created: dist/doc/html/extra/, dist/doc/html/extra/extra.txt
  19048. 1115.83 s [extra] Preprocessing test suite 'extra-test' for extra-1.8.1...
  19049. 1115.84 s [extra] Phase: installPhase
  19050. 1115.92 s [extra] Installing library in /nix/store/xgscik0zpf693pfhrgbi40sxw06843v5-extra-1.8.1/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-1e2a/extra-1.8.1-K2veo5mnkQk4ZLinPLkzz1
  19051. 1116.36 s [extra] Phase: fixupPhase
  19052. 1116.38 s [extra] shrinking RPATHs of ELF executables and libraries in /nix/store/xgscik0zpf693pfhrgbi40sxw06843v5-extra-1.8.1
  19053. 1116.40 s [extra] shrinking /nix/store/xgscik0zpf693pfhrgbi40sxw06843v5-extra-1.8.1/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-1e2a/libHSextra-1.8.1-K2veo5mnkQk4ZLinPLkzz1-ghc9.10.2.so
  19054. 1116.40 s [extra] checking for references to /build/ in /nix/store/xgscik0zpf693pfhrgbi40sxw06843v5-extra-1.8.1...
  19055. 1116.44 s [extra] patching script interpreter paths in /nix/store/xgscik0zpf693pfhrgbi40sxw06843v5-extra-1.8.1
  19056. 1116.45 s [extra] stripping (with command strip and flags -S -p) in /nix/store/xgscik0zpf693pfhrgbi40sxw06843v5-extra-1.8.1/lib
  19057. 1116.55 s [extra] shrinking RPATHs of ELF executables and libraries in /nix/store/l1nwy71yzn0dp9z6qh5i6g78myi2hal3-extra-1.8.1-doc
  19058. 1116.57 s [extra] checking for references to /build/ in /nix/store/l1nwy71yzn0dp9z6qh5i6g78myi2hal3-extra-1.8.1-doc...
  19059. 1116.61 s [extra] patching script interpreter paths in /nix/store/l1nwy71yzn0dp9z6qh5i6g78myi2hal3-extra-1.8.1-doc
  19060. 1116.74 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/l1nwy71yzn0dp9z6qh5i6g78myi2hal3-extra-1.8.1-doc /nix/store/xgscik0zpf693pfhrgbi40sxw06843v5-extra-1.8.1
  19061. 1117.28 s [post-build-hook] Pushing 2 paths (72 are already present) using zstd to cache sellout ⏳
  19062. 1117.28 s [post-build-hook]
  19063. 1117.65 s [post-build-hook] Pushing /nix/store/l1nwy71yzn0dp9z6qh5i6g78myi2hal3-extra-1.8.1-doc (3.00 MiB)
  19064. 1117.77 s [post-build-hook] Pushing /nix/store/xgscik0zpf693pfhrgbi40sxw06843v5-extra-1.8.1 (4.16 MiB)
  19065. 1118.93 s [post-build-hook]
  19066. 1118.93 s [post-build-hook] All done.
  19067. 1118.95 s [post-build-hook] Uploading to the NixCI cache: /nix/store/l1nwy71yzn0dp9z6qh5i6g78myi2hal3-extra-1.8.1-doc /nix/store/xgscik0zpf693pfhrgbi40sxw06843v5-extra-1.8.1
  19068. 1118.99 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  19069. 1119.14 s [post-build-hook] copying 2 paths...
  19070. 1119.14 s [post-build-hook] copying path '/nix/store/l1nwy71yzn0dp9z6qh5i6g78myi2hal3-extra-1.8.1-doc' to 'https://cache.nix-ci.com'...
  19071. 1119.51 s [post-build-hook] copying path '/nix/store/xgscik0zpf693pfhrgbi40sxw06843v5-extra-1.8.1' to 'https://cache.nix-ci.com'...
  19072. 1120.65 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  19073. 1120.83 s [post-build-hook] copying 1 paths...
  19074. 1120.83 s [post-build-hook] copying path '/nix/store/0lcd0xg2fv39wdv0n6afpfhp3apl9fw9-extra-1.8.1.drv' to 'https://cache.nix-ci.com'...
  19075. 1121.01 s Progress: 13 of 19 built, 177 of 177 downloaded from cache
  19076. 1121.05 s Building algebraic-graphs
  19077. 1121.14 s [algebraic-graphs] Phase: setupCompilerEnvironmentPhase
  19078. 1121.14 s [algebraic-graphs] Build with /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2.
  19079. 1121.29 s [algebraic-graphs] Phase: unpackPhase
  19080. 1121.33 s [algebraic-graphs] unpacking source archive /nix/store/gfjyfw1hcshbfclk91difmkphwib8nbd-algebraic-graphs-0.7.tar.gz
  19081. 1121.34 s [algebraic-graphs] source root is algebraic-graphs-0.7
  19082. 1121.35 s [algebraic-graphs] setting SOURCE_DATE_EPOCH to timestamp 1655769405 of file "algebraic-graphs-0.7/test/Data/Graph/Test/Typed.hs"
  19083. 1121.36 s [algebraic-graphs] Phase: patchPhase
  19084. 1121.43 s [algebraic-graphs] Replace Cabal file with edited version from mirror://hackage/algebraic-graphs-0.7/revision/3.cabal.
  19085. 1121.47 s [algebraic-graphs] applying patch /nix/store/fgaciccwb2z0jmfhs30a1vq03azpd9qd-algebraic-graphs-0.7-allow-inspection-testing-0.6.patch
  19086. 1121.47 s [algebraic-graphs] patching file algebraic-graphs.cabal
  19087. 1121.53 s [algebraic-graphs] Phase: compileBuildDriverPhase
  19088. 1121.53 s [algebraic-graphs] setupCompileFlags: -package-db=/build/tmp.LUURlGdh8W/setup-package.conf.d -threaded
  19089. 1121.59 s [algebraic-graphs] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.LUURlGdh8W/Main.o )
  19090. 1121.64 s [algebraic-graphs] [2 of 2] Linking Setup
  19091. 1122.87 s [algebraic-graphs] Phase: updateAutotoolsGnuConfigScriptsPhase
  19092. 1122.89 s [algebraic-graphs] Phase: configurePhase
  19093. 1122.89 s [algebraic-graphs] configureFlags: --verbose --prefix=/nix/store/33397k8r2slg23iwf0mavzm15i8nyq8d-algebraic-graphs-0.7 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/3hppjidlangc5pmwksgr1379w9pj2g8b-algebraic-graphs-0.7-doc/share/doc/algebraic-graphs-0.7 --with-gcc=gcc --package-db=/build/tmp.LUURlGdh8W/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/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/lib
  19094. 1122.90 s [algebraic-graphs] Using Parsec parser
  19095. 1122.90 s [algebraic-graphs] Configuring algebraic-graphs-0.7...
  19096. 1123.45 s [algebraic-graphs] Dependency array >=0.4 && <0.6: using array-0.5.8.0
  19097. 1123.45 s [algebraic-graphs] Dependency base >=4.11 && <5: using base-4.20.1.0
  19098. 1123.45 s [algebraic-graphs] Dependency containers >=0.5.5.1 && <0.8: using containers-0.7
  19099. 1123.45 s [algebraic-graphs] Dependency deepseq >=1.3.0.1 && <1.6: using deepseq-1.5.0.0
  19100. 1123.45 s [algebraic-graphs] Dependency transformers >=0.4 && <0.7: using transformers-0.6.1.1
  19101. 1123.45 s [algebraic-graphs] Dependency QuickCheck >=2.14 && <2.16: using QuickCheck-2.15.0.1
  19102. 1123.45 s [algebraic-graphs] Dependency algebraic-graphs: using algebraic-graphs-0.7
  19103. 1123.45 s [algebraic-graphs] Dependency array >=0.4 && <0.6: using array-0.5.8.0
  19104. 1123.45 s [algebraic-graphs] Dependency base >=4.11 && <5: using base-4.20.1.0
  19105. 1123.45 s [algebraic-graphs] Dependency containers >=0.5.5.1 && <0.8: using containers-0.7
  19106. 1123.45 s [algebraic-graphs] Dependency deepseq >=1.3.0.1 && <1.6: using deepseq-1.5.0.0
  19107. 1123.45 s [algebraic-graphs] Dependency extra >=1.4 && <2: using extra-1.8.1
  19108. 1123.45 s [algebraic-graphs] Dependency inspection-testing >=0.4.2.2 && <0.7: using
  19109. 1123.45 s [algebraic-graphs] inspection-testing-0.6.2
  19110. 1123.45 s [algebraic-graphs] Dependency transformers >=0.4 && <0.7: using transformers-0.6.1.1
  19111. 1123.45 s [algebraic-graphs] Source component graph:
  19112. 1123.45 s [algebraic-graphs] component lib
  19113. 1123.45 s [algebraic-graphs] component test:main dependency lib
  19114. 1123.45 s [algebraic-graphs] Configured component graph:
  19115. 1123.45 s [algebraic-graphs] component algebraic-graphs-0.7-1EcQHPe1dklCgCezd3ndnl
  19116. 1123.45 s [algebraic-graphs] include array-0.5.8.0-e5b8
  19117. 1123.45 s [algebraic-graphs] include base-4.20.1.0-2277
  19118. 1123.45 s [algebraic-graphs] include containers-0.7-dff9
  19119. 1123.45 s [algebraic-graphs] include deepseq-1.5.0.0-f20c
  19120. 1123.45 s [algebraic-graphs] include transformers-0.6.1.1-407f
  19121. 1123.45 s [algebraic-graphs] component algebraic-graphs-0.7-Kwl7bwxqppAL6S0tNNf5FD-main
  19122. 1123.45 s [algebraic-graphs] include QuickCheck-2.15.0.1-stTt2BXNne46QxWHi9NgG
  19123. 1123.45 s [algebraic-graphs] include algebraic-graphs-0.7-1EcQHPe1dklCgCezd3ndnl
  19124. 1123.45 s [algebraic-graphs] include array-0.5.8.0-e5b8
  19125. 1123.45 s [algebraic-graphs] include base-4.20.1.0-2277
  19126. 1123.45 s [algebraic-graphs] include containers-0.7-dff9
  19127. 1123.45 s [algebraic-graphs] include deepseq-1.5.0.0-f20c
  19128. 1123.45 s [algebraic-graphs] include extra-1.8.1-K2veo5mnkQk4ZLinPLkzz1
  19129. 1123.45 s [algebraic-graphs] include inspection-testing-0.6.2-IHGCrqDPgxl3pjj7L9ulrX
  19130. 1123.45 s [algebraic-graphs] include transformers-0.6.1.1-407f
  19131. 1123.45 s [algebraic-graphs] Linked component graph:
  19132. 1123.45 s [algebraic-graphs] unit algebraic-graphs-0.7-1EcQHPe1dklCgCezd3ndnl
  19133. 1123.45 s [algebraic-graphs] include array-0.5.8.0-e5b8
  19134. 1123.45 s [algebraic-graphs] include base-4.20.1.0-2277
  19135. 1123.45 s [algebraic-graphs] include containers-0.7-dff9
  19136. 1123.45 s [algebraic-graphs] include deepseq-1.5.0.0-f20c
  19137. 1123.45 s [algebraic-graphs] include transformers-0.6.1.1-407f
  19138. 1123.45 s [algebraic-graphs] Algebra.Graph=algebraic-graphs-0.7-1EcQHPe1dklCgCezd3ndnl:Algebra.Graph,Algebra.Graph.Acyclic.AdjacencyMap=algebraic-graphs-0.7-1EcQHPe1dklCgCezd3ndnl:Algebra.Graph.Acyclic.AdjacencyMap,Algebra.Graph.AdjacencyIntMap=algebraic-graphs-0.7-1EcQHPe1dklCgCezd3ndnl:Algebra.Graph.AdjacencyIntMap,Algebra.Graph.AdjacencyIntMap.Algorithm=algebraic-graphs-0.7-1EcQHPe1dklCgCezd3ndnl:Algebra.Graph.AdjacencyIntMap.Algorithm,Algebra.Graph.AdjacencyMap=algebraic-graphs-0.7-1EcQHPe1dklCgCezd3ndnl:Algebra.Graph.AdjacencyMap,Algebra.Graph.AdjacencyMap.Algorithm=algebraic-graphs-0.7-1EcQHPe1dklCgCezd3ndnl:Algebra.Graph.AdjacencyMap.Algorithm,Algebra.Graph.Bipartite.AdjacencyMap=algebraic-graphs-0.7-1EcQHPe1dklCgCezd3ndnl:Algebra.Graph.Bipartite.AdjacencyMap,Algebra.Graph.Bipartite.AdjacencyMap.Algorithm=algebraic-graphs-0.7-1EcQHPe1dklCgCezd3ndnl:Algebra.Graph.Bipartite.AdjacencyMap.Algorithm,Algebra.Graph.Class=algebraic-graphs-0.7-1EcQHPe1dklCgCezd3ndnl:Algebra.Graph.Class,Algebra.Graph.Example.Todo=algebraic-graphs-0.7-1EcQHPe1dklCgCezd3ndnl:Algebra.Graph.Example.Todo,Algebra.Graph.Export=algebraic-graphs-0.7-1EcQHPe1dklCgCezd3ndnl:Algebra.Graph.Export,Algebra.Graph.Export.Dot=algebraic-graphs-0.7-1EcQHPe1dklCgCezd3ndnl:Algebra.Graph.Export.Dot,Algebra.Graph.HigherKinded.Class=algebraic-graphs-0.7-1EcQHPe1dklCgCezd3ndnl:Algebra.Graph.HigherKinded.Class,Algebra.Graph.Internal=algebraic-graphs-0.7-1EcQHPe1dklCgCezd3ndnl:Algebra.Graph.Internal,Algebra.Graph.Label=algebraic-graphs-0.7-1EcQHPe1dklCgCezd3ndnl:Algebra.Graph.Label,Algebra.Graph.Labelled=algebraic-graphs-0.7-1EcQHPe1dklCgCezd3ndnl:Algebra.Graph.Labelled,Algebra.Graph.Labelled.AdjacencyMap=algebraic-graphs-0.7-1EcQHPe1dklCgCezd3ndnl:Algebra.Graph.Labelled.AdjacencyMap,Algebra.Graph.Labelled.Example.Automaton=algebraic-graphs-0.7-1EcQHPe1dklCgCezd3ndnl:Algebra.Graph.Labelled.Example.Automaton,Algebra.Graph.Labelled.Example.Network=algebraic-graphs-0.7-1EcQHPe1dklCgCezd3ndnl:Algebra.Graph.Labelled.Example.Network,Algebra.Graph.NonEmpty=algebraic-graphs-0.7-1EcQHPe1dklCgCezd3ndnl:Algebra.Graph.NonEmpty,Algebra.Graph.NonEmpty.AdjacencyMap=algebraic-graphs-0.7-1EcQHPe1dklCgCezd3ndnl:Algebra.Graph.NonEmpty.AdjacencyMap,Algebra.Graph.Relation=algebraic-graphs-0.7-1EcQHPe1dklCgCezd3ndnl:Algebra.Graph.Relation,Algebra.Graph.Relation.Preorder=algebraic-graphs-0.7-1EcQHPe1dklCgCezd3ndnl:Algebra.Graph.Relation.Preorder,Algebra.Graph.Relation.Reflexive=algebraic-graphs-0.7-1EcQHPe1dklCgCezd3ndnl:Algebra.Graph.Relation.Reflexive,Algebra.Graph.Relation.Symmetric=algebraic-graphs-0.7-1EcQHPe1dklCgCezd3ndnl:Algebra.Graph.Relation.Symmetric,Algebra.Graph.Relation.Transitive=algebraic-graphs-0.7-1EcQHPe1dklCgCezd3ndnl:Algebra.Graph.Relation.Transitive,Algebra.Graph.ToGraph=algebraic-graphs-0.7-1EcQHPe1dklCgCezd3ndnl:Algebra.Graph.ToGraph,Algebra.Graph.Undirected=algebraic-graphs-0.7-1EcQHPe1dklCgCezd3ndnl:Algebra.Graph.Undirected,Data.Graph.Typed=algebraic-graphs-0.7-1EcQHPe1dklCgCezd3ndnl:Data.Graph.Typed
  19139. 1123.45 s [algebraic-graphs] unit algebraic-graphs-0.7-Kwl7bwxqppAL6S0tNNf5FD-main
  19140. 1123.45 s [algebraic-graphs] include QuickCheck-2.15.0.1-stTt2BXNne46QxWHi9NgG
  19141. 1123.45 s [algebraic-graphs] include algebraic-graphs-0.7-1EcQHPe1dklCgCezd3ndnl
  19142. 1123.45 s [algebraic-graphs] include array-0.5.8.0-e5b8
  19143. 1123.45 s [algebraic-graphs] include base-4.20.1.0-2277
  19144. 1123.45 s [algebraic-graphs] include containers-0.7-dff9
  19145. 1123.45 s [algebraic-graphs] include deepseq-1.5.0.0-f20c
  19146. 1123.45 s [algebraic-graphs] include extra-1.8.1-K2veo5mnkQk4ZLinPLkzz1
  19147. 1123.45 s [algebraic-graphs] include inspection-testing-0.6.2-IHGCrqDPgxl3pjj7L9ulrX
  19148. 1123.45 s [algebraic-graphs] include transformers-0.6.1.1-407f
  19149. 1123.45 s [algebraic-graphs] Ready component graph:
  19150. 1123.45 s [algebraic-graphs] definite algebraic-graphs-0.7-1EcQHPe1dklCgCezd3ndnl
  19151. 1123.45 s [algebraic-graphs] depends array-0.5.8.0-e5b8
  19152. 1123.45 s [algebraic-graphs] depends base-4.20.1.0-2277
  19153. 1123.45 s [algebraic-graphs] depends containers-0.7-dff9
  19154. 1123.45 s [algebraic-graphs] depends deepseq-1.5.0.0-f20c
  19155. 1123.45 s [algebraic-graphs] depends transformers-0.6.1.1-407f
  19156. 1123.45 s [algebraic-graphs] definite algebraic-graphs-0.7-Kwl7bwxqppAL6S0tNNf5FD-main
  19157. 1123.45 s [algebraic-graphs] depends QuickCheck-2.15.0.1-stTt2BXNne46QxWHi9NgG
  19158. 1123.45 s [algebraic-graphs] depends algebraic-graphs-0.7-1EcQHPe1dklCgCezd3ndnl
  19159. 1123.45 s [algebraic-graphs] depends array-0.5.8.0-e5b8
  19160. 1123.45 s [algebraic-graphs] depends base-4.20.1.0-2277
  19161. 1123.45 s [algebraic-graphs] depends containers-0.7-dff9
  19162. 1123.45 s [algebraic-graphs] depends deepseq-1.5.0.0-f20c
  19163. 1123.45 s [algebraic-graphs] depends extra-1.8.1-K2veo5mnkQk4ZLinPLkzz1
  19164. 1123.45 s [algebraic-graphs] depends inspection-testing-0.6.2-IHGCrqDPgxl3pjj7L9ulrX
  19165. 1123.45 s [algebraic-graphs] depends transformers-0.6.1.1-407f
  19166. 1123.45 s [algebraic-graphs] Using Cabal-3.12.1.0 compiled by ghc-9.10
  19167. 1123.45 s [algebraic-graphs] Using compiler: ghc-9.10.2
  19168. 1123.45 s [algebraic-graphs] Using install prefix:
  19169. 1123.45 s [algebraic-graphs] /nix/store/33397k8r2slg23iwf0mavzm15i8nyq8d-algebraic-graphs-0.7
  19170. 1123.45 s [algebraic-graphs] Executables installed in:
  19171. 1123.45 s [algebraic-graphs] /nix/store/33397k8r2slg23iwf0mavzm15i8nyq8d-algebraic-graphs-0.7/bin
  19172. 1123.45 s [algebraic-graphs] Libraries installed in:
  19173. 1123.45 s [algebraic-graphs] /nix/store/33397k8r2slg23iwf0mavzm15i8nyq8d-algebraic-graphs-0.7/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-1e2a/algebraic-graphs-0.7-1EcQHPe1dklCgCezd3ndnl
  19174. 1123.45 s [algebraic-graphs] Dynamic Libraries installed in:
  19175. 1123.45 s [algebraic-graphs] /nix/store/33397k8r2slg23iwf0mavzm15i8nyq8d-algebraic-graphs-0.7/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-1e2a
  19176. 1123.45 s [algebraic-graphs] Private executables installed in:
  19177. 1123.45 s [algebraic-graphs] /nix/store/33397k8r2slg23iwf0mavzm15i8nyq8d-algebraic-graphs-0.7/libexec/x86_64-linux-ghc-9.10.2-1e2a/algebraic-graphs-0.7
  19178. 1123.45 s [algebraic-graphs] Data files installed in:
  19179. 1123.45 s [algebraic-graphs] /nix/store/33397k8r2slg23iwf0mavzm15i8nyq8d-algebraic-graphs-0.7/share/x86_64-linux-ghc-9.10.2-1e2a/algebraic-graphs-0.7
  19180. 1123.45 s [algebraic-graphs] Documentation installed in:
  19181. 1123.45 s [algebraic-graphs] /nix/store/3hppjidlangc5pmwksgr1379w9pj2g8b-algebraic-graphs-0.7-doc/share/doc/algebraic-graphs-0.7
  19182. 1123.45 s [algebraic-graphs] Configuration files installed in:
  19183. 1123.45 s [algebraic-graphs] /nix/store/33397k8r2slg23iwf0mavzm15i8nyq8d-algebraic-graphs-0.7/etc
  19184. 1123.45 s [algebraic-graphs] No alex found
  19185. 1123.45 s [algebraic-graphs] Using ar found on system at:
  19186. 1123.45 s [algebraic-graphs] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
  19187. 1123.45 s [algebraic-graphs] No c2hs found
  19188. 1123.45 s [algebraic-graphs] No cpphs found
  19189. 1123.45 s [algebraic-graphs] No doctest found
  19190. 1123.45 s [algebraic-graphs] Using gcc version 14.3.0 given by user at:
  19191. 1123.45 s [algebraic-graphs] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
  19192. 1123.45 s [algebraic-graphs] Using ghc version 9.10.2 found on system at:
  19193. 1123.45 s [algebraic-graphs] /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/bin/ghc
  19194. 1123.45 s [algebraic-graphs] Using ghc-pkg version 9.10.2 found on system at:
  19195. 1123.45 s [algebraic-graphs] /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/bin/ghc-pkg-9.10.2
  19196. 1123.45 s [algebraic-graphs] No ghcjs found
  19197. 1123.45 s [algebraic-graphs] No ghcjs-pkg found
  19198. 1123.45 s [algebraic-graphs] No greencard found
  19199. 1123.45 s [algebraic-graphs] Using haddock version 2.31.0 found on system at:
  19200. 1123.45 s [algebraic-graphs] /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/bin/haddock-ghc-9.10.2
  19201. 1123.45 s [algebraic-graphs] No happy found
  19202. 1123.45 s [algebraic-graphs] Using haskell-suite found on system at: haskell-suite-dummy-location
  19203. 1123.45 s [algebraic-graphs] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  19204. 1123.45 s [algebraic-graphs] No hmake found
  19205. 1123.45 s [algebraic-graphs] Using hpc version 0.69 found on system at:
  19206. 1123.46 s [algebraic-graphs] /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/bin/hpc-ghc-9.10.2
  19207. 1123.46 s [algebraic-graphs] Using hsc2hs version 0.68.10 found on system at:
  19208. 1123.46 s [algebraic-graphs] /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/bin/hsc2hs-ghc-9.10.2
  19209. 1123.46 s [algebraic-graphs] Using hscolour version 1.25 found on system at:
  19210. 1123.46 s [algebraic-graphs] /nix/store/kb4afndnwdxxc5ps9k8xv0jzd0a9y8n5-hscolour-1.25/bin/HsColour
  19211. 1123.46 s [algebraic-graphs] No jhc found
  19212. 1123.46 s [algebraic-graphs] Using ld found on system at:
  19213. 1123.46 s [algebraic-graphs] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/ld
  19214. 1123.46 s [algebraic-graphs] No pkg-config found
  19215. 1123.46 s [algebraic-graphs] Using runghc version 9.10.2 found on system at:
  19216. 1123.46 s [algebraic-graphs] /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/bin/runghc-9.10.2
  19217. 1123.46 s [algebraic-graphs] Using strip version 2.44 found on system at:
  19218. 1123.46 s [algebraic-graphs] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
  19219. 1123.46 s [algebraic-graphs] Using tar found on system at:
  19220. 1123.46 s [algebraic-graphs] /nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
  19221. 1123.46 s [algebraic-graphs] No uhc found
  19222. 1123.60 s [algebraic-graphs] Phase: buildPhase
  19223. 1123.65 s [algebraic-graphs] Preprocessing library for algebraic-graphs-0.7...
  19224. 1123.65 s [algebraic-graphs] Building library for algebraic-graphs-0.7...
  19225. 1123.76 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 )
  19226. 1124.86 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 )
  19227. 1125.55 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 )
  19228. 1126.28 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 )
  19229. 1126.30 s [algebraic-graphs] [ 5 of 29] Compiling Algebra.Graph ( src/Algebra/Graph.hs, dist/build/Algebra/Graph.o, dist/build/Algebra/Graph.dyn_o )
  19230. 1127.51 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 )
  19231. 1127.92 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 )
  19232. 1128.68 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 )
  19233. 1129.89 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 )
  19234. 1129.89 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 )
  19235. 1129.89 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 )
  19236. 1129.89 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:384:43: warning: [GHC-63394] [-Wx-partial]
  19237. 1129.89 s [algebraic-graphs] In the use of ‘head’
  19238. 1129.89 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  19239. 1129.89 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  19240. 1129.89 s [algebraic-graphs] |
  19241. 1129.89 s [algebraic-graphs] 384 | exit v = do newComponent <- (v==).snd.head <$> gets boundaryStack
  19242. 1129.89 s [algebraic-graphs] | ^^^^
  19243. 1129.89 s [algebraic-graphs]
  19244. 1129.89 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:391:21: warning: [GHC-63394] [-Wx-partial]
  19245. 1129.89 s [algebraic-graphs] In the use of ‘tail’
  19246. 1129.89 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  19247. 1129.89 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  19248. 1129.89 s [algebraic-graphs] |
  19249. 1129.89 s [algebraic-graphs] 391 | pth' = tail v_pth' -- Here we know that v_pth' starts with v
  19250. 1129.89 s [algebraic-graphs] | ^^^^
  19251. 1129.89 s [algebraic-graphs]
  19252. 1129.89 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:395:26: warning: [GHC-63394] [-Wx-partial]
  19253. 1129.89 s [algebraic-graphs] In the use of ‘head’
  19254. 1129.89 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  19255. 1129.89 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  19256. 1129.89 s [algebraic-graphs] |
  19257. 1129.89 s [algebraic-graphs] 395 | p_v = fst $ head bnd
  19258. 1129.89 s [algebraic-graphs] | ^^^^
  19259. 1129.89 s [algebraic-graphs]
  19260. 1129.89 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:397:21: warning: [GHC-63394] [-Wx-partial]
  19261. 1129.89 s [algebraic-graphs] In the use of ‘tail’
  19262. 1129.89 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  19263. 1129.89 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  19264. 1129.89 s [algebraic-graphs] |
  19265. 1129.89 s [algebraic-graphs] 397 | bnd' = tail bnd
  19266. 1129.89 s [algebraic-graphs] | ^^^^
  19267. 1129.89 s [algebraic-graphs]
  19268. 1129.89 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 )
  19269. 1129.89 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 )
  19270. 1129.89 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:171:32: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19271. 1129.89 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19272. 1129.89 s [algebraic-graphs] will become an error in a future GHC release.
  19273. 1129.89 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19274. 1129.89 s [algebraic-graphs] |
  19275. 1129.89 s [algebraic-graphs] 171 | vertexIntSet :: ToVertex t ~ Int => t -> IntSet
  19276. 1129.90 s [algebraic-graphs] | ^
  19277. 1129.90 s [algebraic-graphs]
  19278. 1129.90 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:197:29: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19279. 1129.90 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19280. 1129.90 s [algebraic-graphs] will become an error in a future GHC release.
  19281. 1129.90 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19282. 1129.90 s [algebraic-graphs] |
  19283. 1129.90 s [algebraic-graphs] 197 | preIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  19284. 1129.90 s [algebraic-graphs] | ^
  19285. 1129.90 s [algebraic-graphs]
  19286. 1129.90 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:215:30: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19287. 1129.90 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19288. 1129.90 s [algebraic-graphs] will become an error in a future GHC release.
  19289. 1129.90 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19290. 1129.90 s [algebraic-graphs] |
  19291. 1129.90 s [algebraic-graphs] 215 | postIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  19292. 1129.90 s [algebraic-graphs] | ^
  19293. 1129.90 s [algebraic-graphs]
  19294. 1129.90 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:303:37: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19295. 1129.90 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19296. 1129.90 s [algebraic-graphs] will become an error in a future GHC release.
  19297. 1129.90 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19298. 1129.90 s [algebraic-graphs] |
  19299. 1129.90 s [algebraic-graphs] 303 | toAdjacencyIntMap :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  19300. 1129.90 s [algebraic-graphs] | ^
  19301. 1129.90 s [algebraic-graphs]
  19302. 1129.90 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:312:46: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19303. 1129.90 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19304. 1129.90 s [algebraic-graphs] will become an error in a future GHC release.
  19305. 1129.90 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19306. 1129.90 s [algebraic-graphs] |
  19307. 1129.90 s [algebraic-graphs] 312 | toAdjacencyIntMapTranspose :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  19308. 1129.90 s [algebraic-graphs] | ^
  19309. 1129.90 s [algebraic-graphs]
  19310. 1129.90 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:452:43: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19311. 1129.90 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19312. 1129.90 s [algebraic-graphs] will become an error in a future GHC release.
  19313. 1129.90 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19314. 1129.90 s [algebraic-graphs] |
  19315. 1129.90 s [algebraic-graphs] 452 | adjacencyIntMap :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  19316. 1129.90 s [algebraic-graphs] | ^
  19317. 1129.90 s [algebraic-graphs]
  19318. 1129.90 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:471:52: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19319. 1129.90 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19320. 1129.90 s [algebraic-graphs] will become an error in a future GHC release.
  19321. 1129.90 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19322. 1129.90 s [algebraic-graphs] |
  19323. 1129.90 s [algebraic-graphs] 471 | adjacencyIntMapTranspose :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  19324. 1129.90 s [algebraic-graphs] | ^
  19325. 1129.90 s [algebraic-graphs]
  19326. 1129.90 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 )
  19327. 1130.04 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 )
  19328. 1130.63 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 )
  19329. 1130.63 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 )
  19330. 1130.63 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 )
  19331. 1131.41 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 )
  19332. 1131.63 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 )
  19333. 1132.00 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 )
  19334. 1132.00 s [algebraic-graphs] src/Algebra/Graph/Export.hs:185:41: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19335. 1132.00 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19336. 1132.00 s [algebraic-graphs] will become an error in a future GHC release.
  19337. 1132.00 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19338. 1132.00 s [algebraic-graphs] |
  19339. 1132.00 s [algebraic-graphs] 185 | export :: (Ord a, ToGraph g, ToVertex g ~ a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
  19340. 1132.00 s [algebraic-graphs] | ^
  19341. 1132.00 s [algebraic-graphs]
  19342. 1132.00 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 )
  19343. 1132.00 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:121:63: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19344. 1132.00 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19345. 1132.00 s [algebraic-graphs] will become an error in a future GHC release.
  19346. 1132.00 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19347. 1132.01 s [algebraic-graphs] |
  19348. 1132.01 s [algebraic-graphs] 121 | export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g ~ a) => Style a s -> g -> s
  19349. 1132.01 s [algebraic-graphs] | ^
  19350. 1132.01 s [algebraic-graphs]
  19351. 1132.01 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:165:78: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19352. 1132.01 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19353. 1132.01 s [algebraic-graphs] will become an error in a future GHC release.
  19354. 1132.01 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19355. 1132.01 s [algebraic-graphs] |
  19356. 1132.01 s [algebraic-graphs] 165 | exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g ~ s) => g -> s
  19357. 1132.01 s [algebraic-graphs] | ^
  19358. 1132.01 s [algebraic-graphs]
  19359. 1132.01 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 )
  19360. 1132.01 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 )
  19361. 1132.01 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 )
  19362. 1132.01 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 )
  19363. 1132.01 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 )
  19364. 1132.01 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 )
  19365. 1132.03 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 )
  19366. 1132.37 s [algebraic-graphs] [ 1 of 29] Compiling Algebra.Graph.AdjacencyMap ( src/Algebra/Graph/AdjacencyMap.hs, dist/build/Algebra/Graph/AdjacencyMap.p_o )
  19367. 1133.56 s [algebraic-graphs] [ 2 of 29] Compiling Algebra.Graph.AdjacencyIntMap ( src/Algebra/Graph/AdjacencyIntMap.hs, dist/build/Algebra/Graph/AdjacencyIntMap.p_o )
  19368. 1134.28 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 )
  19369. 1134.72 s [algebraic-graphs] [ 4 of 29] Compiling Algebra.Graph.Internal ( src/Algebra/Graph/Internal.hs, dist/build/Algebra/Graph/Internal.p_o )
  19370. 1134.72 s [algebraic-graphs] [ 5 of 29] Compiling Algebra.Graph ( src/Algebra/Graph.hs, dist/build/Algebra/Graph.p_o )
  19371. 1136.08 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 )
  19372. 1136.47 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 )
  19373. 1137.13 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 )
  19374. 1138.14 s [algebraic-graphs] [ 9 of 29] Compiling Algebra.Graph.Label ( src/Algebra/Graph/Label.hs, dist/build/Algebra/Graph/Label.p_o )
  19375. 1138.14 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 )
  19376. 1138.14 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 )
  19377. 1138.14 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:384:43: warning: [GHC-63394] [-Wx-partial]
  19378. 1138.14 s [algebraic-graphs] In the use of ‘head’
  19379. 1138.14 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  19380. 1138.14 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  19381. 1138.14 s [algebraic-graphs] |
  19382. 1138.14 s [algebraic-graphs] 384 | exit v = do newComponent <- (v==).snd.head <$> gets boundaryStack
  19383. 1138.14 s [algebraic-graphs] | ^^^^
  19384. 1138.14 s [algebraic-graphs]
  19385. 1138.14 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:391:21: warning: [GHC-63394] [-Wx-partial]
  19386. 1138.14 s [algebraic-graphs] In the use of ‘tail’
  19387. 1138.14 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  19388. 1138.14 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  19389. 1138.14 s [algebraic-graphs] |
  19390. 1138.14 s [algebraic-graphs] 391 | pth' = tail v_pth' -- Here we know that v_pth' starts with v
  19391. 1138.14 s [algebraic-graphs] | ^^^^
  19392. 1138.14 s [algebraic-graphs]
  19393. 1138.14 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:395:26: warning: [GHC-63394] [-Wx-partial]
  19394. 1138.14 s [algebraic-graphs] In the use of ‘head’
  19395. 1138.14 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  19396. 1138.14 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  19397. 1138.14 s [algebraic-graphs] |
  19398. 1138.14 s [algebraic-graphs] 395 | p_v = fst $ head bnd
  19399. 1138.14 s [algebraic-graphs] | ^^^^
  19400. 1138.14 s [algebraic-graphs]
  19401. 1138.14 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:397:21: warning: [GHC-63394] [-Wx-partial]
  19402. 1138.14 s [algebraic-graphs] In the use of ‘tail’
  19403. 1138.14 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  19404. 1138.14 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  19405. 1138.14 s [algebraic-graphs] |
  19406. 1138.14 s [algebraic-graphs] 397 | bnd' = tail bnd
  19407. 1138.14 s [algebraic-graphs] | ^^^^
  19408. 1138.14 s [algebraic-graphs]
  19409. 1138.14 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 )
  19410. 1138.14 s [algebraic-graphs] [13 of 29] Compiling Algebra.Graph.ToGraph ( src/Algebra/Graph/ToGraph.hs, dist/build/Algebra/Graph/ToGraph.p_o )
  19411. 1138.14 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:171:32: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19412. 1138.14 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19413. 1138.14 s [algebraic-graphs] will become an error in a future GHC release.
  19414. 1138.14 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19415. 1138.14 s [algebraic-graphs] |
  19416. 1138.14 s [algebraic-graphs] 171 | vertexIntSet :: ToVertex t ~ Int => t -> IntSet
  19417. 1138.14 s [algebraic-graphs] | ^
  19418. 1138.14 s [algebraic-graphs]
  19419. 1138.14 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:197:29: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19420. 1138.14 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19421. 1138.14 s [algebraic-graphs] will become an error in a future GHC release.
  19422. 1138.14 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19423. 1138.14 s [algebraic-graphs] |
  19424. 1138.14 s [algebraic-graphs] 197 | preIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  19425. 1138.14 s [algebraic-graphs] | ^
  19426. 1138.14 s [algebraic-graphs]
  19427. 1138.14 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:215:30: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19428. 1138.14 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19429. 1138.14 s [algebraic-graphs] will become an error in a future GHC release.
  19430. 1138.14 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19431. 1138.14 s [algebraic-graphs] |
  19432. 1138.14 s [algebraic-graphs] 215 | postIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  19433. 1138.14 s [algebraic-graphs] | ^
  19434. 1138.14 s [algebraic-graphs]
  19435. 1138.14 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:303:37: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19436. 1138.14 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19437. 1138.14 s [algebraic-graphs] will become an error in a future GHC release.
  19438. 1138.14 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19439. 1138.14 s [algebraic-graphs] |
  19440. 1138.14 s [algebraic-graphs] 303 | toAdjacencyIntMap :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  19441. 1138.14 s [algebraic-graphs] | ^
  19442. 1138.14 s [algebraic-graphs]
  19443. 1138.14 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:312:46: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19444. 1138.14 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19445. 1138.14 s [algebraic-graphs] will become an error in a future GHC release.
  19446. 1138.14 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19447. 1138.14 s [algebraic-graphs] |
  19448. 1138.14 s [algebraic-graphs] 312 | toAdjacencyIntMapTranspose :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  19449. 1138.14 s [algebraic-graphs] | ^
  19450. 1138.14 s [algebraic-graphs]
  19451. 1138.14 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:452:43: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19452. 1138.14 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19453. 1138.14 s [algebraic-graphs] will become an error in a future GHC release.
  19454. 1138.14 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19455. 1138.14 s [algebraic-graphs] |
  19456. 1138.14 s [algebraic-graphs] 452 | adjacencyIntMap :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  19457. 1138.14 s [algebraic-graphs] | ^
  19458. 1138.14 s [algebraic-graphs]
  19459. 1138.14 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:471:52: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19460. 1138.15 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19461. 1138.15 s [algebraic-graphs] will become an error in a future GHC release.
  19462. 1138.15 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19463. 1138.15 s [algebraic-graphs] |
  19464. 1138.15 s [algebraic-graphs] 471 | adjacencyIntMapTranspose :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  19465. 1138.15 s [algebraic-graphs] | ^
  19466. 1138.15 s [algebraic-graphs]
  19467. 1138.15 s [algebraic-graphs] [14 of 29] Compiling Algebra.Graph.Relation ( src/Algebra/Graph/Relation.hs, dist/build/Algebra/Graph/Relation.p_o )
  19468. 1138.15 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 )
  19469. 1138.87 s [algebraic-graphs] [16 of 29] Compiling Algebra.Graph.NonEmpty ( src/Algebra/Graph/NonEmpty.hs, dist/build/Algebra/Graph/NonEmpty.p_o )
  19470. 1138.87 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 )
  19471. 1138.87 s [algebraic-graphs] [18 of 29] Compiling Algebra.Graph.Labelled ( src/Algebra/Graph/Labelled.hs, dist/build/Algebra/Graph/Labelled.p_o )
  19472. 1139.41 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 )
  19473. 1139.69 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 )
  19474. 1139.89 s [algebraic-graphs] [21 of 29] Compiling Algebra.Graph.Export ( src/Algebra/Graph/Export.hs, dist/build/Algebra/Graph/Export.p_o )
  19475. 1139.89 s [algebraic-graphs] src/Algebra/Graph/Export.hs:185:41: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19476. 1139.89 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19477. 1139.89 s [algebraic-graphs] will become an error in a future GHC release.
  19478. 1139.89 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19479. 1139.89 s [algebraic-graphs] |
  19480. 1139.89 s [algebraic-graphs] 185 | export :: (Ord a, ToGraph g, ToVertex g ~ a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
  19481. 1139.89 s [algebraic-graphs] | ^
  19482. 1139.89 s [algebraic-graphs]
  19483. 1139.89 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 )
  19484. 1139.89 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:121:63: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19485. 1139.89 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19486. 1139.89 s [algebraic-graphs] will become an error in a future GHC release.
  19487. 1139.89 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19488. 1139.89 s [algebraic-graphs] |
  19489. 1139.89 s [algebraic-graphs] 121 | export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g ~ a) => Style a s -> g -> s
  19490. 1139.89 s [algebraic-graphs] | ^
  19491. 1139.89 s [algebraic-graphs]
  19492. 1139.89 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:165:78: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19493. 1139.89 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19494. 1139.89 s [algebraic-graphs] will become an error in a future GHC release.
  19495. 1139.89 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19496. 1139.89 s [algebraic-graphs] |
  19497. 1139.89 s [algebraic-graphs] 165 | exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g ~ s) => g -> s
  19498. 1139.89 s [algebraic-graphs] | ^
  19499. 1139.89 s [algebraic-graphs]
  19500. 1139.89 s [algebraic-graphs] [23 of 29] Compiling Algebra.Graph.Undirected ( src/Algebra/Graph/Undirected.hs, dist/build/Algebra/Graph/Undirected.p_o )
  19501. 1139.89 s [algebraic-graphs] [24 of 29] Compiling Algebra.Graph.Class ( src/Algebra/Graph/Class.hs, dist/build/Algebra/Graph/Class.p_o )
  19502. 1139.89 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 )
  19503. 1139.98 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 )
  19504. 1139.98 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 )
  19505. 1139.98 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 )
  19506. 1140.04 s [algebraic-graphs] [29 of 29] Compiling Data.Graph.Typed ( src/Data/Graph/Typed.hs, dist/build/Data/Graph/Typed.p_o )
  19507. 1141.90 s [algebraic-graphs] Preprocessing test suite 'main' for algebraic-graphs-0.7...
  19508. 1141.92 s [algebraic-graphs] Building test suite 'main' for algebraic-graphs-0.7...
  19509. 1142.06 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 )
  19510. 1143.18 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 )
  19511. 1145.93 s [algebraic-graphs] [ 3 of 23] Compiling Algebra.Graph.Test ( test/Algebra/Graph/Test.hs, dist/build/main/main-tmp/Algebra/Graph/Test.o, dist/build/main/main-tmp/Algebra/Graph/Test.dyn_o )
  19512. 1145.93 s [algebraic-graphs] [ 4 of 23] Compiling Algebra.Graph.Test.Acyclic.AdjacencyMap ( test/Algebra/Graph/Test/Acyclic/AdjacencyMap.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Acyclic/AdjacencyMap.o, dist/build/main/main-tmp/Algebra/Graph/Test/Acyclic/AdjacencyMap.dyn_o )
  19513. 1146.02 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 )
  19514. 1147.83 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 )
  19515. 1147.84 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 )
  19516. 1147.84 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 )
  19517. 1151.46 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 )
  19518. 1151.60 s [algebraic-graphs] [10 of 23] Compiling Algebra.Graph.Test.AdjacencyIntMap ( test/Algebra/Graph/Test/AdjacencyIntMap.hs, dist/build/main/main-tmp/Algebra/Graph/Test/AdjacencyIntMap.o, dist/build/main/main-tmp/Algebra/Graph/Test/AdjacencyIntMap.dyn_o )
  19519. 1151.60 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 )
  19520. 1152.26 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 )
  19521. 1152.26 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 )
  19522. 1152.26 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 )
  19523. 1153.11 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 )
  19524. 1153.13 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 )
  19525. 1153.13 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 )
  19526. 1153.13 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 )
  19527. 1153.13 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 )
  19528. 1153.13 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 )
  19529. 1153.13 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:43:1: emptyI === emptyIR passed.
  19530. 1153.13 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:49:1: vertexI === vertexIR passed.
  19531. 1153.13 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:56:1: overlayI === overlayIR passed.
  19532. 1153.13 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:63:1: connectI === connectIR passed.
  19533. 1153.13 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:69:1: overlaysC `hasNoType` GHC.Types.List passed.
  19534. 1153.13 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:76:1: overlaysP === overlaysPR passed.
  19535. 1153.13 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:82:1: verticesCP `hasNoType` GHC.Types.List passed.
  19536. 1153.13 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:83:1: verticesCP `hasNoType` Algebra.Graph.Graph passed.
  19537. 1153.13 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:89:1: connectsC `hasNoType` GHC.Types.List passed.
  19538. 1153.13 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:96:1: connectsP === connectsPR passed.
  19539. 1153.13 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:102:1: isSubgraphOfC `hasNoType` Algebra.Graph.Graph passed.
  19540. 1153.13 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:108:1: cliqueCP `hasNoType` GHC.Types.List passed.
  19541. 1153.13 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:109:1: cliqueCP `hasNoType` Algebra.Graph.Graph passed.
  19542. 1153.13 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:115:1: edgesCP `hasNoType` GHC.Types.List passed.
  19543. 1153.13 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:116:1: edgesCP `hasNoType` Algebra.Graph.Graph passed.
  19544. 1153.13 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:122:1: starCP `hasNoType` GHC.Types.List passed.
  19545. 1153.13 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:123:1: starCP `hasNoType` Algebra.Graph.Graph passed.
  19546. 1153.13 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:130:1: fmapCP `hasNoType` Algebra.Graph.Graph passed.
  19547. 1153.13 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:137:1: bindC === bindCR passed.
  19548. 1153.13 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:144:1: bindP === bindPR passed.
  19549. 1153.13 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:151:1: apC === apCR passed.
  19550. 1153.13 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:159:1: apP === apPR passed.
  19551. 1153.13 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:165:1: eqC `hasNoType` Algebra.Graph.Graph passed.
  19552. 1153.13 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:170:1: eqT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
  19553. 1153.13 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:176:1: ordC `hasNoType` Algebra.Graph.Graph passed.
  19554. 1153.13 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:181:1: ordT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
  19555. 1153.13 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:187:1: isEmptyC `hasNoType` Algebra.Graph.Graph passed.
  19556. 1153.13 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:193:1: sizeC `hasNoType` Algebra.Graph.Graph passed.
  19557. 1153.13 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:199:1: vertexSetC `hasNoType` Algebra.Graph.Graph passed.
  19558. 1153.13 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:205:1: vertexSetC `hasNoType` Algebra.Graph.Graph passed.
  19559. 1153.13 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:210:1: vertexCountT `hasNoType` Data.Set.Internal.Set passed.
  19560. 1153.13 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:216:1: edgeCountC `hasNoType` Algebra.Graph.Graph passed.
  19561. 1153.13 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:221:1: edgeCountT `hasNoType` Data.Set.Internal.Set passed.
  19562. 1153.13 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:227:1: vertexListCP `hasNoType` Algebra.Graph.Graph passed.
  19563. 1153.13 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:228:1: vertexListCP `hasNoType` GHC.Types.List passed.
  19564. 1153.13 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:233:1: vertexListT `hasNoType` Data.Set.Internal.Set passed.
  19565. 1153.13 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:239:1: edgeSetC `hasNoType` Algebra.Graph.Graph passed.
  19566. 1153.13 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:244:1: vertexListT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
  19567. 1153.13 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:250:1: edgeListCP `hasNoType` Algebra.Graph.Graph passed.
  19568. 1153.13 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:251:1: edgeListCP `hasNoType` GHC.Types.List passed.
  19569. 1153.13 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:256:1: edgeListT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
  19570. 1153.13 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:262:1: hasVertexC `hasNoType` Algebra.Graph.Graph passed.
  19571. 1153.13 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:268:1: hasEdgeC `hasNoType` Algebra.Graph.Graph passed.
  19572. 1153.13 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:274:1: adjacencyListC `hasNoType` Algebra.Graph.Graph passed.
  19573. 1153.13 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:280:1: pathP `hasNoType` Algebra.Graph.Graph passed.
  19574. 1153.13 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:286:1: circuitP `hasNoType` Algebra.Graph.Graph passed.
  19575. 1153.13 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:292:1: bicliqueCP `hasNoType` GHC.Types.List passed.
  19576. 1153.13 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:293:1: bicliqueCP `hasNoType` Algebra.Graph.Graph passed.
  19577. 1153.13 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:301:1: replaceVertexCP `hasNoType` Algebra.Graph.Graph passed.
  19578. 1153.13 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:309:1: mergeVerticesCP `hasNoType` Algebra.Graph.Graph passed.
  19579. 1153.13 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:316:1: splitVertexCP `hasNoType` GHC.Types.List passed.
  19580. 1153.13 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:317:1: splitVertexCP `hasNoType` Algebra.Graph.Graph passed.
  19581. 1153.13 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:324:1: transposeCP `hasNoType` Algebra.Graph.Graph passed.
  19582. 1153.13 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:339:1: simplifyC === simplifyCR passed.
  19583. 1153.13 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:345:1: composeCP `hasNoType` Algebra.Graph.Graph passed.
  19584. 1153.13 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:352:1: induceCP `hasNoType` Algebra.Graph.Graph passed.
  19585. 1153.13 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:359:1: induceJustCP `hasNoType` Algebra.Graph.Graph passed.
  19586. 1153.13 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:365:1: contextC `hasNoType` Algebra.Graph.Graph passed.
  19587. 1153.13 s [algebraic-graphs] inspection testing successful
  19588. 1153.13 s [algebraic-graphs] expected successes: 58
  19589. 1153.13 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 )
  19590. 1153.13 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 )
  19591. 1153.13 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 )
  19592. 1153.88 s [algebraic-graphs] [24 of 24] Linking dist/build/main/main
  19593. 1154.76 s [algebraic-graphs] buildPhase completed in 31 seconds
  19594. 1154.76 s [algebraic-graphs] Phase: checkPhase
  19595. 1154.98 s [algebraic-graphs] Running 1 test suites...
  19596. 1154.98 s [algebraic-graphs] Test suite main: RUNNING...
  19597. 1162.90 s [algebraic-graphs]
  19598. 1162.90 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.Show ============
  19599. 1162.91 s [algebraic-graphs] OK: show empty == "empty"
  19600. 1162.91 s [algebraic-graphs] OK: show (shrink 1) == "vertex 1"
  19601. 1162.91 s [algebraic-graphs] OK: show (shrink $ 1 + 2) == "vertices [1,2]"
  19602. 1162.91 s [algebraic-graphs] OK: show (shrink $ 1 * 2) == "(fromJust . toAcyclic) (edge 1 2)"
  19603. 1162.91 s [algebraic-graphs] OK: show (shrink $ 1 * 2 * 3) == "(fromJust . toAcyclic) (edges [(1,2),(1,3),(2,3)])"
  19604. 1162.91 s [algebraic-graphs] OK: show (shrink $ 1 * 2 + 3) == "(fromJust . toAcyclic) (overlay (vertex 3) (edge 1 2))"
  19605. 1162.91 s [algebraic-graphs]
  19606. 1162.91 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.fromAcyclic ============
  19607. 1162.91 s [algebraic-graphs] OK: fromAcyclic empty == empty
  19608. 1162.91 s [algebraic-graphs] OK: fromAcyclic . vertex == vertex
  19609. 1162.91 s [algebraic-graphs] OK: fromAcyclic (shrink $ 1 * 3 * 2) == star 1 [2,3]
  19610. 1162.91 s [algebraic-graphs] OK: vertexCount . fromAcyclic == vertexCount
  19611. 1162.91 s [algebraic-graphs] OK: edgeCount . fromAcyclic == edgeCount
  19612. 1162.91 s [algebraic-graphs] OK: isAcyclic . fromAcyclic == const True
  19613. 1162.91 s [algebraic-graphs]
  19614. 1162.91 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.empty ============
  19615. 1162.91 s [algebraic-graphs] OK: isEmpty empty == True
  19616. 1162.91 s [algebraic-graphs] OK: hasVertex x empty == False
  19617. 1162.91 s [algebraic-graphs] OK: vertexCount empty == 0
  19618. 1162.91 s [algebraic-graphs] OK: edgeCount empty == 0
  19619. 1162.91 s [algebraic-graphs]
  19620. 1162.91 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertex ============
  19621. 1162.91 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  19622. 1162.91 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  19623. 1162.91 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  19624. 1162.91 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  19625. 1162.91 s [algebraic-graphs]
  19626. 1162.91 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertices ============
  19627. 1162.91 s [algebraic-graphs] OK: vertices [] == empty
  19628. 1162.91 s [algebraic-graphs] OK: vertices [x] == vertex x
  19629. 1162.91 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  19630. 1162.91 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  19631. 1162.91 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  19632. 1162.91 s [algebraic-graphs]
  19633. 1162.91 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.union ============
  19634. 1162.91 s [algebraic-graphs] OK: vertexSet (union x y) == <correct result>
  19635. 1162.91 s [algebraic-graphs] OK: edgeSet (union x y) == <correct result>
  19636. 1162.91 s [algebraic-graphs]
  19637. 1162.91 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.join ============
  19638. 1162.91 s [algebraic-graphs] OK: vertexSet (join x y) == <correct result>
  19639. 1162.91 s [algebraic-graphs] OK: edgeSet (join x y) == <correct result>
  19640. 1162.91 s [algebraic-graphs]
  19641. 1162.91 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.isSubgraphOf ============
  19642. 1162.91 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  19643. 1162.91 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  19644. 1162.91 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  19645. 1162.91 s [algebraic-graphs] OK: isSubgraphOf x (transitiveClosure x) == True
  19646. 1162.91 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  19647. 1162.91 s [algebraic-graphs]
  19648. 1162.91 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.isEmpty ============
  19649. 1162.91 s [algebraic-graphs] OK: isEmpty empty == True
  19650. 1162.91 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  19651. 1162.91 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  19652. 1162.91 s [algebraic-graphs] OK: isEmpty (removeEdge 1 2 $ shrink $ 1 * 2) == False
  19653. 1162.91 s [algebraic-graphs]
  19654. 1162.91 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.hasVertex ============
  19655. 1162.91 s [algebraic-graphs] OK: hasVertex x empty == False
  19656. 1162.91 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  19657. 1162.91 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  19658. 1162.91 s [algebraic-graphs]
  19659. 1162.91 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.hasEdge ============
  19660. 1162.91 s [algebraic-graphs] OK: hasEdge x y empty == False
  19661. 1162.91 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  19662. 1162.91 s [algebraic-graphs] OK: hasEdge 1 2 (shrink $ 1 * 2) == True
  19663. 1162.91 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  19664. 1162.91 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  19665. 1162.91 s [algebraic-graphs]
  19666. 1162.91 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertexCount ============
  19667. 1162.91 s [algebraic-graphs] OK: vertexCount empty == 0
  19668. 1162.91 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  19669. 1162.91 s [algebraic-graphs] OK: vertexCount == length . vertexList
  19670. 1162.91 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  19671. 1162.91 s [algebraic-graphs]
  19672. 1162.91 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.edgeCount ============
  19673. 1162.91 s [algebraic-graphs] OK: edgeCount empty == 0
  19674. 1162.91 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  19675. 1162.91 s [algebraic-graphs] OK: edgeCount (shrink $ 1 * 2) == 1
  19676. 1162.91 s [algebraic-graphs] OK: edgeCount == length . edgeList
  19677. 1162.91 s [algebraic-graphs]
  19678. 1162.91 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertexList ============
  19679. 1162.91 s [algebraic-graphs] OK: vertexList empty == []
  19680. 1162.91 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  19681. 1162.91 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  19682. 1162.91 s [algebraic-graphs]
  19683. 1162.91 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.edgeList ============
  19684. 1162.91 s [algebraic-graphs] OK: edgeList empty == []
  19685. 1162.91 s [algebraic-graphs] OK: edgeList (vertex x) == []
  19686. 1162.91 s [algebraic-graphs] OK: edgeList (shrink $ 2 * 1) == [(2,1)]
  19687. 1162.91 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  19688. 1162.91 s [algebraic-graphs]
  19689. 1162.91 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.adjacencyList ============
  19690. 1162.91 s [algebraic-graphs] OK: adjacencyList empty == []
  19691. 1162.91 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  19692. 1162.91 s [algebraic-graphs] OK: adjacencyList (shrink $ 1 * 2) == [(1, [2]), (2, [])]
  19693. 1162.91 s [algebraic-graphs]
  19694. 1162.91 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertexSet ============
  19695. 1162.91 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  19696. 1162.91 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  19697. 1162.91 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  19698. 1162.91 s [algebraic-graphs]
  19699. 1162.91 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.edgeSet ============
  19700. 1162.91 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  19701. 1162.91 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  19702. 1162.91 s [algebraic-graphs] OK: edgeSet (shrink $ 1 * 2) == Set.singleton (1,2)
  19703. 1162.91 s [algebraic-graphs]
  19704. 1162.91 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.preSet ============
  19705. 1162.91 s [algebraic-graphs] OK: preSet x empty == Set.empty
  19706. 1162.91 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  19707. 1162.91 s [algebraic-graphs] OK: preSet 1 (shrink $ 1 * 2) == Set.empty
  19708. 1162.91 s [algebraic-graphs] OK: preSet 2 (shrink $ 1 * 2) == Set.fromList [1]
  19709. 1162.91 s [algebraic-graphs] OK: Set.member x . preSet x == const False
  19710. 1162.91 s [algebraic-graphs]
  19711. 1162.91 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.postSet ============
  19712. 1162.91 s [algebraic-graphs] OK: postSet x empty == Set.empty
  19713. 1162.91 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  19714. 1162.91 s [algebraic-graphs] OK: postSet 1 (shrink $ 1 * 2) == Set.fromList [2]
  19715. 1162.91 s [algebraic-graphs] OK: postSet 2 (shrink $ 1 * 2) == Set.empty
  19716. 1162.91 s [algebraic-graphs] OK: Set.member x . postSet x == const False
  19717. 1162.91 s [algebraic-graphs]
  19718. 1162.91 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.removeVertex ============
  19719. 1162.91 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  19720. 1162.91 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  19721. 1162.91 s [algebraic-graphs] OK: removeVertex 1 (shrink $ 1 * 2) == vertex 2
  19722. 1162.91 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  19723. 1162.91 s [algebraic-graphs]
  19724. 1162.91 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.removeEdge ============
  19725. 1162.91 s [algebraic-graphs] OK: removeEdge 1 2 (shrink $ 1 * 2) == vertices [1,2]
  19726. 1162.91 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  19727. 1162.91 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  19728. 1162.91 s [algebraic-graphs] OK: removeEdge 1 2 (shrink $ 1 * 2 * 3) == shrink ((1 + 2) * 3)
  19729. 1162.91 s [algebraic-graphs]
  19730. 1162.91 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.transpose ============
  19731. 1162.91 s [algebraic-graphs] OK: transpose empty == empty
  19732. 1162.91 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  19733. 1162.91 s [algebraic-graphs] OK: transpose . transpose == id
  19734. 1162.91 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  19735. 1162.91 s [algebraic-graphs]
  19736. 1162.91 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.induce ============
  19737. 1162.91 s [algebraic-graphs] OK: induce (const True ) x == x
  19738. 1162.91 s [algebraic-graphs] OK: induce (const False) x == empty
  19739. 1162.91 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  19740. 1162.91 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  19741. 1162.91 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  19742. 1162.91 s [algebraic-graphs]
  19743. 1162.91 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.induceJust ============
  19744. 1162.91 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  19745. 1162.91 s [algebraic-graphs] OK: induceJust . vertex . Just == vertex
  19746. 1162.91 s [algebraic-graphs]
  19747. 1162.91 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.box ============
  19748. 1162.91 s [algebraic-graphs] OK: edgeList (box (shrink $ 1 * 2) (shrink $ 10 * 20)) == <correct result>
  19749. 1162.91 s [algebraic-graphs]
  19750. 1162.91 s [algebraic-graphs] OK: box x y ~~ box y x
  19751. 1162.91 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  19752. 1162.91 s [algebraic-graphs] OK: box x empty ~~ empty
  19753. 1162.91 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  19754. 1162.91 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  19755. 1162.91 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  19756. 1162.91 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  19757. 1162.91 s [algebraic-graphs]
  19758. 1162.91 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.transitiveClosure ============
  19759. 1162.91 s [algebraic-graphs] OK: transitiveClosure empty == empty
  19760. 1162.91 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  19761. 1162.91 s [algebraic-graphs] OK: transitiveClosure (shrink $ 1 * 2 + 2 * 3) == shrink (1 * 2 + 1 * 3 + 2 * 3)
  19762. 1162.91 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  19763. 1162.91 s [algebraic-graphs]
  19764. 1162.91 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.topSort ============
  19765. 1162.91 s [algebraic-graphs] OK: topSort empty == []
  19766. 1162.91 s [algebraic-graphs] OK: topSort (vertex x) == [x]
  19767. 1162.91 s [algebraic-graphs] OK: topSort (shrink $ 1 * (2 + 4) + 3 * 4) == [1, 2, 3, 4]
  19768. 1162.91 s [algebraic-graphs] OK: topSort (join x y) == fmap Left (topSort x) ++ fmap Right (topSort y)
  19769. 1162.91 s [algebraic-graphs] OK: Right . topSort == AM.topSort . fromAcyclic
  19770. 1162.91 s [algebraic-graphs]
  19771. 1162.91 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.scc ============
  19772. 1162.91 s [algebraic-graphs] OK: scc empty == empty
  19773. 1162.91 s [algebraic-graphs] OK: scc (vertex x) == vertex (NonEmpty.vertex x)
  19774. 1162.91 s [algebraic-graphs] OK: scc (edge 1 1) == vertex (NonEmpty.edge 1 1)
  19775. 1162.91 s [algebraic-graphs] OK: edgeList $ scc (edge 1 2) == [ (NonEmpty.vertex 1, NonEmpty.vertex 2) ]
  19776. 1162.91 s [algebraic-graphs] OK: edgeList $ scc (3 * 1 * 4 * 1 * 5) == <correct result>
  19777. 1162.91 s [algebraic-graphs]
  19778. 1162.91 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.toAcyclic ============
  19779. 1162.91 s [algebraic-graphs] OK: toAcyclic (path [1,2,3]) == Just (shrink $ 1 * 2 + 2 * 3)
  19780. 1162.91 s [algebraic-graphs] OK: toAcyclic (clique [3,2,1]) == Just (transpose (shrink $ 1 * 2 * 3))
  19781. 1162.91 s [algebraic-graphs] OK: toAcyclic (circuit [1,2,3]) == Nothing
  19782. 1162.91 s [algebraic-graphs] OK: toAcyclic . fromAcyclic == Just
  19783. 1162.91 s [algebraic-graphs]
  19784. 1162.91 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.toAcyclicOrd ============
  19785. 1162.91 s [algebraic-graphs] OK: toAcyclicOrd empty == empty
  19786. 1162.91 s [algebraic-graphs] OK: toAcyclicOrd . vertex == vertex
  19787. 1162.91 s [algebraic-graphs] OK: toAcyclicOrd (1 + 2) == shrink (1 + 2)
  19788. 1162.91 s [algebraic-graphs] OK: toAcyclicOrd (1 * 2) == shrink (1 * 2)
  19789. 1162.91 s [algebraic-graphs] OK: toAcyclicOrd (2 * 1) == shrink (1 + 2)
  19790. 1162.91 s [algebraic-graphs] OK: toAcyclicOrd (1 * 2 * 1) == shrink (1 * 2)
  19791. 1165.92 s [algebraic-graphs] OK: toAcyclicOrd (1 * 2 * 3) == shrink (1 * 2 * 3)
  19792. 1165.92 s [algebraic-graphs]
  19793. 1165.92 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.shrink ============
  19794. 1165.92 s [algebraic-graphs] OK: shrink . AM.vertex == vertex
  19795. 1165.92 s [algebraic-graphs] OK: shrink . AM.vertices == vertices
  19796. 1165.92 s [algebraic-graphs] OK: shrink . fromAcyclic == id
  19797. 1165.92 s [algebraic-graphs]
  19798. 1165.92 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.consistent ============
  19799. 1165.92 s [algebraic-graphs] OK: Arbitrary
  19800. 1165.92 s [algebraic-graphs] OK: empty
  19801. 1165.92 s [algebraic-graphs] OK: vertex
  19802. 1165.92 s [algebraic-graphs] OK: vertices
  19803. 1165.92 s [algebraic-graphs] OK: union
  19804. 1165.92 s [algebraic-graphs] OK: join
  19805. 1165.92 s [algebraic-graphs] OK: transpose
  19806. 1165.92 s [algebraic-graphs] OK: box
  19807. 1165.92 s [algebraic-graphs] OK: transitiveClosure
  19808. 1165.92 s [algebraic-graphs] OK: scc
  19809. 1165.92 s [algebraic-graphs] OK: toAcyclic
  19810. 1165.92 s [algebraic-graphs] OK: toAcyclicOrd
  19811. 1165.92 s [algebraic-graphs]
  19812. 1165.92 s [algebraic-graphs] ============ AdjacencyIntMap ============
  19813. 1165.92 s [algebraic-graphs] OK: Axioms of graphs
  19814. 1165.92 s [algebraic-graphs]
  19815. 1165.92 s [algebraic-graphs] ============ AdjacencyIntMap.fromAdjacencyMap ============
  19816. 1165.92 s [algebraic-graphs] OK: fromAdjacencyMap == stars . AdjacencyMap.adjacencyList
  19817. 1165.92 s [algebraic-graphs]
  19818. 1165.92 s [algebraic-graphs] ============ AdjacencyIntMap.consistent ============
  19819. 1165.92 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  19820. 1165.92 s [algebraic-graphs]
  19821. 1165.92 s [algebraic-graphs] OK: consistent empty == True
  19822. 1165.92 s [algebraic-graphs] OK: consistent (vertex x) == True
  19823. 1165.92 s [algebraic-graphs] OK: consistent (overlay x y) == True
  19824. 1165.92 s [algebraic-graphs] OK: consistent (connect x y) == True
  19825. 1165.92 s [algebraic-graphs] OK: consistent (edge x y) == True
  19826. 1165.92 s [algebraic-graphs] OK: consistent (edges xs) == True
  19827. 1165.92 s [algebraic-graphs] OK: consistent (stars xs) == True
  19828. 1165.92 s [algebraic-graphs]
  19829. 1165.92 s [algebraic-graphs] ============ AdjacencyIntMap.Show ============
  19830. 1165.92 s [algebraic-graphs] OK: show (empty ) == "empty"
  19831. 1165.92 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  19832. 1165.92 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  19833. 1165.92 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  19834. 1165.92 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  19835. 1165.92 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  19836. 1165.92 s [algebraic-graphs]
  19837. 1165.92 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  19838. 1165.92 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  19839. 1165.92 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  19840. 1165.92 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  19841. 1165.92 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  19842. 1165.92 s [algebraic-graphs]
  19843. 1165.92 s [algebraic-graphs] ============ AdjacencyIntMap.Ord ============
  19844. 1165.92 s [algebraic-graphs] OK: vertex 1 < vertex 2
  19845. 1165.92 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  19846. 1165.92 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  19847. 1165.92 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  19848. 1165.92 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  19849. 1165.92 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  19850. 1165.92 s [algebraic-graphs] OK: x <= x + y
  19851. 1165.92 s [algebraic-graphs] OK: x + y <= x * y
  19852. 1165.92 s [algebraic-graphs]
  19853. 1165.92 s [algebraic-graphs] ============ AdjacencyIntMap.empty ============
  19854. 1165.92 s [algebraic-graphs] OK: isEmpty empty == True
  19855. 1165.92 s [algebraic-graphs] OK: hasVertex x empty == False
  19856. 1165.92 s [algebraic-graphs] OK: vertexCount empty == 0
  19857. 1165.92 s [algebraic-graphs] OK: edgeCount empty == 0
  19858. 1165.92 s [algebraic-graphs]
  19859. 1165.92 s [algebraic-graphs] ============ AdjacencyIntMap.vertex ============
  19860. 1165.92 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  19861. 1165.92 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  19862. 1165.92 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  19863. 1165.92 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  19864. 1165.92 s [algebraic-graphs]
  19865. 1165.92 s [algebraic-graphs] ============ AdjacencyIntMap.edge ============
  19866. 1165.92 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  19867. 1165.92 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  19868. 1165.92 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  19869. 1165.92 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  19870. 1165.92 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  19871. 1165.92 s [algebraic-graphs]
  19872. 1165.92 s [algebraic-graphs] ============ AdjacencyIntMap.overlay ============
  19873. 1165.92 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  19874. 1165.92 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  19875. 1165.92 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  19876. 1165.92 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  19877. 1165.92 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  19878. 1165.92 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  19879. 1165.92 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  19880. 1165.92 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  19881. 1165.92 s [algebraic-graphs]
  19882. 1165.92 s [algebraic-graphs] ============ AdjacencyIntMap.connect ============
  19883. 1165.92 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  19884. 1165.92 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  19885. 1165.92 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  19886. 1165.92 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  19887. 1165.92 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  19888. 1165.92 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  19889. 1165.92 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  19890. 1165.92 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  19891. 1165.92 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  19892. 1165.92 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  19893. 1165.92 s [algebraic-graphs]
  19894. 1165.92 s [algebraic-graphs] ============ AdjacencyIntMap.vertices ============
  19895. 1165.92 s [algebraic-graphs] OK: vertices [] == empty
  19896. 1165.92 s [algebraic-graphs] OK: vertices [x] == vertex x
  19897. 1165.92 s [algebraic-graphs] OK: vertices == overlays . map vertex
  19898. 1165.92 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  19899. 1165.92 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  19900. 1165.92 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  19901. 1165.92 s [algebraic-graphs]
  19902. 1165.92 s [algebraic-graphs] ============ AdjacencyIntMap.edges ============
  19903. 1165.92 s [algebraic-graphs] OK: edges [] == empty
  19904. 1165.92 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  19905. 1165.92 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  19906. 1165.92 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  19907. 1165.92 s [algebraic-graphs]
  19908. 1165.92 s [algebraic-graphs] ============ AdjacencyIntMap.overlays ============
  19909. 1165.92 s [algebraic-graphs] OK: overlays [] == empty
  19910. 1165.92 s [algebraic-graphs] OK: overlays [x] == x
  19911. 1165.92 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  19912. 1165.92 s [algebraic-graphs] OK: overlays == foldr overlay empty
  19913. 1165.92 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  19914. 1165.92 s [algebraic-graphs]
  19915. 1165.92 s [algebraic-graphs] ============ AdjacencyIntMap.connects ============
  19916. 1165.92 s [algebraic-graphs] OK: connects [] == empty
  19917. 1165.92 s [algebraic-graphs] OK: connects [x] == x
  19918. 1165.92 s [algebraic-graphs] OK: connects [x,y] == connect x y
  19919. 1165.92 s [algebraic-graphs] OK: connects == foldr connect empty
  19920. 1165.92 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  19921. 1165.92 s [algebraic-graphs]
  19922. 1165.92 s [algebraic-graphs] ============ AdjacencyIntMap.fromAdjacencyIntSets ============
  19923. 1165.92 s [algebraic-graphs] OK: fromAdjacencyIntSets [] == empty
  19924. 1165.92 s [algebraic-graphs] OK: fromAdjacencyIntSets [(x, IntSet.empty)] == vertex x
  19925. 1165.92 s [algebraic-graphs] OK: fromAdjacencyIntSets [(x, IntSet.singleton y)] == edge x y
  19926. 1165.92 s [algebraic-graphs] OK: fromAdjacencyIntSets . map (fmap IntSet.fromList) == stars
  19927. 1165.92 s [algebraic-graphs] OK: overlay (fromAdjacencyIntSets xs) (fromAdjacencyIntSets ys) == fromAdjacencyIntSets (xs ++ ys)
  19928. 1165.92 s [algebraic-graphs]
  19929. 1165.92 s [algebraic-graphs] ============ AdjacencyIntMap.isSubgraphOf ============
  19930. 1165.92 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  19931. 1165.92 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  19932. 1165.92 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  19933. 1165.92 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  19934. 1165.92 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  19935. 1165.92 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  19936. 1165.92 s [algebraic-graphs]
  19937. 1165.92 s [algebraic-graphs] ============ AdjacencyIntMap.toGraph et al. ============
  19938. 1165.92 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  19939. 1165.92 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  19940. 1165.92 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  19941. 1165.92 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  19942. 1165.92 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  19943. 1165.92 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  19944. 1165.92 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  19945. 1165.92 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  19946. 1165.92 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  19947. 1165.92 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  19948. 1165.92 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  19949. 1165.92 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  19950. 1165.92 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  19951. 1165.92 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  19952. 1165.92 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  19953. 1165.92 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  19954. 1165.92 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  19955. 1165.92 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  19956. 1165.92 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  19957. 1165.92 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  19958. 1165.92 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  19959. 1165.92 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  19960. 1165.92 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  19961. 1165.92 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  19962. 1165.92 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  19963. 1165.92 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  19964. 1165.92 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  19965. 1165.92 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  19966. 1165.92 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  19967. 1165.92 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  19968. 1165.92 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  19969. 1165.92 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  19970. 1165.92 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  19971. 1165.92 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  19972. 1166.70 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  19973. 1166.70 s [algebraic-graphs]
  19974. 1166.70 s [algebraic-graphs] ============ AdjacencyIntMap.foldg ============
  19975. 1166.70 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  19976. 1166.70 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  19977. 1166.70 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  19978. 1166.70 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  19979. 1166.70 s [algebraic-graphs]
  19980. 1166.70 s [algebraic-graphs] ============ AdjacencyIntMap.isEmpty ============
  19981. 1166.70 s [algebraic-graphs] OK: isEmpty empty == True
  19982. 1166.70 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  19983. 1166.70 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  19984. 1166.70 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  19985. 1166.70 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  19986. 1166.70 s [algebraic-graphs]
  19987. 1166.70 s [algebraic-graphs] ============ AdjacencyIntMap.hasVertex ============
  19988. 1166.70 s [algebraic-graphs] OK: hasVertex x empty == False
  19989. 1166.70 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  19990. 1166.70 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  19991. 1166.70 s [algebraic-graphs]
  19992. 1166.70 s [algebraic-graphs] ============ AdjacencyIntMap.hasEdge ============
  19993. 1166.70 s [algebraic-graphs] OK: hasEdge x y empty == False
  19994. 1166.70 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  19995. 1166.70 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  19996. 1166.70 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  19997. 1166.70 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  19998. 1166.70 s [algebraic-graphs]
  19999. 1166.70 s [algebraic-graphs] ============ AdjacencyIntMap.vertexCount ============
  20000. 1166.70 s [algebraic-graphs] OK: vertexCount empty == 0
  20001. 1166.70 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20002. 1166.70 s [algebraic-graphs] OK: vertexCount == length . vertexList
  20003. 1166.70 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  20004. 1166.70 s [algebraic-graphs]
  20005. 1166.70 s [algebraic-graphs] ============ AdjacencyIntMap.edgeCount ============
  20006. 1166.70 s [algebraic-graphs] OK: edgeCount empty == 0
  20007. 1166.70 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20008. 1166.70 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  20009. 1166.70 s [algebraic-graphs] OK: edgeCount == length . edgeList
  20010. 1166.70 s [algebraic-graphs]
  20011. 1166.70 s [algebraic-graphs] ============ AdjacencyIntMap.vertexList ============
  20012. 1166.70 s [algebraic-graphs] OK: vertexList empty == []
  20013. 1166.70 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  20014. 1166.70 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  20015. 1166.70 s [algebraic-graphs]
  20016. 1166.70 s [algebraic-graphs] ============ AdjacencyIntMap.vertexSet ============
  20017. 1166.70 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  20018. 1166.70 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  20019. 1166.70 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  20020. 1166.70 s [algebraic-graphs]
  20021. 1166.70 s [algebraic-graphs] ============ AdjacencyIntMap.vertexIntSet ============
  20022. 1166.70 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  20023. 1166.70 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  20024. 1166.70 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  20025. 1166.70 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  20026. 1166.70 s [algebraic-graphs]
  20027. 1166.70 s [algebraic-graphs] ============ AdjacencyIntMap.edgeList ============
  20028. 1166.70 s [algebraic-graphs] OK: edgeList empty == []
  20029. 1166.70 s [algebraic-graphs] OK: edgeList (vertex x) == []
  20030. 1166.70 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  20031. 1166.70 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  20032. 1166.70 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  20033. 1166.70 s [algebraic-graphs]
  20034. 1166.70 s [algebraic-graphs] ============ AdjacencyIntMap.edgeSet ============
  20035. 1166.70 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  20036. 1166.70 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  20037. 1166.70 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  20038. 1166.70 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  20039. 1166.70 s [algebraic-graphs]
  20040. 1166.70 s [algebraic-graphs] ============ AdjacencyIntMap.adjacencyList ============
  20041. 1166.70 s [algebraic-graphs] OK: adjacencyList empty == []
  20042. 1166.70 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  20043. 1166.70 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  20044. 1166.70 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  20045. 1166.70 s [algebraic-graphs]
  20046. 1166.70 s [algebraic-graphs] ============ AdjacencyIntMap.preSet ============
  20047. 1166.70 s [algebraic-graphs] OK: preSet x empty == Set.empty
  20048. 1166.70 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  20049. 1166.70 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  20050. 1166.70 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  20051. 1166.70 s [algebraic-graphs]
  20052. 1166.70 s [algebraic-graphs] ============ AdjacencyIntMap.preIntSet ============
  20053. 1166.70 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  20054. 1166.70 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  20055. 1166.70 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  20056. 1166.70 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  20057. 1166.70 s [algebraic-graphs]
  20058. 1166.70 s [algebraic-graphs] ============ AdjacencyIntMap.postSet ============
  20059. 1166.70 s [algebraic-graphs] OK: postSet x empty == Set.empty
  20060. 1166.70 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  20061. 1166.70 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  20062. 1166.70 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  20063. 1166.70 s [algebraic-graphs]
  20064. 1166.70 s [algebraic-graphs] ============ AdjacencyIntMap.postIntSet ============
  20065. 1166.70 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  20066. 1166.70 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  20067. 1166.70 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  20068. 1166.70 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  20069. 1166.70 s [algebraic-graphs]
  20070. 1166.70 s [algebraic-graphs] ============ AdjacencyIntMap.path ============
  20071. 1166.70 s [algebraic-graphs] OK: path [] == empty
  20072. 1166.70 s [algebraic-graphs] OK: path [x] == vertex x
  20073. 1166.70 s [algebraic-graphs] OK: path [x,y] == edge x y
  20074. 1166.70 s [algebraic-graphs]
  20075. 1166.70 s [algebraic-graphs] ============ AdjacencyIntMap.circuit ============
  20076. 1166.70 s [algebraic-graphs] OK: circuit [] == empty
  20077. 1166.70 s [algebraic-graphs] OK: circuit [x] == edge x x
  20078. 1166.70 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  20079. 1166.70 s [algebraic-graphs]
  20080. 1166.70 s [algebraic-graphs] ============ AdjacencyIntMap.clique ============
  20081. 1166.70 s [algebraic-graphs] OK: clique [] == empty
  20082. 1166.70 s [algebraic-graphs] OK: clique [x] == vertex x
  20083. 1166.70 s [algebraic-graphs] OK: clique [x,y] == edge x y
  20084. 1166.70 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  20085. 1166.70 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  20086. 1166.70 s [algebraic-graphs]
  20087. 1166.70 s [algebraic-graphs] ============ AdjacencyIntMap.biclique ============
  20088. 1166.70 s [algebraic-graphs] OK: biclique [] [] == empty
  20089. 1166.70 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  20090. 1166.70 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  20091. 1166.70 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  20092. 1166.70 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  20093. 1166.70 s [algebraic-graphs]
  20094. 1166.70 s [algebraic-graphs] ============ AdjacencyIntMap.star ============
  20095. 1166.70 s [algebraic-graphs] OK: star x [] == vertex x
  20096. 1166.70 s [algebraic-graphs] OK: star x [y] == edge x y
  20097. 1166.70 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  20098. 1166.70 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  20099. 1166.70 s [algebraic-graphs]
  20100. 1166.70 s [algebraic-graphs] ============ AdjacencyIntMap.stars ============
  20101. 1166.70 s [algebraic-graphs] OK: stars [] == empty
  20102. 1166.70 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  20103. 1166.70 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  20104. 1166.70 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  20105. 1166.70 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  20106. 1166.70 s [algebraic-graphs] OK: stars . adjacencyList == id
  20107. 1166.70 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  20108. 1166.70 s [algebraic-graphs]
  20109. 1166.70 s [algebraic-graphs] ============ AdjacencyIntMap.tree ============
  20110. 1166.70 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  20111. 1166.70 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  20112. 1166.70 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  20113. 1166.70 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  20114. 1166.70 s [algebraic-graphs]
  20115. 1166.70 s [algebraic-graphs] ============ AdjacencyIntMap.forest ============
  20116. 1166.70 s [algebraic-graphs] OK: forest [] == empty
  20117. 1166.70 s [algebraic-graphs] OK: forest [x] == tree x
  20118. 1166.70 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  20119. 1166.70 s [algebraic-graphs] OK: forest == overlays . map tree
  20120. 1166.70 s [algebraic-graphs]
  20121. 1166.70 s [algebraic-graphs] ============ AdjacencyIntMap.removeVertex ============
  20122. 1166.70 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  20123. 1166.70 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  20124. 1166.70 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  20125. 1166.70 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  20126. 1166.70 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  20127. 1166.70 s [algebraic-graphs]
  20128. 1166.70 s [algebraic-graphs] ============ AdjacencyIntMap.removeEdge ============
  20129. 1166.70 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  20130. 1166.70 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  20131. 1166.70 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  20132. 1166.70 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  20133. 1166.70 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  20134. 1166.70 s [algebraic-graphs]
  20135. 1166.70 s [algebraic-graphs] ============ AdjacencyIntMap.replaceVertex ============
  20136. 1166.70 s [algebraic-graphs] OK: replaceVertex x x == id
  20137. 1166.70 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  20138. 1166.70 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  20139. 1166.70 s [algebraic-graphs]
  20140. 1166.70 s [algebraic-graphs] ============ AdjacencyIntMap.mergeVertices ============
  20141. 1166.70 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  20142. 1166.70 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  20143. 1166.70 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  20144. 1166.70 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  20145. 1166.70 s [algebraic-graphs]
  20146. 1166.70 s [algebraic-graphs] ============ AdjacencyIntMap.transpose ============
  20147. 1166.70 s [algebraic-graphs] OK: transpose empty == empty
  20148. 1166.70 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  20149. 1166.70 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  20150. 1166.70 s [algebraic-graphs] OK: transpose . transpose == id
  20151. 1166.70 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  20152. 1166.70 s [algebraic-graphs]
  20153. 1166.70 s [algebraic-graphs] ============ AdjacencyIntMap.gmap ============
  20154. 1166.70 s [algebraic-graphs] OK: gmap f empty == empty
  20155. 1166.70 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  20156. 1166.70 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  20157. 1166.70 s [algebraic-graphs] OK: gmap id == id
  20158. 1166.70 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  20159. 1166.70 s [algebraic-graphs]
  20160. 1166.70 s [algebraic-graphs] ============ AdjacencyIntMap.induce ============
  20161. 1166.70 s [algebraic-graphs] OK: induce (const True ) x == x
  20162. 1166.70 s [algebraic-graphs] OK: induce (const False) x == empty
  20163. 1166.70 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  20164. 1166.70 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  20165. 1166.70 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  20166. 1166.70 s [algebraic-graphs]
  20167. 1166.70 s [algebraic-graphs] ============ AdjacencyIntMap.compose ============
  20168. 1166.70 s [algebraic-graphs] OK: compose empty x == empty
  20169. 1166.70 s [algebraic-graphs] OK: compose x empty == empty
  20170. 1166.70 s [algebraic-graphs] OK: compose (vertex x) y == empty
  20171. 1166.70 s [algebraic-graphs] OK: compose x (vertex y) == empty
  20172. 1166.70 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  20173. 1166.70 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  20174. 1166.93 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  20175. 1166.93 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  20176. 1166.93 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  20177. 1166.93 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  20178. 1166.93 s [algebraic-graphs]
  20179. 1166.93 s [algebraic-graphs] ============ AdjacencyIntMap.closure ============
  20180. 1166.93 s [algebraic-graphs] OK: closure empty == empty
  20181. 1166.93 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  20182. 1166.93 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  20183. 1166.93 s [algebraic-graphs] OK: closure (edge x y) == edges [(x,x), (x,y), (y,y)]
  20184. 1166.93 s [algebraic-graphs] OK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
  20185. 1166.93 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  20186. 1166.93 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  20187. 1166.93 s [algebraic-graphs] OK: closure . closure == closure
  20188. 1166.93 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  20189. 1166.93 s [algebraic-graphs]
  20190. 1166.93 s [algebraic-graphs] ============ AdjacencyIntMap.reflexiveClosure ============
  20191. 1166.93 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  20192. 1166.93 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  20193. 1166.94 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  20194. 1166.94 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges [(x,x), (x,y), (y,y)]
  20195. 1166.94 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  20196. 1166.94 s [algebraic-graphs]
  20197. 1166.94 s [algebraic-graphs] ============ AdjacencyIntMap.symmetricClosure ============
  20198. 1166.94 s [algebraic-graphs] OK: symmetricClosure empty == empty
  20199. 1166.94 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  20200. 1166.94 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges [(x,y), (y,x)]
  20201. 1166.94 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  20202. 1166.94 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  20203. 1166.94 s [algebraic-graphs]
  20204. 1166.94 s [algebraic-graphs] ============ AdjacencyIntMap.transitiveClosure ============
  20205. 1166.94 s [algebraic-graphs] OK: transitiveClosure empty == empty
  20206. 1166.94 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  20207. 1166.94 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  20208. 1166.94 s [algebraic-graphs] OK: transitiveClosure (path $ nub xs) == clique (nub $ xs)
  20209. 1166.94 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  20210. 1166.94 s [algebraic-graphs]
  20211. 1166.94 s [algebraic-graphs] ============ AdjacencyIntMap.bfsForest ============
  20212. 1166.94 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0] == empty
  20213. 1166.94 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [1] == edge 1 2
  20214. 1166.94 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2] == vertex 2
  20215. 1166.94 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0,1,2] == vertices [1,2]
  20216. 1166.94 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2,1,0] == vertices [1,2]
  20217. 1166.94 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 1) [1] == vertex 1
  20218. 1166.94 s [algebraic-graphs] OK: isSubgraphOf (forest $ bfsForest x vs) x == True
  20219. 1166.94 s [algebraic-graphs] OK: bfsForest x (vertexList x) == map ( -> Node v []) (nub $ vertexList x)
  20220. 1166.94 s [algebraic-graphs] OK: bfsForest x [] == []
  20221. 1166.94 s [algebraic-graphs] OK: bfsForest empty vs == []
  20222. 1166.94 s [algebraic-graphs] OK: bfsForest (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
  20223. 1166.94 s [algebraic-graphs] OK: forest $ bfsForest (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1] + path [3,4,5]
  20224. 1166.94 s [algebraic-graphs]
  20225. 1166.94 s [algebraic-graphs] ============ AdjacencyIntMap.bfs ============
  20226. 1166.94 s [algebraic-graphs] OK: bfs (edge 1 2) [0] == []
  20227. 1166.94 s [algebraic-graphs] OK: bfs (edge 1 2) [1] == [[1], [2]]
  20228. 1166.94 s [algebraic-graphs] OK: bfs (edge 1 2) [2] == [[2]]
  20229. 1166.94 s [algebraic-graphs] OK: bfs (edge 1 2) [1,2] == [[1,2]]
  20230. 1166.94 s [algebraic-graphs] OK: bfs (edge 1 2) [2,1] == [[2,1]]
  20231. 1166.94 s [algebraic-graphs] OK: bfs (edge 1 1) [1] == [[1]]
  20232. 1166.94 s [algebraic-graphs] OK: bfs empty vs == []
  20233. 1166.94 s [algebraic-graphs] OK: bfs x [] == []
  20234. 1166.94 s [algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,2] == [[1,2]]
  20235. 1166.94 s [algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,3] == [[1,3], [2,4]]
  20236. 1166.94 s [algebraic-graphs] OK: bfs (3 * (1 + 4) * (1 + 5)) [3] == [[3], [1,4,5]]
  20237. 1166.94 s [algebraic-graphs] OK: bfs (circuit [1..5] + circuit [5,4..1]) [2] == [[2], [1,3], [5,4]]
  20238. 1166.94 s [algebraic-graphs] OK: concat $ bfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,4,1,5]
  20239. 1166.94 s [algebraic-graphs] OK: map concat . transpose . map levels . bfsForest x == bfs x
  20240. 1166.94 s [algebraic-graphs]
  20241. 1166.94 s [algebraic-graphs] ============ AdjacencyIntMap.dfsForest ============
  20242. 1166.94 s [algebraic-graphs] OK: forest $ dfsForest empty == empty
  20243. 1166.94 s [algebraic-graphs] OK: forest $ dfsForest (edge 1 1) == vertex 1
  20244. 1166.94 s [algebraic-graphs] OK: forest $ dfsForest (edge 1 2) == edge 1 2
  20245. 1166.94 s [algebraic-graphs] OK: forest $ dfsForest (edge 2 1) == vertices [1,2]
  20246. 1166.94 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForest x) x == True
  20247. 1166.94 s [algebraic-graphs] OK: isDfsForestOf (dfsForest x) x == True
  20248. 1166.94 s [algebraic-graphs] OK: dfsForest . forest . dfsForest == dfsForest
  20249. 1166.94 s [algebraic-graphs] OK: dfsForest (vertices vs) == map (\v -> Node v []) (nub $ sort vs)
  20250. 1166.94 s [algebraic-graphs] OK: dfsForest $ 3 * (1 + 4) * (1 + 5) == <correct result>
  20251. 1166.94 s [algebraic-graphs] OK: forest (dfsForest $ circuit [1..5] + circuit [5,4..1]) == path [1,2,3,4,5]
  20252. 1166.94 s [algebraic-graphs]
  20253. 1166.94 s [algebraic-graphs] ============ AdjacencyIntMap.dfsForestFrom ============
  20254. 1166.94 s [algebraic-graphs] OK: forest $ dfsForestFrom empty vs == empty
  20255. 1166.94 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 1) [1] == vertex 1
  20256. 1166.94 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [0] == empty
  20257. 1166.94 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1] == edge 1 2
  20258. 1166.94 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2] == vertex 2
  20259. 1166.94 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1,2] == edge 1 2
  20260. 1166.94 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2,1] == vertices [1,2]
  20261. 1166.94 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForestFrom x vs) x == True
  20262. 1166.94 s [algebraic-graphs] OK: isDfsForestOf (dfsForestFrom x (vertexList x)) x == True
  20263. 1166.94 s [algebraic-graphs] OK: dfsForestFrom x (vertexList x) == dfsForest x
  20264. 1166.94 s [algebraic-graphs] OK: dfsForestFrom x [] == []
  20265. 1166.94 s [algebraic-graphs] OK: dfsForestFrom (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
  20266. 1166.94 s [algebraic-graphs] OK: forest $ dfsForestFrom (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1,5,4]
  20267. 1166.94 s [algebraic-graphs]
  20268. 1166.94 s [algebraic-graphs] ============ AdjacencyIntMap.dfs ============
  20269. 1166.94 s [algebraic-graphs] OK: dfs empty vs == []
  20270. 1166.94 s [algebraic-graphs] OK: dfs (edge 1 1) [1] == [1]
  20271. 1166.94 s [algebraic-graphs] OK: dfs (edge 1 2) [0] == []
  20272. 1166.94 s [algebraic-graphs] OK: dfs (edge 1 2) [1] == [1,2]
  20273. 1166.94 s [algebraic-graphs] OK: dfs (edge 1 2) [2] == [2]
  20274. 1166.94 s [algebraic-graphs] OK: dfs (edge 1 2) [1,2] == [1,2]
  20275. 1166.94 s [algebraic-graphs] OK: dfs (edge 1 2) [2,1] == [2,1]
  20276. 1166.94 s [algebraic-graphs] OK: dfs x [] == []
  20277. 1166.94 s [algebraic-graphs]
  20278. 1166.94 s [algebraic-graphs] OK: and [ hasVertex v x | v <- dfs x vs ] == True
  20279. 1166.94 s [algebraic-graphs] OK: dfs (3 * (1 + 4) * (1 + 5)) [1,4] == [1,5,4]
  20280. 1166.94 s [algebraic-graphs] OK: dfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,1,5,4]
  20281. 1166.94 s [algebraic-graphs]
  20282. 1166.94 s [algebraic-graphs] ============ AdjacencyIntMap.dfs ============
  20283. 1166.94 s [algebraic-graphs] OK: reachable empty x == []
  20284. 1166.94 s [algebraic-graphs] OK: reachable (vertex 1) 1 == [1]
  20285. 1166.94 s [algebraic-graphs] OK: reachable (edge 1 1) 1 == [1]
  20286. 1166.94 s [algebraic-graphs] OK: reachable (edge 1 2) 0 == []
  20287. 1166.94 s [algebraic-graphs] OK: reachable (edge 1 2) 1 == [1,2]
  20288. 1166.94 s [algebraic-graphs] OK: reachable (edge 1 2) 2 == [2]
  20289. 1166.94 s [algebraic-graphs] OK: reachable (path [1..8] ) 4 == [4..8]
  20290. 1166.94 s [algebraic-graphs] OK: reachable (circuit [1..8] ) 4 == [4..8] ++ [1..3]
  20291. 1166.94 s [algebraic-graphs] OK: reachable (clique [8,7..1]) 8 == [8] ++ [1..7]
  20292. 1166.94 s [algebraic-graphs]
  20293. 1166.94 s [algebraic-graphs] OK: and [ hasVertex v x | v <- reachable x y ] == True
  20294. 1166.94 s [algebraic-graphs]
  20295. 1166.94 s [algebraic-graphs] ============ AdjacencyIntMap.topSort ============
  20296. 1166.94 s [algebraic-graphs] OK: topSort (1 * 2 + 3 * 1) == Right [3,1,2]
  20297. 1166.94 s [algebraic-graphs] OK: topSort (path [1..5]) == Right [1..5]
  20298. 1166.94 s [algebraic-graphs] OK: topSort (3 * (1 * 4 + 2 * 5)) == Right [3,1,2,4,5]
  20299. 1166.94 s [algebraic-graphs] OK: topSort (1 * 2 + 2 * 1) == Left (2 :| [1])
  20300. 1166.94 s [algebraic-graphs] OK: topSort (path [5,4..1] + edge 2 4) == Left (4 :| [3,2])
  20301. 1166.94 s [algebraic-graphs] OK: topSort (circuit [1..5]) == Left (3 :| [1,2])
  20302. 1166.94 s [algebraic-graphs] OK: topSort (circuit [1..3] + circuit [3,2,1]) == Left (3 :| [2])
  20303. 1166.94 s [algebraic-graphs] OK: topSort (1 * 2 + (5 + 2) * 1 + 3 * 4 * 3) == Left (1 :| [2])
  20304. 1166.94 s [algebraic-graphs] OK: fmap (flip isTopSortOf x) (topSort x) /= Right False
  20305. 1166.94 s [algebraic-graphs] OK: topSort . vertices == Right . nub . sort
  20306. 1166.94 s [algebraic-graphs]
  20307. 1166.94 s [algebraic-graphs] ============ AdjacencyIntMap.testIsAcyclic ============
  20308. 1166.94 s [algebraic-graphs] OK: isAcyclic (1 * 2 + 3 * 1) == True
  20309. 1166.94 s [algebraic-graphs] OK: isAcyclic (1 * 2 + 2 * 1) == False
  20310. 1166.94 s [algebraic-graphs] OK: isAcyclic . circuit == null
  20311. 1166.94 s [algebraic-graphs] OK: isAcyclic == isRight . topSort
  20312. 1166.94 s [algebraic-graphs]
  20313. 1166.94 s [algebraic-graphs] ============ AdjacencyIntMap.isDfsForestOf ============
  20314. 1166.94 s [algebraic-graphs] OK: isDfsForestOf [] empty == True
  20315. 1166.94 s [algebraic-graphs] OK: isDfsForestOf [] (vertex 1) == False
  20316. 1166.94 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 1) == True
  20317. 1166.94 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 2) == False
  20318. 1166.94 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 1 []] (vertex 1) == False
  20319. 1166.94 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 1) == True
  20320. 1166.94 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 2) == False
  20321. 1166.94 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (edge 1 2) == False
  20322. 1166.94 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (edge 1 2) == True
  20323. 1166.94 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (edge 1 2) == True
  20324. 1166.94 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (vertices [1,2]) == True
  20325. 1166.94 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (vertices [1,2]) == True
  20326. 1166.94 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (vertices [1,2]) == False
  20327. 1171.49 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 [Node 3 []]]] (path [1,2,3]) == True
  20328. 1171.49 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 3 [Node 2 []]]] (path [1,2,3]) == False
  20329. 1171.56 s [algebraic-graphs] OK: isDfsForestOf [Node 3 [], Node 1 [Node 2 []]] (path [1,2,3]) == True
  20330. 1171.56 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [Node 3 []], Node 1 []] (path [1,2,3]) == True
  20331. 1171.56 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 [Node 3 []]] (path [1,2,3]) == False
  20332. 1171.56 s [algebraic-graphs]
  20333. 1171.56 s [algebraic-graphs] ============ AdjacencyIntMap.isTopSortOf ============
  20334. 1171.56 s [algebraic-graphs] OK: isTopSortOf [3,1,2] (1 * 2 + 3 * 1) == True
  20335. 1171.56 s [algebraic-graphs] OK: isTopSortOf [1,2,3] (1 * 2 + 3 * 1) == False
  20336. 1171.56 s [algebraic-graphs] OK: isTopSortOf [] (1 * 2 + 3 * 1) == False
  20337. 1171.56 s [algebraic-graphs] OK: isTopSortOf [] empty == True
  20338. 1171.56 s [algebraic-graphs] OK: isTopSortOf [x] (vertex x) == True
  20339. 1171.56 s [algebraic-graphs] OK: isTopSortOf [x] (edge x x) == False
  20340. 1171.56 s [algebraic-graphs]
  20341. 1171.56 s [algebraic-graphs] ============ AdjacencyMap ============
  20342. 1171.56 s [algebraic-graphs] OK: Axioms of graphs
  20343. 1171.56 s [algebraic-graphs]
  20344. 1171.56 s [algebraic-graphs] ============ AdjacencyMap.consistent ============
  20345. 1171.56 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  20346. 1171.56 s [algebraic-graphs]
  20347. 1171.56 s [algebraic-graphs] OK: consistent empty == True
  20348. 1171.56 s [algebraic-graphs] OK: consistent (vertex x) == True
  20349. 1171.56 s [algebraic-graphs] OK: consistent (overlay x y) == True
  20350. 1171.56 s [algebraic-graphs] OK: consistent (connect x y) == True
  20351. 1171.56 s [algebraic-graphs] OK: consistent (edge x y) == True
  20352. 1171.56 s [algebraic-graphs] OK: consistent (edges xs) == True
  20353. 1171.56 s [algebraic-graphs] OK: consistent (stars xs) == True
  20354. 1171.56 s [algebraic-graphs]
  20355. 1171.56 s [algebraic-graphs] ============ AdjacencyMap.Show ============
  20356. 1171.56 s [algebraic-graphs] OK: show (empty ) == "empty"
  20357. 1171.56 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  20358. 1171.56 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  20359. 1171.56 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  20360. 1171.56 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  20361. 1171.56 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  20362. 1171.56 s [algebraic-graphs]
  20363. 1171.56 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  20364. 1171.56 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  20365. 1171.56 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  20366. 1171.56 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  20367. 1171.56 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  20368. 1171.56 s [algebraic-graphs]
  20369. 1171.56 s [algebraic-graphs] ============ AdjacencyMap.Ord ============
  20370. 1171.56 s [algebraic-graphs] OK: vertex 1 < vertex 2
  20371. 1171.56 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  20372. 1171.56 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  20373. 1171.56 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  20374. 1171.56 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  20375. 1171.56 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  20376. 1171.56 s [algebraic-graphs] OK: x <= x + y
  20377. 1171.56 s [algebraic-graphs] OK: x + y <= x * y
  20378. 1171.56 s [algebraic-graphs]
  20379. 1171.56 s [algebraic-graphs] ============ AdjacencyMap.empty ============
  20380. 1171.56 s [algebraic-graphs] OK: isEmpty empty == True
  20381. 1171.56 s [algebraic-graphs] OK: hasVertex x empty == False
  20382. 1171.56 s [algebraic-graphs] OK: vertexCount empty == 0
  20383. 1171.56 s [algebraic-graphs] OK: edgeCount empty == 0
  20384. 1171.56 s [algebraic-graphs]
  20385. 1171.56 s [algebraic-graphs] ============ AdjacencyMap.vertex ============
  20386. 1171.56 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  20387. 1171.56 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20388. 1171.56 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20389. 1171.56 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20390. 1171.56 s [algebraic-graphs]
  20391. 1171.56 s [algebraic-graphs] ============ AdjacencyMap.edge ============
  20392. 1171.56 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  20393. 1171.56 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  20394. 1171.56 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  20395. 1171.56 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  20396. 1171.56 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  20397. 1171.56 s [algebraic-graphs]
  20398. 1171.56 s [algebraic-graphs] ============ AdjacencyMap.overlay ============
  20399. 1171.56 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  20400. 1171.56 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  20401. 1171.56 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  20402. 1171.56 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  20403. 1171.56 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  20404. 1171.56 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  20405. 1171.56 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  20406. 1171.56 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  20407. 1171.56 s [algebraic-graphs]
  20408. 1171.56 s [algebraic-graphs] ============ AdjacencyMap.connect ============
  20409. 1171.56 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  20410. 1171.56 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  20411. 1171.56 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  20412. 1171.56 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  20413. 1171.56 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  20414. 1171.56 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  20415. 1171.56 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  20416. 1171.56 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  20417. 1171.56 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  20418. 1171.56 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  20419. 1171.56 s [algebraic-graphs]
  20420. 1171.56 s [algebraic-graphs] ============ AdjacencyMap.vertices ============
  20421. 1171.56 s [algebraic-graphs] OK: vertices [] == empty
  20422. 1171.56 s [algebraic-graphs] OK: vertices [x] == vertex x
  20423. 1171.56 s [algebraic-graphs] OK: vertices == overlays . map vertex
  20424. 1171.56 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  20425. 1171.56 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  20426. 1171.56 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  20427. 1171.56 s [algebraic-graphs]
  20428. 1171.56 s [algebraic-graphs] ============ AdjacencyMap.edges ============
  20429. 1171.56 s [algebraic-graphs] OK: edges [] == empty
  20430. 1171.56 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  20431. 1171.56 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  20432. 1171.56 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  20433. 1171.56 s [algebraic-graphs]
  20434. 1171.56 s [algebraic-graphs] ============ AdjacencyMap.overlays ============
  20435. 1171.56 s [algebraic-graphs] OK: overlays [] == empty
  20436. 1171.56 s [algebraic-graphs] OK: overlays [x] == x
  20437. 1171.56 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  20438. 1171.56 s [algebraic-graphs] OK: overlays == foldr overlay empty
  20439. 1171.56 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  20440. 1171.56 s [algebraic-graphs]
  20441. 1171.56 s [algebraic-graphs] ============ AdjacencyMap.connects ============
  20442. 1171.56 s [algebraic-graphs] OK: connects [] == empty
  20443. 1171.56 s [algebraic-graphs] OK: connects [x] == x
  20444. 1171.56 s [algebraic-graphs] OK: connects [x,y] == connect x y
  20445. 1171.56 s [algebraic-graphs] OK: connects == foldr connect empty
  20446. 1171.56 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  20447. 1171.56 s [algebraic-graphs]
  20448. 1171.56 s [algebraic-graphs] ============ AdjacencyMap.fromAdjacencySets ============
  20449. 1171.56 s [algebraic-graphs] OK: fromAdjacencySets [] == empty
  20450. 1171.56 s [algebraic-graphs] OK: fromAdjacencySets [(x, Set.empty)] == vertex x
  20451. 1171.56 s [algebraic-graphs] OK: fromAdjacencySets [(x, Set.singleton y)] == edge x y
  20452. 1171.56 s [algebraic-graphs] OK: fromAdjacencySets . map (fmap Set.fromList) == stars
  20453. 1171.56 s [algebraic-graphs] OK: overlay (fromAdjacencySets xs) (fromAdjacencySets ys) == fromAdjacencySets (xs ++ ys)
  20454. 1171.56 s [algebraic-graphs]
  20455. 1171.56 s [algebraic-graphs] ============ AdjacencyMap.isSubgraphOf ============
  20456. 1171.56 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  20457. 1171.56 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  20458. 1171.56 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  20459. 1171.56 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  20460. 1171.56 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  20461. 1171.56 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  20462. 1171.56 s [algebraic-graphs]
  20463. 1171.56 s [algebraic-graphs] ============ AdjacencyMap.toGraph et al. ============
  20464. 1171.56 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  20465. 1171.56 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  20466. 1171.56 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  20467. 1171.56 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  20468. 1171.56 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  20469. 1171.56 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  20470. 1171.56 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  20471. 1171.56 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  20472. 1171.56 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  20473. 1171.56 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  20474. 1171.56 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  20475. 1171.56 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  20476. 1171.56 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  20477. 1171.56 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  20478. 1171.56 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  20479. 1171.56 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  20480. 1171.56 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  20481. 1171.56 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  20482. 1171.56 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  20483. 1171.56 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  20484. 1171.56 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  20485. 1171.56 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  20486. 1171.56 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  20487. 1171.56 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  20488. 1171.56 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  20489. 1171.56 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  20490. 1171.56 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  20491. 1171.56 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  20492. 1171.56 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  20493. 1171.56 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  20494. 1171.56 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  20495. 1171.56 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  20496. 1171.56 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  20497. 1173.32 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  20498. 1173.32 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  20499. 1173.32 s [algebraic-graphs]
  20500. 1173.32 s [algebraic-graphs] ============ AdjacencyMap.foldg ============
  20501. 1173.32 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  20502. 1173.32 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  20503. 1173.32 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  20504. 1173.32 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  20505. 1173.32 s [algebraic-graphs]
  20506. 1173.32 s [algebraic-graphs] ============ AdjacencyMap.isEmpty ============
  20507. 1173.32 s [algebraic-graphs] OK: isEmpty empty == True
  20508. 1173.32 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  20509. 1173.32 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  20510. 1173.32 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  20511. 1173.32 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  20512. 1173.32 s [algebraic-graphs]
  20513. 1173.32 s [algebraic-graphs] ============ AdjacencyMap.hasVertex ============
  20514. 1173.32 s [algebraic-graphs] OK: hasVertex x empty == False
  20515. 1173.32 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20516. 1173.32 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  20517. 1173.32 s [algebraic-graphs]
  20518. 1173.32 s [algebraic-graphs] ============ AdjacencyMap.hasEdge ============
  20519. 1173.32 s [algebraic-graphs] OK: hasEdge x y empty == False
  20520. 1173.32 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  20521. 1173.32 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  20522. 1173.32 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  20523. 1173.32 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  20524. 1173.32 s [algebraic-graphs]
  20525. 1173.32 s [algebraic-graphs] ============ AdjacencyMap.vertexCount ============
  20526. 1173.32 s [algebraic-graphs] OK: vertexCount empty == 0
  20527. 1173.32 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20528. 1173.32 s [algebraic-graphs] OK: vertexCount == length . vertexList
  20529. 1173.32 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  20530. 1173.32 s [algebraic-graphs]
  20531. 1173.32 s [algebraic-graphs] ============ AdjacencyMap.edgeCount ============
  20532. 1173.32 s [algebraic-graphs] OK: edgeCount empty == 0
  20533. 1173.32 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20534. 1173.32 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  20535. 1173.32 s [algebraic-graphs] OK: edgeCount == length . edgeList
  20536. 1173.32 s [algebraic-graphs]
  20537. 1173.32 s [algebraic-graphs] ============ AdjacencyMap.vertexList ============
  20538. 1173.32 s [algebraic-graphs] OK: vertexList empty == []
  20539. 1173.32 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  20540. 1173.32 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  20541. 1173.32 s [algebraic-graphs]
  20542. 1173.32 s [algebraic-graphs] ============ AdjacencyMap.vertexSet ============
  20543. 1173.32 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  20544. 1173.32 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  20545. 1173.32 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  20546. 1173.32 s [algebraic-graphs]
  20547. 1173.32 s [algebraic-graphs] ============ AdjacencyMap.vertexIntSet ============
  20548. 1173.32 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  20549. 1173.32 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  20550. 1173.32 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  20551. 1173.32 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  20552. 1173.32 s [algebraic-graphs]
  20553. 1173.32 s [algebraic-graphs] ============ AdjacencyMap.edgeList ============
  20554. 1173.32 s [algebraic-graphs] OK: edgeList empty == []
  20555. 1173.32 s [algebraic-graphs] OK: edgeList (vertex x) == []
  20556. 1173.32 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  20557. 1173.32 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  20558. 1173.32 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  20559. 1173.32 s [algebraic-graphs]
  20560. 1173.32 s [algebraic-graphs] ============ AdjacencyMap.edgeSet ============
  20561. 1173.32 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  20562. 1173.32 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  20563. 1173.32 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  20564. 1173.32 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  20565. 1173.32 s [algebraic-graphs]
  20566. 1173.32 s [algebraic-graphs] ============ AdjacencyMap.adjacencyList ============
  20567. 1173.32 s [algebraic-graphs] OK: adjacencyList empty == []
  20568. 1173.32 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  20569. 1173.32 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  20570. 1173.32 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  20571. 1173.32 s [algebraic-graphs]
  20572. 1173.32 s [algebraic-graphs] ============ AdjacencyMap.preSet ============
  20573. 1173.32 s [algebraic-graphs] OK: preSet x empty == Set.empty
  20574. 1173.32 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  20575. 1173.32 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  20576. 1173.32 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  20577. 1173.32 s [algebraic-graphs]
  20578. 1173.32 s [algebraic-graphs] ============ AdjacencyMap.preIntSet ============
  20579. 1173.32 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  20580. 1173.32 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  20581. 1173.32 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  20582. 1173.32 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  20583. 1173.32 s [algebraic-graphs]
  20584. 1173.32 s [algebraic-graphs] ============ AdjacencyMap.postSet ============
  20585. 1173.32 s [algebraic-graphs] OK: postSet x empty == Set.empty
  20586. 1173.32 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  20587. 1173.32 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  20588. 1173.32 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  20589. 1173.32 s [algebraic-graphs]
  20590. 1173.32 s [algebraic-graphs] ============ AdjacencyMap.postIntSet ============
  20591. 1173.32 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  20592. 1173.32 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  20593. 1173.32 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  20594. 1173.32 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  20595. 1173.32 s [algebraic-graphs]
  20596. 1173.32 s [algebraic-graphs] ============ AdjacencyMap.path ============
  20597. 1173.32 s [algebraic-graphs] OK: path [] == empty
  20598. 1173.32 s [algebraic-graphs] OK: path [x] == vertex x
  20599. 1173.32 s [algebraic-graphs] OK: path [x,y] == edge x y
  20600. 1173.32 s [algebraic-graphs]
  20601. 1173.32 s [algebraic-graphs] ============ AdjacencyMap.circuit ============
  20602. 1173.32 s [algebraic-graphs] OK: circuit [] == empty
  20603. 1173.32 s [algebraic-graphs] OK: circuit [x] == edge x x
  20604. 1173.32 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  20605. 1173.32 s [algebraic-graphs]
  20606. 1173.32 s [algebraic-graphs] ============ AdjacencyMap.clique ============
  20607. 1173.32 s [algebraic-graphs] OK: clique [] == empty
  20608. 1173.32 s [algebraic-graphs] OK: clique [x] == vertex x
  20609. 1173.32 s [algebraic-graphs] OK: clique [x,y] == edge x y
  20610. 1173.32 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  20611. 1173.32 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  20612. 1173.32 s [algebraic-graphs]
  20613. 1173.32 s [algebraic-graphs] ============ AdjacencyMap.biclique ============
  20614. 1173.32 s [algebraic-graphs] OK: biclique [] [] == empty
  20615. 1173.32 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  20616. 1173.32 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  20617. 1173.32 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  20618. 1173.32 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  20619. 1173.32 s [algebraic-graphs]
  20620. 1173.32 s [algebraic-graphs] ============ AdjacencyMap.star ============
  20621. 1173.32 s [algebraic-graphs] OK: star x [] == vertex x
  20622. 1173.32 s [algebraic-graphs] OK: star x [y] == edge x y
  20623. 1173.32 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  20624. 1173.32 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  20625. 1173.32 s [algebraic-graphs]
  20626. 1173.32 s [algebraic-graphs] ============ AdjacencyMap.stars ============
  20627. 1173.32 s [algebraic-graphs] OK: stars [] == empty
  20628. 1173.32 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  20629. 1173.32 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  20630. 1173.32 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  20631. 1173.32 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  20632. 1173.32 s [algebraic-graphs] OK: stars . adjacencyList == id
  20633. 1173.32 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  20634. 1173.32 s [algebraic-graphs]
  20635. 1173.32 s [algebraic-graphs] ============ AdjacencyMap.tree ============
  20636. 1173.32 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  20637. 1173.32 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  20638. 1173.32 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  20639. 1173.32 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  20640. 1173.32 s [algebraic-graphs]
  20641. 1173.32 s [algebraic-graphs] ============ AdjacencyMap.forest ============
  20642. 1173.32 s [algebraic-graphs] OK: forest [] == empty
  20643. 1173.32 s [algebraic-graphs] OK: forest [x] == tree x
  20644. 1173.32 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  20645. 1173.32 s [algebraic-graphs] OK: forest == overlays . map tree
  20646. 1173.32 s [algebraic-graphs]
  20647. 1173.32 s [algebraic-graphs] ============ AdjacencyMap.removeVertex ============
  20648. 1173.32 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  20649. 1173.32 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  20650. 1173.32 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  20651. 1173.32 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  20652. 1173.32 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  20653. 1173.32 s [algebraic-graphs]
  20654. 1173.32 s [algebraic-graphs] ============ AdjacencyMap.removeEdge ============
  20655. 1173.32 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  20656. 1173.32 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  20657. 1173.32 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  20658. 1173.32 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  20659. 1173.32 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  20660. 1173.32 s [algebraic-graphs]
  20661. 1173.32 s [algebraic-graphs] ============ AdjacencyMap.replaceVertex ============
  20662. 1173.32 s [algebraic-graphs] OK: replaceVertex x x == id
  20663. 1173.32 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  20664. 1173.32 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  20665. 1173.32 s [algebraic-graphs]
  20666. 1173.32 s [algebraic-graphs] ============ AdjacencyMap.mergeVertices ============
  20667. 1173.32 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  20668. 1173.32 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  20669. 1173.32 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  20670. 1173.32 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  20671. 1173.32 s [algebraic-graphs]
  20672. 1173.32 s [algebraic-graphs] ============ AdjacencyMap.transpose ============
  20673. 1173.32 s [algebraic-graphs] OK: transpose empty == empty
  20674. 1173.32 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  20675. 1173.32 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  20676. 1173.32 s [algebraic-graphs] OK: transpose . transpose == id
  20677. 1173.32 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  20678. 1173.32 s [algebraic-graphs]
  20679. 1173.32 s [algebraic-graphs] ============ AdjacencyMap.gmap ============
  20680. 1173.32 s [algebraic-graphs] OK: gmap f empty == empty
  20681. 1173.32 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  20682. 1173.32 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  20683. 1173.32 s [algebraic-graphs] OK: gmap id == id
  20684. 1173.32 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  20685. 1173.32 s [algebraic-graphs]
  20686. 1173.32 s [algebraic-graphs] ============ AdjacencyMap.induce ============
  20687. 1173.32 s [algebraic-graphs] OK: induce (const True ) x == x
  20688. 1173.32 s [algebraic-graphs] OK: induce (const False) x == empty
  20689. 1173.32 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  20690. 1173.32 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  20691. 1173.32 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  20692. 1173.32 s [algebraic-graphs]
  20693. 1173.32 s [algebraic-graphs] ============ AdjacencyMap.compose ============
  20694. 1173.32 s [algebraic-graphs] OK: compose empty x == empty
  20695. 1173.32 s [algebraic-graphs] OK: compose x empty == empty
  20696. 1173.32 s [algebraic-graphs] OK: compose (vertex x) y == empty
  20697. 1173.32 s [algebraic-graphs] OK: compose x (vertex y) == empty
  20698. 1173.32 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  20699. 1173.32 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  20700. 1176.75 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  20701. 1176.75 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  20702. 1176.79 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  20703. 1176.79 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  20704. 1176.79 s [algebraic-graphs]
  20705. 1176.79 s [algebraic-graphs] ============ AdjacencyMap.closure ============
  20706. 1176.79 s [algebraic-graphs] OK: closure empty == empty
  20707. 1176.79 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  20708. 1176.79 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  20709. 1176.79 s [algebraic-graphs] OK: closure (edge x y) == edges [(x,x), (x,y), (y,y)]
  20710. 1176.79 s [algebraic-graphs] OK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
  20711. 1176.79 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  20712. 1176.79 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  20713. 1176.79 s [algebraic-graphs] OK: closure . closure == closure
  20714. 1176.79 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  20715. 1176.79 s [algebraic-graphs]
  20716. 1176.79 s [algebraic-graphs] ============ AdjacencyMap.reflexiveClosure ============
  20717. 1176.79 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  20718. 1176.79 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  20719. 1176.79 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  20720. 1176.79 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges [(x,x), (x,y), (y,y)]
  20721. 1176.79 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  20722. 1176.79 s [algebraic-graphs]
  20723. 1176.79 s [algebraic-graphs] ============ AdjacencyMap.symmetricClosure ============
  20724. 1176.79 s [algebraic-graphs] OK: symmetricClosure empty == empty
  20725. 1176.79 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  20726. 1176.79 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges [(x,y), (y,x)]
  20727. 1176.79 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  20728. 1176.79 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  20729. 1176.79 s [algebraic-graphs]
  20730. 1176.79 s [algebraic-graphs] ============ AdjacencyMap.transitiveClosure ============
  20731. 1176.80 s [algebraic-graphs] OK: transitiveClosure empty == empty
  20732. 1176.80 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  20733. 1176.80 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  20734. 1176.80 s [algebraic-graphs] OK: transitiveClosure (path $ nub xs) == clique (nub $ xs)
  20735. 1176.80 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  20736. 1176.80 s [algebraic-graphs]
  20737. 1176.80 s [algebraic-graphs] ============ AdjacencyMap.box ============
  20738. 1176.80 s [algebraic-graphs] OK: box x y ~~ box y x
  20739. 1176.80 s [algebraic-graphs] OK: box x (overlay y z) == overlay (box x y) (box x z)
  20740. 1176.80 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  20741. 1176.80 s [algebraic-graphs] OK: box x empty ~~ empty
  20742. 1176.80 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  20743. 1176.80 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  20744. 1176.80 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  20745. 1176.80 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  20746. 1176.80 s [algebraic-graphs]
  20747. 1176.80 s [algebraic-graphs] ============ AdjacencyMap.bfsForest ============
  20748. 1176.80 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0] == empty
  20749. 1176.80 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [1] == edge 1 2
  20750. 1176.80 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2] == vertex 2
  20751. 1176.80 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0,1,2] == vertices [1,2]
  20752. 1176.80 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2,1,0] == vertices [1,2]
  20753. 1176.80 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 1) [1] == vertex 1
  20754. 1176.80 s [algebraic-graphs] OK: isSubgraphOf (forest $ bfsForest x vs) x == True
  20755. 1176.80 s [algebraic-graphs] OK: bfsForest x (vertexList x) == map ( -> Node v []) (nub $ vertexList x)
  20756. 1176.80 s [algebraic-graphs] OK: bfsForest x [] == []
  20757. 1176.80 s [algebraic-graphs] OK: bfsForest empty vs == []
  20758. 1176.80 s [algebraic-graphs] OK: bfsForest (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
  20759. 1176.80 s [algebraic-graphs] OK: forest $ bfsForest (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1] + path [3,4,5]
  20760. 1176.80 s [algebraic-graphs]
  20761. 1176.80 s [algebraic-graphs] ============ AdjacencyMap.bfs ============
  20762. 1176.80 s [algebraic-graphs] OK: bfs (edge 1 2) [0] == []
  20763. 1176.80 s [algebraic-graphs] OK: bfs (edge 1 2) [1] == [[1], [2]]
  20764. 1176.80 s [algebraic-graphs] OK: bfs (edge 1 2) [2] == [[2]]
  20765. 1176.80 s [algebraic-graphs] OK: bfs (edge 1 2) [1,2] == [[1,2]]
  20766. 1176.80 s [algebraic-graphs] OK: bfs (edge 1 2) [2,1] == [[2,1]]
  20767. 1176.80 s [algebraic-graphs] OK: bfs (edge 1 1) [1] == [[1]]
  20768. 1176.80 s [algebraic-graphs] OK: bfs empty vs == []
  20769. 1176.80 s [algebraic-graphs] OK: bfs x [] == []
  20770. 1176.80 s [algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,2] == [[1,2]]
  20771. 1176.80 s [algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,3] == [[1,3], [2,4]]
  20772. 1176.80 s [algebraic-graphs] OK: bfs (3 * (1 + 4) * (1 + 5)) [3] == [[3], [1,4,5]]
  20773. 1176.80 s [algebraic-graphs] OK: bfs (circuit [1..5] + circuit [5,4..1]) [2] == [[2], [1,3], [5,4]]
  20774. 1176.80 s [algebraic-graphs] OK: concat $ bfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,4,1,5]
  20775. 1176.80 s [algebraic-graphs] OK: map concat . transpose . map levels . bfsForest x == bfs x
  20776. 1176.80 s [algebraic-graphs]
  20777. 1176.80 s [algebraic-graphs] ============ AdjacencyMap.dfsForest ============
  20778. 1176.80 s [algebraic-graphs] OK: forest $ dfsForest empty == empty
  20779. 1176.80 s [algebraic-graphs] OK: forest $ dfsForest (edge 1 1) == vertex 1
  20780. 1176.80 s [algebraic-graphs] OK: forest $ dfsForest (edge 1 2) == edge 1 2
  20781. 1176.80 s [algebraic-graphs] OK: forest $ dfsForest (edge 2 1) == vertices [1,2]
  20782. 1176.80 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForest x) x == True
  20783. 1176.80 s [algebraic-graphs] OK: isDfsForestOf (dfsForest x) x == True
  20784. 1176.80 s [algebraic-graphs] OK: dfsForest . forest . dfsForest == dfsForest
  20785. 1176.80 s [algebraic-graphs] OK: dfsForest (vertices vs) == map (\v -> Node v []) (nub $ sort vs)
  20786. 1176.80 s [algebraic-graphs] OK: dfsForest $ 3 * (1 + 4) * (1 + 5) == <correct result>
  20787. 1176.80 s [algebraic-graphs] OK: forest (dfsForest $ circuit [1..5] + circuit [5,4..1]) == path [1,2,3,4,5]
  20788. 1176.80 s [algebraic-graphs]
  20789. 1176.80 s [algebraic-graphs] ============ AdjacencyMap.dfsForestFrom ============
  20790. 1176.80 s [algebraic-graphs] OK: forest $ dfsForestFrom empty vs == empty
  20791. 1176.80 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 1) [1] == vertex 1
  20792. 1176.80 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [0] == empty
  20793. 1176.80 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1] == edge 1 2
  20794. 1176.80 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2] == vertex 2
  20795. 1176.80 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1,2] == edge 1 2
  20796. 1176.80 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2,1] == vertices [1,2]
  20797. 1176.80 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForestFrom x vs) x == True
  20798. 1176.80 s [algebraic-graphs] OK: isDfsForestOf (dfsForestFrom x (vertexList x)) x == True
  20799. 1176.80 s [algebraic-graphs] OK: dfsForestFrom x (vertexList x) == dfsForest x
  20800. 1176.80 s [algebraic-graphs] OK: dfsForestFrom x [] == []
  20801. 1176.80 s [algebraic-graphs] OK: dfsForestFrom (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
  20802. 1176.80 s [algebraic-graphs] OK: forest $ dfsForestFrom (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1,5,4]
  20803. 1176.80 s [algebraic-graphs]
  20804. 1176.80 s [algebraic-graphs] ============ AdjacencyMap.dfs ============
  20805. 1176.80 s [algebraic-graphs] OK: dfs empty vs == []
  20806. 1176.80 s [algebraic-graphs] OK: dfs (edge 1 1) [1] == [1]
  20807. 1176.80 s [algebraic-graphs] OK: dfs (edge 1 2) [0] == []
  20808. 1176.80 s [algebraic-graphs] OK: dfs (edge 1 2) [1] == [1,2]
  20809. 1176.80 s [algebraic-graphs] OK: dfs (edge 1 2) [2] == [2]
  20810. 1176.80 s [algebraic-graphs] OK: dfs (edge 1 2) [1,2] == [1,2]
  20811. 1176.80 s [algebraic-graphs] OK: dfs (edge 1 2) [2,1] == [2,1]
  20812. 1176.80 s [algebraic-graphs] OK: dfs x [] == []
  20813. 1176.80 s [algebraic-graphs]
  20814. 1176.80 s [algebraic-graphs] OK: and [ hasVertex v x | v <- dfs x vs ] == True
  20815. 1176.80 s [algebraic-graphs] OK: dfs (3 * (1 + 4) * (1 + 5)) [1,4] == [1,5,4]
  20816. 1176.80 s [algebraic-graphs] OK: dfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,1,5,4]
  20817. 1176.80 s [algebraic-graphs]
  20818. 1176.80 s [algebraic-graphs] ============ AdjacencyMap.dfs ============
  20819. 1176.80 s [algebraic-graphs] OK: reachable empty x == []
  20820. 1176.80 s [algebraic-graphs] OK: reachable (vertex 1) 1 == [1]
  20821. 1176.80 s [algebraic-graphs] OK: reachable (edge 1 1) 1 == [1]
  20822. 1176.80 s [algebraic-graphs] OK: reachable (edge 1 2) 0 == []
  20823. 1176.80 s [algebraic-graphs] OK: reachable (edge 1 2) 1 == [1,2]
  20824. 1176.80 s [algebraic-graphs] OK: reachable (edge 1 2) 2 == [2]
  20825. 1176.80 s [algebraic-graphs] OK: reachable (path [1..8] ) 4 == [4..8]
  20826. 1176.80 s [algebraic-graphs] OK: reachable (circuit [1..8] ) 4 == [4..8] ++ [1..3]
  20827. 1176.80 s [algebraic-graphs] OK: reachable (clique [8,7..1]) 8 == [8] ++ [1..7]
  20828. 1176.80 s [algebraic-graphs]
  20829. 1176.80 s [algebraic-graphs] OK: and [ hasVertex v x | v <- reachable x y ] == True
  20830. 1176.80 s [algebraic-graphs]
  20831. 1176.80 s [algebraic-graphs] ============ AdjacencyMap.topSort ============
  20832. 1176.80 s [algebraic-graphs] OK: topSort (1 * 2 + 3 * 1) == Right [3,1,2]
  20833. 1176.80 s [algebraic-graphs] OK: topSort (path [1..5]) == Right [1..5]
  20834. 1176.80 s [algebraic-graphs] OK: topSort (3 * (1 * 4 + 2 * 5)) == Right [3,1,2,4,5]
  20835. 1176.80 s [algebraic-graphs] OK: topSort (1 * 2 + 2 * 1) == Left (2 :| [1])
  20836. 1176.80 s [algebraic-graphs] OK: topSort (path [5,4..1] + edge 2 4) == Left (4 :| [3,2])
  20837. 1176.80 s [algebraic-graphs] OK: topSort (circuit [1..5]) == Left (3 :| [1,2])
  20838. 1176.80 s [algebraic-graphs] OK: topSort (circuit [1..3] + circuit [3,2,1]) == Left (3 :| [2])
  20839. 1176.80 s [algebraic-graphs] OK: topSort (1 * 2 + (5 + 2) * 1 + 3 * 4 * 3) == Left (1 :| [2])
  20840. 1176.80 s [algebraic-graphs] OK: fmap (flip isTopSortOf x) (topSort x) /= Right False
  20841. 1176.80 s [algebraic-graphs] OK: topSort . vertices == Right . nub . sort
  20842. 1176.80 s [algebraic-graphs]
  20843. 1176.80 s [algebraic-graphs] ============ AdjacencyMap.testIsAcyclic ============
  20844. 1176.80 s [algebraic-graphs] OK: isAcyclic (1 * 2 + 3 * 1) == True
  20845. 1176.80 s [algebraic-graphs] OK: isAcyclic (1 * 2 + 2 * 1) == False
  20846. 1176.80 s [algebraic-graphs] OK: isAcyclic . circuit == null
  20847. 1176.80 s [algebraic-graphs] OK: isAcyclic == isRight . topSort
  20848. 1176.80 s [algebraic-graphs]
  20849. 1176.80 s [algebraic-graphs] ============ AdjacencyMap.isDfsForestOf ============
  20850. 1176.80 s [algebraic-graphs] OK: isDfsForestOf [] empty == True
  20851. 1176.80 s [algebraic-graphs] OK: isDfsForestOf [] (vertex 1) == False
  20852. 1176.80 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 1) == True
  20853. 1176.80 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 2) == False
  20854. 1176.80 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 1 []] (vertex 1) == False
  20855. 1176.80 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 1) == True
  20856. 1176.80 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 2) == False
  20857. 1183.56 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (edge 1 2) == False
  20858. 1183.56 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (edge 1 2) == True
  20859. 1183.57 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (edge 1 2) == True
  20860. 1183.57 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (vertices [1,2]) == True
  20861. 1183.57 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (vertices [1,2]) == True
  20862. 1183.57 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (vertices [1,2]) == False
  20863. 1183.57 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 [Node 3 []]]] (path [1,2,3]) == True
  20864. 1183.57 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 3 [Node 2 []]]] (path [1,2,3]) == False
  20865. 1183.57 s [algebraic-graphs] OK: isDfsForestOf [Node 3 [], Node 1 [Node 2 []]] (path [1,2,3]) == True
  20866. 1183.57 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [Node 3 []], Node 1 []] (path [1,2,3]) == True
  20867. 1183.57 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 [Node 3 []]] (path [1,2,3]) == False
  20868. 1183.57 s [algebraic-graphs]
  20869. 1183.57 s [algebraic-graphs] ============ AdjacencyMap.isTopSortOf ============
  20870. 1183.57 s [algebraic-graphs] OK: isTopSortOf [3,1,2] (1 * 2 + 3 * 1) == True
  20871. 1183.57 s [algebraic-graphs] OK: isTopSortOf [1,2,3] (1 * 2 + 3 * 1) == False
  20872. 1183.57 s [algebraic-graphs] OK: isTopSortOf [] (1 * 2 + 3 * 1) == False
  20873. 1183.57 s [algebraic-graphs] OK: isTopSortOf [] empty == True
  20874. 1183.57 s [algebraic-graphs] OK: isTopSortOf [x] (vertex x) == True
  20875. 1183.57 s [algebraic-graphs] OK: isTopSortOf [x] (edge x x) == False
  20876. 1183.57 s [algebraic-graphs]
  20877. 1183.57 s [algebraic-graphs] ============ AdjacencyMap.induceJust ============
  20878. 1183.57 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  20879. 1183.57 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  20880. 1183.57 s [algebraic-graphs] OK: induceJust . gmap Just == id
  20881. 1183.57 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  20882. 1183.57 s [algebraic-graphs]
  20883. 1183.57 s [algebraic-graphs] ============ AdjacencyMap.scc ============
  20884. 1183.57 s [algebraic-graphs] OK: scc empty == empty
  20885. 1183.57 s [algebraic-graphs] OK: scc (vertex x) == vertex (NonEmpty.vertex x)
  20886. 1183.57 s [algebraic-graphs] OK: scc (vertices xs) == vertices (map NonEmpty.vertex xs)
  20887. 1183.57 s [algebraic-graphs] OK: scc (edge 1 1) == vertex (NonEmpty.edge 1 1)
  20888. 1183.57 s [algebraic-graphs] OK: scc (edge 1 2) == edge (NonEmpty.vertex 1) (NonEmpty.vertex 2)
  20889. 1183.57 s [algebraic-graphs] OK: scc (circuit (1:xs)) == vertex (NonEmpty.circuit1 (1 :| xs))
  20890. 1183.57 s [algebraic-graphs] OK: scc (3 * 1 * 4 * 1 * 5) == <correct result>
  20891. 1183.57 s [algebraic-graphs] OK: isAcyclic . scc == const True
  20892. 1183.57 s [algebraic-graphs] OK: isAcyclic x == (scc x == gmap NonEmpty.vertex x)
  20893. 1183.57 s [algebraic-graphs] OK: scc g == KL.scc g
  20894. 1183.57 s [algebraic-graphs]
  20895. 1183.57 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Num ============
  20896. 1183.57 s [algebraic-graphs] OK: 0 == rightVertex 0
  20897. 1183.57 s [algebraic-graphs] OK: swap 1 == leftVertex 1
  20898. 1183.57 s [algebraic-graphs] OK: swap 1 + 2 == vertices [1] [2]
  20899. 1183.57 s [algebraic-graphs] OK: swap 1 * 2 == edge 1 2
  20900. 1183.57 s [algebraic-graphs] OK: swap 1 + 2 * swap 3 == overlay (leftVertex 1) (edge 3 2)
  20901. 1183.57 s [algebraic-graphs] OK: swap 1 * (2 + swap 3) == connect (leftVertex 1) (vertices [3] [2])
  20902. 1183.57 s [algebraic-graphs]
  20903. 1183.57 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Show ============
  20904. 1183.57 s [algebraic-graphs] OK: show empty == "empty"
  20905. 1183.57 s [algebraic-graphs] OK: show 1 == "rightVertex 1"
  20906. 1183.57 s [algebraic-graphs] OK: show (swap 2) == "leftVertex 2"
  20907. 1183.57 s [algebraic-graphs] OK: show 1 + 2 == "vertices [] [1,2]"
  20908. 1183.57 s [algebraic-graphs] OK: show (swap (1 + 2)) == "vertices [1,2] []"
  20909. 1183.57 s [algebraic-graphs] OK: show (swap 1 * 2) == "edge 1 2"
  20910. 1183.57 s [algebraic-graphs] OK: show (swap 1 * 2 * swap 3) == "edges [(1,2),(3,2)]"
  20911. 1183.57 s [algebraic-graphs] OK: show (swap 1 * 2 + swap 3) == "overlay (leftVertex 3) (edge 1 2)"
  20912. 1183.57 s [algebraic-graphs]
  20913. 1183.57 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Eq ============
  20914. 1183.57 s [algebraic-graphs] OK: (x == y) == (leftAdjacencyMap x == leftAdjacencyMap y && rightAdjacencyMap x == rightAdjacencyMap y)
  20915. 1183.57 s [algebraic-graphs]
  20916. 1183.57 s [algebraic-graphs] OK: x + y == y + x
  20917. 1183.57 s [algebraic-graphs] OK: x + (y + z) == (x + y) + z
  20918. 1183.57 s [algebraic-graphs] OK: x * empty == x
  20919. 1183.57 s [algebraic-graphs] OK: empty * x == x
  20920. 1183.57 s [algebraic-graphs] OK: x * y == y * x
  20921. 1183.57 s [algebraic-graphs] OK: x * (y * z) == (x * y) * z
  20922. 1183.57 s [algebraic-graphs] OK: x * (y + z) == x * y + x * z
  20923. 1183.57 s [algebraic-graphs] OK: (x + y) * z == x * z + y * z
  20924. 1183.57 s [algebraic-graphs] OK: x * y * z == x * y + x * z + y * z
  20925. 1183.57 s [algebraic-graphs] OK: x + empty == x
  20926. 1183.57 s [algebraic-graphs] OK: empty + x == x
  20927. 1183.57 s [algebraic-graphs] OK: x + x == x
  20928. 1183.57 s [algebraic-graphs] OK: x * y + x + y == x * y
  20929. 1183.57 s [algebraic-graphs] OK: x * x * x == x * x
  20930. 1183.57 s [algebraic-graphs]
  20931. 1183.57 s [algebraic-graphs] OK: leftVertex x * leftVertex y == leftVertex x + leftVertex y
  20932. 1183.57 s [algebraic-graphs] OK: rightVertex x * rightVertex y == rightVertex x + rightVertex y
  20933. 1183.57 s [algebraic-graphs]
  20934. 1183.57 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftAdjacencyMap ============
  20935. 1183.57 s [algebraic-graphs] OK: leftAdjacencyMap empty == Map.empty
  20936. 1183.57 s [algebraic-graphs] OK: leftAdjacencyMap (leftVertex x) == Map.singleton x Set.empty
  20937. 1183.57 s [algebraic-graphs] OK: leftAdjacencyMap (rightVertex x) == Map.empty
  20938. 1183.57 s [algebraic-graphs] OK: leftAdjacencyMap (edge x y) == Map.singleton x (Set.singleton y)
  20939. 1183.57 s [algebraic-graphs]
  20940. 1183.57 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightAdjacencyMap ============
  20941. 1183.57 s [algebraic-graphs] OK: rightAdjacencyMap empty == Map.empty
  20942. 1183.57 s [algebraic-graphs] OK: rightAdjacencyMap (leftVertex x) == Map.empty
  20943. 1183.57 s [algebraic-graphs] OK: rightAdjacencyMap (rightVertex x) == Map.singleton x Set.empty
  20944. 1183.57 s [algebraic-graphs] OK: rightAdjacencyMap (edge x y) == Map.singleton y (Set.singleton x)
  20945. 1183.57 s [algebraic-graphs]
  20946. 1183.57 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.empty ============
  20947. 1183.57 s [algebraic-graphs] OK: isEmpty empty == True
  20948. 1183.57 s [algebraic-graphs] OK: leftAdjacencyMap empty == Map.empty
  20949. 1183.57 s [algebraic-graphs] OK: rightAdjacencyMap empty == Map.empty
  20950. 1183.57 s [algebraic-graphs] OK: hasVertex x empty == False
  20951. 1183.57 s [algebraic-graphs]
  20952. 1183.57 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertex ============
  20953. 1183.57 s [algebraic-graphs] OK: leftAdjacencyMap (leftVertex x) == Map.singleton x Set.empty
  20954. 1183.57 s [algebraic-graphs] OK: rightAdjacencyMap (leftVertex x) == Map.empty
  20955. 1183.57 s [algebraic-graphs] OK: hasLeftVertex x (leftVertex y) == (x == y)
  20956. 1183.57 s [algebraic-graphs] OK: hasRightVertex x (leftVertex y) == False
  20957. 1183.57 s [algebraic-graphs] OK: hasEdge x y (leftVertex z) == False
  20958. 1183.57 s [algebraic-graphs]
  20959. 1183.57 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertex ============
  20960. 1183.57 s [algebraic-graphs] OK: leftAdjacencyMap (rightVertex x) == Map.empty
  20961. 1183.57 s [algebraic-graphs] OK: rightAdjacencyMap (rightVertex x) == Map.singleton x Set.empty
  20962. 1183.57 s [algebraic-graphs] OK: hasLeftVertex x (rightVertex y) == False
  20963. 1183.57 s [algebraic-graphs] OK: hasRightVertex x (rightVertex y) == (x == y)
  20964. 1183.57 s [algebraic-graphs] OK: hasEdge x y (rightVertex z) == False
  20965. 1183.57 s [algebraic-graphs]
  20966. 1183.57 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertex ============
  20967. 1183.57 s [algebraic-graphs] OK: vertex . Left == leftVertex
  20968. 1183.57 s [algebraic-graphs] OK: vertex . Right == rightVertex
  20969. 1183.57 s [algebraic-graphs]
  20970. 1183.57 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edge ============
  20971. 1183.57 s [algebraic-graphs] OK: edge x y == connect (leftVertex x) (rightVertex y)
  20972. 1183.57 s [algebraic-graphs] OK: leftAdjacencyMap (edge x y) == Map.singleton x (Set.singleton y)
  20973. 1183.57 s [algebraic-graphs] OK: rightAdjacencyMap (edge x y) == Map.singleton y (Set.singleton x)
  20974. 1183.57 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  20975. 1183.57 s [algebraic-graphs] OK: hasEdge 1 2 (edge 2 1) == False
  20976. 1183.57 s [algebraic-graphs]
  20977. 1183.57 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.overlay ============
  20978. 1183.57 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  20979. 1183.57 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  20980. 1183.57 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  20981. 1183.57 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  20982. 1183.57 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  20983. 1183.57 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  20984. 1183.57 s [algebraic-graphs]
  20985. 1183.57 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.connect ============
  20986. 1183.57 s [algebraic-graphs] OK: connect (leftVertex x) (leftVertex y) == vertices [x,y] []
  20987. 1183.57 s [algebraic-graphs] OK: connect (leftVertex x) (rightVertex y) == edge x y
  20988. 1183.57 s [algebraic-graphs] OK: connect (rightVertex x) (leftVertex y) == edge y x
  20989. 1183.57 s [algebraic-graphs] OK: connect (rightVertex x) (rightVertex y) == vertices [] [x,y]
  20990. 1183.57 s [algebraic-graphs] OK: connect (vertices xs1 ys1) (vertices xs2 ys2) == overlay (biclique xs1 ys2) (biclique xs2 ys1)
  20991. 1183.57 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  20992. 1183.57 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  20993. 1183.57 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  20994. 1183.57 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  20995. 1183.57 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  20996. 1183.57 s [algebraic-graphs] OK: edgeCount (connect x y) >= leftVertexCount x * rightVertexCount y
  20997. 1183.57 s [algebraic-graphs] OK: edgeCount (connect x y) <= leftVertexCount x * rightVertexCount y + rightVertexCount x * leftVertexCount y + edgeCount x + edgeCount y
  20998. 1183.57 s [algebraic-graphs]
  20999. 1183.57 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertices ============
  21000. 1183.57 s [algebraic-graphs] OK: vertices [] [] == empty
  21001. 1183.57 s [algebraic-graphs] OK: vertices [x] [] == leftVertex x
  21002. 1183.57 s [algebraic-graphs] OK: vertices [] [x] == rightVertex x
  21003. 1183.57 s [algebraic-graphs] OK: vertices xs ys == overlays (map leftVertex xs ++ map rightVertex ys)
  21004. 1183.57 s [algebraic-graphs] OK: hasLeftVertex x (vertices xs ys) == elem x xs
  21005. 1183.57 s [algebraic-graphs] OK: hasRightVertex y (vertices xs ys) == elem y ys
  21006. 1183.57 s [algebraic-graphs]
  21007. 1183.57 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edges ============
  21008. 1183.57 s [algebraic-graphs] OK: edges [] == empty
  21009. 1183.57 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  21010. 1183.57 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  21011. 1183.57 s [algebraic-graphs] OK: hasEdge x y . edges == elem (x,y)
  21012. 1183.57 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  21013. 1183.57 s [algebraic-graphs]
  21014. 1183.57 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.overlays ============
  21015. 1183.57 s [algebraic-graphs] OK: overlays [] == empty
  21016. 1183.57 s [algebraic-graphs] OK: overlays [x] == x
  21017. 1183.57 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  21018. 1183.57 s [algebraic-graphs] OK: overlays == foldr overlay empty
  21019. 1183.57 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  21020. 1183.57 s [algebraic-graphs]
  21021. 1183.57 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.connects ============
  21022. 1183.57 s [algebraic-graphs] OK: connects [] == empty
  21023. 1183.57 s [algebraic-graphs] OK: connects [x] == x
  21024. 1183.57 s [algebraic-graphs] OK: connects [x,y] == connect x y
  21025. 1183.57 s [algebraic-graphs] OK: connects == foldr connect empty
  21026. 1183.57 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  21027. 1183.57 s [algebraic-graphs]
  21028. 1183.57 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.swap ============
  21029. 1184.77 s [algebraic-graphs] OK: swap empty == empty
  21030. 1184.77 s [algebraic-graphs] OK: swap . leftVertex == rightVertex
  21031. 1184.77 s [algebraic-graphs] OK: swap (vertices xs ys) == vertices ys xs
  21032. 1184.77 s [algebraic-graphs] OK: swap (edge x y) == edge y x
  21033. 1184.77 s [algebraic-graphs] OK: swap . edges == edges . map Data.Tuple.swap
  21034. 1184.77 s [algebraic-graphs] OK: swap . swap == id
  21035. 1184.77 s [algebraic-graphs]
  21036. 1184.77 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.toBipartite ============
  21037. 1184.77 s [algebraic-graphs] OK: toBipartite empty == empty
  21038. 1184.77 s [algebraic-graphs] OK: toBipartite (vertex (Left x)) == leftVertex x
  21039. 1184.77 s [algebraic-graphs] OK: toBipartite (vertex (Right x)) == rightVertex x
  21040. 1184.77 s [algebraic-graphs] OK: toBipartite (edge (Left x) (Left y)) == vertices [x,y] []
  21041. 1184.77 s [algebraic-graphs] OK: toBipartite (edge (Left x) (Right y)) == edge x y
  21042. 1184.77 s [algebraic-graphs] OK: toBipartite (edge (Right x) (Left y)) == edge y x
  21043. 1184.77 s [algebraic-graphs] OK: toBipartite (edge (Right x) (Right y)) == vertices [] [x,y]
  21044. 1184.77 s [algebraic-graphs] OK: toBipartite . clique == uncurry biclique . partitionEithers
  21045. 1184.77 s [algebraic-graphs] OK: toBipartite . fromBipartite == id
  21046. 1184.77 s [algebraic-graphs]
  21047. 1184.77 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.toBipartiteWith ============
  21048. 1184.77 s [algebraic-graphs] OK: toBipartiteWith f empty == empty
  21049. 1184.77 s [algebraic-graphs] OK: toBipartiteWith Left x == vertices (vertexList x) []
  21050. 1184.77 s [algebraic-graphs] OK: toBipartiteWith Right x == vertices [] (vertexList x)
  21051. 1184.77 s [algebraic-graphs] OK: toBipartiteWith f == toBipartite . gmap f
  21052. 1184.77 s [algebraic-graphs] OK: toBipartiteWith id == toBipartite
  21053. 1184.77 s [algebraic-graphs]
  21054. 1184.77 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.fromBipartite ============
  21055. 1184.77 s [algebraic-graphs] OK: fromBipartite empty == empty
  21056. 1184.77 s [algebraic-graphs] OK: fromBipartite (leftVertex x) == vertex (Left x)
  21057. 1184.77 s [algebraic-graphs] OK: fromBipartite (edge x y) == edges [(Left x, Right y), (Right y, Left x)]
  21058. 1184.77 s [algebraic-graphs]
  21059. 1184.77 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.fromBipartiteWith ============
  21060. 1184.77 s [algebraic-graphs] OK: fromBipartiteWith Left Right == fromBipartite
  21061. 1184.77 s [algebraic-graphs] OK: fromBipartiteWith id id (vertices xs ys) == vertices (xs ++ ys)
  21062. 1184.77 s [algebraic-graphs] OK: fromBipartiteWith id id . edges == symmetricClosure . edges
  21063. 1184.77 s [algebraic-graphs]
  21064. 1184.77 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.isEmpty ============
  21065. 1184.77 s [algebraic-graphs] OK: isEmpty empty == True
  21066. 1184.77 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  21067. 1184.77 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  21068. 1184.77 s [algebraic-graphs] OK: isEmpty == (==) empty
  21069. 1184.77 s [algebraic-graphs]
  21070. 1184.77 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.hasLeftVertex ============
  21071. 1184.77 s [algebraic-graphs] OK: hasLeftVertex x empty == False
  21072. 1184.77 s [algebraic-graphs] OK: hasLeftVertex x (leftVertex y) == (x == y)
  21073. 1184.77 s [algebraic-graphs] OK: hasLeftVertex x (rightVertex y) == False
  21074. 1184.77 s [algebraic-graphs]
  21075. 1184.77 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.hasRightVertex ============
  21076. 1184.77 s [algebraic-graphs] OK: hasRightVertex x empty == False
  21077. 1184.77 s [algebraic-graphs] OK: hasRightVertex x (leftVertex y) == False
  21078. 1184.77 s [algebraic-graphs] OK: hasRightVertex x (rightVertex y) == (x == y)
  21079. 1184.77 s [algebraic-graphs]
  21080. 1184.77 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.hasVertex ============
  21081. 1184.77 s [algebraic-graphs] OK: hasVertex . Left == hasLeftVertex
  21082. 1184.77 s [algebraic-graphs] OK: hasVertex . Right == hasRightVertex
  21083. 1184.77 s [algebraic-graphs]
  21084. 1184.77 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.hasEdge ============
  21085. 1184.77 s [algebraic-graphs] OK: hasEdge x y empty == False
  21086. 1184.77 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  21087. 1184.77 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  21088. 1184.77 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  21089. 1184.77 s [algebraic-graphs]
  21090. 1184.77 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertexCount ============
  21091. 1184.77 s [algebraic-graphs] OK: leftVertexCount empty == 0
  21092. 1184.77 s [algebraic-graphs] OK: leftVertexCount (leftVertex x) == 1
  21093. 1184.77 s [algebraic-graphs] OK: leftVertexCount (rightVertex x) == 0
  21094. 1184.77 s [algebraic-graphs] OK: leftVertexCount (edge x y) == 1
  21095. 1184.77 s [algebraic-graphs] OK: leftVertexCount . edges == length . nub . map fst
  21096. 1184.77 s [algebraic-graphs]
  21097. 1184.77 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertexCount ============
  21098. 1184.77 s [algebraic-graphs] OK: rightVertexCount empty == 0
  21099. 1184.77 s [algebraic-graphs] OK: rightVertexCount (leftVertex x) == 0
  21100. 1184.77 s [algebraic-graphs] OK: rightVertexCount (rightVertex x) == 1
  21101. 1184.77 s [algebraic-graphs] OK: rightVertexCount (edge x y) == 1
  21102. 1184.77 s [algebraic-graphs] OK: rightVertexCount . edges == length . nub . map snd
  21103. 1184.77 s [algebraic-graphs]
  21104. 1184.77 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertexCount ============
  21105. 1184.77 s [algebraic-graphs] OK: vertexCount empty == 0
  21106. 1184.77 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  21107. 1184.77 s [algebraic-graphs] OK: vertexCount (edge x y) == 2
  21108. 1184.77 s [algebraic-graphs] OK: vertexCount x == leftVertexCount x + rightVertexCount x
  21109. 1184.77 s [algebraic-graphs]
  21110. 1184.77 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edgeCount ============
  21111. 1184.77 s [algebraic-graphs] OK: edgeCount empty == 0
  21112. 1184.77 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  21113. 1184.77 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  21114. 1184.77 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  21115. 1184.77 s [algebraic-graphs]
  21116. 1184.77 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertexList ============
  21117. 1184.77 s [algebraic-graphs] OK: leftVertexList empty == []
  21118. 1184.77 s [algebraic-graphs] OK: leftVertexList (leftVertex x) == [x]
  21119. 1184.77 s [algebraic-graphs] OK: leftVertexList (rightVertex x) == []
  21120. 1184.77 s [algebraic-graphs] OK: leftVertexList . flip vertices [] == nub . sort
  21121. 1184.77 s [algebraic-graphs]
  21122. 1184.77 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertexList ============
  21123. 1184.77 s [algebraic-graphs] OK: rightVertexList empty == []
  21124. 1184.77 s [algebraic-graphs] OK: rightVertexList (leftVertex x) == []
  21125. 1184.77 s [algebraic-graphs] OK: rightVertexList (rightVertex x) == [x]
  21126. 1184.77 s [algebraic-graphs] OK: rightVertexList . vertices [] == nub . sort
  21127. 1184.77 s [algebraic-graphs]
  21128. 1184.77 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertexList ============
  21129. 1184.77 s [algebraic-graphs] OK: vertexList empty == []
  21130. 1184.77 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  21131. 1184.77 s [algebraic-graphs] OK: vertexList (edge x y) == [Left x, Right y]
  21132. 1184.77 s [algebraic-graphs] OK: vertexList (vertices (lefts xs) (rights xs)) == nub (sort xs)
  21133. 1184.77 s [algebraic-graphs]
  21134. 1184.77 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edgeList ============
  21135. 1184.77 s [algebraic-graphs] OK: edgeList empty == []
  21136. 1184.77 s [algebraic-graphs] OK: edgeList (vertex x) == []
  21137. 1184.77 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  21138. 1184.77 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  21139. 1184.77 s [algebraic-graphs]
  21140. 1184.77 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertexSet ============
  21141. 1184.77 s [algebraic-graphs] OK: leftVertexSet empty == Set.empty
  21142. 1184.77 s [algebraic-graphs] OK: leftVertexSet . leftVertex == Set.singleton
  21143. 1184.77 s [algebraic-graphs] OK: leftVertexSet . rightVertex == const Set.empty
  21144. 1184.77 s [algebraic-graphs] OK: leftVertexSet . flip vertices [] == Set.fromList
  21145. 1184.77 s [algebraic-graphs]
  21146. 1184.77 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertexSet ============
  21147. 1184.77 s [algebraic-graphs] OK: rightVertexSet empty == Set.empty
  21148. 1184.77 s [algebraic-graphs] OK: rightVertexSet . leftVertex == const Set.empty
  21149. 1184.77 s [algebraic-graphs] OK: rightVertexSet . rightVertex == Set.singleton
  21150. 1184.77 s [algebraic-graphs] OK: rightVertexSet . vertices [] == Set.fromList
  21151. 1184.77 s [algebraic-graphs]
  21152. 1184.77 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertexSet ============
  21153. 1184.77 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  21154. 1184.77 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  21155. 1184.77 s [algebraic-graphs] OK: vertexSet (edge x y) == Set.fromList [Left x, Right y]
  21156. 1184.77 s [algebraic-graphs] OK: vertexSet (vertices (lefts xs) (rights xs)) == Set.fromList xs
  21157. 1184.77 s [algebraic-graphs]
  21158. 1184.77 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edgeSet ============
  21159. 1184.77 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  21160. 1184.77 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  21161. 1184.77 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  21162. 1184.77 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  21163. 1184.77 s [algebraic-graphs]
  21164. 1184.77 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftAdjacencyList ============
  21165. 1184.77 s [algebraic-graphs] OK: leftAdjacencyList empty == []
  21166. 1184.77 s [algebraic-graphs] OK: leftAdjacencyList (vertices [] xs) == []
  21167. 1184.77 s [algebraic-graphs] OK: leftAdjacencyList (vertices xs []) == []
  21168. 1184.77 s [algebraic-graphs] OK: leftAdjacencyList (edge x y) == [(x, [y])]
  21169. 1184.77 s [algebraic-graphs] OK: leftAdjacencyList (star x ys) == [(x, nub (sort ys))]
  21170. 1184.77 s [algebraic-graphs]
  21171. 1184.77 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightAdjacencyList ============
  21172. 1184.77 s [algebraic-graphs] OK: rightAdjacencyList empty == []
  21173. 1184.77 s [algebraic-graphs] OK: rightAdjacencyList (vertices [] xs) == [(x, []) | x <- nub (sort xs)]
  21174. 1184.77 s [algebraic-graphs] OK: rightAdjacencyList (vertices xs []) == []
  21175. 1184.77 s [algebraic-graphs] OK: rightAdjacencyList (edge x y) == [(y, [x])]
  21176. 1184.77 s [algebraic-graphs] OK: rightAdjacencyList (star x ys) == [(y, [x]) | y <- nub (sort ys)]
  21177. 1184.77 s [algebraic-graphs]
  21178. 1184.77 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.evenList ============
  21179. 1184.77 s [algebraic-graphs] OK: evenList [] == Nil
  21180. 1184.77 s [algebraic-graphs] OK: evenList [(1,2), (3,4)] == [1, 2, 3, 4] :: List Int Int
  21181. 1184.77 s [algebraic-graphs] OK: evenList [(1,'a'), (2,'b')] == Cons 1 (Cons 'a' (Cons 2 (Cons 'b' Nil)))
  21182. 1184.77 s [algebraic-graphs]
  21183. 1184.77 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.oddList ============
  21184. 1184.77 s [algebraic-graphs] OK: oddList 1 [] == Cons 1 Nil
  21185. 1184.77 s [algebraic-graphs] OK: oddList 1 [(2,3), (4,5)] == [1, 2, 3, 4, 5] :: List Int Int
  21186. 1184.77 s [algebraic-graphs] OK: oddList 1 [('a',2), ('b',3)] == Cons 1 (Cons 'a' (Cons 2 (Cons 'b' (Cons 3 Nil))))
  21187. 1184.77 s [algebraic-graphs]
  21188. 1184.77 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.path ============
  21189. 1184.77 s [algebraic-graphs] OK: path Nil == empty
  21190. 1184.77 s [algebraic-graphs] OK: path (Cons x Nil) == leftVertex x
  21191. 1184.77 s [algebraic-graphs] OK: path (Cons x (Cons y Nil)) == edge x y
  21192. 1184.77 s [algebraic-graphs] OK: path [1, 2, 3, 4, 5] == edges [(1,2), (3,2), (3,4), (5,4)]
  21193. 1184.77 s [algebraic-graphs]
  21194. 1184.77 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.circuit ============
  21195. 1184.77 s [algebraic-graphs] OK: circuit [] == empty
  21196. 1184.77 s [algebraic-graphs] OK: circuit [(x,y)] == edge x y
  21197. 1184.77 s [algebraic-graphs] OK: circuit [(1,2), (3,4), (5,6)] == edges [(1,2), (3,2), (3,4), (5,4), (5,6), (1,6)]
  21198. 1184.77 s [algebraic-graphs] OK: circuit . reverse == swap . circuit . map Data.Tuple.swap
  21199. 1184.77 s [algebraic-graphs]
  21200. 1184.77 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.biclique ============
  21201. 1184.77 s [algebraic-graphs] OK: biclique [] [] == empty
  21202. 1184.77 s [algebraic-graphs] OK: biclique xs [] == vertices xs []
  21203. 1184.77 s [algebraic-graphs] OK: biclique [] ys == vertices [] ys
  21204. 1184.77 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs []) (vertices [] ys)
  21205. 1184.77 s [algebraic-graphs]
  21206. 1184.77 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.star ============
  21207. 1184.77 s [algebraic-graphs] OK: star x [] == leftVertex x
  21208. 1184.77 s [algebraic-graphs] OK: star x [y] == edge x y
  21209. 1184.77 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  21210. 1184.77 s [algebraic-graphs] OK: star x ys == connect (leftVertex x) (vertices [] ys)
  21211. 1184.77 s [algebraic-graphs]
  21212. 1184.77 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.stars ============
  21213. 1184.77 s [algebraic-graphs] OK: stars [] == empty
  21214. 1184.77 s [algebraic-graphs] OK: stars [(x, [])] == leftVertex x
  21215. 1184.77 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  21216. 1184.77 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  21217. 1201.58 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  21218. 1201.68 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  21219. 1201.68 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  21220. 1201.68 s [algebraic-graphs]
  21221. 1201.68 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.mesh ============
  21222. 1201.68 s [algebraic-graphs] OK: mesh xs [] == empty
  21223. 1201.68 s [algebraic-graphs] OK: mesh [] ys == empty
  21224. 1201.68 s [algebraic-graphs] OK: mesh [x] [y] == leftVertex (x,y)
  21225. 1201.68 s [algebraic-graphs] OK: mesh [1,1] ['a','b'] == biclique [(1,'a'), (1,'b')] [(1,'a'), (1,'b')]
  21226. 1201.68 s [algebraic-graphs] OK: mesh [1,2] ['a','b'] == biclique [(1,'a'), (2,'b')] [(1,'b'), (2,'a')]
  21227. 1201.68 s [algebraic-graphs]
  21228. 1201.68 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.removeLeftVertex ============
  21229. 1201.68 s [algebraic-graphs] OK: removeLeftVertex x (leftVertex x) == empty
  21230. 1201.68 s [algebraic-graphs] OK: removeLeftVertex 1 (leftVertex 2) == leftVertex 2
  21231. 1201.68 s [algebraic-graphs] OK: removeLeftVertex x (rightVertex y) == rightVertex y
  21232. 1201.68 s [algebraic-graphs] OK: removeLeftVertex x (edge x y) == rightVertex y
  21233. 1201.68 s [algebraic-graphs] OK: removeLeftVertex x . removeLeftVertex x == removeLeftVertex x
  21234. 1201.68 s [algebraic-graphs]
  21235. 1201.68 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.removeRightVertex ============
  21236. 1201.68 s [algebraic-graphs] OK: removeRightVertex x (rightVertex x) == empty
  21237. 1201.68 s [algebraic-graphs] OK: removeRightVertex 1 (rightVertex 2) == rightVertex 2
  21238. 1201.68 s [algebraic-graphs] OK: removeRightVertex x (leftVertex y) == leftVertex y
  21239. 1201.68 s [algebraic-graphs] OK: removeRightVertex y (edge x y) == leftVertex x
  21240. 1201.68 s [algebraic-graphs] OK: removeRightVertex x . removeRightVertex x == removeRightVertex x
  21241. 1201.68 s [algebraic-graphs]
  21242. 1201.68 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.removeEdge ============
  21243. 1201.68 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x] [y]
  21244. 1201.68 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  21245. 1201.68 s [algebraic-graphs] OK: removeEdge x y . removeLeftVertex x == removeLeftVertex x
  21246. 1201.68 s [algebraic-graphs] OK: removeEdge x y . removeRightVertex y == removeRightVertex y
  21247. 1201.68 s [algebraic-graphs]
  21248. 1201.68 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.bimap ============
  21249. 1201.68 s [algebraic-graphs] OK: bimap f g empty == empty
  21250. 1201.68 s [algebraic-graphs] OK: bimap f g . vertex == vertex . Data.Bifunctor.bimap f g
  21251. 1201.68 s [algebraic-graphs] OK: bimap f g (edge x y) == edge (f x) (g y)
  21252. 1201.68 s [algebraic-graphs] OK: bimap id id == id
  21253. 1201.68 s [algebraic-graphs] OK: bimap f1 g1 . bimap f2 g2 == bimap (f1 . f2) (g1 . g2)
  21254. 1201.68 s [algebraic-graphs]
  21255. 1201.68 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.box ============
  21256. 1201.68 s [algebraic-graphs] OK: box (path [0,1]) (path ['a','b']) == <correct result>
  21257. 1201.68 s [algebraic-graphs]
  21258. 1201.68 s [algebraic-graphs] OK: box x y ~~ box y x
  21259. 1201.68 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  21260. 1201.68 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  21261. 1201.68 s [algebraic-graphs] OK: box x (leftVertex ()) ~~ x
  21262. 1201.68 s [algebraic-graphs] OK: box x (rightVertex ()) ~~ swap x
  21263. 1201.68 s [algebraic-graphs] OK: box x empty ~~ empty
  21264. 1201.68 s [algebraic-graphs] OK: vertexCount (box x y) <= vertexCount x * vertexCount y
  21265. 1201.68 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  21266. 1201.68 s [algebraic-graphs]
  21267. 1201.68 s [algebraic-graphs] OK: box == boxWith (,) (,) (,) (,)
  21268. 1201.68 s [algebraic-graphs]
  21269. 1201.68 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.consistent ============
  21270. 1201.68 s [algebraic-graphs] OK: consistent empty == True
  21271. 1201.68 s [algebraic-graphs] OK: consistent (vertex x) == True
  21272. 1201.68 s [algebraic-graphs] OK: consistent (edge x y) == True
  21273. 1201.68 s [algebraic-graphs] OK: consistent (edges x) == True
  21274. 1201.68 s [algebraic-graphs] OK: consistent (toBipartite x) == True
  21275. 1201.68 s [algebraic-graphs] OK: consistent (swap x) == True
  21276. 1201.68 s [algebraic-graphs] OK: consistent (circuit xs) == True
  21277. 1201.68 s [algebraic-graphs] OK: consistent (biclique xs ys) == True
  21278. 1201.68 s [algebraic-graphs]
  21279. 1201.68 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.detectParts ============
  21280. 1201.68 s [algebraic-graphs] OK: detectParts empty == Right empty
  21281. 1201.68 s [algebraic-graphs] OK: detectParts (vertex 1) == Right (leftVertex 1)
  21282. 1201.68 s [algebraic-graphs] OK: detectParts (edge 1 1) == Left [1]
  21283. 1201.68 s [algebraic-graphs] OK: detectParts (edge 1 2) == Right (edge 1 2)
  21284. 1201.68 s [algebraic-graphs] OK: detectParts (edge 0 (-1)) == Right (edge (-1) 0)
  21285. 1201.68 s [algebraic-graphs] OK: detectParts (1 * (2 + 3)) == Right (edges [(1, 2), (1, 3)])
  21286. 1201.68 s [algebraic-graphs] OK: detectParts ((1 + 3) * (2 + 4) + 6 * 5) == Right (swap (1 + 3) * (2 + 4) + swap 5 * 6
  21287. 1201.68 s [algebraic-graphs] OK: detectParts ((1 + 2) * (3 + 4) * (5 + 6)) == Left [1, 3, 2, 4, 5]
  21288. 1201.68 s [algebraic-graphs] OK: detectParts ((1 + 2) * (3 + 4) + (3 + 4) * 5) == Right (swap (1 + 2) * (3 + 4) + swap 5 * (3 + 4))
  21289. 1201.68 s [algebraic-graphs] OK: detectParts (1 * 2 * 3) == Left [2, 3, 1]
  21290. 1201.68 s [algebraic-graphs] OK: detectParts ((1 * 3 * 4) + 2 * (1 + 2)) == Left [2]
  21291. 1201.68 s [algebraic-graphs] OK: detectParts (clique [1..10]) == Left [1, 2, 3]
  21292. 1201.68 s [algebraic-graphs] OK: detectParts (circuit [1..11]) == Left [1..11]
  21293. 1201.68 s [algebraic-graphs] OK: detectParts (circuit [1..10]) == Right (circuit [(2 * x - 1, 2 * x) | x <- [1..5]])
  21294. 1201.69 s [algebraic-graphs] OK: detectParts (biclique [] xs) == Right (vertices xs [])
  21295. 1201.69 s [algebraic-graphs] OK: detectParts (biclique (map Left (x:xs)) (map Right ys)) == Right (biclique (map Left (x:xs)) (map Right ys))
  21296. 1201.69 s [algebraic-graphs] OK: isRight (detectParts (star x ys)) == not (elem x ys)
  21297. 1201.69 s [algebraic-graphs] OK: isRight (detectParts (fromBipartite (toBipartite x))) == True
  21298. 1201.69 s [algebraic-graphs]
  21299. 1201.69 s [algebraic-graphs] OK: ((all ((flip Set.member) $ edgeSet $ symmetricClosure x) . edgeSet) <$> detectParts x) /= Right False
  21300. 1201.69 s [algebraic-graphs] OK: (Set.map $ fromEither) <$> (vertexSet <$> (detectParts (fromBipartite (toBipartite x)))) == Right (vertexSet x)
  21301. 1201.69 s [algebraic-graphs] OK: fromEither (Bifunctor.bimap ((flip Set.isSubsetOf) (vertexSet x) . Set.fromList) (const True) (detectParts x)) == True
  21302. 1201.69 s [algebraic-graphs] OK: fromEither (Bifunctor.bimap ((flip Set.isSubsetOf) (edgeSet (symmetricClosure x)) . AM.edgeSet . circuit) (const True) (detectParts x)) == True
  21303. 1201.69 s [algebraic-graphs] OK: fromEither (Bifunctor.bimap (((==) 1) . ((flip mod) 2) . length) (const True) (detectParts x)) == True
  21304. 1201.69 s [algebraic-graphs]
  21305. 1201.69 s [algebraic-graphs] ============ Show (Bipartite.AdjacencyMap.Algorithm.Matching a b) ============
  21306. 1201.69 s [algebraic-graphs] OK: show (matching []) == "matching []"
  21307. 1201.69 s [algebraic-graphs] OK: show (matching [(2,'a'),(1,'b')]) == "matching [(1,'b'),(2,'a')]"
  21308. 1201.69 s [algebraic-graphs]
  21309. 1201.69 s [algebraic-graphs] ============ Eq (Bipartite.AdjacencyMap.Algorithm.Matching a b) ============
  21310. 1201.69 s [algebraic-graphs] OK: (x == y) == ((pairOfLeft x == pairOfLeft y) && (pairOfRight x == pairOfRight y))
  21311. 1201.69 s [algebraic-graphs]
  21312. 1201.69 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.pairOfLeft ============
  21313. 1201.69 s [algebraic-graphs] OK: pairOfLeft (matching []) == Map.empty
  21314. 1201.69 s [algebraic-graphs] OK: pairOfLeft (matching [(2,'a'), (1,'b')]) == Map.fromList [(2,'a'), (1,'b')]
  21315. 1201.69 s [algebraic-graphs] OK: Map.size . pairOfLeft == Map.size . pairOfRight
  21316. 1201.69 s [algebraic-graphs]
  21317. 1201.69 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.pairOfRight ============
  21318. 1201.69 s [algebraic-graphs] OK: pairOfRight (matching []) == Map.empty
  21319. 1201.69 s [algebraic-graphs] OK: pairOfRight (matching [(2,'a'), (1,'b')]) == Map.fromList [('a',2), ('b',1)]
  21320. 1201.69 s [algebraic-graphs] OK: Map.size . pairOfRight == Map.size . pairOfLeft
  21321. 1201.69 s [algebraic-graphs]
  21322. 1201.69 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.matching ============
  21323. 1201.69 s [algebraic-graphs] OK: matching [(1,'a'), (1,'b')] == matching [(1,'b')]
  21324. 1201.69 s [algebraic-graphs] OK: matching [(1,'a'), (1,'b'), (2,'b'), (2,'a')] == matching [(2,'a')]
  21325. 1201.69 s [algebraic-graphs]
  21326. 1201.69 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.isMatchingOf ============
  21327. 1201.69 s [algebraic-graphs] OK: isMatchingOf (matching []) x == True
  21328. 1201.69 s [algebraic-graphs] OK: isMatchingOf (matching xs) empty == null xs
  21329. 1201.69 s [algebraic-graphs] OK: isMatchingOf (matching [(x,y)]) (edge x y) == True
  21330. 1201.69 s [algebraic-graphs] OK: isMatchingOf (matching [(1,2)]) (edge 2 1) == False
  21331. 1201.69 s [algebraic-graphs]
  21332. 1201.69 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.matchingSize ============
  21333. 1201.69 s [algebraic-graphs] OK: matchingSize (matching []) == 0
  21334. 1201.69 s [algebraic-graphs] OK: matchingSize (matching [(2,'a'), (1,'b')]) == 2
  21335. 1201.69 s [algebraic-graphs] OK: matchingSize (matching [(1,'a'), (1,'b')]) == 1
  21336. 1201.69 s [algebraic-graphs] OK: matchingSize (matching xs) <= length xs
  21337. 1201.69 s [algebraic-graphs] OK: matchingSize x == Map.size . pairOfLeft
  21338. 1201.69 s [algebraic-graphs]
  21339. 1201.69 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.maxMatching ============
  21340. 1201.69 s [algebraic-graphs] OK: maxMatching empty == matching []
  21341. 1201.69 s [algebraic-graphs] OK: maxMatching (vertices xs ys) == matching []
  21342. 1201.69 s [algebraic-graphs] OK: maxMatching (path [1,2,3,4]) == matching [(1,2), (3,4)]
  21343. 1201.69 s [algebraic-graphs] OK: matchingSize (maxMatching (circuit [(1,2), (3,4), (5,6)])) == 3
  21344. 1201.69 s [algebraic-graphs] OK: matchingSize (maxMatching (star x (y:ys))) == 1
  21345. 1201.69 s [algebraic-graphs] OK: matchingSize (maxMatching (biclique xs ys)) == min (length (nub xs)) (length (nub ys))
  21346. 1201.69 s [algebraic-graphs] OK: isMatchingOf (maxMatching x) x == True
  21347. 1201.69 s [algebraic-graphs]
  21348. 1201.69 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.isVertexCoverOf ============
  21349. 1201.69 s [algebraic-graphs] OK: isVertexCoverOf (xs , ys ) empty == Set.null xs && Set.null ys
  21350. 1201.69 s [algebraic-graphs] OK: isVertexCoverOf (xs , ys ) (leftVertex x) == Set.isSubsetOf xs (Set.singleton x) && Set.null ys
  21351. 1201.69 s [algebraic-graphs] OK: isVertexCoverOf (Set.empty , Set.empty ) (edge x y) == False
  21352. 1201.69 s [algebraic-graphs] OK: isVertexCoverOf (Set.singleton x, ys ) (edge x y) == Set.isSubsetOf ys (Set.singleton y)
  21353. 1201.69 s [algebraic-graphs] OK: isVertexCoverOf (xs , Set.singleton y) (edge x y) == Set.isSubsetOf xs (Set.singleton x)
  21354. 1201.69 s [algebraic-graphs]
  21355. 1201.69 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.minVertexCover ============
  21356. 1201.69 s [algebraic-graphs] OK: minVertexCover empty == (Set.empty, Set.empty)
  21357. 1203.79 s [algebraic-graphs] OK: minVertexCover (vertices xs ys) == (Set.empty, Set.empty)
  21358. 1203.79 s [algebraic-graphs] OK: minVertexCover (path [1,2,3]) == (Set.empty, Set.singleton 2)
  21359. 1203.79 s [algebraic-graphs] OK: minVertexCover (star x (1:2:ys)) == (Set.singleton x, Set.empty)
  21360. 1203.79 s [algebraic-graphs] OK: vertexCoverSize (minVertexCover (biclique xs ys)) == min (length (nub xs)) (length (nub ys))
  21361. 1203.79 s [algebraic-graphs] OK: vertexCoverSize . minVertexCover == matchingSize . maxMatching
  21362. 1203.79 s [algebraic-graphs] OK: isVertexCoverOf (minVertexCover x) x == True
  21363. 1203.79 s [algebraic-graphs]
  21364. 1203.79 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.isIndependentSetOf ============
  21365. 1203.79 s [algebraic-graphs] OK: isIndependentSetOf (xs , ys ) empty == Set.null xs && Set.null ys
  21366. 1203.79 s [algebraic-graphs] OK: isIndependentSetOf (xs , ys ) (leftVertex x) == Set.isSubsetOf xs (Set.singleton x) && Set.null ys
  21367. 1203.79 s [algebraic-graphs] OK: isIndependentSetOf (Set.empty , Set.empty ) (edge x y) == True
  21368. 1203.79 s [algebraic-graphs] OK: isIndependentSetOf (Set.singleton x, ys ) (edge x y) == Set.null ys
  21369. 1203.79 s [algebraic-graphs] OK: isIndependentSetOf (xs , Set.singleton y) (edge x y) == Set.null xs
  21370. 1203.79 s [algebraic-graphs]
  21371. 1203.79 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.maxIndependentSet ============
  21372. 1203.79 s [algebraic-graphs] OK: maxIndependentSet empty == (Set.empty, Set.empty)
  21373. 1203.79 s [algebraic-graphs] OK: maxIndependentSet (vertices xs ys) == (Set.fromList xs, Set.fromList ys)
  21374. 1203.79 s [algebraic-graphs] OK: maxIndependentSet (path [1,2,3]) == (Set.fromList [1,3], Set.empty)
  21375. 1203.79 s [algebraic-graphs] OK: maxIndependentSet (star x (1:2:ys)) == (Set.empty, Set.fromList (1:2:ys))
  21376. 1203.79 s [algebraic-graphs] OK: independentSetSize (maxIndependentSet (biclique xs ys)) == max (length (nub xs)) (length (nub ys))
  21377. 1203.79 s [algebraic-graphs] OK: independentSetSize (maxIndependentSet x) == vertexCount x - vertexCoverSize (minVertexCover x)
  21378. 1203.79 s [algebraic-graphs] OK: isIndependentSetOf (maxIndependentSet x) x == True
  21379. 1203.79 s [algebraic-graphs]
  21380. 1203.79 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.augmentingPath ============
  21381. 1203.79 s [algebraic-graphs] OK: augmentingPath (matching []) empty == Left (Set.empty, Set.empty)
  21382. 1203.79 s [algebraic-graphs] OK: augmentingPath (matching []) (edge 1 2) == Right [1,2]
  21383. 1203.79 s [algebraic-graphs] OK: augmentingPath (matching [(1,2)]) (path [1,2,3]) == Left (Set.empty, Set.singleton 2)
  21384. 1203.79 s [algebraic-graphs] OK: augmentingPath (matching [(3,2)]) (path [1,2,3,4]) == Right [1,2,3,4]
  21385. 1203.79 s [algebraic-graphs] OK: isLeft (augmentingPath (maxMatching x) x) == True
  21386. 1203.79 s [algebraic-graphs]
  21387. 1203.79 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.consistentMatching ============
  21388. 1203.79 s [algebraic-graphs] OK: consistentMatching (matching xs) == True
  21389. 1203.79 s [algebraic-graphs] OK: consistentMatching (maxMatching x) == True
  21390. 1203.79 s [algebraic-graphs]
  21391. 1203.79 s [algebraic-graphs] ============ Export.Eq ============
  21392. 1203.79 s [algebraic-graphs] OK: mempty /= literal ""
  21393. 1203.79 s [algebraic-graphs]
  21394. 1203.79 s [algebraic-graphs] ============ Export.Ord ============
  21395. 1203.79 s [algebraic-graphs] OK: mempty < literal ""
  21396. 1203.79 s [algebraic-graphs]
  21397. 1203.79 s [algebraic-graphs] ============ Export.isEmpty ============
  21398. 1203.79 s [algebraic-graphs] OK: isEmpty mempty == True
  21399. 1203.79 s [algebraic-graphs] OK: isEmpty (literal "") == False
  21400. 1203.79 s [algebraic-graphs] OK: isEmpty x == (x == mempty)
  21401. 1203.79 s [algebraic-graphs]
  21402. 1203.79 s [algebraic-graphs] ============ Export.literal ============
  21403. 1203.79 s [algebraic-graphs] OK: literal "Hello, " <> literal "World!" == literal "Hello, World!"
  21404. 1203.79 s [algebraic-graphs] OK: literal "I am just a string literal" == "I am just a string literal"
  21405. 1203.79 s [algebraic-graphs] OK: render . literal == id
  21406. 1203.79 s [algebraic-graphs]
  21407. 1203.79 s [algebraic-graphs] ============ Export.render ============
  21408. 1203.79 s [algebraic-graphs] OK: render (literal "al" <> literal "ga") == "alga"
  21409. 1203.79 s [algebraic-graphs] OK: render mempty == mempty
  21410. 1203.79 s [algebraic-graphs]
  21411. 1203.79 s [algebraic-graphs] ============ Export.<+> ============
  21412. 1203.79 s [algebraic-graphs] OK: x <+> mempty == x
  21413. 1203.79 s [algebraic-graphs] OK: mempty <+> x == x
  21414. 1203.79 s [algebraic-graphs] OK: x <+> (y <+> z) == (x <+> y) <+> z
  21415. 1203.79 s [algebraic-graphs] OK: "name" <+> "surname" == "name surname"
  21416. 1203.79 s [algebraic-graphs]
  21417. 1203.79 s [algebraic-graphs] ============ Export.brackets ============
  21418. 1203.79 s [algebraic-graphs] OK: brackets "i" == "[i]"
  21419. 1203.79 s [algebraic-graphs] OK: brackets mempty == "[]"
  21420. 1203.79 s [algebraic-graphs]
  21421. 1203.79 s [algebraic-graphs] ============ Export.doubleQuotes ============
  21422. 1203.79 s [algebraic-graphs] OK: doubleQuotes "/path/with spaces" == "\"/path/with spaces\""
  21423. 1203.79 s [algebraic-graphs] OK: doubleQuotes (doubleQuotes mempty) == "\"\"\"\""
  21424. 1203.79 s [algebraic-graphs]
  21425. 1203.79 s [algebraic-graphs] ============ Export.indent ============
  21426. 1203.79 s [algebraic-graphs] OK: indent 0 == id
  21427. 1203.79 s [algebraic-graphs] OK: indent 1 mempty == " "
  21428. 1203.79 s [algebraic-graphs]
  21429. 1203.79 s [algebraic-graphs] ============ Export.unlines ============
  21430. 1203.79 s [algebraic-graphs] OK: unlines [] == mempty
  21431. 1203.79 s [algebraic-graphs] OK: unlines [mempty] == "\n"
  21432. 1203.79 s [algebraic-graphs] OK: unlines ["title", "subtitle"] == "title\nsubtitle\n"
  21433. 1203.79 s [algebraic-graphs]
  21434. 1203.79 s [algebraic-graphs] ============ Export.export ============
  21435. 1203.79 s [algebraic-graphs] OK: render $ export vDoc eDoc (1 + 2 * (3 + 4) :: Graph Int)
  21436. 1203.79 s [algebraic-graphs]
  21437. 1203.79 s [algebraic-graphs] ============ Export.Dot.export ============
  21438. 1203.79 s [algebraic-graphs] OK: export style (1 * 2 + 3 * 4 * 5 :: Graph Int)
  21439. 1203.79 s [algebraic-graphs]
  21440. 1203.79 s [algebraic-graphs] =========== Export.Dot.attributeQuoting ============
  21441. 1203.79 s [algebraic-graphs] OK: export style' (1 * 2 + 3 * 4 * 5 :: Graph Int)
  21442. 1203.79 s [algebraic-graphs]
  21443. 1203.79 s [algebraic-graphs] ============ Export.Dot.exportAsIs ============
  21444. 1203.79 s [algebraic-graphs] OK: exportAsIs (circuit ["a", "b", "c"] :: Graph String)
  21445. 1203.79 s [algebraic-graphs]
  21446. 1203.79 s [algebraic-graphs] ============ Export.Dot.exportViaShow ============
  21447. 1203.79 s [algebraic-graphs] OK: exportViaShow (1 + 2 * (3 + 4) :: Graph Int)
  21448. 1203.79 s [algebraic-graphs]
  21449. 1203.79 s [algebraic-graphs] ============ Graph ============
  21450. 1203.79 s [algebraic-graphs] OK: Axioms of graphs
  21451. 1203.79 s [algebraic-graphs] OK: Theorems of graphs
  21452. 1203.79 s [algebraic-graphs]
  21453. 1203.79 s [algebraic-graphs] ============ Graph.Ord ============
  21454. 1203.79 s [algebraic-graphs] OK: vertex 1 < vertex 2
  21455. 1203.79 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  21456. 1203.79 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  21457. 1203.79 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  21458. 1203.79 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  21459. 1203.79 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  21460. 1203.79 s [algebraic-graphs] OK: x <= x + y
  21461. 1203.79 s [algebraic-graphs] OK: x + y <= x * y
  21462. 1203.79 s [algebraic-graphs]
  21463. 1203.79 s [algebraic-graphs] ============ Graph.empty ============
  21464. 1203.79 s [algebraic-graphs] OK: isEmpty empty == True
  21465. 1203.79 s [algebraic-graphs] OK: hasVertex x empty == False
  21466. 1203.79 s [algebraic-graphs] OK: vertexCount empty == 0
  21467. 1203.79 s [algebraic-graphs] OK: edgeCount empty == 0
  21468. 1203.79 s [algebraic-graphs]
  21469. 1203.79 s [algebraic-graphs] ============ Graph.vertex ============
  21470. 1203.79 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  21471. 1203.79 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  21472. 1203.79 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  21473. 1203.79 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  21474. 1203.79 s [algebraic-graphs]
  21475. 1203.79 s [algebraic-graphs] ============ Graph.edge ============
  21476. 1203.79 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  21477. 1203.79 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  21478. 1203.79 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  21479. 1203.79 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  21480. 1203.79 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  21481. 1203.79 s [algebraic-graphs]
  21482. 1203.79 s [algebraic-graphs] ============ Graph.overlay ============
  21483. 1203.79 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  21484. 1203.79 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  21485. 1203.79 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  21486. 1203.79 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  21487. 1203.79 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  21488. 1203.79 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  21489. 1203.79 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  21490. 1203.79 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  21491. 1203.79 s [algebraic-graphs]
  21492. 1203.79 s [algebraic-graphs] ============ Graph.connect ============
  21493. 1203.79 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  21494. 1203.79 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  21495. 1203.79 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  21496. 1203.79 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  21497. 1203.79 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  21498. 1203.79 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  21499. 1203.79 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  21500. 1203.79 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  21501. 1203.79 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  21502. 1203.79 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  21503. 1203.79 s [algebraic-graphs]
  21504. 1203.79 s [algebraic-graphs] ============ Graph.vertices ============
  21505. 1203.79 s [algebraic-graphs] OK: vertices [] == empty
  21506. 1203.79 s [algebraic-graphs] OK: vertices [x] == vertex x
  21507. 1203.79 s [algebraic-graphs] OK: vertices == overlays . map vertex
  21508. 1203.79 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  21509. 1203.79 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  21510. 1203.79 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  21511. 1203.79 s [algebraic-graphs]
  21512. 1203.79 s [algebraic-graphs] ============ Graph.edges ============
  21513. 1203.79 s [algebraic-graphs] OK: edges [] == empty
  21514. 1203.79 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  21515. 1203.79 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  21516. 1203.79 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  21517. 1203.79 s [algebraic-graphs]
  21518. 1203.79 s [algebraic-graphs] ============ Graph.overlays ============
  21519. 1203.79 s [algebraic-graphs] OK: overlays [] == empty
  21520. 1203.79 s [algebraic-graphs] OK: overlays [x] == x
  21521. 1203.79 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  21522. 1203.79 s [algebraic-graphs] OK: overlays == foldr overlay empty
  21523. 1203.79 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  21524. 1203.79 s [algebraic-graphs]
  21525. 1203.79 s [algebraic-graphs] ============ Graph.connects ============
  21526. 1203.79 s [algebraic-graphs] OK: connects [] == empty
  21527. 1203.79 s [algebraic-graphs] OK: connects [x] == x
  21528. 1203.79 s [algebraic-graphs] OK: connects [x,y] == connect x y
  21529. 1203.79 s [algebraic-graphs] OK: connects == foldr connect empty
  21530. 1203.79 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  21531. 1203.79 s [algebraic-graphs]
  21532. 1203.79 s [algebraic-graphs] ============ Graph.isSubgraphOf ============
  21533. 1203.79 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  21534. 1203.79 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  21535. 1203.79 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  21536. 1203.79 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  21537. 1203.79 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  21538. 1203.79 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  21539. 1203.79 s [algebraic-graphs]
  21540. 1203.79 s [algebraic-graphs] ============ Graph.toGraph et al. ============
  21541. 1203.79 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  21542. 1203.79 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  21543. 1203.79 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  21544. 1203.79 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  21545. 1203.79 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  21546. 1203.79 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  21547. 1203.79 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  21548. 1203.79 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  21549. 1203.79 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  21550. 1204.47 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  21551. 1204.47 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  21552. 1204.47 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  21553. 1204.47 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  21554. 1204.48 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  21555. 1204.48 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  21556. 1204.48 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  21557. 1204.48 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  21558. 1204.48 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  21559. 1204.48 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  21560. 1204.48 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  21561. 1204.48 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  21562. 1204.48 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  21563. 1204.48 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  21564. 1204.48 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  21565. 1204.48 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  21566. 1204.48 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  21567. 1204.48 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  21568. 1204.48 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  21569. 1204.48 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  21570. 1204.48 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  21571. 1204.48 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  21572. 1204.48 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  21573. 1204.48 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  21574. 1204.48 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  21575. 1204.48 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  21576. 1204.48 s [algebraic-graphs]
  21577. 1204.48 s [algebraic-graphs] ============ Graph.foldg ============
  21578. 1204.48 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  21579. 1204.48 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  21580. 1204.48 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  21581. 1204.48 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  21582. 1204.48 s [algebraic-graphs]
  21583. 1204.48 s [algebraic-graphs] ============ Graph.isEmpty ============
  21584. 1204.48 s [algebraic-graphs] OK: isEmpty empty == True
  21585. 1204.48 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  21586. 1204.48 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  21587. 1204.48 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  21588. 1204.48 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  21589. 1204.48 s [algebraic-graphs]
  21590. 1204.48 s [algebraic-graphs] ============ Graph.hasVertex ============
  21591. 1204.48 s [algebraic-graphs] OK: hasVertex x empty == False
  21592. 1204.48 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  21593. 1204.48 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  21594. 1204.48 s [algebraic-graphs]
  21595. 1204.48 s [algebraic-graphs] ============ Graph.hasEdge ============
  21596. 1204.48 s [algebraic-graphs] OK: hasEdge x y empty == False
  21597. 1204.48 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  21598. 1204.48 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  21599. 1204.48 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  21600. 1204.48 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  21601. 1204.48 s [algebraic-graphs]
  21602. 1204.48 s [algebraic-graphs] ============ Graph.vertexCount ============
  21603. 1204.48 s [algebraic-graphs] OK: vertexCount empty == 0
  21604. 1204.48 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  21605. 1204.48 s [algebraic-graphs] OK: vertexCount == length . vertexList
  21606. 1204.48 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  21607. 1204.48 s [algebraic-graphs]
  21608. 1204.48 s [algebraic-graphs] ============ Graph.edgeCount ============
  21609. 1204.48 s [algebraic-graphs] OK: edgeCount empty == 0
  21610. 1204.48 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  21611. 1204.48 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  21612. 1204.48 s [algebraic-graphs] OK: edgeCount == length . edgeList
  21613. 1204.48 s [algebraic-graphs]
  21614. 1204.48 s [algebraic-graphs] ============ Graph.vertexList ============
  21615. 1204.48 s [algebraic-graphs] OK: vertexList empty == []
  21616. 1204.48 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  21617. 1204.48 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  21618. 1204.48 s [algebraic-graphs]
  21619. 1204.48 s [algebraic-graphs] ============ Graph.vertexSet ============
  21620. 1204.48 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  21621. 1204.48 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  21622. 1204.48 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  21623. 1204.48 s [algebraic-graphs]
  21624. 1204.48 s [algebraic-graphs] ============ Graph.vertexIntSet ============
  21625. 1204.48 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  21626. 1204.48 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  21627. 1204.48 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  21628. 1204.48 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  21629. 1204.48 s [algebraic-graphs]
  21630. 1204.48 s [algebraic-graphs] ============ Graph.edgeList ============
  21631. 1204.48 s [algebraic-graphs] OK: edgeList empty == []
  21632. 1204.48 s [algebraic-graphs] OK: edgeList (vertex x) == []
  21633. 1204.48 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  21634. 1204.48 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  21635. 1204.48 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  21636. 1204.48 s [algebraic-graphs]
  21637. 1204.48 s [algebraic-graphs] ============ Graph.edgeSet ============
  21638. 1204.48 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  21639. 1204.48 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  21640. 1204.48 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  21641. 1204.48 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  21642. 1204.48 s [algebraic-graphs]
  21643. 1204.48 s [algebraic-graphs] ============ Graph.adjacencyList ============
  21644. 1204.48 s [algebraic-graphs] OK: adjacencyList empty == []
  21645. 1204.48 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  21646. 1204.48 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  21647. 1204.48 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  21648. 1204.48 s [algebraic-graphs]
  21649. 1204.48 s [algebraic-graphs] ============ Graph.preSet ============
  21650. 1204.48 s [algebraic-graphs] OK: preSet x empty == Set.empty
  21651. 1204.48 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  21652. 1204.48 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  21653. 1204.48 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  21654. 1204.48 s [algebraic-graphs]
  21655. 1204.48 s [algebraic-graphs] ============ Graph.preIntSet ============
  21656. 1204.48 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  21657. 1204.48 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  21658. 1204.48 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  21659. 1204.48 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  21660. 1204.48 s [algebraic-graphs]
  21661. 1204.48 s [algebraic-graphs] ============ Graph.postSet ============
  21662. 1204.48 s [algebraic-graphs] OK: postSet x empty == Set.empty
  21663. 1204.48 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  21664. 1204.48 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  21665. 1204.48 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  21666. 1204.48 s [algebraic-graphs]
  21667. 1204.48 s [algebraic-graphs] ============ Graph.postIntSet ============
  21668. 1204.48 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  21669. 1204.48 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  21670. 1204.48 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  21671. 1204.48 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  21672. 1204.48 s [algebraic-graphs]
  21673. 1204.48 s [algebraic-graphs] ============ Graph.size ============
  21674. 1204.48 s [algebraic-graphs] OK: size empty == 1
  21675. 1204.48 s [algebraic-graphs] OK: size (vertex x) == 1
  21676. 1204.48 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  21677. 1204.48 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  21678. 1204.48 s [algebraic-graphs] OK: size x >= 1
  21679. 1204.48 s [algebraic-graphs] OK: size x >= vertexCount x
  21680. 1204.48 s [algebraic-graphs]
  21681. 1204.48 s [algebraic-graphs] ============ Graph.path ============
  21682. 1204.48 s [algebraic-graphs] OK: path [] == empty
  21683. 1204.48 s [algebraic-graphs] OK: path [x] == vertex x
  21684. 1204.48 s [algebraic-graphs] OK: path [x,y] == edge x y
  21685. 1204.48 s [algebraic-graphs]
  21686. 1204.48 s [algebraic-graphs] ============ Graph.circuit ============
  21687. 1204.48 s [algebraic-graphs] OK: circuit [] == empty
  21688. 1204.48 s [algebraic-graphs] OK: circuit [x] == edge x x
  21689. 1204.48 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  21690. 1204.48 s [algebraic-graphs]
  21691. 1204.48 s [algebraic-graphs] ============ Graph.clique ============
  21692. 1204.48 s [algebraic-graphs] OK: clique [] == empty
  21693. 1204.48 s [algebraic-graphs] OK: clique [x] == vertex x
  21694. 1204.48 s [algebraic-graphs] OK: clique [x,y] == edge x y
  21695. 1204.48 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  21696. 1204.48 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  21697. 1204.48 s [algebraic-graphs]
  21698. 1204.48 s [algebraic-graphs] ============ Graph.biclique ============
  21699. 1204.48 s [algebraic-graphs] OK: biclique [] [] == empty
  21700. 1204.48 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  21701. 1204.48 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  21702. 1204.48 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  21703. 1204.48 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  21704. 1204.48 s [algebraic-graphs]
  21705. 1204.48 s [algebraic-graphs] ============ Graph.star ============
  21706. 1204.48 s [algebraic-graphs] OK: star x [] == vertex x
  21707. 1204.48 s [algebraic-graphs] OK: star x [y] == edge x y
  21708. 1204.48 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  21709. 1204.48 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  21710. 1204.48 s [algebraic-graphs]
  21711. 1204.48 s [algebraic-graphs] ============ Graph.stars ============
  21712. 1204.48 s [algebraic-graphs] OK: stars [] == empty
  21713. 1204.48 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  21714. 1204.48 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  21715. 1204.48 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  21716. 1204.48 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  21717. 1204.48 s [algebraic-graphs] OK: stars . adjacencyList == id
  21718. 1204.48 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  21719. 1204.48 s [algebraic-graphs]
  21720. 1204.48 s [algebraic-graphs] ============ Graph.tree ============
  21721. 1204.48 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  21722. 1204.48 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  21723. 1204.48 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  21724. 1204.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)]
  21725. 1204.48 s [algebraic-graphs]
  21726. 1204.48 s [algebraic-graphs] ============ Graph.forest ============
  21727. 1204.48 s [algebraic-graphs] OK: forest [] == empty
  21728. 1204.48 s [algebraic-graphs] OK: forest [x] == tree x
  21729. 1204.48 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  21730. 1204.48 s [algebraic-graphs] OK: forest == overlays . map tree
  21731. 1204.48 s [algebraic-graphs]
  21732. 1204.48 s [algebraic-graphs] ============ Graph.removeVertex ============
  21733. 1207.89 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  21734. 1207.89 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  21735. 1207.89 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  21736. 1207.93 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  21737. 1207.93 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  21738. 1207.93 s [algebraic-graphs]
  21739. 1207.93 s [algebraic-graphs] ============ Graph.removeEdge ============
  21740. 1207.93 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  21741. 1207.93 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  21742. 1207.93 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  21743. 1207.93 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  21744. 1207.93 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  21745. 1207.93 s [algebraic-graphs] OK: size (removeEdge x y z) <= 3 * size z
  21746. 1207.93 s [algebraic-graphs]
  21747. 1207.93 s [algebraic-graphs] ============ Graph.replaceVertex ============
  21748. 1207.93 s [algebraic-graphs] OK: replaceVertex x x == id
  21749. 1207.93 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  21750. 1207.93 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  21751. 1207.93 s [algebraic-graphs]
  21752. 1207.93 s [algebraic-graphs] ============ Graph.mergeVertices ============
  21753. 1207.93 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  21754. 1207.93 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  21755. 1207.93 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  21756. 1207.93 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  21757. 1207.93 s [algebraic-graphs]
  21758. 1207.93 s [algebraic-graphs] ============ Graph.transpose ============
  21759. 1207.93 s [algebraic-graphs] OK: transpose empty == empty
  21760. 1207.93 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  21761. 1207.93 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  21762. 1207.93 s [algebraic-graphs] OK: transpose . transpose == id
  21763. 1207.93 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  21764. 1207.93 s [algebraic-graphs]
  21765. 1207.93 s [algebraic-graphs] ============ Graph.gmap ============
  21766. 1207.93 s [algebraic-graphs] OK: gmap f empty == empty
  21767. 1207.93 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  21768. 1207.93 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  21769. 1207.93 s [algebraic-graphs] OK: gmap id == id
  21770. 1207.93 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  21771. 1207.93 s [algebraic-graphs]
  21772. 1207.93 s [algebraic-graphs] ============ Graph.induce ============
  21773. 1207.93 s [algebraic-graphs] OK: induce (const True ) x == x
  21774. 1207.93 s [algebraic-graphs] OK: induce (const False) x == empty
  21775. 1207.93 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  21776. 1207.93 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  21777. 1207.93 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  21778. 1207.93 s [algebraic-graphs]
  21779. 1207.93 s [algebraic-graphs] ============ Graph.induceJust ============
  21780. 1207.93 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  21781. 1207.93 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  21782. 1207.93 s [algebraic-graphs] OK: induceJust . gmap Just == id
  21783. 1207.93 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  21784. 1207.93 s [algebraic-graphs]
  21785. 1207.93 s [algebraic-graphs] ============ Graph.compose ============
  21786. 1207.93 s [algebraic-graphs] OK: compose empty x == empty
  21787. 1207.93 s [algebraic-graphs] OK: compose x empty == empty
  21788. 1207.93 s [algebraic-graphs] OK: compose (vertex x) y == empty
  21789. 1207.93 s [algebraic-graphs] OK: compose x (vertex y) == empty
  21790. 1207.93 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  21791. 1207.93 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  21792. 1207.93 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  21793. 1207.93 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  21794. 1207.93 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  21795. 1207.93 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  21796. 1207.93 s [algebraic-graphs] OK: size (compose x y) <= edgeCount x + edgeCount y + 1
  21797. 1207.93 s [algebraic-graphs]
  21798. 1207.93 s [algebraic-graphs] ============ Graph.(===) ============
  21799. 1207.93 s [algebraic-graphs] OK: x === x == True
  21800. 1207.93 s [algebraic-graphs] OK: x === x + empty == False
  21801. 1207.93 s [algebraic-graphs] OK: x + y === x + y == True
  21802. 1207.93 s [algebraic-graphs] OK: 1 + 2 === 2 + 1 == False
  21803. 1207.93 s [algebraic-graphs] OK: x + y === x * y == False
  21804. 1207.93 s [algebraic-graphs]
  21805. 1207.93 s [algebraic-graphs] ============ Graph.mesh ============
  21806. 1207.93 s [algebraic-graphs] OK: mesh xs [] == empty
  21807. 1207.93 s [algebraic-graphs] OK: mesh [] ys == empty
  21808. 1207.93 s [algebraic-graphs] OK: mesh [x] [y] == vertex (x, y)
  21809. 1207.93 s [algebraic-graphs] OK: mesh xs ys == box (path xs) (path ys)
  21810. 1207.93 s [algebraic-graphs] OK: mesh [1..3] "ab" == <correct result>
  21811. 1207.93 s [algebraic-graphs] OK: size (mesh xs ys) == max 1 (3 * length xs * length ys - length xs - length ys -1)
  21812. 1207.93 s [algebraic-graphs]
  21813. 1207.93 s [algebraic-graphs] ============ Graph.torus ============
  21814. 1207.93 s [algebraic-graphs] OK: torus xs [] == empty
  21815. 1207.93 s [algebraic-graphs] OK: torus [] ys == empty
  21816. 1207.93 s [algebraic-graphs] OK: torus [x] [y] == edge (x,y) (x,y)
  21817. 1207.93 s [algebraic-graphs] OK: torus xs ys == box (circuit xs) (circuit ys)
  21818. 1207.93 s [algebraic-graphs] OK: torus [1,2] "ab" == <correct result>
  21819. 1207.93 s [algebraic-graphs] OK: size (torus xs ys) == max 1 (3 * length xs * length ys)
  21820. 1207.93 s [algebraic-graphs]
  21821. 1207.93 s [algebraic-graphs] ============ Graph.deBruijn ============
  21822. 1207.93 s [algebraic-graphs] OK: deBruijn 0 xs == edge [] []
  21823. 1207.93 s [algebraic-graphs] OK: n > 0 ==> deBruijn n [] == empty
  21824. 1207.93 s [algebraic-graphs] OK: deBruijn 1 [0,1] == edges [ ([0],[0]), ([0],[1]), ([1],[0]), ([1],[1]) ]
  21825. 1207.93 s [algebraic-graphs] OK: deBruijn 2 "0" == edge "00" "00"
  21826. 1207.93 s [algebraic-graphs] OK: deBruijn 2 "01" == <correct result>
  21827. 1207.93 s [algebraic-graphs] OK: transpose (deBruijn n xs) == gmap reverse $ deBruijn n xs
  21828. 1207.93 s [algebraic-graphs] OK: vertexCount (deBruijn n xs) == (length $ nub xs)^n
  21829. 1207.93 s [algebraic-graphs] OK: n > 0 ==> edgeCount (deBruijn n xs) == (length $ nub xs)^(n + 1)
  21830. 1207.93 s [algebraic-graphs]
  21831. 1207.93 s [algebraic-graphs] ============ Graph.splitVertex ============
  21832. 1207.93 s [algebraic-graphs] OK: splitVertex x [] == removeVertex x
  21833. 1207.93 s [algebraic-graphs] OK: splitVertex x [x] == id
  21834. 1207.93 s [algebraic-graphs] OK: splitVertex x [y] == replaceVertex x y
  21835. 1207.93 s [algebraic-graphs] OK: splitVertex 1 [0, 1] $ 1 * (2 + 3) == (0 + 1) * (2 + 3)
  21836. 1207.93 s [algebraic-graphs]
  21837. 1207.93 s [algebraic-graphs] ============ Graph.bind ============
  21838. 1207.93 s [algebraic-graphs] OK: bind empty f == empty
  21839. 1207.93 s [algebraic-graphs] OK: bind (vertex x) f == f x
  21840. 1207.93 s [algebraic-graphs] OK: bind (edge x y) f == connect (f x) (f y)
  21841. 1207.93 s [algebraic-graphs] OK: bind (vertices xs) f == overlays (map f xs)
  21842. 1207.93 s [algebraic-graphs] OK: bind x (const empty) == empty
  21843. 1207.93 s [algebraic-graphs] OK: bind x vertex == x
  21844. 1207.93 s [algebraic-graphs] OK: bind (bind x f) g == bind x (\y -> bind (f y) g)
  21845. 1207.93 s [algebraic-graphs]
  21846. 1207.93 s [algebraic-graphs] ============ Graph.simplify ============
  21847. 1207.93 s [algebraic-graphs] OK: simplify == id
  21848. 1207.93 s [algebraic-graphs] OK: size (simplify x) <= size x
  21849. 1207.93 s [algebraic-graphs]
  21850. 1207.93 s [algebraic-graphs] ============ Graph.box ============
  21851. 1207.93 s [algebraic-graphs] OK: box x y ~~ box y x
  21852. 1207.93 s [algebraic-graphs] OK: box x (overlay y z) == overlay (box x y) (box x z)
  21853. 1207.93 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  21854. 1207.93 s [algebraic-graphs] OK: box x empty ~~ empty
  21855. 1207.93 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  21856. 1207.93 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  21857. 1207.93 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  21858. 1207.93 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  21859. 1207.93 s [algebraic-graphs]
  21860. 1207.93 s [algebraic-graphs] ============ Graph.sparsify ============
  21861. 1207.93 s [algebraic-graphs] OK: sort . reachable x == sort . rights . reachable (sparsify x) . Right
  21862. 1207.93 s [algebraic-graphs] OK: vertexCount (sparsify x) <= vertexCount x + size x + 1
  21863. 1207.93 s [algebraic-graphs] OK: edgeCount (sparsify x) <= 3 * size x
  21864. 1207.93 s [algebraic-graphs] OK: size (sparsify x) <= 3 * size x
  21865. 1207.93 s [algebraic-graphs]
  21866. 1207.93 s [algebraic-graphs] ============ Graph.sparsifyKL ============
  21867. 1207.93 s [algebraic-graphs] OK: sort . reachable x == sort . filter (<= n) . reachable (sparsifyKL n x)
  21868. 1207.93 s [algebraic-graphs] OK: length (vertices $ sparsifyKL n x) <= vertexCount x + size x + 1
  21869. 1207.93 s [algebraic-graphs] OK: length (edges $ sparsifyKL n x) <= 3 * size x
  21870. 1207.93 s [algebraic-graphs]
  21871. 1207.93 s [algebraic-graphs] ============ Graph.context ============
  21872. 1207.93 s [algebraic-graphs] OK: context (const False) x == Nothing
  21873. 1207.93 s [algebraic-graphs] OK: context (== 1) (edge 1 2) == Just (Context [ ] [2 ])
  21874. 1207.93 s [algebraic-graphs] OK: context (== 2) (edge 1 2) == Just (Context [1 ] [ ])
  21875. 1207.93 s [algebraic-graphs] OK: context (const True ) (edge 1 2) == Just (Context [1 ] [2 ])
  21876. 1207.93 s [algebraic-graphs] OK: context (== 4) (3 * 1 * 4 * 1 * 5) == Just (Context [3,1] [1,5])
  21877. 1207.93 s [algebraic-graphs]
  21878. 1207.93 s [algebraic-graphs] ============ Graph.buildg ============
  21879. 1207.93 s [algebraic-graphs] OK: buildg (\e _ _ _ -> e) == empty
  21880. 1207.93 s [algebraic-graphs] OK: buildg (\_ v _ _ -> v x) == vertex x
  21881. 1207.93 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
  21882. 1207.93 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
  21883. 1207.93 s [algebraic-graphs] OK: buildg (\e v o _ -> foldr o e (map v xs)) == vertices xs
  21884. 1207.93 s [algebraic-graphs] OK: buildg (\e v o c -> foldg e v o (flip c) g) == transpose g
  21885. 1207.93 s [algebraic-graphs]
  21886. 1207.93 s [algebraic-graphs] ============ Internal.List ============
  21887. 1207.93 s [algebraic-graphs] OK: pure 1 <> pure 4 == [1, 4]
  21888. 1207.93 s [algebraic-graphs]
  21889. 1207.93 s [algebraic-graphs] ============ Graph.Label ============
  21890. 1207.93 s [algebraic-graphs]
  21891. 1207.93 s [algebraic-graphs] ============ Any: instances ============
  21892. 1207.93 s [algebraic-graphs] OK: Semiring
  21893. 1207.93 s [algebraic-graphs] OK: StarSemiring
  21894. 1207.93 s [algebraic-graphs] OK: Dioid
  21895. 1207.93 s [algebraic-graphs]
  21896. 1207.93 s [algebraic-graphs] ============ Distance Int: instances ============
  21897. 1207.93 s [algebraic-graphs] OK: Semiring
  21898. 1207.93 s [algebraic-graphs] OK: StarSemiring
  21899. 1207.93 s [algebraic-graphs] OK: Dioid
  21900. 1207.93 s [algebraic-graphs]
  21901. 1207.93 s [algebraic-graphs] ============ Capacity Int: instances ============
  21902. 1207.93 s [algebraic-graphs] OK: Semiring
  21903. 1207.93 s [algebraic-graphs] OK: StarSemiring
  21904. 1207.93 s [algebraic-graphs] OK: Dioid
  21905. 1207.93 s [algebraic-graphs]
  21906. 1207.93 s [algebraic-graphs] ============ Minimum (Path Int): instances ============
  21907. 1207.93 s [algebraic-graphs] OK: LeftNearRing
  21908. 1207.93 s [algebraic-graphs]
  21909. 1207.93 s [algebraic-graphs] ============ PowerSet (Path Int): instances ============
  21910. 1207.93 s [algebraic-graphs] OK: Semiring
  21911. 1207.93 s [algebraic-graphs] OK: Dioid
  21912. 1207.93 s [algebraic-graphs]
  21913. 1207.93 s [algebraic-graphs] ============ Count Int: instances ============
  21914. 1207.93 s [algebraic-graphs] OK: Semiring
  21915. 1207.93 s [algebraic-graphs] OK: StarSemiring
  21916. 1207.93 s [algebraic-graphs]
  21917. 1207.93 s [algebraic-graphs] ============ Labelled.AdjacencyMap.consistent ============
  21918. 1207.93 s [algebraic-graphs] OK: arbitraryLabelledAdjacencyMap
  21919. 1207.93 s [algebraic-graphs] OK: empty
  21920. 1207.93 s [algebraic-graphs] OK: vertex
  21921. 1207.93 s [algebraic-graphs] OK: edge
  21922. 1207.93 s [algebraic-graphs] OK: overlay
  21923. 1207.93 s [algebraic-graphs] OK: connect
  21924. 1207.93 s [algebraic-graphs] OK: vertices
  21925. 1207.93 s [algebraic-graphs] OK: edges
  21926. 1207.93 s [algebraic-graphs] OK: overlays
  21927. 1207.93 s [algebraic-graphs] OK: fromAdjacencyMaps
  21928. 1207.93 s [algebraic-graphs] OK: removeVertex
  21929. 1207.93 s [algebraic-graphs] OK: removeEdge
  21930. 1207.93 s [algebraic-graphs] OK: replaceVertex
  21931. 1207.93 s [algebraic-graphs] OK: replaceEdge
  21932. 1207.93 s [algebraic-graphs] OK: transpose
  21933. 1207.93 s [algebraic-graphs] OK: gmap
  21934. 1207.93 s [algebraic-graphs] OK: emap
  21935. 1207.93 s [algebraic-graphs] OK: induce
  21936. 1207.93 s [algebraic-graphs] OK: closure
  21937. 1207.93 s [algebraic-graphs] OK: reflexiveClosure
  21938. 1207.93 s [algebraic-graphs] OK: symmetricClosure
  21939. 1207.93 s [algebraic-graphs] OK: transitiveClosure
  21940. 1207.93 s [algebraic-graphs]
  21941. 1207.93 s [algebraic-graphs] ============ Labelled.AdjacencyMap.empty ============
  21942. 1207.93 s [algebraic-graphs] OK: isEmpty empty == True
  21943. 1207.93 s [algebraic-graphs] OK: hasVertex x empty == False
  21944. 1207.93 s [algebraic-graphs] OK: vertexCount empty == 0
  21945. 1207.93 s [algebraic-graphs] OK: edgeCount empty == 0
  21946. 1207.93 s [algebraic-graphs]
  21947. 1207.93 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertex ============
  21948. 1207.93 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  21949. 1207.93 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  21950. 1207.93 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  21951. 1207.93 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  21952. 1207.93 s [algebraic-graphs]
  21953. 1210.43 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edge ============
  21954. 1210.43 s [algebraic-graphs] OK: edge e x y == connect e (vertex x) (vertex y)
  21955. 1210.43 s [algebraic-graphs] OK: edge zero x y == vertices [x,y]
  21956. 1210.43 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= mempty)
  21957. 1210.43 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  21958. 1210.43 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == mempty then 0 else 1
  21959. 1210.43 s [algebraic-graphs] OK: vertexCount (edge e 1 1) == 1
  21960. 1210.43 s [algebraic-graphs] OK: vertexCount (edge e 1 2) == 2
  21961. 1210.43 s [algebraic-graphs] OK: x -<e>- y == edge e x y
  21962. 1210.43 s [algebraic-graphs]
  21963. 1210.43 s [algebraic-graphs] ============ Labelled.AdjacencyMap.overlay ============
  21964. 1210.43 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  21965. 1210.43 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  21966. 1210.43 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  21967. 1210.43 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  21968. 1210.43 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  21969. 1210.43 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  21970. 1210.43 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  21971. 1210.43 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  21972. 1210.43 s [algebraic-graphs]
  21973. 1210.43 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge zero x y) == e
  21974. 1210.43 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge f x y) == e <+> f
  21975. 1210.43 s [algebraic-graphs]
  21976. 1210.43 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge one 2 3)) == e
  21977. 1210.43 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge f 2 3)) == e <.> f
  21978. 1210.43 s [algebraic-graphs]
  21979. 1210.43 s [algebraic-graphs] ============ Labelled.AdjacencyMap.connect ============
  21980. 1210.43 s [algebraic-graphs] OK: isEmpty (connect e x y) == isEmpty x && isEmpty y
  21981. 1210.43 s [algebraic-graphs] OK: hasVertex z (connect e x y) == hasVertex z x || hasVertex z y
  21982. 1210.43 s [algebraic-graphs] OK: vertexCount (connect e x y) >= vertexCount x
  21983. 1210.43 s [algebraic-graphs] OK: vertexCount (connect e x y) <= vertexCount x + vertexCount y
  21984. 1210.43 s [algebraic-graphs] OK: edgeCount (connect e x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  21985. 1210.43 s [algebraic-graphs] OK: vertexCount (connect e 1 2) == 2
  21986. 1210.43 s [algebraic-graphs] OK: edgeCount (connect e 1 2) == if e == zero then 0 else 1
  21987. 1210.43 s [algebraic-graphs]
  21988. 1210.43 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertices ============
  21989. 1210.43 s [algebraic-graphs] OK: vertices [] == empty
  21990. 1210.43 s [algebraic-graphs] OK: vertices [x] == vertex x
  21991. 1210.43 s [algebraic-graphs] OK: vertices == overlays . map vertex
  21992. 1210.43 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  21993. 1210.43 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  21994. 1210.43 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  21995. 1210.43 s [algebraic-graphs]
  21996. 1210.43 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edges ============
  21997. 1210.43 s [algebraic-graphs] OK: edges [] == empty
  21998. 1210.43 s [algebraic-graphs] OK: edges [(e,x,y)] == edge e x y
  21999. 1210.43 s [algebraic-graphs] OK: edges == overlays . map (\(e, x, y) -> edge e x y)
  22000. 1210.43 s [algebraic-graphs]
  22001. 1210.43 s [algebraic-graphs] ============ Labelled.AdjacencyMap.overlays ============
  22002. 1210.43 s [algebraic-graphs] OK: overlays [] == empty
  22003. 1210.43 s [algebraic-graphs] OK: overlays [x] == x
  22004. 1210.43 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  22005. 1210.43 s [algebraic-graphs] OK: overlays == foldr overlay empty
  22006. 1210.43 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  22007. 1210.43 s [algebraic-graphs]
  22008. 1210.43 s [algebraic-graphs] ============ Labelled.AdjacencyMap.fromAdjacencyMaps ============
  22009. 1210.43 s [algebraic-graphs] OK: fromAdjacencyMaps [] == empty
  22010. 1210.43 s [algebraic-graphs] OK: fromAdjacencyMaps [(x, Map.empty)] == vertex x
  22011. 1210.43 s [algebraic-graphs] OK: fromAdjacencyMaps [(x, Map.singleton y e)] == if e == zero then vertices [x,y] else edge e x y
  22012. 1210.43 s [algebraic-graphs] OK: overlay (fromAdjacencyMaps xs) (fromAdjacencyMaps ys) == fromAdjacencyMaps (xs ++ ys)
  22013. 1210.43 s [algebraic-graphs]
  22014. 1210.43 s [algebraic-graphs] ============ Labelled.AdjacencyMap.isSubgraphOf ============
  22015. 1210.43 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  22016. 1210.43 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  22017. 1210.43 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  22018. 1210.43 s [algebraic-graphs]
  22019. 1210.43 s [algebraic-graphs] ============ Labelled.AdjacencyMap.isEmpty ============
  22020. 1210.43 s [algebraic-graphs] OK: isEmpty empty == True
  22021. 1210.43 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  22022. 1210.43 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  22023. 1210.43 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  22024. 1210.43 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge e x y) == False
  22025. 1210.43 s [algebraic-graphs]
  22026. 1210.43 s [algebraic-graphs] ============ Labelled.AdjacencyMap.hasVertex ============
  22027. 1210.43 s [algebraic-graphs] OK: hasVertex x empty == False
  22028. 1210.43 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  22029. 1210.43 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  22030. 1210.43 s [algebraic-graphs]
  22031. 1210.43 s [algebraic-graphs] ============ Labelled.AdjacencyMap.hasEdge ============
  22032. 1210.43 s [algebraic-graphs] OK: hasEdge x y empty == False
  22033. 1210.43 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  22034. 1210.43 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= zero)
  22035. 1210.43 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  22036. 1210.43 s [algebraic-graphs] OK: hasEdge x y == not . null . filter (\(_,ex,ey) -> ex == x && ey == y) . edgeList
  22037. 1210.43 s [algebraic-graphs]
  22038. 1210.43 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edgeLabel ============
  22039. 1210.43 s [algebraic-graphs] OK: edgeLabel x y empty == zero
  22040. 1210.43 s [algebraic-graphs] OK: edgeLabel x y (vertex z) == zero
  22041. 1210.43 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  22042. 1210.43 s [algebraic-graphs] OK: edgeLabel s t (overlay x y) == edgeLabel s t x + edgeLabel s t y
  22043. 1210.43 s [algebraic-graphs]
  22044. 1210.43 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertexCount ============
  22045. 1210.43 s [algebraic-graphs] OK: vertexCount empty == 0
  22046. 1210.43 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  22047. 1210.43 s [algebraic-graphs] OK: vertexCount == length . vertexList
  22048. 1210.43 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  22049. 1210.43 s [algebraic-graphs]
  22050. 1210.43 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edgeCount ============
  22051. 1210.43 s [algebraic-graphs] OK: edgeCount empty == 0
  22052. 1210.43 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  22053. 1210.43 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == zero then 0 else 1
  22054. 1210.43 s [algebraic-graphs] OK: edgeCount == length . edgeList
  22055. 1210.43 s [algebraic-graphs]
  22056. 1210.43 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertexList ============
  22057. 1210.43 s [algebraic-graphs] OK: vertexList empty == []
  22058. 1210.43 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  22059. 1210.43 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  22060. 1210.43 s [algebraic-graphs]
  22061. 1210.43 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edgeList ============
  22062. 1210.43 s [algebraic-graphs] OK: edgeList empty == []
  22063. 1210.43 s [algebraic-graphs] OK: edgeList (vertex x) == []
  22064. 1210.43 s [algebraic-graphs] OK: edgeList (edge e x y) == if e == zero then [] else [(e,x,y)]
  22065. 1210.43 s [algebraic-graphs]
  22066. 1210.43 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertexSet ============
  22067. 1210.43 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  22068. 1210.43 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  22069. 1210.43 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  22070. 1210.43 s [algebraic-graphs]
  22071. 1210.43 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edgeSet ============
  22072. 1210.43 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  22073. 1210.43 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  22074. 1210.43 s [algebraic-graphs] OK: edgeSet (edge e x y) == if e == zero then Set.empty else Set.singleton (e,x,y)
  22075. 1210.43 s [algebraic-graphs]
  22076. 1210.43 s [algebraic-graphs] ============ Labelled.AdjacencyMap.preSet ============
  22077. 1210.43 s [algebraic-graphs] OK: preSet x empty == Set.empty
  22078. 1210.43 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  22079. 1210.43 s [algebraic-graphs] OK: preSet 1 (edge e 1 2) == Set.empty
  22080. 1210.43 s [algebraic-graphs] OK: preSet y (edge e x y) == if e == zero then Set.empty else Set.fromList [x]
  22081. 1210.43 s [algebraic-graphs]
  22082. 1210.43 s [algebraic-graphs] ============ Labelled.AdjacencyMap.postSet ============
  22083. 1210.43 s [algebraic-graphs] OK: postSet x empty == Set.empty
  22084. 1210.43 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  22085. 1210.43 s [algebraic-graphs] OK: postSet x (edge e x y) == if e == zero then Set.empty else Set.fromList [y]
  22086. 1210.43 s [algebraic-graphs] OK: postSet 2 (edge e 1 2) == Set.empty
  22087. 1210.43 s [algebraic-graphs]
  22088. 1210.43 s [algebraic-graphs] ============ Labelled.AdjacencyMap.skeleton ============
  22089. 1210.43 s [algebraic-graphs] OK: hasEdge x y == hasEdge x y . skeleton
  22090. 1210.43 s [algebraic-graphs]
  22091. 1210.43 s [algebraic-graphs] ============ Labelled.AdjacencyMap.removeVertex ============
  22092. 1210.43 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  22093. 1210.43 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  22094. 1210.43 s [algebraic-graphs] OK: removeVertex x (edge e x x) == empty
  22095. 1210.43 s [algebraic-graphs] OK: removeVertex 1 (edge e 1 2) == vertex 2
  22096. 1210.43 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  22097. 1210.43 s [algebraic-graphs]
  22098. 1210.43 s [algebraic-graphs] ============ Labelled.AdjacencyMap.removeEdge ============
  22099. 1210.43 s [algebraic-graphs] OK: removeEdge x y (edge e x y) == vertices [x,y]
  22100. 1210.43 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  22101. 1210.43 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  22102. 1210.43 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  22103. 1210.43 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  22104. 1210.43 s [algebraic-graphs]
  22105. 1210.43 s [algebraic-graphs] ============ Labelled.AdjacencyMap.replaceVertex ============
  22106. 1210.43 s [algebraic-graphs] OK: replaceVertex x x == id
  22107. 1210.43 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  22108. 1210.43 s [algebraic-graphs] OK: replaceVertex x y == gmap (\v -> if v == x then y else v)
  22109. 1210.43 s [algebraic-graphs]
  22110. 1210.43 s [algebraic-graphs] ============ Labelled.AdjacencyMap.replaceEdge ============
  22111. 1210.43 s [algebraic-graphs] OK: replaceEdge e x y z == overlay (removeEdge x y z) (edge e x y)
  22112. 1210.43 s [algebraic-graphs] OK: replaceEdge e x y (edge f x y) == edge e x y
  22113. 1210.43 s [algebraic-graphs] OK: edgeLabel x y (replaceEdge e x y z) == e
  22114. 1210.43 s [algebraic-graphs]
  22115. 1210.43 s [algebraic-graphs] ============ Labelled.AdjacencyMap.transpose ============
  22116. 1210.43 s [algebraic-graphs] OK: transpose empty == empty
  22117. 1210.43 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  22118. 1210.43 s [algebraic-graphs] OK: transpose (edge e x y) == edge e y x
  22119. 1210.43 s [algebraic-graphs] OK: transpose . transpose == id
  22120. 1210.43 s [algebraic-graphs]
  22121. 1210.43 s [algebraic-graphs] ============ Labelled.AdjacencyMap.gmap ============
  22122. 1210.43 s [algebraic-graphs] OK: gmap f empty == empty
  22123. 1210.43 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  22124. 1210.43 s [algebraic-graphs] OK: gmap f (edge e x y) == edge e (f x) (f y)
  22125. 1210.43 s [algebraic-graphs] OK: gmap id == id
  22126. 1210.43 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  22127. 1210.43 s [algebraic-graphs]
  22128. 1210.43 s [algebraic-graphs] ============ Labelled.AdjacencyMap.emap ============
  22129. 1210.43 s [algebraic-graphs] OK: emap h empty == empty
  22130. 1210.43 s [algebraic-graphs] OK: emap h (vertex x) == vertex x
  22131. 1210.43 s [algebraic-graphs] OK: emap h (edge e x y) == edge (h e) x y
  22132. 1210.43 s [algebraic-graphs] OK: emap h (overlay x y) == overlay (emap h x) (emap h y)
  22133. 1210.43 s [algebraic-graphs] OK: emap h (connect e x y) == connect (h e) (emap h x) (emap h y)
  22134. 1210.43 s [algebraic-graphs] OK: emap id == id
  22135. 1210.43 s [algebraic-graphs] OK: emap g . emap h == emap (g . h)
  22136. 1210.43 s [algebraic-graphs]
  22137. 1210.43 s [algebraic-graphs] ============ Labelled.AdjacencyMap.induce ============
  22138. 1210.43 s [algebraic-graphs] OK: induce (const True ) x == x
  22139. 1210.43 s [algebraic-graphs] OK: induce (const False) x == empty
  22140. 1210.43 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  22141. 1210.43 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  22142. 1210.43 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  22143. 1210.43 s [algebraic-graphs]
  22144. 1210.43 s [algebraic-graphs] ============ Labelled.AdjacencyMap.induceJust ============
  22145. 1211.68 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  22146. 1211.68 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  22147. 1211.68 s [algebraic-graphs] OK: induceJust . gmap Just == id
  22148. 1211.68 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  22149. 1211.68 s [algebraic-graphs]
  22150. 1211.68 s [algebraic-graphs] ============ Labelled.AdjacencyMap.closure ============
  22151. 1211.68 s [algebraic-graphs] OK: closure empty == empty
  22152. 1211.68 s [algebraic-graphs] OK: closure (vertex x) == edge one x x
  22153. 1211.68 s [algebraic-graphs] OK: closure (edge e x x) == edge one x x
  22154. 1211.68 s [algebraic-graphs] OK: closure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  22155. 1211.68 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  22156. 1211.68 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  22157. 1211.68 s [algebraic-graphs] OK: closure . closure == closure
  22158. 1211.68 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  22159. 1211.68 s [algebraic-graphs]
  22160. 1211.68 s [algebraic-graphs] ============ Labelled.AdjacencyMap.reflexiveClosure ============
  22161. 1211.68 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  22162. 1211.68 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge one x x
  22163. 1211.68 s [algebraic-graphs] OK: reflexiveClosure (edge e x x) == edge one x x
  22164. 1211.68 s [algebraic-graphs] OK: reflexiveClosure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  22165. 1211.68 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  22166. 1211.68 s [algebraic-graphs]
  22167. 1211.68 s [algebraic-graphs] ============ Labelled.AdjacencyMap.symmetricClosure ============
  22168. 1211.68 s [algebraic-graphs] OK: symmetricClosure empty == empty
  22169. 1211.68 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  22170. 1211.68 s [algebraic-graphs] OK: symmetricClosure (edge e x y) == edges [(e,x,y), (e,y,x)]
  22171. 1211.68 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  22172. 1211.68 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  22173. 1211.68 s [algebraic-graphs]
  22174. 1211.68 s [algebraic-graphs] ============ Labelled.AdjacencyMap.transitiveClosure ============
  22175. 1211.68 s [algebraic-graphs] OK: transitiveClosure empty == empty
  22176. 1211.68 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  22177. 1211.68 s [algebraic-graphs] OK: transitiveClosure (edge e x y) == edge e x y
  22178. 1211.68 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  22179. 1211.68 s [algebraic-graphs]
  22180. 1211.68 s [algebraic-graphs] ============ Labelled.Graph.empty ============
  22181. 1211.68 s [algebraic-graphs] OK: isEmpty empty == True
  22182. 1211.68 s [algebraic-graphs] OK: hasVertex x empty == False
  22183. 1211.68 s [algebraic-graphs] OK: vertexCount empty == 0
  22184. 1211.68 s [algebraic-graphs] OK: edgeCount empty == 0
  22185. 1211.68 s [algebraic-graphs]
  22186. 1211.68 s [algebraic-graphs] ============ Labelled.Graph.vertex ============
  22187. 1211.68 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  22188. 1211.68 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  22189. 1211.68 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  22190. 1211.68 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  22191. 1211.68 s [algebraic-graphs]
  22192. 1211.68 s [algebraic-graphs] ============ Labelled.Graph.edge ============
  22193. 1211.68 s [algebraic-graphs] OK: edge e x y == connect e (vertex x) (vertex y)
  22194. 1211.68 s [algebraic-graphs] OK: edge zero x y == vertices [x,y]
  22195. 1211.68 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= mempty)
  22196. 1211.68 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  22197. 1211.68 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == mempty then 0 else 1
  22198. 1211.68 s [algebraic-graphs] OK: vertexCount (edge e 1 1) == 1
  22199. 1211.68 s [algebraic-graphs] OK: vertexCount (edge e 1 2) == 2
  22200. 1211.68 s [algebraic-graphs] OK: x -<e>- y == edge e x y
  22201. 1211.68 s [algebraic-graphs]
  22202. 1211.68 s [algebraic-graphs] ============ Labelled.Graph.overlay ============
  22203. 1211.68 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  22204. 1211.68 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  22205. 1211.68 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  22206. 1211.68 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  22207. 1211.68 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  22208. 1211.68 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  22209. 1211.68 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  22210. 1211.68 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  22211. 1211.68 s [algebraic-graphs]
  22212. 1211.68 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge zero x y) == e
  22213. 1211.68 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge f x y) == e <+> f
  22214. 1211.68 s [algebraic-graphs]
  22215. 1211.69 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge one 2 3)) == e
  22216. 1211.69 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge f 2 3)) == e <.> f
  22217. 1211.69 s [algebraic-graphs]
  22218. 1211.69 s [algebraic-graphs] ============ Labelled.Graph.connect ============
  22219. 1211.69 s [algebraic-graphs] OK: isEmpty (connect e x y) == isEmpty x && isEmpty y
  22220. 1211.69 s [algebraic-graphs] OK: hasVertex z (connect e x y) == hasVertex z x || hasVertex z y
  22221. 1211.69 s [algebraic-graphs] OK: vertexCount (connect e x y) >= vertexCount x
  22222. 1211.69 s [algebraic-graphs] OK: vertexCount (connect e x y) <= vertexCount x + vertexCount y
  22223. 1211.69 s [algebraic-graphs] OK: edgeCount (connect e x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  22224. 1211.69 s [algebraic-graphs] OK: vertexCount (connect e 1 2) == 2
  22225. 1211.69 s [algebraic-graphs] OK: edgeCount (connect e 1 2) == if e == zero then 0 else 1
  22226. 1211.69 s [algebraic-graphs]
  22227. 1211.69 s [algebraic-graphs] ============ Labelled.Graph.vertices ============
  22228. 1211.69 s [algebraic-graphs] OK: vertices [] == empty
  22229. 1211.69 s [algebraic-graphs] OK: vertices [x] == vertex x
  22230. 1211.69 s [algebraic-graphs] OK: vertices == overlays . map vertex
  22231. 1211.69 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  22232. 1211.69 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  22233. 1211.69 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  22234. 1211.69 s [algebraic-graphs]
  22235. 1211.69 s [algebraic-graphs] ============ Labelled.Graph.edges ============
  22236. 1211.69 s [algebraic-graphs] OK: edges [] == empty
  22237. 1211.69 s [algebraic-graphs] OK: edges [(e,x,y)] == edge e x y
  22238. 1211.69 s [algebraic-graphs] OK: edges == overlays . map (\(e, x, y) -> edge e x y)
  22239. 1211.69 s [algebraic-graphs]
  22240. 1211.69 s [algebraic-graphs] ============ Labelled.Graph.overlays ============
  22241. 1211.69 s [algebraic-graphs] OK: overlays [] == empty
  22242. 1211.69 s [algebraic-graphs] OK: overlays [x] == x
  22243. 1211.69 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  22244. 1211.69 s [algebraic-graphs] OK: overlays == foldr overlay empty
  22245. 1211.69 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  22246. 1211.69 s [algebraic-graphs]
  22247. 1211.69 s [algebraic-graphs] ============ Labelled.Graph.foldg ============
  22248. 1211.69 s [algebraic-graphs] OK: foldg empty vertex connect == id
  22249. 1211.69 s [algebraic-graphs] OK: foldg empty vertex (fmap flip connect) == transpose
  22250. 1211.69 s [algebraic-graphs] OK: foldg 1 (const 1) (const (+)) == size
  22251. 1211.69 s [algebraic-graphs] OK: foldg True (const False) (const (&&)) == isEmpty
  22252. 1211.69 s [algebraic-graphs] OK: foldg False (== x) (const (||)) == hasVertex x
  22253. 1211.69 s [algebraic-graphs] OK: foldg Set.empty Set.singleton (const Set.union) == vertexSet
  22254. 1211.69 s [algebraic-graphs]
  22255. 1211.69 s [algebraic-graphs] ============ Labelled.Graph.buildg ============
  22256. 1211.69 s [algebraic-graphs] OK: buildg (\e _ _ -> e) == empty
  22257. 1211.69 s [algebraic-graphs] OK: buildg (\_ v _ -> v x) == vertex x
  22258. 1211.69 s [algebraic-graphs] OK: buildg (\e v c -> c l (foldg e v c x) (foldg e v c y)) == connect l x y
  22259. 1211.69 s [algebraic-graphs] OK: buildg (\e v c -> foldr (c zero) e (map v xs)) == vertices xs
  22260. 1211.69 s [algebraic-graphs] OK: buildg (\e v c -> foldg e v (flip c) g) == transpose g
  22261. 1211.69 s [algebraic-graphs]
  22262. 1211.69 s [algebraic-graphs] ============ Labelled.Graph.isSubgraphOf ============
  22263. 1211.69 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  22264. 1211.69 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  22265. 1211.69 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  22266. 1211.69 s [algebraic-graphs]
  22267. 1211.69 s [algebraic-graphs] ============ Labelled.Graph.isEmpty ============
  22268. 1211.69 s [algebraic-graphs] OK: isEmpty empty == True
  22269. 1211.69 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  22270. 1211.69 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  22271. 1211.69 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  22272. 1211.69 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge e x y) == False
  22273. 1211.69 s [algebraic-graphs]
  22274. 1211.69 s [algebraic-graphs] ============ Labelled.Graph.size ============
  22275. 1211.69 s [algebraic-graphs] OK: size empty == 1
  22276. 1211.69 s [algebraic-graphs] OK: size (vertex x) == 1
  22277. 1211.69 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  22278. 1211.69 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  22279. 1211.69 s [algebraic-graphs] OK: size x >= 1
  22280. 1211.69 s [algebraic-graphs] OK: size x >= vertexCount x
  22281. 1211.69 s [algebraic-graphs]
  22282. 1211.69 s [algebraic-graphs] ============ Labelled.Graph.hasVertex ============
  22283. 1211.69 s [algebraic-graphs] OK: hasVertex x empty == False
  22284. 1211.69 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  22285. 1211.69 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  22286. 1211.69 s [algebraic-graphs]
  22287. 1211.69 s [algebraic-graphs] ============ Labelled.Graph.hasEdge ============
  22288. 1211.69 s [algebraic-graphs] OK: hasEdge x y empty == False
  22289. 1211.69 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  22290. 1211.69 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= zero)
  22291. 1211.69 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  22292. 1211.69 s [algebraic-graphs] OK: hasEdge x y == not . null . filter (\(_,ex,ey) -> ex == x && ey == y) . edgeList
  22293. 1211.69 s [algebraic-graphs]
  22294. 1211.69 s [algebraic-graphs] ============ Labelled.Graph.edgeLabel ============
  22295. 1211.69 s [algebraic-graphs] OK: edgeLabel x y empty == zero
  22296. 1211.69 s [algebraic-graphs] OK: edgeLabel x y (vertex z) == zero
  22297. 1211.69 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  22298. 1211.69 s [algebraic-graphs] OK: edgeLabel s t (overlay x y) == edgeLabel s t x + edgeLabel s t y
  22299. 1211.69 s [algebraic-graphs]
  22300. 1211.69 s [algebraic-graphs] ============ Labelled.Graph.vertexCount ============
  22301. 1211.69 s [algebraic-graphs] OK: vertexCount empty == 0
  22302. 1211.69 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  22303. 1211.69 s [algebraic-graphs] OK: vertexCount == length . vertexList
  22304. 1211.69 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  22305. 1211.69 s [algebraic-graphs]
  22306. 1211.69 s [algebraic-graphs] ============ Labelled.Graph.edgeCount ============
  22307. 1211.69 s [algebraic-graphs] OK: edgeCount empty == 0
  22308. 1211.69 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  22309. 1211.69 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == zero then 0 else 1
  22310. 1211.69 s [algebraic-graphs] OK: edgeCount == length . edgeList
  22311. 1211.69 s [algebraic-graphs]
  22312. 1211.69 s [algebraic-graphs] ============ Labelled.Graph.vertexList ============
  22313. 1211.69 s [algebraic-graphs] OK: vertexList empty == []
  22314. 1211.69 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  22315. 1211.69 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  22316. 1211.69 s [algebraic-graphs]
  22317. 1211.69 s [algebraic-graphs] ============ Labelled.Graph.edgeList ============
  22318. 1211.69 s [algebraic-graphs] OK: edgeList empty == []
  22319. 1211.69 s [algebraic-graphs] OK: edgeList (vertex x) == []
  22320. 1211.69 s [algebraic-graphs] OK: edgeList (edge e x y) == if e == zero then [] else [(e,x,y)]
  22321. 1211.69 s [algebraic-graphs]
  22322. 1211.69 s [algebraic-graphs] ============ Labelled.Graph.vertexSet ============
  22323. 1211.69 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  22324. 1211.69 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  22325. 1211.69 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  22326. 1211.69 s [algebraic-graphs]
  22327. 1211.69 s [algebraic-graphs] ============ Labelled.Graph.edgeSet ============
  22328. 1211.69 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  22329. 1211.69 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  22330. 1211.69 s [algebraic-graphs] OK: edgeSet (edge e x y) == if e == zero then Set.empty else Set.singleton (e,x,y)
  22331. 1211.69 s [algebraic-graphs]
  22332. 1211.69 s [algebraic-graphs] ============ Labelled.Graph.preSet ============
  22333. 1211.69 s [algebraic-graphs] OK: preSet x empty == Set.empty
  22334. 1211.69 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  22335. 1214.51 s [algebraic-graphs] OK: preSet 1 (edge e 1 2) == Set.empty
  22336. 1214.57 s [algebraic-graphs] OK: preSet y (edge e x y) == if e == zero then Set.empty else Set.fromList [x]
  22337. 1214.57 s [algebraic-graphs]
  22338. 1214.57 s [algebraic-graphs] ============ Labelled.Graph.postSet ============
  22339. 1214.57 s [algebraic-graphs] OK: postSet x empty == Set.empty
  22340. 1214.57 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  22341. 1214.57 s [algebraic-graphs] OK: postSet x (edge e x y) == if e == zero then Set.empty else Set.fromList [y]
  22342. 1214.57 s [algebraic-graphs] OK: postSet 2 (edge e 1 2) == Set.empty
  22343. 1214.57 s [algebraic-graphs]
  22344. 1214.57 s [algebraic-graphs] ============ Labelled.Graph.removeVertex ============
  22345. 1214.57 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  22346. 1214.57 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  22347. 1214.57 s [algebraic-graphs] OK: removeVertex x (edge e x x) == empty
  22348. 1214.57 s [algebraic-graphs] OK: removeVertex 1 (edge e 1 2) == vertex 2
  22349. 1214.57 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  22350. 1214.57 s [algebraic-graphs]
  22351. 1214.57 s [algebraic-graphs] ============ Labelled.Graph.removeEdge ============
  22352. 1214.57 s [algebraic-graphs] OK: removeEdge x y (edge e x y) == vertices [x,y]
  22353. 1214.57 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  22354. 1214.57 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  22355. 1214.57 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  22356. 1214.57 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  22357. 1214.57 s [algebraic-graphs]
  22358. 1214.57 s [algebraic-graphs] ============ Labelled.Graph.replaceVertex ============
  22359. 1214.57 s [algebraic-graphs] OK: replaceVertex x x == id
  22360. 1214.57 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  22361. 1214.57 s [algebraic-graphs] OK: replaceVertex x y == fmap (\v -> if v == x then y else v)
  22362. 1214.57 s [algebraic-graphs]
  22363. 1214.57 s [algebraic-graphs] ============ Labelled.Graph.replaceEdge ============
  22364. 1214.57 s [algebraic-graphs] OK: replaceEdge e x y z == overlay (removeEdge x y z) (edge e x y)
  22365. 1214.57 s [algebraic-graphs] OK: replaceEdge e x y (edge f x y) == edge e x y
  22366. 1214.57 s [algebraic-graphs] OK: edgeLabel x y (replaceEdge e x y z) == e
  22367. 1214.57 s [algebraic-graphs]
  22368. 1214.57 s [algebraic-graphs] ============ Labelled.Graph.transpose ============
  22369. 1214.57 s [algebraic-graphs] OK: transpose empty == empty
  22370. 1214.57 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  22371. 1214.57 s [algebraic-graphs] OK: transpose (edge e x y) == edge e y x
  22372. 1214.57 s [algebraic-graphs] OK: transpose . transpose == id
  22373. 1214.57 s [algebraic-graphs]
  22374. 1214.57 s [algebraic-graphs] ============ Labelled.Graph.fmap ============
  22375. 1214.57 s [algebraic-graphs] OK: fmap f empty == empty
  22376. 1214.57 s [algebraic-graphs] OK: fmap f (vertex x) == vertex (f x)
  22377. 1214.57 s [algebraic-graphs] OK: fmap f (edge e x y) == edge e (f x) (f y)
  22378. 1214.57 s [algebraic-graphs] OK: fmap id == id
  22379. 1214.57 s [algebraic-graphs] OK: fmap f . fmap g == fmap (f . g)
  22380. 1214.57 s [algebraic-graphs]
  22381. 1214.57 s [algebraic-graphs] ============ Labelled.Graph.emap ============
  22382. 1214.57 s [algebraic-graphs] OK: emap h empty == empty
  22383. 1214.57 s [algebraic-graphs] OK: emap h (vertex x) == vertex x
  22384. 1214.57 s [algebraic-graphs] OK: emap h (edge e x y) == edge (h e) x y
  22385. 1214.57 s [algebraic-graphs] OK: emap h (overlay x y) == overlay (emap h x) (emap h y)
  22386. 1214.57 s [algebraic-graphs] OK: emap h (connect e x y) == connect (h e) (emap h x) (emap h y)
  22387. 1214.57 s [algebraic-graphs] OK: emap id == id
  22388. 1214.57 s [algebraic-graphs] OK: emap g . emap h == emap (g . h)
  22389. 1214.57 s [algebraic-graphs]
  22390. 1214.57 s [algebraic-graphs] ============ Labelled.Graph.induce ============
  22391. 1214.57 s [algebraic-graphs] OK: induce (const True ) x == x
  22392. 1214.57 s [algebraic-graphs] OK: induce (const False) x == empty
  22393. 1214.57 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  22394. 1214.57 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  22395. 1214.57 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  22396. 1214.57 s [algebraic-graphs]
  22397. 1214.57 s [algebraic-graphs] ============ Labelled.Graph.induceJust ============
  22398. 1214.57 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  22399. 1214.57 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  22400. 1214.57 s [algebraic-graphs] OK: induceJust . gmap Just == id
  22401. 1214.57 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  22402. 1214.57 s [algebraic-graphs]
  22403. 1214.57 s [algebraic-graphs] ============ Labelled.Graph.closure ============
  22404. 1214.57 s [algebraic-graphs] OK: closure empty == empty
  22405. 1214.57 s [algebraic-graphs] OK: closure (vertex x) == edge one x x
  22406. 1214.57 s [algebraic-graphs] OK: closure (edge e x x) == edge one x x
  22407. 1214.57 s [algebraic-graphs] OK: closure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  22408. 1214.57 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  22409. 1214.57 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  22410. 1214.57 s [algebraic-graphs] OK: closure . closure == closure
  22411. 1214.57 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  22412. 1214.57 s [algebraic-graphs]
  22413. 1214.57 s [algebraic-graphs] ============ Labelled.Graph.reflexiveClosure ============
  22414. 1214.57 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  22415. 1214.57 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge one x x
  22416. 1214.57 s [algebraic-graphs] OK: reflexiveClosure (edge e x x) == edge one x x
  22417. 1214.57 s [algebraic-graphs] OK: reflexiveClosure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  22418. 1214.57 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  22419. 1214.57 s [algebraic-graphs]
  22420. 1214.57 s [algebraic-graphs] ============ Labelled.Graph.symmetricClosure ============
  22421. 1214.57 s [algebraic-graphs] OK: symmetricClosure empty == empty
  22422. 1214.57 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  22423. 1214.57 s [algebraic-graphs] OK: symmetricClosure (edge e x y) == edges [(e,x,y), (e,y,x)]
  22424. 1214.57 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  22425. 1214.57 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  22426. 1214.57 s [algebraic-graphs]
  22427. 1214.57 s [algebraic-graphs] ============ Labelled.Graph.transitiveClosure ============
  22428. 1214.57 s [algebraic-graphs] OK: transitiveClosure empty == empty
  22429. 1214.57 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  22430. 1214.57 s [algebraic-graphs] OK: transitiveClosure (edge e x y) == edge e x y
  22431. 1214.57 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  22432. 1214.57 s [algebraic-graphs]
  22433. 1214.57 s [algebraic-graphs] ============ Labelled.Graph.context ============
  22434. 1214.57 s [algebraic-graphs] OK: context (const False) x == Nothing
  22435. 1214.57 s [algebraic-graphs] OK: context (== 1) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [] [(e,2)])
  22436. 1214.57 s [algebraic-graphs] OK: context (== 2) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [(e,1)] [] )
  22437. 1214.57 s [algebraic-graphs] OK: context (const True ) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [(e,1)] [(e,2)])
  22438. 1214.57 s [algebraic-graphs] OK: context (== 4) (3 * 1 * 4 * 1 * 5) == Just (Context [(one,3), (one,1)] [(one,1), (one,5)])
  22439. 1214.57 s [algebraic-graphs]
  22440. 1214.57 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap ============
  22441. 1214.57 s [algebraic-graphs] OK: Axioms of non-empty graphs
  22442. 1214.57 s [algebraic-graphs] OK: Theorems of non-empty graphs
  22443. 1214.57 s [algebraic-graphs]
  22444. 1214.57 s [algebraic-graphs] ============ Ord (NonEmpty.AdjacencyMap a) ============
  22445. 1214.57 s [algebraic-graphs] OK: vertex 1 < vertex 2
  22446. 1214.57 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  22447. 1214.57 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  22448. 1214.57 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  22449. 1214.57 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  22450. 1214.57 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  22451. 1214.57 s [algebraic-graphs] OK: x <= x + y
  22452. 1214.57 s [algebraic-graphs] OK: x + y <= x * y
  22453. 1214.57 s [algebraic-graphs]
  22454. 1214.57 s [algebraic-graphs] ============ Show (NonEmpty.AdjacencyMap a) ============
  22455. 1214.57 s [algebraic-graphs] OK: show (1 :: AdjacencyMap Int) == "vertex 1"
  22456. 1214.57 s [algebraic-graphs] OK: show (1 + 2 :: AdjacencyMap Int) == "vertices1 [1,2]"
  22457. 1214.57 s [algebraic-graphs] OK: show (1 * 2 :: AdjacencyMap Int) == "edge 1 2"
  22458. 1214.57 s [algebraic-graphs] OK: show (1 * 2 * 3 :: AdjacencyMap Int) == "edges1 [(1,2),(1,3),(2,3)]"
  22459. 1214.57 s [algebraic-graphs] OK: show (1 * 2 + 3 :: AdjacencyMap Int) == "overlay (vertex 3) (edge 1 2)"
  22460. 1214.57 s [algebraic-graphs] OK: show (vertex (-1) :: AdjacencyMap Int) == "vertex (-1)"
  22461. 1214.57 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) :: AdjacencyMap Int) == "vertices1 [-2,-1]"
  22462. 1214.57 s [algebraic-graphs] OK: show (vertex (-1) * vertex (-2) :: AdjacencyMap Int) == "edge (-1) (-2)"
  22463. 1214.57 s [algebraic-graphs] OK: show (vertex (-1) * vertex (-2) * vertex (-3) :: AdjacencyMap Int) == "edges1 [(-2,-3),(-1,-3),(-1,-2)]"
  22464. 1214.57 s [algebraic-graphs] OK: show (vertex (-1) * vertex (-2) + vertex (-3) :: AdjacencyMap Int) == "overlay (vertex (-3)) (edge (-1) (-2))"
  22465. 1214.57 s [algebraic-graphs]
  22466. 1214.57 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.toNonEmpty ============
  22467. 1214.57 s [algebraic-graphs] OK: toNonEmpty empty == Nothing
  22468. 1214.57 s [algebraic-graphs] OK: toNonEmpty . fromNonEmpty == Just
  22469. 1214.57 s [algebraic-graphs]
  22470. 1214.57 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.fromNonEmpty ============
  22471. 1214.57 s [algebraic-graphs] OK: isEmpty . fromNonEmpty == const False
  22472. 1214.57 s [algebraic-graphs]
  22473. 1214.57 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertex ============
  22474. 1214.57 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  22475. 1214.57 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  22476. 1214.57 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  22477. 1214.57 s [algebraic-graphs]
  22478. 1214.57 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edge ============
  22479. 1214.57 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  22480. 1214.57 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  22481. 1214.57 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  22482. 1214.57 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  22483. 1214.57 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  22484. 1214.57 s [algebraic-graphs]
  22485. 1214.57 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.overlay ============
  22486. 1214.57 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  22487. 1214.57 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  22488. 1214.57 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  22489. 1214.57 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  22490. 1214.57 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  22491. 1214.57 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  22492. 1214.57 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  22493. 1214.57 s [algebraic-graphs]
  22494. 1214.57 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.connect ============
  22495. 1214.57 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  22496. 1214.57 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  22497. 1214.57 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  22498. 1214.57 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  22499. 1214.57 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  22500. 1214.57 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  22501. 1214.57 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  22502. 1214.57 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  22503. 1214.57 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  22504. 1214.57 s [algebraic-graphs]
  22505. 1214.57 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertices1 ============
  22506. 1214.57 s [algebraic-graphs] OK: vertices1 [x] == vertex x
  22507. 1214.57 s [algebraic-graphs] OK: hasVertex x . vertices1 == elem x
  22508. 1214.57 s [algebraic-graphs] OK: vertexCount . vertices1 == length . nub
  22509. 1214.57 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  22510. 1214.57 s [algebraic-graphs]
  22511. 1214.57 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edges1 ============
  22512. 1214.57 s [algebraic-graphs] OK: edges1 [(x,y)] == edge x y
  22513. 1214.57 s [algebraic-graphs] OK: edges1 == overlays1 . fmap (uncurry edge)
  22514. 1214.57 s [algebraic-graphs] OK: edgeCount . edges1 == length . nub
  22515. 1214.57 s [algebraic-graphs]
  22516. 1217.55 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.overlays1 ============
  22517. 1217.55 s [algebraic-graphs] OK: overlays1 [x] == x
  22518. 1217.55 s [algebraic-graphs] OK: overlays1 [x,y] == overlay x y
  22519. 1217.55 s [algebraic-graphs]
  22520. 1217.55 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.connects1 ============
  22521. 1217.55 s [algebraic-graphs] OK: connects1 [x] == x
  22522. 1217.55 s [algebraic-graphs] OK: connects1 [x,y] == connect x y
  22523. 1217.55 s [algebraic-graphs]
  22524. 1217.55 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.isSubgraphOf ============
  22525. 1217.55 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  22526. 1217.55 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  22527. 1217.55 s [algebraic-graphs] OK: isSubgraphOf (path1 xs) (circuit1 xs) == True
  22528. 1217.55 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  22529. 1217.55 s [algebraic-graphs]
  22530. 1217.55 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.hasVertex ============
  22531. 1217.55 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  22532. 1217.55 s [algebraic-graphs]
  22533. 1217.55 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.hasEdge ============
  22534. 1217.55 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  22535. 1217.55 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  22536. 1217.55 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  22537. 1217.55 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  22538. 1217.55 s [algebraic-graphs]
  22539. 1217.55 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexCount ============
  22540. 1217.55 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  22541. 1217.55 s [algebraic-graphs] OK: vertexCount x >= 1
  22542. 1217.55 s [algebraic-graphs] OK: vertexCount == length . vertexList1
  22543. 1217.55 s [algebraic-graphs]
  22544. 1217.55 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeCount ============
  22545. 1217.55 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  22546. 1217.55 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  22547. 1217.55 s [algebraic-graphs] OK: edgeCount == length . edgeList
  22548. 1217.55 s [algebraic-graphs]
  22549. 1217.55 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexList1 ============
  22550. 1217.55 s [algebraic-graphs] OK: vertexList1 (vertex x) == [x]
  22551. 1217.55 s [algebraic-graphs] OK: vertexList1 . vertices1 == nub . sort
  22552. 1217.55 s [algebraic-graphs]
  22553. 1217.55 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeList ============
  22554. 1217.55 s [algebraic-graphs] OK: edgeList (vertex x) == []
  22555. 1217.55 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  22556. 1217.55 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  22557. 1217.55 s [algebraic-graphs] OK: edgeList . edges1 == nub . sort . toList
  22558. 1217.55 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  22559. 1217.55 s [algebraic-graphs]
  22560. 1217.55 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexSet ============
  22561. 1217.55 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  22562. 1217.55 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  22563. 1217.55 s [algebraic-graphs] OK: vertexSet . clique1 == Set.fromList . toList
  22564. 1217.55 s [algebraic-graphs]
  22565. 1217.55 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeSet ============
  22566. 1217.55 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  22567. 1217.55 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  22568. 1217.55 s [algebraic-graphs] OK: edgeSet . edges1 == Set.fromList . toList
  22569. 1217.55 s [algebraic-graphs]
  22570. 1217.55 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.preSet ============
  22571. 1217.55 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  22572. 1217.55 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  22573. 1217.55 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  22574. 1217.55 s [algebraic-graphs]
  22575. 1217.55 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.postSet ============
  22576. 1217.55 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  22577. 1217.55 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  22578. 1217.55 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  22579. 1217.55 s [algebraic-graphs]
  22580. 1217.55 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.path1 ============
  22581. 1217.55 s [algebraic-graphs] OK: path1 [x] == vertex x
  22582. 1217.55 s [algebraic-graphs] OK: path1 [x,y] == edge x y
  22583. 1217.55 s [algebraic-graphs] OK: path1 . reverse == transpose . path1
  22584. 1217.55 s [algebraic-graphs]
  22585. 1217.55 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.circuit1 ============
  22586. 1217.55 s [algebraic-graphs] OK: circuit1 [x] == edge x x
  22587. 1217.55 s [algebraic-graphs] OK: circuit1 [x,y] == edges1 [(x,y), (y,x)]
  22588. 1217.55 s [algebraic-graphs] OK: circuit1 . reverse == transpose . circuit1
  22589. 1217.55 s [algebraic-graphs]
  22590. 1217.55 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.clique1 ============
  22591. 1217.55 s [algebraic-graphs] OK: clique1 [x] == vertex x
  22592. 1217.55 s [algebraic-graphs] OK: clique1 [x,y] == edge x y
  22593. 1217.55 s [algebraic-graphs] OK: clique1 [x,y,z] == edges1 [(x,y), (x,z), (y,z)]
  22594. 1217.55 s [algebraic-graphs] OK: clique1 (xs <> ys) == connect (clique1 xs) (clique1 ys)
  22595. 1217.55 s [algebraic-graphs] OK: clique1 . reverse == transpose . clique1
  22596. 1217.55 s [algebraic-graphs]
  22597. 1217.55 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.biclique1 ============
  22598. 1217.55 s [algebraic-graphs] OK: biclique1 [x1,x2] [y1,y2] == edges1 [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  22599. 1217.55 s [algebraic-graphs] OK: biclique1 xs ys == connect (vertices1 xs) (vertices1 ys)
  22600. 1217.55 s [algebraic-graphs]
  22601. 1217.55 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.star ============
  22602. 1217.55 s [algebraic-graphs] OK: star x [] == vertex x
  22603. 1217.55 s [algebraic-graphs] OK: star x [y] == edge x y
  22604. 1217.55 s [algebraic-graphs] OK: star x [y,z] == edges1 [(x,y), (x,z)]
  22605. 1217.55 s [algebraic-graphs]
  22606. 1217.55 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.stars1 ============
  22607. 1217.55 s [algebraic-graphs] OK: stars1 [(x, [] )] == vertex x
  22608. 1217.55 s [algebraic-graphs] OK: stars1 [(x, [y])] == edge x y
  22609. 1217.55 s [algebraic-graphs] OK: stars1 [(x, ys )] == star x ys
  22610. 1217.55 s [algebraic-graphs] OK: stars1 == overlays1 . fmap (uncurry star)
  22611. 1217.55 s [algebraic-graphs] OK: overlay (stars1 xs) (stars1 ys) == stars1 (xs <> ys)
  22612. 1217.55 s [algebraic-graphs]
  22613. 1217.55 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.tree ============
  22614. 1217.55 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  22615. 1217.55 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path1 [x,y,z]
  22616. 1217.55 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  22617. 1217.55 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges1 [(1,2), (1,3), (3,4), (3,5)]
  22618. 1217.55 s [algebraic-graphs]
  22619. 1217.56 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.removeVertex1 ============
  22620. 1217.56 s [algebraic-graphs] OK: removeVertex1 x (vertex x) == Nothing
  22621. 1217.56 s [algebraic-graphs] OK: removeVertex1 1 (vertex 2) == Just (vertex 2)
  22622. 1217.56 s [algebraic-graphs] OK: removeVertex1 x (edge x x) == Nothing
  22623. 1217.56 s [algebraic-graphs] OK: removeVertex1 1 (edge 1 2) == Just (vertex 2)
  22624. 1217.56 s [algebraic-graphs] OK: removeVertex1 x >=> removeVertex1 x == removeVertex1 x
  22625. 1217.56 s [algebraic-graphs]
  22626. 1217.56 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.removeEdge ============
  22627. 1217.56 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices1 [x,y]
  22628. 1217.56 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  22629. 1217.56 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  22630. 1217.56 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  22631. 1217.56 s [algebraic-graphs]
  22632. 1217.56 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.replaceVertex ============
  22633. 1217.56 s [algebraic-graphs] OK: replaceVertex x x == id
  22634. 1217.56 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  22635. 1217.56 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  22636. 1217.56 s [algebraic-graphs]
  22637. 1217.56 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.mergeVertices ============
  22638. 1217.56 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  22639. 1217.56 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  22640. 1217.56 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  22641. 1217.56 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  22642. 1217.56 s [algebraic-graphs]
  22643. 1217.56 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.transpose ============
  22644. 1217.56 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  22645. 1217.56 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  22646. 1217.56 s [algebraic-graphs] OK: transpose . transpose == id
  22647. 1217.56 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  22648. 1217.56 s [algebraic-graphs]
  22649. 1217.56 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.gmap ============
  22650. 1217.56 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  22651. 1217.56 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  22652. 1217.56 s [algebraic-graphs] OK: gmap id == id
  22653. 1217.56 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  22654. 1217.56 s [algebraic-graphs]
  22655. 1217.56 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.induce1 ============
  22656. 1217.56 s [algebraic-graphs] OK: induce1 (const True ) x == Just x
  22657. 1217.56 s [algebraic-graphs] OK: induce1 (const False) x == Nothing
  22658. 1217.56 s [algebraic-graphs] OK: induce1 (/= x) == removeVertex1 x
  22659. 1217.56 s [algebraic-graphs] OK: induce1 p >=> induce1 q == induce1 (\x -> p x && q x)
  22660. 1217.56 s [algebraic-graphs]
  22661. 1217.56 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.induceJust1 ============
  22662. 1217.56 s [algebraic-graphs] OK: induceJust1 (vertex Nothing) == Nothing
  22663. 1217.56 s [algebraic-graphs] OK: induceJust1 (edge (Just x) Nothing) == Just (vertex x)
  22664. 1217.56 s [algebraic-graphs] OK: induceJust1 . gmap Just == Just
  22665. 1217.56 s [algebraic-graphs] OK: induceJust1 . gmap (\x -> if p x then Just x else Nothing) == induce1 p
  22666. 1217.56 s [algebraic-graphs]
  22667. 1217.56 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.closure ============
  22668. 1217.56 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  22669. 1217.56 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  22670. 1217.56 s [algebraic-graphs] OK: closure (edge x y) == edges1 [(x,x), (x,y), (y,y)]
  22671. 1217.56 s [algebraic-graphs] OK: closure (path1 $ nub xs) == reflexiveClosure (clique1 $ nub xs)
  22672. 1217.56 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  22673. 1217.56 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  22674. 1217.56 s [algebraic-graphs] OK: closure . closure == closure
  22675. 1217.56 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  22676. 1217.56 s [algebraic-graphs]
  22677. 1217.56 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.reflexiveClosure ============
  22678. 1217.56 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  22679. 1217.56 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  22680. 1217.56 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges1 [(x,x), (x,y), (y,y)]
  22681. 1217.56 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  22682. 1217.56 s [algebraic-graphs]
  22683. 1217.56 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.symmetricClosure ============
  22684. 1217.56 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  22685. 1217.56 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges1 [(x,y), (y,x)]
  22686. 1217.56 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  22687. 1217.56 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  22688. 1217.56 s [algebraic-graphs]
  22689. 1217.56 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.transitiveClosure ============
  22690. 1217.56 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  22691. 1217.56 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  22692. 1217.56 s [algebraic-graphs] OK: transitiveClosure (path1 $ nub xs) == clique1 (nub $ xs)
  22693. 1217.56 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  22694. 1217.56 s [algebraic-graphs]
  22695. 1217.56 s [algebraic-graphs] ============ NonEmpty.Graph.============
  22696. 1217.56 s [algebraic-graphs] OK: Axioms of non-empty graphs
  22697. 1217.56 s [algebraic-graphs] OK: Theorems of non-empty graphs
  22698. 1217.56 s [algebraic-graphs]
  22699. 1217.56 s [algebraic-graphs] ============ Ord (NonEmpty.Graph a) ============
  22700. 1217.56 s [algebraic-graphs] OK: vertex 1 < vertex 2
  22701. 1217.56 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  22702. 1217.56 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  22703. 1217.56 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  22704. 1217.56 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  22705. 1217.56 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  22706. 1217.56 s [algebraic-graphs] OK: x <= x + y
  22707. 1217.56 s [algebraic-graphs] OK: x + y <= x * y
  22708. 1217.56 s [algebraic-graphs]
  22709. 1217.56 s [algebraic-graphs] ============ Functor (NonEmpty.Graph a) ============
  22710. 1217.56 s [algebraic-graphs] OK: fmap f (vertex x) == vertex (f x)
  22711. 1217.56 s [algebraic-graphs] OK: fmap f (edge x y) == edge (f x) (f y)
  22712. 1217.56 s [algebraic-graphs] OK: fmap id == id
  22713. 1217.56 s [algebraic-graphs] OK: fmap f . fmap g == fmap (f . g)
  22714. 1217.56 s [algebraic-graphs]
  22715. 1217.56 s [algebraic-graphs] ============ Monad (NonEmpty.Graph a) ============
  22716. 1217.56 s [algebraic-graphs] OK: (vertex x >>= f) == f x
  22717. 1218.87 s [algebraic-graphs] OK: (edge x y >>= f) == connect (f x) (f y)
  22718. 1218.87 s [algebraic-graphs] OK: (vertices1 xs >>= f) == overlays1 (fmap f xs)
  22719. 1218.87 s [algebraic-graphs] OK: (x >>= vertex) == x
  22720. 1218.87 s [algebraic-graphs] OK: ((x >>= f) >>= g) == (x >>= (\y -> (f y) >>= g))
  22721. 1218.87 s [algebraic-graphs]
  22722. 1218.87 s [algebraic-graphs] ============ NonEmpty.Graph.toNonEmpty ============
  22723. 1218.87 s [algebraic-graphs] OK: toNonEmpty empty == Nothing
  22724. 1218.87 s [algebraic-graphs] OK: toNonEmpty (toGraph x) == Just (x :: NonEmpty.Graph a)
  22725. 1218.87 s [algebraic-graphs]
  22726. 1218.87 s [algebraic-graphs] ============ NonEmpty.Graph.vertex ============
  22727. 1218.87 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  22728. 1218.87 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  22729. 1218.87 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  22730. 1218.87 s [algebraic-graphs] OK: size (vertex x) == 1
  22731. 1218.87 s [algebraic-graphs]
  22732. 1218.87 s [algebraic-graphs] ============ NonEmpty.Graph.edge ============
  22733. 1218.87 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  22734. 1218.87 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  22735. 1218.87 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  22736. 1218.87 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  22737. 1218.87 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  22738. 1218.87 s [algebraic-graphs]
  22739. 1218.87 s [algebraic-graphs] ============ NonEmpty.Graph.overlay ============
  22740. 1218.87 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  22741. 1218.87 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  22742. 1218.87 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  22743. 1218.87 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  22744. 1218.87 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  22745. 1218.87 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  22746. 1218.87 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  22747. 1218.87 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  22748. 1218.87 s [algebraic-graphs]
  22749. 1218.87 s [algebraic-graphs] ============ NonEmpty.Graph.overlay1 ============
  22750. 1218.87 s [algebraic-graphs] OK: overlay1 empty x == x
  22751. 1218.87 s [algebraic-graphs] OK: x /= empty ==> overlay1 x y == overlay (fromJust $ toNonEmpty x) y
  22752. 1218.87 s [algebraic-graphs]
  22753. 1218.87 s [algebraic-graphs] ============ NonEmpty.Graph.connect ============
  22754. 1218.87 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  22755. 1218.87 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  22756. 1218.87 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  22757. 1218.87 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  22758. 1218.87 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  22759. 1218.87 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  22760. 1218.87 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  22761. 1218.87 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  22762. 1218.87 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  22763. 1218.87 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  22764. 1218.87 s [algebraic-graphs]
  22765. 1218.87 s [algebraic-graphs] ============ NonEmpty.Graph.vertices1 ============
  22766. 1218.87 s [algebraic-graphs] OK: vertices1 [x] == vertex x
  22767. 1218.87 s [algebraic-graphs] OK: hasVertex x . vertices1 == elem x
  22768. 1218.87 s [algebraic-graphs] OK: vertexCount . vertices1 == length . nub
  22769. 1218.87 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  22770. 1218.87 s [algebraic-graphs]
  22771. 1218.87 s [algebraic-graphs] ============ NonEmpty.Graph.edges1 ============
  22772. 1218.87 s [algebraic-graphs] OK: edges1 [(x,y)] == edge x y
  22773. 1218.87 s [algebraic-graphs] OK: edges1 == overlays1 . fmap (uncurry edge)
  22774. 1218.87 s [algebraic-graphs] OK: edgeCount . edges1 == length . nub
  22775. 1218.87 s [algebraic-graphs]
  22776. 1218.87 s [algebraic-graphs] ============ NonEmpty.Graph.overlays1 ============
  22777. 1218.87 s [algebraic-graphs] OK: overlays1 [x] == x
  22778. 1218.87 s [algebraic-graphs] OK: overlays1 [x,y] == overlay x y
  22779. 1218.87 s [algebraic-graphs]
  22780. 1218.87 s [algebraic-graphs] ============ NonEmpty.Graph.connects1 ============
  22781. 1218.87 s [algebraic-graphs] OK: connects1 [x] == x
  22782. 1218.87 s [algebraic-graphs] OK: connects1 [x,y] == connect x y
  22783. 1218.87 s [algebraic-graphs]
  22784. 1218.87 s [algebraic-graphs] ============ NonEmpty.Graph.foldg1 ============
  22785. 1218.87 s [algebraic-graphs] OK: foldg1 vertex overlay connect == id
  22786. 1218.87 s [algebraic-graphs] OK: foldg1 vertex overlay (flip connect) == transpose
  22787. 1218.87 s [algebraic-graphs] OK: foldg1 (const 1) (+) (+) == size
  22788. 1218.87 s [algebraic-graphs] OK: foldg1 (== x) (||) (||) == hasVertex x
  22789. 1218.87 s [algebraic-graphs]
  22790. 1218.87 s [algebraic-graphs] ============ NonEmpty.Graph.isSubgraphOf ============
  22791. 1218.87 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  22792. 1218.87 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  22793. 1218.87 s [algebraic-graphs] OK: isSubgraphOf (path1 xs) (circuit1 xs) == True
  22794. 1218.87 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  22795. 1218.87 s [algebraic-graphs]
  22796. 1218.87 s [algebraic-graphs] ============ NonEmpty.Graph.(===) ============
  22797. 1218.87 s [algebraic-graphs] OK: x === x == True
  22798. 1218.87 s [algebraic-graphs] OK: x + y === x + y == True
  22799. 1218.87 s [algebraic-graphs] OK: 1 + 2 === 2 + 1 == False
  22800. 1218.87 s [algebraic-graphs] OK: x + y === x * y == False
  22801. 1218.87 s [algebraic-graphs]
  22802. 1218.87 s [algebraic-graphs] ============ NonEmpty.Graph.size ============
  22803. 1218.87 s [algebraic-graphs] OK: size (vertex x) == 1
  22804. 1218.87 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  22805. 1218.87 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  22806. 1218.87 s [algebraic-graphs] OK: size x >= 1
  22807. 1218.87 s [algebraic-graphs] OK: size x >= vertexCount x
  22808. 1218.87 s [algebraic-graphs]
  22809. 1218.87 s [algebraic-graphs] ============ NonEmpty.Graph.hasVertex ============
  22810. 1218.87 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  22811. 1218.87 s [algebraic-graphs]
  22812. 1218.87 s [algebraic-graphs] ============ NonEmpty.Graph.hasEdge ============
  22813. 1218.87 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  22814. 1218.87 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  22815. 1218.87 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  22816. 1218.87 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  22817. 1218.87 s [algebraic-graphs]
  22818. 1218.87 s [algebraic-graphs] ============ NonEmpty.Graph.vertexCount ============
  22819. 1218.87 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  22820. 1218.87 s [algebraic-graphs] OK: vertexCount x >= 1
  22821. 1218.87 s [algebraic-graphs] OK: vertexCount == length . vertexList1
  22822. 1218.87 s [algebraic-graphs]
  22823. 1218.87 s [algebraic-graphs] ============ NonEmpty.Graph.edgeCount ============
  22824. 1218.87 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  22825. 1218.87 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  22826. 1218.87 s [algebraic-graphs] OK: edgeCount == length . edgeList
  22827. 1218.87 s [algebraic-graphs]
  22828. 1218.87 s [algebraic-graphs] ============ NonEmpty.Graph.vertexList1 ============
  22829. 1218.87 s [algebraic-graphs] OK: vertexList1 (vertex x) == [x]
  22830. 1218.87 s [algebraic-graphs] OK: vertexList1 . vertices1 == nub . sort
  22831. 1218.87 s [algebraic-graphs]
  22832. 1218.87 s [algebraic-graphs] ============ NonEmpty.Graph.edgeList ============
  22833. 1218.87 s [algebraic-graphs] OK: edgeList (vertex x) == []
  22834. 1218.87 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  22835. 1218.87 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  22836. 1218.87 s [algebraic-graphs] OK: edgeList . edges1 == nub . sort . toList
  22837. 1218.87 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  22838. 1218.87 s [algebraic-graphs]
  22839. 1218.87 s [algebraic-graphs] ============ NonEmpty.Graph.vertexSet ============
  22840. 1218.87 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  22841. 1218.87 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  22842. 1218.87 s [algebraic-graphs] OK: vertexSet . clique1 == Set.fromList . toList
  22843. 1218.87 s [algebraic-graphs]
  22844. 1218.87 s [algebraic-graphs] ============ NonEmpty.Graph.edgeSet ============
  22845. 1218.87 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  22846. 1218.87 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  22847. 1218.87 s [algebraic-graphs] OK: edgeSet . edges1 == Set.fromList . toList
  22848. 1218.87 s [algebraic-graphs]
  22849. 1218.87 s [algebraic-graphs] ============ NonEmpty.Graph.path1 ============
  22850. 1218.87 s [algebraic-graphs] OK: path1 [x] == vertex x
  22851. 1218.87 s [algebraic-graphs] OK: path1 [x,y] == edge x y
  22852. 1218.87 s [algebraic-graphs] OK: path1 . reverse == transpose . path1
  22853. 1218.87 s [algebraic-graphs]
  22854. 1218.87 s [algebraic-graphs] ============ NonEmpty.Graph.circuit1 ============
  22855. 1218.87 s [algebraic-graphs] OK: circuit1 [x] == edge x x
  22856. 1218.87 s [algebraic-graphs] OK: circuit1 [x,y] == edges1 [(x,y), (y,x)]
  22857. 1218.87 s [algebraic-graphs] OK: circuit1 . reverse == transpose . circuit1
  22858. 1218.87 s [algebraic-graphs]
  22859. 1218.87 s [algebraic-graphs] ============ NonEmpty.Graph.clique1 ============
  22860. 1218.87 s [algebraic-graphs] OK: clique1 [x] == vertex x
  22861. 1218.87 s [algebraic-graphs] OK: clique1 [x,y] == edge x y
  22862. 1218.87 s [algebraic-graphs] OK: clique1 [x,y,z] == edges1 [(x,y), (x,z), (y,z)]
  22863. 1218.87 s [algebraic-graphs] OK: clique1 (xs <> ys) == connect (clique1 xs) (clique1 ys)
  22864. 1218.87 s [algebraic-graphs] OK: clique1 . reverse == transpose . clique1
  22865. 1218.87 s [algebraic-graphs]
  22866. 1218.87 s [algebraic-graphs] ============ NonEmpty.Graph.biclique1 ============
  22867. 1218.87 s [algebraic-graphs] OK: biclique1 [x1,x2] [y1,y2] == edges1 [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  22868. 1218.87 s [algebraic-graphs] OK: biclique1 xs ys == connect (vertices1 xs) (vertices1 ys)
  22869. 1218.87 s [algebraic-graphs]
  22870. 1218.87 s [algebraic-graphs] ============ NonEmpty.Graph.star ============
  22871. 1218.87 s [algebraic-graphs] OK: star x [] == vertex x
  22872. 1218.87 s [algebraic-graphs] OK: star x [y] == edge x y
  22873. 1218.87 s [algebraic-graphs] OK: star x [y,z] == edges1 [(x,y), (x,z)]
  22874. 1218.87 s [algebraic-graphs]
  22875. 1218.87 s [algebraic-graphs] ============ NonEmpty.Graph.stars1 ============
  22876. 1218.87 s [algebraic-graphs] OK: stars1 [(x, [] )] == vertex x
  22877. 1218.87 s [algebraic-graphs] OK: stars1 [(x, [y])] == edge x y
  22878. 1218.87 s [algebraic-graphs] OK: stars1 [(x, ys )] == star x ys
  22879. 1218.87 s [algebraic-graphs] OK: stars1 == overlays1 . fmap (uncurry star)
  22880. 1218.87 s [algebraic-graphs] OK: overlay (stars1 xs) (stars1 ys) == stars1 (xs <> ys)
  22881. 1218.87 s [algebraic-graphs]
  22882. 1218.87 s [algebraic-graphs] ============ NonEmpty.Graph.tree ============
  22883. 1218.87 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  22884. 1218.87 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path1 [x,y,z]
  22885. 1218.87 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  22886. 1218.87 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges1 [(1,2), (1,3), (3,4), (3,5)]
  22887. 1218.88 s [algebraic-graphs]
  22888. 1218.88 s [algebraic-graphs] ============ NonEmpty.Graph.mesh1 ============
  22889. 1218.88 s [algebraic-graphs] OK: mesh1 [x] [y] == vertex (x, y)
  22890. 1218.88 s [algebraic-graphs] OK: mesh1 xs ys == box (path1 xs) (path1 ys)
  22891. 1218.88 s [algebraic-graphs] OK: mesh1 [1,2,3] ['a', 'b'] == <correct result>
  22892. 1218.88 s [algebraic-graphs] OK: size (mesh xs ys) == max 1 (3 * length xs * length ys - length xs - length ys -1)
  22893. 1218.88 s [algebraic-graphs]
  22894. 1218.88 s [algebraic-graphs] ============ NonEmpty.Graph.torus1 ============
  22895. 1218.88 s [algebraic-graphs] OK: torus1 [x] [y] == edge (x,y) (x,y)
  22896. 1218.88 s [algebraic-graphs] OK: torus1 xs ys == box (circuit1 xs) (circuit1 ys)
  22897. 1218.88 s [algebraic-graphs] OK: torus1 [1,2] ['a', 'b'] == <correct result>
  22898. 1218.88 s [algebraic-graphs] OK: size (torus1 xs ys) == max 1 (3 * length xs * length ys)
  22899. 1218.88 s [algebraic-graphs]
  22900. 1218.88 s [algebraic-graphs] ============ NonEmpty.Graph.removeVertex1 ============
  22901. 1218.88 s [algebraic-graphs] OK: removeVertex1 x (vertex x) == Nothing
  22902. 1218.88 s [algebraic-graphs] OK: removeVertex1 1 (vertex 2) == Just (vertex 2)
  22903. 1218.88 s [algebraic-graphs] OK: removeVertex1 x (edge x x) == Nothing
  22904. 1218.88 s [algebraic-graphs] OK: removeVertex1 1 (edge 1 2) == Just (vertex 2)
  22905. 1218.88 s [algebraic-graphs] OK: removeVertex1 x >=> removeVertex1 x == removeVertex1 x
  22906. 1218.88 s [algebraic-graphs]
  22907. 1218.88 s [algebraic-graphs] ============ NonEmpty.Graph.removeEdge ============
  22908. 1218.88 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices1 [x,y]
  22909. 1218.88 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  22910. 1218.88 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  22911. 1218.88 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  22912. 1218.88 s [algebraic-graphs] OK: size (removeEdge x y z) <= 3 * size z
  22913. 1218.88 s [algebraic-graphs]
  22914. 1218.88 s [algebraic-graphs] ============ NonEmpty.Graph.replaceVertex ============
  22915. 1218.88 s [algebraic-graphs] OK: replaceVertex x x == id
  22916. 1218.88 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  22917. 1218.88 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  22918. 1218.88 s [algebraic-graphs]
  22919. 1218.88 s [algebraic-graphs] ============ NonEmpty.Graph.mergeVertices ============
  22920. 1218.88 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  22921. 1225.60 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  22922. 1225.60 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  22923. 1225.61 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  22924. 1225.61 s [algebraic-graphs]
  22925. 1225.61 s [algebraic-graphs] ============ NonEmpty.Graph.splitVertex1 ============
  22926. 1225.61 s [algebraic-graphs] OK: splitVertex1 x [x] == id
  22927. 1225.61 s [algebraic-graphs] OK: splitVertex1 x [y] == replaceVertex x y
  22928. 1225.61 s [algebraic-graphs] OK: splitVertex1 1 [0,1] $ 1 * (2 + 3) == (0 + 1) * (2 + 3)
  22929. 1225.61 s [algebraic-graphs]
  22930. 1225.61 s [algebraic-graphs] ============ NonEmpty.Graph.transpose ============
  22931. 1225.61 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  22932. 1225.61 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  22933. 1225.61 s [algebraic-graphs] OK: transpose . transpose == id
  22934. 1225.61 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  22935. 1225.61 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  22936. 1225.61 s [algebraic-graphs]
  22937. 1225.61 s [algebraic-graphs] ============ NonEmpty.Graph.induce1 ============
  22938. 1225.61 s [algebraic-graphs] OK: induce1 (const True ) x == Just x
  22939. 1225.61 s [algebraic-graphs] OK: induce1 (const False) x == Nothing
  22940. 1225.61 s [algebraic-graphs] OK: induce1 (/= x) == removeVertex1 x
  22941. 1225.61 s [algebraic-graphs] OK: induce1 p >=> induce1 q == induce1 (\x -> p x && q x)
  22942. 1225.61 s [algebraic-graphs]
  22943. 1225.61 s [algebraic-graphs] ============ NonEmpty.Graph.induceJust1 ============
  22944. 1225.61 s [algebraic-graphs] OK: induceJust1 (vertex Nothing) == Nothing
  22945. 1225.61 s [algebraic-graphs] OK: induceJust1 (edge (Just x) Nothing) == Just (vertex x)
  22946. 1225.61 s [algebraic-graphs] OK: induceJust1 . fmap Just == Just
  22947. 1225.61 s [algebraic-graphs] OK: induceJust1 . fmap (\x -> if p x then Just x else Nothing) == induce1 p
  22948. 1225.61 s [algebraic-graphs]
  22949. 1225.61 s [algebraic-graphs] ============ NonEmpty.Graph.simplify ============
  22950. 1225.61 s [algebraic-graphs] OK: simplify == id
  22951. 1225.61 s [algebraic-graphs] OK: size (simplify x) <= size x
  22952. 1225.61 s [algebraic-graphs] OK: simplify 1 === 1
  22953. 1225.61 s [algebraic-graphs] OK: simplify (1 + 1) === 1
  22954. 1225.61 s [algebraic-graphs] OK: simplify (1 + 2 + 1) === 1 + 2
  22955. 1225.61 s [algebraic-graphs] OK: simplify (1 * 1 * 1) === 1 * 1
  22956. 1225.61 s [algebraic-graphs]
  22957. 1225.61 s [algebraic-graphs] ============ NonEmpty.Graph.sparsify ============
  22958. 1225.61 s [algebraic-graphs] OK: sort . reachable x == sort . rights . reachable (sparsify x) . Right
  22959. 1225.61 s [algebraic-graphs] OK: vertexCount (sparsify x) <= vertexCount x + size x + 1
  22960. 1225.61 s [algebraic-graphs] OK: edgeCount (sparsify x) <= 3 * size x
  22961. 1225.61 s [algebraic-graphs] OK: size (sparsify x) <= 3 * size x
  22962. 1225.61 s [algebraic-graphs]
  22963. 1225.61 s [algebraic-graphs] ============ NonEmpty.Graph.sparsifyKL ============
  22964. 1225.61 s [algebraic-graphs] OK: sort . reachable x == sort . filter (<= n) . reachable (sparsifyKL n x)
  22965. 1225.61 s [algebraic-graphs] OK: length (vertices $ sparsifyKL n x) <= vertexCount x + size x + 1
  22966. 1225.61 s [algebraic-graphs] OK: length (edges $ sparsifyKL n x) <= 3 * size x
  22967. 1225.61 s [algebraic-graphs]
  22968. 1225.61 s [algebraic-graphs] ============ NonEmpty.Graph.box ============
  22969. 1225.61 s [algebraic-graphs] OK: box (path1 [0,1]) (path1 ['a','b']) == <correct result>
  22970. 1225.61 s [algebraic-graphs] OK: box x y ~~ box y x
  22971. 1225.61 s [algebraic-graphs] OK: box x (overlay y z) == overlay (box x y) (box x z)
  22972. 1225.61 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  22973. 1225.61 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  22974. 1225.61 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  22975. 1225.61 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  22976. 1225.61 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  22977. 1225.61 s [algebraic-graphs]
  22978. 1225.61 s [algebraic-graphs] ============ Relation ============
  22979. 1225.61 s [algebraic-graphs] OK: Axioms of graphs
  22980. 1225.61 s [algebraic-graphs]
  22981. 1225.61 s [algebraic-graphs] ============ Relation.consistent ============
  22982. 1225.61 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  22983. 1225.61 s [algebraic-graphs]
  22984. 1225.61 s [algebraic-graphs] OK: consistent empty == True
  22985. 1225.61 s [algebraic-graphs] OK: consistent (vertex x) == True
  22986. 1225.61 s [algebraic-graphs] OK: consistent (overlay x y) == True
  22987. 1225.61 s [algebraic-graphs] OK: consistent (connect x y) == True
  22988. 1225.61 s [algebraic-graphs] OK: consistent (edge x y) == True
  22989. 1225.61 s [algebraic-graphs] OK: consistent (edges xs) == True
  22990. 1225.61 s [algebraic-graphs] OK: consistent (stars xs) == True
  22991. 1225.61 s [algebraic-graphs]
  22992. 1225.61 s [algebraic-graphs] ============ Relation.Show ============
  22993. 1225.61 s [algebraic-graphs] OK: show (empty ) == "empty"
  22994. 1225.61 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  22995. 1225.61 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  22996. 1225.61 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  22997. 1225.61 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  22998. 1225.61 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  22999. 1225.61 s [algebraic-graphs]
  23000. 1225.61 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  23001. 1225.61 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  23002. 1225.61 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  23003. 1225.61 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  23004. 1225.61 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  23005. 1225.61 s [algebraic-graphs]
  23006. 1225.61 s [algebraic-graphs] ============ Relation.Ord ============
  23007. 1225.61 s [algebraic-graphs] OK: vertex 1 < vertex 2
  23008. 1225.61 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  23009. 1225.61 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  23010. 1225.61 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  23011. 1225.61 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  23012. 1225.61 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  23013. 1225.61 s [algebraic-graphs] OK: x <= x + y
  23014. 1225.61 s [algebraic-graphs] OK: x + y <= x * y
  23015. 1225.61 s [algebraic-graphs]
  23016. 1225.61 s [algebraic-graphs] ============ Relation.empty ============
  23017. 1225.61 s [algebraic-graphs] OK: isEmpty empty == True
  23018. 1225.61 s [algebraic-graphs] OK: hasVertex x empty == False
  23019. 1225.61 s [algebraic-graphs] OK: vertexCount empty == 0
  23020. 1225.61 s [algebraic-graphs] OK: edgeCount empty == 0
  23021. 1225.61 s [algebraic-graphs]
  23022. 1225.61 s [algebraic-graphs] ============ Relation.vertex ============
  23023. 1225.61 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  23024. 1225.61 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  23025. 1225.61 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  23026. 1225.61 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  23027. 1225.61 s [algebraic-graphs]
  23028. 1225.61 s [algebraic-graphs] ============ Relation.edge ============
  23029. 1225.61 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  23030. 1225.61 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  23031. 1225.61 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  23032. 1225.61 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  23033. 1225.61 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  23034. 1225.61 s [algebraic-graphs]
  23035. 1225.61 s [algebraic-graphs] ============ Relation.overlay ============
  23036. 1225.61 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  23037. 1225.61 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  23038. 1225.61 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  23039. 1225.61 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  23040. 1225.61 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  23041. 1225.61 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  23042. 1225.61 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  23043. 1225.61 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  23044. 1225.61 s [algebraic-graphs]
  23045. 1225.61 s [algebraic-graphs] ============ Relation.connect ============
  23046. 1225.61 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  23047. 1225.61 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  23048. 1225.61 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  23049. 1225.61 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  23050. 1225.61 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  23051. 1225.61 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  23052. 1225.61 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  23053. 1225.61 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  23054. 1225.61 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  23055. 1225.61 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  23056. 1225.61 s [algebraic-graphs]
  23057. 1225.61 s [algebraic-graphs] ============ Relation.vertices ============
  23058. 1225.61 s [algebraic-graphs] OK: vertices [] == empty
  23059. 1225.61 s [algebraic-graphs] OK: vertices [x] == vertex x
  23060. 1225.61 s [algebraic-graphs] OK: vertices == overlays . map vertex
  23061. 1225.61 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  23062. 1225.61 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  23063. 1225.61 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  23064. 1225.61 s [algebraic-graphs]
  23065. 1225.61 s [algebraic-graphs] ============ Relation.edges ============
  23066. 1225.61 s [algebraic-graphs] OK: edges [] == empty
  23067. 1225.61 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  23068. 1225.61 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  23069. 1225.61 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  23070. 1225.61 s [algebraic-graphs]
  23071. 1225.61 s [algebraic-graphs] ============ Relation.overlays ============
  23072. 1225.61 s [algebraic-graphs] OK: overlays [] == empty
  23073. 1225.61 s [algebraic-graphs] OK: overlays [x] == x
  23074. 1225.61 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  23075. 1225.61 s [algebraic-graphs] OK: overlays == foldr overlay empty
  23076. 1225.61 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  23077. 1225.61 s [algebraic-graphs]
  23078. 1225.61 s [algebraic-graphs] ============ Relation.connects ============
  23079. 1225.61 s [algebraic-graphs] OK: connects [] == empty
  23080. 1225.61 s [algebraic-graphs] OK: connects [x] == x
  23081. 1225.61 s [algebraic-graphs] OK: connects [x,y] == connect x y
  23082. 1225.61 s [algebraic-graphs] OK: connects == foldr connect empty
  23083. 1225.61 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  23084. 1225.61 s [algebraic-graphs]
  23085. 1225.61 s [algebraic-graphs] ============ Relation.isSubgraphOf ============
  23086. 1225.61 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  23087. 1225.61 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  23088. 1225.61 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  23089. 1225.61 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  23090. 1225.61 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  23091. 1225.61 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  23092. 1225.61 s [algebraic-graphs]
  23093. 1225.61 s [algebraic-graphs] ============ Relation.toGraph et al. ============
  23094. 1225.61 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  23095. 1225.61 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  23096. 1225.61 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  23097. 1225.61 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  23098. 1225.61 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  23099. 1225.61 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  23100. 1225.61 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  23101. 1225.61 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  23102. 1225.61 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  23103. 1225.61 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  23104. 1225.61 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  23105. 1225.61 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  23106. 1225.61 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  23107. 1225.61 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  23108. 1225.61 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  23109. 1225.61 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  23110. 1225.61 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  23111. 1228.92 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  23112. 1228.92 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  23113. 1228.92 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  23114. 1228.92 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  23115. 1228.92 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  23116. 1228.92 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  23117. 1228.92 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  23118. 1228.92 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  23119. 1228.92 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  23120. 1228.92 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  23121. 1228.92 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  23122. 1228.92 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  23123. 1228.92 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  23124. 1228.92 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  23125. 1228.92 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  23126. 1228.93 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  23127. 1228.93 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  23128. 1228.93 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  23129. 1228.93 s [algebraic-graphs]
  23130. 1228.93 s [algebraic-graphs] ============ Relation.foldg ============
  23131. 1228.93 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  23132. 1228.93 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  23133. 1228.93 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  23134. 1228.93 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  23135. 1228.93 s [algebraic-graphs]
  23136. 1228.93 s [algebraic-graphs] ============ Relation.isEmpty ============
  23137. 1228.93 s [algebraic-graphs] OK: isEmpty empty == True
  23138. 1228.93 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  23139. 1228.93 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  23140. 1228.93 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  23141. 1228.93 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  23142. 1228.93 s [algebraic-graphs]
  23143. 1228.93 s [algebraic-graphs] ============ Relation.hasVertex ============
  23144. 1228.93 s [algebraic-graphs] OK: hasVertex x empty == False
  23145. 1228.93 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  23146. 1228.93 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  23147. 1228.93 s [algebraic-graphs]
  23148. 1228.93 s [algebraic-graphs] ============ Relation.hasEdge ============
  23149. 1228.93 s [algebraic-graphs] OK: hasEdge x y empty == False
  23150. 1228.93 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  23151. 1228.93 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  23152. 1228.93 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  23153. 1228.93 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  23154. 1228.93 s [algebraic-graphs]
  23155. 1228.93 s [algebraic-graphs] ============ Relation.vertexCount ============
  23156. 1228.93 s [algebraic-graphs] OK: vertexCount empty == 0
  23157. 1228.93 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  23158. 1228.93 s [algebraic-graphs] OK: vertexCount == length . vertexList
  23159. 1228.93 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  23160. 1228.93 s [algebraic-graphs]
  23161. 1228.93 s [algebraic-graphs] ============ Relation.edgeCount ============
  23162. 1228.93 s [algebraic-graphs] OK: edgeCount empty == 0
  23163. 1228.93 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  23164. 1228.93 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  23165. 1228.93 s [algebraic-graphs] OK: edgeCount == length . edgeList
  23166. 1228.93 s [algebraic-graphs]
  23167. 1228.93 s [algebraic-graphs] ============ Relation.vertexList ============
  23168. 1228.93 s [algebraic-graphs] OK: vertexList empty == []
  23169. 1228.93 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  23170. 1228.93 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  23171. 1228.93 s [algebraic-graphs]
  23172. 1228.93 s [algebraic-graphs] ============ Relation.vertexSet ============
  23173. 1228.93 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  23174. 1228.93 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  23175. 1228.93 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  23176. 1228.93 s [algebraic-graphs]
  23177. 1228.93 s [algebraic-graphs] ============ Relation.vertexIntSet ============
  23178. 1228.93 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  23179. 1228.93 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  23180. 1228.93 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  23181. 1228.93 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  23182. 1228.93 s [algebraic-graphs]
  23183. 1228.93 s [algebraic-graphs] ============ Relation.edgeList ============
  23184. 1228.93 s [algebraic-graphs] OK: edgeList empty == []
  23185. 1228.93 s [algebraic-graphs] OK: edgeList (vertex x) == []
  23186. 1228.93 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  23187. 1228.93 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  23188. 1228.93 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  23189. 1228.93 s [algebraic-graphs]
  23190. 1228.93 s [algebraic-graphs] ============ Relation.edgeSet ============
  23191. 1228.93 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  23192. 1228.93 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  23193. 1228.93 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  23194. 1228.93 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  23195. 1228.93 s [algebraic-graphs]
  23196. 1228.93 s [algebraic-graphs] ============ Relation.adjacencyList ============
  23197. 1228.93 s [algebraic-graphs] OK: adjacencyList empty == []
  23198. 1228.93 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  23199. 1228.93 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  23200. 1228.93 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  23201. 1228.93 s [algebraic-graphs]
  23202. 1228.93 s [algebraic-graphs] ============ Relation.preSet ============
  23203. 1228.93 s [algebraic-graphs] OK: preSet x empty == Set.empty
  23204. 1228.93 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  23205. 1228.93 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  23206. 1228.93 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  23207. 1228.93 s [algebraic-graphs]
  23208. 1228.93 s [algebraic-graphs] ============ Relation.preIntSet ============
  23209. 1228.93 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  23210. 1228.93 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  23211. 1228.93 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  23212. 1228.93 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  23213. 1228.93 s [algebraic-graphs]
  23214. 1228.93 s [algebraic-graphs] ============ Relation.postSet ============
  23215. 1228.93 s [algebraic-graphs] OK: postSet x empty == Set.empty
  23216. 1228.93 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  23217. 1228.93 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  23218. 1228.93 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  23219. 1228.93 s [algebraic-graphs]
  23220. 1228.93 s [algebraic-graphs] ============ Relation.postIntSet ============
  23221. 1228.93 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  23222. 1228.93 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  23223. 1228.93 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  23224. 1228.93 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  23225. 1228.93 s [algebraic-graphs]
  23226. 1228.93 s [algebraic-graphs] ============ Relation.path ============
  23227. 1228.93 s [algebraic-graphs] OK: path [] == empty
  23228. 1228.93 s [algebraic-graphs] OK: path [x] == vertex x
  23229. 1228.93 s [algebraic-graphs] OK: path [x,y] == edge x y
  23230. 1228.93 s [algebraic-graphs]
  23231. 1228.93 s [algebraic-graphs] ============ Relation.circuit ============
  23232. 1228.93 s [algebraic-graphs] OK: circuit [] == empty
  23233. 1228.93 s [algebraic-graphs] OK: circuit [x] == edge x x
  23234. 1228.93 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  23235. 1228.93 s [algebraic-graphs]
  23236. 1228.93 s [algebraic-graphs] ============ Relation.clique ============
  23237. 1228.93 s [algebraic-graphs] OK: clique [] == empty
  23238. 1228.93 s [algebraic-graphs] OK: clique [x] == vertex x
  23239. 1228.93 s [algebraic-graphs] OK: clique [x,y] == edge x y
  23240. 1228.93 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  23241. 1228.93 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  23242. 1228.93 s [algebraic-graphs]
  23243. 1228.93 s [algebraic-graphs] ============ Relation.biclique ============
  23244. 1228.93 s [algebraic-graphs] OK: biclique [] [] == empty
  23245. 1228.93 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  23246. 1228.93 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  23247. 1228.93 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  23248. 1228.93 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  23249. 1228.93 s [algebraic-graphs]
  23250. 1228.93 s [algebraic-graphs] ============ Relation.star ============
  23251. 1228.93 s [algebraic-graphs] OK: star x [] == vertex x
  23252. 1228.93 s [algebraic-graphs] OK: star x [y] == edge x y
  23253. 1228.93 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  23254. 1228.93 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  23255. 1228.93 s [algebraic-graphs]
  23256. 1228.93 s [algebraic-graphs] ============ Relation.stars ============
  23257. 1228.93 s [algebraic-graphs] OK: stars [] == empty
  23258. 1228.93 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  23259. 1228.93 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  23260. 1228.93 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  23261. 1228.93 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  23262. 1228.93 s [algebraic-graphs] OK: stars . adjacencyList == id
  23263. 1228.93 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  23264. 1228.93 s [algebraic-graphs]
  23265. 1228.93 s [algebraic-graphs] ============ Relation.tree ============
  23266. 1228.93 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  23267. 1228.93 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  23268. 1228.93 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  23269. 1228.93 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  23270. 1228.93 s [algebraic-graphs]
  23271. 1228.93 s [algebraic-graphs] ============ Relation.forest ============
  23272. 1228.93 s [algebraic-graphs] OK: forest [] == empty
  23273. 1228.93 s [algebraic-graphs] OK: forest [x] == tree x
  23274. 1228.93 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  23275. 1228.93 s [algebraic-graphs] OK: forest == overlays . map tree
  23276. 1228.93 s [algebraic-graphs]
  23277. 1228.93 s [algebraic-graphs] ============ Relation.removeVertex ============
  23278. 1228.93 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  23279. 1228.93 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  23280. 1228.93 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  23281. 1228.93 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  23282. 1228.93 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  23283. 1228.93 s [algebraic-graphs]
  23284. 1228.93 s [algebraic-graphs] ============ Relation.removeEdge ============
  23285. 1228.93 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  23286. 1228.93 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  23287. 1228.93 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  23288. 1228.93 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  23289. 1228.93 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  23290. 1228.93 s [algebraic-graphs]
  23291. 1228.93 s [algebraic-graphs] ============ Relation.replaceVertex ============
  23292. 1228.93 s [algebraic-graphs] OK: replaceVertex x x == id
  23293. 1228.93 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  23294. 1228.93 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  23295. 1228.93 s [algebraic-graphs]
  23296. 1228.93 s [algebraic-graphs] ============ Relation.mergeVertices ============
  23297. 1228.93 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  23298. 1250.38 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  23299. 1250.38 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  23300. 1250.39 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  23301. 1250.39 s [algebraic-graphs]
  23302. 1250.39 s [algebraic-graphs] ============ Relation.transpose ============
  23303. 1250.39 s [algebraic-graphs] OK: transpose empty == empty
  23304. 1250.39 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  23305. 1250.39 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  23306. 1250.39 s [algebraic-graphs] OK: transpose . transpose == id
  23307. 1250.39 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  23308. 1250.39 s [algebraic-graphs]
  23309. 1250.39 s [algebraic-graphs] ============ Relation.gmap ============
  23310. 1250.39 s [algebraic-graphs] OK: gmap f empty == empty
  23311. 1250.39 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  23312. 1250.39 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  23313. 1250.39 s [algebraic-graphs] OK: gmap id == id
  23314. 1250.39 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  23315. 1250.39 s [algebraic-graphs]
  23316. 1250.39 s [algebraic-graphs] ============ Relation.induce ============
  23317. 1250.39 s [algebraic-graphs] OK: induce (const True ) x == x
  23318. 1250.39 s [algebraic-graphs] OK: induce (const False) x == empty
  23319. 1250.39 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  23320. 1250.39 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  23321. 1250.39 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  23322. 1250.39 s [algebraic-graphs]
  23323. 1250.39 s [algebraic-graphs] ============ Relation.compose ============
  23324. 1250.39 s [algebraic-graphs] OK: compose empty x == empty
  23325. 1250.39 s [algebraic-graphs] OK: compose x empty == empty
  23326. 1250.39 s [algebraic-graphs] OK: compose (vertex x) y == empty
  23327. 1250.39 s [algebraic-graphs] OK: compose x (vertex y) == empty
  23328. 1250.39 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  23329. 1250.39 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  23330. 1250.39 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  23331. 1250.39 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  23332. 1250.39 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  23333. 1250.39 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  23334. 1250.39 s [algebraic-graphs]
  23335. 1250.39 s [algebraic-graphs] ============ Relation.closure ============
  23336. 1250.39 s [algebraic-graphs] OK: closure empty == empty
  23337. 1250.39 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  23338. 1250.39 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  23339. 1250.39 s [algebraic-graphs] OK: closure (edge x y) == edges [(x,x), (x,y), (y,y)]
  23340. 1250.39 s [algebraic-graphs] OK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
  23341. 1250.39 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  23342. 1250.39 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  23343. 1250.39 s [algebraic-graphs] OK: closure . closure == closure
  23344. 1250.39 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  23345. 1250.39 s [algebraic-graphs]
  23346. 1250.39 s [algebraic-graphs] ============ Relation.reflexiveClosure ============
  23347. 1250.39 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  23348. 1250.39 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  23349. 1250.39 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  23350. 1250.39 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges [(x,x), (x,y), (y,y)]
  23351. 1250.39 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  23352. 1250.39 s [algebraic-graphs]
  23353. 1250.39 s [algebraic-graphs] ============ Relation.symmetricClosure ============
  23354. 1250.39 s [algebraic-graphs] OK: symmetricClosure empty == empty
  23355. 1250.39 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  23356. 1250.39 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges [(x,y), (y,x)]
  23357. 1250.39 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  23358. 1250.39 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  23359. 1250.39 s [algebraic-graphs]
  23360. 1250.39 s [algebraic-graphs] ============ Relation.transitiveClosure ============
  23361. 1250.39 s [algebraic-graphs] OK: transitiveClosure empty == empty
  23362. 1250.39 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  23363. 1250.39 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  23364. 1250.39 s [algebraic-graphs] OK: transitiveClosure (path $ nub xs) == clique (nub $ xs)
  23365. 1250.39 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  23366. 1250.39 s [algebraic-graphs]
  23367. 1250.39 s [algebraic-graphs] ============ Relation.induceJust ============
  23368. 1250.39 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  23369. 1250.39 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  23370. 1250.39 s [algebraic-graphs] OK: induceJust . gmap Just == id
  23371. 1250.39 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  23372. 1250.39 s [algebraic-graphs]
  23373. 1250.39 s [algebraic-graphs] ============ ReflexiveRelation ============
  23374. 1250.39 s [algebraic-graphs] OK: Axioms of reflexive graphs
  23375. 1250.39 s [algebraic-graphs]
  23376. 1250.39 s [algebraic-graphs] ============ TransitiveRelation ============
  23377. 1250.39 s [algebraic-graphs] OK: Axioms of transitive graphs
  23378. 1250.39 s [algebraic-graphs] OK: path xs == (clique xs :: TransitiveRelation Int)
  23379. 1250.39 s [algebraic-graphs]
  23380. 1250.39 s [algebraic-graphs] ============ PreorderRelation ============
  23381. 1250.39 s [algebraic-graphs] OK: Axioms of preorder graphs
  23382. 1250.39 s [algebraic-graphs] OK: path xs == (clique xs :: PreorderRelation Int)
  23383. 1250.39 s [algebraic-graphs]
  23384. 1250.39 s [algebraic-graphs] ============ Symmetric.Relation ============
  23385. 1250.39 s [algebraic-graphs] OK: Axioms of undirected graphs
  23386. 1250.39 s [algebraic-graphs]
  23387. 1250.39 s [algebraic-graphs] ============ Symmetric.Relation.consistent ============
  23388. 1250.39 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  23389. 1250.39 s [algebraic-graphs]
  23390. 1250.39 s [algebraic-graphs] OK: consistent empty == True
  23391. 1250.39 s [algebraic-graphs] OK: consistent (vertex x) == True
  23392. 1250.39 s [algebraic-graphs] OK: consistent (overlay x y) == True
  23393. 1250.39 s [algebraic-graphs] OK: consistent (connect x y) == True
  23394. 1250.39 s [algebraic-graphs] OK: consistent (edge x y) == True
  23395. 1250.39 s [algebraic-graphs] OK: consistent (edges xs) == True
  23396. 1250.39 s [algebraic-graphs] OK: consistent (stars xs) == True
  23397. 1250.39 s [algebraic-graphs]
  23398. 1250.39 s [algebraic-graphs] ============ Symmetric.Relation.Show ============
  23399. 1250.39 s [algebraic-graphs] OK: show (empty ) == "empty"
  23400. 1250.39 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  23401. 1250.39 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  23402. 1250.39 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  23403. 1250.39 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  23404. 1250.39 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  23405. 1250.39 s [algebraic-graphs]
  23406. 1250.39 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  23407. 1250.39 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  23408. 1250.39 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  23409. 1250.39 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  23410. 1250.39 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  23411. 1250.39 s [algebraic-graphs]
  23412. 1250.39 s [algebraic-graphs] OK: show (2 * 1 ) == "edge 1 2"
  23413. 1250.39 s [algebraic-graphs] OK: show (1 * 2 * 1) == "edges [(1,1),(1,2)]"
  23414. 1250.39 s [algebraic-graphs] OK: show (3 * 2 * 1) == "edges [(1,2),(1,3),(2,3)]"
  23415. 1250.39 s [algebraic-graphs]
  23416. 1250.39 s [algebraic-graphs] ============ Symmetric.Relation.toSymmetric ============
  23417. 1250.39 s [algebraic-graphs] OK: toSymmetric (edge 1 2) == edge 1 2
  23418. 1250.39 s [algebraic-graphs] OK: toSymmetric . fromSymmetric == id
  23419. 1250.39 s [algebraic-graphs] OK: fromSymmetric . toSymmetric == symmetricClosure
  23420. 1250.39 s [algebraic-graphs] OK: vertexCount . toSymmetric == vertexCount
  23421. 1250.39 s [algebraic-graphs] OK: (*2) . edgeCount . toSymmetric >= edgeCount
  23422. 1250.39 s [algebraic-graphs]
  23423. 1250.39 s [algebraic-graphs] ============ Symmetric.Relation.fromSymmetric ============
  23424. 1250.39 s [algebraic-graphs] OK: fromSymmetric (edge 1 2) == edges [(1,2), (2,1)]
  23425. 1250.39 s [algebraic-graphs] OK: vertexCount . fromSymmetric == vertexCount
  23426. 1250.39 s [algebraic-graphs] OK: edgeCount . fromSymmetric <= (*2) . edgeCount
  23427. 1250.39 s [algebraic-graphs]
  23428. 1250.39 s [algebraic-graphs] ============ Symmetric.Relation.Ord ============
  23429. 1250.39 s [algebraic-graphs] OK: vertex 1 < vertex 2
  23430. 1250.39 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  23431. 1250.39 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  23432. 1250.39 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  23433. 1250.39 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  23434. 1250.39 s [algebraic-graphs] OK: edge 2 1 < edge 1 3
  23435. 1250.39 s [algebraic-graphs] OK: edge 1 2 == edge 2 1
  23436. 1250.39 s [algebraic-graphs] OK: x <= x + y
  23437. 1250.39 s [algebraic-graphs] OK: x + y <= x * y
  23438. 1250.39 s [algebraic-graphs]
  23439. 1250.39 s [algebraic-graphs] ============ Symmetric.Relation.empty ============
  23440. 1250.39 s [algebraic-graphs] OK: isEmpty empty == True
  23441. 1250.39 s [algebraic-graphs] OK: hasVertex x empty == False
  23442. 1250.39 s [algebraic-graphs] OK: vertexCount empty == 0
  23443. 1250.39 s [algebraic-graphs] OK: edgeCount empty == 0
  23444. 1250.39 s [algebraic-graphs]
  23445. 1250.39 s [algebraic-graphs] ============ Symmetric.Relation.vertex ============
  23446. 1250.39 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  23447. 1250.39 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  23448. 1250.39 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  23449. 1250.39 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  23450. 1250.39 s [algebraic-graphs]
  23451. 1250.39 s [algebraic-graphs] ============ Symmetric.Relation.edge ============
  23452. 1250.39 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  23453. 1250.39 s [algebraic-graphs] OK: edge x y == edge y x
  23454. 1250.39 s [algebraic-graphs] OK: edge x y == edges [(x,y), (y,x)]
  23455. 1250.39 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  23456. 1250.39 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  23457. 1250.39 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  23458. 1250.39 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  23459. 1250.39 s [algebraic-graphs]
  23460. 1250.39 s [algebraic-graphs] ============ Symmetric.Relation.overlay ============
  23461. 1250.39 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  23462. 1250.39 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  23463. 1250.39 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  23464. 1250.39 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  23465. 1250.39 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  23466. 1250.39 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  23467. 1250.39 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  23468. 1250.39 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  23469. 1250.39 s [algebraic-graphs]
  23470. 1250.39 s [algebraic-graphs] ============ Symmetric.Relation.connect ============
  23471. 1250.39 s [algebraic-graphs] OK: connect x y == connect y x
  23472. 1250.39 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  23473. 1250.39 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  23474. 1250.39 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  23475. 1250.39 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  23476. 1250.39 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  23477. 1250.39 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  23478. 1250.39 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y `div` 2
  23479. 1250.39 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  23480. 1250.39 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  23481. 1250.39 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  23482. 1250.39 s [algebraic-graphs]
  23483. 1250.39 s [algebraic-graphs] ============ Symmetric.Relation.vertices ============
  23484. 1250.39 s [algebraic-graphs] OK: vertices [] == empty
  23485. 1250.39 s [algebraic-graphs] OK: vertices [x] == vertex x
  23486. 1250.39 s [algebraic-graphs] OK: vertices == overlays . map vertex
  23487. 1250.39 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  23488. 1250.39 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  23489. 1250.39 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  23490. 1250.39 s [algebraic-graphs]
  23491. 1250.39 s [algebraic-graphs] ============ Symmetric.Relation.edges ============
  23492. 1250.39 s [algebraic-graphs] OK: edges [] == empty
  23493. 1250.39 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  23494. 1250.39 s [algebraic-graphs] OK: edges [(x,y), (y,x)] == edge x y
  23495. 1250.39 s [algebraic-graphs]
  23496. 1250.39 s [algebraic-graphs] ============ Symmetric.Relation.overlays ============
  23497. 1250.39 s [algebraic-graphs] OK: overlays [] == empty
  23498. 1262.89 s [algebraic-graphs] OK: overlays [x] == x
  23499. 1262.90 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  23500. 1262.90 s [algebraic-graphs] OK: overlays == foldr overlay empty
  23501. 1262.90 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  23502. 1262.90 s [algebraic-graphs]
  23503. 1262.90 s [algebraic-graphs] ============ Symmetric.Relation.connects ============
  23504. 1262.90 s [algebraic-graphs] OK: connects [] == empty
  23505. 1262.90 s [algebraic-graphs] OK: connects [x] == x
  23506. 1262.90 s [algebraic-graphs] OK: connects [x,y] == connect x y
  23507. 1262.90 s [algebraic-graphs] OK: connects == foldr connect empty
  23508. 1262.90 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  23509. 1262.90 s [algebraic-graphs] OK: connects == connects . reverse
  23510. 1262.90 s [algebraic-graphs]
  23511. 1262.90 s [algebraic-graphs] ============ Symmetric.Relation.isSubgraphOf ============
  23512. 1262.90 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  23513. 1262.90 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  23514. 1262.90 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  23515. 1262.90 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  23516. 1262.90 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  23517. 1262.90 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  23518. 1262.90 s [algebraic-graphs] OK: isSubgraphOf (edge x y) (edge y x) == True
  23519. 1262.90 s [algebraic-graphs]
  23520. 1262.90 s [algebraic-graphs] ============ Symmetric.Relation.toGraph et al. ============
  23521. 1262.90 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  23522. 1262.90 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  23523. 1262.90 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  23524. 1262.90 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  23525. 1262.90 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  23526. 1262.90 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  23527. 1262.90 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  23528. 1262.90 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  23529. 1262.90 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  23530. 1262.90 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  23531. 1262.90 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  23532. 1262.90 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  23533. 1262.90 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  23534. 1262.90 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  23535. 1262.90 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  23536. 1262.90 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  23537. 1262.90 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  23538. 1262.90 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  23539. 1262.90 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  23540. 1262.90 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  23541. 1262.90 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  23542. 1262.90 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  23543. 1262.90 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  23544. 1262.90 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  23545. 1262.90 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  23546. 1262.90 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  23547. 1262.90 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  23548. 1262.90 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  23549. 1262.90 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  23550. 1262.90 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  23551. 1262.90 s [algebraic-graphs]
  23552. 1262.90 s [algebraic-graphs] ============ Symmetric.Relation.isEmpty ============
  23553. 1262.90 s [algebraic-graphs] OK: isEmpty empty == True
  23554. 1262.90 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  23555. 1262.90 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  23556. 1262.90 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  23557. 1262.90 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  23558. 1262.90 s [algebraic-graphs]
  23559. 1262.90 s [algebraic-graphs] ============ Symmetric.Relation.hasVertex ============
  23560. 1262.90 s [algebraic-graphs] OK: hasVertex x empty == False
  23561. 1262.90 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  23562. 1262.90 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  23563. 1262.90 s [algebraic-graphs]
  23564. 1262.90 s [algebraic-graphs] ============ Symmetric.Relation.hasEdge ============
  23565. 1262.90 s [algebraic-graphs] OK: hasEdge x y empty == False
  23566. 1262.90 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  23567. 1262.90 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  23568. 1262.90 s [algebraic-graphs] OK: hasEdge x y (edge y x) == True
  23569. 1262.90 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  23570. 1262.90 s [algebraic-graphs] OK: hasEdge x y == elem (min x y, max x y) . edgeList
  23571. 1262.90 s [algebraic-graphs]
  23572. 1262.90 s [algebraic-graphs] ============ Symmetric.Relation.vertexCount ============
  23573. 1262.90 s [algebraic-graphs] OK: vertexCount empty == 0
  23574. 1262.90 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  23575. 1262.90 s [algebraic-graphs] OK: vertexCount == length . vertexList
  23576. 1262.90 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  23577. 1262.90 s [algebraic-graphs]
  23578. 1262.90 s [algebraic-graphs] ============ Symmetric.Relation.edgeCount ============
  23579. 1262.90 s [algebraic-graphs] OK: edgeCount empty == 0
  23580. 1262.90 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  23581. 1262.90 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  23582. 1262.90 s [algebraic-graphs] OK: edgeCount == length . edgeList
  23583. 1262.90 s [algebraic-graphs]
  23584. 1262.90 s [algebraic-graphs] ============ Symmetric.Relation.vertexList ============
  23585. 1262.90 s [algebraic-graphs] OK: vertexList empty == []
  23586. 1262.90 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  23587. 1262.90 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  23588. 1262.90 s [algebraic-graphs]
  23589. 1262.90 s [algebraic-graphs] ============ Symmetric.Relation.vertexSet ============
  23590. 1262.90 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  23591. 1262.90 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  23592. 1262.90 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  23593. 1262.90 s [algebraic-graphs]
  23594. 1262.90 s [algebraic-graphs] ============ Symmetric.Relation.vertexIntSet ============
  23595. 1262.90 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  23596. 1262.90 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  23597. 1262.90 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  23598. 1262.90 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  23599. 1262.90 s [algebraic-graphs]
  23600. 1262.90 s [algebraic-graphs] ============ Symmetric.Relation.edgeList ============
  23601. 1262.90 s [algebraic-graphs] OK: edgeList empty == []
  23602. 1262.90 s [algebraic-graphs] OK: edgeList (vertex x) == []
  23603. 1262.90 s [algebraic-graphs] OK: edgeList (edge x y) == [(min x y, max y x)]
  23604. 1262.90 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(1,2), (2,3)]
  23605. 1262.90 s [algebraic-graphs]
  23606. 1262.90 s [algebraic-graphs] ============ Symmetric.Relation.edgeSet ============
  23607. 1262.90 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  23608. 1262.90 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  23609. 1262.90 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (min x y, max x y)
  23610. 1262.90 s [algebraic-graphs]
  23611. 1262.90 s [algebraic-graphs] ============ Symmetric.Relation.adjacencyList ============
  23612. 1262.90 s [algebraic-graphs] OK: adjacencyList empty == []
  23613. 1262.90 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  23614. 1262.90 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [1])]
  23615. 1262.90 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, [2]), (2, [1,3]), (3, [2])]
  23616. 1262.90 s [algebraic-graphs]
  23617. 1262.90 s [algebraic-graphs] ============ Symmetric.Relation.neighbours ============
  23618. 1262.90 s [algebraic-graphs] OK: neighbours x empty == Set.empty
  23619. 1262.90 s [algebraic-graphs] OK: neighbours x (vertex x) == Set.empty
  23620. 1262.90 s [algebraic-graphs] OK: neighbours x (edge x y) == Set.fromList [y]
  23621. 1262.90 s [algebraic-graphs] OK: neighbours y (edge x y) == Set.fromList [x]
  23622. 1262.90 s [algebraic-graphs]
  23623. 1262.90 s [algebraic-graphs] ============ Symmetric.Relation.path ============
  23624. 1262.90 s [algebraic-graphs] OK: path [] == empty
  23625. 1262.90 s [algebraic-graphs] OK: path [x] == vertex x
  23626. 1262.90 s [algebraic-graphs] OK: path [x,y] == edge x y
  23627. 1262.90 s [algebraic-graphs] OK: path == path . reverse
  23628. 1262.90 s [algebraic-graphs]
  23629. 1262.90 s [algebraic-graphs] ============ Symmetric.Relation.circuit ============
  23630. 1262.90 s [algebraic-graphs] OK: circuit [] == empty
  23631. 1262.90 s [algebraic-graphs] OK: circuit [x] == edge x x
  23632. 1262.90 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  23633. 1262.90 s [algebraic-graphs] OK: circuit == circuit . reverse
  23634. 1262.90 s [algebraic-graphs]
  23635. 1262.90 s [algebraic-graphs] ============ Symmetric.Relation.clique ============
  23636. 1262.90 s [algebraic-graphs] OK: clique [] == empty
  23637. 1262.90 s [algebraic-graphs] OK: clique [x] == vertex x
  23638. 1262.90 s [algebraic-graphs] OK: clique [x,y] == edge x y
  23639. 1262.90 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  23640. 1262.90 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  23641. 1262.90 s [algebraic-graphs] OK: clique == clique . reverse
  23642. 1262.90 s [algebraic-graphs]
  23643. 1262.90 s [algebraic-graphs] ============ Symmetric.Relation.biclique ============
  23644. 1262.90 s [algebraic-graphs] OK: biclique [] [] == empty
  23645. 1262.90 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  23646. 1262.90 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  23647. 1262.90 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  23648. 1262.90 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  23649. 1262.90 s [algebraic-graphs]
  23650. 1262.90 s [algebraic-graphs] ============ Symmetric.Relation.star ============
  23651. 1262.90 s [algebraic-graphs] OK: star x [] == vertex x
  23652. 1262.90 s [algebraic-graphs] OK: star x [y] == edge x y
  23653. 1262.90 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  23654. 1262.90 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  23655. 1262.90 s [algebraic-graphs]
  23656. 1262.90 s [algebraic-graphs] ============ Symmetric.Relation.stars ============
  23657. 1262.90 s [algebraic-graphs] OK: stars [] == empty
  23658. 1262.90 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  23659. 1262.90 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  23660. 1262.90 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  23661. 1262.90 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  23662. 1262.90 s [algebraic-graphs] OK: stars . adjacencyList == id
  23663. 1262.90 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  23664. 1262.90 s [algebraic-graphs]
  23665. 1262.90 s [algebraic-graphs] ============ Symmetric.Relation.tree ============
  23666. 1262.90 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  23667. 1262.90 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  23668. 1262.90 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  23669. 1262.90 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  23670. 1262.90 s [algebraic-graphs]
  23671. 1262.90 s [algebraic-graphs] ============ Symmetric.Relation.forest ============
  23672. 1262.90 s [algebraic-graphs] OK: forest [] == empty
  23673. 1269.77 s [algebraic-graphs] OK: forest [x] == tree x
  23674. 1269.77 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  23675. 1269.78 s [algebraic-graphs] OK: forest == overlays . map tree
  23676. 1269.78 s [algebraic-graphs]
  23677. 1269.78 s [algebraic-graphs] ============ Symmetric.Relation.removeVertex ============
  23678. 1269.78 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  23679. 1269.78 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  23680. 1269.78 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  23681. 1269.78 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  23682. 1269.78 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  23683. 1269.78 s [algebraic-graphs]
  23684. 1269.78 s [algebraic-graphs] ============ Symmetric.Relation.removeEdge ============
  23685. 1269.78 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  23686. 1269.78 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  23687. 1269.78 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  23688. 1269.78 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  23689. 1269.78 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  23690. 1269.78 s [algebraic-graphs] OK: removeEdge x y == removeEdge y x
  23691. 1269.78 s [algebraic-graphs]
  23692. 1269.78 s [algebraic-graphs] ============ Symmetric.Relation.replaceVertex ============
  23693. 1269.78 s [algebraic-graphs] OK: replaceVertex x x == id
  23694. 1269.78 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  23695. 1269.78 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  23696. 1269.78 s [algebraic-graphs]
  23697. 1269.78 s [algebraic-graphs] ============ Symmetric.Relation.mergeVertices ============
  23698. 1269.78 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  23699. 1269.78 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  23700. 1269.78 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  23701. 1269.78 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  23702. 1269.78 s [algebraic-graphs]
  23703. 1269.78 s [algebraic-graphs] ============ Symmetric.Relation.gmap ============
  23704. 1269.78 s [algebraic-graphs] OK: gmap f empty == empty
  23705. 1269.78 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  23706. 1269.78 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  23707. 1269.78 s [algebraic-graphs] OK: gmap id == id
  23708. 1269.78 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  23709. 1269.78 s [algebraic-graphs]
  23710. 1269.78 s [algebraic-graphs] ============ Symmetric.Relation.induce ============
  23711. 1269.78 s [algebraic-graphs] OK: induce (const True ) x == x
  23712. 1269.78 s [algebraic-graphs] OK: induce (const False) x == empty
  23713. 1269.78 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  23714. 1269.78 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  23715. 1269.78 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  23716. 1269.78 s [algebraic-graphs]
  23717. 1269.78 s [algebraic-graphs] ============ Symmetric.Relation.induceJust ============
  23718. 1269.78 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  23719. 1269.78 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  23720. 1269.78 s [algebraic-graphs] OK: induceJust . gmap Just == id
  23721. 1269.78 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  23722. 1269.78 s [algebraic-graphs]
  23723. 1269.78 s [algebraic-graphs] ============ Example.Todo (Holiday) ============
  23724. 1269.78 s [algebraic-graphs] OK: A todo list is semantically Maybe [a]
  23725. 1269.78 s [algebraic-graphs] OK: The overlay operator (+) adds non-dependent items to the todo list
  23726. 1269.78 s [algebraic-graphs] OK: The connect operator (*) adds dependency between items
  23727. 1269.78 s [algebraic-graphs] OK: Contradictory constraints make the todo list impossible to schedule
  23728. 1269.78 s [algebraic-graphs] OK: Introduce item priority to schedule the todo list
  23729. 1269.78 s [algebraic-graphs] OK: Custom connect operators pull/repel arguments during scheduling
  23730. 1269.78 s [algebraic-graphs]
  23731. 1269.78 s [algebraic-graphs] ============ Example.Todo (Commandline) ============
  23732. 1269.78 s [algebraic-graphs] OK: The pull connect operator maintains command line semantics
  23733. 1269.78 s [algebraic-graphs] OK: Swapping flags are allowed by the commutative overlay opeartor
  23734. 1269.78 s [algebraic-graphs] OK: The usual connect operator breaks semantics
  23735. 1269.78 s [algebraic-graphs] OK: Transform command lines by adding optimisation flag
  23736. 1269.78 s [algebraic-graphs]
  23737. 1269.78 s [algebraic-graphs] ============ Typed ============
  23738. 1269.78 s [algebraic-graphs]
  23739. 1269.78 s [algebraic-graphs] ============ Typed.fromAdjacencyMap ============
  23740. 1269.78 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyMap (1 * 2 + 3 * 1)) == array (0,2) [(0,[1]), (1,[]), (2,[0])]
  23741. 1269.78 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyMap (1 * 2 + 2 * 1)) == array (0,1) [(0,[1]), (1,[0])]
  23742. 1269.78 s [algebraic-graphs] OK: map (fromVertexKL h) (vertices $ toGraphKL h) == vertexList g
  23743. 1269.78 s [algebraic-graphs] OK: map (\(x, y) -> (fromVertexKL h x, fromVertexKL h y)) (edges $ toGraphKL h) == edgeList g
  23744. 1269.78 s [algebraic-graphs]
  23745. 1269.78 s [algebraic-graphs] ============ Typed.fromAdjacencyIntMap ============
  23746. 1269.78 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyIntMap (1 * 2 + 3 * 1)) == array (0,2) [(0,[1]), (1,[]), (2,[0])]
  23747. 1269.78 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyIntMap (1 * 2 + 2 * 1)) == array (0,1) [(0,[1]), (1,[0])]
  23748. 1269.78 s [algebraic-graphs] OK: map (fromVertexKL h) (vertices $ toGraphKL h) == IntSet.toAscList (vertexIntSet g)
  23749. 1269.78 s [algebraic-graphs] OK: map (\(x, y) -> (fromVertexKL h x, fromVertexKL h y)) (edges $ toGraphKL h) == edgeList g
  23750. 1269.78 s [algebraic-graphs]
  23751. 1269.78 s [algebraic-graphs] ============ Typed.dfsForest ============
  23752. 1269.78 s [algebraic-graphs] OK: forest (dfsForest % edge 1 1) == vertex 1
  23753. 1269.78 s [algebraic-graphs] OK: forest (dfsForest % edge 1 2) == edge 1 2
  23754. 1269.78 s [algebraic-graphs] OK: forest (dfsForest % edge 2 1) == vertices [1, 2]
  23755. 1269.78 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForest % x) x == True
  23756. 1269.78 s [algebraic-graphs] OK: dfsForest % forest (dfsForest % x) == dfsForest % x
  23757. 1269.78 s [algebraic-graphs] OK: dfsForest % vertices vs == map (\v -> Node v []) (nub $ sort vs)
  23758. 1269.78 s [algebraic-graphs] OK: dfsForest % (3 * (1 + 4) * (1 + 5)) == <correct result>
  23759. 1269.78 s [algebraic-graphs]
  23760. 1269.78 s [algebraic-graphs] ============ Typed.dfsForestFrom ============
  23761. 1269.78 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 1) [1] == vertex 1
  23762. 1269.78 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [0] == empty
  23763. 1269.78 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [1] == edge 1 2
  23764. 1269.78 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [2] == vertex 2
  23765. 1269.78 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [2,1] == vertices [1,2]
  23766. 1269.78 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForestFrom % x $ vs) x == True
  23767. 1269.78 s [algebraic-graphs] OK: dfsForestFrom % x $ vertexList x == dfsForest % x
  23768. 1269.78 s [algebraic-graphs] OK: dfsForestFrom % vertices vs $ vs == map (\v -> Node v []) (nub vs)
  23769. 1269.78 s [algebraic-graphs] OK: dfsForestFrom % x $ [] == []
  23770. 1269.78 s [algebraic-graphs] OK: dfsForestFrom % (3 * (1 + 4) * (1 + 5)) $ [1,4] == <correct result>
  23771. 1269.78 s [algebraic-graphs]
  23772. 1269.78 s [algebraic-graphs] ============ Typed.dfs ============
  23773. 1269.78 s [algebraic-graphs] OK: dfs % edge 1 1 $ [1] == [1]
  23774. 1269.78 s [algebraic-graphs] OK: dfs % edge 1 2 $ [0] == []
  23775. 1269.78 s [algebraic-graphs] OK: dfs % edge 1 2 $ [1] == [1,2]
  23776. 1269.78 s [algebraic-graphs] OK: dfs % edge 1 2 $ [2] == [2]
  23777. 1269.78 s [algebraic-graphs] OK: dfs % edge 1 2 $ [1,2] == [1,2]
  23778. 1269.78 s [algebraic-graphs] OK: dfs % edge 1 2 $ [2,1] == [2,1]
  23779. 1269.78 s [algebraic-graphs] OK: dfs % x $ [] == []
  23780. 1269.78 s [algebraic-graphs]
  23781. 1269.78 s [algebraic-graphs] OK: dfs % (3 * (1 + 4) * (1 + 5)) $ [1,4] == [1,5,4]
  23782. 1269.78 s [algebraic-graphs] OK: and [ hasVertex v x | v <- dfs % x $ vs ] == True
  23783. 1269.78 s [algebraic-graphs]
  23784. 1269.78 s [algebraic-graphs] ============ Typed.topSort ============
  23785. 1269.78 s [algebraic-graphs] OK: topSort % (1 * 2 + 3 * 1) == [3,1,2]
  23786. 1269.78 s [algebraic-graphs] OK: topSort % (1 * 2 + 2 * 1) == [1,2]
  23787. 1269.78 s [algebraic-graphs]
  23788. 1269.78 s [algebraic-graphs] ============ Graph.Undirected ============
  23789. 1269.78 s [algebraic-graphs] OK: Axioms of undirected graphs
  23790. 1269.78 s [algebraic-graphs]
  23791. 1269.78 s [algebraic-graphs] ============ Graph.Undirected.Show ============
  23792. 1269.78 s [algebraic-graphs] OK: show (empty ) == "empty"
  23793. 1269.78 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  23794. 1269.78 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  23795. 1269.78 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  23796. 1269.78 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  23797. 1269.78 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  23798. 1269.78 s [algebraic-graphs]
  23799. 1269.78 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  23800. 1269.78 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  23801. 1269.78 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  23802. 1269.78 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  23803. 1269.78 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  23804. 1269.78 s [algebraic-graphs]
  23805. 1269.78 s [algebraic-graphs] OK: show (2 * 1 ) == "edge 1 2"
  23806. 1269.78 s [algebraic-graphs] OK: show (1 * 2 * 1) == "edges [(1,1),(1,2)]"
  23807. 1269.78 s [algebraic-graphs] OK: show (3 * 2 * 1) == "edges [(1,2),(1,3),(2,3)]"
  23808. 1269.78 s [algebraic-graphs]
  23809. 1269.78 s [algebraic-graphs] ============ Graph.Undirected.toUndirected ============
  23810. 1269.78 s [algebraic-graphs] OK: toUndirected (edge 1 2) == edge 1 2
  23811. 1269.78 s [algebraic-graphs] OK: toUndirected . fromUndirected == id
  23812. 1269.78 s [algebraic-graphs] OK: vertexCount . toUndirected == vertexCount
  23813. 1269.78 s [algebraic-graphs] OK: (*2) . edgeCount . toUndirected >= edgeCount
  23814. 1269.78 s [algebraic-graphs]
  23815. 1269.78 s [algebraic-graphs] ============ Graph.Undirected.fromUndirected ============
  23816. 1269.78 s [algebraic-graphs] OK: fromUndirected (edge 1 2) == edges [(1,2),(2,1)]
  23817. 1269.78 s [algebraic-graphs] OK: toUndirected . fromUndirected == id
  23818. 1269.78 s [algebraic-graphs] OK: vertexCount . fromUndirected == vertexCount
  23819. 1269.78 s [algebraic-graphs] OK: edgeCount . fromUndirected <= (*2) . edgeCount
  23820. 1269.78 s [algebraic-graphs]
  23821. 1269.78 s [algebraic-graphs] ============ Graph.Undirected.complement ================
  23822. 1269.78 s [algebraic-graphs] OK: complement empty == empty
  23823. 1269.78 s [algebraic-graphs] OK: complement (vertex x) == vertex x
  23824. 1269.78 s [algebraic-graphs] OK: complement (edge 1 1) == edge 1 1
  23825. 1269.78 s [algebraic-graphs] OK: complement (edge 1 2) == vertices [1, 2]
  23826. 1269.78 s [algebraic-graphs] OK: complement (star 1 [2, 3]) == overlay (vertex 1) (edge 2 3)
  23827. 1269.78 s [algebraic-graphs] OK: complement . complement == id
  23828. 1269.78 s [algebraic-graphs]
  23829. 1269.78 s [algebraic-graphs] ============ Graph.Undirected.Ord ============
  23830. 1269.78 s [algebraic-graphs] OK: vertex 1 < vertex 2
  23831. 1269.78 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  23832. 1269.78 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  23833. 1269.78 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  23834. 1269.78 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  23835. 1269.78 s [algebraic-graphs] OK: edge 2 1 < edge 1 3
  23836. 1269.78 s [algebraic-graphs] OK: edge 1 2 == edge 2 1
  23837. 1269.78 s [algebraic-graphs] OK: x <= x + y
  23838. 1269.78 s [algebraic-graphs] OK: x + y <= x * y
  23839. 1269.78 s [algebraic-graphs]
  23840. 1269.78 s [algebraic-graphs] ============ Graph.Undirected.empty ============
  23841. 1269.78 s [algebraic-graphs] OK: isEmpty empty == True
  23842. 1269.78 s [algebraic-graphs] OK: hasVertex x empty == False
  23843. 1269.78 s [algebraic-graphs] OK: vertexCount empty == 0
  23844. 1269.78 s [algebraic-graphs] OK: edgeCount empty == 0
  23845. 1269.78 s [algebraic-graphs]
  23846. 1269.78 s [algebraic-graphs] ============ Graph.Undirected.vertex ============
  23847. 1269.78 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  23848. 1269.78 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  23849. 1269.78 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  23850. 1269.78 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  23851. 1269.78 s [algebraic-graphs]
  23852. 1269.78 s [algebraic-graphs] ============ Graph.Undirected.edge ============
  23853. 1269.78 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  23854. 1269.78 s [algebraic-graphs] OK: edge x y == edge y x
  23855. 1278.37 s [algebraic-graphs] OK: edge x y == edges [(x,y), (y,x)]
  23856. 1278.37 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  23857. 1278.37 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  23858. 1278.38 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  23859. 1278.38 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  23860. 1278.38 s [algebraic-graphs]
  23861. 1278.38 s [algebraic-graphs] ============ Graph.Undirected.overlay ============
  23862. 1278.38 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  23863. 1278.38 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  23864. 1278.38 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  23865. 1278.38 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  23866. 1278.38 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  23867. 1278.38 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  23868. 1278.38 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  23869. 1278.38 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  23870. 1278.38 s [algebraic-graphs]
  23871. 1278.38 s [algebraic-graphs] ============ Graph.Undirected.connect ============
  23872. 1278.38 s [algebraic-graphs] OK: connect x y == connect y x
  23873. 1278.38 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  23874. 1278.38 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  23875. 1278.38 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  23876. 1278.38 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  23877. 1278.38 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  23878. 1278.38 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  23879. 1278.38 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y `div` 2
  23880. 1278.38 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  23881. 1278.38 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  23882. 1278.38 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  23883. 1278.38 s [algebraic-graphs]
  23884. 1278.38 s [algebraic-graphs] ============ Graph.Undirected.vertices ============
  23885. 1278.38 s [algebraic-graphs] OK: vertices [] == empty
  23886. 1278.38 s [algebraic-graphs] OK: vertices [x] == vertex x
  23887. 1278.38 s [algebraic-graphs] OK: vertices == overlays . map vertex
  23888. 1278.38 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  23889. 1278.38 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  23890. 1278.38 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  23891. 1278.38 s [algebraic-graphs]
  23892. 1278.38 s [algebraic-graphs] ============ Graph.Undirected.edges ============
  23893. 1278.38 s [algebraic-graphs] OK: edges [] == empty
  23894. 1278.38 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  23895. 1278.38 s [algebraic-graphs] OK: edges [(x,y), (y,x)] == edge x y
  23896. 1278.38 s [algebraic-graphs]
  23897. 1278.38 s [algebraic-graphs] ============ Graph.Undirected.overlays ============
  23898. 1278.38 s [algebraic-graphs] OK: overlays [] == empty
  23899. 1278.38 s [algebraic-graphs] OK: overlays [x] == x
  23900. 1278.38 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  23901. 1278.38 s [algebraic-graphs] OK: overlays == foldr overlay empty
  23902. 1278.38 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  23903. 1278.38 s [algebraic-graphs]
  23904. 1278.38 s [algebraic-graphs] ============ Graph.Undirected.connects ============
  23905. 1278.38 s [algebraic-graphs] OK: connects [] == empty
  23906. 1278.38 s [algebraic-graphs] OK: connects [x] == x
  23907. 1278.38 s [algebraic-graphs] OK: connects [x,y] == connect x y
  23908. 1278.38 s [algebraic-graphs] OK: connects == foldr connect empty
  23909. 1278.38 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  23910. 1278.38 s [algebraic-graphs] OK: connects == connects . reverse
  23911. 1278.38 s [algebraic-graphs]
  23912. 1278.38 s [algebraic-graphs] ============ Graph.Undirected.isSubgraphOf ============
  23913. 1278.38 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  23914. 1278.38 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  23915. 1278.38 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  23916. 1278.38 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  23917. 1278.38 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  23918. 1278.38 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  23919. 1278.38 s [algebraic-graphs] OK: isSubgraphOf (edge x y) (edge y x) == True
  23920. 1278.38 s [algebraic-graphs]
  23921. 1278.38 s [algebraic-graphs] ============ Graph.Undirected.path ============
  23922. 1278.38 s [algebraic-graphs] OK: path [] == empty
  23923. 1278.38 s [algebraic-graphs] OK: path [x] == vertex x
  23924. 1278.38 s [algebraic-graphs] OK: path [x,y] == edge x y
  23925. 1278.38 s [algebraic-graphs] OK: path == path . reverse
  23926. 1278.38 s [algebraic-graphs]
  23927. 1278.38 s [algebraic-graphs] ============ Graph.Undirected.circuit ============
  23928. 1278.38 s [algebraic-graphs] OK: circuit [] == empty
  23929. 1278.38 s [algebraic-graphs] OK: circuit [x] == edge x x
  23930. 1278.38 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  23931. 1278.38 s [algebraic-graphs] OK: circuit == circuit . reverse
  23932. 1278.38 s [algebraic-graphs]
  23933. 1278.38 s [algebraic-graphs] ============ Graph.Undirected.clique ============
  23934. 1278.38 s [algebraic-graphs] OK: clique [] == empty
  23935. 1278.38 s [algebraic-graphs] OK: clique [x] == vertex x
  23936. 1278.38 s [algebraic-graphs] OK: clique [x,y] == edge x y
  23937. 1278.38 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  23938. 1278.38 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  23939. 1278.38 s [algebraic-graphs] OK: clique == clique . reverse
  23940. 1278.38 s [algebraic-graphs]
  23941. 1278.38 s [algebraic-graphs] ============ Graph.Undirected.biclique ============
  23942. 1278.38 s [algebraic-graphs] OK: biclique [] [] == empty
  23943. 1278.38 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  23944. 1278.38 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  23945. 1278.38 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  23946. 1278.38 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  23947. 1278.38 s [algebraic-graphs]
  23948. 1278.38 s [algebraic-graphs] ============ Graph.Undirected.star ============
  23949. 1278.38 s [algebraic-graphs] OK: star x [] == vertex x
  23950. 1278.38 s [algebraic-graphs] OK: star x [y] == edge x y
  23951. 1278.38 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  23952. 1278.38 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  23953. 1278.38 s [algebraic-graphs]
  23954. 1278.38 s [algebraic-graphs] ============ Graph.Undirected.stars ============
  23955. 1278.38 s [algebraic-graphs] OK: stars [] == empty
  23956. 1278.38 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  23957. 1278.38 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  23958. 1278.38 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  23959. 1278.38 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  23960. 1278.38 s [algebraic-graphs] OK: stars . adjacencyList == id
  23961. 1278.38 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  23962. 1278.38 s [algebraic-graphs]
  23963. 1278.38 s [algebraic-graphs] ============ Graph.Undirected.tree ============
  23964. 1278.38 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  23965. 1278.38 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  23966. 1278.38 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  23967. 1278.38 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  23968. 1278.38 s [algebraic-graphs]
  23969. 1278.38 s [algebraic-graphs] ============ Graph.Undirected.forest ============
  23970. 1278.38 s [algebraic-graphs] OK: forest [] == empty
  23971. 1278.38 s [algebraic-graphs] OK: forest [x] == tree x
  23972. 1278.38 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  23973. 1278.38 s [algebraic-graphs] OK: forest == overlays . map tree
  23974. 1278.38 s [algebraic-graphs]
  23975. 1278.38 s [algebraic-graphs] ============ Graph.Undirected.removeVertex ============
  23976. 1278.38 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  23977. 1278.38 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  23978. 1278.38 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  23979. 1278.38 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  23980. 1278.38 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  23981. 1278.38 s [algebraic-graphs]
  23982. 1278.38 s [algebraic-graphs] ============ Graph.Undirected.removeEdge ============
  23983. 1278.38 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  23984. 1278.38 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  23985. 1278.38 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  23986. 1278.38 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  23987. 1278.38 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  23988. 1278.38 s [algebraic-graphs] OK: removeEdge x y == removeEdge y x
  23989. 1278.38 s [algebraic-graphs]
  23990. 1278.38 s [algebraic-graphs] ============ Graph.Undirected.replaceVertex ============
  23991. 1278.38 s [algebraic-graphs] OK: replaceVertex x x == id
  23992. 1278.38 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  23993. 1278.38 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  23994. 1278.38 s [algebraic-graphs]
  23995. 1278.38 s [algebraic-graphs] ============ Graph.Undirected.mergeVertices ============
  23996. 1278.38 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  23997. 1278.38 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  23998. 1278.38 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  23999. 1278.38 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  24000. 1278.38 s [algebraic-graphs]
  24001. 1278.38 s [algebraic-graphs] ============ Graph.Undirected.gmap ============
  24002. 1278.38 s [algebraic-graphs] OK: gmap f empty == empty
  24003. 1278.38 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  24004. 1278.38 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  24005. 1278.38 s [algebraic-graphs] OK: gmap id == id
  24006. 1278.38 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  24007. 1278.38 s [algebraic-graphs]
  24008. 1278.38 s [algebraic-graphs] ============ Graph.Undirected.induce ============
  24009. 1278.39 s [algebraic-graphs] OK: induce (const True ) x == x
  24010. 1278.39 s [algebraic-graphs] OK: induce (const False) x == empty
  24011. 1278.39 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  24012. 1278.39 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  24013. 1278.39 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  24014. 1278.39 s [algebraic-graphs]
  24015. 1278.39 s [algebraic-graphs] ============ Graph.Undirected.induceJust ============
  24016. 1278.39 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  24017. 1278.39 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  24018. 1278.39 s [algebraic-graphs] OK: induceJust . gmap Just == id
  24019. 1278.39 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  24020. 1278.39 s [algebraic-graphs] Test suite main: PASS
  24021. 1278.39 s [algebraic-graphs] Test suite logged to: dist/test/algebraic-graphs-0.7-main.log
  24022. 1278.39 s [algebraic-graphs] 1 of 1 test suites (1 of 1 test cases) passed.
  24023. 1278.39 s [algebraic-graphs] checkPhase completed in 2 minutes 4 seconds
  24024. 1278.39 s [algebraic-graphs] Phase: haddockPhase
  24025. 1278.51 s [algebraic-graphs] Preprocessing library for algebraic-graphs-0.7...
  24026. 1278.52 s [algebraic-graphs] Running Haddock on library for algebraic-graphs-0.7...
  24027. 1278.68 s [algebraic-graphs] [ 1 of 29] Compiling Algebra.Graph.AdjacencyMap ( src/Algebra/Graph/AdjacencyMap.hs, nothing )
  24028. 1279.00 s [algebraic-graphs] [ 2 of 29] Compiling Algebra.Graph.AdjacencyIntMap ( src/Algebra/Graph/AdjacencyIntMap.hs, nothing )
  24029. 1279.08 s [algebraic-graphs] [ 3 of 29] Compiling Algebra.Graph.AdjacencyIntMap.Algorithm ( src/Algebra/Graph/AdjacencyIntMap/Algorithm.hs, nothing )
  24030. 1279.20 s [algebraic-graphs] [ 4 of 29] Compiling Algebra.Graph.Internal ( src/Algebra/Graph/Internal.hs, nothing )
  24031. 1279.24 s [algebraic-graphs] [ 5 of 29] Compiling Algebra.Graph ( src/Algebra/Graph.hs, nothing )
  24032. 1279.39 s [algebraic-graphs] [ 6 of 29] Compiling Algebra.Graph.HigherKinded.Class ( src/Algebra/Graph/HigherKinded/Class.hs, nothing )
  24033. 1279.50 s [algebraic-graphs] [ 7 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap ( src/Algebra/Graph/Bipartite/AdjacencyMap.hs, nothing )
  24034. 1279.61 s [algebraic-graphs] [ 8 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap.Algorithm ( src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs, nothing )
  24035. 1279.70 s [algebraic-graphs] [ 9 of 29] Compiling Algebra.Graph.Label ( src/Algebra/Graph/Label.hs, nothing )
  24036. 1279.92 s [algebraic-graphs] [10 of 29] Compiling Algebra.Graph.NonEmpty.AdjacencyMap ( src/Algebra/Graph/NonEmpty/AdjacencyMap.hs, nothing )
  24037. 1279.98 s [algebraic-graphs] [11 of 29] Compiling Algebra.Graph.AdjacencyMap.Algorithm ( src/Algebra/Graph/AdjacencyMap/Algorithm.hs, nothing )
  24038. 1280.06 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:384:43: warning: [GHC-63394] [-Wx-partial]
  24039. 1280.06 s [algebraic-graphs] In the use of ‘head’
  24040. 1280.06 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  24041. 1280.06 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  24042. 1280.06 s [algebraic-graphs] |
  24043. 1280.06 s [algebraic-graphs] 384 | exit v = do newComponent <- (v==).snd.head <$> gets boundaryStack
  24044. 1280.06 s [algebraic-graphs] | ^^^^
  24045. 1280.06 s [algebraic-graphs]
  24046. 1280.06 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:391:21: warning: [GHC-63394] [-Wx-partial]
  24047. 1280.06 s [algebraic-graphs] In the use of ‘tail’
  24048. 1280.06 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  24049. 1280.06 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  24050. 1280.06 s [algebraic-graphs] |
  24051. 1280.06 s [algebraic-graphs] 391 | pth' = tail v_pth' -- Here we know that v_pth' starts with v
  24052. 1280.06 s [algebraic-graphs] | ^^^^
  24053. 1280.06 s [algebraic-graphs]
  24054. 1280.06 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:395:26: warning: [GHC-63394] [-Wx-partial]
  24055. 1280.06 s [algebraic-graphs] In the use of ‘head’
  24056. 1280.06 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  24057. 1280.06 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  24058. 1280.06 s [algebraic-graphs] |
  24059. 1280.06 s [algebraic-graphs] 395 | p_v = fst $ head bnd
  24060. 1280.06 s [algebraic-graphs] | ^^^^
  24061. 1280.06 s [algebraic-graphs]
  24062. 1280.07 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:397:21: warning: [GHC-63394] [-Wx-partial]
  24063. 1280.07 s [algebraic-graphs] In the use of ‘tail’
  24064. 1280.07 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  24065. 1280.07 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  24066. 1280.07 s [algebraic-graphs] |
  24067. 1280.07 s [algebraic-graphs] 397 | bnd' = tail bnd
  24068. 1280.07 s [algebraic-graphs] | ^^^^
  24069. 1280.07 s [algebraic-graphs]
  24070. 1280.07 s [algebraic-graphs] [12 of 29] Compiling Algebra.Graph.Acyclic.AdjacencyMap ( src/Algebra/Graph/Acyclic/AdjacencyMap.hs, nothing )
  24071. 1280.11 s [algebraic-graphs] [13 of 29] Compiling Algebra.Graph.ToGraph ( src/Algebra/Graph/ToGraph.hs, nothing )
  24072. 1280.24 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:171:32: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24073. 1280.24 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24074. 1280.24 s [algebraic-graphs] will become an error in a future GHC release.
  24075. 1280.24 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24076. 1280.24 s [algebraic-graphs] |
  24077. 1280.24 s [algebraic-graphs] 171 | vertexIntSet :: ToVertex t ~ Int => t -> IntSet
  24078. 1280.24 s [algebraic-graphs] | ^
  24079. 1280.24 s [algebraic-graphs]
  24080. 1280.24 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:197:29: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24081. 1280.24 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24082. 1280.24 s [algebraic-graphs] will become an error in a future GHC release.
  24083. 1280.24 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24084. 1280.24 s [algebraic-graphs] |
  24085. 1280.24 s [algebraic-graphs] 197 | preIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  24086. 1280.24 s [algebraic-graphs] | ^
  24087. 1280.24 s [algebraic-graphs]
  24088. 1280.24 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:215:30: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24089. 1280.24 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24090. 1280.24 s [algebraic-graphs] will become an error in a future GHC release.
  24091. 1280.24 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24092. 1280.24 s [algebraic-graphs] |
  24093. 1280.24 s [algebraic-graphs] 215 | postIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  24094. 1280.24 s [algebraic-graphs] | ^
  24095. 1280.24 s [algebraic-graphs]
  24096. 1280.24 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:303:37: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24097. 1280.24 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24098. 1280.24 s [algebraic-graphs] will become an error in a future GHC release.
  24099. 1280.24 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24100. 1280.24 s [algebraic-graphs] |
  24101. 1280.24 s [algebraic-graphs] 303 | toAdjacencyIntMap :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  24102. 1280.24 s [algebraic-graphs] | ^
  24103. 1280.24 s [algebraic-graphs]
  24104. 1280.24 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:312:46: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24105. 1280.24 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24106. 1280.24 s [algebraic-graphs] will become an error in a future GHC release.
  24107. 1280.24 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24108. 1280.24 s [algebraic-graphs] |
  24109. 1280.24 s [algebraic-graphs] 312 | toAdjacencyIntMapTranspose :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  24110. 1280.24 s [algebraic-graphs] | ^
  24111. 1280.24 s [algebraic-graphs]
  24112. 1280.24 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:452:43: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24113. 1280.24 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24114. 1280.25 s [algebraic-graphs] will become an error in a future GHC release.
  24115. 1280.25 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24116. 1280.25 s [algebraic-graphs] |
  24117. 1280.25 s [algebraic-graphs] 452 | adjacencyIntMap :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  24118. 1280.25 s [algebraic-graphs] | ^
  24119. 1280.25 s [algebraic-graphs]
  24120. 1280.25 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:471:52: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24121. 1280.25 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24122. 1280.25 s [algebraic-graphs] will become an error in a future GHC release.
  24123. 1280.25 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24124. 1280.25 s [algebraic-graphs] |
  24125. 1280.25 s [algebraic-graphs] 471 | adjacencyIntMapTranspose :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  24126. 1280.25 s [algebraic-graphs] | ^
  24127. 1280.25 s [algebraic-graphs]
  24128. 1280.25 s [algebraic-graphs] [14 of 29] Compiling Algebra.Graph.Relation ( src/Algebra/Graph/Relation.hs, nothing )
  24129. 1280.33 s [algebraic-graphs] [15 of 29] Compiling Algebra.Graph.Relation.Symmetric ( src/Algebra/Graph/Relation/Symmetric.hs, nothing )
  24130. 1280.37 s [algebraic-graphs] [16 of 29] Compiling Algebra.Graph.NonEmpty ( src/Algebra/Graph/NonEmpty.hs, nothing )
  24131. 1280.54 s [algebraic-graphs] [17 of 29] Compiling Algebra.Graph.Labelled.AdjacencyMap ( src/Algebra/Graph/Labelled/AdjacencyMap.hs, nothing )
  24132. 1280.65 s [algebraic-graphs] [18 of 29] Compiling Algebra.Graph.Labelled ( src/Algebra/Graph/Labelled.hs, nothing )
  24133. 1280.75 s [algebraic-graphs] [19 of 29] Compiling Algebra.Graph.Labelled.Example.Network ( src/Algebra/Graph/Labelled/Example/Network.hs, nothing )
  24134. 1280.76 s [algebraic-graphs] [20 of 29] Compiling Algebra.Graph.Labelled.Example.Automaton ( src/Algebra/Graph/Labelled/Example/Automaton.hs, nothing )
  24135. 1280.77 s [algebraic-graphs] [21 of 29] Compiling Algebra.Graph.Export ( src/Algebra/Graph/Export.hs, nothing )
  24136. 1280.79 s [algebraic-graphs] src/Algebra/Graph/Export.hs:185:41: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24137. 1280.79 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24138. 1280.79 s [algebraic-graphs] will become an error in a future GHC release.
  24139. 1280.79 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24140. 1280.79 s [algebraic-graphs] |
  24141. 1280.79 s [algebraic-graphs] 185 | export :: (Ord a, ToGraph g, ToVertex g ~ a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
  24142. 1280.79 s [algebraic-graphs] | ^
  24143. 1280.79 s [algebraic-graphs]
  24144. 1280.79 s [algebraic-graphs] [22 of 29] Compiling Algebra.Graph.Export.Dot ( src/Algebra/Graph/Export/Dot.hs, nothing )
  24145. 1280.81 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:121:63: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24146. 1280.81 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24147. 1280.81 s [algebraic-graphs] will become an error in a future GHC release.
  24148. 1280.81 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24149. 1280.81 s [algebraic-graphs] |
  24150. 1280.81 s [algebraic-graphs] 121 | export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g ~ a) => Style a s -> g -> s
  24151. 1280.82 s [algebraic-graphs] | ^
  24152. 1280.82 s [algebraic-graphs]
  24153. 1280.82 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:165:78: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24154. 1280.82 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24155. 1280.82 s [algebraic-graphs] will become an error in a future GHC release.
  24156. 1280.82 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24157. 1280.82 s [algebraic-graphs] |
  24158. 1280.82 s [algebraic-graphs] 165 | exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g ~ s) => g -> s
  24159. 1280.82 s [algebraic-graphs] | ^
  24160. 1280.82 s [algebraic-graphs]
  24161. 1280.82 s [algebraic-graphs] [23 of 29] Compiling Algebra.Graph.Undirected ( src/Algebra/Graph/Undirected.hs, nothing )
  24162. 1280.92 s [algebraic-graphs] [24 of 29] Compiling Algebra.Graph.Class ( src/Algebra/Graph/Class.hs, nothing )
  24163. 1280.97 s [algebraic-graphs] [25 of 29] Compiling Algebra.Graph.Relation.Transitive ( src/Algebra/Graph/Relation/Transitive.hs, nothing )
  24164. 1280.98 s [algebraic-graphs] [26 of 29] Compiling Algebra.Graph.Relation.Reflexive ( src/Algebra/Graph/Relation/Reflexive.hs, nothing )
  24165. 1280.99 s [algebraic-graphs] [27 of 29] Compiling Algebra.Graph.Relation.Preorder ( src/Algebra/Graph/Relation/Preorder.hs, nothing )
  24166. 1281.00 s [algebraic-graphs] [28 of 29] Compiling Algebra.Graph.Example.Todo ( src/Algebra/Graph/Example/Todo.hs, nothing )
  24167. 1281.02 s [algebraic-graphs] [29 of 29] Compiling Data.Graph.Typed ( src/Data/Graph/Typed.hs, nothing )
  24168. 1281.03 s [algebraic-graphs] Haddock coverage:
  24169. 1281.04 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  24170. 1281.04 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:227:1
  24171. 1281.04 s [algebraic-graphs] * in ‘Data.Map.Internal’
  24172. 1281.04 s [algebraic-graphs] * in ‘Data.Set.Internal’
  24173. 1281.04 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24174. 1281.04 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24175. 1281.04 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:227:1
  24176. 1281.05 s [algebraic-graphs] 100% ( 58 / 58) in 'Algebra.Graph.AdjacencyMap'
  24177. 1281.06 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  24178. 1281.06 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:237:1
  24179. 1281.06 s [algebraic-graphs] * in ‘Data.IntMap.Internal’
  24180. 1281.06 s [algebraic-graphs] * in ‘Data.IntSet.Internal’
  24181. 1281.06 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24182. 1281.06 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24183. 1281.06 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyIntMap.hs:237:1
  24184. 1281.07 s [algebraic-graphs] 100% ( 56 / 56) in 'Algebra.Graph.AdjacencyIntMap'
  24185. 1281.08 s [algebraic-graphs] Warning: 'nub' is out of scope.
  24186. 1281.08 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24187. 1281.08 s [algebraic-graphs] Warning: 'sort' is out of scope.
  24188. 1281.08 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24189. 1281.08 s [algebraic-graphs] 93% ( 14 / 15) in 'Algebra.Graph.AdjacencyIntMap.Algorithm'
  24190. 1281.08 s [algebraic-graphs] Missing documentation for:
  24191. 1281.08 s [algebraic-graphs] Cycle (src/Algebra/Graph/AdjacencyIntMap/Algorithm.hs:227)
  24192. 1281.09 s [algebraic-graphs] Warning: 'List' is ambiguous. It is defined
  24193. 1281.09 s [algebraic-graphs] * at src/Algebra/Graph/Internal.hs:50:18
  24194. 1281.09 s [algebraic-graphs] * at src/Algebra/Graph/Internal.hs:50:1
  24195. 1281.09 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24196. 1281.09 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24197. 1281.09 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Internal.hs:50:1
  24198. 1281.09 s [algebraic-graphs] Warning: 'IsList' is out of scope.
  24199. 1281.09 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24200. 1281.09 s [algebraic-graphs] 100% ( 19 / 19) in 'Algebra.Graph.Internal'
  24201. 1281.09 s [algebraic-graphs] Warning: 'Context' is ambiguous. It is defined
  24202. 1281.09 s [algebraic-graphs] * at src/Algebra/Graph.hs:1400:18
  24203. 1281.09 s [algebraic-graphs] * at src/Algebra/Graph.hs:1400:1
  24204. 1281.09 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24205. 1281.09 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24206. 1281.09 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph.hs:1400:1
  24207. 1281.10 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  24208. 1281.10 s [algebraic-graphs] * at src/Algebra/Graph.hs:316:1
  24209. 1281.10 s [algebraic-graphs] * in ‘Data.Set.Internal’
  24210. 1281.10 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24211. 1281.10 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24212. 1281.10 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph.hs:316:1
  24213. 1281.11 s [algebraic-graphs] 100% ( 61 / 61) in 'Algebra.Graph'
  24214. 1281.11 s [algebraic-graphs] Warning: 'mplus' is out of scope.
  24215. 1281.11 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24216. 1281.12 s [algebraic-graphs] Warning: 'vertexCount' is out of scope.
  24217. 1281.12 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24218. 1281.12 s [algebraic-graphs] Warning: 'hasVertex' is out of scope.
  24219. 1281.12 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24220. 1281.12 s [algebraic-graphs] Warning: 'vertexSet' is out of scope.
  24221. 1281.12 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24222. 1281.12 s [algebraic-graphs] Warning: 'isEmpty' is out of scope.
  24223. 1281.12 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24224. 1281.12 s [algebraic-graphs] Warning: 'edgeList' is out of scope.
  24225. 1281.12 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24226. 1281.12 s [algebraic-graphs] Warning: 'adjacencyList' is out of scope.
  24227. 1281.12 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24228. 1281.12 s [algebraic-graphs] Warning: 'box' is out of scope.
  24229. 1281.12 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24230. 1281.12 s [algebraic-graphs] Warning: 'edgeCount' is out of scope.
  24231. 1281.12 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24232. 1281.13 s [algebraic-graphs] 100% ( 42 / 42) in 'Algebra.Graph.HigherKinded.Class'
  24233. 1281.13 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  24234. 1281.13 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
  24235. 1281.13 s [algebraic-graphs] * in ‘Data.Map.Internal’
  24236. 1281.13 s [algebraic-graphs] * in ‘Data.Set.Internal’
  24237. 1281.13 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24238. 1281.13 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24239. 1281.13 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
  24240. 1281.13 s [algebraic-graphs] Warning: 'nub' is out of scope.
  24241. 1281.13 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24242. 1281.14 s [algebraic-graphs] Warning: 'swap' is ambiguous. It is defined
  24243. 1281.14 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:418:1
  24244. 1281.14 s [algebraic-graphs] * in ‘GHC.Internal.Data.Tuple’
  24245. 1281.14 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24246. 1281.14 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24247. 1281.14 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:418:1
  24248. 1281.15 s [algebraic-graphs] 100% ( 63 / 63) in 'Algebra.Graph.Bipartite.AdjacencyMap'
  24249. 1281.15 s [algebraic-graphs] Warning: 'isRight' is out of scope.
  24250. 1281.15 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24251. 1281.15 s [algebraic-graphs] Warning: 'Matching' is ambiguous. It is defined
  24252. 1281.15 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs:169:21
  24253. 1281.15 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs:169:1
  24254. 1281.15 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24255. 1281.15 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24256. 1281.15 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs:169:1
  24257. 1281.15 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  24258. 1281.15 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
  24259. 1281.15 s [algebraic-graphs] * in ‘Data.Set.Internal’
  24260. 1281.15 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24261. 1281.15 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24262. 1281.15 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
  24263. 1281.16 s [algebraic-graphs] 100% ( 25 / 25) in 'Algebra.Graph.Bipartite.AdjacencyMap.Algorithm'
  24264. 1281.16 s [algebraic-graphs] Warning: 'Optimum' is ambiguous. It is defined
  24265. 1281.16 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:442:20
  24266. 1281.16 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:442:1
  24267. 1281.16 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24268. 1281.16 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24269. 1281.16 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:442:1
  24270. 1281.16 s [algebraic-graphs] Warning: 'Distance' is ambiguous. It is defined
  24271. 1281.16 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:241:22
  24272. 1281.16 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:241:1
  24273. 1281.16 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24274. 1281.16 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24275. 1281.16 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:241:1
  24276. 1281.16 s [algebraic-graphs] Warning: 'Minimum' is ambiguous. It is defined
  24277. 1281.16 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:314:21
  24278. 1281.16 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:314:1
  24279. 1281.16 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24280. 1281.16 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24281. 1281.16 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:314:1
  24282. 1281.16 s [algebraic-graphs] Warning: 'Capacity' is ambiguous. It is defined
  24283. 1281.16 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:176:22
  24284. 1281.16 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:176:1
  24285. 1281.16 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24286. 1281.16 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24287. 1281.16 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:176:1
  24288. 1281.16 s [algebraic-graphs] Warning: 'Count' is ambiguous. It is defined
  24289. 1281.16 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:209:19
  24290. 1281.16 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:209:1
  24291. 1281.16 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24292. 1281.16 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24293. 1281.16 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:209:1
  24294. 1281.16 s [algebraic-graphs] 100% ( 37 / 37) in 'Algebra.Graph.Label'
  24295. 1281.16 s [algebraic-graphs] Warning: 'AdjacencyMap' is ambiguous. It is defined
  24296. 1281.16 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:157:1
  24297. 1281.16 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:152:1
  24298. 1281.16 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24299. 1281.17 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24300. 1281.17 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:152:1
  24301. 1281.17 s [algebraic-graphs] Warning: 'isEmpty' is out of scope.
  24302. 1281.17 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24303. 1281.17 s [algebraic-graphs] Warning: 'empty' is out of scope.
  24304. 1281.17 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24305. 1281.17 s [algebraic-graphs] Warning: 'vertexList' is out of scope.
  24306. 1281.17 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24307. 1281.17 s [algebraic-graphs] Warning: 'edges' is out of scope.
  24308. 1281.17 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24309. 1281.17 s [algebraic-graphs] Warning: 'adjacencyList' is out of scope.
  24310. 1281.17 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24311. 1281.18 s [algebraic-graphs] Warning: 'stars' is out of scope.
  24312. 1281.18 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24313. 1281.18 s [algebraic-graphs] 100% ( 51 / 51) in 'Algebra.Graph.NonEmpty.AdjacencyMap'
  24314. 1281.19 s [algebraic-graphs] Warning: 'nub' is out of scope.
  24315. 1281.19 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24316. 1281.19 s [algebraic-graphs] Warning: 'sort' is out of scope.
  24317. 1281.19 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24318. 1281.19 s [algebraic-graphs] Warning: 'vertex' is ambiguous. It is defined
  24319. 1281.19 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:239:1
  24320. 1281.19 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:224:1
  24321. 1281.19 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24322. 1281.19 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24323. 1281.19 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:224:1
  24324. 1281.19 s [algebraic-graphs] Warning: 'edge' is ambiguous. It is defined
  24325. 1281.19 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:252:1
  24326. 1281.19 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:237:1
  24327. 1281.19 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24328. 1281.19 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24329. 1281.19 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:237:1
  24330. 1281.19 s [algebraic-graphs] 93% ( 15 / 16) in 'Algebra.Graph.AdjacencyMap.Algorithm'
  24331. 1281.19 s [algebraic-graphs] Missing documentation for:
  24332. 1281.19 s [algebraic-graphs] Cycle (src/Algebra/Graph/AdjacencyMap/Algorithm.hs:228)
  24333. 1281.19 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  24334. 1281.19 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:132:1
  24335. 1281.19 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:227:1
  24336. 1281.19 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24337. 1281.19 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24338. 1281.19 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:227:1
  24339. 1281.19 s [algebraic-graphs] Warning: 'vertex' is ambiguous. It is defined
  24340. 1281.19 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:143:1
  24341. 1281.19 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:239:1
  24342. 1281.19 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24343. 1281.19 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24344. 1281.19 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:239:1
  24345. 1281.19 s [algebraic-graphs] Warning: 'vertexCount' is ambiguous. It is defined
  24346. 1281.19 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:246:1
  24347. 1281.19 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:417:1
  24348. 1281.19 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24349. 1281.19 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24350. 1281.19 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:417:1
  24351. 1281.19 s [algebraic-graphs] Warning: 'edgeCount' is ambiguous. It is defined
  24352. 1281.19 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:258:1
  24353. 1281.19 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:429:1
  24354. 1281.19 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24355. 1281.19 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24356. 1281.19 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:429:1
  24357. 1281.20 s [algebraic-graphs] Warning: 'vertices' is ambiguous. It is defined
  24358. 1281.20 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:157:1
  24359. 1281.20 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:309:1
  24360. 1281.20 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24361. 1281.20 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24362. 1281.20 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:309:1
  24363. 1281.20 s [algebraic-graphs] 100% ( 44 / 44) in 'Algebra.Graph.Acyclic.AdjacencyMap'
  24364. 1281.20 s [algebraic-graphs] Warning: 'foldg' is ambiguous. It is defined
  24365. 1281.20 s [algebraic-graphs] * at src/Algebra/Graph.hs:482:1
  24366. 1281.20 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:98:5
  24367. 1281.20 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24368. 1281.20 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24369. 1281.20 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:98:5
  24370. 1281.21 s [algebraic-graphs] 100% ( 8 / 8) in 'Algebra.Graph.ToGraph'
  24371. 1281.21 s [algebraic-graphs] Warning: 'Relation' is ambiguous. It is defined
  24372. 1281.21 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:157:19
  24373. 1281.21 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:157:1
  24374. 1281.21 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24375. 1281.21 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24376. 1281.21 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:157:1
  24377. 1281.22 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  24378. 1281.22 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:243:1
  24379. 1281.22 s [algebraic-graphs] * in ‘Data.Set.Internal’
  24380. 1281.22 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24381. 1281.22 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24382. 1281.22 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:243:1
  24383. 1281.22 s [algebraic-graphs] Warning: 'AdjacencyMap' is out of scope.
  24384. 1281.22 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24385. 1281.23 s [algebraic-graphs] 100% ( 56 / 56) in 'Algebra.Graph.Relation'
  24386. 1281.23 s [algebraic-graphs] Warning: 'vertexCount' is ambiguous. It is defined
  24387. 1281.23 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:423:1
  24388. 1281.23 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:372:1
  24389. 1281.23 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24390. 1281.23 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24391. 1281.23 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:372:1
  24392. 1281.23 s [algebraic-graphs] Warning: 'edgeCount' is ambiguous. It is defined
  24393. 1281.23 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:435:1
  24394. 1281.23 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:384:1
  24395. 1281.23 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24396. 1281.23 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24397. 1281.23 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:384:1
  24398. 1281.24 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  24399. 1281.24 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:188:1
  24400. 1281.24 s [algebraic-graphs] * in ‘Data.Set.Internal’
  24401. 1281.24 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24402. 1281.24 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24403. 1281.24 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:188:1
  24404. 1281.25 s [algebraic-graphs] 100% ( 48 / 48) in 'Algebra.Graph.Relation.Symmetric'
  24405. 1281.25 s [algebraic-graphs] Warning: 'vertexList' is out of scope.
  24406. 1281.25 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24407. 1281.27 s [algebraic-graphs] 100% ( 53 / 53) in 'Algebra.Graph.NonEmpty'
  24408. 1281.34 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  24409. 1281.34 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:160:1
  24410. 1281.34 s [algebraic-graphs] * in ‘Data.Map.Internal’
  24411. 1281.34 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24412. 1281.34 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24413. 1281.34 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:160:1
  24414. 1281.35 s [algebraic-graphs] Warning: 'hasEdge' is ambiguous. It is defined
  24415. 1281.35 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:403:1
  24416. 1281.35 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:379:1
  24417. 1281.35 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24418. 1281.35 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24419. 1281.35 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:379:1
  24420. 1281.36 s [algebraic-graphs] 100% ( 49 / 49) in 'Algebra.Graph.Labelled.AdjacencyMap'
  24421. 1281.36 s [algebraic-graphs] Warning: 'Context' is ambiguous. It is defined
  24422. 1281.36 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:675:20
  24423. 1281.36 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:675:1
  24424. 1281.36 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24425. 1281.36 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24426. 1281.36 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled.hs:675:1
  24427. 1281.36 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  24428. 1281.36 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:191:1
  24429. 1281.36 s [algebraic-graphs] * in ‘Data.Set.Internal’
  24430. 1281.36 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24431. 1281.36 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24432. 1281.36 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled.hs:191:1
  24433. 1281.37 s [algebraic-graphs] Warning: 'Focus' is ambiguous. It is defined
  24434. 1281.37 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:642:18
  24435. 1281.37 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:642:1
  24436. 1281.37 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24437. 1281.37 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24438. 1281.37 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled.hs:642:1
  24439. 1281.38 s [algebraic-graphs] 100% ( 49 / 49) in 'Algebra.Graph.Labelled'
  24440. 1281.38 s [algebraic-graphs] 100% ( 6 / 6) in 'Algebra.Graph.Labelled.Example.Network'
  24441. 1281.38 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Labelled.Example.Automaton'
  24442. 1281.38 s [algebraic-graphs] Warning: 'Doc' is ambiguous. It is defined
  24443. 1281.38 s [algebraic-graphs] * at src/Algebra/Graph/Export.hs:57:17
  24444. 1281.38 s [algebraic-graphs] * at src/Algebra/Graph/Export.hs:57:1
  24445. 1281.38 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24446. 1281.38 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24447. 1281.38 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Export.hs:57:1
  24448. 1281.39 s [algebraic-graphs] 100% ( 14 / 14) in 'Algebra.Graph.Export'
  24449. 1281.39 s [algebraic-graphs] Warning: 'Style' is ambiguous. It is defined
  24450. 1281.39 s [algebraic-graphs] * at src/Algebra/Graph/Export/Dot.hs:49:18
  24451. 1281.39 s [algebraic-graphs] * at src/Algebra/Graph/Export/Dot.hs:49:1
  24452. 1281.39 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24453. 1281.39 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24454. 1281.39 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Export/Dot.hs:49:1
  24455. 1281.39 s [algebraic-graphs] Warning: 'Graph' is out of scope.
  24456. 1281.39 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24457. 1281.39 s [algebraic-graphs] 100% ( 11 / 11) in 'Algebra.Graph.Export.Dot'
  24458. 1281.40 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  24459. 1281.40 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:253:1
  24460. 1281.40 s [algebraic-graphs] * in ‘Data.Set.Internal’
  24461. 1281.40 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24462. 1281.40 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24463. 1281.40 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:253:1
  24464. 1281.41 s [algebraic-graphs] 100% ( 50 / 50) in 'Algebra.Graph.Undirected'
  24465. 1281.42 s [algebraic-graphs] 100% ( 27 / 27) in 'Algebra.Graph.Class'
  24466. 1281.42 s [algebraic-graphs] Warning: 'TransitiveRelation' is ambiguous. It is defined
  24467. 1281.42 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Transitive.hs:39:32
  24468. 1281.42 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Transitive.hs:39:1
  24469. 1281.42 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24470. 1281.42 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24471. 1281.42 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Transitive.hs:39:1
  24472. 1281.42 s [algebraic-graphs] Warning: 'Transitive' is out of scope.
  24473. 1281.42 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24474. 1281.42 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Transitive'
  24475. 1281.42 s [algebraic-graphs] Warning: 'ReflexiveRelation' is ambiguous. It is defined
  24476. 1281.42 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Reflexive.hs:34:31
  24477. 1281.42 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Reflexive.hs:34:1
  24478. 1281.42 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24479. 1281.42 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24480. 1281.42 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Reflexive.hs:34:1
  24481. 1281.42 s [algebraic-graphs] Warning: 'Reflexive' is out of scope.
  24482. 1281.42 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24483. 1281.42 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Reflexive'
  24484. 1281.42 s [algebraic-graphs] Warning: 'PreorderRelation' is ambiguous. It is defined
  24485. 1281.42 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Preorder.hs:44:30
  24486. 1281.42 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Preorder.hs:44:1
  24487. 1281.42 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24488. 1281.42 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24489. 1281.42 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Preorder.hs:44:1
  24490. 1281.42 s [algebraic-graphs] Warning: 'Preorder' is out of scope.
  24491. 1281.42 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24492. 1281.42 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Preorder'
  24493. 1281.42 s [algebraic-graphs] 0% ( 0 / 8) in 'Algebra.Graph.Example.Todo'
  24494. 1281.42 s [algebraic-graphs] Missing documentation for:
  24495. 1281.42 s [algebraic-graphs] Module header
  24496. 1281.42 s [algebraic-graphs] Todo (src/Algebra/Graph/Example/Todo.hs:13)
  24497. 1281.42 s [algebraic-graphs] todo (src/Algebra/Graph/Example/Todo.hs:42)
  24498. 1281.42 s [algebraic-graphs] low (src/Algebra/Graph/Example/Todo.hs:23)
  24499. 1281.42 s [algebraic-graphs] high (src/Algebra/Graph/Example/Todo.hs:27)
  24500. 1281.42 s [algebraic-graphs] ~*~ (src/Algebra/Graph/Example/Todo.hs:35)
  24501. 1281.42 s [algebraic-graphs] >*< (src/Algebra/Graph/Example/Todo.hs:39)
  24502. 1281.42 s [algebraic-graphs] priority (src/Algebra/Graph/Example/Todo.hs:31)
  24503. 1281.42 s [algebraic-graphs] Warning: 'GraphKL' is ambiguous. It is defined
  24504. 1281.42 s [algebraic-graphs] * at src/Data/Graph/Typed.hs:40:18
  24505. 1281.42 s [algebraic-graphs] * at src/Data/Graph/Typed.hs:40:1
  24506. 1281.42 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  24507. 1281.42 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  24508. 1281.42 s [algebraic-graphs] Defaulting to the one defined at src/Data/Graph/Typed.hs:40:1
  24509. 1281.42 s [algebraic-graphs] Warning: 'array' is out of scope.
  24510. 1281.42 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24511. 1281.43 s [algebraic-graphs] 90% ( 10 / 11) in 'Data.Graph.Typed'
  24512. 1281.43 s [algebraic-graphs] Missing documentation for:
  24513. 1281.43 s [algebraic-graphs] scc (src/Data/Graph/Typed.hs:192)
  24514. 1281.64 s [algebraic-graphs] Warning: Algebra.Graph.AdjacencyMap: could not find link destinations for:
  24515. 1281.64 s [algebraic-graphs] - Algebra.Graph.AdjacencyMap.Rep_AdjacencyMap
  24516. 1281.64 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap0
  24517. 1281.64 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyMap0
  24518. 1281.64 s [algebraic-graphs] Warning: Algebra.Graph.AdjacencyIntMap: could not find link destinations for:
  24519. 1281.64 s [algebraic-graphs] - Algebra.Graph.AdjacencyIntMap.Rep_AdjacencyIntMap
  24520. 1281.64 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyIntMap
  24521. 1281.64 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyIntMap
  24522. 1281.65 s [algebraic-graphs] Warning: Algebra.Graph.Internal: could not find link destinations for:
  24523. 1281.65 s [algebraic-graphs] - Algebra.Graph.Internal.D:R:ItemList
  24524. 1281.65 s [algebraic-graphs] Warning: Algebra.Graph: could not find link destinations for:
  24525. 1281.65 s [algebraic-graphs] - Algebra.Graph.Rep_Graph
  24526. 1281.65 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexGraph
  24527. 1281.65 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph1
  24528. 1281.66 s [algebraic-graphs] Warning: Algebra.Graph.Bipartite.AdjacencyMap: could not find link destinations for:
  24529. 1281.66 s [algebraic-graphs] - Algebra.Graph.Bipartite.AdjacencyMap.D:R:ItemList
  24530. 1281.66 s [algebraic-graphs] - Algebra.Graph.Bipartite.AdjacencyMap.Rep_List
  24531. 1281.66 s [algebraic-graphs] - Algebra.Graph.Bipartite.AdjacencyMap.Rep_AdjacencyMap
  24532. 1281.66 s [algebraic-graphs] Warning: Algebra.Graph.Bipartite.AdjacencyMap.Algorithm: could not find link destinations for:
  24533. 1281.66 s [algebraic-graphs] - Algebra.Graph.Bipartite.AdjacencyMap.Algorithm.Rep_Matching
  24534. 1281.67 s [algebraic-graphs] Warning: Algebra.Graph.Label: could not find link destinations for:
  24535. 1281.67 s [algebraic-graphs] - Algebra.Graph.Label.D:R:ItemMinimum
  24536. 1281.67 s [algebraic-graphs] - Algebra.Graph.Label.D:R:ItemLabel
  24537. 1281.67 s [algebraic-graphs] Warning: Algebra.Graph.NonEmpty.AdjacencyMap: could not find link destinations for:
  24538. 1281.67 s [algebraic-graphs] - Algebra.Graph.NonEmpty.AdjacencyMap.Rep_AdjacencyMap
  24539. 1281.67 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap
  24540. 1281.68 s [algebraic-graphs] Warning: Algebra.Graph.ToGraph: could not find link destinations for:
  24541. 1281.68 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap
  24542. 1281.68 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyIntMap
  24543. 1281.68 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap0
  24544. 1281.68 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexGraph
  24545. 1281.68 s [algebraic-graphs] - Algebra.Graph.Relation.D:R:ToVertexRelation
  24546. 1281.68 s [algebraic-graphs] - Algebra.Graph.Relation.Symmetric.D:R:ToVertexRelation
  24547. 1281.68 s [algebraic-graphs] - Algebra.Graph.NonEmpty.D:R:ToVertexGraph
  24548. 1281.68 s [algebraic-graphs] - Algebra.Graph.Labelled.AdjacencyMap.D:R:ToVertexAdjacencyMap
  24549. 1281.68 s [algebraic-graphs] - Algebra.Graph.Labelled.D:R:ToVertexGraph
  24550. 1281.69 s [algebraic-graphs] Warning: Algebra.Graph.Relation: could not find link destinations for:
  24551. 1281.69 s [algebraic-graphs] - Algebra.Graph.Relation.D:R:ToVertexRelation
  24552. 1281.69 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexRelation0
  24553. 1281.69 s [algebraic-graphs] Warning: Algebra.Graph.Relation.Symmetric: could not find link destinations for:
  24554. 1281.69 s [algebraic-graphs] - Algebra.Graph.Relation.Symmetric.D:R:ToVertexRelation
  24555. 1281.69 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexRelation
  24556. 1281.70 s [algebraic-graphs] Warning: Algebra.Graph.NonEmpty: could not find link destinations for:
  24557. 1281.70 s [algebraic-graphs] - Algebra.Graph.NonEmpty.D:R:ToVertexGraph
  24558. 1281.70 s [algebraic-graphs] Warning: Algebra.Graph.Labelled.AdjacencyMap: could not find link destinations for:
  24559. 1281.70 s [algebraic-graphs] - Algebra.Graph.Labelled.AdjacencyMap.D:R:ToVertexAdjacencyMap
  24560. 1281.70 s [algebraic-graphs] - Algebra.Graph.Labelled.AdjacencyMap.Rep_AdjacencyMap
  24561. 1281.70 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyMap
  24562. 1281.71 s [algebraic-graphs] Warning: Algebra.Graph.Labelled: could not find link destinations for:
  24563. 1281.71 s [algebraic-graphs] - Algebra.Graph.Labelled.D:R:ToVertexGraph
  24564. 1281.71 s [algebraic-graphs] - Algebra.Graph.Labelled.Rep_Graph
  24565. 1281.71 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph
  24566. 1281.71 s [algebraic-graphs] Warning: Algebra.Graph.Undirected: could not find link destinations for:
  24567. 1281.71 s [algebraic-graphs] - Algebra.Graph.Undirected.Rep_Graph
  24568. 1281.71 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph0
  24569. 1281.71 s [algebraic-graphs] Warning: Algebra.Graph.Class: could not find link destinations for:
  24570. 1281.71 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexTuple3
  24571. 1281.71 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexTuple2
  24572. 1281.71 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexFUN
  24573. 1281.71 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexMaybe
  24574. 1281.71 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexUnit
  24575. 1281.71 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexRelation
  24576. 1281.72 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexRelation0
  24577. 1281.72 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyMap
  24578. 1281.72 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph
  24579. 1281.72 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyIntMap
  24580. 1281.72 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyMap0
  24581. 1281.72 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph0
  24582. 1281.72 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph1
  24583. 1281.72 s [algebraic-graphs] - Algebra.Graph.Relation.Transitive.D:R:VertexTransitiveRelation
  24584. 1281.72 s [algebraic-graphs] - Algebra.Graph.Relation.Reflexive.D:R:VertexReflexiveRelation
  24585. 1281.72 s [algebraic-graphs] - Algebra.Graph.Relation.Preorder.D:R:VertexPreorderRelation
  24586. 1281.72 s [algebraic-graphs] - Algebra.Graph.Example.Todo.D:R:VertexTodo
  24587. 1281.72 s [algebraic-graphs] Warning: Algebra.Graph.Relation.Transitive: could not find link destinations for:
  24588. 1281.72 s [algebraic-graphs] - Algebra.Graph.Relation.Transitive.D:R:VertexTransitiveRelation
  24589. 1281.72 s [algebraic-graphs] Warning: Algebra.Graph.Relation.Reflexive: could not find link destinations for:
  24590. 1281.72 s [algebraic-graphs] - Algebra.Graph.Relation.Reflexive.D:R:VertexReflexiveRelation
  24591. 1281.72 s [algebraic-graphs] Warning: Algebra.Graph.Relation.Preorder: could not find link destinations for:
  24592. 1281.72 s [algebraic-graphs] - Algebra.Graph.Relation.Preorder.D:R:VertexPreorderRelation
  24593. 1281.72 s [algebraic-graphs] Warning: Algebra.Graph.Example.Todo: could not find link destinations for:
  24594. 1281.72 s [algebraic-graphs] - Algebra.Graph.Example.Todo.D:R:VertexTodo
  24595. 1286.48 s [algebraic-graphs] Documentation created: dist/doc/html/algebraic-graphs/,
  24596. 1286.57 s [algebraic-graphs] dist/doc/html/algebraic-graphs/algebraic-graphs.txt
  24597. 1286.57 s [algebraic-graphs] Preprocessing test suite 'main' for algebraic-graphs-0.7...
  24598. 1286.57 s [algebraic-graphs] Phase: installPhase
  24599. 1286.61 s [algebraic-graphs] Installing library in /nix/store/33397k8r2slg23iwf0mavzm15i8nyq8d-algebraic-graphs-0.7/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-1e2a/algebraic-graphs-0.7-1EcQHPe1dklCgCezd3ndnl
  24600. 1287.28 s [algebraic-graphs] Phase: fixupPhase
  24601. 1287.30 s [algebraic-graphs] shrinking RPATHs of ELF executables and libraries in /nix/store/33397k8r2slg23iwf0mavzm15i8nyq8d-algebraic-graphs-0.7
  24602. 1287.32 s [algebraic-graphs] shrinking /nix/store/33397k8r2slg23iwf0mavzm15i8nyq8d-algebraic-graphs-0.7/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-1e2a/libHSalgebraic-graphs-0.7-1EcQHPe1dklCgCezd3ndnl-ghc9.10.2.so
  24603. 1287.33 s [algebraic-graphs] checking for references to /build/ in /nix/store/33397k8r2slg23iwf0mavzm15i8nyq8d-algebraic-graphs-0.7...
  24604. 1287.37 s [algebraic-graphs] patching script interpreter paths in /nix/store/33397k8r2slg23iwf0mavzm15i8nyq8d-algebraic-graphs-0.7
  24605. 1287.38 s [algebraic-graphs] stripping (with command strip and flags -S -p) in /nix/store/33397k8r2slg23iwf0mavzm15i8nyq8d-algebraic-graphs-0.7/lib
  24606. 1287.66 s [algebraic-graphs] shrinking RPATHs of ELF executables and libraries in /nix/store/3hppjidlangc5pmwksgr1379w9pj2g8b-algebraic-graphs-0.7-doc
  24607. 1287.68 s [algebraic-graphs] checking for references to /build/ in /nix/store/3hppjidlangc5pmwksgr1379w9pj2g8b-algebraic-graphs-0.7-doc...
  24608. 1287.71 s [algebraic-graphs] patching script interpreter paths in /nix/store/3hppjidlangc5pmwksgr1379w9pj2g8b-algebraic-graphs-0.7-doc
  24609. 1287.87 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/33397k8r2slg23iwf0mavzm15i8nyq8d-algebraic-graphs-0.7 /nix/store/3hppjidlangc5pmwksgr1379w9pj2g8b-algebraic-graphs-0.7-doc
  24610. 1288.30 s [post-build-hook] Pushing 2 paths (70 are already present) using zstd to cache sellout ⏳
  24611. 1288.30 s [post-build-hook]
  24612. 1288.80 s [post-build-hook] Pushing /nix/store/3hppjidlangc5pmwksgr1379w9pj2g8b-algebraic-graphs-0.7-doc (10.41 MiB)
  24613. 1288.80 s [post-build-hook] Pushing /nix/store/33397k8r2slg23iwf0mavzm15i8nyq8d-algebraic-graphs-0.7 (25.16 MiB)
  24614. 1290.44 s [post-build-hook]
  24615. 1290.44 s [post-build-hook] All done.
  24616. 1290.46 s [post-build-hook] Uploading to the NixCI cache: /nix/store/33397k8r2slg23iwf0mavzm15i8nyq8d-algebraic-graphs-0.7 /nix/store/3hppjidlangc5pmwksgr1379w9pj2g8b-algebraic-graphs-0.7-doc
  24617. 1290.50 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24618. 1290.67 s [post-build-hook] copying 2 paths...
  24619. 1290.67 s [post-build-hook] copying path '/nix/store/3hppjidlangc5pmwksgr1379w9pj2g8b-algebraic-graphs-0.7-doc' to 'https://cache.nix-ci.com'...
  24620. 1291.93 s [post-build-hook] copying path '/nix/store/33397k8r2slg23iwf0mavzm15i8nyq8d-algebraic-graphs-0.7' to 'https://cache.nix-ci.com'...
  24621. 1297.83 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24622. 1298.01 s [post-build-hook] copying 1 paths...
  24623. 1298.01 s [post-build-hook] copying path '/nix/store/9nsdi1wcxs2y7i5j98zjp8bvdai044iw-algebraic-graphs-0.7.drv' to 'https://cache.nix-ci.com'...
  24624. 1298.15 s Progress: 14 of 19 built, 177 of 177 downloaded from cache
  24625. 1298.20 s Building algebraic-graph-duoids
  24626. 1298.36 s [algebraic-graph-duoids] Phase: setupCompilerEnvironmentPhase
  24627. 1298.36 s [algebraic-graph-duoids] Build with /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2.
  24628. 1298.58 s [algebraic-graph-duoids] Phase: unpackPhase
  24629. 1298.59 s [algebraic-graph-duoids] unpacking source archive /nix/store/hwhxlh4aq4w3fvrlk65js3cdkm3in22k-5y8mzl3igbd7qyrpb010fqiak50k5q01-source/./algebraic-graphs
  24630. 1298.59 s [algebraic-graph-duoids] source root is algebraic-graphs
  24631. 1298.60 s [algebraic-graph-duoids] Phase: patchPhase
  24632. 1298.61 s [algebraic-graph-duoids] Phase: compileBuildDriverPhase
  24633. 1298.61 s [algebraic-graph-duoids] setupCompileFlags: -package-db=/build/tmp.4JHJVkjZfJ/setup-package.conf.d -threaded
  24634. 1298.67 s [algebraic-graph-duoids] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.4JHJVkjZfJ/Main.o )
  24635. 1298.71 s [algebraic-graph-duoids] [2 of 2] Linking Setup
  24636. 1299.90 s [algebraic-graph-duoids] Phase: updateAutotoolsGnuConfigScriptsPhase
  24637. 1299.91 s [algebraic-graph-duoids] Phase: configurePhase
  24638. 1299.91 s [algebraic-graph-duoids] configureFlags: --verbose --prefix=/nix/store/48c0yplqvc0w9i6abq8jmzxbjmsq4hh0-algebraic-graph-duoids-0.0.1.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/gh0d3p4anzfzbm7a9fha5yyqh3k8z8m3-algebraic-graph-duoids-0.0.1.0-doc/share/doc/algebraic-graph-duoids-0.0.1.0 --with-gcc=gcc --package-db=/build/tmp.4JHJVkjZfJ/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/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/lib
  24639. 1299.92 s [algebraic-graph-duoids] Using Parsec parser
  24640. 1299.92 s [algebraic-graph-duoids] Configuring algebraic-graph-duoids-0.0.1.0...
  24641. 1300.29 s [algebraic-graph-duoids] Flags chosen: lint=False, noisy-deprecations=True
  24642. 1300.55 s [algebraic-graph-duoids] Dependency algebraic-graphs >=0.6.1 && <0.8: using algebraic-graphs-0.7
  24643. 1300.55 s [algebraic-graph-duoids] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  24644. 1300.55 s [algebraic-graph-duoids] >=4.21.0 && <4.22 || >=4.22.0 && <4.23: using base-4.20.1.0
  24645. 1300.55 s [algebraic-graph-duoids] Dependency duoids >=0.0.1 && <0.1: using duoids-0.0.1.0
  24646. 1300.55 s [algebraic-graph-duoids] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  24647. 1300.55 s [algebraic-graph-duoids] Dependency algebraic-graph-duoids: using algebraic-graph-duoids-0.0.1.0
  24648. 1300.55 s [algebraic-graph-duoids] Dependency algebraic-graphs >=0.6.1 && <0.8: using algebraic-graphs-0.7
  24649. 1300.55 s [algebraic-graph-duoids] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  24650. 1300.55 s [algebraic-graph-duoids] >=4.21.0 && <4.22 || >=4.22.0 && <4.23: using base-4.20.1.0
  24651. 1300.55 s [algebraic-graph-duoids] Dependency duoids-hedgehog >=0.0.1 && <0.1: using duoids-hedgehog-0.0.1.0
  24652. 1300.55 s [algebraic-graph-duoids] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  24653. 1300.55 s [algebraic-graph-duoids] Dependency hedgehog >=1.2 && <1.3 || >=1.4 && <1.6 || >=1.7 && <1.8: using
  24654. 1300.55 s [algebraic-graph-duoids] hedgehog-1.5
  24655. 1300.55 s [algebraic-graph-duoids] Dependency algebraic-graph-duoids: using algebraic-graph-duoids-0.0.1.0
  24656. 1300.55 s [algebraic-graph-duoids] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  24657. 1300.55 s [algebraic-graph-duoids] >=4.21.0 && <4.22 || >=4.22.0 && <4.23: using base-4.20.1.0
  24658. 1300.55 s [algebraic-graph-duoids] Dependency doctest >=0.21.1 && <0.22 || >=0.22.6 && <0.23 || >=0.24.0 &&
  24659. 1300.55 s [algebraic-graph-duoids] <0.25: using doctest-0.24.2
  24660. 1300.55 s [algebraic-graph-duoids] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  24661. 1300.55 s [algebraic-graph-duoids] Source component graph:
  24662. 1300.55 s [algebraic-graph-duoids] component lib
  24663. 1300.55 s [algebraic-graph-duoids] component test:doctests dependency lib
  24664. 1300.55 s [algebraic-graph-duoids] component test:laws dependency lib
  24665. 1300.55 s [algebraic-graph-duoids] Configured component graph:
  24666. 1300.55 s [algebraic-graph-duoids] component algebraic-graph-duoids-0.0.1.0-DoQSmPopdztK90iHFyVW8t
  24667. 1300.55 s [algebraic-graph-duoids] include algebraic-graphs-0.7-1EcQHPe1dklCgCezd3ndnl
  24668. 1300.55 s [algebraic-graph-duoids] include base-4.20.1.0-2277
  24669. 1300.55 s [algebraic-graph-duoids] include duoids-0.0.1.0-5q4kbrGqhufDoKkeqzXV7l
  24670. 1300.55 s [algebraic-graph-duoids] include ghc-compat-plugin-0.1.0.1-5wmISeCFDky4w6cG3d8F6M
  24671. 1300.55 s [algebraic-graph-duoids] component algebraic-graph-duoids-0.0.1.0-8AjjQlXS9Pe2KArQHB0LPm-doctests
  24672. 1300.55 s [algebraic-graph-duoids] include algebraic-graph-duoids-0.0.1.0-DoQSmPopdztK90iHFyVW8t
  24673. 1300.55 s [algebraic-graph-duoids] include base-4.20.1.0-2277
  24674. 1300.55 s [algebraic-graph-duoids] include doctest-0.24.2-H4FgSSwrzQD6JTD7tYQanP
  24675. 1300.55 s [algebraic-graph-duoids] include ghc-compat-plugin-0.1.0.1-5wmISeCFDky4w6cG3d8F6M
  24676. 1300.55 s [algebraic-graph-duoids] component algebraic-graph-duoids-0.0.1.0-C1geaS3NBkKHMfu4hRCZjN-laws
  24677. 1300.55 s [algebraic-graph-duoids] include algebraic-graph-duoids-0.0.1.0-DoQSmPopdztK90iHFyVW8t
  24678. 1300.55 s [algebraic-graph-duoids] include algebraic-graphs-0.7-1EcQHPe1dklCgCezd3ndnl
  24679. 1300.55 s [algebraic-graph-duoids] include base-4.20.1.0-2277
  24680. 1300.55 s [algebraic-graph-duoids] include duoids-hedgehog-0.0.1.0-5gSNeuVBdOQDy9trKqTi02
  24681. 1300.55 s [algebraic-graph-duoids] include ghc-compat-plugin-0.1.0.1-5wmISeCFDky4w6cG3d8F6M
  24682. 1300.55 s [algebraic-graph-duoids] include hedgehog-1.5-EfuEQGiebWdHenxPcHRkuA
  24683. 1300.55 s [algebraic-graph-duoids] Linked component graph:
  24684. 1300.55 s [algebraic-graph-duoids] unit algebraic-graph-duoids-0.0.1.0-DoQSmPopdztK90iHFyVW8t
  24685. 1300.55 s [algebraic-graph-duoids] include algebraic-graphs-0.7-1EcQHPe1dklCgCezd3ndnl
  24686. 1300.55 s [algebraic-graph-duoids] include base-4.20.1.0-2277
  24687. 1300.55 s [algebraic-graph-duoids] include duoids-0.0.1.0-5q4kbrGqhufDoKkeqzXV7l
  24688. 1300.55 s [algebraic-graph-duoids] include ghc-compat-plugin-0.1.0.1-5wmISeCFDky4w6cG3d8F6M
  24689. 1300.55 s [algebraic-graph-duoids] Algebra.Graph.Duoid=algebraic-graph-duoids-0.0.1.0-DoQSmPopdztK90iHFyVW8t:Algebra.Graph.Duoid,Algebra.Graph.Duoid.Orphans=algebraic-graph-duoids-0.0.1.0-DoQSmPopdztK90iHFyVW8t:Algebra.Graph.Duoid.Orphans
  24690. 1300.55 s [algebraic-graph-duoids] unit algebraic-graph-duoids-0.0.1.0-8AjjQlXS9Pe2KArQHB0LPm-doctests
  24691. 1300.55 s [algebraic-graph-duoids] include algebraic-graph-duoids-0.0.1.0-DoQSmPopdztK90iHFyVW8t
  24692. 1300.55 s [algebraic-graph-duoids] include base-4.20.1.0-2277
  24693. 1300.55 s [algebraic-graph-duoids] include doctest-0.24.2-H4FgSSwrzQD6JTD7tYQanP
  24694. 1300.55 s [algebraic-graph-duoids] include ghc-compat-plugin-0.1.0.1-5wmISeCFDky4w6cG3d8F6M
  24695. 1300.55 s [algebraic-graph-duoids] unit algebraic-graph-duoids-0.0.1.0-C1geaS3NBkKHMfu4hRCZjN-laws
  24696. 1300.55 s [algebraic-graph-duoids] include algebraic-graph-duoids-0.0.1.0-DoQSmPopdztK90iHFyVW8t
  24697. 1300.55 s [algebraic-graph-duoids] include algebraic-graphs-0.7-1EcQHPe1dklCgCezd3ndnl
  24698. 1300.55 s [algebraic-graph-duoids] include base-4.20.1.0-2277
  24699. 1300.55 s [algebraic-graph-duoids] include duoids-hedgehog-0.0.1.0-5gSNeuVBdOQDy9trKqTi02
  24700. 1300.55 s [algebraic-graph-duoids] include ghc-compat-plugin-0.1.0.1-5wmISeCFDky4w6cG3d8F6M
  24701. 1300.55 s [algebraic-graph-duoids] include hedgehog-1.5-EfuEQGiebWdHenxPcHRkuA
  24702. 1300.55 s [algebraic-graph-duoids] Ready component graph:
  24703. 1300.55 s [algebraic-graph-duoids] definite algebraic-graph-duoids-0.0.1.0-DoQSmPopdztK90iHFyVW8t
  24704. 1300.55 s [algebraic-graph-duoids] depends algebraic-graphs-0.7-1EcQHPe1dklCgCezd3ndnl
  24705. 1300.55 s [algebraic-graph-duoids] depends base-4.20.1.0-2277
  24706. 1300.55 s [algebraic-graph-duoids] depends duoids-0.0.1.0-5q4kbrGqhufDoKkeqzXV7l
  24707. 1300.55 s [algebraic-graph-duoids] depends ghc-compat-plugin-0.1.0.1-5wmISeCFDky4w6cG3d8F6M
  24708. 1300.55 s [algebraic-graph-duoids] definite algebraic-graph-duoids-0.0.1.0-C1geaS3NBkKHMfu4hRCZjN-laws
  24709. 1300.55 s [algebraic-graph-duoids] depends algebraic-graph-duoids-0.0.1.0-DoQSmPopdztK90iHFyVW8t
  24710. 1300.55 s [algebraic-graph-duoids] depends algebraic-graphs-0.7-1EcQHPe1dklCgCezd3ndnl
  24711. 1300.55 s [algebraic-graph-duoids] depends base-4.20.1.0-2277
  24712. 1300.55 s [algebraic-graph-duoids] depends duoids-hedgehog-0.0.1.0-5gSNeuVBdOQDy9trKqTi02
  24713. 1300.55 s [algebraic-graph-duoids] depends ghc-compat-plugin-0.1.0.1-5wmISeCFDky4w6cG3d8F6M
  24714. 1300.55 s [algebraic-graph-duoids] depends hedgehog-1.5-EfuEQGiebWdHenxPcHRkuA
  24715. 1300.55 s [algebraic-graph-duoids] definite algebraic-graph-duoids-0.0.1.0-8AjjQlXS9Pe2KArQHB0LPm-doctests
  24716. 1300.56 s [algebraic-graph-duoids] depends algebraic-graph-duoids-0.0.1.0-DoQSmPopdztK90iHFyVW8t
  24717. 1300.56 s [algebraic-graph-duoids] depends base-4.20.1.0-2277
  24718. 1300.56 s [algebraic-graph-duoids] depends doctest-0.24.2-H4FgSSwrzQD6JTD7tYQanP
  24719. 1300.56 s [algebraic-graph-duoids] depends ghc-compat-plugin-0.1.0.1-5wmISeCFDky4w6cG3d8F6M
  24720. 1300.56 s [algebraic-graph-duoids] Using Cabal-3.12.1.0 compiled by ghc-9.10
  24721. 1300.56 s [algebraic-graph-duoids] Using compiler: ghc-9.10.2
  24722. 1300.56 s [algebraic-graph-duoids] Using install prefix:
  24723. 1300.56 s [algebraic-graph-duoids] /nix/store/48c0yplqvc0w9i6abq8jmzxbjmsq4hh0-algebraic-graph-duoids-0.0.1.0
  24724. 1300.56 s [algebraic-graph-duoids] Executables installed in:
  24725. 1300.56 s [algebraic-graph-duoids] /nix/store/48c0yplqvc0w9i6abq8jmzxbjmsq4hh0-algebraic-graph-duoids-0.0.1.0/bin
  24726. 1300.56 s [algebraic-graph-duoids] Libraries installed in:
  24727. 1300.56 s [algebraic-graph-duoids] /nix/store/48c0yplqvc0w9i6abq8jmzxbjmsq4hh0-algebraic-graph-duoids-0.0.1.0/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-1e2a/algebraic-graph-duoids-0.0.1.0-DoQSmPopdztK90iHFyVW8t
  24728. 1300.56 s [algebraic-graph-duoids] Dynamic Libraries installed in:
  24729. 1300.56 s [algebraic-graph-duoids] /nix/store/48c0yplqvc0w9i6abq8jmzxbjmsq4hh0-algebraic-graph-duoids-0.0.1.0/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-1e2a
  24730. 1300.56 s [algebraic-graph-duoids] Private executables installed in:
  24731. 1300.56 s [algebraic-graph-duoids] /nix/store/48c0yplqvc0w9i6abq8jmzxbjmsq4hh0-algebraic-graph-duoids-0.0.1.0/libexec/x86_64-linux-ghc-9.10.2-1e2a/algebraic-graph-duoids-0.0.1.0
  24732. 1300.56 s [algebraic-graph-duoids] Data files installed in:
  24733. 1300.56 s [algebraic-graph-duoids] /nix/store/48c0yplqvc0w9i6abq8jmzxbjmsq4hh0-algebraic-graph-duoids-0.0.1.0/share/x86_64-linux-ghc-9.10.2-1e2a/algebraic-graph-duoids-0.0.1.0
  24734. 1300.56 s [algebraic-graph-duoids] Documentation installed in:
  24735. 1300.56 s [algebraic-graph-duoids] /nix/store/gh0d3p4anzfzbm7a9fha5yyqh3k8z8m3-algebraic-graph-duoids-0.0.1.0-doc/share/doc/algebraic-graph-duoids-0.0.1.0
  24736. 1300.56 s [algebraic-graph-duoids] Configuration files installed in:
  24737. 1300.56 s [algebraic-graph-duoids] /nix/store/48c0yplqvc0w9i6abq8jmzxbjmsq4hh0-algebraic-graph-duoids-0.0.1.0/etc
  24738. 1300.56 s [algebraic-graph-duoids] No alex found
  24739. 1300.56 s [algebraic-graph-duoids] Using ar found on system at:
  24740. 1300.56 s [algebraic-graph-duoids] /nix/store/rinxh4y0akcin90l05j0zr1r3wahl34d-binutils-wrapper-2.44/bin/ar
  24741. 1300.56 s [algebraic-graph-duoids] No c2hs found
  24742. 1300.56 s [algebraic-graph-duoids] No cpphs found
  24743. 1300.56 s [algebraic-graph-duoids] Using doctest version 0.24.2 found on system at:
  24744. 1300.56 s [algebraic-graph-duoids] /nix/store/zmwlk8gqk89i9b1qlifd7b9wywswg74r-doctest-0.24.2/bin/doctest
  24745. 1300.56 s [algebraic-graph-duoids] Using gcc version 14.3.0 given by user at:
  24746. 1300.56 s [algebraic-graph-duoids] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/gcc
  24747. 1300.56 s [algebraic-graph-duoids] Using ghc version 9.10.2 found on system at:
  24748. 1300.56 s [algebraic-graph-duoids] /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/bin/ghc
  24749. 1300.56 s [algebraic-graph-duoids] Using ghc-pkg version 9.10.2 found on system at:
  24750. 1300.56 s [algebraic-graph-duoids] /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/bin/ghc-pkg-9.10.2
  24751. 1300.56 s [algebraic-graph-duoids] No ghcjs found
  24752. 1300.56 s [algebraic-graph-duoids] No ghcjs-pkg found
  24753. 1300.56 s [algebraic-graph-duoids] No greencard found
  24754. 1300.56 s [algebraic-graph-duoids] Using haddock version 2.31.0 found on system at:
  24755. 1300.56 s [algebraic-graph-duoids] /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/bin/haddock-ghc-9.10.2
  24756. 1300.56 s [algebraic-graph-duoids] No happy found
  24757. 1300.56 s [algebraic-graph-duoids] Using haskell-suite found on system at: haskell-suite-dummy-location
  24758. 1300.56 s [algebraic-graph-duoids] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  24759. 1300.56 s [algebraic-graph-duoids] No hmake found
  24760. 1300.56 s [algebraic-graph-duoids] Using hpc version 0.69 found on system at:
  24761. 1300.56 s [algebraic-graph-duoids] /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/bin/hpc-ghc-9.10.2
  24762. 1300.56 s [algebraic-graph-duoids] Using hsc2hs version 0.68.10 found on system at:
  24763. 1300.56 s [algebraic-graph-duoids] /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/bin/hsc2hs-ghc-9.10.2
  24764. 1300.56 s [algebraic-graph-duoids] Using hscolour version 1.25 found on system at:
  24765. 1300.56 s [algebraic-graph-duoids] /nix/store/kb4afndnwdxxc5ps9k8xv0jzd0a9y8n5-hscolour-1.25/bin/HsColour
  24766. 1300.56 s [algebraic-graph-duoids] No jhc found
  24767. 1300.56 s [algebraic-graph-duoids] Using ld found on system at:
  24768. 1300.56 s [algebraic-graph-duoids] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/ld
  24769. 1300.56 s [algebraic-graph-duoids] No pkg-config found
  24770. 1300.56 s [algebraic-graph-duoids] Using runghc version 9.10.2 found on system at:
  24771. 1300.56 s [algebraic-graph-duoids] /nix/store/0qjf2c7a7d43aaks6prhwrxwb9z33fj2-ghc-9.10.2/bin/runghc-9.10.2
  24772. 1300.56 s [algebraic-graph-duoids] Using strip version 2.44 found on system at:
  24773. 1300.56 s [algebraic-graph-duoids] /nix/store/0j1ajvl2qwwb9n5a91hzd0j98fk9fa3k-gcc-wrapper-14.3.0/bin/strip
  24774. 1300.56 s [algebraic-graph-duoids] Using tar found on system at:
  24775. 1300.56 s [algebraic-graph-duoids] /nix/store/i8hncwf8234flnbgi2z19bzy4hjwhss1-gnutar-1.35/bin/tar
  24776. 1300.56 s [algebraic-graph-duoids] No uhc found
  24777. 1300.70 s [algebraic-graph-duoids] Phase: buildPhase
  24778. 1300.76 s [algebraic-graph-duoids] Preprocessing library for algebraic-graph-duoids-0.0.1.0...
  24779. 1300.76 s [algebraic-graph-duoids] Building library for algebraic-graph-duoids-0.0.1.0...
  24780. 1300.87 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 )
  24781. 1301.29 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 )
  24782. 1302.25 s [algebraic-graph-duoids] [1 of 2] Compiling Algebra.Graph.Duoid ( src/Algebra/Graph/Duoid.hs, dist/build/Algebra/Graph/Duoid.p_o )
  24783. 1302.74 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 )
  24784. 1306.98 s [algebraic-graph-duoids] Preprocessing test suite 'laws' for algebraic-graph-duoids-0.0.1.0...
  24785. 1306.98 s [algebraic-graph-duoids] Building test suite 'laws' for algebraic-graph-duoids-0.0.1.0...
  24786. 1307.11 s [algebraic-graph-duoids] [1 of 1] Compiling Main ( tests/laws.hs, dist/build/laws/laws-tmp/Main.o )
  24787. 1308.12 s [algebraic-graph-duoids] [2 of 2] Linking dist/build/laws/laws
  24788. 1308.96 s [algebraic-graph-duoids] Preprocessing test suite 'doctests' for algebraic-graph-duoids-0.0.1.0...
  24789. 1308.96 s [algebraic-graph-duoids] Building test suite 'doctests' for algebraic-graph-duoids-0.0.1.0...
  24790. 1309.07 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 )
  24791. 1309.56 s [algebraic-graph-duoids] [2 of 2] Compiling Main ( tests/doctests.hs, dist/build/doctests/doctests-tmp/Main.o )
  24792. 1310.23 s [algebraic-graph-duoids] [3 of 3] Linking dist/build/doctests/doctests
  24793. 1314.02 s [algebraic-graph-duoids] Phase: checkPhase
  24794. 1314.27 s [algebraic-graph-duoids] Running 2 test suites...
  24795. 1314.27 s [algebraic-graph-duoids] Test suite laws: RUNNING...
  24796. 1314.28 s [algebraic-graph-duoids] ━━━ Duoid.Normal (Graph Word8) ━━━
  24797. 1314.29 s [algebraic-graph-duoids] ✓ unswapUnit passed 100 tests.
  24798. 1314.29 s [algebraic-graph-duoids] ✓ interchange passed 100 tests.
  24799. 1314.29 s [algebraic-graph-duoids] ✓ splitUnit passed 100 tests.
  24800. 1314.29 s [algebraic-graph-duoids] ✓ joinUnit passed 100 tests.
  24801. 1314.29 s [algebraic-graph-duoids] ✓ swapUnit passed 100 tests.
  24802. 1314.29 s [algebraic-graph-duoids] ✓ 5 succeeded.
  24803. 1314.29 s [algebraic-graph-duoids] Test suite laws: PASS
  24804. 1314.29 s [algebraic-graph-duoids] Test suite logged to: dist/test/algebraic-graph-duoids-0.0.1.0-laws.log
  24805. 1314.29 s [algebraic-graph-duoids] Test suite doctests: RUNNING...
  24806. 1314.79 s [algebraic-graph-duoids] Examples: 0 Tried: 0 Errors: 0 Failures: 0
  24807. 1314.83 s [algebraic-graph-duoids] NameLib Nothing
  24808. 1314.83 s [algebraic-graph-duoids] ----------------------------------------
  24809. 1314.84 s [algebraic-graph-duoids] Test suite doctests: PASS
  24810. 1314.84 s [algebraic-graph-duoids] Test suite logged to: dist/test/algebraic-graph-duoids-0.0.1.0-doctests.log
  24811. 1314.84 s [algebraic-graph-duoids] 2 of 2 test suites (2 of 2 test cases) passed.
  24812. 1314.85 s [algebraic-graph-duoids] Phase: haddockPhase
  24813. 1314.99 s [algebraic-graph-duoids] Preprocessing library for algebraic-graph-duoids-0.0.1.0...
  24814. 1314.99 s [algebraic-graph-duoids] Running Haddock on library for algebraic-graph-duoids-0.0.1.0...
  24815. 1315.31 s [algebraic-graph-duoids] [1 of 2] Compiling Algebra.Graph.Duoid ( src/Algebra/Graph/Duoid.hs, nothing )
  24816. 1315.71 s [algebraic-graph-duoids] [2 of 2] Compiling Algebra.Graph.Duoid.Orphans ( src/Algebra/Graph/Duoid/Orphans.hs, nothing )
  24817. 1315.89 s [algebraic-graph-duoids] Haddock coverage:
  24818. 1315.89 s [algebraic-graph-duoids] 100% ( 5 / 5) in 'Algebra.Graph.Duoid'
  24819. 1315.89 s [algebraic-graph-duoids] 100% ( 1 / 1) in 'Algebra.Graph.Duoid.Orphans'
  24820. 1325.14 s [algebraic-graph-duoids] Documentation created: dist/doc/html/algebraic-graph-duoids/,
  24821. 1325.14 s [algebraic-graph-duoids] dist/doc/html/algebraic-graph-duoids/algebraic-graph-duoids.txt
  24822. 1325.20 s [algebraic-graph-duoids] Preprocessing test suite 'laws' for algebraic-graph-duoids-0.0.1.0...
  24823. 1325.20 s [algebraic-graph-duoids] Preprocessing test suite 'doctests' for algebraic-graph-duoids-0.0.1.0...
  24824. 1325.21 s [algebraic-graph-duoids] Phase: installPhase
  24825. 1325.28 s [algebraic-graph-duoids] Installing library in /nix/store/48c0yplqvc0w9i6abq8jmzxbjmsq4hh0-algebraic-graph-duoids-0.0.1.0/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-1e2a/algebraic-graph-duoids-0.0.1.0-DoQSmPopdztK90iHFyVW8t
  24826. 1325.51 s [algebraic-graph-duoids] Phase: fixupPhase
  24827. 1325.53 s [algebraic-graph-duoids] shrinking RPATHs of ELF executables and libraries in /nix/store/48c0yplqvc0w9i6abq8jmzxbjmsq4hh0-algebraic-graph-duoids-0.0.1.0
  24828. 1325.53 s [algebraic-graph-duoids] shrinking /nix/store/48c0yplqvc0w9i6abq8jmzxbjmsq4hh0-algebraic-graph-duoids-0.0.1.0/lib/ghc-9.10.2/lib/x86_64-linux-ghc-9.10.2-1e2a/libHSalgebraic-graph-duoids-0.0.1.0-DoQSmPopdztK90iHFyVW8t-ghc9.10.2.so
  24829. 1325.54 s [algebraic-graph-duoids] checking for references to /build/ in /nix/store/48c0yplqvc0w9i6abq8jmzxbjmsq4hh0-algebraic-graph-duoids-0.0.1.0...
  24830. 1325.55 s [algebraic-graph-duoids] patching script interpreter paths in /nix/store/48c0yplqvc0w9i6abq8jmzxbjmsq4hh0-algebraic-graph-duoids-0.0.1.0
  24831. 1325.56 s [algebraic-graph-duoids] stripping (with command strip and flags -S -p) in /nix/store/48c0yplqvc0w9i6abq8jmzxbjmsq4hh0-algebraic-graph-duoids-0.0.1.0/lib
  24832. 1325.59 s [algebraic-graph-duoids] shrinking RPATHs of ELF executables and libraries in /nix/store/gh0d3p4anzfzbm7a9fha5yyqh3k8z8m3-algebraic-graph-duoids-0.0.1.0-doc
  24833. 1325.60 s [algebraic-graph-duoids] checking for references to /build/ in /nix/store/gh0d3p4anzfzbm7a9fha5yyqh3k8z8m3-algebraic-graph-duoids-0.0.1.0-doc...
  24834. 1325.62 s [algebraic-graph-duoids] patching script interpreter paths in /nix/store/gh0d3p4anzfzbm7a9fha5yyqh3k8z8m3-algebraic-graph-duoids-0.0.1.0-doc
  24835. 1325.78 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/48c0yplqvc0w9i6abq8jmzxbjmsq4hh0-algebraic-graph-duoids-0.0.1.0 /nix/store/gh0d3p4anzfzbm7a9fha5yyqh3k8z8m3-algebraic-graph-duoids-0.0.1.0-doc
  24836. 1326.19 s [post-build-hook] Pushing 2 paths (76 are already present) using zstd to cache sellout ⏳
  24837. 1326.19 s [post-build-hook]
  24838. 1326.62 s [post-build-hook] Pushing /nix/store/48c0yplqvc0w9i6abq8jmzxbjmsq4hh0-algebraic-graph-duoids-0.0.1.0 (1.23 MiB)
  24839. 1326.63 s [post-build-hook] Pushing /nix/store/gh0d3p4anzfzbm7a9fha5yyqh3k8z8m3-algebraic-graph-duoids-0.0.1.0-doc (539.91 KiB)
  24840. 1327.59 s [post-build-hook]
  24841. 1327.59 s [post-build-hook] All done.
  24842. 1327.61 s [post-build-hook] Uploading to the NixCI cache: /nix/store/48c0yplqvc0w9i6abq8jmzxbjmsq4hh0-algebraic-graph-duoids-0.0.1.0 /nix/store/gh0d3p4anzfzbm7a9fha5yyqh3k8z8m3-algebraic-graph-duoids-0.0.1.0-doc
  24843. 1327.66 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24844. 1327.67 s [post-build-hook] copying 2 paths...
  24845. 1327.67 s [post-build-hook] copying path '/nix/store/gh0d3p4anzfzbm7a9fha5yyqh3k8z8m3-algebraic-graph-duoids-0.0.1.0-doc' to 'https://cache.nix-ci.com'...
  24846. 1327.89 s [post-build-hook] copying path '/nix/store/48c0yplqvc0w9i6abq8jmzxbjmsq4hh0-algebraic-graph-duoids-0.0.1.0' to 'https://cache.nix-ci.com'...
  24847. 1328.27 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24848. 1328.48 s [post-build-hook] copying 1 paths...
  24849. 1328.48 s [post-build-hook] copying path '/nix/store/w7gpgwxaggzvl78rp3zg90j9hhjskj6z-algebraic-graph-duoids-0.0.1.0.drv' to 'https://cache.nix-ci.com'...
  24850. 1328.64 s Progress: 15 of 19 built, 177 of 177 downloaded from cache
  24851. 1328.68 s Building ghc-9.10.2-with-packages
  24852. 1328.73 s [ghc-9.10.2-with-packages] /nix/store/q100bhcm82xglcq9n7pmikbqwpca49ls-duoidal-transformers-0.0.1.0/nix-support:
  24853. 1328.73 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/48c0yplqvc0w9i6abq8jmzxbjmsq4hh0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24854. 1328.73 s [ghc-9.10.2-with-packages] /nix/store/5wzfl59csy20l6v8wfrh52x0i22jmrp4-duoids-0.0.1.0/nix-support:
  24855. 1328.73 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/48c0yplqvc0w9i6abq8jmzxbjmsq4hh0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24856. 1328.74 s [ghc-9.10.2-with-packages] /nix/store/hmi97yr3s7pq1i2xn2lmawdf52i3cwgn-duoids-hedgehog-0.0.1.0/nix-support:
  24857. 1328.74 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/48c0yplqvc0w9i6abq8jmzxbjmsq4hh0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24858. 1328.74 s [ghc-9.10.2-with-packages] /nix/store/33397k8r2slg23iwf0mavzm15i8nyq8d-algebraic-graphs-0.7/nix-support:
  24859. 1328.74 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/48c0yplqvc0w9i6abq8jmzxbjmsq4hh0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24860. 1328.75 s [ghc-9.10.2-with-packages] /nix/store/33397k8r2slg23iwf0mavzm15i8nyq8d-algebraic-graphs-0.7/nix-support:
  24861. 1328.75 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/48c0yplqvc0w9i6abq8jmzxbjmsq4hh0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24862. 1328.75 s [ghc-9.10.2-with-packages] /nix/store/i86lkksaflv4r87q0qrwjkzmkxidbkcn-ghc-compat-plugin-0.1.0.1/nix-support:
  24863. 1328.75 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/48c0yplqvc0w9i6abq8jmzxbjmsq4hh0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24864. 1328.75 s [ghc-9.10.2-with-packages] /nix/store/i86lkksaflv4r87q0qrwjkzmkxidbkcn-ghc-compat-plugin-0.1.0.1/nix-support:
  24865. 1328.75 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/48c0yplqvc0w9i6abq8jmzxbjmsq4hh0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24866. 1328.75 s [ghc-9.10.2-with-packages] /nix/store/4a5757hy61mya8xkrx5rqw899yn4q840-hedgehog-1.5/nix-support:
  24867. 1328.75 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/48c0yplqvc0w9i6abq8jmzxbjmsq4hh0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24868. 1328.76 s [ghc-9.10.2-with-packages] /nix/store/4a5757hy61mya8xkrx5rqw899yn4q840-hedgehog-1.5/nix-support:
  24869. 1328.76 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/48c0yplqvc0w9i6abq8jmzxbjmsq4hh0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24870. 1328.76 s [ghc-9.10.2-with-packages] /nix/store/nr8q60a19hzjr68c1nrm5rhf2v2pli7k-ansi-terminal-1.1.3/nix-support:
  24871. 1328.76 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/48c0yplqvc0w9i6abq8jmzxbjmsq4hh0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24872. 1328.76 s [ghc-9.10.2-with-packages] /nix/store/nr8q60a19hzjr68c1nrm5rhf2v2pli7k-ansi-terminal-1.1.3/nix-support:
  24873. 1328.76 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/48c0yplqvc0w9i6abq8jmzxbjmsq4hh0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24874. 1328.76 s [ghc-9.10.2-with-packages] /nix/store/hrqigzyck2fmrxwd0sbprny1l9dyblbs-async-2.2.5/nix-support:
  24875. 1328.76 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/48c0yplqvc0w9i6abq8jmzxbjmsq4hh0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24876. 1328.76 s [ghc-9.10.2-with-packages] /nix/store/hrqigzyck2fmrxwd0sbprny1l9dyblbs-async-2.2.5/nix-support:
  24877. 1328.76 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/48c0yplqvc0w9i6abq8jmzxbjmsq4hh0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24878. 1328.77 s [ghc-9.10.2-with-packages] /nix/store/0wv7zyqwf2w1j0wplid6xdb4i67dx30y-barbies-2.1.1.0/nix-support:
  24879. 1328.77 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/48c0yplqvc0w9i6abq8jmzxbjmsq4hh0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24880. 1328.77 s [ghc-9.10.2-with-packages] /nix/store/0wv7zyqwf2w1j0wplid6xdb4i67dx30y-barbies-2.1.1.0/nix-support:
  24881. 1328.77 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/48c0yplqvc0w9i6abq8jmzxbjmsq4hh0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24882. 1328.77 s [ghc-9.10.2-with-packages] /nix/store/6si8zsjbgams5g95mn38388hi5s0xa2g-concurrent-output-1.10.21/nix-support:
  24883. 1328.77 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/48c0yplqvc0w9i6abq8jmzxbjmsq4hh0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24884. 1328.78 s [ghc-9.10.2-with-packages] /nix/store/6si8zsjbgams5g95mn38388hi5s0xa2g-concurrent-output-1.10.21/nix-support:
  24885. 1328.78 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/48c0yplqvc0w9i6abq8jmzxbjmsq4hh0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24886. 1328.78 s [ghc-9.10.2-with-packages] /nix/store/vndl7knv97k4cjlfg75znwfdkf5mda5r-lifted-async-0.10.2.7/nix-support:
  24887. 1328.78 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/48c0yplqvc0w9i6abq8jmzxbjmsq4hh0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24888. 1328.78 s [ghc-9.10.2-with-packages] /nix/store/vndl7knv97k4cjlfg75znwfdkf5mda5r-lifted-async-0.10.2.7/nix-support:
  24889. 1328.78 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/48c0yplqvc0w9i6abq8jmzxbjmsq4hh0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24890. 1328.78 s [ghc-9.10.2-with-packages] /nix/store/mpa3kfhidwczcjf7vy7zhj4288a48z8z-mmorph-1.2.1/nix-support:
  24891. 1328.78 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/48c0yplqvc0w9i6abq8jmzxbjmsq4hh0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24892. 1328.79 s [ghc-9.10.2-with-packages] /nix/store/mpa3kfhidwczcjf7vy7zhj4288a48z8z-mmorph-1.2.1/nix-support:
  24893. 1328.79 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/48c0yplqvc0w9i6abq8jmzxbjmsq4hh0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24894. 1328.79 s [ghc-9.10.2-with-packages] /nix/store/jc807azqrqjy4m2avrknx9sqm7g51a0n-monad-control-1.0.3.1/nix-support:
  24895. 1328.79 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/48c0yplqvc0w9i6abq8jmzxbjmsq4hh0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24896. 1328.79 s [ghc-9.10.2-with-packages] /nix/store/jc807azqrqjy4m2avrknx9sqm7g51a0n-monad-control-1.0.3.1/nix-support:
  24897. 1328.79 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/48c0yplqvc0w9i6abq8jmzxbjmsq4hh0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24898. 1328.79 s [ghc-9.10.2-with-packages] /nix/store/jhyi7rbfn0404s8wv41xb5b7zhmpzzsa-pretty-show-1.10/nix-support:
  24899. 1328.79 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/48c0yplqvc0w9i6abq8jmzxbjmsq4hh0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24900. 1328.79 s [ghc-9.10.2-with-packages] /nix/store/jhyi7rbfn0404s8wv41xb5b7zhmpzzsa-pretty-show-1.10/nix-support:
  24901. 1328.79 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/48c0yplqvc0w9i6abq8jmzxbjmsq4hh0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24902. 1328.79 s [ghc-9.10.2-with-packages] /nix/store/bf54j8c8x307m4wwcsdrnfx4cc1lklwm-primitive-0.9.1.0/nix-support:
  24903. 1328.79 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/48c0yplqvc0w9i6abq8jmzxbjmsq4hh0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24904. 1328.80 s [ghc-9.10.2-with-packages] /nix/store/bf54j8c8x307m4wwcsdrnfx4cc1lklwm-primitive-0.9.1.0/nix-support:
  24905. 1328.80 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/48c0yplqvc0w9i6abq8jmzxbjmsq4hh0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24906. 1328.80 s [ghc-9.10.2-with-packages] /nix/store/a85wc4mi4wj1kbvlk9wqfdhxmix0j6p7-random-1.2.1.3/nix-support:
  24907. 1328.80 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/48c0yplqvc0w9i6abq8jmzxbjmsq4hh0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24908. 1328.80 s [ghc-9.10.2-with-packages] /nix/store/a85wc4mi4wj1kbvlk9wqfdhxmix0j6p7-random-1.2.1.3/nix-support:
  24909. 1328.80 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/48c0yplqvc0w9i6abq8jmzxbjmsq4hh0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24910. 1328.81 s [ghc-9.10.2-with-packages] /nix/store/dk6b2s9fjysd0h54dxg9anqjn68wpx8g-resourcet-1.3.0/nix-support:
  24911. 1328.81 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/48c0yplqvc0w9i6abq8jmzxbjmsq4hh0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24912. 1328.81 s [ghc-9.10.2-with-packages] /nix/store/dk6b2s9fjysd0h54dxg9anqjn68wpx8g-resourcet-1.3.0/nix-support:
  24913. 1328.81 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/48c0yplqvc0w9i6abq8jmzxbjmsq4hh0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24914. 1328.81 s [ghc-9.10.2-with-packages] /nix/store/79g56291kaj7cl3w9df7w0y7fghxcgdc-safe-exceptions-0.1.7.4/nix-support:
  24915. 1328.81 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/48c0yplqvc0w9i6abq8jmzxbjmsq4hh0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24916. 1328.81 s [ghc-9.10.2-with-packages] /nix/store/79g56291kaj7cl3w9df7w0y7fghxcgdc-safe-exceptions-0.1.7.4/nix-support:
  24917. 1328.81 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/48c0yplqvc0w9i6abq8jmzxbjmsq4hh0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24918. 1328.81 s [ghc-9.10.2-with-packages] /nix/store/wff8shwfm0b4yj3891jmhh72gasfc2hv-transformers-base-0.4.6/nix-support:
  24919. 1328.81 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/48c0yplqvc0w9i6abq8jmzxbjmsq4hh0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24920. 1328.82 s [ghc-9.10.2-with-packages] /nix/store/wff8shwfm0b4yj3891jmhh72gasfc2hv-transformers-base-0.4.6/nix-support:
  24921. 1328.82 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/48c0yplqvc0w9i6abq8jmzxbjmsq4hh0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24922. 1328.82 s [ghc-9.10.2-with-packages] /nix/store/b8mlz83j47f7y9wdrkymc1kdh1qn6jsm-wl-pprint-annotated-0.1.0.1/nix-support:
  24923. 1328.82 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/48c0yplqvc0w9i6abq8jmzxbjmsq4hh0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24924. 1328.82 s [ghc-9.10.2-with-packages] /nix/store/b8mlz83j47f7y9wdrkymc1kdh1qn6jsm-wl-pprint-annotated-0.1.0.1/nix-support:
  24925. 1328.82 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/48c0yplqvc0w9i6abq8jmzxbjmsq4hh0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24926. 1328.82 s [ghc-9.10.2-with-packages] /nix/store/xzlp6bdqcd2jn0c4f2q6hri94a61y6ia-ansi-terminal-types-1.1.3/nix-support:
  24927. 1328.82 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/48c0yplqvc0w9i6abq8jmzxbjmsq4hh0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24928. 1328.82 s [ghc-9.10.2-with-packages] /nix/store/xzlp6bdqcd2jn0c4f2q6hri94a61y6ia-ansi-terminal-types-1.1.3/nix-support:
  24929. 1328.82 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/48c0yplqvc0w9i6abq8jmzxbjmsq4hh0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24930. 1328.83 s [ghc-9.10.2-with-packages] /nix/store/z4vgh1rmlxkn0msz1j4kza2gl0qnr4ds-hashable-1.5.0.0/nix-support:
  24931. 1328.83 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/48c0yplqvc0w9i6abq8jmzxbjmsq4hh0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24932. 1328.83 s [ghc-9.10.2-with-packages] /nix/store/z4vgh1rmlxkn0msz1j4kza2gl0qnr4ds-hashable-1.5.0.0/nix-support:
  24933. 1328.83 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/48c0yplqvc0w9i6abq8jmzxbjmsq4hh0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24934. 1328.84 s [ghc-9.10.2-with-packages] /nix/store/zd2ng59x3q2jmvgi3vy8zmidw3p3l0ra-distributive-0.6.2.1/nix-support:
  24935. 1328.84 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/48c0yplqvc0w9i6abq8jmzxbjmsq4hh0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24936. 1328.84 s [ghc-9.10.2-with-packages] /nix/store/zd2ng59x3q2jmvgi3vy8zmidw3p3l0ra-distributive-0.6.2.1/nix-support:
  24937. 1328.84 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/48c0yplqvc0w9i6abq8jmzxbjmsq4hh0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24938. 1328.84 s [ghc-9.10.2-with-packages] /nix/store/hra1wy4awflv83lzv92hi4jppzki57kx-constraints-0.14.2/nix-support:
  24939. 1328.84 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/48c0yplqvc0w9i6abq8jmzxbjmsq4hh0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24940. 1328.85 s [ghc-9.10.2-with-packages] /nix/store/hra1wy4awflv83lzv92hi4jppzki57kx-constraints-0.14.2/nix-support:
  24941. 1328.85 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/48c0yplqvc0w9i6abq8jmzxbjmsq4hh0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24942. 1328.85 s [ghc-9.10.2-with-packages] /nix/store/w07ijhjbpgqnni69pjyg36kd62fjzkhh-lifted-base-0.2.3.12/nix-support:
  24943. 1328.85 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/48c0yplqvc0w9i6abq8jmzxbjmsq4hh0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24944. 1328.85 s [ghc-9.10.2-with-packages] /nix/store/w07ijhjbpgqnni69pjyg36kd62fjzkhh-lifted-base-0.2.3.12/nix-support:
  24945. 1328.85 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/48c0yplqvc0w9i6abq8jmzxbjmsq4hh0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24946. 1328.85 s [ghc-9.10.2-with-packages] /nix/store/qwcv9ja2na55pgsnck2sglgi6cfb8mff-transformers-compat-0.7.2/nix-support:
  24947. 1328.85 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/48c0yplqvc0w9i6abq8jmzxbjmsq4hh0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24948. 1328.85 s [ghc-9.10.2-with-packages] /nix/store/qwcv9ja2na55pgsnck2sglgi6cfb8mff-transformers-compat-0.7.2/nix-support:
  24949. 1328.85 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/48c0yplqvc0w9i6abq8jmzxbjmsq4hh0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24950. 1328.86 s [ghc-9.10.2-with-packages] /nix/store/3hbwsli9xivm9kfjbap28z7xj7fm1n0f-splitmix-0.1.3.1/nix-support:
  24951. 1328.86 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/48c0yplqvc0w9i6abq8jmzxbjmsq4hh0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24952. 1328.86 s [ghc-9.10.2-with-packages] /nix/store/3hbwsli9xivm9kfjbap28z7xj7fm1n0f-splitmix-0.1.3.1/nix-support:
  24953. 1328.86 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/48c0yplqvc0w9i6abq8jmzxbjmsq4hh0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24954. 1328.86 s [ghc-9.10.2-with-packages] /nix/store/pphl765d1mv6wx6xky8mysaazarygb8n-unliftio-core-0.2.1.0/nix-support:
  24955. 1328.86 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/48c0yplqvc0w9i6abq8jmzxbjmsq4hh0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24956. 1328.87 s [ghc-9.10.2-with-packages] /nix/store/pphl765d1mv6wx6xky8mysaazarygb8n-unliftio-core-0.2.1.0/nix-support:
  24957. 1328.87 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/48c0yplqvc0w9i6abq8jmzxbjmsq4hh0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24958. 1328.87 s [ghc-9.10.2-with-packages] /nix/store/m2gq7h6h9bpf455qzrpwdjhw9yh9vq1j-base-orphans-0.9.3/nix-support:
  24959. 1328.87 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/48c0yplqvc0w9i6abq8jmzxbjmsq4hh0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24960. 1328.87 s [ghc-9.10.2-with-packages] /nix/store/m2gq7h6h9bpf455qzrpwdjhw9yh9vq1j-base-orphans-0.9.3/nix-support:
  24961. 1328.87 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/48c0yplqvc0w9i6abq8jmzxbjmsq4hh0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24962. 1328.87 s [ghc-9.10.2-with-packages] /nix/store/ank6g1fwv3nyqxpzwr44yg0r7226r6yy-tagged-0.8.9/nix-support:
  24963. 1328.87 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/48c0yplqvc0w9i6abq8jmzxbjmsq4hh0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24964. 1328.87 s [ghc-9.10.2-with-packages] /nix/store/ank6g1fwv3nyqxpzwr44yg0r7226r6yy-tagged-0.8.9/nix-support:
  24965. 1328.87 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/48c0yplqvc0w9i6abq8jmzxbjmsq4hh0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24966. 1328.87 s [ghc-9.10.2-with-packages] /nix/store/gm0vdhnflvssfqbwxxp4qrc2j6i7jhld-boring-0.2.2/nix-support:
  24967. 1328.87 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/48c0yplqvc0w9i6abq8jmzxbjmsq4hh0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24968. 1328.87 s [ghc-9.10.2-with-packages] /nix/store/gm0vdhnflvssfqbwxxp4qrc2j6i7jhld-boring-0.2.2/nix-support:
  24969. 1328.87 s [ghc-9.10.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/48c0yplqvc0w9i6abq8jmzxbjmsq4hh0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24970. 1329.63 s [ghc-9.10.2-with-packages] Warning: include-dirs: /nix/store/0fnv0a8m2mffgw6cgb4pf4a2pfs76vzz-ghc-9.10.2-with-packages/lib/ghc-9.10.2/lib/../lib/x86_64-linux-ghc-9.10.2/directory-1.3.8.5-ad1a/include doesn't exist or isn't a directory
  24971. 1330.83 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/0fnv0a8m2mffgw6cgb4pf4a2pfs76vzz-ghc-9.10.2-with-packages
  24972. 1331.26 s [post-build-hook] Pushing 1 paths (144 are already present) using zstd to cache sellout ⏳
  24973. 1331.29 s [post-build-hook]
  24974. 1331.66 s [post-build-hook] Pushing /nix/store/0fnv0a8m2mffgw6cgb4pf4a2pfs76vzz-ghc-9.10.2-with-packages (4.94 MiB)
  24975. 1333.34 s [post-build-hook]
  24976. 1333.34 s [post-build-hook] All done.
  24977. 1333.36 s [post-build-hook] Uploading to the NixCI cache: /nix/store/0fnv0a8m2mffgw6cgb4pf4a2pfs76vzz-ghc-9.10.2-with-packages
  24978. 1333.40 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24979. 1333.54 s [post-build-hook] copying 1 paths...
  24980. 1333.54 s [post-build-hook] copying path '/nix/store/0fnv0a8m2mffgw6cgb4pf4a2pfs76vzz-ghc-9.10.2-with-packages' to 'https://cache.nix-ci.com'...
  24981. 1334.59 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24982. 1334.77 s [post-build-hook] copying 1 paths...
  24983. 1334.77 s [post-build-hook] copying path '/nix/store/6alvj6l4x339r4hhrp14vfdv0k9206dd-ghc-9.10.2-with-packages.drv' to 'https://cache.nix-ci.com'...
  24984. 1334.92 s Progress: 16 of 18 built, 177 of 177 downloaded from cache
  24985. 1334.96 s Building all-packages
  24986. 1335.03 s [all-packages] created 3 symlinks in user environment
  24987. 1335.06 s [post-build-hook] Uploading to cachix cache "sellout": /nix/store/cj3a3ia2dsdmp7ffsrs92rzscni89wm5-all-packages
  24988. 1335.53 s [post-build-hook] Pushing 1 paths (145 are already present) using zstd to cache sellout ⏳
  24989. 1335.53 s [post-build-hook]
  24990. 1335.89 s [post-build-hook] Pushing /nix/store/cj3a3ia2dsdmp7ffsrs92rzscni89wm5-all-packages (872.00 B)
  24991. 1336.81 s [post-build-hook]
  24992. 1336.82 s [post-build-hook] All done.
  24993. 1336.83 s [post-build-hook] Uploading to the NixCI cache: /nix/store/cj3a3ia2dsdmp7ffsrs92rzscni89wm5-all-packages
  24994. 1336.86 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24995. 1337.00 s [post-build-hook] copying 1 paths...
  24996. 1337.00 s [post-build-hook] copying path '/nix/store/cj3a3ia2dsdmp7ffsrs92rzscni89wm5-all-packages' to 'https://cache.nix-ci.com'...
  24997. 1337.18 s [post-build-hook] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24998. 1337.39 s [post-build-hook] copying 1 paths...
  24999. 1337.39 s [post-build-hook] copying path '/nix/store/9p4nv19yaak49xcignrx2ggznfcd757w-all-packages.drv' to 'https://cache.nix-ci.com'...
  25000. 1337.54 s Progress: 17 of 18 built, 177 of 177 downloaded from cache
Tail Raw Logs