1. 12.55 s [Cabal-syntax] depends bytestring-0.11.5.3
  2. 12.55 s [Cabal-syntax] depends containers-0.6.7
  3. 12.55 s [Cabal-syntax] depends deepseq-1.4.8.0
  4. 12.55 s [Cabal-syntax] depends directory-1.3.7.1
  5. 12.55 s [Cabal-syntax] depends filepath-1.4.2.2
  6. 12.55 s [Cabal-syntax] depends mtl-2.2.2
  7. 12.55 s [Cabal-syntax] depends parsec-3.1.16.1
  8. 12.55 s [Cabal-syntax] depends pretty-1.1.3.6
  9. 12.69 s [Cabal-syntax] depends text-2.0.2
  10. 12.69 s [Cabal-syntax] depends time-1.12.2
  11. 12.69 s [Cabal-syntax] depends transformers-0.5.6.2
  12. 12.69 s [Cabal-syntax] Using Cabal-3.8.1.0 compiled by ghc-9.4
  13. 12.69 s [Cabal-syntax] Using compiler: ghc-9.4.8
  14. 12.69 s [Cabal-syntax] Using install prefix:
  15. 12.69 s [Cabal-syntax] /nix/store/4h9a4k3xbwh0l3853a9mlzrfbbzib1la-Cabal-syntax-3.12.1.0
  16. 12.69 s [Cabal-syntax] Executables installed in:
  17. 12.69 s [Cabal-syntax] /nix/store/4h9a4k3xbwh0l3853a9mlzrfbbzib1la-Cabal-syntax-3.12.1.0/bin
  18. 12.69 s [Cabal-syntax] Libraries installed in:
  19. 12.69 s [Cabal-syntax] /nix/store/4h9a4k3xbwh0l3853a9mlzrfbbzib1la-Cabal-syntax-3.12.1.0/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP
  20. 12.69 s [Cabal-syntax] Dynamic Libraries installed in:
  21. 12.69 s [Cabal-syntax] /nix/store/4h9a4k3xbwh0l3853a9mlzrfbbzib1la-Cabal-syntax-3.12.1.0/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8
  22. 12.69 s [Cabal-syntax] Private executables installed in:
  23. 12.69 s [Cabal-syntax] /nix/store/4h9a4k3xbwh0l3853a9mlzrfbbzib1la-Cabal-syntax-3.12.1.0/libexec/x86_64-linux-ghc-9.4.8/Cabal-syntax-3.12.1.0
  24. 12.69 s [Cabal-syntax] Data files installed in:
  25. 12.69 s [Cabal-syntax] /nix/store/4h9a4k3xbwh0l3853a9mlzrfbbzib1la-Cabal-syntax-3.12.1.0/share/x86_64-linux-ghc-9.4.8/Cabal-syntax-3.12.1.0
  26. 12.69 s [Cabal-syntax] Documentation installed in:
  27. 12.69 s [Cabal-syntax] /nix/store/q6w2fw2907xvc63b2xc4im1afq7kkqjs-Cabal-syntax-3.12.1.0-doc/share/doc/Cabal-syntax-3.12.1.0
  28. 12.69 s [Cabal-syntax] Configuration files installed in:
  29. 12.69 s [Cabal-syntax] /nix/store/4h9a4k3xbwh0l3853a9mlzrfbbzib1la-Cabal-syntax-3.12.1.0/etc
  30. 12.69 s [Cabal-syntax] Using alex version 3.5.4.0 found on system at:
  31. 12.69 s [Cabal-syntax] /nix/store/50wg57nkmr6gvfx9wgkvf582p65qjgjx-alex-3.5.4.0/bin/alex
  32. 12.69 s [Cabal-syntax] Using ar found on system at:
  33. 12.69 s [Cabal-syntax] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  34. 12.69 s [Cabal-syntax] No c2hs found
  35. 12.69 s [Cabal-syntax] No cpphs found
  36. 12.69 s [Cabal-syntax] No doctest found
  37. 12.69 s [Cabal-syntax] Using gcc version 14.3.0 given by user at:
  38. 12.69 s [Cabal-syntax] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  39. 12.69 s [Cabal-syntax] Using ghc version 9.4.8 found on system at:
  40. 12.69 s [Cabal-syntax] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/ghc
  41. 12.69 s [Cabal-syntax] Using ghc-pkg version 9.4.8 found on system at:
  42. 12.69 s [Cabal-syntax] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/ghc-pkg-9.4.8
  43. 12.69 s [Cabal-syntax] No ghcjs found
  44. 12.69 s [Cabal-syntax] No ghcjs-pkg found
  45. 12.69 s [Cabal-syntax] No greencard found
  46. 12.69 s [Cabal-syntax] Using haddock version 2.27.0 found on system at:
  47. 12.69 s [Cabal-syntax] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/haddock-ghc-9.4.8
  48. 12.70 s [Cabal-syntax] No happy found
  49. 12.70 s [Cabal-syntax] Using haskell-suite found on system at: haskell-suite-dummy-location
  50. 12.70 s [Cabal-syntax] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  51. 12.70 s [Cabal-syntax] No hmake found
  52. 12.70 s [Cabal-syntax] Using hpc version 0.68 found on system at:
  53. 12.70 s [Cabal-syntax] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/hpc
  54. 12.70 s [Cabal-syntax] Using hsc2hs version 0.68.8 found on system at:
  55. 12.70 s [Cabal-syntax] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/hsc2hs
  56. 12.70 s [Cabal-syntax] Using hscolour version 1.25 found on system at:
  57. 12.70 s [Cabal-syntax] /nix/store/87hdxxa93g58b2w9ylr2idn2a40i3fdc-hscolour-1.25/bin/HsColour
  58. 12.70 s [Cabal-syntax] No jhc found
  59. 12.70 s [Cabal-syntax] Using ld found on system at:
  60. 12.70 s [Cabal-syntax] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ld.gold
  61. 12.70 s [Cabal-syntax] No pkg-config found
  62. 12.70 s [Cabal-syntax] Using runghc version 9.4.8 found on system at:
  63. 12.70 s [Cabal-syntax] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/runghc-9.4.8
  64. 12.70 s [Cabal-syntax] Using strip version 2.44 found on system at:
  65. 12.70 s [Cabal-syntax] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  66. 12.70 s [Cabal-syntax] Using tar found on system at:
  67. 12.70 s [Cabal-syntax] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  68. 12.70 s [Cabal-syntax] No uhc found
  69. 12.71 s [Cabal-syntax] Phase: buildPhase
  70. 12.76 s [Cabal-syntax] Preprocessing library for Cabal-syntax-3.12.1.0..
  71. 12.82 s [Cabal-syntax] Building library for Cabal-syntax-3.12.1.0..
  72. 13.43 s [Cabal-syntax] [ 1 of 137] Compiling Distribution.Compat.Binary ( src/Distribution/Compat/Binary.hs, dist/build/Distribution/Compat/Binary.o, dist/build/Distribution/Compat/Binary.dyn_o )
  73. 13.63 s [Cabal-syntax] [ 2 of 137] Compiling Distribution.Compat.Exception ( src/Distribution/Compat/Exception.hs, dist/build/Distribution/Compat/Exception.o, dist/build/Distribution/Compat/Exception.dyn_o )
  74. 13.64 s [Cabal-syntax] [ 3 of 137] Compiling Distribution.Compat.MonadFail ( src/Distribution/Compat/MonadFail.hs, dist/build/Distribution/Compat/MonadFail.o, dist/build/Distribution/Compat/MonadFail.dyn_o )
  75. 13.64 s [Cabal-syntax] [ 4 of 137] Compiling Distribution.Compat.Newtype ( src/Distribution/Compat/Newtype.hs, dist/build/Distribution/Compat/Newtype.o, dist/build/Distribution/Compat/Newtype.dyn_o )
  76. 13.64 s [Cabal-syntax] [ 5 of 137] Compiling Distribution.Compat.Typeable ( src/Distribution/Compat/Typeable.hs, dist/build/Distribution/Compat/Typeable.o, dist/build/Distribution/Compat/Typeable.dyn_o )
  77. 13.64 s [Cabal-syntax] [ 6 of 137] Compiling Distribution.PackageDescription.Utils ( src/Distribution/PackageDescription/Utils.hs, dist/build/Distribution/PackageDescription/Utils.o, dist/build/Distribution/PackageDescription/Utils.dyn_o )
  78. 13.64 s [Cabal-syntax] [ 7 of 137] Compiling Distribution.Utils.Base62 ( src/Distribution/Utils/Base62.hs, dist/build/Distribution/Utils/Base62.o, dist/build/Distribution/Utils/Base62.dyn_o )
  79. 13.66 s [Cabal-syntax] [ 8 of 137] Compiling Distribution.Utils.MD5 ( src/Distribution/Utils/MD5.hs, dist/build/Distribution/Utils/MD5.o, dist/build/Distribution/Utils/MD5.dyn_o )
  80. 13.77 s [Cabal-syntax] [ 9 of 137] Compiling Distribution.Utils.String ( src/Distribution/Utils/String.hs, dist/build/Distribution/Utils/String.o, dist/build/Distribution/Utils/String.dyn_o )
  81. 13.77 s [Cabal-syntax] [ 10 of 137] Compiling Distribution.Utils.Structured ( src/Distribution/Utils/Structured.hs, dist/build/Distribution/Utils/Structured.o, dist/build/Distribution/Utils/Structured.dyn_o )
  82. 15.77 s [Cabal-syntax] [ 11 of 137] Compiling Distribution.Compat.Semigroup ( src/Distribution/Compat/Semigroup.hs, dist/build/Distribution/Compat/Semigroup.o, dist/build/Distribution/Compat/Semigroup.dyn_o )
  83. 16.15 s [Cabal-syntax] [ 12 of 137] Compiling Distribution.Compat.NonEmptySet ( src/Distribution/Compat/NonEmptySet.hs, dist/build/Distribution/Compat/NonEmptySet.o, dist/build/Distribution/Compat/NonEmptySet.dyn_o )
  84. 16.24 s [Cabal-syntax] [ 13 of 137] Compiling Distribution.Compat.Prelude ( src/Distribution/Compat/Prelude.hs, dist/build/Distribution/Compat/Prelude.o, dist/build/Distribution/Compat/Prelude.dyn_o )
  85. 16.34 s [Cabal-syntax] [ 14 of 137] Compiling Distribution.Utils.ShortText ( src/Distribution/Utils/ShortText.hs, dist/build/Distribution/Utils/ShortText.o, dist/build/Distribution/Utils/ShortText.dyn_o )
  86. 17.23 s [Cabal-syntax] [ 15 of 137] Compiling Distribution.Utils.Generic ( src/Distribution/Utils/Generic.hs, dist/build/Distribution/Utils/Generic.o, dist/build/Distribution/Utils/Generic.dyn_o )
  87. 17.58 s [Cabal-syntax] [ 16 of 137] Compiling Distribution.Types.Condition ( src/Distribution/Types/Condition.hs, dist/build/Distribution/Types/Condition.o, dist/build/Distribution/Types/Condition.dyn_o )
  88. 18.42 s [Cabal-syntax] [ 17 of 137] Compiling Distribution.Parsec.Position ( src/Distribution/Parsec/Position.hs, dist/build/Distribution/Parsec/Position.o, dist/build/Distribution/Parsec/Position.dyn_o )
  89. 18.42 s [Cabal-syntax] [ 18 of 137] Compiling Distribution.Parsec.Warning ( src/Distribution/Parsec/Warning.hs, dist/build/Distribution/Parsec/Warning.o, dist/build/Distribution/Parsec/Warning.dyn_o )
  90. 19.90 s [Cabal-syntax] [ 19 of 137] Compiling Distribution.Parsec.FieldLineStream ( src/Distribution/Parsec/FieldLineStream.hs, dist/build/Distribution/Parsec/FieldLineStream.o, dist/build/Distribution/Parsec/FieldLineStream.dyn_o )
  91. 19.90 s [Cabal-syntax] [ 20 of 137] Compiling Distribution.Parsec.Error ( src/Distribution/Parsec/Error.hs, dist/build/Distribution/Parsec/Error.o, dist/build/Distribution/Parsec/Error.dyn_o )
  92. 19.90 s [Cabal-syntax] [ 21 of 137] Compiling Distribution.PackageDescription.Quirks ( src/Distribution/PackageDescription/Quirks.hs, dist/build/Distribution/PackageDescription/Quirks.o, dist/build/Distribution/PackageDescription/Quirks.dyn_o )
  93. 19.91 s [Cabal-syntax] [ 22 of 137] Compiling Distribution.Fields.LexerMonad ( src/Distribution/Fields/LexerMonad.hs, dist/build/Distribution/Fields/LexerMonad.o, dist/build/Distribution/Fields/LexerMonad.dyn_o )
  94. 20.74 s [Cabal-syntax] [ 23 of 137] Compiling Distribution.Fields.Lexer ( dist/build/Distribution/Fields/Lexer.hs, dist/build/Distribution/Fields/Lexer.o, dist/build/Distribution/Fields/Lexer.dyn_o )
  95. 22.38 s [Cabal-syntax] [ 24 of 137] Compiling Distribution.Compat.Parsing ( src/Distribution/Compat/Parsing.hs, dist/build/Distribution/Compat/Parsing.o, dist/build/Distribution/Compat/Parsing.dyn_o )
  96. 22.40 s [Cabal-syntax] [ 25 of 137] Compiling Distribution.Compat.DList ( src/Distribution/Compat/DList.hs, dist/build/Distribution/Compat/DList.o, dist/build/Distribution/Compat/DList.dyn_o )
  97. 22.40 s [Cabal-syntax] [ 26 of 137] Compiling Distribution.Compat.Lens ( src/Distribution/Compat/Lens.hs, dist/build/Distribution/Compat/Lens.o, dist/build/Distribution/Compat/Lens.dyn_o )
  98. 22.40 s [Cabal-syntax] [ 27 of 137] Compiling Distribution.Types.CondTree ( src/Distribution/Types/CondTree.hs, dist/build/Distribution/Types/CondTree.o, dist/build/Distribution/Types/CondTree.dyn_o )
  99. 23.60 s [Cabal-syntax] [ 28 of 137] Compiling Distribution.Compat.CharParsing ( src/Distribution/Compat/CharParsing.hs, dist/build/Distribution/Compat/CharParsing.o, dist/build/Distribution/Compat/CharParsing.dyn_o )
  100. 23.60 s [Cabal-syntax] [ 29 of 137] Compiling Distribution.CabalSpecVersion ( src/Distribution/CabalSpecVersion.hs, dist/build/Distribution/CabalSpecVersion.o, dist/build/Distribution/CabalSpecVersion.dyn_o )
  101. 23.60 s [Cabal-syntax] [ 30 of 137] Compiling Distribution.SPDX.LicenseListVersion ( src/Distribution/SPDX/LicenseListVersion.hs, dist/build/Distribution/SPDX/LicenseListVersion.o, dist/build/Distribution/SPDX/LicenseListVersion.dyn_o )
  102. 23.60 s [Cabal-syntax] [ 31 of 137] Compiling Distribution.Pretty ( src/Distribution/Pretty.hs, dist/build/Distribution/Pretty.o, dist/build/Distribution/Pretty.dyn_o )
  103. 23.60 s [Cabal-syntax] [ 32 of 137] Compiling Distribution.Fields.Field ( src/Distribution/Fields/Field.hs, dist/build/Distribution/Fields/Field.o, dist/build/Distribution/Fields/Field.dyn_o )
  104. 24.09 s [Cabal-syntax] [ 33 of 137] Compiling Distribution.Fields.Parser ( src/Distribution/Fields/Parser.hs, dist/build/Distribution/Fields/Parser.o, dist/build/Distribution/Fields/Parser.dyn_o )
  105. 29.20 s [Cabal-syntax] [ 34 of 137] Compiling Distribution.Fields.Pretty ( src/Distribution/Fields/Pretty.hs, dist/build/Distribution/Fields/Pretty.o, dist/build/Distribution/Fields/Pretty.dyn_o )
  106. 37.13 s [Cabal-syntax] [ 35 of 137] Compiling Distribution.Parsec ( src/Distribution/Parsec.hs, dist/build/Distribution/Parsec.o, dist/build/Distribution/Parsec.dyn_o )
  107. 37.14 s [Cabal-syntax] [ 36 of 137] Compiling Distribution.Utils.Path ( src/Distribution/Utils/Path.hs, dist/build/Distribution/Utils/Path.o, dist/build/Distribution/Utils/Path.dyn_o )
  108. 37.15 s [Cabal-syntax] [ 37 of 137] Compiling Distribution.Types.Version ( src/Distribution/Types/Version.hs, dist/build/Distribution/Types/Version.o, dist/build/Distribution/Types/Version.dyn_o )
  109. 37.15 s [Cabal-syntax] [ 38 of 137] Compiling Distribution.Types.VersionRange.Internal ( src/Distribution/Types/VersionRange/Internal.hs, dist/build/Distribution/Types/VersionRange/Internal.o, dist/build/Distribution/Types/VersionRange/Internal.dyn_o )
  110. 45.74 s [Cabal-syntax] [ 39 of 137] Compiling Distribution.Types.VersionInterval.Legacy ( src/Distribution/Types/VersionInterval/Legacy.hs, dist/build/Distribution/Types/VersionInterval/Legacy.o, dist/build/Distribution/Types/VersionInterval/Legacy.dyn_o )
  111. 47.43 s [Cabal-syntax] [ 40 of 137] Compiling Distribution.Types.VersionInterval ( src/Distribution/Types/VersionInterval.hs, dist/build/Distribution/Types/VersionInterval.o, dist/build/Distribution/Types/VersionInterval.dyn_o )
  112. 47.72 s [Cabal-syntax] [ 41 of 137] Compiling Distribution.Types.VersionRange ( src/Distribution/Types/VersionRange.hs, dist/build/Distribution/Types/VersionRange.o, dist/build/Distribution/Types/VersionRange.dyn_o )
  113. 48.15 s [Cabal-syntax] [ 42 of 137] Compiling Distribution.Types.SourceRepo ( src/Distribution/Types/SourceRepo.hs, dist/build/Distribution/Types/SourceRepo.o, dist/build/Distribution/Types/SourceRepo.dyn_o )
  114. 48.15 s [Cabal-syntax] [ 43 of 137] Compiling Distribution.Types.SourceRepo.Lens ( src/Distribution/Types/SourceRepo/Lens.hs, dist/build/Distribution/Types/SourceRepo/Lens.o, dist/build/Distribution/Types/SourceRepo/Lens.dyn_o )
  115. 48.15 s [Cabal-syntax] [ 44 of 137] Compiling Distribution.Types.PkgconfigVersion ( src/Distribution/Types/PkgconfigVersion.hs, dist/build/Distribution/Types/PkgconfigVersion.o, dist/build/Distribution/Types/PkgconfigVersion.dyn_o )
  116. 48.15 s [Cabal-syntax] [ 45 of 137] Compiling Distribution.Types.PkgconfigVersionRange ( src/Distribution/Types/PkgconfigVersionRange.hs, dist/build/Distribution/Types/PkgconfigVersionRange.o, dist/build/Distribution/Types/PkgconfigVersionRange.dyn_o )
  117. 53.22 s [Cabal-syntax] [ 46 of 137] Compiling Distribution.Types.PkgconfigName ( src/Distribution/Types/PkgconfigName.hs, dist/build/Distribution/Types/PkgconfigName.o, dist/build/Distribution/Types/PkgconfigName.dyn_o )
  118. 53.23 s [Cabal-syntax] [ 47 of 137] Compiling Distribution.Types.PkgconfigDependency ( src/Distribution/Types/PkgconfigDependency.hs, dist/build/Distribution/Types/PkgconfigDependency.o, dist/build/Distribution/Types/PkgconfigDependency.dyn_o )
  119. 54.34 s [Cabal-syntax] [ 48 of 137] Compiling Distribution.Types.PackageName ( src/Distribution/Types/PackageName.hs, dist/build/Distribution/Types/PackageName.o, dist/build/Distribution/Types/PackageName.dyn_o )
  120. 54.34 s [Cabal-syntax] [ 49 of 137] Compiling Distribution.Types.UnqualComponentName ( src/Distribution/Types/UnqualComponentName.hs, dist/build/Distribution/Types/UnqualComponentName.o, dist/build/Distribution/Types/UnqualComponentName.dyn_o )
  121. 54.34 s [Cabal-syntax] [ 50 of 137] Compiling Distribution.Types.LibraryVisibility ( src/Distribution/Types/LibraryVisibility.hs, dist/build/Distribution/Types/LibraryVisibility.o, dist/build/Distribution/Types/LibraryVisibility.dyn_o )
  122. 54.34 s [Cabal-syntax] [ 51 of 137] Compiling Distribution.Types.LibraryName ( src/Distribution/Types/LibraryName.hs, dist/build/Distribution/Types/LibraryName.o, dist/build/Distribution/Types/LibraryName.dyn_o )
  123. 54.34 s [Cabal-syntax] [ 52 of 137] Compiling Distribution.Types.MungedPackageName ( src/Distribution/Types/MungedPackageName.hs, dist/build/Distribution/Types/MungedPackageName.o, dist/build/Distribution/Types/MungedPackageName.dyn_o )
  124. 54.34 s [Cabal-syntax] [ 53 of 137] Compiling Distribution.Types.ForeignLibType ( src/Distribution/Types/ForeignLibType.hs, dist/build/Distribution/Types/ForeignLibType.o, dist/build/Distribution/Types/ForeignLibType.dyn_o )
  125. 54.34 s [Cabal-syntax] [ 54 of 137] Compiling Distribution.Types.ForeignLibOption ( src/Distribution/Types/ForeignLibOption.hs, dist/build/Distribution/Types/ForeignLibOption.o, dist/build/Distribution/Types/ForeignLibOption.dyn_o )
  126. 54.34 s [Cabal-syntax] [ 55 of 137] Compiling Distribution.Types.Flag ( src/Distribution/Types/Flag.hs, dist/build/Distribution/Types/Flag.o, dist/build/Distribution/Types/Flag.dyn_o )
  127. 54.34 s [Cabal-syntax] [ 56 of 137] Compiling Distribution.Types.ExecutableScope ( src/Distribution/Types/ExecutableScope.hs, dist/build/Distribution/Types/ExecutableScope.o, dist/build/Distribution/Types/ExecutableScope.dyn_o )
  128. 54.34 s [Cabal-syntax] [ 57 of 137] Compiling Distribution.Types.ComponentName ( src/Distribution/Types/ComponentName.hs, dist/build/Distribution/Types/ComponentName.o, dist/build/Distribution/Types/ComponentName.dyn_o )
  129. 54.34 s [Cabal-syntax] [ 58 of 137] Compiling Distribution.Types.ComponentId ( src/Distribution/Types/ComponentId.hs, dist/build/Distribution/Types/ComponentId.o, dist/build/Distribution/Types/ComponentId.dyn_o )
  130. 54.34 s [Cabal-syntax] [ 59 of 137] Compiling Distribution.Types.BuildType ( src/Distribution/Types/BuildType.hs, dist/build/Distribution/Types/BuildType.o, dist/build/Distribution/Types/BuildType.dyn_o )
  131. 54.34 s [Cabal-syntax] [ 60 of 137] Compiling Distribution.Types.AbiHash ( src/Distribution/Types/AbiHash.hs, dist/build/Distribution/Types/AbiHash.o, dist/build/Distribution/Types/AbiHash.dyn_o )
  132. 54.34 s [Cabal-syntax] [ 61 of 137] Compiling Distribution.Text ( src/Distribution/Text.hs, dist/build/Distribution/Text.o, dist/build/Distribution/Text.dyn_o )
  133. 54.34 s [Cabal-syntax] [ 62 of 137] Compiling Distribution.System ( src/Distribution/System.hs, dist/build/Distribution/System.o, dist/build/Distribution/System.dyn_o )
  134. 54.34 s [Cabal-syntax] [ 63 of 137] Compiling Distribution.SPDX.LicenseReference ( src/Distribution/SPDX/LicenseReference.hs, dist/build/Distribution/SPDX/LicenseReference.o, dist/build/Distribution/SPDX/LicenseReference.dyn_o )
  135. 54.34 s [Cabal-syntax] [ 64 of 137] Compiling Distribution.SPDX.LicenseId ( src/Distribution/SPDX/LicenseId.hs, dist/build/Distribution/SPDX/LicenseId.o, dist/build/Distribution/SPDX/LicenseId.dyn_o )
  136. 58.94 s [Cabal-syntax] [ 65 of 137] Compiling Distribution.SPDX.LicenseExceptionId ( src/Distribution/SPDX/LicenseExceptionId.hs, dist/build/Distribution/SPDX/LicenseExceptionId.o, dist/build/Distribution/SPDX/LicenseExceptionId.dyn_o )
  137. 58.96 s [Cabal-syntax] [ 66 of 137] Compiling Distribution.SPDX.LicenseExpression ( src/Distribution/SPDX/LicenseExpression.hs, dist/build/Distribution/SPDX/LicenseExpression.o, dist/build/Distribution/SPDX/LicenseExpression.dyn_o )
  138. 61.10 s [Cabal-syntax] [ 67 of 137] Compiling Distribution.SPDX.License ( src/Distribution/SPDX/License.hs, dist/build/Distribution/SPDX/License.o, dist/build/Distribution/SPDX/License.dyn_o )
  139. 61.54 s [Cabal-syntax] [ 68 of 137] Compiling Distribution.SPDX ( src/Distribution/SPDX.hs, dist/build/Distribution/SPDX.o, dist/build/Distribution/SPDX.dyn_o )
  140. 61.57 s [Cabal-syntax] [ 69 of 137] Compiling Distribution.ModuleName ( src/Distribution/ModuleName.hs, dist/build/Distribution/ModuleName.o, dist/build/Distribution/ModuleName.dyn_o )
  141. 61.57 s [Cabal-syntax] [ 70 of 137] Compiling Distribution.Types.ModuleRenaming ( src/Distribution/Types/ModuleRenaming.hs, dist/build/Distribution/Types/ModuleRenaming.o, dist/build/Distribution/Types/ModuleRenaming.dyn_o )
  142. 61.57 s [Cabal-syntax] [ 71 of 137] Compiling Distribution.Types.IncludeRenaming ( src/Distribution/Types/IncludeRenaming.hs, dist/build/Distribution/Types/IncludeRenaming.o, dist/build/Distribution/Types/IncludeRenaming.dyn_o )
  143. 61.57 s [Cabal-syntax] [ 72 of 137] Compiling Distribution.Types.Mixin ( src/Distribution/Types/Mixin.hs, dist/build/Distribution/Types/Mixin.o, dist/build/Distribution/Types/Mixin.dyn_o )
  144. 61.57 s [Cabal-syntax] [ 73 of 137] Compiling Distribution.Types.ModuleReexport ( src/Distribution/Types/ModuleReexport.hs, dist/build/Distribution/Types/ModuleReexport.o, dist/build/Distribution/Types/ModuleReexport.dyn_o )
  145. 61.57 s [Cabal-syntax] [ 74 of 137] Compiling Distribution.Compat.Graph ( src/Distribution/Compat/Graph.hs, dist/build/Distribution/Compat/Graph.o, dist/build/Distribution/Compat/Graph.dyn_o )
  146. 61.57 s [Cabal-syntax] [ 75 of 137] Compiling Distribution.Version ( src/Distribution/Version.hs, dist/build/Distribution/Version.o, dist/build/Distribution/Version.dyn_o )
  147. 61.58 s [Cabal-syntax] [ 76 of 137] Compiling Distribution.Types.TestType ( src/Distribution/Types/TestType.hs, dist/build/Distribution/Types/TestType.o, dist/build/Distribution/Types/TestType.dyn_o )
  148. 61.58 s [Cabal-syntax] [ 77 of 137] Compiling Distribution.Types.TestSuiteInterface ( src/Distribution/Types/TestSuiteInterface.hs, dist/build/Distribution/Types/TestSuiteInterface.o, dist/build/Distribution/Types/TestSuiteInterface.dyn_o )
  149. 61.58 s [Cabal-syntax] [ 78 of 137] Compiling Distribution.Types.PackageId ( src/Distribution/Types/PackageId.hs, dist/build/Distribution/Types/PackageId.o, dist/build/Distribution/Types/PackageId.dyn_o )
  150. 61.58 s [Cabal-syntax] [ 79 of 137] Compiling Distribution.Types.UnitId ( src/Distribution/Types/UnitId.hs, dist/build/Distribution/Types/UnitId.o, dist/build/Distribution/Types/UnitId.dyn_o )
  151. 61.58 s [Cabal-syntax] [ 80 of 137] Compiling Distribution.Types.Module ( src/Distribution/Types/Module.hs, dist/build/Distribution/Types/Module.o, dist/build/Distribution/Types/Module.dyn_o )
  152. 61.58 s [Cabal-syntax] [ 81 of 137] Compiling Distribution.Backpack ( src/Distribution/Backpack.hs, dist/build/Distribution/Backpack.o, dist/build/Distribution/Backpack.dyn_o )
  153. 61.58 s [Cabal-syntax] [ 82 of 137] Compiling Distribution.Types.ExposedModule ( src/Distribution/Types/ExposedModule.hs, dist/build/Distribution/Types/ExposedModule.o, dist/build/Distribution/Types/ExposedModule.dyn_o )
  154. 61.58 s [Cabal-syntax] [ 83 of 137] Compiling Distribution.Types.PackageVersionConstraint ( src/Distribution/Types/PackageVersionConstraint.hs, dist/build/Distribution/Types/PackageVersionConstraint.o, dist/build/Distribution/Types/PackageVersionConstraint.dyn_o )
  155. 61.58 s [Cabal-syntax] [ 84 of 137] Compiling Distribution.Types.PackageId.Lens ( src/Distribution/Types/PackageId/Lens.hs, dist/build/Distribution/Types/PackageId/Lens.o, dist/build/Distribution/Types/PackageId/Lens.dyn_o )
  156. 61.58 s [Cabal-syntax] [ 85 of 137] Compiling Distribution.Types.MungedPackageId ( src/Distribution/Types/MungedPackageId.hs, dist/build/Distribution/Types/MungedPackageId.o, dist/build/Distribution/Types/MungedPackageId.dyn_o )
  157. 61.58 s [Cabal-syntax] [ 86 of 137] Compiling Distribution.Types.LegacyExeDependency ( src/Distribution/Types/LegacyExeDependency.hs, dist/build/Distribution/Types/LegacyExeDependency.o, dist/build/Distribution/Types/LegacyExeDependency.dyn_o )
  158. 61.58 s [Cabal-syntax] [ 87 of 137] Compiling Distribution.Types.ExeDependency ( src/Distribution/Types/ExeDependency.hs, dist/build/Distribution/Types/ExeDependency.o, dist/build/Distribution/Types/ExeDependency.dyn_o )
  159. 61.58 s [Cabal-syntax] [ 88 of 137] Compiling Distribution.Types.Dependency ( src/Distribution/Types/Dependency.hs, dist/build/Distribution/Types/Dependency.o, dist/build/Distribution/Types/Dependency.dyn_o )
  160. 61.58 s [Cabal-syntax] [ 89 of 137] Compiling Distribution.Types.SetupBuildInfo ( src/Distribution/Types/SetupBuildInfo.hs, dist/build/Distribution/Types/SetupBuildInfo.o, dist/build/Distribution/Types/SetupBuildInfo.dyn_o )
  161. 61.58 s [Cabal-syntax] [ 90 of 137] Compiling Distribution.Types.SetupBuildInfo.Lens ( src/Distribution/Types/SetupBuildInfo/Lens.hs, dist/build/Distribution/Types/SetupBuildInfo/Lens.o, dist/build/Distribution/Types/SetupBuildInfo/Lens.dyn_o )
  162. 61.58 s [Cabal-syntax] [ 91 of 137] Compiling Distribution.Types.DependencyMap ( src/Distribution/Types/DependencyMap.hs, dist/build/Distribution/Types/DependencyMap.o, dist/build/Distribution/Types/DependencyMap.dyn_o )
  163. 61.58 s [Cabal-syntax] [ 92 of 137] Compiling Distribution.Types.BenchmarkType ( src/Distribution/Types/BenchmarkType.hs, dist/build/Distribution/Types/BenchmarkType.o, dist/build/Distribution/Types/BenchmarkType.dyn_o )
  164. 61.58 s [Cabal-syntax] [ 93 of 137] Compiling Distribution.Types.BenchmarkInterface ( src/Distribution/Types/BenchmarkInterface.hs, dist/build/Distribution/Types/BenchmarkInterface.o, dist/build/Distribution/Types/BenchmarkInterface.dyn_o )
  165. 61.58 s [Cabal-syntax] [ 94 of 137] Compiling Distribution.Package ( src/Distribution/Package.hs, dist/build/Distribution/Package.o, dist/build/Distribution/Package.dyn_o )
  166. 61.58 s [Cabal-syntax] [ 95 of 137] Compiling Distribution.Types.AbiDependency ( src/Distribution/Types/AbiDependency.hs, dist/build/Distribution/Types/AbiDependency.o, dist/build/Distribution/Types/AbiDependency.dyn_o )
  167. 61.58 s [Cabal-syntax] [ 96 of 137] Compiling Distribution.License ( src/Distribution/License.hs, dist/build/Distribution/License.o, dist/build/Distribution/License.dyn_o )
  168. 63.65 s [Cabal-syntax] [ 97 of 137] Compiling Distribution.Types.InstalledPackageInfo ( src/Distribution/Types/InstalledPackageInfo.hs, dist/build/Distribution/Types/InstalledPackageInfo.o, dist/build/Distribution/Types/InstalledPackageInfo.dyn_o )
  169. 66.68 s [Cabal-syntax] [ 98 of 137] Compiling Distribution.Types.InstalledPackageInfo.Lens ( src/Distribution/Types/InstalledPackageInfo/Lens.hs, dist/build/Distribution/Types/InstalledPackageInfo/Lens.o, dist/build/Distribution/Types/InstalledPackageInfo/Lens.dyn_o )
  170. 67.65 s [Cabal-syntax] [ 99 of 137] Compiling Distribution.Fields.ParseResult ( src/Distribution/Fields/ParseResult.hs, dist/build/Distribution/Fields/ParseResult.o, dist/build/Distribution/Fields/ParseResult.dyn_o )
  171. 67.65 s [Cabal-syntax] [100 of 137] Compiling Distribution.Fields ( src/Distribution/Fields.hs, dist/build/Distribution/Fields.o, dist/build/Distribution/Fields.dyn_o )
  172. 67.65 s [Cabal-syntax] [101 of 137] Compiling Language.Haskell.Extension ( src/Language/Haskell/Extension.hs, dist/build/Language/Haskell/Extension.o, dist/build/Language/Haskell/Extension.dyn_o )
  173. 67.65 s [Cabal-syntax] [102 of 137] Compiling Distribution.Compiler ( src/Distribution/Compiler.hs, dist/build/Distribution/Compiler.o, dist/build/Distribution/Compiler.dyn_o )
  174. 67.65 s [Cabal-syntax] [103 of 137] Compiling Distribution.Types.ConfVar ( src/Distribution/Types/ConfVar.hs, dist/build/Distribution/Types/ConfVar.o, dist/build/Distribution/Types/ConfVar.dyn_o )
  175. 67.65 s [Cabal-syntax] [104 of 137] Compiling Distribution.Fields.ConfVar ( src/Distribution/Fields/ConfVar.hs, dist/build/Distribution/Fields/ConfVar.o, dist/build/Distribution/Fields/ConfVar.dyn_o )
  176. 67.65 s [Cabal-syntax] [105 of 137] Compiling Distribution.Types.BuildInfo ( src/Distribution/Types/BuildInfo.hs, dist/build/Distribution/Types/BuildInfo.o, dist/build/Distribution/Types/BuildInfo.dyn_o )
  177. 67.65 s [Cabal-syntax] [106 of 137] Compiling Distribution.Types.HookedBuildInfo ( src/Distribution/Types/HookedBuildInfo.hs, dist/build/Distribution/Types/HookedBuildInfo.o, dist/build/Distribution/Types/HookedBuildInfo.dyn_o )
  178. 67.65 s [Cabal-syntax] [107 of 137] Compiling Distribution.Types.BuildInfo.Lens ( src/Distribution/Types/BuildInfo/Lens.hs, dist/build/Distribution/Types/BuildInfo/Lens.o, dist/build/Distribution/Types/BuildInfo/Lens.dyn_o )
  179. 67.65 s [Cabal-syntax] [108 of 137] Compiling Distribution.Types.TestSuite ( src/Distribution/Types/TestSuite.hs, dist/build/Distribution/Types/TestSuite.o, dist/build/Distribution/Types/TestSuite.dyn_o )
  180. 70.84 s [Cabal-syntax] [109 of 137] Compiling Distribution.Types.TestSuite.Lens ( src/Distribution/Types/TestSuite/Lens.hs, dist/build/Distribution/Types/TestSuite/Lens.o, dist/build/Distribution/Types/TestSuite/Lens.dyn_o )
  181. 70.91 s [Cabal-syntax] [110 of 137] Compiling Distribution.Types.Library ( src/Distribution/Types/Library.hs, dist/build/Distribution/Types/Library.o, dist/build/Distribution/Types/Library.dyn_o )
  182. 71.04 s [Cabal-syntax] [111 of 137] Compiling Distribution.Types.Library.Lens ( src/Distribution/Types/Library/Lens.hs, dist/build/Distribution/Types/Library/Lens.o, dist/build/Distribution/Types/Library/Lens.dyn_o )
  183. 71.12 s [Cabal-syntax] [112 of 137] Compiling Distribution.Types.ForeignLib ( src/Distribution/Types/ForeignLib.hs, dist/build/Distribution/Types/ForeignLib.o, dist/build/Distribution/Types/ForeignLib.dyn_o )
  184. 71.97 s [Cabal-syntax] [113 of 137] Compiling Distribution.Types.ForeignLib.Lens ( src/Distribution/Types/ForeignLib/Lens.hs, dist/build/Distribution/Types/ForeignLib/Lens.o, dist/build/Distribution/Types/ForeignLib/Lens.dyn_o )
  185. 72.11 s [Cabal-syntax] [114 of 137] Compiling Distribution.Types.Executable ( src/Distribution/Types/Executable.hs, dist/build/Distribution/Types/Executable.o, dist/build/Distribution/Types/Executable.dyn_o )
  186. 72.11 s [Cabal-syntax] [115 of 137] Compiling Distribution.Types.Executable.Lens ( src/Distribution/Types/Executable/Lens.hs, dist/build/Distribution/Types/Executable/Lens.o, dist/build/Distribution/Types/Executable/Lens.dyn_o )
  187. 72.11 s [Cabal-syntax] [116 of 137] Compiling Distribution.Types.Benchmark ( src/Distribution/Types/Benchmark.hs, dist/build/Distribution/Types/Benchmark.o, dist/build/Distribution/Types/Benchmark.dyn_o )
  188. 72.11 s [Cabal-syntax] [117 of 137] Compiling Distribution.Types.Component ( src/Distribution/Types/Component.hs, dist/build/Distribution/Types/Component.o, dist/build/Distribution/Types/Component.dyn_o )
  189. 74.19 s [Cabal-syntax] [118 of 137] Compiling Distribution.Types.ComponentRequestedSpec ( src/Distribution/Types/ComponentRequestedSpec.hs, dist/build/Distribution/Types/ComponentRequestedSpec.o, dist/build/Distribution/Types/ComponentRequestedSpec.dyn_o )
  190. 74.65 s [Cabal-syntax] [119 of 137] Compiling Distribution.Types.PackageDescription ( src/Distribution/Types/PackageDescription.hs, dist/build/Distribution/Types/PackageDescription.o, dist/build/Distribution/Types/PackageDescription.dyn_o )
  191. 78.67 s [Cabal-syntax] [120 of 137] Compiling Distribution.Types.GenericPackageDescription ( src/Distribution/Types/GenericPackageDescription.hs, dist/build/Distribution/Types/GenericPackageDescription.o, dist/build/Distribution/Types/GenericPackageDescription.dyn_o )
  192. 80.58 s [Cabal-syntax] [121 of 137] Compiling Distribution.Types.GenericPackageDescription.Lens ( src/Distribution/Types/GenericPackageDescription/Lens.hs, dist/build/Distribution/Types/GenericPackageDescription/Lens.o, dist/build/Distribution/Types/GenericPackageDescription/Lens.dyn_o )
  193. 80.87 s [Cabal-syntax] [122 of 137] Compiling Distribution.Types.Benchmark.Lens ( src/Distribution/Types/Benchmark/Lens.hs, dist/build/Distribution/Types/Benchmark/Lens.o, dist/build/Distribution/Types/Benchmark/Lens.dyn_o )
  194. 80.87 s [Cabal-syntax] [123 of 137] Compiling Distribution.Types.PackageDescription.Lens ( src/Distribution/Types/PackageDescription/Lens.hs, dist/build/Distribution/Types/PackageDescription/Lens.o, dist/build/Distribution/Types/PackageDescription/Lens.dyn_o )
  195. 80.87 s [Cabal-syntax] [124 of 137] Compiling Distribution.Types.Lens ( src/Distribution/Types/Lens.hs, dist/build/Distribution/Types/Lens.o, dist/build/Distribution/Types/Lens.dyn_o )
  196. 80.92 s [Cabal-syntax] [125 of 137] Compiling Distribution.PackageDescription ( src/Distribution/PackageDescription.hs, dist/build/Distribution/PackageDescription.o, dist/build/Distribution/PackageDescription.dyn_o )
  197. 80.92 s [Cabal-syntax] [126 of 137] Compiling Distribution.PackageDescription.Configuration ( src/Distribution/PackageDescription/Configuration.hs, dist/build/Distribution/PackageDescription/Configuration.o, dist/build/Distribution/PackageDescription/Configuration.dyn_o )
  198. 82.58 s [Cabal-syntax] [127 of 137] Compiling Distribution.FieldGrammar.Newtypes ( src/Distribution/FieldGrammar/Newtypes.hs, dist/build/Distribution/FieldGrammar/Newtypes.o, dist/build/Distribution/FieldGrammar/Newtypes.dyn_o )
  199. 82.58 s [Cabal-syntax] [128 of 137] Compiling Distribution.FieldGrammar.Class ( src/Distribution/FieldGrammar/Class.hs, dist/build/Distribution/FieldGrammar/Class.o, dist/build/Distribution/FieldGrammar/Class.dyn_o )
  200. 82.58 s [Cabal-syntax] [129 of 137] Compiling Distribution.FieldGrammar.Pretty ( src/Distribution/FieldGrammar/Pretty.hs, dist/build/Distribution/FieldGrammar/Pretty.o, dist/build/Distribution/FieldGrammar/Pretty.dyn_o )
  201. 82.58 s [Cabal-syntax] [130 of 137] Compiling Distribution.FieldGrammar.Parsec ( src/Distribution/FieldGrammar/Parsec.hs, dist/build/Distribution/FieldGrammar/Parsec.o, dist/build/Distribution/FieldGrammar/Parsec.dyn_o )
  202. 82.58 s [Cabal-syntax] [131 of 137] Compiling Distribution.FieldGrammar ( src/Distribution/FieldGrammar.hs, dist/build/Distribution/FieldGrammar.o, dist/build/Distribution/FieldGrammar.dyn_o )
  203. 82.58 s [Cabal-syntax] [132 of 137] Compiling Distribution.PackageDescription.FieldGrammar ( src/Distribution/PackageDescription/FieldGrammar.hs, dist/build/Distribution/PackageDescription/FieldGrammar.o, dist/build/Distribution/PackageDescription/FieldGrammar.dyn_o )
  204. 89.15 s [Cabal-syntax] [133 of 137] Compiling Distribution.PackageDescription.PrettyPrint ( src/Distribution/PackageDescription/PrettyPrint.hs, dist/build/Distribution/PackageDescription/PrettyPrint.o, dist/build/Distribution/PackageDescription/PrettyPrint.dyn_o )
  205. 89.86 s [Cabal-syntax] [134 of 137] Compiling Distribution.PackageDescription.Parsec ( src/Distribution/PackageDescription/Parsec.hs, dist/build/Distribution/PackageDescription/Parsec.o, dist/build/Distribution/PackageDescription/Parsec.dyn_o )
  206. 93.25 s [Cabal-syntax] [135 of 137] Compiling Distribution.FieldGrammar.FieldDescrs ( src/Distribution/FieldGrammar/FieldDescrs.hs, dist/build/Distribution/FieldGrammar/FieldDescrs.o, dist/build/Distribution/FieldGrammar/FieldDescrs.dyn_o )
  207. 93.25 s [Cabal-syntax] [136 of 137] Compiling Distribution.Types.InstalledPackageInfo.FieldGrammar ( src/Distribution/Types/InstalledPackageInfo/FieldGrammar.hs, dist/build/Distribution/Types/InstalledPackageInfo/FieldGrammar.o, dist/build/Distribution/Types/InstalledPackageInfo/FieldGrammar.dyn_o )
  208. 93.25 s [Cabal-syntax] [137 of 137] Compiling Distribution.InstalledPackageInfo ( src/Distribution/InstalledPackageInfo.hs, dist/build/Distribution/InstalledPackageInfo.o, dist/build/Distribution/InstalledPackageInfo.dyn_o )
  209. 94.22 s [Cabal-syntax] [ 1 of 137] Compiling Distribution.Compat.Binary ( src/Distribution/Compat/Binary.hs, dist/build/Distribution/Compat/Binary.p_o )
  210. 94.67 s [Cabal-syntax] [ 2 of 137] Compiling Distribution.Compat.Exception ( src/Distribution/Compat/Exception.hs, dist/build/Distribution/Compat/Exception.p_o )
  211. 94.67 s [Cabal-syntax] [ 3 of 137] Compiling Distribution.Compat.MonadFail ( src/Distribution/Compat/MonadFail.hs, dist/build/Distribution/Compat/MonadFail.p_o )
  212. 94.67 s [Cabal-syntax] [ 4 of 137] Compiling Distribution.Compat.Newtype ( src/Distribution/Compat/Newtype.hs, dist/build/Distribution/Compat/Newtype.p_o )
  213. 94.67 s [Cabal-syntax] [ 5 of 137] Compiling Distribution.Compat.Typeable ( src/Distribution/Compat/Typeable.hs, dist/build/Distribution/Compat/Typeable.p_o )
  214. 94.67 s [Cabal-syntax] [ 6 of 137] Compiling Distribution.PackageDescription.Utils ( src/Distribution/PackageDescription/Utils.hs, dist/build/Distribution/PackageDescription/Utils.p_o )
  215. 94.67 s [Cabal-syntax] [ 7 of 137] Compiling Distribution.Utils.Base62 ( src/Distribution/Utils/Base62.hs, dist/build/Distribution/Utils/Base62.p_o )
  216. 94.69 s [Cabal-syntax] [ 8 of 137] Compiling Distribution.Utils.MD5 ( src/Distribution/Utils/MD5.hs, dist/build/Distribution/Utils/MD5.p_o )
  217. 94.81 s [Cabal-syntax] [ 9 of 137] Compiling Distribution.Utils.String ( src/Distribution/Utils/String.hs, dist/build/Distribution/Utils/String.p_o )
  218. 94.81 s [Cabal-syntax] [ 10 of 137] Compiling Distribution.Utils.Structured ( src/Distribution/Utils/Structured.hs, dist/build/Distribution/Utils/Structured.p_o )
  219. 96.69 s [Cabal-syntax] [ 11 of 137] Compiling Distribution.Compat.Semigroup ( src/Distribution/Compat/Semigroup.hs, dist/build/Distribution/Compat/Semigroup.p_o )
  220. 97.15 s [Cabal-syntax] [ 12 of 137] Compiling Distribution.Compat.NonEmptySet ( src/Distribution/Compat/NonEmptySet.hs, dist/build/Distribution/Compat/NonEmptySet.p_o )
  221. 97.16 s [Cabal-syntax] [ 13 of 137] Compiling Distribution.Compat.Prelude ( src/Distribution/Compat/Prelude.hs, dist/build/Distribution/Compat/Prelude.p_o )
  222. 97.34 s [Cabal-syntax] [ 14 of 137] Compiling Distribution.Utils.ShortText ( src/Distribution/Utils/ShortText.hs, dist/build/Distribution/Utils/ShortText.p_o )
  223. 97.74 s [Cabal-syntax] [ 15 of 137] Compiling Distribution.Utils.Generic ( src/Distribution/Utils/Generic.hs, dist/build/Distribution/Utils/Generic.p_o )
  224. 97.99 s [Cabal-syntax] [ 16 of 137] Compiling Distribution.Types.Condition ( src/Distribution/Types/Condition.hs, dist/build/Distribution/Types/Condition.p_o )
  225. 98.33 s [Cabal-syntax] [ 17 of 137] Compiling Distribution.Parsec.Position ( src/Distribution/Parsec/Position.hs, dist/build/Distribution/Parsec/Position.p_o )
  226. 98.33 s [Cabal-syntax] [ 18 of 137] Compiling Distribution.Parsec.Warning ( src/Distribution/Parsec/Warning.hs, dist/build/Distribution/Parsec/Warning.p_o )
  227. 98.80 s [Cabal-syntax] [ 19 of 137] Compiling Distribution.Parsec.FieldLineStream ( src/Distribution/Parsec/FieldLineStream.hs, dist/build/Distribution/Parsec/FieldLineStream.p_o )
  228. 98.80 s [Cabal-syntax] [ 20 of 137] Compiling Distribution.Parsec.Error ( src/Distribution/Parsec/Error.hs, dist/build/Distribution/Parsec/Error.p_o )
  229. 98.81 s [Cabal-syntax] [ 21 of 137] Compiling Distribution.PackageDescription.Quirks ( src/Distribution/PackageDescription/Quirks.hs, dist/build/Distribution/PackageDescription/Quirks.p_o )
  230. 98.81 s [Cabal-syntax] [ 22 of 137] Compiling Distribution.Fields.LexerMonad ( src/Distribution/Fields/LexerMonad.hs, dist/build/Distribution/Fields/LexerMonad.p_o )
  231. 99.22 s [Cabal-syntax] [ 23 of 137] Compiling Distribution.Fields.Lexer ( dist/build/Distribution/Fields/Lexer.hs, dist/build/Distribution/Fields/Lexer.p_o )
  232. 99.82 s [Cabal-syntax] [ 24 of 137] Compiling Distribution.Compat.Parsing ( src/Distribution/Compat/Parsing.hs, dist/build/Distribution/Compat/Parsing.p_o )
  233. 99.84 s [Cabal-syntax] [ 25 of 137] Compiling Distribution.Compat.DList ( src/Distribution/Compat/DList.hs, dist/build/Distribution/Compat/DList.p_o )
  234. 99.84 s [Cabal-syntax] [ 26 of 137] Compiling Distribution.Compat.Lens ( src/Distribution/Compat/Lens.hs, dist/build/Distribution/Compat/Lens.p_o )
  235. 99.84 s [Cabal-syntax] [ 27 of 137] Compiling Distribution.Types.CondTree ( src/Distribution/Types/CondTree.hs, dist/build/Distribution/Types/CondTree.p_o )
  236. 99.84 s [Cabal-syntax] [ 28 of 137] Compiling Distribution.Compat.CharParsing ( src/Distribution/Compat/CharParsing.hs, dist/build/Distribution/Compat/CharParsing.p_o )
  237. 99.84 s [Cabal-syntax] [ 29 of 137] Compiling Distribution.CabalSpecVersion ( src/Distribution/CabalSpecVersion.hs, dist/build/Distribution/CabalSpecVersion.p_o )
  238. 99.84 s [Cabal-syntax] [ 30 of 137] Compiling Distribution.SPDX.LicenseListVersion ( src/Distribution/SPDX/LicenseListVersion.hs, dist/build/Distribution/SPDX/LicenseListVersion.p_o )
  239. 99.84 s [Cabal-syntax] [ 31 of 137] Compiling Distribution.Pretty ( src/Distribution/Pretty.hs, dist/build/Distribution/Pretty.p_o )
  240. 99.84 s [Cabal-syntax] [ 32 of 137] Compiling Distribution.Fields.Field ( src/Distribution/Fields/Field.hs, dist/build/Distribution/Fields/Field.p_o )
  241. 99.87 s [Cabal-syntax] [ 33 of 137] Compiling Distribution.Fields.Parser ( src/Distribution/Fields/Parser.hs, dist/build/Distribution/Fields/Parser.p_o )
  242. 100.64 s [Cabal-syntax] [ 34 of 137] Compiling Distribution.Fields.Pretty ( src/Distribution/Fields/Pretty.hs, dist/build/Distribution/Fields/Pretty.p_o )
  243. 101.22 s [Cabal-syntax] [ 35 of 137] Compiling Distribution.Parsec ( src/Distribution/Parsec.hs, dist/build/Distribution/Parsec.p_o )
  244. 101.22 s [Cabal-syntax] [ 36 of 137] Compiling Distribution.Utils.Path ( src/Distribution/Utils/Path.hs, dist/build/Distribution/Utils/Path.p_o )
  245. 101.77 s [Cabal-syntax] [ 37 of 137] Compiling Distribution.Types.Version ( src/Distribution/Types/Version.hs, dist/build/Distribution/Types/Version.p_o )
  246. 103.44 s [Cabal-syntax] [ 38 of 137] Compiling Distribution.Types.VersionRange.Internal ( src/Distribution/Types/VersionRange/Internal.hs, dist/build/Distribution/Types/VersionRange/Internal.p_o )
  247. 106.73 s [Cabal-syntax] [ 39 of 137] Compiling Distribution.Types.VersionInterval.Legacy ( src/Distribution/Types/VersionInterval/Legacy.hs, dist/build/Distribution/Types/VersionInterval/Legacy.p_o )
  248. 107.47 s [Cabal-syntax] [ 40 of 137] Compiling Distribution.Types.VersionInterval ( src/Distribution/Types/VersionInterval.hs, dist/build/Distribution/Types/VersionInterval.p_o )
  249. 107.47 s [Cabal-syntax] [ 41 of 137] Compiling Distribution.Types.VersionRange ( src/Distribution/Types/VersionRange.hs, dist/build/Distribution/Types/VersionRange.p_o )
  250. 107.69 s [Cabal-syntax] [ 42 of 137] Compiling Distribution.Types.SourceRepo ( src/Distribution/Types/SourceRepo.hs, dist/build/Distribution/Types/SourceRepo.p_o )
  251. 107.69 s [Cabal-syntax] [ 43 of 137] Compiling Distribution.Types.SourceRepo.Lens ( src/Distribution/Types/SourceRepo/Lens.hs, dist/build/Distribution/Types/SourceRepo/Lens.p_o )
  252. 107.69 s [Cabal-syntax] [ 44 of 137] Compiling Distribution.Types.PkgconfigVersion ( src/Distribution/Types/PkgconfigVersion.hs, dist/build/Distribution/Types/PkgconfigVersion.p_o )
  253. 107.69 s [Cabal-syntax] [ 45 of 137] Compiling Distribution.Types.PkgconfigVersionRange ( src/Distribution/Types/PkgconfigVersionRange.hs, dist/build/Distribution/Types/PkgconfigVersionRange.p_o )
  254. 109.35 s [Cabal-syntax] [ 46 of 137] Compiling Distribution.Types.PkgconfigName ( src/Distribution/Types/PkgconfigName.hs, dist/build/Distribution/Types/PkgconfigName.p_o )
  255. 109.35 s [Cabal-syntax] [ 47 of 137] Compiling Distribution.Types.PkgconfigDependency ( src/Distribution/Types/PkgconfigDependency.hs, dist/build/Distribution/Types/PkgconfigDependency.p_o )
  256. 110.25 s [Cabal-syntax] [ 48 of 137] Compiling Distribution.Types.PackageName ( src/Distribution/Types/PackageName.hs, dist/build/Distribution/Types/PackageName.p_o )
  257. 110.25 s [Cabal-syntax] [ 49 of 137] Compiling Distribution.Types.UnqualComponentName ( src/Distribution/Types/UnqualComponentName.hs, dist/build/Distribution/Types/UnqualComponentName.p_o )
  258. 110.25 s [Cabal-syntax] [ 50 of 137] Compiling Distribution.Types.LibraryVisibility ( src/Distribution/Types/LibraryVisibility.hs, dist/build/Distribution/Types/LibraryVisibility.p_o )
  259. 110.25 s [Cabal-syntax] [ 51 of 137] Compiling Distribution.Types.LibraryName ( src/Distribution/Types/LibraryName.hs, dist/build/Distribution/Types/LibraryName.p_o )
  260. 110.25 s [Cabal-syntax] [ 52 of 137] Compiling Distribution.Types.MungedPackageName ( src/Distribution/Types/MungedPackageName.hs, dist/build/Distribution/Types/MungedPackageName.p_o )
  261. 110.25 s [Cabal-syntax] [ 53 of 137] Compiling Distribution.Types.ForeignLibType ( src/Distribution/Types/ForeignLibType.hs, dist/build/Distribution/Types/ForeignLibType.p_o )
  262. 110.25 s [Cabal-syntax] [ 54 of 137] Compiling Distribution.Types.ForeignLibOption ( src/Distribution/Types/ForeignLibOption.hs, dist/build/Distribution/Types/ForeignLibOption.p_o )
  263. 110.25 s [Cabal-syntax] [ 55 of 137] Compiling Distribution.Types.Flag ( src/Distribution/Types/Flag.hs, dist/build/Distribution/Types/Flag.p_o )
  264. 110.25 s [Cabal-syntax] [ 56 of 137] Compiling Distribution.Types.ExecutableScope ( src/Distribution/Types/ExecutableScope.hs, dist/build/Distribution/Types/ExecutableScope.p_o )
  265. 110.25 s [Cabal-syntax] [ 57 of 137] Compiling Distribution.Types.ComponentName ( src/Distribution/Types/ComponentName.hs, dist/build/Distribution/Types/ComponentName.p_o )
  266. 110.25 s [Cabal-syntax] [ 58 of 137] Compiling Distribution.Types.ComponentId ( src/Distribution/Types/ComponentId.hs, dist/build/Distribution/Types/ComponentId.p_o )
  267. 110.25 s [Cabal-syntax] [ 59 of 137] Compiling Distribution.Types.BuildType ( src/Distribution/Types/BuildType.hs, dist/build/Distribution/Types/BuildType.p_o )
  268. 110.25 s [Cabal-syntax] [ 60 of 137] Compiling Distribution.Types.AbiHash ( src/Distribution/Types/AbiHash.hs, dist/build/Distribution/Types/AbiHash.p_o )
  269. 110.25 s [Cabal-syntax] [ 61 of 137] Compiling Distribution.Text ( src/Distribution/Text.hs, dist/build/Distribution/Text.p_o )
  270. 110.25 s [Cabal-syntax] [ 62 of 137] Compiling Distribution.System ( src/Distribution/System.hs, dist/build/Distribution/System.p_o )
  271. 110.25 s [Cabal-syntax] [ 63 of 137] Compiling Distribution.SPDX.LicenseReference ( src/Distribution/SPDX/LicenseReference.hs, dist/build/Distribution/SPDX/LicenseReference.p_o )
  272. 110.25 s [Cabal-syntax] [ 64 of 137] Compiling Distribution.SPDX.LicenseId ( src/Distribution/SPDX/LicenseId.hs, dist/build/Distribution/SPDX/LicenseId.p_o )
  273. 112.57 s [Cabal-syntax] [ 65 of 137] Compiling Distribution.SPDX.LicenseExceptionId ( src/Distribution/SPDX/LicenseExceptionId.hs, dist/build/Distribution/SPDX/LicenseExceptionId.p_o )
  274. 112.59 s [Cabal-syntax] [ 66 of 137] Compiling Distribution.SPDX.LicenseExpression ( src/Distribution/SPDX/LicenseExpression.hs, dist/build/Distribution/SPDX/LicenseExpression.p_o )
  275. 113.96 s [Cabal-syntax] [ 67 of 137] Compiling Distribution.SPDX.License ( src/Distribution/SPDX/License.hs, dist/build/Distribution/SPDX/License.p_o )
  276. 114.33 s [Cabal-syntax] [ 68 of 137] Compiling Distribution.SPDX ( src/Distribution/SPDX.hs, dist/build/Distribution/SPDX.p_o )
  277. 114.46 s [Cabal-syntax] [ 69 of 137] Compiling Distribution.ModuleName ( src/Distribution/ModuleName.hs, dist/build/Distribution/ModuleName.p_o )
  278. 114.46 s [Cabal-syntax] [ 70 of 137] Compiling Distribution.Types.ModuleRenaming ( src/Distribution/Types/ModuleRenaming.hs, dist/build/Distribution/Types/ModuleRenaming.p_o )
  279. 114.46 s [Cabal-syntax] [ 71 of 137] Compiling Distribution.Types.IncludeRenaming ( src/Distribution/Types/IncludeRenaming.hs, dist/build/Distribution/Types/IncludeRenaming.p_o )
  280. 114.46 s [Cabal-syntax] [ 72 of 137] Compiling Distribution.Types.Mixin ( src/Distribution/Types/Mixin.hs, dist/build/Distribution/Types/Mixin.p_o )
  281. 114.46 s [Cabal-syntax] [ 73 of 137] Compiling Distribution.Types.ModuleReexport ( src/Distribution/Types/ModuleReexport.hs, dist/build/Distribution/Types/ModuleReexport.p_o )
  282. 114.46 s [Cabal-syntax] [ 74 of 137] Compiling Distribution.Compat.Graph ( src/Distribution/Compat/Graph.hs, dist/build/Distribution/Compat/Graph.p_o )
  283. 114.46 s [Cabal-syntax] [ 75 of 137] Compiling Distribution.Version ( src/Distribution/Version.hs, dist/build/Distribution/Version.p_o )
  284. 114.46 s [Cabal-syntax] [ 76 of 137] Compiling Distribution.Types.TestType ( src/Distribution/Types/TestType.hs, dist/build/Distribution/Types/TestType.p_o )
  285. 114.46 s [Cabal-syntax] [ 77 of 137] Compiling Distribution.Types.TestSuiteInterface ( src/Distribution/Types/TestSuiteInterface.hs, dist/build/Distribution/Types/TestSuiteInterface.p_o )
  286. 114.46 s [Cabal-syntax] [ 78 of 137] Compiling Distribution.Types.PackageId ( src/Distribution/Types/PackageId.hs, dist/build/Distribution/Types/PackageId.p_o )
  287. 114.46 s [Cabal-syntax] [ 79 of 137] Compiling Distribution.Types.UnitId ( src/Distribution/Types/UnitId.hs, dist/build/Distribution/Types/UnitId.p_o )
  288. 114.46 s [Cabal-syntax] [ 80 of 137] Compiling Distribution.Types.Module ( src/Distribution/Types/Module.hs, dist/build/Distribution/Types/Module.p_o )
  289. 114.47 s [Cabal-syntax] [ 81 of 137] Compiling Distribution.Backpack ( src/Distribution/Backpack.hs, dist/build/Distribution/Backpack.p_o )
  290. 114.47 s [Cabal-syntax] [ 82 of 137] Compiling Distribution.Types.ExposedModule ( src/Distribution/Types/ExposedModule.hs, dist/build/Distribution/Types/ExposedModule.p_o )
  291. 114.47 s [Cabal-syntax] [ 83 of 137] Compiling Distribution.Types.PackageVersionConstraint ( src/Distribution/Types/PackageVersionConstraint.hs, dist/build/Distribution/Types/PackageVersionConstraint.p_o )
  292. 114.47 s [Cabal-syntax] [ 84 of 137] Compiling Distribution.Types.PackageId.Lens ( src/Distribution/Types/PackageId/Lens.hs, dist/build/Distribution/Types/PackageId/Lens.p_o )
  293. 114.47 s [Cabal-syntax] [ 85 of 137] Compiling Distribution.Types.MungedPackageId ( src/Distribution/Types/MungedPackageId.hs, dist/build/Distribution/Types/MungedPackageId.p_o )
  294. 114.47 s [Cabal-syntax] [ 86 of 137] Compiling Distribution.Types.LegacyExeDependency ( src/Distribution/Types/LegacyExeDependency.hs, dist/build/Distribution/Types/LegacyExeDependency.p_o )
  295. 114.47 s [Cabal-syntax] [ 87 of 137] Compiling Distribution.Types.ExeDependency ( src/Distribution/Types/ExeDependency.hs, dist/build/Distribution/Types/ExeDependency.p_o )
  296. 114.47 s [Cabal-syntax] [ 88 of 137] Compiling Distribution.Types.Dependency ( src/Distribution/Types/Dependency.hs, dist/build/Distribution/Types/Dependency.p_o )
  297. 114.47 s [Cabal-syntax] [ 89 of 137] Compiling Distribution.Types.SetupBuildInfo ( src/Distribution/Types/SetupBuildInfo.hs, dist/build/Distribution/Types/SetupBuildInfo.p_o )
  298. 114.47 s [Cabal-syntax] [ 90 of 137] Compiling Distribution.Types.SetupBuildInfo.Lens ( src/Distribution/Types/SetupBuildInfo/Lens.hs, dist/build/Distribution/Types/SetupBuildInfo/Lens.p_o )
  299. 114.47 s [Cabal-syntax] [ 91 of 137] Compiling Distribution.Types.DependencyMap ( src/Distribution/Types/DependencyMap.hs, dist/build/Distribution/Types/DependencyMap.p_o )
  300. 114.47 s [Cabal-syntax] [ 92 of 137] Compiling Distribution.Types.BenchmarkType ( src/Distribution/Types/BenchmarkType.hs, dist/build/Distribution/Types/BenchmarkType.p_o )
  301. 114.47 s [Cabal-syntax] [ 93 of 137] Compiling Distribution.Types.BenchmarkInterface ( src/Distribution/Types/BenchmarkInterface.hs, dist/build/Distribution/Types/BenchmarkInterface.p_o )
  302. 114.47 s [Cabal-syntax] [ 94 of 137] Compiling Distribution.Package ( src/Distribution/Package.hs, dist/build/Distribution/Package.p_o )
  303. 114.47 s [Cabal-syntax] [ 95 of 137] Compiling Distribution.Types.AbiDependency ( src/Distribution/Types/AbiDependency.hs, dist/build/Distribution/Types/AbiDependency.p_o )
  304. 114.47 s [Cabal-syntax] [ 96 of 137] Compiling Distribution.License ( src/Distribution/License.hs, dist/build/Distribution/License.p_o )
  305. 115.88 s [Cabal-syntax] [ 97 of 137] Compiling Distribution.Types.InstalledPackageInfo ( src/Distribution/Types/InstalledPackageInfo.hs, dist/build/Distribution/Types/InstalledPackageInfo.p_o )
  306. 117.94 s [Cabal-syntax] [ 98 of 137] Compiling Distribution.Types.InstalledPackageInfo.Lens ( src/Distribution/Types/InstalledPackageInfo/Lens.hs, dist/build/Distribution/Types/InstalledPackageInfo/Lens.p_o )
  307. 118.58 s [Cabal-syntax] [ 99 of 137] Compiling Distribution.Fields.ParseResult ( src/Distribution/Fields/ParseResult.hs, dist/build/Distribution/Fields/ParseResult.p_o )
  308. 118.58 s [Cabal-syntax] [100 of 137] Compiling Distribution.Fields ( src/Distribution/Fields.hs, dist/build/Distribution/Fields.p_o )
  309. 118.58 s [Cabal-syntax] [101 of 137] Compiling Language.Haskell.Extension ( src/Language/Haskell/Extension.hs, dist/build/Language/Haskell/Extension.p_o )
  310. 118.58 s [Cabal-syntax] [102 of 137] Compiling Distribution.Compiler ( src/Distribution/Compiler.hs, dist/build/Distribution/Compiler.p_o )
  311. 118.58 s [Cabal-syntax] [103 of 137] Compiling Distribution.Types.ConfVar ( src/Distribution/Types/ConfVar.hs, dist/build/Distribution/Types/ConfVar.p_o )
  312. 118.58 s [Cabal-syntax] [104 of 137] Compiling Distribution.Fields.ConfVar ( src/Distribution/Fields/ConfVar.hs, dist/build/Distribution/Fields/ConfVar.p_o )
  313. 118.58 s [Cabal-syntax] [105 of 137] Compiling Distribution.Types.BuildInfo ( src/Distribution/Types/BuildInfo.hs, dist/build/Distribution/Types/BuildInfo.p_o )
  314. 118.58 s [Cabal-syntax] [106 of 137] Compiling Distribution.Types.HookedBuildInfo ( src/Distribution/Types/HookedBuildInfo.hs, dist/build/Distribution/Types/HookedBuildInfo.p_o )
  315. 118.58 s [Cabal-syntax] [107 of 137] Compiling Distribution.Types.BuildInfo.Lens ( src/Distribution/Types/BuildInfo/Lens.hs, dist/build/Distribution/Types/BuildInfo/Lens.p_o )
  316. 118.58 s [Cabal-syntax] [108 of 137] Compiling Distribution.Types.TestSuite ( src/Distribution/Types/TestSuite.hs, dist/build/Distribution/Types/TestSuite.p_o )
  317. 120.76 s [Cabal-syntax] [109 of 137] Compiling Distribution.Types.TestSuite.Lens ( src/Distribution/Types/TestSuite/Lens.hs, dist/build/Distribution/Types/TestSuite/Lens.p_o )
  318. 120.93 s [Cabal-syntax] [110 of 137] Compiling Distribution.Types.Library ( src/Distribution/Types/Library.hs, dist/build/Distribution/Types/Library.p_o )
  319. 121.09 s [Cabal-syntax] [111 of 137] Compiling Distribution.Types.Library.Lens ( src/Distribution/Types/Library/Lens.hs, dist/build/Distribution/Types/Library/Lens.p_o )
  320. 121.28 s [Cabal-syntax] [112 of 137] Compiling Distribution.Types.ForeignLib ( src/Distribution/Types/ForeignLib.hs, dist/build/Distribution/Types/ForeignLib.p_o )
  321. 121.81 s [Cabal-syntax] [113 of 137] Compiling Distribution.Types.ForeignLib.Lens ( src/Distribution/Types/ForeignLib/Lens.hs, dist/build/Distribution/Types/ForeignLib/Lens.p_o )
  322. 121.99 s [Cabal-syntax] [114 of 137] Compiling Distribution.Types.Executable ( src/Distribution/Types/Executable.hs, dist/build/Distribution/Types/Executable.p_o )
  323. 121.99 s [Cabal-syntax] [115 of 137] Compiling Distribution.Types.Executable.Lens ( src/Distribution/Types/Executable/Lens.hs, dist/build/Distribution/Types/Executable/Lens.p_o )
  324. 121.99 s [Cabal-syntax] [116 of 137] Compiling Distribution.Types.Benchmark ( src/Distribution/Types/Benchmark.hs, dist/build/Distribution/Types/Benchmark.p_o )
  325. 121.99 s [Cabal-syntax] [117 of 137] Compiling Distribution.Types.Component ( src/Distribution/Types/Component.hs, dist/build/Distribution/Types/Component.p_o )
  326. 123.32 s [Cabal-syntax] [118 of 137] Compiling Distribution.Types.ComponentRequestedSpec ( src/Distribution/Types/ComponentRequestedSpec.hs, dist/build/Distribution/Types/ComponentRequestedSpec.p_o )
  327. 123.85 s [Cabal-syntax] [119 of 137] Compiling Distribution.Types.PackageDescription ( src/Distribution/Types/PackageDescription.hs, dist/build/Distribution/Types/PackageDescription.p_o )
  328. 126.78 s [Cabal-syntax] [120 of 137] Compiling Distribution.Types.GenericPackageDescription ( src/Distribution/Types/GenericPackageDescription.hs, dist/build/Distribution/Types/GenericPackageDescription.p_o )
  329. 128.06 s [Cabal-syntax] [121 of 137] Compiling Distribution.Types.GenericPackageDescription.Lens ( src/Distribution/Types/GenericPackageDescription/Lens.hs, dist/build/Distribution/Types/GenericPackageDescription/Lens.p_o )
  330. 128.31 s [Cabal-syntax] [122 of 137] Compiling Distribution.Types.Benchmark.Lens ( src/Distribution/Types/Benchmark/Lens.hs, dist/build/Distribution/Types/Benchmark/Lens.p_o )
  331. 128.31 s [Cabal-syntax] [123 of 137] Compiling Distribution.Types.PackageDescription.Lens ( src/Distribution/Types/PackageDescription/Lens.hs, dist/build/Distribution/Types/PackageDescription/Lens.p_o )
  332. 128.31 s [Cabal-syntax] [124 of 137] Compiling Distribution.Types.Lens ( src/Distribution/Types/Lens.hs, dist/build/Distribution/Types/Lens.p_o )
  333. 128.44 s [Cabal-syntax] [125 of 137] Compiling Distribution.PackageDescription ( src/Distribution/PackageDescription.hs, dist/build/Distribution/PackageDescription.p_o )
  334. 128.46 s [Cabal-syntax] [126 of 137] Compiling Distribution.PackageDescription.Configuration ( src/Distribution/PackageDescription/Configuration.hs, dist/build/Distribution/PackageDescription/Configuration.p_o )
  335. 129.65 s [Cabal-syntax] [127 of 137] Compiling Distribution.FieldGrammar.Newtypes ( src/Distribution/FieldGrammar/Newtypes.hs, dist/build/Distribution/FieldGrammar/Newtypes.p_o )
  336. 129.65 s [Cabal-syntax] [128 of 137] Compiling Distribution.FieldGrammar.Class ( src/Distribution/FieldGrammar/Class.hs, dist/build/Distribution/FieldGrammar/Class.p_o )
  337. 129.66 s [Cabal-syntax] [129 of 137] Compiling Distribution.FieldGrammar.Pretty ( src/Distribution/FieldGrammar/Pretty.hs, dist/build/Distribution/FieldGrammar/Pretty.p_o )
  338. 129.66 s [Cabal-syntax] [130 of 137] Compiling Distribution.FieldGrammar.Parsec ( src/Distribution/FieldGrammar/Parsec.hs, dist/build/Distribution/FieldGrammar/Parsec.p_o )
  339. 129.66 s [Cabal-syntax] [131 of 137] Compiling Distribution.FieldGrammar ( src/Distribution/FieldGrammar.hs, dist/build/Distribution/FieldGrammar.p_o )
  340. 129.66 s [Cabal-syntax] [132 of 137] Compiling Distribution.PackageDescription.FieldGrammar ( src/Distribution/PackageDescription/FieldGrammar.hs, dist/build/Distribution/PackageDescription/FieldGrammar.p_o )
  341. 137.73 s [Cabal-syntax] [133 of 137] Compiling Distribution.PackageDescription.PrettyPrint ( src/Distribution/PackageDescription/PrettyPrint.hs, dist/build/Distribution/PackageDescription/PrettyPrint.p_o )
  342. 138.76 s [Cabal-syntax] [134 of 137] Compiling Distribution.PackageDescription.Parsec ( src/Distribution/PackageDescription/Parsec.hs, dist/build/Distribution/PackageDescription/Parsec.p_o )
  343. 145.56 s [Cabal-syntax] [135 of 137] Compiling Distribution.FieldGrammar.FieldDescrs ( src/Distribution/FieldGrammar/FieldDescrs.hs, dist/build/Distribution/FieldGrammar/FieldDescrs.p_o )
  344. 145.58 s [Cabal-syntax] [136 of 137] Compiling Distribution.Types.InstalledPackageInfo.FieldGrammar ( src/Distribution/Types/InstalledPackageInfo/FieldGrammar.hs, dist/build/Distribution/Types/InstalledPackageInfo/FieldGrammar.p_o )
  345. 145.58 s [Cabal-syntax] [137 of 137] Compiling Distribution.InstalledPackageInfo ( src/Distribution/InstalledPackageInfo.hs, dist/build/Distribution/InstalledPackageInfo.p_o )
  346. 150.37 s [Cabal-syntax] buildPhase completed in 2 minutes 18 seconds
  347. 150.37 s [Cabal-syntax] Phase: checkPhase
  348. 150.41 s [Cabal-syntax] Package has no test suites.
  349. 150.42 s [Cabal-syntax] Phase: haddockPhase
  350. 150.80 s [Cabal-syntax] Preprocessing library for Cabal-syntax-3.12.1.0..
  351. 150.85 s [Cabal-syntax] Running Haddock on library for Cabal-syntax-3.12.1.0..
  352. 151.00 s [Cabal-syntax] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
  353. 152.49 s [Cabal-syntax] 50% ( 2 / 4) in 'Distribution.Compat.Binary'
  354. 152.49 s [Cabal-syntax] Missing documentation for:
  355. 152.49 s [Cabal-syntax] Module header
  356. 152.49 s [Cabal-syntax] decodeOrFailIO (src/Distribution/Compat/Binary.hs:19)
  357. 152.52 s [Cabal-syntax] Warning: 'IOException' is out of scope.
  358. 152.52 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  359. 152.52 s [Cabal-syntax] 80% ( 4 / 5) in 'Distribution.Compat.Exception'
  360. 152.52 s [Cabal-syntax] Missing documentation for:
  361. 152.52 s [Cabal-syntax] Module header
  362. 152.52 s [Cabal-syntax] 100% ( 2 / 2) in 'Distribution.Compat.MonadFail'
  363. 152.56 s [Cabal-syntax] 100% ( 6 / 6) in 'Distribution.Compat.Newtype'
  364. 152.58 s [Cabal-syntax] 75% ( 3 / 4) in 'Distribution.Compat.Typeable'
  365. 152.58 s [Cabal-syntax] Missing documentation for:
  366. 152.58 s [Cabal-syntax] Module header
  367. 152.62 s [Cabal-syntax] 33% ( 1 / 3) in 'Distribution.PackageDescription.Utils'
  368. 152.62 s [Cabal-syntax] Missing documentation for:
  369. 152.62 s [Cabal-syntax] cabalBug (src/Distribution/PackageDescription/Utils.hs:21)
  370. 152.62 s [Cabal-syntax] userBug (src/Distribution/PackageDescription/Utils.hs:18)
  371. 152.67 s [Cabal-syntax] 100% ( 2 / 2) in 'Distribution.Utils.Base62'
  372. 152.77 s [Cabal-syntax] 77% ( 7 / 9) in 'Distribution.Utils.MD5'
  373. 152.77 s [Cabal-syntax] Missing documentation for:
  374. 152.77 s [Cabal-syntax] Module header
  375. 152.77 s [Cabal-syntax] MD5 (src/Distribution/Utils/MD5.hs:26)
  376. 152.95 s [Cabal-syntax] Warning: 'decodeUtf8' is out of scope.
  377. 152.95 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  378. 152.95 s [Cabal-syntax] 60% ( 3 / 5) in 'Distribution.Utils.String'
  379. 152.95 s [Cabal-syntax] Missing documentation for:
  380. 152.95 s [Cabal-syntax] Module header
  381. 152.95 s [Cabal-syntax] trim (src/Distribution/Utils/String.hs:109)
  382. 153.84 s [Cabal-syntax] Warning: 'Binary' is out of scope.
  383. 153.84 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  384. 153.84 s [Cabal-syntax] 74% ( 20 / 27) in 'Distribution.Utils.Structured'
  385. 153.84 s [Cabal-syntax] Missing documentation for:
  386. 153.84 s [Cabal-syntax] structuredDecodeOrFailIO (src/Distribution/Utils/Structured.hs:275)
  387. 153.84 s [Cabal-syntax] MD5 (src/Distribution/Utils/MD5.hs:26)
  388. 153.84 s [Cabal-syntax] containerStructure (src/Distribution/Utils/Structured.hs:321)
  389. 153.84 s [Cabal-syntax] Tag (src/Distribution/Utils/Structured.hs:289)
  390. 153.84 s [Cabal-syntax] TypeName (src/Distribution/Utils/Structured.hs:122)
  391. 153.84 s [Cabal-syntax] ConstructorName (src/Distribution/Utils/Structured.hs:123)
  392. 153.84 s [Cabal-syntax] SopStructure (src/Distribution/Utils/Structured.hs:141)
  393. 154.24 s [Cabal-syntax] 100% ( 10 / 10) in 'Distribution.Compat.Semigroup'
  394. 154.41 s [Cabal-syntax] 41% ( 7 / 17) in 'Distribution.Compat.NonEmptySet'
  395. 154.41 s [Cabal-syntax] Missing documentation for:
  396. 154.42 s [Cabal-syntax] Module header
  397. 154.42 s [Cabal-syntax] singleton (src/Distribution/Compat/NonEmptySet.hs:101)
  398. 154.42 s [Cabal-syntax] insert (src/Distribution/Compat/NonEmptySet.hs:108)
  399. 154.42 s [Cabal-syntax] delete (src/Distribution/Compat/NonEmptySet.hs:115)
  400. 154.42 s [Cabal-syntax] toNonEmpty (src/Distribution/Compat/NonEmptySet.hs:129)
  401. 154.42 s [Cabal-syntax] fromNonEmpty (src/Distribution/Compat/NonEmptySet.hs:126)
  402. 154.42 s [Cabal-syntax] toList (src/Distribution/Compat/NonEmptySet.hs:134)
  403. 154.42 s [Cabal-syntax] toSet (src/Distribution/Compat/NonEmptySet.hs:137)
  404. 154.42 s [Cabal-syntax] member (src/Distribution/Compat/NonEmptySet.hs:144)
  405. 154.42 s [Cabal-syntax] map (src/Distribution/Compat/NonEmptySet.hs:152)
  406. 154.67 s [Cabal-syntax] 95% (265 /277) in 'Distribution.Compat.Prelude'
  407. 154.67 s [Cabal-syntax] Missing documentation for:
  408. 154.68 s [Cabal-syntax] Bool
  409. 154.68 s [Cabal-syntax] Ordering
  410. 154.68 s [Cabal-syntax] Real
  411. 154.68 s [Cabal-syntax] even
  412. 154.68 s [Cabal-syntax] odd
  413. 154.68 s [Cabal-syntax] foldl1 (src/Distribution/Compat/Prelude.hs:329)
  414. 154.68 s [Cabal-syntax] foldr1 (src/Distribution/Compat/Prelude.hs:325)
  415. 154.68 s [Cabal-syntax] trace (src/Distribution/Compat/Prelude.hs:339)
  416. 154.68 s [Cabal-syntax] traceShow (src/Distribution/Compat/Prelude.hs:347)
  417. 154.68 s [Cabal-syntax] traceShowId (src/Distribution/Compat/Prelude.hs:343)
  418. 154.68 s [Cabal-syntax] traceM (src/Distribution/Compat/Prelude.hs:351)
  419. 154.68 s [Cabal-syntax] traceShowM (src/Distribution/Compat/Prelude.hs:355)
  420. 154.77 s [Cabal-syntax] Warning: 'Strings' is out of scope.
  421. 154.77 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  422. 154.77 s [Cabal-syntax] Warning: 'ByteString' is out of scope.
  423. 154.77 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  424. 154.77 s [Cabal-syntax] Warning: 'PackageName' is out of scope.
  425. 154.77 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  426. 154.77 s [Cabal-syntax] 100% ( 12 / 12) in 'Distribution.Utils.ShortText'
  427. 154.95 s [Cabal-syntax] Warning: 'ByteString' is out of scope.
  428. 154.95 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  429. 154.95 s [Cabal-syntax] Warning: 'snoc' is out of scope.
  430. 154.95 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  431. 154.95 s [Cabal-syntax] Warning: 'cons' is out of scope.
  432. 154.95 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  433. 154.95 s [Cabal-syntax] 96% ( 52 / 54) in 'Distribution.Utils.Generic'
  434. 154.96 s [Cabal-syntax] Missing documentation for:
  435. 154.96 s [Cabal-syntax] equating (src/Distribution/Utils/Generic.hs:413)
  436. 154.96 s [Cabal-syntax] unintersperse (src/Distribution/Utils/Generic.hs:443)
  437. 155.75 s [Cabal-syntax] 83% ( 5 / 6) in 'Distribution.Types.Condition'
  438. 155.75 s [Cabal-syntax] Missing documentation for:
  439. 155.75 s [Cabal-syntax] Module header
  440. 156.16 s [Cabal-syntax] 62% ( 5 / 8) in 'Distribution.Parsec.Position'
  441. 156.16 s [Cabal-syntax] Missing documentation for:
  442. 156.16 s [Cabal-syntax] Module header
  443. 156.19 s [Cabal-syntax] showPos (src/Distribution/Parsec/Position.hs:34)
  444. 156.19 s [Cabal-syntax] zeroPos (src/Distribution/Parsec/Position.hs:37)
  445. 156.36 s [Cabal-syntax] 50% ( 2 / 4) in 'Distribution.Parsec.Warning'
  446. 156.36 s [Cabal-syntax] Missing documentation for:
  447. 156.36 s [Cabal-syntax] Module header
  448. 156.36 s [Cabal-syntax] showPWarning (src/Distribution/Parsec/Warning.hs:76)
  449. 156.56 s [Cabal-syntax] 40% ( 2 / 5) in 'Distribution.Parsec.FieldLineStream'
  450. 156.56 s [Cabal-syntax] Missing documentation for:
  451. 156.56 s [Cabal-syntax] Module header
  452. 156.56 s [Cabal-syntax] fieldLineStreamFromBS (src/Distribution/Parsec/FieldLineStream.hs:38)
  453. 156.56 s [Cabal-syntax] fieldLineStreamEnd (src/Distribution/Parsec/FieldLineStream.hs:29)
  454. 156.65 s [Cabal-syntax] 33% ( 1 / 3) in 'Distribution.Parsec.Error'
  455. 156.65 s [Cabal-syntax] Missing documentation for:
  456. 156.65 s [Cabal-syntax] Module header
  457. 156.65 s [Cabal-syntax] showPError (src/Distribution/Parsec/Error.hs:20)
  458. 156.75 s [Cabal-syntax] 100% ( 2 / 2) in 'Distribution.PackageDescription.Quirks'
  459. 156.95 s [Cabal-syntax] 22% ( 4 / 18) in 'Distribution.Fields.LexerMonad'
  460. 156.95 s [Cabal-syntax] Missing documentation for:
  461. 156.95 s [Cabal-syntax] InputStream (src/Distribution/Fields/LexerMonad.hs:124)
  462. 156.95 s [Cabal-syntax] LexState (src/Distribution/Fields/LexerMonad.hs:102)
  463. 156.96 s [Cabal-syntax] LexResult (src/Distribution/Fields/LexerMonad.hs:61)
  464. 156.96 s [Cabal-syntax] Lex (src/Distribution/Fields/LexerMonad.hs:48)
  465. 156.96 s [Cabal-syntax] getPos (src/Distribution/Fields/LexerMonad.hs:157)
  466. 156.96 s [Cabal-syntax] setPos (src/Distribution/Fields/LexerMonad.hs:154)
  467. 156.96 s [Cabal-syntax] adjustPos (src/Distribution/Fields/LexerMonad.hs:160)
  468. 156.96 s [Cabal-syntax] getInput (src/Distribution/Fields/LexerMonad.hs:163)
  469. 156.96 s [Cabal-syntax] setInput (src/Distribution/Fields/LexerMonad.hs:166)
  470. 156.96 s [Cabal-syntax] getStartCode (src/Distribution/Fields/LexerMonad.hs:169)
  471. 156.96 s [Cabal-syntax] setStartCode (src/Distribution/Fields/LexerMonad.hs:172)
  472. 156.96 s [Cabal-syntax] LexWarning (src/Distribution/Fields/LexerMonad.hs:76)
  473. 156.96 s [Cabal-syntax] LexWarningType (src/Distribution/Fields/LexerMonad.hs:63)
  474. 156.96 s [Cabal-syntax] toPWarnings (src/Distribution/Fields/LexerMonad.hs:82)
  475. 157.15 s [Cabal-syntax] 20% ( 2 / 10) in 'Distribution.Fields.Lexer'
  476. 157.15 s [Cabal-syntax] Missing documentation for:
  477. 157.15 s [Cabal-syntax] ltest (dist/build/Distribution/Fields/Lexer.hs:550)
  478. 157.15 s [Cabal-syntax] lexToken (src/Distribution/Fields/Lexer.x:208)
  479. 157.15 s [Cabal-syntax] LToken (src/Distribution/Fields/Lexer.x:166)
  480. 157.15 s [Cabal-syntax] bol_section (dist/build/Distribution/Fields/Lexer.hs:157)
  481. 157.15 s [Cabal-syntax] in_section (dist/build/Distribution/Fields/Lexer.hs:157)
  482. 157.16 s [Cabal-syntax] in_field_layout (dist/build/Distribution/Fields/Lexer.hs:157)
  483. 157.16 s [Cabal-syntax] in_field_braces (dist/build/Distribution/Fields/Lexer.hs:157)
  484. 157.16 s [Cabal-syntax] mkLexState (dist/build/Distribution/Fields/Lexer.hs:556)
  485. 157.49 s [Cabal-syntax] 100% ( 23 / 23) in 'Distribution.Compat.Parsing'
  486. 157.77 s [Cabal-syntax] 50% ( 4 / 8) in 'Distribution.Compat.DList'
  487. 157.77 s [Cabal-syntax] Missing documentation for:
  488. 157.77 s [Cabal-syntax] runDList (src/Distribution/Compat/DList.hs:29)
  489. 157.77 s [Cabal-syntax] fromList (src/Distribution/Compat/DList.hs:40)
  490. 157.77 s [Cabal-syntax] toList (src/Distribution/Compat/DList.hs:43)
  491. 157.77 s [Cabal-syntax] snoc (src/Distribution/Compat/DList.hs:46)
  492. 157.86 s [Cabal-syntax] 33% ( 16 / 48) in 'Distribution.Compat.Lens'
  493. 157.86 s [Cabal-syntax] Missing documentation for:
  494. 157.86 s [Cabal-syntax] Lens (src/Distribution/Compat/Lens.hs:82)
  495. 157.86 s [Cabal-syntax] Lens' (src/Distribution/Compat/Lens.hs:85)
  496. 157.86 s [Cabal-syntax] Traversal (src/Distribution/Compat/Lens.hs:83)
  497. 157.86 s [Cabal-syntax] Traversal' (src/Distribution/Compat/Lens.hs:86)
  498. 157.86 s [Cabal-syntax] LensLike (src/Distribution/Compat/Lens.hs:79)
  499. 157.86 s [Cabal-syntax] LensLike' (src/Distribution/Compat/Lens.hs:80)
  500. 157.86 s [Cabal-syntax] Getting (src/Distribution/Compat/Lens.hs:88)
  501. 157.86 s [Cabal-syntax] AGetter (src/Distribution/Compat/Lens.hs:90)
  502. 157.86 s [Cabal-syntax] ASetter (src/Distribution/Compat/Lens.hs:91)
  503. 157.86 s [Cabal-syntax] ALens (src/Distribution/Compat/Lens.hs:92)
  504. 157.86 s [Cabal-syntax] ALens' (src/Distribution/Compat/Lens.hs:94)
  505. 157.86 s [Cabal-syntax] view (src/Distribution/Compat/Lens.hs:100)
  506. 157.86 s [Cabal-syntax] use (src/Distribution/Compat/Lens.hs:104)
  507. 157.86 s [Cabal-syntax] set (src/Distribution/Compat/Lens.hs:120)
  508. 157.86 s [Cabal-syntax] over (src/Distribution/Compat/Lens.hs:123)
  509. 157.86 s [Cabal-syntax] toDListOf (src/Distribution/Compat/Lens.hs:130)
  510. 157.86 s [Cabal-syntax] toListOf (src/Distribution/Compat/Lens.hs:133)
  511. 157.86 s [Cabal-syntax] toSetOf (src/Distribution/Compat/Lens.hs:136)
  512. 157.86 s [Cabal-syntax] cloneLens (src/Distribution/Compat/Lens.hs:233)
  513. 157.86 s [Cabal-syntax] aview (src/Distribution/Compat/Lens.hs:143)
  514. 157.86 s [Cabal-syntax] _1 (src/Distribution/Compat/Lens.hs:156)
  515. 157.86 s [Cabal-syntax] _2 (src/Distribution/Compat/Lens.hs:159)
  516. 157.86 s [Cabal-syntax] ^. (src/Distribution/Compat/Lens.hs:178)
  517. 157.87 s [Cabal-syntax] .~ (src/Distribution/Compat/Lens.hs:182)
  518. 157.87 s [Cabal-syntax] ?~ (src/Distribution/Compat/Lens.hs:186)
  519. 157.87 s [Cabal-syntax] %~ (src/Distribution/Compat/Lens.hs:190)
  520. 157.87 s [Cabal-syntax] .= (src/Distribution/Compat/Lens.hs:194)
  521. 157.87 s [Cabal-syntax] ?= (src/Distribution/Compat/Lens.hs:198)
  522. 157.87 s [Cabal-syntax] %= (src/Distribution/Compat/Lens.hs:202)
  523. 157.87 s [Cabal-syntax] ^# (src/Distribution/Compat/Lens.hs:206)
  524. 157.87 s [Cabal-syntax] #~ (src/Distribution/Compat/Lens.hs:209)
  525. 157.87 s [Cabal-syntax] #%~ (src/Distribution/Compat/Lens.hs:213)
  526. 158.50 s [Cabal-syntax] Warning: 'ConfVar' is out of scope.
  527. 158.50 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  528. 158.50 s [Cabal-syntax] Warning: 'Dependency' is out of scope.
  529. 158.50 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  530. 158.50 s [Cabal-syntax] Warning: 'BuildInfo' is out of scope.
  531. 158.50 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  532. 158.50 s [Cabal-syntax] Warning: 'targetBuildInfo' is out of scope.
  533. 158.50 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  534. 158.50 s [Cabal-syntax] 61% ( 11 / 18) in 'Distribution.Types.CondTree'
  535. 158.50 s [Cabal-syntax] Missing documentation for:
  536. 158.50 s [Cabal-syntax] Module header
  537. 158.50 s [Cabal-syntax] condIfThen (src/Distribution/Types/CondTree.hs:98)
  538. 158.50 s [Cabal-syntax] condIfThenElse (src/Distribution/Types/CondTree.hs:101)
  539. 158.50 s [Cabal-syntax] mapCondTree (src/Distribution/Types/CondTree.hs:104)
  540. 158.50 s [Cabal-syntax] mapTreeConstrs (src/Distribution/Types/CondTree.hs:119)
  541. 158.50 s [Cabal-syntax] mapTreeConds (src/Distribution/Types/CondTree.hs:122)
  542. 158.50 s [Cabal-syntax] mapTreeData (src/Distribution/Types/CondTree.hs:125)
  543. 158.92 s [Cabal-syntax] 88% ( 22 / 25) in 'Distribution.Compat.CharParsing'
  544. 158.92 s [Cabal-syntax] Missing documentation for:
  545. 158.92 s [Cabal-syntax] satisfyRange (src/Distribution/Compat/CharParsing.hs:147)
  546. 158.92 s [Cabal-syntax] integral (src/Distribution/Compat/CharParsing.hs:320)
  547. 158.92 s [Cabal-syntax] skipSpaces1 (src/Distribution/Compat/CharParsing.hs:358)
  548. 159.25 s [Cabal-syntax] 41% ( 5 / 12) in 'Distribution.CabalSpecVersion'
  549. 159.25 s [Cabal-syntax] Missing documentation for:
  550. 159.25 s [Cabal-syntax] Module header
  551. 159.25 s [Cabal-syntax] cabalSpecLatest (src/Distribution/CabalSpecVersion.hs:67)
  552. 159.25 s [Cabal-syntax] specHasCommonStanzas (src/Distribution/CabalSpecVersion.hs:137)
  553. 159.25 s [Cabal-syntax] specHasElif (src/Distribution/CabalSpecVersion.hs:143)
  554. 159.25 s [Cabal-syntax] HasElif (src/Distribution/CabalSpecVersion.hs:154)
  555. 159.25 s [Cabal-syntax] HasCommonStanzas (src/Distribution/CabalSpecVersion.hs:157)
  556. 159.25 s [Cabal-syntax] HasGlobstar (src/Distribution/CabalSpecVersion.hs:160)
  557. 159.43 s [Cabal-syntax] 33% ( 1 / 3) in 'Distribution.SPDX.LicenseListVersion'
  558. 159.43 s [Cabal-syntax] Missing documentation for:
  559. 159.43 s [Cabal-syntax] Module header
  560. 159.43 s [Cabal-syntax] cabalSpecVersionToSPDXListVersion (src/Distribution/SPDX/LicenseListVersion.hs:19)
  561. 159.48 s [Cabal-syntax] 46% ( 6 / 13) in 'Distribution.Pretty'
  562. 159.48 s [Cabal-syntax] Missing documentation for:
  563. 159.48 s [Cabal-syntax] Module header
  564. 159.48 s [Cabal-syntax] Pretty (src/Distribution/Pretty.hs:24)
  565. 159.48 s [Cabal-syntax] prettyShow (src/Distribution/Pretty.hs:43)
  566. 159.48 s [Cabal-syntax] showFilePath (src/Distribution/Pretty.hs:81)
  567. 159.48 s [Cabal-syntax] showToken (src/Distribution/Pretty.hs:84)
  568. 159.48 s [Cabal-syntax] showTokenStr (src/Distribution/Pretty.hs:87)
  569. 159.48 s [Cabal-syntax] Separator (src/Distribution/Pretty.hs:79)
  570. 159.59 s [Cabal-syntax] 75% ( 15 / 20) in 'Distribution.Fields.Field'
  571. 159.60 s [Cabal-syntax] Missing documentation for:
  572. 159.60 s [Cabal-syntax] fieldAnn (src/Distribution/Fields/Field.hs:63)
  573. 159.60 s [Cabal-syntax] FieldName (src/Distribution/Fields/Field.hs:114)
  574. 159.60 s [Cabal-syntax] mkName (src/Distribution/Fields/Field.hs:125)
  575. 159.60 s [Cabal-syntax] getName (src/Distribution/Fields/Field.hs:128)
  576. 159.60 s [Cabal-syntax] nameAnn (src/Distribution/Fields/Field.hs:131)
  577. 159.81 s [Cabal-syntax] Warning: ':' is out of scope.
  578. 159.81 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  579. 159.81 s [Cabal-syntax] 100% ( 10 / 10) in 'Distribution.Fields.Parser'
  580. 160.00 s [Cabal-syntax] Warning: 'Field' is out of scope.
  581. 160.00 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  582. 160.00 s [Cabal-syntax] Warning: 'Section' is out of scope.
  583. 160.00 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  584. 160.00 s [Cabal-syntax] Warning: 'genericFromParsecField' is out of scope.
  585. 160.00 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  586. 160.00 s [Cabal-syntax] 81% ( 9 / 11) in 'Distribution.Fields.Pretty'
  587. 160.00 s [Cabal-syntax] Missing documentation for:
  588. 160.00 s [Cabal-syntax] PrettyField (src/Distribution/Fields/Pretty.hs:44)
  589. 160.00 s [Cabal-syntax] genericFromParsecFields (src/Distribution/Fields/Pretty.hs:176)
  590. 160.24 s [Cabal-syntax] Warning: 'sepBy' is out of scope.
  591. 160.24 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  592. 160.24 s [Cabal-syntax] 73% ( 31 / 42) in 'Distribution.Parsec'
  593. 160.24 s [Cabal-syntax] Missing documentation for:
  594. 160.24 s [Cabal-syntax] Module header
  595. 160.24 s [Cabal-syntax] ParsecParser (src/Distribution/Parsec.hs:101)
  596. 160.24 s [Cabal-syntax] showPWarning (src/Distribution/Parsec/Warning.hs:76)
  597. 160.24 s [Cabal-syntax] showPError (src/Distribution/Parsec/Error.hs:20)
  598. 160.24 s [Cabal-syntax] showPos (src/Distribution/Parsec/Position.hs:34)
  599. 160.24 s [Cabal-syntax] zeroPos (src/Distribution/Parsec/Position.hs:37)
  600. 160.24 s [Cabal-syntax] parsecFilePath (src/Distribution/Parsec.hs:283)
  601. 160.24 s [Cabal-syntax] parsecCommaList (src/Distribution/Parsec.hs:301)
  602. 160.25 s [Cabal-syntax] parsecCommaNonEmpty (src/Distribution/Parsec.hs:304)
  603. 160.25 s [Cabal-syntax] parsecOptCommaList (src/Distribution/Parsec.hs:337)
  604. 160.25 s [Cabal-syntax] parsecUnqualComponentName (src/Distribution/Parsec.hs:380)
  605. 160.98 s [Cabal-syntax] 54% ( 6 / 11) in 'Distribution.Utils.Path'
  606. 160.98 s [Cabal-syntax] Missing documentation for:
  607. 160.98 s [Cabal-syntax] Module header
  608. 160.98 s [Cabal-syntax] sameDirectory (src/Distribution/Utils/Path.hs:54)
  609. 160.98 s [Cabal-syntax] PackageDir (src/Distribution/Utils/Path.hs:104)
  610. 160.98 s [Cabal-syntax] SourceDir (src/Distribution/Utils/Path.hs:105)
  611. 160.98 s [Cabal-syntax] LicenseFile (src/Distribution/Utils/Path.hs:107)
  612. 161.17 s [Cabal-syntax] 83% ( 10 / 12) in 'Distribution.Types.Version'
  613. 161.22 s [Cabal-syntax] Missing documentation for:
  614. 161.22 s [Cabal-syntax] Module header
  615. 161.22 s [Cabal-syntax] validVersion (src/Distribution/Types/Version.hs:260)
  616. 161.57 s [Cabal-syntax] Warning: 'PkgConfigVersionRange' is out of scope.
  617. 161.57 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  618. 161.57 s [Cabal-syntax] 95% ( 22 / 23) in 'Distribution.Types.VersionRange.Internal'
  619. 161.57 s [Cabal-syntax] Missing documentation for:
  620. 161.57 s [Cabal-syntax] VersionRange (src/Distribution/Types/VersionRange/Internal.hs:52)
  621. 162.00 s [Cabal-syntax] Warning: 'foldVersionRange' is out of scope.
  622. 162.00 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  623. 162.00 s [Cabal-syntax] 84% ( 16 / 19) in 'Distribution.Types.VersionInterval.Legacy'
  624. 162.00 s [Cabal-syntax] Missing documentation for:
  625. 162.00 s [Cabal-syntax] LowerBound (src/Distribution/Types/VersionInterval/Legacy.hs:115)
  626. 162.00 s [Cabal-syntax] UpperBound (src/Distribution/Types/VersionInterval/Legacy.hs:120)
  627. 162.00 s [Cabal-syntax] Bound (src/Distribution/Types/VersionInterval/Legacy.hs:127)
  628. 162.23 s [Cabal-syntax] Warning: 'foldVersionRange' is out of scope.
  629. 162.23 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  630. 162.23 s [Cabal-syntax] 71% ( 15 / 21) in 'Distribution.Types.VersionInterval'
  631. 162.23 s [Cabal-syntax] Missing documentation for:
  632. 162.23 s [Cabal-syntax] relaxLastInterval (src/Distribution/Types/VersionInterval.hs:333)
  633. 162.23 s [Cabal-syntax] relaxHeadInterval (src/Distribution/Types/VersionInterval.hs:340)
  634. 162.23 s [Cabal-syntax] VersionInterval (src/Distribution/Types/VersionInterval.hs:80)
  635. 162.23 s [Cabal-syntax] LowerBound (src/Distribution/Types/VersionInterval.hs:81)
  636. 162.24 s [Cabal-syntax] UpperBound (src/Distribution/Types/VersionInterval.hs:82)
  637. 162.24 s [Cabal-syntax] Bound (src/Distribution/Types/VersionInterval.hs:83)
  638. 162.41 s [Cabal-syntax] Warning: 'VersionRangeParens' is out of scope.
  639. 162.41 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  640. 162.41 s [Cabal-syntax] Warning: 'AnyVersion' is out of scope.
  641. 162.41 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  642. 162.41 s [Cabal-syntax] 89% ( 33 / 37) in 'Distribution.Types.VersionRange'
  643. 162.41 s [Cabal-syntax] Missing documentation for:
  644. 162.41 s [Cabal-syntax] Module header
  645. 162.41 s [Cabal-syntax] VersionRange (src/Distribution/Types/VersionRange/Internal.hs:52)
  646. 162.41 s [Cabal-syntax] isAnyVersionLight (src/Distribution/Types/VersionRange.hs:157)
  647. 162.41 s [Cabal-syntax] isWildcardRange (src/Distribution/Types/VersionRange.hs:165)
  648. 162.65 s [Cabal-syntax] Warning: 'ReopKind' is out of scope.
  649. 162.65 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  650. 162.65 s [Cabal-syntax] 33% ( 3 / 9) in 'Distribution.Types.SourceRepo'
  651. 162.66 s [Cabal-syntax] Missing documentation for:
  652. 162.66 s [Cabal-syntax] Module header
  653. 162.66 s [Cabal-syntax] RepoType (src/Distribution/Types/SourceRepo.hs:146)
  654. 162.66 s [Cabal-syntax] knownRepoTypes (src/Distribution/Types/SourceRepo.hs:155)
  655. 162.66 s [Cabal-syntax] emptySourceRepo (src/Distribution/Types/SourceRepo.hs:82)
  656. 162.66 s [Cabal-syntax] classifyRepoType (src/Distribution/Types/SourceRepo.hs:185)
  657. 162.66 s [Cabal-syntax] classifyRepoKind (src/Distribution/Types/SourceRepo.hs:172)
  658. 162.95 s [Cabal-syntax] 11% ( 1 / 9) in 'Distribution.Types.SourceRepo.Lens'
  659. 162.95 s [Cabal-syntax] Missing documentation for:
  660. 162.95 s [Cabal-syntax] Module header
  661. 162.95 s [Cabal-syntax] repoKind (src/Distribution/Types/SourceRepo/Lens.hs:13)
  662. 162.95 s [Cabal-syntax] repoType (src/Distribution/Types/SourceRepo/Lens.hs:17)
  663. 162.95 s [Cabal-syntax] repoLocation (src/Distribution/Types/SourceRepo/Lens.hs:21)
  664. 162.95 s [Cabal-syntax] repoModule (src/Distribution/Types/SourceRepo/Lens.hs:25)
  665. 162.95 s [Cabal-syntax] repoBranch (src/Distribution/Types/SourceRepo/Lens.hs:29)
  666. 162.95 s [Cabal-syntax] repoTag (src/Distribution/Types/SourceRepo/Lens.hs:33)
  667. 162.95 s [Cabal-syntax] repoSubdir (src/Distribution/Types/SourceRepo/Lens.hs:37)
  668. 163.02 s [Cabal-syntax] 66% ( 2 / 3) in 'Distribution.Types.PkgconfigVersion'
  669. 163.02 s [Cabal-syntax] Missing documentation for:
  670. 163.02 s [Cabal-syntax] Module header
  671. 163.21 s [Cabal-syntax] 37% ( 3 / 8) in 'Distribution.Types.PkgconfigVersionRange'
  672. 163.21 s [Cabal-syntax] Missing documentation for:
  673. 163.21 s [Cabal-syntax] Module header
  674. 163.21 s [Cabal-syntax] anyPkgconfigVersion (src/Distribution/Types/PkgconfigVersionRange.hs:124)
  675. 163.21 s [Cabal-syntax] withinPkgconfigVersionRange (src/Distribution/Types/PkgconfigVersionRange.hs:131)
  676. 163.21 s [Cabal-syntax] versionToPkgconfigVersion (src/Distribution/Types/PkgconfigVersionRange.hs:147)
  677. 163.21 s [Cabal-syntax] versionRangeToPkgconfigVersionRange (src/Distribution/Types/PkgconfigVersionRange.hs:150)
  678. 163.47 s [Cabal-syntax] 75% ( 3 / 4) in 'Distribution.Types.PkgconfigName'
  679. 163.47 s [Cabal-syntax] Missing documentation for:
  680. 163.47 s [Cabal-syntax] Module header
  681. 163.57 s [Cabal-syntax] 50% ( 1 / 2) in 'Distribution.Types.PkgconfigDependency'
  682. 163.57 s [Cabal-syntax] Missing documentation for:
  683. 163.57 s [Cabal-syntax] Module header
  684. 164.09 s [Cabal-syntax] 83% ( 5 / 6) in 'Distribution.Types.PackageName'
  685. 164.09 s [Cabal-syntax] Missing documentation for:
  686. 164.09 s [Cabal-syntax] Module header
  687. 164.21 s [Cabal-syntax] Warning: 'ComponentName' is out of scope.
  688. 164.21 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  689. 164.21 s [Cabal-syntax] Warning: 'ComponentId' is out of scope.
  690. 164.21 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  691. 164.21 s [Cabal-syntax] 87% ( 7 / 8) in 'Distribution.Types.UnqualComponentName'
  692. 164.21 s [Cabal-syntax] Missing documentation for:
  693. 164.21 s [Cabal-syntax] Module header
  694. 164.31 s [Cabal-syntax] 50% ( 1 / 2) in 'Distribution.Types.LibraryVisibility'
  695. 164.31 s [Cabal-syntax] Missing documentation for:
  696. 164.31 s [Cabal-syntax] Module header
  697. 164.41 s [Cabal-syntax] 30% ( 3 / 10) in 'Distribution.Types.LibraryName'
  698. 164.41 s [Cabal-syntax] Missing documentation for:
  699. 164.41 s [Cabal-syntax] Module header
  700. 164.41 s [Cabal-syntax] LibraryName (src/Distribution/Types/LibraryName.hs:27)
  701. 164.41 s [Cabal-syntax] defaultLibName (src/Distribution/Types/LibraryName.hs:55)
  702. 164.41 s [Cabal-syntax] showLibraryName (src/Distribution/Types/LibraryName.hs:58)
  703. 164.41 s [Cabal-syntax] libraryNameStanza (src/Distribution/Types/LibraryName.hs:62)
  704. 164.41 s [Cabal-syntax] libraryNameString (src/Distribution/Types/LibraryName.hs:66)
  705. 164.41 s [Cabal-syntax] parsecLibraryNameComponent (src/Distribution/Types/LibraryName.hs:45)
  706. 164.53 s [Cabal-syntax] Warning: 'MungedPackageId' is out of scope.
  707. 164.53 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  708. 164.53 s [Cabal-syntax] Warning: 'UnitId' is out of scope.
  709. 164.53 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  710. 164.53 s [Cabal-syntax] Warning: 'mkMungedPackageName' is out of scope.
  711. 164.53 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  712. 164.53 s [Cabal-syntax] Warning: 'unMungedPackageName' is out of scope.
  713. 164.53 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  714. 164.53 s [Cabal-syntax] Warning: 'foo' is out of scope.
  715. 164.53 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  716. 164.54 s [Cabal-syntax] 75% ( 3 / 4) in 'Distribution.Types.MungedPackageName'
  717. 164.54 s [Cabal-syntax] Missing documentation for:
  718. 164.54 s [Cabal-syntax] Module header
  719. 164.65 s [Cabal-syntax] 25% ( 1 / 4) in 'Distribution.Types.ForeignLibType'
  720. 164.65 s [Cabal-syntax] Missing documentation for:
  721. 164.65 s [Cabal-syntax] Module header
  722. 164.65 s [Cabal-syntax] knownForeignLibTypes (src/Distribution/Types/ForeignLibType.hs:58)
  723. 164.65 s [Cabal-syntax] foreignLibTypeIsShared (src/Distribution/Types/ForeignLibType.hs:64)
  724. 164.75 s [Cabal-syntax] 0% ( 0 / 2) in 'Distribution.Types.ForeignLibOption'
  725. 164.75 s [Cabal-syntax] Missing documentation for:
  726. 164.75 s [Cabal-syntax] Module header
  727. 164.75 s [Cabal-syntax] ForeignLibOption (src/Distribution/Types/ForeignLibOption.hs:18)
  728. 164.96 s [Cabal-syntax] Warning: 'null' is ambiguous. It is defined
  729. 164.96 s [Cabal-syntax] * in ‘Data.Foldable’
  730. 164.96 s [Cabal-syntax] * at src/Distribution/Utils/ShortText.hs:115:1
  731. 164.96 s [Cabal-syntax] You may be able to disambiguate the identifier by qualifying it or
  732. 164.96 s [Cabal-syntax] by specifying the type/value namespace explicitly.
  733. 164.96 s [Cabal-syntax] Defaulting to the one defined at src/Distribution/Utils/ShortText.hs:115:1
  734. 164.96 s [Cabal-syntax] 96% ( 25 / 26) in 'Distribution.Types.Flag'
  735. 164.96 s [Cabal-syntax] Missing documentation for:
  736. 164.96 s [Cabal-syntax] Module header
  737. 165.25 s [Cabal-syntax] Warning: 'Any' is out of scope.
  738. 165.25 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  739. 165.25 s [Cabal-syntax] 0% ( 0 / 2) in 'Distribution.Types.ExecutableScope'
  740. 165.25 s [Cabal-syntax] Missing documentation for:
  741. 165.25 s [Cabal-syntax] Module header
  742. 165.25 s [Cabal-syntax] ExecutableScope (src/Distribution/Types/ExecutableScope.hs:18)
  743. 165.41 s [Cabal-syntax] 16% ( 1 / 6) in 'Distribution.Types.ComponentName'
  744. 165.41 s [Cabal-syntax] Missing documentation for:
  745. 165.41 s [Cabal-syntax] Module header
  746. 165.41 s [Cabal-syntax] ComponentName (src/Distribution/Types/ComponentName.hs:25)
  747. 165.41 s [Cabal-syntax] showComponentName (src/Distribution/Types/ComponentName.hs:79)
  748. 165.41 s [Cabal-syntax] componentNameRaw (src/Distribution/Types/ComponentName.hs:86)
  749. 165.41 s [Cabal-syntax] componentNameStanza (src/Distribution/Types/ComponentName.hs:90)
  750. 165.55 s [Cabal-syntax] Warning: 'UnitId' is out of scope.
  751. 165.55 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  752. 165.55 s [Cabal-syntax] 75% ( 3 / 4) in 'Distribution.Types.ComponentId'
  753. 165.55 s [Cabal-syntax] Missing documentation for:
  754. 165.55 s [Cabal-syntax] Module header
  755. 165.64 s [Cabal-syntax] 33% ( 1 / 3) in 'Distribution.Types.BuildType'
  756. 165.64 s [Cabal-syntax] Missing documentation for:
  757. 165.64 s [Cabal-syntax] Module header
  758. 165.64 s [Cabal-syntax] knownBuildTypes (src/Distribution/Types/BuildType.hs:38)
  759. 165.73 s [Cabal-syntax] 75% ( 3 / 4) in 'Distribution.Types.AbiHash'
  760. 165.73 s [Cabal-syntax] Missing documentation for:
  761. 165.73 s [Cabal-syntax] Module header
  762. 165.76 s [Cabal-syntax] 0% ( 0 / 3) in 'Distribution.Text'
  763. 165.76 s [Cabal-syntax] Missing documentation for:
  764. 165.76 s [Cabal-syntax] Module header
  765. 165.76 s [Cabal-syntax] display (src/Distribution/Text.hs:9)
  766. 165.76 s [Cabal-syntax] simpleParse (src/Distribution/Text.hs:12)
  767. 166.10 s [Cabal-syntax] 55% ( 10 / 18) in 'Distribution.System'
  768. 166.10 s [Cabal-syntax] Missing documentation for:
  769. 166.10 s [Cabal-syntax] buildOS (src/Distribution/System.hs:175)
  770. 166.10 s [Cabal-syntax] buildArch (src/Distribution/System.hs:281)
  771. 166.10 s [Cabal-syntax] Platform (src/Distribution/System.hs:290)
  772. 166.10 s [Cabal-syntax] platformFromTriple (src/Distribution/System.hs:335)
  773. 166.10 s [Cabal-syntax] knownOSs (src/Distribution/System.hs:123)
  774. 166.10 s [Cabal-syntax] knownArches (src/Distribution/System.hs:226)
  775. 166.10 s [Cabal-syntax] classifyOS (src/Distribution/System.hs:165)
  776. 166.10 s [Cabal-syntax] classifyArch (src/Distribution/System.hs:271)
  777. 166.47 s [Cabal-syntax] 83% ( 5 / 6) in 'Distribution.SPDX.LicenseReference'
  778. 166.52 s [Cabal-syntax] Missing documentation for:
  779. 166.52 s [Cabal-syntax] Module header
  780. 168.27 s [Cabal-syntax] Warning: 'License' is out of scope.
  781. 168.27 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  782. 168.27 s [Cabal-syntax] Warning: 'BSD2' is out of scope.
  783. 168.27 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  784. 168.27 s [Cabal-syntax] Warning: 'BSD3' is out of scope.
  785. 168.27 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  786. 168.27 s [Cabal-syntax] Warning: 'OtherLicense' is out of scope.
  787. 168.27 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  788. 168.27 s [Cabal-syntax] Warning: 'AllRightsReserved' is out of scope.
  789. 168.27 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  790. 168.27 s [Cabal-syntax] Warning: 'PublicDomain' is out of scope.
  791. 168.27 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  792. 168.27 s [Cabal-syntax] 80% ( 8 / 10) in 'Distribution.SPDX.LicenseId'
  793. 168.27 s [Cabal-syntax] Missing documentation for:
  794. 168.27 s [Cabal-syntax] Module header
  795. 168.27 s [Cabal-syntax] licenseIdList (src/Distribution/SPDX/LicenseId.hs:2215)
  796. 170.24 s [Cabal-syntax] 66% ( 4 / 6) in 'Distribution.SPDX.LicenseExceptionId'
  797. 170.24 s [Cabal-syntax] Missing documentation for:
  798. 170.24 s [Cabal-syntax] Module header
  799. 170.24 s [Cabal-syntax] licenseExceptionIdList (src/Distribution/SPDX/LicenseExceptionId.hs:277)
  800. 171.30 s [Cabal-syntax] 50% ( 2 / 4) in 'Distribution.SPDX.LicenseExpression'
  801. 171.30 s [Cabal-syntax] Missing documentation for:
  802. 171.30 s [Cabal-syntax] Module header
  803. 171.30 s [Cabal-syntax] simpleLicenseExpression (src/Distribution/SPDX/LicenseExpression.hs:58)
  804. 171.52 s [Cabal-syntax] Warning: 'LicenseRef' is out of scope.
  805. 171.53 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  806. 171.54 s [Cabal-syntax] 50% ( 1 / 2) in 'Distribution.SPDX.License'
  807. 171.54 s [Cabal-syntax] Missing documentation for:
  808. 171.54 s [Cabal-syntax] Module header
  809. 171.59 s [Cabal-syntax] 86% ( 25 / 29) in 'Distribution.SPDX'
  810. 171.59 s [Cabal-syntax] Missing documentation for:
  811. 171.60 s [Cabal-syntax] simpleLicenseExpression (src/Distribution/SPDX/LicenseExpression.hs:58)
  812. 171.60 s [Cabal-syntax] licenseIdList (src/Distribution/SPDX/LicenseId.hs:2215)
  813. 171.60 s [Cabal-syntax] licenseExceptionIdList (src/Distribution/SPDX/LicenseExceptionId.hs:277)
  814. 171.60 s [Cabal-syntax] cabalSpecVersionToSPDXListVersion (src/Distribution/SPDX/LicenseListVersion.hs:19)
  815. 171.66 s [Cabal-syntax] 77% ( 7 / 9) in 'Distribution.ModuleName'
  816. 171.66 s [Cabal-syntax] Missing documentation for:
  817. 171.66 s [Cabal-syntax] fromString
  818. 171.66 s [Cabal-syntax] validModuleComponent (src/Distribution/ModuleName.hs:90)
  819. 171.78 s [Cabal-syntax] 80% ( 4 / 5) in 'Distribution.Types.ModuleRenaming'
  820. 171.78 s [Cabal-syntax] Missing documentation for:
  821. 171.78 s [Cabal-syntax] Module header
  822. 171.90 s [Cabal-syntax] 75% ( 3 / 4) in 'Distribution.Types.IncludeRenaming'
  823. 171.91 s [Cabal-syntax] Missing documentation for:
  824. 171.91 s [Cabal-syntax] Module header
  825. 172.02 s [Cabal-syntax] Warning: 'Dependency' is out of scope.
  826. 172.02 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  827. 172.02 s [Cabal-syntax] 75% ( 3 / 4) in 'Distribution.Types.Mixin'
  828. 172.02 s [Cabal-syntax] Missing documentation for:
  829. 172.02 s [Cabal-syntax] Module header
  830. 172.13 s [Cabal-syntax] 0% ( 0 / 2) in 'Distribution.Types.ModuleReexport'
  831. 172.13 s [Cabal-syntax] Missing documentation for:
  832. 172.14 s [Cabal-syntax] Module header
  833. 172.14 s [Cabal-syntax] ModuleReexport (src/Distribution/Types/ModuleReexport.hs:22)
  834. 172.33 s [Cabal-syntax] Warning: 'fromList' is out of scope.
  835. 172.33 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  836. 172.33 s [Cabal-syntax] 100% ( 42 / 42) in 'Distribution.Compat.Graph'
  837. 172.59 s [Cabal-syntax] 92% ( 58 / 63) in 'Distribution.Version'
  838. 172.59 s [Cabal-syntax] Missing documentation for:
  839. 172.59 s [Cabal-syntax] VersionRange (src/Distribution/Types/VersionRange/Internal.hs:52)
  840. 172.59 s [Cabal-syntax] VersionInterval (src/Distribution/Types/VersionInterval.hs:80)
  841. 172.59 s [Cabal-syntax] LowerBound (src/Distribution/Types/VersionInterval.hs:81)
  842. 172.59 s [Cabal-syntax] UpperBound (src/Distribution/Types/VersionInterval.hs:82)
  843. 172.59 s [Cabal-syntax] Bound (src/Distribution/Types/VersionInterval.hs:83)
  844. 172.67 s [Cabal-syntax] 20% ( 1 / 5) in 'Distribution.Types.TestType'
  845. 172.67 s [Cabal-syntax] Missing documentation for:
  846. 172.67 s [Cabal-syntax] Module header
  847. 172.67 s [Cabal-syntax] knownTestTypes (src/Distribution/Types/TestType.hs:35)
  848. 172.67 s [Cabal-syntax] testTypeExe (src/Distribution/Types/TestType.hs:41)
  849. 172.67 s [Cabal-syntax] testTypeLib (src/Distribution/Types/TestType.hs:44)
  850. 172.79 s [Cabal-syntax] 50% ( 1 / 2) in 'Distribution.Types.TestSuiteInterface'
  851. 172.79 s [Cabal-syntax] Missing documentation for:
  852. 172.79 s [Cabal-syntax] Module header
  853. 172.91 s [Cabal-syntax] Warning: 'Text' is out of scope.
  854. 172.91 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  855. 172.91 s [Cabal-syntax] 66% ( 2 / 3) in 'Distribution.Types.PackageId'
  856. 172.91 s [Cabal-syntax] Missing documentation for:
  857. 172.91 s [Cabal-syntax] Module header
  858. 173.08 s [Cabal-syntax] Warning: 'unitIdHash' is out of scope.
  859. 173.08 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  860. 173.08 s [Cabal-syntax] Warning: 'OpenUnitId' is out of scope.
  861. 173.08 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  862. 173.08 s [Cabal-syntax] Warning: 'display' is out of scope.
  863. 173.08 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  864. 173.08 s [Cabal-syntax] 70% ( 7 / 10) in 'Distribution.Types.UnitId'
  865. 173.08 s [Cabal-syntax] Missing documentation for:
  866. 173.08 s [Cabal-syntax] Module header
  867. 173.08 s [Cabal-syntax] mkUnitId (src/Distribution/Types/UnitId.hs:94)
  868. 173.08 s [Cabal-syntax] unDefUnitId (src/Distribution/Types/UnitId.hs:120)
  869. 173.21 s [Cabal-syntax] Warning: 'InstalledPackageInfo' is out of scope.
  870. 173.21 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  871. 173.21 s [Cabal-syntax] 50% ( 1 / 2) in 'Distribution.Types.Module'
  872. 173.21 s [Cabal-syntax] Missing documentation for:
  873. 173.21 s [Cabal-syntax] Module header
  874. 173.44 s [Cabal-syntax] Warning: 'ModuleSubst' is out of scope.
  875. 173.44 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  876. 173.44 s [Cabal-syntax] Warning: 'ModuleVar' is out of scope.
  877. 173.44 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  878. 173.44 s [Cabal-syntax] Warning: 'dispModSubst' is out of scope.
  879. 173.44 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  880. 173.44 s [Cabal-syntax] Warning: 'dispModSubstEntry' is out of scope.
  881. 173.44 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  882. 173.44 s [Cabal-syntax] 95% ( 21 / 22) in 'Distribution.Backpack'
  883. 173.44 s [Cabal-syntax] Missing documentation for:
  884. 173.44 s [Cabal-syntax] unDefUnitId (src/Distribution/Types/UnitId.hs:120)
  885. 173.63 s [Cabal-syntax] 0% ( 0 / 2) in 'Distribution.Types.ExposedModule'
  886. 173.63 s [Cabal-syntax] Missing documentation for:
  887. 173.63 s [Cabal-syntax] Module header
  888. 173.63 s [Cabal-syntax] ExposedModule (src/Distribution/Types/ExposedModule.hs:17)
  889. 173.73 s [Cabal-syntax] Warning: 'ExeDependency' is out of scope.
  890. 173.73 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  891. 173.73 s [Cabal-syntax] Warning: 'Dependency' is out of scope.
  892. 173.73 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  893. 173.73 s [Cabal-syntax] 75% ( 3 / 4) in 'Distribution.Types.PackageVersionConstraint'
  894. 173.73 s [Cabal-syntax] Missing documentation for:
  895. 173.73 s [Cabal-syntax] Module header
  896. 173.79 s [Cabal-syntax] 25% ( 1 / 4) in 'Distribution.Types.PackageId.Lens'
  897. 173.79 s [Cabal-syntax] Missing documentation for:
  898. 173.79 s [Cabal-syntax] Module header
  899. 173.79 s [Cabal-syntax] pkgName (src/Distribution/Types/PackageId/Lens.hs:16)
  900. 173.79 s [Cabal-syntax] pkgVersion (src/Distribution/Types/PackageId/Lens.hs:20)
  901. 173.86 s [Cabal-syntax] Warning: 'PackageName' is out of scope.
  902. 173.86 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  903. 173.86 s [Cabal-syntax] 33% ( 1 / 3) in 'Distribution.Types.MungedPackageId'
  904. 173.86 s [Cabal-syntax] Missing documentation for:
  905. 173.86 s [Cabal-syntax] Module header
  906. 173.86 s [Cabal-syntax] computeCompatPackageId (src/Distribution/Types/MungedPackageId.hs:75)
  907. 173.96 s [Cabal-syntax] 50% ( 1 / 2) in 'Distribution.Types.LegacyExeDependency'
  908. 173.96 s [Cabal-syntax] Missing documentation for:
  909. 173.96 s [Cabal-syntax] Module header
  910. 174.09 s [Cabal-syntax] 33% ( 1 / 3) in 'Distribution.Types.ExeDependency'
  911. 174.09 s [Cabal-syntax] Missing documentation for:
  912. 174.09 s [Cabal-syntax] Module header
  913. 174.09 s [Cabal-syntax] qualifiedExeName (src/Distribution/Types/ExeDependency.hs:71)
  914. 174.24 s [Cabal-syntax] Warning: 'DependencyMap' is out of scope.
  915. 174.24 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  916. 174.24 s [Cabal-syntax] 50% ( 4 / 8) in 'Distribution.Types.Dependency'
  917. 174.24 s [Cabal-syntax] Missing documentation for:
  918. 174.24 s [Cabal-syntax] Module header
  919. 174.24 s [Cabal-syntax] depPkgName (src/Distribution/Types/Dependency.hs:50)
  920. 174.24 s [Cabal-syntax] depVerRange (src/Distribution/Types/Dependency.hs:53)
  921. 174.24 s [Cabal-syntax] depLibraries (src/Distribution/Types/Dependency.hs:56)
  922. 174.38 s [Cabal-syntax] 0% ( 0 / 2) in 'Distribution.Types.SetupBuildInfo'
  923. 174.38 s [Cabal-syntax] Missing documentation for:
  924. 174.38 s [Cabal-syntax] Module header
  925. 174.38 s [Cabal-syntax] SetupBuildInfo (src/Distribution/Types/SetupBuildInfo.hs:20)
  926. 174.44 s [Cabal-syntax] 0% ( 0 / 4) in 'Distribution.Types.SetupBuildInfo.Lens'
  927. 174.44 s [Cabal-syntax] Missing documentation for:
  928. 174.44 s [Cabal-syntax] Module header
  929. 174.44 s [Cabal-syntax] SetupBuildInfo (src/Distribution/Types/SetupBuildInfo.hs:20)
  930. 174.44 s [Cabal-syntax] setupDepends (src/Distribution/Types/SetupBuildInfo/Lens.hs:15)
  931. 174.44 s [Cabal-syntax] defaultSetupDepends (src/Distribution/Types/SetupBuildInfo/Lens.hs:19)
  932. 174.48 s [Cabal-syntax] 20% ( 1 / 5) in 'Distribution.Types.DependencyMap'
  933. 174.48 s [Cabal-syntax] Missing documentation for:
  934. 174.48 s [Cabal-syntax] Module header
  935. 174.48 s [Cabal-syntax] toDepMap (src/Distribution/Types/DependencyMap.hs:39)
  936. 174.48 s [Cabal-syntax] fromDepMap (src/Distribution/Types/DependencyMap.hs:43)
  937. 174.48 s [Cabal-syntax] constrainBy (src/Distribution/Types/DependencyMap.hs:50)
  938. 174.56 s [Cabal-syntax] 25% ( 1 / 4) in 'Distribution.Types.BenchmarkType'
  939. 174.56 s [Cabal-syntax] Missing documentation for:
  940. 174.56 s [Cabal-syntax] Module header
  941. 174.56 s [Cabal-syntax] knownBenchmarkTypes (src/Distribution/Types/BenchmarkType.hs:31)
  942. 174.56 s [Cabal-syntax] benchmarkTypeExe (src/Distribution/Types/BenchmarkType.hs:34)
  943. 174.69 s [Cabal-syntax] 50% ( 1 / 2) in 'Distribution.Types.BenchmarkInterface'
  944. 174.69 s [Cabal-syntax] Missing documentation for:
  945. 174.69 s [Cabal-syntax] Module header
  946. 174.77 s [Cabal-syntax] Warning: 'InstalledPackageInfo' is out of scope.
  947. 174.77 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  948. 174.77 s [Cabal-syntax] 70% ( 12 / 17) in 'Distribution.Package'
  949. 174.77 s [Cabal-syntax] Missing documentation for:
  950. 174.77 s [Cabal-syntax] packageName (src/Distribution/Package.hs:80)
  951. 174.78 s [Cabal-syntax] packageVersion (src/Distribution/Package.hs:83)
  952. 174.78 s [Cabal-syntax] HasMungedPackageId (src/Distribution/Package.hs:74)
  953. 174.78 s [Cabal-syntax] mungedName' (src/Distribution/Package.hs:68)
  954. 174.78 s [Cabal-syntax] mungedVersion' (src/Distribution/Package.hs:71)
  955. 174.82 s [Cabal-syntax] Warning: 'abiHash' is out of scope.
  956. 174.83 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  957. 174.83 s [Cabal-syntax] 50% ( 1 / 2) in 'Distribution.Types.AbiDependency'
  958. 174.83 s [Cabal-syntax] Missing documentation for:
  959. 174.83 s [Cabal-syntax] Module header
  960. 175.05 s [Cabal-syntax] 100% ( 5 / 5) in 'Distribution.License'
  961. 176.00 s [Cabal-syntax] 28% ( 2 / 7) in 'Distribution.Types.InstalledPackageInfo'
  962. 176.00 s [Cabal-syntax] Missing documentation for:
  963. 176.00 s [Cabal-syntax] Module header
  964. 176.00 s [Cabal-syntax] InstalledPackageInfo (src/Distribution/Types/InstalledPackageInfo.hs:40)
  965. 176.00 s [Cabal-syntax] emptyInstalledPackageInfo (src/Distribution/Types/InstalledPackageInfo.hs:131)
  966. 176.00 s [Cabal-syntax] mungedPackageId (src/Distribution/Types/InstalledPackageInfo.hs:122)
  967. 176.00 s [Cabal-syntax] ExposedModule (src/Distribution/Types/ExposedModule.hs:17)
  968. 176.29 s [Cabal-syntax] 0% ( 0 / 46) in 'Distribution.Types.InstalledPackageInfo.Lens'
  969. 176.29 s [Cabal-syntax] Missing documentation for:
  970. 176.29 s [Cabal-syntax] Module header
  971. 176.29 s [Cabal-syntax] InstalledPackageInfo (src/Distribution/Types/InstalledPackageInfo.hs:40)
  972. 176.29 s [Cabal-syntax] installedUnitId (src/Distribution/Types/InstalledPackageInfo/Lens.hs:26)
  973. 176.29 s [Cabal-syntax] sourcePackageId (src/Distribution/Types/InstalledPackageInfo/Lens.hs:22)
  974. 176.29 s [Cabal-syntax] license (src/Distribution/Types/InstalledPackageInfo/Lens.hs:46)
  975. 176.29 s [Cabal-syntax] abiHash (src/Distribution/Types/InstalledPackageInfo/Lens.hs:86)
  976. 176.29 s [Cabal-syntax] sourceLibName (src/Distribution/Types/InstalledPackageInfo/Lens.hs:38)
  977. 176.29 s [Cabal-syntax] installedComponentId_ (src/Distribution/Types/InstalledPackageInfo/Lens.hs:30)
  978. 176.29 s [Cabal-syntax] libVisibility (src/Distribution/Types/InstalledPackageInfo/Lens.hs:194)
  979. 176.29 s [Cabal-syntax] instantiatedWith (src/Distribution/Types/InstalledPackageInfo/Lens.hs:34)
  980. 176.29 s [Cabal-syntax] compatPackageKey (src/Distribution/Types/InstalledPackageInfo/Lens.hs:42)
  981. 176.30 s [Cabal-syntax] copyright (src/Distribution/Types/InstalledPackageInfo/Lens.hs:50)
  982. 176.30 s [Cabal-syntax] maintainer (src/Distribution/Types/InstalledPackageInfo/Lens.hs:54)
  983. 176.30 s [Cabal-syntax] author (src/Distribution/Types/InstalledPackageInfo/Lens.hs:58)
  984. 176.30 s [Cabal-syntax] stability (src/Distribution/Types/InstalledPackageInfo/Lens.hs:62)
  985. 176.30 s [Cabal-syntax] homepage (src/Distribution/Types/InstalledPackageInfo/Lens.hs:66)
  986. 176.30 s [Cabal-syntax] pkgUrl (src/Distribution/Types/InstalledPackageInfo/Lens.hs:70)
  987. 176.30 s [Cabal-syntax] synopsis (src/Distribution/Types/InstalledPackageInfo/Lens.hs:74)
  988. 176.30 s [Cabal-syntax] description (src/Distribution/Types/InstalledPackageInfo/Lens.hs:78)
  989. 176.30 s [Cabal-syntax] category (src/Distribution/Types/InstalledPackageInfo/Lens.hs:82)
  990. 176.30 s [Cabal-syntax] indefinite (src/Distribution/Types/InstalledPackageInfo/Lens.hs:90)
  991. 176.30 s [Cabal-syntax] exposed (src/Distribution/Types/InstalledPackageInfo/Lens.hs:94)
  992. 176.30 s [Cabal-syntax] exposedModules (src/Distribution/Types/InstalledPackageInfo/Lens.hs:98)
  993. 176.30 s [Cabal-syntax] hiddenModules (src/Distribution/Types/InstalledPackageInfo/Lens.hs:102)
  994. 176.30 s [Cabal-syntax] trusted (src/Distribution/Types/InstalledPackageInfo/Lens.hs:106)
  995. 176.30 s [Cabal-syntax] importDirs (src/Distribution/Types/InstalledPackageInfo/Lens.hs:110)
  996. 176.30 s [Cabal-syntax] libraryDirs (src/Distribution/Types/InstalledPackageInfo/Lens.hs:114)
  997. 176.30 s [Cabal-syntax] libraryDirsStatic (src/Distribution/Types/InstalledPackageInfo/Lens.hs:118)
  998. 176.30 s [Cabal-syntax] libraryDynDirs (src/Distribution/Types/InstalledPackageInfo/Lens.hs:122)
  999. 176.30 s [Cabal-syntax] dataDir (src/Distribution/Types/InstalledPackageInfo/Lens.hs:126)
  1000. 176.30 s [Cabal-syntax] hsLibraries (src/Distribution/Types/InstalledPackageInfo/Lens.hs:130)
  1001. 176.30 s [Cabal-syntax] extraLibraries (src/Distribution/Types/InstalledPackageInfo/Lens.hs:134)
  1002. 176.30 s [Cabal-syntax] extraLibrariesStatic (src/Distribution/Types/InstalledPackageInfo/Lens.hs:138)
  1003. 176.30 s [Cabal-syntax] extraGHCiLibraries (src/Distribution/Types/InstalledPackageInfo/Lens.hs:142)
  1004. 176.30 s [Cabal-syntax] includeDirs (src/Distribution/Types/InstalledPackageInfo/Lens.hs:146)
  1005. 176.30 s [Cabal-syntax] includes (src/Distribution/Types/InstalledPackageInfo/Lens.hs:150)
  1006. 176.30 s [Cabal-syntax] depends (src/Distribution/Types/InstalledPackageInfo/Lens.hs:154)
  1007. 176.30 s [Cabal-syntax] abiDepends (src/Distribution/Types/InstalledPackageInfo/Lens.hs:158)
  1008. 176.30 s [Cabal-syntax] ccOptions (src/Distribution/Types/InstalledPackageInfo/Lens.hs:162)
  1009. 176.30 s [Cabal-syntax] cxxOptions (src/Distribution/Types/InstalledPackageInfo/Lens.hs:166)
  1010. 176.30 s [Cabal-syntax] ldOptions (src/Distribution/Types/InstalledPackageInfo/Lens.hs:170)
  1011. 176.30 s [Cabal-syntax] frameworkDirs (src/Distribution/Types/InstalledPackageInfo/Lens.hs:174)
  1012. 176.30 s [Cabal-syntax] frameworks (src/Distribution/Types/InstalledPackageInfo/Lens.hs:178)
  1013. 176.30 s [Cabal-syntax] haddockInterfaces (src/Distribution/Types/InstalledPackageInfo/Lens.hs:182)
  1014. 176.30 s [Cabal-syntax] haddockHTMLs (src/Distribution/Types/InstalledPackageInfo/Lens.hs:186)
  1015. 176.30 s [Cabal-syntax] pkgRoot (src/Distribution/Types/InstalledPackageInfo/Lens.hs:190)
  1016. 176.48 s [Cabal-syntax] 100% ( 12 / 12) in 'Distribution.Fields.ParseResult'
  1017. 176.61 s [Cabal-syntax] 83% ( 26 / 31) in 'Distribution.Fields'
  1018. 176.61 s [Cabal-syntax] Missing documentation for:
  1019. 176.61 s [Cabal-syntax] FieldName (src/Distribution/Fields/Field.hs:114)
  1020. 176.64 s [Cabal-syntax] showPWarning (src/Distribution/Parsec/Warning.hs:76)
  1021. 176.64 s [Cabal-syntax] showPError (src/Distribution/Parsec/Error.hs:20)
  1022. 176.64 s [Cabal-syntax] PrettyField (src/Distribution/Fields/Pretty.hs:44)
  1023. 176.64 s [Cabal-syntax] genericFromParsecFields (src/Distribution/Fields/Pretty.hs:176)
  1024. 177.99 s [Cabal-syntax] Warning: 'IsList' is out of scope.
  1025. 177.99 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  1026. 178.00 s [Cabal-syntax] Warning: 'A' is out of scope.
  1027. 178.00 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  1028. 178.00 s [Cabal-syntax] Warning: 'Z' is out of scope.
  1029. 178.00 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  1030. 178.00 s [Cabal-syntax] 66% ( 6 / 9) in 'Language.Haskell.Extension'
  1031. 178.00 s [Cabal-syntax] Missing documentation for:
  1032. 178.00 s [Cabal-syntax] classifyLanguage (src/Language/Haskell/Extension.hs:80)
  1033. 178.00 s [Cabal-syntax] classifyExtension (src/Language/Haskell/Extension.hs:584)
  1034. 178.00 s [Cabal-syntax] knownExtensions (src/Language/Haskell/Extension.hs:622)
  1035. 178.91 s [Cabal-syntax] Warning: 'Compiler' is out of scope.
  1036. 178.91 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  1037. 178.91 s [Cabal-syntax] Warning: 'UserHooks' is out of scope.
  1038. 178.91 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  1039. 178.91 s [Cabal-syntax] 50% ( 9 / 18) in 'Distribution.Compiler'
  1040. 178.91 s [Cabal-syntax] Missing documentation for:
  1041. 178.91 s [Cabal-syntax] CompilerFlavor (src/Distribution/Compiler.hs:66)
  1042. 178.91 s [Cabal-syntax] buildCompilerId (src/Distribution/Compiler.hs:119)
  1043. 178.91 s [Cabal-syntax] buildCompilerFlavor (src/Distribution/Compiler.hs:113)
  1044. 178.91 s [Cabal-syntax] classifyCompilerFlavor (src/Distribution/Compiler.hs:104)
  1045. 178.91 s [Cabal-syntax] knownCompilerFlavors (src/Distribution/Compiler.hs:87)
  1046. 178.91 s [Cabal-syntax] perCompilerFlavorToList (src/Distribution/Compiler.hs:157)
  1047. 178.91 s [Cabal-syntax] CompilerId (src/Distribution/Compiler.hs:176)
  1048. 178.91 s [Cabal-syntax] AbiTag (src/Distribution/Compiler.hs:224)
  1049. 178.91 s [Cabal-syntax] abiTagString (src/Distribution/Compiler.hs:241)
  1050. 179.21 s [Cabal-syntax] 50% ( 1 / 2) in 'Distribution.Types.ConfVar'
  1051. 179.21 s [Cabal-syntax] Missing documentation for:
  1052. 179.21 s [Cabal-syntax] Module header
  1053. 179.67 s [Cabal-syntax] 33% ( 1 / 3) in 'Distribution.Fields.ConfVar'
  1054. 179.67 s [Cabal-syntax] Missing documentation for:
  1055. 179.67 s [Cabal-syntax] Module header
  1056. 179.67 s [Cabal-syntax] parseConditionConfVarFromClause (src/Distribution/Fields/ConfVar.hs:35)
  1057. 179.99 s [Cabal-syntax] Warning: 'rts' is out of scope.
  1058. 179.99 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  1059. 179.99 s [Cabal-syntax] Warning: 'Extensions' is out of scope.
  1060. 179.99 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  1061. 179.99 s [Cabal-syntax] 45% ( 5 / 11) in 'Distribution.Types.BuildInfo'
  1062. 179.99 s [Cabal-syntax] Missing documentation for:
  1063. 179.99 s [Cabal-syntax] Module header
  1064. 179.99 s [Cabal-syntax] BuildInfo (src/Distribution/Types/BuildInfo.hs:32)
  1065. 179.99 s [Cabal-syntax] emptyBuildInfo (src/Distribution/Types/BuildInfo.hs:255)
  1066. 179.99 s [Cabal-syntax] hcProfOptions (src/Distribution/Types/BuildInfo.hs:289)
  1067. 179.99 s [Cabal-syntax] hcSharedOptions (src/Distribution/Types/BuildInfo.hs:292)
  1068. 179.99 s [Cabal-syntax] hcStaticOptions (src/Distribution/Types/BuildInfo.hs:295)
  1069. 180.32 s [Cabal-syntax] Warning: 'PackageDescription' is out of scope.
  1070. 180.32 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  1071. 180.32 s [Cabal-syntax] Warning: 'sanityCheckHookedBuildInfo' is out of scope.
  1072. 180.32 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  1073. 180.32 s [Cabal-syntax] Warning: 'LocalBuildInfo' is out of scope.
  1074. 180.32 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  1075. 180.32 s [Cabal-syntax] Warning: 'updatePackageDescription' is out of scope.
  1076. 180.32 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  1077. 180.32 s [Cabal-syntax] Warning: 'localPkgDescr' is out of scope.
  1078. 180.32 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  1079. 180.32 s [Cabal-syntax] Warning: 'confHook' is out of scope.
  1080. 180.32 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  1081. 180.32 s [Cabal-syntax] 33% ( 1 / 3) in 'Distribution.Types.HookedBuildInfo'
  1082. 180.32 s [Cabal-syntax] Missing documentation for:
  1083. 180.32 s [Cabal-syntax] Module header
  1084. 180.32 s [Cabal-syntax] emptyHookedBuildInfo (src/Distribution/Types/HookedBuildInfo.hs:65)
  1085. 180.43 s [Cabal-syntax] 25% ( 1 / 4) in 'Distribution.Types.BuildInfo.Lens'
  1086. 180.43 s [Cabal-syntax] Missing documentation for:
  1087. 180.43 s [Cabal-syntax] Module header
  1088. 180.43 s [Cabal-syntax] BuildInfo (src/Distribution/Types/BuildInfo.hs:32)
  1089. 180.43 s [Cabal-syntax] HasBuildInfos (src/Distribution/Types/BuildInfo/Lens.hs:354)
  1090. 180.73 s [Cabal-syntax] 50% ( 3 / 6) in 'Distribution.Types.TestSuite'
  1091. 180.73 s [Cabal-syntax] Missing documentation for:
  1092. 180.73 s [Cabal-syntax] Module header
  1093. 180.73 s [Cabal-syntax] emptyTestSuite (src/Distribution/Types/TestSuite.hs:62)
  1094. 180.73 s [Cabal-syntax] testType (src/Distribution/Types/TestSuite.hs:65)
  1095. 180.84 s [Cabal-syntax] 20% ( 1 / 5) in 'Distribution.Types.TestSuite.Lens'
  1096. 180.84 s [Cabal-syntax] Missing documentation for:
  1097. 180.84 s [Cabal-syntax] Module header
  1098. 180.84 s [Cabal-syntax] testBuildInfo (src/Distribution/Types/TestSuite/Lens.hs:25)
  1099. 180.84 s [Cabal-syntax] testName (src/Distribution/Types/TestSuite/Lens.hs:17)
  1100. 180.84 s [Cabal-syntax] testInterface (src/Distribution/Types/TestSuite/Lens.hs:21)
  1101. 180.94 s [Cabal-syntax] Warning: 'addBuildableCondition' is out of scope.
  1102. 180.94 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  1103. 180.94 s [Cabal-syntax] Warning: 'libModules' is out of scope.
  1104. 180.94 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  1105. 180.94 s [Cabal-syntax] 40% ( 2 / 5) in 'Distribution.Types.Library'
  1106. 180.94 s [Cabal-syntax] Missing documentation for:
  1107. 180.94 s [Cabal-syntax] Module header
  1108. 180.94 s [Cabal-syntax] Library (src/Distribution/Types/Library.hs:22)
  1109. 180.94 s [Cabal-syntax] emptyLibrary (src/Distribution/Types/Library.hs:43)
  1110. 181.06 s [Cabal-syntax] 0% ( 0 / 9) in 'Distribution.Types.Library.Lens'
  1111. 181.06 s [Cabal-syntax] Missing documentation for:
  1112. 181.06 s [Cabal-syntax] Module header
  1113. 181.06 s [Cabal-syntax] Library (src/Distribution/Types/Library.hs:22)
  1114. 181.06 s [Cabal-syntax] libName (src/Distribution/Types/Library/Lens.hs:19)
  1115. 181.06 s [Cabal-syntax] libBuildInfo (src/Distribution/Types/Library/Lens.hs:43)
  1116. 181.06 s [Cabal-syntax] libVisibility (src/Distribution/Types/Library/Lens.hs:39)
  1117. 181.06 s [Cabal-syntax] exposedModules (src/Distribution/Types/Library/Lens.hs:23)
  1118. 181.06 s [Cabal-syntax] reexportedModules (src/Distribution/Types/Library/Lens.hs:27)
  1119. 181.06 s [Cabal-syntax] signatures (src/Distribution/Types/Library/Lens.hs:31)
  1120. 181.06 s [Cabal-syntax] libExposed (src/Distribution/Types/Library/Lens.hs:35)
  1121. 181.21 s [Cabal-syntax] 83% ( 10 / 12) in 'Distribution.Types.ForeignLib'
  1122. 181.21 s [Cabal-syntax] Missing documentation for:
  1123. 181.21 s [Cabal-syntax] Module header
  1124. 181.21 s [Cabal-syntax] LibVersionInfo (src/Distribution/Types/ForeignLib.hs:64)
  1125. 181.40 s [Cabal-syntax] 11% ( 1 / 9) in 'Distribution.Types.ForeignLib.Lens'
  1126. 181.40 s [Cabal-syntax] Missing documentation for:
  1127. 181.40 s [Cabal-syntax] Module header
  1128. 181.40 s [Cabal-syntax] foreignLibName (src/Distribution/Types/ForeignLib/Lens.hs:19)
  1129. 181.40 s [Cabal-syntax] foreignLibBuildInfo (src/Distribution/Types/ForeignLib/Lens.hs:31)
  1130. 181.40 s [Cabal-syntax] foreignLibType (src/Distribution/Types/ForeignLib/Lens.hs:23)
  1131. 181.40 s [Cabal-syntax] foreignLibOptions (src/Distribution/Types/ForeignLib/Lens.hs:27)
  1132. 181.40 s [Cabal-syntax] foreignLibVersionInfo (src/Distribution/Types/ForeignLib/Lens.hs:35)
  1133. 181.40 s [Cabal-syntax] foreignLibVersionLinux (src/Distribution/Types/ForeignLib/Lens.hs:39)
  1134. 181.40 s [Cabal-syntax] foreignLibModDefFile (src/Distribution/Types/ForeignLib/Lens.hs:43)
  1135. 181.47 s [Cabal-syntax] 40% ( 2 / 5) in 'Distribution.Types.Executable'
  1136. 181.47 s [Cabal-syntax] Missing documentation for:
  1137. 181.47 s [Cabal-syntax] Module header
  1138. 181.47 s [Cabal-syntax] Executable (src/Distribution/Types/Executable.hs:21)
  1139. 181.47 s [Cabal-syntax] emptyExecutable (src/Distribution/Types/Executable.hs:51)
  1140. 181.57 s [Cabal-syntax] 0% ( 0 / 6) in 'Distribution.Types.Executable.Lens'
  1141. 181.57 s [Cabal-syntax] Missing documentation for:
  1142. 181.58 s [Cabal-syntax] Module header
  1143. 181.58 s [Cabal-syntax] Executable (src/Distribution/Types/Executable.hs:21)
  1144. 181.58 s [Cabal-syntax] exeName (src/Distribution/Types/Executable/Lens.hs:17)
  1145. 181.58 s [Cabal-syntax] exeBuildInfo (src/Distribution/Types/Executable/Lens.hs:29)
  1146. 181.58 s [Cabal-syntax] modulePath (src/Distribution/Types/Executable/Lens.hs:21)
  1147. 181.58 s [Cabal-syntax] exeScope (src/Distribution/Types/Executable/Lens.hs:25)
  1148. 181.66 s [Cabal-syntax] 50% ( 3 / 6) in 'Distribution.Types.Benchmark'
  1149. 181.69 s [Cabal-syntax] Missing documentation for:
  1150. 181.69 s [Cabal-syntax] Module header
  1151. 181.69 s [Cabal-syntax] emptyBenchmark (src/Distribution/Types/Benchmark.hs:58)
  1152. 181.69 s [Cabal-syntax] benchmarkType (src/Distribution/Types/Benchmark.hs:61)
  1153. 181.84 s [Cabal-syntax] 14% ( 1 / 7) in 'Distribution.Types.Component'
  1154. 181.84 s [Cabal-syntax] Missing documentation for:
  1155. 181.84 s [Cabal-syntax] Module header
  1156. 181.84 s [Cabal-syntax] Component (src/Distribution/Types/Component.hs:26)
  1157. 181.84 s [Cabal-syntax] foldComponent (src/Distribution/Types/Component.hs:52)
  1158. 181.84 s [Cabal-syntax] componentBuildInfo (src/Distribution/Types/Component.hs:66)
  1159. 181.84 s [Cabal-syntax] componentName (src/Distribution/Types/Component.hs:78)
  1160. 181.84 s [Cabal-syntax] partitionComponents (src/Distribution/Types/Component.hs:87)
  1161. 182.02 s [Cabal-syntax] Warning: 'PackageDescription' is out of scope.
  1162. 182.02 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  1163. 182.02 s [Cabal-syntax] Warning: 'LocalBuildInfo' is out of scope.
  1164. 182.02 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  1165. 182.02 s [Cabal-syntax] Warning: 'flattenPD' is out of scope.
  1166. 182.02 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  1167. 182.03 s [Cabal-syntax] 87% ( 7 / 8) in 'Distribution.Types.ComponentRequestedSpec'
  1168. 182.03 s [Cabal-syntax] Missing documentation for:
  1169. 182.03 s [Cabal-syntax] Module header
  1170. 182.48 s [Cabal-syntax] Warning: 'GenericPackageDescription' is out of scope.
  1171. 182.48 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  1172. 182.48 s [Cabal-syntax] Warning: 'LicenseExpression' is out of scope.
  1173. 182.48 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  1174. 182.48 s [Cabal-syntax] Warning: 'withLibLBI' is out of scope.
  1175. 182.48 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  1176. 182.48 s [Cabal-syntax] Warning: 'LocalBuildInfo' is out of scope.
  1177. 182.48 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  1178. 182.48 s [Cabal-syntax] Warning: 'withExeLBI' is out of scope.
  1179. 182.48 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  1180. 182.48 s [Cabal-syntax] Warning: 'withTestLBI' is out of scope.
  1181. 182.48 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  1182. 182.48 s [Cabal-syntax] Warning: 'withBenchLBI' is out of scope.
  1183. 182.48 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  1184. 182.48 s [Cabal-syntax] 82% ( 23 / 28) in 'Distribution.Types.PackageDescription'
  1185. 182.48 s [Cabal-syntax] Missing documentation for:
  1186. 182.48 s [Cabal-syntax] emptyPackageDescription (src/Distribution/Types/PackageDescription.hs:199)
  1187. 182.48 s [Cabal-syntax] allLibraries (src/Distribution/Types/PackageDescription.hs:251)
  1188. 182.48 s [Cabal-syntax] updatePackageDescription (src/Distribution/Types/PackageDescription.hs:370)
  1189. 182.48 s [Cabal-syntax] lookupComponent (src/Distribution/Types/PackageDescription.hs:430)
  1190. 182.49 s [Cabal-syntax] getComponent (src/Distribution/Types/PackageDescription.hs:442)
  1191. 183.00 s [Cabal-syntax] 0% ( 0 / 3) in 'Distribution.Types.GenericPackageDescription'
  1192. 183.00 s [Cabal-syntax] Missing documentation for:
  1193. 183.00 s [Cabal-syntax] Module header
  1194. 183.00 s [Cabal-syntax] GenericPackageDescription (src/Distribution/Types/GenericPackageDescription.hs:35)
  1195. 183.00 s [Cabal-syntax] emptyGenericPackageDescription (src/Distribution/Types/GenericPackageDescription.hs:83)
  1196. 183.26 s [Cabal-syntax] 13% ( 3 / 23) in 'Distribution.Types.GenericPackageDescription.Lens'
  1197. 183.26 s [Cabal-syntax] Missing documentation for:
  1198. 183.26 s [Cabal-syntax] Module header
  1199. 183.26 s [Cabal-syntax] GenericPackageDescription (src/Distribution/Types/GenericPackageDescription.hs:35)
  1200. 183.26 s [Cabal-syntax] packageDescription (src/Distribution/Types/GenericPackageDescription/Lens.hs:40)
  1201. 183.26 s [Cabal-syntax] flagName (src/Distribution/Types/GenericPackageDescription/Lens.hs:100)
  1202. 183.26 s [Cabal-syntax] flagDescription (src/Distribution/Types/GenericPackageDescription/Lens.hs:104)
  1203. 183.26 s [Cabal-syntax] flagDefault (src/Distribution/Types/GenericPackageDescription/Lens.hs:108)
  1204. 183.26 s [Cabal-syntax] flagManual (src/Distribution/Types/GenericPackageDescription/Lens.hs:112)
  1205. 183.26 s [Cabal-syntax] gpdScannedVersion (src/Distribution/Types/GenericPackageDescription/Lens.hs:44)
  1206. 183.26 s [Cabal-syntax] genPackageFlags (src/Distribution/Types/GenericPackageDescription/Lens.hs:48)
  1207. 183.26 s [Cabal-syntax] condLibrary (src/Distribution/Types/GenericPackageDescription/Lens.hs:52)
  1208. 183.26 s [Cabal-syntax] condSubLibraries (src/Distribution/Types/GenericPackageDescription/Lens.hs:56)
  1209. 183.26 s [Cabal-syntax] condForeignLibs (src/Distribution/Types/GenericPackageDescription/Lens.hs:60)
  1210. 183.26 s [Cabal-syntax] condExecutables (src/Distribution/Types/GenericPackageDescription/Lens.hs:64)
  1211. 183.26 s [Cabal-syntax] condTestSuites (src/Distribution/Types/GenericPackageDescription/Lens.hs:68)
  1212. 183.26 s [Cabal-syntax] condBenchmarks (src/Distribution/Types/GenericPackageDescription/Lens.hs:72)
  1213. 183.26 s [Cabal-syntax] allCondTrees (src/Distribution/Types/GenericPackageDescription/Lens.hs:76)
  1214. 183.26 s [Cabal-syntax] _OS (src/Distribution/Types/GenericPackageDescription/Lens.hs:120)
  1215. 183.26 s [Cabal-syntax] _Arch (src/Distribution/Types/GenericPackageDescription/Lens.hs:124)
  1216. 183.26 s [Cabal-syntax] _PackageFlag (src/Distribution/Types/GenericPackageDescription/Lens.hs:128)
  1217. 183.26 s [Cabal-syntax] _Impl (src/Distribution/Types/GenericPackageDescription/Lens.hs:132)
  1218. 183.35 s [Cabal-syntax] 20% ( 1 / 5) in 'Distribution.Types.Benchmark.Lens'
  1219. 183.35 s [Cabal-syntax] Missing documentation for:
  1220. 183.35 s [Cabal-syntax] Module header
  1221. 183.36 s [Cabal-syntax] benchmarkName (src/Distribution/Types/Benchmark/Lens.hs:17)
  1222. 183.36 s [Cabal-syntax] benchmarkBuildInfo (src/Distribution/Types/Benchmark/Lens.hs:25)
  1223. 183.36 s [Cabal-syntax] benchmarkInterface (src/Distribution/Types/Benchmark/Lens.hs:21)
  1224. 183.53 s [Cabal-syntax] 11% ( 4 / 35) in 'Distribution.Types.PackageDescription.Lens'
  1225. 183.53 s [Cabal-syntax] Missing documentation for:
  1226. 183.53 s [Cabal-syntax] Module header
  1227. 183.53 s [Cabal-syntax] package (src/Distribution/Types/PackageDescription/Lens.hs:41)
  1228. 183.53 s [Cabal-syntax] copyright (src/Distribution/Types/PackageDescription/Lens.hs:53)
  1229. 183.53 s [Cabal-syntax] maintainer (src/Distribution/Types/PackageDescription/Lens.hs:57)
  1230. 183.53 s [Cabal-syntax] author (src/Distribution/Types/PackageDescription/Lens.hs:61)
  1231. 183.53 s [Cabal-syntax] stability (src/Distribution/Types/PackageDescription/Lens.hs:65)
  1232. 183.53 s [Cabal-syntax] homepage (src/Distribution/Types/PackageDescription/Lens.hs:73)
  1233. 183.53 s [Cabal-syntax] pkgUrl (src/Distribution/Types/PackageDescription/Lens.hs:77)
  1234. 183.53 s [Cabal-syntax] synopsis (src/Distribution/Types/PackageDescription/Lens.hs:89)
  1235. 183.53 s [Cabal-syntax] description (src/Distribution/Types/PackageDescription/Lens.hs:93)
  1236. 183.53 s [Cabal-syntax] category (src/Distribution/Types/PackageDescription/Lens.hs:97)
  1237. 183.53 s [Cabal-syntax] dataDir (src/Distribution/Types/PackageDescription/Lens.hs:145)
  1238. 183.53 s [Cabal-syntax] specVersion (src/Distribution/Types/PackageDescription/Lens.hs:105)
  1239. 183.53 s [Cabal-syntax] licenseRaw (src/Distribution/Types/PackageDescription/Lens.hs:45)
  1240. 183.53 s [Cabal-syntax] licenseFiles (src/Distribution/Types/PackageDescription/Lens.hs:49)
  1241. 183.53 s [Cabal-syntax] testedWith (src/Distribution/Types/PackageDescription/Lens.hs:69)
  1242. 183.53 s [Cabal-syntax] bugReports (src/Distribution/Types/PackageDescription/Lens.hs:81)
  1243. 183.53 s [Cabal-syntax] sourceRepos (src/Distribution/Types/PackageDescription/Lens.hs:85)
  1244. 183.53 s [Cabal-syntax] customFieldsPD (src/Distribution/Types/PackageDescription/Lens.hs:101)
  1245. 183.54 s [Cabal-syntax] buildTypeRaw (src/Distribution/Types/PackageDescription/Lens.hs:109)
  1246. 183.54 s [Cabal-syntax] setupBuildInfo (src/Distribution/Types/PackageDescription/Lens.hs:113)
  1247. 183.54 s [Cabal-syntax] library (src/Distribution/Types/PackageDescription/Lens.hs:117)
  1248. 183.54 s [Cabal-syntax] subLibraries (src/Distribution/Types/PackageDescription/Lens.hs:121)
  1249. 183.54 s [Cabal-syntax] executables (src/Distribution/Types/PackageDescription/Lens.hs:125)
  1250. 183.54 s [Cabal-syntax] foreignLibs (src/Distribution/Types/PackageDescription/Lens.hs:129)
  1251. 183.54 s [Cabal-syntax] testSuites (src/Distribution/Types/PackageDescription/Lens.hs:133)
  1252. 183.54 s [Cabal-syntax] benchmarks (src/Distribution/Types/PackageDescription/Lens.hs:137)
  1253. 183.54 s [Cabal-syntax] dataFiles (src/Distribution/Types/PackageDescription/Lens.hs:141)
  1254. 183.54 s [Cabal-syntax] extraSrcFiles (src/Distribution/Types/PackageDescription/Lens.hs:149)
  1255. 183.54 s [Cabal-syntax] extraTmpFiles (src/Distribution/Types/PackageDescription/Lens.hs:153)
  1256. 183.54 s [Cabal-syntax] extraDocFiles (src/Distribution/Types/PackageDescription/Lens.hs:157)
  1257. 183.74 s [Cabal-syntax] 91% ( 11 / 12) in 'Distribution.Types.Lens'
  1258. 183.74 s [Cabal-syntax] Missing documentation for:
  1259. 183.74 s [Cabal-syntax] Module header
  1260. 183.79 s [Cabal-syntax] 100% ( 56 / 56) in 'Distribution.PackageDescription'
  1261. 184.03 s [Cabal-syntax] Warning: 'Arch' is ambiguous. It is defined
  1262. 184.03 s [Cabal-syntax] * at src/Distribution/Types/ConfVar.hs:19:5
  1263. 184.03 s [Cabal-syntax] * at src/Distribution/System.hs:195:1
  1264. 184.03 s [Cabal-syntax] You may be able to disambiguate the identifier by qualifying it or
  1265. 184.03 s [Cabal-syntax] by specifying the type/value namespace explicitly.
  1266. 184.03 s [Cabal-syntax] Defaulting to the one defined at src/Distribution/Types/ConfVar.hs:17:1
  1267. 184.03 s [Cabal-syntax] Warning: 'OS' is ambiguous. It is defined
  1268. 184.04 s [Cabal-syntax] * at src/Distribution/Types/ConfVar.hs:18:5
  1269. 184.04 s [Cabal-syntax] * at src/Distribution/System.hs:97:1
  1270. 184.04 s [Cabal-syntax] You may be able to disambiguate the identifier by qualifying it or
  1271. 184.04 s [Cabal-syntax] by specifying the type/value namespace explicitly.
  1272. 184.04 s [Cabal-syntax] Defaulting to the one defined at src/Distribution/Types/ConfVar.hs:17:1
  1273. 184.04 s [Cabal-syntax] 62% ( 10 / 16) in 'Distribution.PackageDescription.Configuration'
  1274. 184.04 s [Cabal-syntax] Missing documentation for:
  1275. 184.04 s [Cabal-syntax] freeVars (src/Distribution/PackageDescription/Configuration.hs:347)
  1276. 184.04 s [Cabal-syntax] mapCondTree (src/Distribution/Types/CondTree.hs:104)
  1277. 184.04 s [Cabal-syntax] mapTreeData (src/Distribution/Types/CondTree.hs:125)
  1278. 184.04 s [Cabal-syntax] mapTreeConds (src/Distribution/Types/CondTree.hs:122)
  1279. 184.04 s [Cabal-syntax] mapTreeConstrs (src/Distribution/Types/CondTree.hs:119)
  1280. 184.04 s [Cabal-syntax] transformAllBuildInfos (src/Distribution/PackageDescription/Configuration.hs:639)
  1281. 185.33 s [Cabal-syntax] 96% ( 29 / 30) in 'Distribution.FieldGrammar.Newtypes'
  1282. 185.34 s [Cabal-syntax] Missing documentation for:
  1283. 185.34 s [Cabal-syntax] Sep (src/Distribution/FieldGrammar/Newtypes.hs:91)
  1284. 185.75 s [Cabal-syntax] Warning: 'pack' is out of scope.
  1285. 185.75 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  1286. 185.75 s [Cabal-syntax] Warning: 'Last' is out of scope.
  1287. 185.75 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  1288. 185.75 s [Cabal-syntax] 85% ( 6 / 7) in 'Distribution.FieldGrammar.Class'
  1289. 185.75 s [Cabal-syntax] Missing documentation for:
  1290. 185.75 s [Cabal-syntax] Module header
  1291. 185.89 s [Cabal-syntax] 33% ( 1 / 3) in 'Distribution.FieldGrammar.Pretty'
  1292. 185.89 s [Cabal-syntax] Missing documentation for:
  1293. 185.89 s [Cabal-syntax] Module header
  1294. 185.89 s [Cabal-syntax] PrettyFieldGrammar (src/Distribution/FieldGrammar/Pretty.hs:23)
  1295. 186.26 s [Cabal-syntax] Warning: 'FieldGrammarParser' is out of scope.
  1296. 186.26 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  1297. 186.27 s [Cabal-syntax] Warning: 'GeneralPackageDescription' is out of scope.
  1298. 186.27 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  1299. 186.27 s [Cabal-syntax] Warning: 'Section' is ambiguous. It is defined
  1300. 186.27 s [Cabal-syntax] * at src/Distribution/Fields/Field.hs:52:5
  1301. 186.27 s [Cabal-syntax] * at src/Distribution/FieldGrammar/Parsec.hs:105:1
  1302. 186.27 s [Cabal-syntax] You may be able to disambiguate the identifier by qualifying it or
  1303. 186.27 s [Cabal-syntax] by specifying the type/value namespace explicitly.
  1304. 186.27 s [Cabal-syntax] Defaulting to the one defined at src/Distribution/FieldGrammar/Parsec.hs:105:1
  1305. 186.27 s [Cabal-syntax] 33% ( 4 / 12) in 'Distribution.FieldGrammar.Parsec'
  1306. 186.27 s [Cabal-syntax] Missing documentation for:
  1307. 186.27 s [Cabal-syntax] ParsecFieldGrammar (src/Distribution/FieldGrammar/Parsec.hs:112)
  1308. 186.27 s [Cabal-syntax] parseFieldGrammar (src/Distribution/FieldGrammar/Parsec.hs:119)
  1309. 186.27 s [Cabal-syntax] fieldGrammarKnownFieldList (src/Distribution/FieldGrammar/Parsec.hs:134)
  1310. 186.27 s [Cabal-syntax] Fields (src/Distribution/FieldGrammar/Parsec.hs:95)
  1311. 186.27 s [Cabal-syntax] namelessFieldAnn (src/Distribution/FieldGrammar/Parsec.hs:101)
  1312. 186.27 s [Cabal-syntax] runFieldParser (src/Distribution/FieldGrammar/Parsec.hs:381)
  1313. 186.27 s [Cabal-syntax] runFieldParser' (src/Distribution/FieldGrammar/Parsec.hs:352)
  1314. 186.27 s [Cabal-syntax] fieldLinesToStream (src/Distribution/FieldGrammar/Parsec.hs:441)
  1315. 186.71 s [Cabal-syntax] 65% ( 17 / 26) in 'Distribution.FieldGrammar'
  1316. 186.71 s [Cabal-syntax] Missing documentation for:
  1317. 186.71 s [Cabal-syntax] ParsecFieldGrammar (src/Distribution/FieldGrammar/Parsec.hs:112)
  1318. 186.76 s [Cabal-syntax] ParsecFieldGrammar' (src/Distribution/FieldGrammar.hs:49)
  1319. 186.76 s [Cabal-syntax] parseFieldGrammar (src/Distribution/FieldGrammar/Parsec.hs:119)
  1320. 186.76 s [Cabal-syntax] fieldGrammarKnownFieldList (src/Distribution/FieldGrammar/Parsec.hs:134)
  1321. 186.76 s [Cabal-syntax] PrettyFieldGrammar (src/Distribution/FieldGrammar/Pretty.hs:23)
  1322. 186.76 s [Cabal-syntax] PrettyFieldGrammar' (src/Distribution/FieldGrammar.hs:50)
  1323. 186.76 s [Cabal-syntax] Fields (src/Distribution/FieldGrammar/Parsec.hs:95)
  1324. 186.76 s [Cabal-syntax] runFieldParser (src/Distribution/FieldGrammar/Parsec.hs:381)
  1325. 186.76 s [Cabal-syntax] runFieldParser' (src/Distribution/FieldGrammar/Parsec.hs:352)
  1326. 187.17 s [Cabal-syntax] 36% ( 17 / 47) in 'Distribution.PackageDescription.FieldGrammar'
  1327. 187.17 s [Cabal-syntax] Missing documentation for:
  1328. 187.17 s [Cabal-syntax] packageDescriptionFieldGrammar (src/Distribution/PackageDescription/FieldGrammar.hs:95)
  1329. 187.17 s [Cabal-syntax] CompatLicenseFile (src/Distribution/PackageDescription/FieldGrammar.hs:852)
  1330. 187.17 s [Cabal-syntax] libraryFieldGrammar (src/Distribution/PackageDescription/FieldGrammar.hs:168)
  1331. 187.17 s [Cabal-syntax] foreignLibFieldGrammar (src/Distribution/PackageDescription/FieldGrammar.hs:216)
  1332. 187.17 s [Cabal-syntax] executableFieldGrammar (src/Distribution/PackageDescription/FieldGrammar.hs:257)
  1333. 187.17 s [Cabal-syntax] testSuiteFieldGrammar (src/Distribution/PackageDescription/FieldGrammar.hs:327)
  1334. 187.17 s [Cabal-syntax] validateTestSuite (src/Distribution/PackageDescription/FieldGrammar.hs:360)
  1335. 187.17 s [Cabal-syntax] unvalidateTestSuite (src/Distribution/PackageDescription/FieldGrammar.hs:424)
  1336. 187.17 s [Cabal-syntax] testStanzaTestType (src/Distribution/PackageDescription/FieldGrammar.hs:307)
  1337. 187.17 s [Cabal-syntax] testStanzaMainIs (src/Distribution/PackageDescription/FieldGrammar.hs:311)
  1338. 187.17 s [Cabal-syntax] testStanzaTestModule (src/Distribution/PackageDescription/FieldGrammar.hs:315)
  1339. 187.17 s [Cabal-syntax] testStanzaBuildInfo (src/Distribution/PackageDescription/FieldGrammar.hs:319)
  1340. 187.17 s [Cabal-syntax] benchmarkFieldGrammar (src/Distribution/PackageDescription/FieldGrammar.hs:471)
  1341. 187.17 s [Cabal-syntax] validateBenchmark (src/Distribution/PackageDescription/FieldGrammar.hs:501)
  1342. 187.17 s [Cabal-syntax] unvalidateBenchmark (src/Distribution/PackageDescription/FieldGrammar.hs:554)
  1343. 187.17 s [Cabal-syntax] formatDependencyList (src/Distribution/PackageDescription/FieldGrammar.hs:794)
  1344. 187.17 s [Cabal-syntax] formatExposedModules (src/Distribution/PackageDescription/FieldGrammar.hs:803)
  1345. 187.17 s [Cabal-syntax] formatExtraSourceFiles (src/Distribution/PackageDescription/FieldGrammar.hs:800)
  1346. 187.17 s [Cabal-syntax] formatHsSourceDirs (src/Distribution/PackageDescription/FieldGrammar.hs:806)
  1347. 187.17 s [Cabal-syntax] formatMixinList (src/Distribution/PackageDescription/FieldGrammar.hs:797)
  1348. 187.18 s [Cabal-syntax] formatOtherExtensions (src/Distribution/PackageDescription/FieldGrammar.hs:809)
  1349. 187.18 s [Cabal-syntax] formatOtherModules (src/Distribution/PackageDescription/FieldGrammar.hs:812)
  1350. 187.18 s [Cabal-syntax] benchmarkStanzaBenchmarkType (src/Distribution/PackageDescription/FieldGrammar.hs:455)
  1351. 187.18 s [Cabal-syntax] benchmarkStanzaMainIs (src/Distribution/PackageDescription/FieldGrammar.hs:459)
  1352. 187.18 s [Cabal-syntax] benchmarkStanzaBenchmarkModule (src/Distribution/PackageDescription/FieldGrammar.hs:463)
  1353. 187.18 s [Cabal-syntax] benchmarkStanzaBuildInfo (src/Distribution/PackageDescription/FieldGrammar.hs:467)
  1354. 187.18 s [Cabal-syntax] flagFieldGrammar (src/Distribution/PackageDescription/FieldGrammar.hs:745)
  1355. 187.18 s [Cabal-syntax] sourceRepoFieldGrammar (src/Distribution/PackageDescription/FieldGrammar.hs:761)
  1356. 187.18 s [Cabal-syntax] setupBInfoFieldGrammar (src/Distribution/PackageDescription/FieldGrammar.hs:780)
  1357. 187.18 s [Cabal-syntax] buildInfoFieldGrammar (src/Distribution/PackageDescription/FieldGrammar.hs:572)
  1358. 188.15 s [Cabal-syntax] 100% ( 11 / 11) in 'Distribution.PackageDescription.PrettyPrint'
  1359. 188.65 s [Cabal-syntax] 90% ( 10 / 11) in 'Distribution.PackageDescription.Parsec'
  1360. 188.65 s [Cabal-syntax] Missing documentation for:
  1361. 188.65 s [Cabal-syntax] parseHookedBuildInfo (src/Distribution/PackageDescription/Parsec.hs:925)
  1362. 189.43 s [Cabal-syntax] 60% ( 3 / 5) in 'Distribution.FieldGrammar.FieldDescrs'
  1363. 189.43 s [Cabal-syntax] Missing documentation for:
  1364. 189.43 s [Cabal-syntax] Module header
  1365. 189.43 s [Cabal-syntax] fieldDescrsToList (src/Distribution/FieldGrammar/FieldDescrs.hs:54)
  1366. 189.72 s [Cabal-syntax] 0% ( 0 / 2) in 'Distribution.Types.InstalledPackageInfo.FieldGrammar'
  1367. 189.72 s [Cabal-syntax] Missing documentation for:
  1368. 189.72 s [Cabal-syntax] Module header
  1369. 189.72 s [Cabal-syntax] ipiFieldGrammar (src/Distribution/Types/InstalledPackageInfo/FieldGrammar.hs:56)
  1370. 190.74 s [Cabal-syntax] 57% ( 8 / 14) in 'Distribution.InstalledPackageInfo'
  1371. 190.74 s [Cabal-syntax] Missing documentation for:
  1372. 190.74 s [Cabal-syntax] InstalledPackageInfo (src/Distribution/Types/InstalledPackageInfo.hs:40)
  1373. 190.74 s [Cabal-syntax] installedComponentId (src/Distribution/InstalledPackageInfo.hs:65)
  1374. 190.74 s [Cabal-syntax] sourceComponentName (src/Distribution/InstalledPackageInfo.hs:88)
  1375. 190.74 s [Cabal-syntax] ExposedModule (src/Distribution/Types/ExposedModule.hs:17)
  1376. 190.74 s [Cabal-syntax] emptyInstalledPackageInfo (src/Distribution/Types/InstalledPackageInfo.hs:131)
  1377. 190.74 s [Cabal-syntax] showSimpleInstalledPackageInfoField (src/Distribution/InstalledPackageInfo.hs:137)
  1378. 191.96 s [Cabal-syntax] Warning: Distribution.Compat.MonadFail: could not find link destinations for:
  1379. 191.98 s [Cabal-syntax]
  1380. 191.98 s [Cabal-syntax] - Text.ParserCombinators.ReadP.P
  1381. 191.98 s [Cabal-syntax] Warning: Distribution.Utils.Structured: could not find link destinations for:
  1382. 191.98 s [Cabal-syntax]
  1383. 191.98 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1384. 192.02 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1385. 192.02 s [Cabal-syntax] - Distribution.Utils.Structured.GStructuredSum
  1386. 192.02 s [Cabal-syntax] - Distribution.Utils.Structured.gstructured
  1387. 192.02 s [Cabal-syntax] Warning: Distribution.Compat.Semigroup: could not find link destinations for:
  1388. 192.02 s [Cabal-syntax]
  1389. 192.10 s [Cabal-syntax] - Data.Set.Internal.MergeSet
  1390. 192.10 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1391. 192.11 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1392. 192.11 s [Cabal-syntax] - Distribution.Compat.Semigroup.GSemigroup
  1393. 192.11 s [Cabal-syntax] - Distribution.Compat.Semigroup.GMonoid
  1394. 192.11 s [Cabal-syntax] Warning: Distribution.Compat.NonEmptySet: could not find link destinations for:
  1395. 192.11 s [Cabal-syntax]
  1396. 192.11 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1397. 192.11 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1398. 192.12 s [Cabal-syntax] Warning: Distribution.Compat.Prelude: could not find link destinations for:
  1399. 192.12 s [Cabal-syntax]
  1400. 192.12 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1401. 192.14 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1402. 192.14 s [Cabal-syntax] - Data.Array.Base.numElements
  1403. 192.14 s [Cabal-syntax] - Data.Array.Base.unsafeArray
  1404. 192.14 s [Cabal-syntax] - Data.Array.Base.unsafeAt
  1405. 192.14 s [Cabal-syntax] - Data.Array.Base.unsafeReplace
  1406. 192.14 s [Cabal-syntax] - Data.Array.Base.unsafeAccum
  1407. 192.16 s [Cabal-syntax] - Data.Array.Base.unsafeAccumArray
  1408. 192.16 s [Cabal-syntax] - Data.Array.Base.getNumElements
  1409. 192.16 s [Cabal-syntax] - Data.Array.Base.unsafeNewArray_
  1410. 192.16 s [Cabal-syntax] - Data.Array.Base.unsafeRead
  1411. 192.16 s [Cabal-syntax] - Data.Array.Base.unsafeWrite
  1412. 192.18 s [Cabal-syntax] - GHC.Generics.D:R:UReckIntp0
  1413. 192.21 s [Cabal-syntax] - GHC.Generics.D:R:UReckFloatp0
  1414. 192.22 s [Cabal-syntax] - GHC.Generics.D:R:UReckCharp0
  1415. 192.23 s [Cabal-syntax] - GHC.Generics.SingKind
  1416. 192.23 s [Cabal-syntax] - GHC.Generics.fromSing
  1417. 192.23 s [Cabal-syntax] - GHC.Generics.Sing
  1418. 192.23 s [Cabal-syntax] - GHC.Generics.DemoteRep
  1419. 192.23 s [Cabal-syntax] - GHC.Generics.SingI
  1420. 192.24 s [Cabal-syntax] - GHC.Generics.sing
  1421. 192.24 s [Cabal-syntax] - GHC.Generics.D:R:SingBoola0
  1422. 192.24 s [Cabal-syntax] - GHC.Generics.STrue
  1423. 192.26 s [Cabal-syntax] - GHC.Generics.SFalse
  1424. 192.30 s [Cabal-syntax] - GHC.Generics.D:R:UReckDoublep0
  1425. 192.30 s [Cabal-syntax] - GHC.Generics.D:R:SingMaybeb0
  1426. 192.30 s [Cabal-syntax] - GHC.Generics.SNothing
  1427. 192.30 s [Cabal-syntax] - GHC.Generics.SJust
  1428. 192.88 s [Cabal-syntax] - GHC.Prim.~#
  1429. 192.89 s [Cabal-syntax] - Text.ParserCombinators.ReadP.P
  1430. 193.42 s [Cabal-syntax] - Data.Graph.SetM
  1431. 193.50 s [Cabal-syntax] - Data.Set.Internal.MergeSet
  1432. 193.50 s [Cabal-syntax] - Distribution.Compat.Semigroup.GSemigroup
  1433. 194.70 s [Cabal-syntax] - Distribution.Compat.Semigroup.GMonoid
  1434. 195.37 s [Cabal-syntax] - Distribution.Compat.Prelude.GNFData
  1435. 195.51 s [Cabal-syntax] - GHC.Generics.D:R:UReckWordp0
  1436. 195.51 s [Cabal-syntax] Warning: Distribution.Utils.ShortText: could not find link destinations for:
  1437. 195.51 s [Cabal-syntax]
  1438. 195.51 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1439. 195.52 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1440. 195.52 s [Cabal-syntax] Warning: Distribution.Types.Condition: could not find link destinations for:
  1441. 195.53 s [Cabal-syntax]
  1442. 195.53 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1443. 195.53 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1444. 195.53 s [Cabal-syntax] Warning: Distribution.PackageDescription.Quirks: could not find link destinations for:
  1445. 195.53 s [Cabal-syntax]
  1446. 195.54 s [Cabal-syntax] - Distribution.PackageDescription.Quirks.patches
  1447. 195.54 s [Cabal-syntax] Warning: Distribution.Fields.LexerMonad: could not find link destinations for:
  1448. 195.54 s [Cabal-syntax]
  1449. 195.54 s [Cabal-syntax] - Distribution.Fields.LexerMonad.StartCode
  1450. 195.54 s [Cabal-syntax] Warning: Distribution.Types.CondTree: could not find link destinations for:
  1451. 195.54 s [Cabal-syntax]
  1452. 195.54 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1453. 195.57 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1454. 195.57 s [Cabal-syntax] Warning: Distribution.CabalSpecVersion: could not find link destinations for:
  1455. 195.57 s [Cabal-syntax]
  1456. 195.57 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1457. 195.58 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1458. 195.58 s [Cabal-syntax] Warning: Distribution.Pretty: could not find link destinations for:
  1459. 195.58 s [Cabal-syntax]
  1460. 195.58 s [Cabal-syntax] - Distribution.Pretty.lines_
  1461. 195.58 s [Cabal-syntax] Warning: Distribution.Fields.Parser: could not find link destinations for:
  1462. 195.58 s [Cabal-syntax]
  1463. 195.58 s [Cabal-syntax] - Distribution.Fields.Parser.LexState'
  1464. 195.58 s [Cabal-syntax] Warning: Distribution.Utils.Path: could not find link destinations for:
  1465. 195.58 s [Cabal-syntax]
  1466. 195.58 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1467. 197.00 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1468. 197.02 s [Cabal-syntax] Warning: Distribution.Types.Version: could not find link destinations for:
  1469. 197.02 s [Cabal-syntax]
  1470. 197.02 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1471. 197.02 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1472. 197.02 s [Cabal-syntax] Warning: Distribution.Types.VersionRange.Internal: could not find link destinations for:
  1473. 197.02 s [Cabal-syntax]
  1474. 197.02 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1475. 197.03 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1476. 197.03 s [Cabal-syntax] Warning: Distribution.Types.VersionRange: could not find link destinations for:
  1477. 197.03 s [Cabal-syntax]
  1478. 197.03 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1479. 197.05 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1480. 197.05 s [Cabal-syntax] Warning: Distribution.Types.SourceRepo: could not find link destinations for:
  1481. 197.05 s [Cabal-syntax]
  1482. 197.05 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1483. 197.09 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1484. 197.09 s [Cabal-syntax] Warning: Distribution.Types.SourceRepo.Lens: could not find link destinations for:
  1485. 197.09 s [Cabal-syntax]
  1486. 197.09 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1487. 197.10 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1488. 197.10 s [Cabal-syntax] Warning: Distribution.Types.PkgconfigVersion: could not find link destinations for:
  1489. 197.10 s [Cabal-syntax]
  1490. 197.10 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1491. 197.10 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1492. 197.10 s [Cabal-syntax] Warning: Distribution.Types.PkgconfigVersionRange: could not find link destinations for:
  1493. 197.10 s [Cabal-syntax]
  1494. 197.10 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1495. 197.11 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1496. 197.12 s [Cabal-syntax] Warning: Distribution.Types.PkgconfigName: could not find link destinations for:
  1497. 197.12 s [Cabal-syntax]
  1498. 197.12 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1499. 197.13 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1500. 197.13 s [Cabal-syntax] Warning: Distribution.Types.PkgconfigDependency: could not find link destinations for:
  1501. 197.13 s [Cabal-syntax]
  1502. 197.13 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1503. 197.14 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1504. 197.14 s [Cabal-syntax] Warning: Distribution.Types.PackageName: could not find link destinations for:
  1505. 197.14 s [Cabal-syntax]
  1506. 197.14 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1507. 197.14 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1508. 197.14 s [Cabal-syntax] Warning: Distribution.Types.UnqualComponentName: could not find link destinations for:
  1509. 197.14 s [Cabal-syntax]
  1510. 197.14 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1511. 197.15 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1512. 197.16 s [Cabal-syntax] Warning: Distribution.Types.LibraryVisibility: could not find link destinations for:
  1513. 197.16 s [Cabal-syntax]
  1514. 197.16 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1515. 197.17 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1516. 197.17 s [Cabal-syntax] Warning: Distribution.Types.LibraryName: could not find link destinations for:
  1517. 197.17 s [Cabal-syntax]
  1518. 197.17 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1519. 197.17 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1520. 197.17 s [Cabal-syntax] Warning: Distribution.Types.MungedPackageName: could not find link destinations for:
  1521. 197.17 s [Cabal-syntax]
  1522. 197.18 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1523. 197.18 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1524. 197.18 s [Cabal-syntax] Warning: Distribution.Types.ForeignLibType: could not find link destinations for:
  1525. 197.18 s [Cabal-syntax]
  1526. 197.18 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1527. 197.19 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1528. 197.19 s [Cabal-syntax] Warning: Distribution.Types.ForeignLibOption: could not find link destinations for:
  1529. 197.19 s [Cabal-syntax]
  1530. 197.19 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1531. 197.20 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1532. 197.20 s [Cabal-syntax] Warning: Distribution.Types.Flag: could not find link destinations for:
  1533. 197.20 s [Cabal-syntax]
  1534. 197.20 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1535. 197.21 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1536. 197.21 s [Cabal-syntax] Warning: Distribution.Types.ExecutableScope: could not find link destinations for:
  1537. 197.21 s [Cabal-syntax]
  1538. 197.21 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1539. 197.22 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1540. 197.22 s [Cabal-syntax] Warning: Distribution.Types.ComponentName: could not find link destinations for:
  1541. 197.22 s [Cabal-syntax]
  1542. 197.22 s [Cabal-syntax] - Distribution.Types.ComponentName.NotLibComponentName
  1543. 197.22 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1544. 197.22 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1545. 197.22 s [Cabal-syntax] Warning: Distribution.Types.ComponentId: could not find link destinations for:
  1546. 197.22 s [Cabal-syntax]
  1547. 197.22 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1548. 197.24 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1549. 197.24 s [Cabal-syntax] Warning: Distribution.Types.BuildType: could not find link destinations for:
  1550. 197.24 s [Cabal-syntax]
  1551. 197.24 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1552. 197.24 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1553. 197.24 s [Cabal-syntax] Warning: Distribution.Types.AbiHash: could not find link destinations for:
  1554. 197.24 s [Cabal-syntax]
  1555. 197.25 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1556. 197.25 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1557. 197.25 s [Cabal-syntax] Warning: Distribution.System: could not find link destinations for:
  1558. 197.25 s [Cabal-syntax]
  1559. 197.25 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1560. 197.27 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1561. 197.27 s [Cabal-syntax] Warning: Distribution.SPDX.LicenseReference: could not find link destinations for:
  1562. 197.27 s [Cabal-syntax]
  1563. 197.28 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1564. 197.28 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1565. 197.28 s [Cabal-syntax] Warning: Distribution.SPDX.LicenseId: could not find link destinations for:
  1566. 197.28 s [Cabal-syntax]
  1567. 197.28 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1568. 197.30 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1569. 197.30 s [Cabal-syntax] Warning: Distribution.SPDX.LicenseExceptionId: could not find link destinations for:
  1570. 197.30 s [Cabal-syntax]
  1571. 197.30 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1572. 197.31 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1573. 197.31 s [Cabal-syntax] Warning: Distribution.SPDX.LicenseExpression: could not find link destinations for:
  1574. 197.31 s [Cabal-syntax]
  1575. 197.31 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1576. 197.33 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1577. 197.33 s [Cabal-syntax] Warning: Distribution.SPDX.License: could not find link destinations for:
  1578. 197.33 s [Cabal-syntax]
  1579. 197.33 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1580. 197.33 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1581. 197.33 s [Cabal-syntax] Warning: Distribution.SPDX: could not find link destinations for:
  1582. 197.33 s [Cabal-syntax]
  1583. 197.33 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1584. 197.41 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1585. 197.41 s [Cabal-syntax] Warning: Distribution.ModuleName: could not find link destinations for:
  1586. 197.41 s [Cabal-syntax]
  1587. 197.41 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1588. 197.42 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1589. 197.43 s [Cabal-syntax] Warning: Distribution.Types.ModuleRenaming: could not find link destinations for:
  1590. 197.43 s [Cabal-syntax]
  1591. 197.43 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1592. 197.44 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1593. 197.44 s [Cabal-syntax] Warning: Distribution.Types.IncludeRenaming: could not find link destinations for:
  1594. 197.44 s [Cabal-syntax]
  1595. 197.44 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1596. 197.44 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1597. 197.44 s [Cabal-syntax] Warning: Distribution.Types.Mixin: could not find link destinations for:
  1598. 197.44 s [Cabal-syntax]
  1599. 197.44 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1600. 197.45 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1601. 197.45 s [Cabal-syntax] Warning: Distribution.Types.ModuleReexport: could not find link destinations for:
  1602. 197.45 s [Cabal-syntax]
  1603. 197.45 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1604. 197.47 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1605. 197.48 s [Cabal-syntax] Warning: Distribution.Compat.Graph: could not find link destinations for:
  1606. 197.48 s [Cabal-syntax]
  1607. 197.48 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1608. 197.50 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1609. 197.50 s [Cabal-syntax] - Distribution.Compat.Graph.fromMap
  1610. 197.50 s [Cabal-syntax] Warning: Distribution.Version: could not find link destinations for:
  1611. 197.50 s [Cabal-syntax]
  1612. 197.50 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1613. 197.54 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1614. 197.54 s [Cabal-syntax] Warning: Distribution.Types.TestType: could not find link destinations for:
  1615. 197.54 s [Cabal-syntax]
  1616. 197.54 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1617. 197.54 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1618. 197.54 s [Cabal-syntax] Warning: Distribution.Types.TestSuiteInterface: could not find link destinations for:
  1619. 197.54 s [Cabal-syntax]
  1620. 197.54 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1621. 197.55 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1622. 197.55 s [Cabal-syntax] Warning: Distribution.Types.PackageId: could not find link destinations for:
  1623. 197.55 s [Cabal-syntax]
  1624. 197.55 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1625. 197.56 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1626. 197.56 s [Cabal-syntax] Warning: Distribution.Types.UnitId: could not find link destinations for:
  1627. 197.56 s [Cabal-syntax]
  1628. 197.56 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1629. 197.58 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1630. 197.58 s [Cabal-syntax] Warning: Distribution.Types.Module: could not find link destinations for:
  1631. 197.58 s [Cabal-syntax]
  1632. 197.58 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1633. 197.59 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1634. 197.59 s [Cabal-syntax] Warning: Distribution.Backpack: could not find link destinations for:
  1635. 197.59 s [Cabal-syntax]
  1636. 197.59 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1637. 197.63 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1638. 197.63 s [Cabal-syntax] Warning: Distribution.Types.ExposedModule: could not find link destinations for:
  1639. 197.63 s [Cabal-syntax]
  1640. 197.63 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1641. 197.63 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1642. 197.63 s [Cabal-syntax] Warning: Distribution.Types.PackageVersionConstraint: could not find link destinations for:
  1643. 197.63 s [Cabal-syntax]
  1644. 197.63 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1645. 197.64 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1646. 197.64 s [Cabal-syntax] Warning: Distribution.Types.PackageId.Lens: could not find link destinations for:
  1647. 197.64 s [Cabal-syntax]
  1648. 197.64 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1649. 197.66 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1650. 197.66 s [Cabal-syntax] Warning: Distribution.Types.MungedPackageId: could not find link destinations for:
  1651. 197.66 s [Cabal-syntax]
  1652. 197.66 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1653. 197.66 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1654. 197.66 s [Cabal-syntax] Warning: Distribution.Types.LegacyExeDependency: could not find link destinations for:
  1655. 197.66 s [Cabal-syntax]
  1656. 197.66 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1657. 197.68 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1658. 197.68 s [Cabal-syntax] Warning: Distribution.Types.ExeDependency: could not find link destinations for:
  1659. 197.68 s [Cabal-syntax]
  1660. 197.68 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1661. 197.69 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1662. 197.69 s [Cabal-syntax] Warning: Distribution.Types.Dependency: could not find link destinations for:
  1663. 197.69 s [Cabal-syntax]
  1664. 197.69 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1665. 197.71 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1666. 197.71 s [Cabal-syntax] Warning: Distribution.Types.SetupBuildInfo: could not find link destinations for:
  1667. 197.71 s [Cabal-syntax]
  1668. 197.71 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1669. 197.71 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1670. 197.71 s [Cabal-syntax] Warning: Distribution.Types.SetupBuildInfo.Lens: could not find link destinations for:
  1671. 197.71 s [Cabal-syntax]
  1672. 197.71 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1673. 197.72 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1674. 197.72 s [Cabal-syntax] Warning: Distribution.Types.BenchmarkType: could not find link destinations for:
  1675. 197.72 s [Cabal-syntax]
  1676. 197.72 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1677. 197.74 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1678. 197.74 s [Cabal-syntax] Warning: Distribution.Types.BenchmarkInterface: could not find link destinations for:
  1679. 197.74 s [Cabal-syntax]
  1680. 197.74 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1681. 197.75 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1682. 197.75 s [Cabal-syntax] Warning: Distribution.Types.AbiDependency: could not find link destinations for:
  1683. 197.75 s [Cabal-syntax]
  1684. 197.75 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1685. 197.75 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1686. 197.75 s [Cabal-syntax] Warning: Distribution.License: could not find link destinations for:
  1687. 197.75 s [Cabal-syntax]
  1688. 197.75 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1689. 197.76 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1690. 197.76 s [Cabal-syntax] Warning: Distribution.Types.InstalledPackageInfo: could not find link destinations for:
  1691. 197.76 s [Cabal-syntax]
  1692. 197.76 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1693. 197.77 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1694. 197.77 s [Cabal-syntax] Warning: Distribution.Types.InstalledPackageInfo.Lens: could not find link destinations for:
  1695. 197.77 s [Cabal-syntax]
  1696. 197.77 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1697. 197.78 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1698. 197.78 s [Cabal-syntax] Warning: Language.Haskell.Extension: could not find link destinations for:
  1699. 197.78 s [Cabal-syntax]
  1700. 197.78 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1701. 197.83 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1702. 197.83 s [Cabal-syntax] Warning: Distribution.Compiler: could not find link destinations for:
  1703. 197.83 s [Cabal-syntax]
  1704. 197.83 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1705. 197.87 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1706. 197.87 s [Cabal-syntax] Warning: Distribution.Types.ConfVar: could not find link destinations for:
  1707. 197.87 s [Cabal-syntax]
  1708. 197.87 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1709. 197.87 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1710. 197.87 s [Cabal-syntax] Warning: Distribution.Types.BuildInfo: could not find link destinations for:
  1711. 197.87 s [Cabal-syntax]
  1712. 197.87 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1713. 197.88 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1714. 197.88 s [Cabal-syntax] Warning: Distribution.Types.BuildInfo.Lens: could not find link destinations for:
  1715. 197.88 s [Cabal-syntax]
  1716. 197.88 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1717. 197.95 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1718. 197.95 s [Cabal-syntax] Warning: Distribution.Types.TestSuite: could not find link destinations for:
  1719. 197.95 s [Cabal-syntax]
  1720. 197.95 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1721. 197.96 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1722. 197.96 s [Cabal-syntax] Warning: Distribution.Types.TestSuite.Lens: could not find link destinations for:
  1723. 197.96 s [Cabal-syntax]
  1724. 197.96 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1725. 197.97 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1726. 197.98 s [Cabal-syntax] Warning: Distribution.Types.Library: could not find link destinations for:
  1727. 197.98 s [Cabal-syntax]
  1728. 197.98 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1729. 197.98 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1730. 197.99 s [Cabal-syntax] Warning: Distribution.Types.Library.Lens: could not find link destinations for:
  1731. 197.99 s [Cabal-syntax]
  1732. 197.99 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1733. 198.00 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1734. 198.00 s [Cabal-syntax] Warning: Distribution.Types.ForeignLib: could not find link destinations for:
  1735. 198.00 s [Cabal-syntax]
  1736. 198.00 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1737. 198.01 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1738. 198.01 s [Cabal-syntax] Warning: Distribution.Types.ForeignLib.Lens: could not find link destinations for:
  1739. 198.01 s [Cabal-syntax]
  1740. 198.01 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1741. 198.03 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1742. 198.03 s [Cabal-syntax] Warning: Distribution.Types.Executable: could not find link destinations for:
  1743. 198.03 s [Cabal-syntax]
  1744. 198.03 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1745. 198.04 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1746. 198.04 s [Cabal-syntax] Warning: Distribution.Types.Executable.Lens: could not find link destinations for:
  1747. 198.04 s [Cabal-syntax]
  1748. 198.04 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1749. 198.04 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1750. 198.04 s [Cabal-syntax] Warning: Distribution.Types.Benchmark: could not find link destinations for:
  1751. 198.04 s [Cabal-syntax]
  1752. 198.04 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1753. 198.05 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1754. 198.05 s [Cabal-syntax] Warning: Distribution.Types.Component: could not find link destinations for:
  1755. 198.05 s [Cabal-syntax]
  1756. 198.05 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1757. 198.05 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1758. 198.05 s [Cabal-syntax] Warning: Distribution.Types.ComponentRequestedSpec: could not find link destinations for:
  1759. 198.06 s [Cabal-syntax]
  1760. 198.06 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1761. 198.06 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1762. 198.06 s [Cabal-syntax] Warning: Distribution.Types.PackageDescription: could not find link destinations for:
  1763. 198.06 s [Cabal-syntax]
  1764. 198.06 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1765. 198.08 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1766. 198.08 s [Cabal-syntax] Warning: Distribution.Types.GenericPackageDescription: could not find link destinations for:
  1767. 198.08 s [Cabal-syntax]
  1768. 198.08 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1769. 198.08 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1770. 198.08 s [Cabal-syntax] Warning: Distribution.Types.GenericPackageDescription.Lens: could not find link destinations for:
  1771. 198.08 s [Cabal-syntax]
  1772. 198.08 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1773. 198.10 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1774. 198.10 s [Cabal-syntax] Warning: Distribution.Types.Benchmark.Lens: could not find link destinations for:
  1775. 198.10 s [Cabal-syntax]
  1776. 198.10 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1777. 198.10 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1778. 198.10 s [Cabal-syntax] Warning: Distribution.Types.PackageDescription.Lens: could not find link destinations for:
  1779. 198.11 s [Cabal-syntax]
  1780. 198.11 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1781. 198.11 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1782. 198.11 s [Cabal-syntax] Warning: Distribution.PackageDescription.Configuration: could not find link destinations for:
  1783. 198.11 s [Cabal-syntax]
  1784. 198.11 s [Cabal-syntax] - Distribution.PackageDescription.Configuration.PDTagged
  1785. 198.12 s [Cabal-syntax] - Distribution.PackageDescription.Configuration.PDNull
  1786. 198.12 s [Cabal-syntax] Warning: Distribution.PackageDescription.FieldGrammar: could not find link destinations for:
  1787. 198.12 s [Cabal-syntax]
  1788. 198.12 s [Cabal-syntax] - Distribution.PackageDescription.FieldGrammar._syntaxFieldNames
  1789. 198.12 s [Cabal-syntax] - Distribution.PackageDescription.FieldGrammar._syntaxExtensions
  1790. 198.12 s [Cabal-syntax] Warning: Distribution.PackageDescription.Parsec: could not find link destinations for:
  1791. 198.12 s [Cabal-syntax]
  1792. 198.12 s [Cabal-syntax] - Distribution.PackageDescription.Parsec.sectionizeFields
  1793. 198.12 s [Cabal-syntax] Warning: Distribution.Types.InstalledPackageInfo.FieldGrammar: could not find link destinations for:
  1794. 198.12 s [Cabal-syntax]
  1795. 198.12 s [Cabal-syntax] - Distribution.Types.InstalledPackageInfo.FieldGrammar.Basic
  1796. 198.12 s [Cabal-syntax] - Distribution.Types.InstalledPackageInfo.FieldGrammar.CompatPackageKey
  1797. 198.12 s [Cabal-syntax] - Distribution.Types.InstalledPackageInfo.FieldGrammar.ExposedModules
  1798. 198.12 s [Cabal-syntax] - Distribution.Types.InstalledPackageInfo.FieldGrammar.InstWith
  1799. 198.12 s [Cabal-syntax] - Distribution.Types.InstalledPackageInfo.FieldGrammar.SpecLicenseLenient
  1800. 198.12 s [Cabal-syntax] Warning: Distribution.InstalledPackageInfo: could not find link destinations for:
  1801. 198.12 s [Cabal-syntax]
  1802. 198.12 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1803. 198.12 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1804. 246.98 s [Cabal-syntax] Documentation created: dist/doc/html/Cabal-syntax/index.html,
  1805. 246.98 s [Cabal-syntax] dist/doc/html/Cabal-syntax/Cabal-syntax.txt
  1806. 247.36 s [Cabal-syntax] haddockPhase completed in 1 minutes 37 seconds
  1807. 247.37 s [Cabal-syntax] Phase: installPhase
  1808. 248.01 s [Cabal-syntax] Installing library in /nix/store/4h9a4k3xbwh0l3853a9mlzrfbbzib1la-Cabal-syntax-3.12.1.0/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP
  1809. 260.46 s [Cabal-syntax] Phase: fixupPhase
  1810. 260.55 s [Cabal-syntax] shrinking RPATHs of ELF executables and libraries in /nix/store/4h9a4k3xbwh0l3853a9mlzrfbbzib1la-Cabal-syntax-3.12.1.0
  1811. 260.69 s [Cabal-syntax] shrinking /nix/store/4h9a4k3xbwh0l3853a9mlzrfbbzib1la-Cabal-syntax-3.12.1.0/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/libHSCabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP-ghc9.4.8.so
  1812. 260.80 s [Cabal-syntax] checking for references to /build/ in /nix/store/4h9a4k3xbwh0l3853a9mlzrfbbzib1la-Cabal-syntax-3.12.1.0...
  1813. 261.11 s [Cabal-syntax] patching script interpreter paths in /nix/store/4h9a4k3xbwh0l3853a9mlzrfbbzib1la-Cabal-syntax-3.12.1.0
  1814. 261.13 s [Cabal-syntax] stripping (with command strip and flags -S -p) in /nix/store/4h9a4k3xbwh0l3853a9mlzrfbbzib1la-Cabal-syntax-3.12.1.0/lib
  1815. 268.01 s [Cabal-syntax] shrinking RPATHs of ELF executables and libraries in /nix/store/q6w2fw2907xvc63b2xc4im1afq7kkqjs-Cabal-syntax-3.12.1.0-doc
  1816. 268.11 s [Cabal-syntax] checking for references to /build/ in /nix/store/q6w2fw2907xvc63b2xc4im1afq7kkqjs-Cabal-syntax-3.12.1.0-doc...
  1817. 268.29 s [Cabal-syntax] patching script interpreter paths in /nix/store/q6w2fw2907xvc63b2xc4im1afq7kkqjs-Cabal-syntax-3.12.1.0-doc
  1818. 269.56 s [Cabal-syntax:post-build] Uploading to cachix cache "sellout": /nix/store/4h9a4k3xbwh0l3853a9mlzrfbbzib1la-Cabal-syntax-3.12.1.0 /nix/store/q6w2fw2907xvc63b2xc4im1afq7kkqjs-Cabal-syntax-3.12.1.0-doc
  1819. 270.52 s [Cabal-syntax:post-build] Nothing to push - all store paths are already on Cachix.
  1820. 270.64 s [Cabal-syntax:post-build] Uploading to the NixCI cache: /nix/store/4h9a4k3xbwh0l3853a9mlzrfbbzib1la-Cabal-syntax-3.12.1.0 /nix/store/q6w2fw2907xvc63b2xc4im1afq7kkqjs-Cabal-syntax-3.12.1.0-doc
  1821. 271.07 s [Cabal-syntax:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  1822. 271.40 s [Cabal-syntax:post-build] copying 1 paths...
  1823. 271.40 s [Cabal-syntax:post-build] copying path '/nix/store/4h9a4k3xbwh0l3853a9mlzrfbbzib1la-Cabal-syntax-3.12.1.0' to 'https://cache.nix-ci.com'...
  1824. 364.39 s [Cabal-syntax:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  1825. 364.59 s [Cabal-syntax:post-build] copying 0 paths...
  1826. 364.67 s Progress: 1 of 22 built, 161 of 161 downloaded from cache
  1827. 364.77 s Building /nix/store/4pzd4vbqgm1g9m847p54xi2bxmajw4cr-Cabal-3.12.1.0.drv
  1828. 364.90 s [Cabal] Phase: setupCompilerEnvironmentPhase
  1829. 364.91 s [Cabal] Build with /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8.
  1830. 365.29 s [Cabal] Phase: unpackPhase
  1831. 365.31 s [Cabal] unpacking source archive /nix/store/i3lr7fx8fqyzvck858q213704kxk29dd-Cabal-3.12.1.0.tar.gz
  1832. 365.37 s [Cabal] source root is Cabal-3.12.1.0
  1833. 365.39 s [Cabal] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "Cabal-3.12.1.0/src/Distribution/ZinzaPrelude.hs"
  1834. 365.41 s [Cabal] Phase: patchPhase
  1835. 365.43 s [Cabal] Phase: compileBuildDriverPhase
  1836. 365.44 s [Cabal] setupCompileFlags: -package-db=/build/tmp.CJlZPFkPUS/setup-package.conf.d -threaded
  1837. 365.62 s [Cabal] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.CJlZPFkPUS/Main.o )
  1838. 365.85 s [Cabal] [2 of 2] Linking Setup
  1839. 369.05 s [Cabal] Phase: updateAutotoolsGnuConfigScriptsPhase
  1840. 369.07 s [Cabal] Phase: configurePhase
  1841. 369.08 s [Cabal] configureFlags: --verbose --prefix=/nix/store/ffjdnzr7rz0imc9d8qsw1p044mfghgvs-Cabal-3.12.1.0 --libdir=$prefix/lib/$compiler --libsubdir=$abi/$libname --docdir=/nix/store/zlcvgfn7i0v30gr3rcp2ln3fhcfw9n3p-Cabal-3.12.1.0-doc/share/doc/Cabal-3.12.1.0 --with-gcc=gcc --package-db=/build/tmp.CJlZPFkPUS/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/ffyzkisqs4vc4mg28bwwlyqjf8i9ph6b-ncurses-6.5/lib --extra-lib-dirs=/nix/store/n28qgdj8c1q41kf7n4y1jxa6ckp85m3c-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/hi0ar880110k6jsmmili7dh1gq3cg2a9-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/g09cflpnp4g80q56sj9dng1qzv4v4ybc-numactl-2.0.18/lib
  1842. 370.08 s [Cabal] Using Parsec parser
  1843. 370.08 s [Cabal] Configuring Cabal-3.12.1.0...
  1844. 370.08 s [Cabal] Dependency Cabal-syntax >=3.12.1.0 && <3.13: using Cabal-syntax-3.12.1.0
  1845. 370.10 s [Cabal] Dependency array >=0.4.0.1 && <0.6: using array-0.5.4.0
  1846. 370.10 s [Cabal] Dependency base >=4.11 && <5: using base-4.17.2.1
  1847. 370.10 s [Cabal] Dependency bytestring >=0.10.0.0 && <0.13: using bytestring-0.11.5.3
  1848. 370.10 s [Cabal] Dependency containers >=0.5.0.0 && <0.8: using containers-0.6.7
  1849. 370.10 s [Cabal] Dependency deepseq >=1.3.0.1 && <1.6: using deepseq-1.4.8.0
  1850. 370.10 s [Cabal] Dependency directory >=1.2 && <1.4: using directory-1.3.7.1
  1851. 370.10 s [Cabal] Dependency filepath >=1.3.0.1 && <1.6: using filepath-1.4.2.2
  1852. 370.10 s [Cabal] Dependency mtl >=2.1 && <2.4: using mtl-2.2.2
  1853. 370.10 s [Cabal] Dependency parsec >=3.1.13.0 && <3.2: using parsec-3.1.16.1
  1854. 370.10 s [Cabal] Dependency pretty >=1.1.1 && <1.2: using pretty-1.1.3.6
  1855. 370.10 s [Cabal] Dependency process >=1.2.1.0 && <1.7: using process-1.6.18.0
  1856. 370.10 s [Cabal] Dependency time >=1.4.0.1 && <1.15: using time-1.12.2
  1857. 370.10 s [Cabal] Dependency transformers >=0.3 && <0.4 || >=0.4.1.0 && <0.7: using
  1858. 370.10 s [Cabal] transformers-0.5.6.2
  1859. 370.10 s [Cabal] Dependency unix >=2.6.0.0 && <2.9: using unix-2.7.3
  1860. 370.43 s [Cabal] Source component graph: component lib
  1861. 370.43 s [Cabal] Configured component graph:
  1862. 370.43 s [Cabal] component Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN
  1863. 370.43 s [Cabal] include Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP
  1864. 370.43 s [Cabal] include array-0.5.4.0
  1865. 370.43 s [Cabal] include base-4.17.2.1
  1866. 370.43 s [Cabal] include bytestring-0.11.5.3
  1867. 370.43 s [Cabal] include containers-0.6.7
  1868. 370.43 s [Cabal] include deepseq-1.4.8.0
  1869. 370.43 s [Cabal] include directory-1.3.7.1
  1870. 370.43 s [Cabal] include filepath-1.4.2.2
  1871. 370.43 s [Cabal] include mtl-2.2.2
  1872. 370.43 s [Cabal] include parsec-3.1.16.1
  1873. 370.43 s [Cabal] include pretty-1.1.3.6
  1874. 370.43 s [Cabal] include process-1.6.18.0
  1875. 370.43 s [Cabal] include time-1.12.2
  1876. 370.43 s [Cabal] include transformers-0.5.6.2
  1877. 370.43 s [Cabal] include unix-2.7.3
  1878. 370.43 s [Cabal] Linked component graph:
  1879. 370.43 s [Cabal] unit Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN
  1880. 370.43 s [Cabal] include Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP
  1881. 370.43 s [Cabal] include array-0.5.4.0
  1882. 370.43 s [Cabal] include base-4.17.2.1
  1883. 370.43 s [Cabal] include bytestring-0.11.5.3
  1884. 370.43 s [Cabal] include containers-0.6.7
  1885. 370.43 s [Cabal] include deepseq-1.4.8.0
  1886. 370.43 s [Cabal] include directory-1.3.7.1
  1887. 370.43 s [Cabal] include filepath-1.4.2.2
  1888. 370.43 s [Cabal] include mtl-2.2.2
  1889. 370.43 s [Cabal] include parsec-3.1.16.1
  1890. 370.43 s [Cabal] include pretty-1.1.3.6
  1891. 370.43 s [Cabal] include process-1.6.18.0
  1892. 370.43 s [Cabal] include time-1.12.2
  1893. 370.43 s [Cabal] include transformers-0.5.6.2
  1894. 370.43 s [Cabal] include unix-2.7.3
  1895. 370.86 s [Cabal] Distribution.Backpack=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Backpack,Distribution.Backpack.ComponentsGraph=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Backpack.ComponentsGraph,Distribution.Backpack.Configure=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Backpack.Configure,Distribution.Backpack.ConfiguredComponent=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Backpack.ConfiguredComponent,Distribution.Backpack.DescribeUnitId=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Backpack.DescribeUnitId,Distribution.Backpack.FullUnitId=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Backpack.FullUnitId,Distribution.Backpack.LinkedComponent=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Backpack.LinkedComponent,Distribution.Backpack.ModSubst=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Backpack.ModSubst,Distribution.Backpack.ModuleShape=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Backpack.ModuleShape,Distribution.Backpack.PreModuleShape=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Backpack.PreModuleShape,Distribution.CabalSpecVersion=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.CabalSpecVersion,Distribution.Compat.Binary=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Compat.Binary,Distribution.Compat.CharParsing=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Compat.CharParsing,Distribution.Compat.CreatePipe=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Compat.CreatePipe,Distribution.Compat.DList=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Compat.DList,Distribution.Compat.Directory=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Compat.Directory,Distribution.Compat.Environment=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Compat.Environment,Distribution.Compat.Exception=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Compat.Exception,Distribution.Compat.FilePath=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Compat.FilePath,Distribution.Compat.Graph=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Compat.Graph,Distribution.Compat.Internal.TempFile=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Compat.Internal.TempFile,Distribution.Compat.Lens=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Compat.Lens,Distribution.Compat.MonadFail=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Compat.MonadFail,Distribution.Compat.Newtype=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Compat.Newtype,Distribution.Compat.NonEmptySet=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Compat.NonEmptySet,Distribution.Compat.Parsing=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Compat.Parsing,Distribution.Compat.Prelude=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Compat.Prelude,Distribution.Compat.Prelude.Internal=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Compat.Prelude.Internal,Distribution.Compat.Process=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Compat.Process,Distribution.Compat.ResponseFile=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Compat.ResponseFile,Distribution.Compat.Semigroup=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Compat.Semigroup,Distribution.Compat.Stack=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Compat.Stack,Distribution.Compat.Time=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Compat.Time,Distribution.Compat.Typeable=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Compat.Typeable,Distribution.Compiler=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Compiler,Distribution.FieldGrammar=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.FieldGrammar,Distribution.FieldGrammar.Class=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.FieldGrammar.Class,Distribution.FieldGrammar.FieldDescrs=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.FieldGrammar.FieldDescrs,Distribution.FieldGrammar.Newtypes=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.FieldGrammar.Newtypes,Distribution.FieldGrammar.Parsec=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.FieldGrammar.Parsec,Distribution.FieldGrammar.Pretty=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.FieldGrammar.Pretty,Distribution.Fields=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Fields,Distribution.Fields.ConfVar=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Fields.ConfVar,Distribution.Fields.Field=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Fields.Field,Distribution.Fields.Lexer=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Fields.Lexer,Distribution.Fields.LexerMonad=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Fields.LexerMonad,Distribution.Fields.ParseResult=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Fields.ParseResult,Distribution.Fields.Parser=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Fields.Parser,Distribution.Fields.Pretty=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Fields.Pretty,Distribution.InstalledPackageInfo=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.InstalledPackageInfo,Distribution.License=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.License,Distribution.Make=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Make,Distribution.ModuleName=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.ModuleName,Distribution.Package=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Package,Distribution.PackageDescription=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.PackageDescription,Distribution.PackageDescription.Check=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.PackageDescription.Check,Distribution.PackageDescription.Configuration=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.PackageDescription.Configuration,Distribution.PackageDescription.FieldGrammar=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.PackageDescription.FieldGrammar,Distribution.PackageDescription.Parsec=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.PackageDescription.Parsec,Distribution.PackageDescription.PrettyPrint=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.PackageDescription.PrettyPrint,Distribution.PackageDescription.Quirks=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.PackageDescription.Quirks,Distribution.PackageDescription.Utils=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.PackageDescription.Utils,Distribution.Parsec=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Parsec,Distribution.Parsec.Error=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Parsec.Error,Distribution.Parsec.FieldLineStream=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Parsec.FieldLineStream,Distribution.Parsec.Position=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Parsec.Position,Distribution.Parsec.Warning=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Parsec.Warning,Distribution.Pretty=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Pretty,Distribution.ReadE=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.ReadE,Distribution.SPDX=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.SPDX,Distribution.SPDX.License=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.SPDX.License,Distribution.SPDX.LicenseExceptionId=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.SPDX.LicenseExceptionId,Distribution.SPDX.LicenseExpression=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.SPDX.LicenseExpression,Distribution.SPDX.LicenseId=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.SPDX.LicenseId,Distribution.SPDX.LicenseListVersion=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.SPDX.LicenseListVersion,Distribution.SPDX.LicenseReference=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.SPDX.LicenseReference,Distribution.Simple=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple,Distribution.Simple.Bench=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.Bench,Distribution.Simple.Build=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.Build,Distribution.Simple.Build.Inputs=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.Build.Inputs,Distribution.Simple.Build.Macros=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.Build.Macros,Distribution.Simple.Build.PackageInfoModule=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.Build.PackageInfoModule,Distribution.Simple.Build.PathsModule=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.Build.PathsModule,Distribution.Simple.BuildPaths=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.BuildPaths,Distribution.Simple.BuildTarget=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.BuildTarget,Distribution.Simple.BuildToolDepends=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.BuildToolDepends,Distribution.Simple.CCompiler=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.CCompiler,Distribution.Simple.Command=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.Command,Distribution.Simple.Compiler=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.Compiler,Distribution.Simple.Configure=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.Configure,Distribution.Simple.Errors=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.Errors,Distribution.Simple.Flag=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.Flag,Distribution.Simple.GHC=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.GHC,Distribution.Simple.GHCJS=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.GHCJS,Distribution.Simple.Glob=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.Glob,Distribution.Simple.Glob.Internal=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.Glob.Internal,Distribution.Simple.Haddock=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.Haddock,Distribution.Simple.HaskellSuite=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.HaskellSuite,Distribution.Simple.Hpc=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.Hpc,Distribution.Simple.Install=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.Install,Distribution.Simple.InstallDirs=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.InstallDirs,Distribution.Simple.InstallDirs.Internal=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.InstallDirs.Internal,Distribution.Simple.LocalBuildInfo=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.LocalBuildInfo,Distribution.Simple.PackageDescription=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.PackageDescription,Distribution.Simple.PackageIndex=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.PackageIndex,Distribution.Simple.PreProcess=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.PreProcess,Distribution.Simple.PreProcess.Types=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.PreProcess.Types,Distribution.Simple.PreProcess.Unlit=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.PreProcess.Unlit,Distribution.Simple.Program=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.Program,Distribution.Simple.Program.Ar=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.Program.Ar,Distribution.Simple.Program.Builtin=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.Program.Builtin,Distribution.Simple.Program.Db=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.Program.Db,Distribution.Simple.Program.Find=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.Program.Find,Distribution.Simple.Program.GHC=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.Program.GHC,Distribution.Simple.Program.HcPkg=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.Program.HcPkg,Distribution.Simple.Program.Hpc=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.Program.Hpc,Distribution.Simple.Program.Internal=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.Program.Internal,Distribution.Simple.Program.Ld=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.Program.Ld,Distribution.Simple.Program.ResponseFile=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.Program.ResponseFile,Distribution.Simple.Program.Run=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.Program.Run,Distribution.Simple.Program.Script=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.Program.Script,Distribution.Simple.Program.Strip=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.Program.Strip,Distribution.Simple.Program.Types=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.Program.Types,Distribution.Simple.Register=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.Register,Distribution.Simple.Setup=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.Setup,Distribution.Simple.ShowBuildInfo=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.ShowBuildInfo,Distribution.Simple.SrcDist=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.SrcDist,Distribution.Simple.Test=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.Test,Distribution.Simple.Test.ExeV10=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.Test.ExeV10,Distribution.Simple.Test.LibV09=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.Test.LibV09,Distribution.Simple.Test.Log=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.Test.Log,Distribution.Simple.UHC=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.UHC,Distribution.Simple.UserHooks=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.UserHooks,Distribution.Simple.Utils=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Simple.Utils,Distribution.System=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.System,Distribution.TestSuite=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.TestSuite,Distribution.Text=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Text,Distribution.Types.AbiDependency=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.AbiDependency,Distribution.Types.AbiHash=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.AbiHash,Distribution.Types.AnnotatedId=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Types.AnnotatedId,Distribution.Types.Benchmark=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.Benchmark,Distribution.Types.Benchmark.Lens=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.Benchmark.Lens,Distribution.Types.BenchmarkInterface=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.BenchmarkInterface,Distribution.Types.BenchmarkType=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.BenchmarkType,Distribution.Types.BuildInfo=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.BuildInfo,Distribution.Types.BuildInfo.Lens=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.BuildInfo.Lens,Distribution.Types.BuildType=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.BuildType,Distribution.Types.Component=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.Component,Distribution.Types.ComponentId=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.ComponentId,Distribution.Types.ComponentInclude=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Types.ComponentInclude,Distribution.Types.ComponentLocalBuildInfo=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Types.ComponentLocalBuildInfo,Distribution.Types.ComponentName=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.ComponentName,Distribution.Types.ComponentRequestedSpec=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.ComponentRequestedSpec,Distribution.Types.CondTree=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.CondTree,Distribution.Types.Condition=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.Condition,Distribution.Types.ConfVar=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.ConfVar,Distribution.Types.Dependency=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.Dependency,Distribution.Types.DependencyMap=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.DependencyMap,Distribution.Types.DumpBuildInfo=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Types.DumpBuildInfo,Distribution.Types.ExeDependency=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.ExeDependency,Distribution.Types.Executable=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.Executable,Distribution.Types.Executable.Lens=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.Executable.Lens,Distribution.Types.ExecutableScope=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.ExecutableScope,Distribution.Types.ExposedModule=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.ExposedModule,Distribution.Types.Flag=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.Flag,Distribution.Types.ForeignLib=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.ForeignLib,Distribution.Types.ForeignLib.Lens=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.ForeignLib.Lens,Distribution.Types.ForeignLibOption=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.ForeignLibOption,Distribution.Types.ForeignLibType=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.ForeignLibType,Distribution.Types.GenericPackageDescription=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.GenericPackageDescription,Distribution.Types.GenericPackageDescription.Lens=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.GenericPackageDescription.Lens,Distribution.Types.GivenComponent=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Types.GivenComponent,Distribution.Types.HookedBuildInfo=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.HookedBuildInfo,Distribution.Types.IncludeRenaming=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.IncludeRenaming,Distribution.Types.InstalledPackageInfo=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.InstalledPackageInfo,Distribution.Types.InstalledPackageInfo.FieldGrammar=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.InstalledPackageInfo.FieldGrammar,Distribution.Types.InstalledPackageInfo.Lens=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.InstalledPackageInfo.Lens,Distribution.Types.LegacyExeDependency=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.LegacyExeDependency,Distribution.Types.Lens=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.Lens,Distribution.Types.Library=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.Library,Distribution.Types.Library.Lens=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.Library.Lens,Distribution.Types.LibraryName=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.LibraryName,Distribution.Types.LibraryVisibility=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.LibraryVisibility,Distribution.Types.LocalBuildConfig=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Types.LocalBuildConfig,Distribution.Types.LocalBuildInfo=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Types.LocalBuildInfo,Distribution.Types.Mixin=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.Mixin,Distribution.Types.Module=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.Module,Distribution.Types.ModuleReexport=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.ModuleReexport,Distribution.Types.ModuleRenaming=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.ModuleRenaming,Distribution.Types.MungedPackageId=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.MungedPackageId,Distribution.Types.MungedPackageName=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.MungedPackageName,Distribution.Types.PackageDescription=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.PackageDescription,Distribution.Types.PackageDescription.Lens=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.PackageDescription.Lens,Distribution.Types.PackageId=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.PackageId,Distribution.Types.PackageId.Lens=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.PackageId.Lens,Distribution.Types.PackageName=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.PackageName,Distribution.Types.PackageName.Magic=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Types.PackageName.Magic,Distribution.Types.PackageVersionConstraint=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.PackageVersionConstraint,Distribution.Types.ParStrat=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Types.ParStrat,Distribution.Types.PkgconfigDependency=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.PkgconfigDependency,Distribution.Types.PkgconfigName=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.PkgconfigName,Distribution.Types.PkgconfigVersion=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.PkgconfigVersion,Distribution.Types.PkgconfigVersionRange=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.PkgconfigVersionRange,Distribution.Types.SetupBuildInfo=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.SetupBuildInfo,Distribution.Types.SetupBuildInfo.Lens=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.SetupBuildInfo.Lens,Distribution.Types.SourceRepo=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.SourceRepo,Distribution.Types.SourceRepo.Lens=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.SourceRepo.Lens,Distribution.Types.TargetInfo=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Types.TargetInfo,Distribution.Types.TestSuite=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.TestSuite,Distribution.Types.TestSuite.Lens=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.TestSuite.Lens,Distribution.Types.TestSuiteInterface=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.TestSuiteInterface,Distribution.Types.TestType=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.TestType,Distribution.Types.UnitId=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.UnitId,Distribution.Types.UnqualComponentName=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.UnqualComponentName,Distribution.Types.Version=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.Version,Distribution.Types.VersionInterval=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.VersionInterval,Distribution.Types.VersionInterval.Legacy=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.VersionInterval.Legacy,Distribution.Types.VersionRange=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.VersionRange,Distribution.Types.VersionRange.Internal=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Types.VersionRange.Internal,Distribution.Utils.Base62=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Utils.Base62,Distribution.Utils.Generic=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Utils.Generic,Distribution.Utils.IOData=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Utils.IOData,Distribution.Utils.Json=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Utils.Json,Distribution.Utils.LogProgress=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Utils.LogProgress,Distribution.Utils.MD5=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Utils.MD5,Distribution.Utils.MapAccum=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Utils.MapAccum,Distribution.Utils.NubList=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Utils.NubList,Distribution.Utils.Path=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Utils.Path,Distribution.Utils.Progress=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Utils.Progress,Distribution.Utils.ShortText=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Utils.ShortText,Distribution.Utils.String=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Utils.String,Distribution.Utils.Structured=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Utils.Structured,Distribution.Verbosity=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Verbosity,Distribution.Verbosity.Internal=Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN:Distribution.Verbosity.Internal,Distribution.Version=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Distribution.Version,Language.Haskell.Extension=Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP:Language.Haskell.Extension
  1896. 370.86 s [Cabal] Ready component graph:
  1897. 370.86 s [Cabal] definite Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN
  1898. 370.86 s [Cabal] depends Cabal-syntax-3.12.1.0-Evmzu0P62KB9mMsSC0P1hP
  1899. 370.86 s [Cabal] depends array-0.5.4.0
  1900. 370.86 s [Cabal] depends base-4.17.2.1
  1901. 370.86 s [Cabal] depends bytestring-0.11.5.3
  1902. 370.86 s [Cabal] depends containers-0.6.7
  1903. 370.86 s [Cabal] depends deepseq-1.4.8.0
  1904. 370.86 s [Cabal] depends directory-1.3.7.1
  1905. 370.86 s [Cabal] depends filepath-1.4.2.2
  1906. 370.86 s [Cabal] depends mtl-2.2.2
  1907. 370.86 s [Cabal] depends parsec-3.1.16.1
  1908. 370.86 s [Cabal] depends pretty-1.1.3.6
  1909. 370.86 s [Cabal] depends process-1.6.18.0
  1910. 370.86 s [Cabal] depends time-1.12.2
  1911. 370.86 s [Cabal] depends transformers-0.5.6.2
  1912. 370.86 s [Cabal] depends unix-2.7.3
  1913. 370.86 s [Cabal] Using Cabal-3.8.1.0 compiled by ghc-9.4
  1914. 370.86 s [Cabal] Using compiler: ghc-9.4.8
  1915. 370.86 s [Cabal] Using install prefix:
  1916. 370.86 s [Cabal] /nix/store/ffjdnzr7rz0imc9d8qsw1p044mfghgvs-Cabal-3.12.1.0
  1917. 370.86 s [Cabal] Executables installed in:
  1918. 370.86 s [Cabal] /nix/store/ffjdnzr7rz0imc9d8qsw1p044mfghgvs-Cabal-3.12.1.0/bin
  1919. 370.86 s [Cabal] Libraries installed in:
  1920. 370.86 s [Cabal] /nix/store/ffjdnzr7rz0imc9d8qsw1p044mfghgvs-Cabal-3.12.1.0/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN
  1921. 370.86 s [Cabal] Dynamic Libraries installed in:
  1922. 370.86 s [Cabal] /nix/store/ffjdnzr7rz0imc9d8qsw1p044mfghgvs-Cabal-3.12.1.0/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8
  1923. 370.86 s [Cabal] Private executables installed in:
  1924. 370.86 s [Cabal] /nix/store/ffjdnzr7rz0imc9d8qsw1p044mfghgvs-Cabal-3.12.1.0/libexec/x86_64-linux-ghc-9.4.8/Cabal-3.12.1.0
  1925. 370.86 s [Cabal] Data files installed in:
  1926. 370.86 s [Cabal] /nix/store/ffjdnzr7rz0imc9d8qsw1p044mfghgvs-Cabal-3.12.1.0/share/x86_64-linux-ghc-9.4.8/Cabal-3.12.1.0
  1927. 370.86 s [Cabal] Documentation installed in:
  1928. 370.86 s [Cabal] /nix/store/zlcvgfn7i0v30gr3rcp2ln3fhcfw9n3p-Cabal-3.12.1.0-doc/share/doc/Cabal-3.12.1.0
  1929. 370.86 s [Cabal] Configuration files installed in:
  1930. 370.86 s [Cabal] /nix/store/ffjdnzr7rz0imc9d8qsw1p044mfghgvs-Cabal-3.12.1.0/etc
  1931. 370.86 s [Cabal] No alex found
  1932. 370.86 s [Cabal] Using ar found on system at:
  1933. 370.86 s [Cabal] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  1934. 370.86 s [Cabal] No c2hs found
  1935. 370.86 s [Cabal] No cpphs found
  1936. 370.86 s [Cabal] No doctest found
  1937. 370.86 s [Cabal] Using gcc version 14.3.0 given by user at:
  1938. 370.86 s [Cabal] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  1939. 370.86 s [Cabal] Using ghc version 9.4.8 found on system at:
  1940. 370.86 s [Cabal] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/ghc
  1941. 370.86 s [Cabal] Using ghc-pkg version 9.4.8 found on system at:
  1942. 370.86 s [Cabal] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/ghc-pkg-9.4.8
  1943. 370.86 s [Cabal] No ghcjs found
  1944. 370.86 s [Cabal] No ghcjs-pkg found
  1945. 370.86 s [Cabal] No greencard found
  1946. 370.86 s [Cabal] Using haddock version 2.27.0 found on system at:
  1947. 370.86 s [Cabal] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/haddock-ghc-9.4.8
  1948. 370.86 s [Cabal] No happy found
  1949. 370.86 s [Cabal] Using haskell-suite found on system at: haskell-suite-dummy-location
  1950. 370.86 s [Cabal] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  1951. 370.86 s [Cabal] No hmake found
  1952. 370.86 s [Cabal] Using hpc version 0.68 found on system at:
  1953. 370.86 s [Cabal] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/hpc
  1954. 370.86 s [Cabal] Using hsc2hs version 0.68.8 found on system at:
  1955. 370.86 s [Cabal] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/hsc2hs
  1956. 370.86 s [Cabal] Using hscolour version 1.25 found on system at:
  1957. 370.86 s [Cabal] /nix/store/87hdxxa93g58b2w9ylr2idn2a40i3fdc-hscolour-1.25/bin/HsColour
  1958. 370.86 s [Cabal] No jhc found
  1959. 370.86 s [Cabal] Using ld found on system at:
  1960. 370.86 s [Cabal] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ld.gold
  1961. 370.86 s [Cabal] No pkg-config found
  1962. 370.87 s [Cabal] Using runghc version 9.4.8 found on system at:
  1963. 370.87 s [Cabal] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/runghc-9.4.8
  1964. 370.87 s [Cabal] Using strip version 2.44 found on system at:
  1965. 370.87 s [Cabal] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  1966. 370.87 s [Cabal] Using tar found on system at:
  1967. 370.87 s [Cabal] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  1968. 370.87 s [Cabal] No uhc found
  1969. 370.88 s [Cabal] Phase: buildPhase
  1970. 371.13 s [Cabal] Preprocessing library for Cabal-3.12.1.0..
  1971. 371.18 s [Cabal] Building library for Cabal-3.12.1.0..
  1972. 373.63 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 )
  1973. 377.59 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 )
  1974. 377.61 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 )
  1975. 377.61 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 )
  1976. 378.89 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 )
  1977. 379.58 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 )
  1978. 379.58 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 )
  1979. 379.58 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 )
  1980. 379.58 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 )
  1981. 379.58 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 )
  1982. 379.58 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 )
  1983. 379.58 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 )
  1984. 379.58 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 )
  1985. 379.58 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 )
  1986. 379.58 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 )
  1987. 379.58 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 )
  1988. 379.58 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 )
  1989. 379.58 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 )
  1990. 379.58 s [Cabal] [ 19 of 146] Compiling Distribution.GetOpt ( src/Distribution/GetOpt.hs, dist/build/Distribution/GetOpt.o, dist/build/Distribution/GetOpt.dyn_o )
  1991. 379.58 s [Cabal] [ 20 of 146] Compiling Distribution.Lex ( src/Distribution/Lex.hs, dist/build/Distribution/Lex.o, dist/build/Distribution/Lex.dyn_o )
  1992. 379.58 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 )
  1993. 387.31 s [Cabal] [ 22 of 146] Compiling Distribution.ReadE ( src/Distribution/ReadE.hs, dist/build/Distribution/ReadE.o, dist/build/Distribution/ReadE.dyn_o )
  1994. 387.34 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 )
  1995. 387.34 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 )
  1996. 387.34 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 )
  1997. 387.34 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 )
  1998. 387.34 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 )
  1999. 387.34 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 )
  2000. 387.34 s [Cabal] [ 29 of 146] Compiling Distribution.TestSuite ( src/Distribution/TestSuite.hs, dist/build/Distribution/TestSuite.o, dist/build/Distribution/TestSuite.dyn_o )
  2001. 387.34 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 )
  2002. 387.34 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 )
  2003. 387.34 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 )
  2004. 387.34 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 )
  2005. 387.34 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 )
  2006. 387.34 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 )
  2007. 387.34 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 )
  2008. 387.34 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 )
  2009. 387.34 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 )
  2010. 387.34 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 )
  2011. 387.34 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 )
  2012. 387.34 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 )
  2013. 387.34 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 )
  2014. 387.34 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 )
  2015. 387.34 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 )
  2016. 387.34 s [Cabal] [ 45 of 146] Compiling Distribution.Verbosity ( src/Distribution/Verbosity.hs, dist/build/Distribution/Verbosity.o, dist/build/Distribution/Verbosity.dyn_o )
  2017. 387.34 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 )
  2018. 387.34 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 )
  2019. 387.34 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 )
  2020. 387.40 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 )
  2021. 387.67 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 )
  2022. 387.67 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 )
  2023. 387.67 s [Cabal] [ 52 of 146] Compiling Distribution.ZinzaPrelude ( src/Distribution/ZinzaPrelude.hs, dist/build/Distribution/ZinzaPrelude.o, dist/build/Distribution/ZinzaPrelude.dyn_o )
  2024. 387.67 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 )
  2025. 387.67 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 )
  2026. 387.67 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 )
  2027. 387.67 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 )
  2028. 387.67 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 )
  2029. 390.59 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 )
  2030. 391.51 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 )
  2031. 391.51 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 )
  2032. 391.66 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 )
  2033. 391.98 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 )
  2034. 391.98 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 )
  2035. 391.98 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 )
  2036. 391.98 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 )
  2037. 396.20 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 )
  2038. 396.22 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 )
  2039. 396.22 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 )
  2040. 396.22 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 )
  2041. 396.22 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 )
  2042. 396.22 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 )
  2043. 396.22 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 )
  2044. 396.22 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 )
  2045. 396.22 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 )
  2046. 396.22 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 )
  2047. 400.09 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 )
  2048. 400.54 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 )
  2049. 401.55 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 )
  2050. 401.66 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 )
  2051. 401.78 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 )
  2052. 401.78 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 )
  2053. 402.37 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 )
  2054. 405.60 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 )
  2055. 405.60 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 )
  2056. 405.60 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 )
  2057. 405.60 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 )
  2058. 405.60 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 )
  2059. 405.60 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 )
  2060. 408.15 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 )
  2061. 408.18 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 )
  2062. 408.18 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 )
  2063. 416.85 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 )
  2064. 422.17 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 )
  2065. 423.90 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 )
  2066. 424.91 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 )
  2067. 429.07 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 )
  2068. 430.22 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 )
  2069. 430.22 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 )
  2070. 430.22 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 )
  2071. 430.22 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 )
  2072. 435.87 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 )
  2073. 445.48 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 )
  2074. 445.49 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 )
  2075. 445.49 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 )
  2076. 445.49 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 )
  2077. 445.49 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 )
  2078. 445.49 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 )
  2079. 445.49 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 )
  2080. 445.49 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 )
  2081. 445.49 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 )
  2082. 445.49 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 )
  2083. 445.49 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 )
  2084. 445.49 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 )
  2085. 445.49 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 )
  2086. 445.49 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 )
  2087. 445.49 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 )
  2088. 445.49 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 )
  2089. 456.74 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 )
  2090. 456.77 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 )
  2091. 456.77 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 )
  2092. 456.77 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 )
  2093. 456.77 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 )
  2094. 456.77 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 )
  2095. 459.52 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 )
  2096. 462.92 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 )
  2097. 463.68 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 )
  2098. 463.68 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 )
  2099. 463.68 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 )
  2100. 463.68 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 )
  2101. 463.68 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 )
  2102. 463.68 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 )
  2103. 466.42 s [Cabal] [132 of 146] Compiling Distribution.Make ( src/Distribution/Make.hs, dist/build/Distribution/Make.o, dist/build/Distribution/Make.dyn_o )
  2104. 466.42 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 )
  2105. 466.42 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 )
  2106. 466.42 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 )
  2107. 466.42 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 )
  2108. 466.42 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 )
  2109. 466.42 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 )
  2110. 466.43 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 )
  2111. 466.43 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 )
  2112. 466.43 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 )
  2113. 475.69 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 )
  2114. 476.26 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 )
  2115. 477.13 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 )
  2116. 478.25 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 )
  2117. 482.84 s [Cabal] [146 of 146] Compiling Distribution.Simple ( src/Distribution/Simple.hs, dist/build/Distribution/Simple.o, dist/build/Distribution/Simple.dyn_o )
  2118. 489.09 s [Cabal] [ 1 of 146] Compiling Distribution.Backpack.FullUnitId ( src/Distribution/Backpack/FullUnitId.hs, dist/build/Distribution/Backpack/FullUnitId.p_o )
  2119. 493.60 s [Cabal] [ 2 of 146] Compiling Distribution.Backpack.ModSubst ( src/Distribution/Backpack/ModSubst.hs, dist/build/Distribution/Backpack/ModSubst.p_o )
  2120. 494.44 s [Cabal] [ 3 of 146] Compiling Distribution.Backpack.ModuleScope ( src/Distribution/Backpack/ModuleScope.hs, dist/build/Distribution/Backpack/ModuleScope.p_o )
  2121. 496.08 s [Cabal] [ 4 of 146] Compiling Distribution.Backpack.ModuleShape ( src/Distribution/Backpack/ModuleShape.hs, dist/build/Distribution/Backpack/ModuleShape.p_o )
  2122. 496.57 s [Cabal] [ 5 of 146] Compiling Distribution.Backpack.PreModuleShape ( src/Distribution/Backpack/PreModuleShape.hs, dist/build/Distribution/Backpack/PreModuleShape.p_o )
  2123. 497.46 s [Cabal] [ 6 of 146] Compiling Distribution.Compat.Async ( src/Distribution/Compat/Async.hs, dist/build/Distribution/Compat/Async.p_o )
  2124. 497.46 s [Cabal] [ 7 of 146] Compiling Distribution.Compat.CreatePipe ( src/Distribution/Compat/CreatePipe.hs, dist/build/Distribution/Compat/CreatePipe.p_o )
  2125. 497.46 s [Cabal] [ 8 of 146] Compiling Distribution.Compat.Directory ( src/Distribution/Compat/Directory.hs, dist/build/Distribution/Compat/Directory.p_o )
  2126. 497.46 s [Cabal] [ 9 of 146] Compiling Distribution.Compat.FilePath ( src/Distribution/Compat/FilePath.hs, dist/build/Distribution/Compat/FilePath.p_o )
  2127. 497.46 s [Cabal] [ 10 of 146] Compiling Distribution.Compat.GetShortPathName ( src/Distribution/Compat/GetShortPathName.hs, dist/build/Distribution/Compat/GetShortPathName.p_o )
  2128. 497.46 s [Cabal] [ 11 of 146] Compiling Distribution.Compat.Internal.TempFile ( src/Distribution/Compat/Internal/TempFile.hs, dist/build/Distribution/Compat/Internal/TempFile.p_o )
  2129. 497.46 s [Cabal] [ 12 of 146] Compiling Distribution.Compat.CopyFile ( src/Distribution/Compat/CopyFile.hs, dist/build/Distribution/Compat/CopyFile.p_o )
  2130. 497.46 s [Cabal] [ 13 of 146] Compiling Distribution.Compat.Prelude.Internal ( src/Distribution/Compat/Prelude/Internal.hs, dist/build/Distribution/Compat/Prelude/Internal.p_o )
  2131. 497.46 s [Cabal] [ 14 of 146] Compiling Distribution.Compat.Process ( src/Distribution/Compat/Process.hs, dist/build/Distribution/Compat/Process.p_o )
  2132. 497.46 s [Cabal] [ 15 of 146] Compiling Distribution.Compat.ResponseFile ( src/Distribution/Compat/ResponseFile.hs, dist/build/Distribution/Compat/ResponseFile.p_o )
  2133. 497.46 s [Cabal] [ 16 of 146] Compiling Distribution.Compat.SnocList ( src/Distribution/Compat/SnocList.hs, dist/build/Distribution/Compat/SnocList.p_o )
  2134. 497.46 s [Cabal] [ 17 of 146] Compiling Distribution.Compat.Stack ( src/Distribution/Compat/Stack.hs, dist/build/Distribution/Compat/Stack.p_o )
  2135. 497.46 s [Cabal] [ 18 of 146] Compiling Distribution.Compat.Environment ( src/Distribution/Compat/Environment.hs, dist/build/Distribution/Compat/Environment.p_o )
  2136. 497.46 s [Cabal] [ 19 of 146] Compiling Distribution.GetOpt ( src/Distribution/GetOpt.hs, dist/build/Distribution/GetOpt.p_o )
  2137. 497.46 s [Cabal] [ 20 of 146] Compiling Distribution.Lex ( src/Distribution/Lex.hs, dist/build/Distribution/Lex.p_o )
  2138. 497.46 s [Cabal] [ 21 of 146] Compiling Distribution.PackageDescription.Check.Warning ( src/Distribution/PackageDescription/Check/Warning.hs, dist/build/Distribution/PackageDescription/Check/Warning.p_o )
  2139. 504.69 s [Cabal] [ 22 of 146] Compiling Distribution.ReadE ( src/Distribution/ReadE.hs, dist/build/Distribution/ReadE.p_o )
  2140. 504.69 s [Cabal] [ 23 of 146] Compiling Distribution.Simple.BuildToolDepends ( src/Distribution/Simple/BuildToolDepends.hs, dist/build/Distribution/Simple/BuildToolDepends.p_o )
  2141. 504.70 s [Cabal] [ 24 of 146] Compiling Distribution.Simple.CCompiler ( src/Distribution/Simple/CCompiler.hs, dist/build/Distribution/Simple/CCompiler.p_o )
  2142. 504.70 s [Cabal] [ 25 of 146] Compiling Distribution.Simple.Flag ( src/Distribution/Simple/Flag.hs, dist/build/Distribution/Simple/Flag.p_o )
  2143. 504.70 s [Cabal] [ 26 of 146] Compiling Distribution.Simple.InstallDirs.Internal ( src/Distribution/Simple/InstallDirs/Internal.hs, dist/build/Distribution/Simple/InstallDirs/Internal.p_o )
  2144. 504.70 s [Cabal] [ 27 of 146] Compiling Distribution.Simple.InstallDirs ( src/Distribution/Simple/InstallDirs.hs, dist/build/Distribution/Simple/InstallDirs.p_o )
  2145. 504.70 s [Cabal] [ 28 of 146] Compiling Distribution.Simple.Program.Internal ( src/Distribution/Simple/Program/Internal.hs, dist/build/Distribution/Simple/Program/Internal.p_o )
  2146. 504.70 s [Cabal] [ 29 of 146] Compiling Distribution.TestSuite ( src/Distribution/TestSuite.hs, dist/build/Distribution/TestSuite.p_o )
  2147. 504.70 s [Cabal] [ 30 of 146] Compiling Distribution.Types.AnnotatedId ( src/Distribution/Types/AnnotatedId.hs, dist/build/Distribution/Types/AnnotatedId.p_o )
  2148. 504.70 s [Cabal] [ 31 of 146] Compiling Distribution.Backpack.PreExistingComponent ( src/Distribution/Backpack/PreExistingComponent.hs, dist/build/Distribution/Backpack/PreExistingComponent.p_o )
  2149. 504.70 s [Cabal] [ 32 of 146] Compiling Distribution.Types.ComponentInclude ( src/Distribution/Types/ComponentInclude.hs, dist/build/Distribution/Types/ComponentInclude.p_o )
  2150. 504.70 s [Cabal] [ 33 of 146] Compiling Distribution.Types.ComponentLocalBuildInfo ( src/Distribution/Types/ComponentLocalBuildInfo.hs, dist/build/Distribution/Types/ComponentLocalBuildInfo.p_o )
  2151. 504.70 s [Cabal] [ 34 of 146] Compiling Distribution.Types.DumpBuildInfo ( src/Distribution/Types/DumpBuildInfo.hs, dist/build/Distribution/Types/DumpBuildInfo.p_o )
  2152. 504.70 s [Cabal] [ 35 of 146] Compiling Distribution.Types.GivenComponent ( src/Distribution/Types/GivenComponent.hs, dist/build/Distribution/Types/GivenComponent.p_o )
  2153. 504.70 s [Cabal] [ 36 of 146] Compiling Distribution.Types.PackageName.Magic ( src/Distribution/Types/PackageName/Magic.hs, dist/build/Distribution/Types/PackageName/Magic.p_o )
  2154. 504.70 s [Cabal] [ 37 of 146] Compiling Distribution.Types.ParStrat ( src/Distribution/Types/ParStrat.hs, dist/build/Distribution/Types/ParStrat.p_o )
  2155. 504.70 s [Cabal] [ 38 of 146] Compiling Distribution.Types.TargetInfo ( src/Distribution/Types/TargetInfo.hs, dist/build/Distribution/Types/TargetInfo.p_o )
  2156. 504.70 s [Cabal] [ 39 of 146] Compiling Distribution.Utils.IOData ( src/Distribution/Utils/IOData.hs, dist/build/Distribution/Utils/IOData.p_o )
  2157. 504.70 s [Cabal] [ 40 of 146] Compiling Distribution.Utils.Json ( src/Distribution/Utils/Json.hs, dist/build/Distribution/Utils/Json.p_o )
  2158. 504.70 s [Cabal] [ 41 of 146] Compiling Distribution.Utils.MapAccum ( src/Distribution/Utils/MapAccum.hs, dist/build/Distribution/Utils/MapAccum.p_o )
  2159. 504.70 s [Cabal] [ 42 of 146] Compiling Distribution.Utils.Progress ( src/Distribution/Utils/Progress.hs, dist/build/Distribution/Utils/Progress.p_o )
  2160. 504.70 s [Cabal] [ 43 of 146] Compiling Distribution.Utils.UnionFind ( src/Distribution/Utils/UnionFind.hs, dist/build/Distribution/Utils/UnionFind.p_o )
  2161. 504.70 s [Cabal] [ 44 of 146] Compiling Distribution.Verbosity.Internal ( src/Distribution/Verbosity/Internal.hs, dist/build/Distribution/Verbosity/Internal.p_o )
  2162. 504.70 s [Cabal] [ 45 of 146] Compiling Distribution.Verbosity ( src/Distribution/Verbosity.hs, dist/build/Distribution/Verbosity.p_o )
  2163. 504.70 s [Cabal] [ 46 of 146] Compiling Distribution.Simple.Program.Types ( src/Distribution/Simple/Program/Types.hs, dist/build/Distribution/Simple/Program/Types.p_o )
  2164. 504.70 s [Cabal] [ 47 of 146] Compiling Distribution.Simple.PreProcess.Types ( src/Distribution/Simple/PreProcess/Types.hs, dist/build/Distribution/Simple/PreProcess/Types.p_o )
  2165. 504.70 s [Cabal] [ 48 of 146] Compiling Distribution.Simple.Errors ( src/Distribution/Simple/Errors.hs, dist/build/Distribution/Simple/Errors.p_o )
  2166. 506.06 s [Cabal] [ 49 of 146] Compiling Distribution.Simple.PreProcess.Unlit ( src/Distribution/Simple/PreProcess/Unlit.hs, dist/build/Distribution/Simple/PreProcess/Unlit.p_o )
  2167. 507.01 s [Cabal] [ 50 of 146] Compiling Distribution.Backpack.UnifyM ( src/Distribution/Backpack/UnifyM.hs, dist/build/Distribution/Backpack/UnifyM.p_o )
  2168. 507.01 s [Cabal] [ 51 of 146] Compiling Distribution.Backpack.MixLink ( src/Distribution/Backpack/MixLink.hs, dist/build/Distribution/Backpack/MixLink.p_o )
  2169. 507.02 s [Cabal] [ 52 of 146] Compiling Distribution.ZinzaPrelude ( src/Distribution/ZinzaPrelude.hs, dist/build/Distribution/ZinzaPrelude.p_o )
  2170. 507.02 s [Cabal] [ 53 of 146] Compiling Distribution.Simple.Build.PathsModule.Z ( src/Distribution/Simple/Build/PathsModule/Z.hs, dist/build/Distribution/Simple/Build/PathsModule/Z.p_o )
  2171. 507.02 s [Cabal] [ 54 of 146] Compiling Distribution.Simple.Build.PackageInfoModule.Z ( src/Distribution/Simple/Build/PackageInfoModule/Z.hs, dist/build/Distribution/Simple/Build/PackageInfoModule/Z.p_o )
  2172. 507.02 s [Cabal] [ 55 of 146] Compiling Distribution.Simple.Build.Macros.Z ( src/Distribution/Simple/Build/Macros/Z.hs, dist/build/Distribution/Simple/Build/Macros/Z.p_o )
  2173. 507.02 s [Cabal] [ 56 of 146] Compiling Paths_Cabal ( dist/build/autogen/Paths_Cabal.hs, dist/build/Paths_Cabal.p_o )
  2174. 507.02 s [Cabal] [ 57 of 146] Compiling Distribution.Simple.Utils ( src/Distribution/Simple/Utils.hs, dist/build/Distribution/Simple/Utils.p_o )
  2175. 510.16 s [Cabal] [ 58 of 146] Compiling Distribution.Utils.NubList ( src/Distribution/Utils/NubList.hs, dist/build/Distribution/Utils/NubList.p_o )
  2176. 512.76 s [Cabal] [ 59 of 146] Compiling Distribution.Utils.LogProgress ( src/Distribution/Utils/LogProgress.hs, dist/build/Distribution/Utils/LogProgress.p_o )
  2177. 512.78 s [Cabal] [ 60 of 146] Compiling Distribution.Simple.Program.Run ( src/Distribution/Simple/Program/Run.hs, dist/build/Distribution/Simple/Program/Run.p_o )
  2178. 513.11 s [Cabal] [ 61 of 146] Compiling Distribution.Simple.Program.Script ( src/Distribution/Simple/Program/Script.hs, dist/build/Distribution/Simple/Program/Script.p_o )
  2179. 514.09 s [Cabal] [ 62 of 146] Compiling Distribution.Simple.Program.ResponseFile ( src/Distribution/Simple/Program/ResponseFile.hs, dist/build/Distribution/Simple/Program/ResponseFile.p_o )
  2180. 514.09 s [Cabal] [ 63 of 146] Compiling Distribution.Simple.Program.Hpc ( src/Distribution/Simple/Program/Hpc.hs, dist/build/Distribution/Simple/Program/Hpc.p_o )
  2181. 514.09 s [Cabal] [ 64 of 146] Compiling Distribution.Simple.Program.Find ( src/Distribution/Simple/Program/Find.hs, dist/build/Distribution/Simple/Program/Find.p_o )
  2182. 514.09 s [Cabal] [ 65 of 146] Compiling Distribution.Simple.PackageIndex ( src/Distribution/Simple/PackageIndex.hs, dist/build/Distribution/Simple/PackageIndex.p_o )
  2183. 518.26 s [Cabal] [ 66 of 146] Compiling Distribution.Simple.PackageDescription ( src/Distribution/Simple/PackageDescription.hs, dist/build/Distribution/Simple/PackageDescription.p_o )
  2184. 518.27 s [Cabal] [ 67 of 146] Compiling Distribution.Simple.Glob.Internal ( src/Distribution/Simple/Glob/Internal.hs, dist/build/Distribution/Simple/Glob/Internal.p_o )
  2185. 518.27 s [Cabal] [ 68 of 146] Compiling Distribution.Simple.Glob ( src/Distribution/Simple/Glob.hs, dist/build/Distribution/Simple/Glob.p_o )
  2186. 518.27 s [Cabal] [ 69 of 146] Compiling Distribution.PackageDescription.Check.Monad ( src/Distribution/PackageDescription/Check/Monad.hs, dist/build/Distribution/PackageDescription/Check/Monad.p_o )
  2187. 518.27 s [Cabal] [ 70 of 146] Compiling Distribution.PackageDescription.Check.Conditional ( src/Distribution/PackageDescription/Check/Conditional.hs, dist/build/Distribution/PackageDescription/Check/Conditional.p_o )
  2188. 518.27 s [Cabal] [ 71 of 146] Compiling Distribution.PackageDescription.Check.Common ( src/Distribution/PackageDescription/Check/Common.hs, dist/build/Distribution/PackageDescription/Check/Common.p_o )
  2189. 518.27 s [Cabal] [ 72 of 146] Compiling Distribution.Simple.Compiler ( src/Distribution/Simple/Compiler.hs, dist/build/Distribution/Simple/Compiler.p_o )
  2190. 518.27 s [Cabal] [ 73 of 146] Compiling Distribution.Simple.Program.HcPkg ( src/Distribution/Simple/Program/HcPkg.hs, dist/build/Distribution/Simple/Program/HcPkg.p_o )
  2191. 518.33 s [Cabal] [ 74 of 146] Compiling Distribution.Simple.GHC.ImplInfo ( src/Distribution/Simple/GHC/ImplInfo.hs, dist/build/Distribution/Simple/GHC/ImplInfo.p_o )
  2192. 518.33 s [Cabal] [ 75 of 146] Compiling Distribution.Simple.Program.GHC ( src/Distribution/Simple/Program/GHC.hs, dist/build/Distribution/Simple/Program/GHC.p_o )
  2193. 523.50 s [Cabal] [ 76 of 146] Compiling Distribution.Simple.Program.Builtin ( src/Distribution/Simple/Program/Builtin.hs, dist/build/Distribution/Simple/Program/Builtin.p_o )
  2194. 524.24 s [Cabal] [ 77 of 146] Compiling Distribution.Simple.Program.Db ( src/Distribution/Simple/Program/Db.hs, dist/build/Distribution/Simple/Program/Db.p_o )
  2195. 525.45 s [Cabal] [ 78 of 146] Compiling Distribution.Simple.Program ( src/Distribution/Simple/Program.hs, dist/build/Distribution/Simple/Program.p_o )
  2196. 525.80 s [Cabal] [ 79 of 146] Compiling Distribution.Simple.Program.Strip ( src/Distribution/Simple/Program/Strip.hs, dist/build/Distribution/Simple/Program/Strip.p_o )
  2197. 526.49 s [Cabal] [ 80 of 146] Compiling Distribution.Simple.Command ( src/Distribution/Simple/Command.hs, dist/build/Distribution/Simple/Command.p_o )
  2198. 526.49 s [Cabal] [ 81 of 146] Compiling Distribution.Simple.Setup.Common ( src/Distribution/Simple/Setup/Common.hs, dist/build/Distribution/Simple/Setup/Common.p_o )
  2199. 526.94 s [Cabal] [ 82 of 146] Compiling Distribution.Simple.Setup.Test ( src/Distribution/Simple/Setup/Test.hs, dist/build/Distribution/Simple/Setup/Test.p_o )
  2200. 531.15 s [Cabal] [ 83 of 146] Compiling Distribution.Simple.Setup.SDist ( src/Distribution/Simple/Setup/SDist.hs, dist/build/Distribution/Simple/Setup/SDist.p_o )
  2201. 531.17 s [Cabal] [ 84 of 146] Compiling Distribution.Simple.Setup.Repl ( src/Distribution/Simple/Setup/Repl.hs, dist/build/Distribution/Simple/Setup/Repl.p_o )
  2202. 531.17 s [Cabal] [ 85 of 146] Compiling Distribution.Simple.Setup.Register ( src/Distribution/Simple/Setup/Register.hs, dist/build/Distribution/Simple/Setup/Register.p_o )
  2203. 531.17 s [Cabal] [ 86 of 146] Compiling Distribution.Simple.Setup.Install ( src/Distribution/Simple/Setup/Install.hs, dist/build/Distribution/Simple/Setup/Install.p_o )
  2204. 531.17 s [Cabal] [ 87 of 146] Compiling Distribution.Simple.Setup.Hscolour ( src/Distribution/Simple/Setup/Hscolour.hs, dist/build/Distribution/Simple/Setup/Hscolour.p_o )
  2205. 531.17 s [Cabal] [ 88 of 146] Compiling Distribution.Simple.Setup.Haddock ( src/Distribution/Simple/Setup/Haddock.hs, dist/build/Distribution/Simple/Setup/Haddock.p_o )
  2206. 532.73 s [Cabal] [ 89 of 146] Compiling Distribution.Simple.Setup.Global ( src/Distribution/Simple/Setup/Global.hs, dist/build/Distribution/Simple/Setup/Global.p_o )
  2207. 532.73 s [Cabal] [ 90 of 146] Compiling Distribution.Simple.Setup.Copy ( src/Distribution/Simple/Setup/Copy.hs, dist/build/Distribution/Simple/Setup/Copy.p_o )
  2208. 532.73 s [Cabal] [ 91 of 146] Compiling Distribution.Simple.Setup.Config ( src/Distribution/Simple/Setup/Config.hs, dist/build/Distribution/Simple/Setup/Config.p_o )
  2209. 542.48 s [Cabal] [ 92 of 146] Compiling Distribution.Types.LocalBuildConfig ( src/Distribution/Types/LocalBuildConfig.hs, dist/build/Distribution/Types/LocalBuildConfig.p_o )
  2210. 547.30 s [Cabal] [ 93 of 146] Compiling Distribution.Types.LocalBuildInfo ( src/Distribution/Types/LocalBuildInfo.hs, dist/build/Distribution/Types/LocalBuildInfo.p_o )
  2211. 548.49 s [Cabal] [ 94 of 146] Compiling Distribution.Simple.LocalBuildInfo ( src/Distribution/Simple/LocalBuildInfo.hs, dist/build/Distribution/Simple/LocalBuildInfo.p_o )
  2212. 549.01 s [Cabal] [ 95 of 146] Compiling Distribution.Simple.Test.Log ( src/Distribution/Simple/Test/Log.hs, dist/build/Distribution/Simple/Test/Log.p_o )
  2213. 550.55 s [Cabal] [ 96 of 146] Compiling Distribution.Simple.Hpc ( src/Distribution/Simple/Hpc.hs, dist/build/Distribution/Simple/Hpc.p_o )
  2214. 550.55 s [Cabal] [ 97 of 146] Compiling Distribution.Simple.Build.PackageInfoModule ( src/Distribution/Simple/Build/PackageInfoModule.hs, dist/build/Distribution/Simple/Build/PackageInfoModule.p_o )
  2215. 550.55 s [Cabal] [ 98 of 146] Compiling Distribution.Simple.Build.Macros ( src/Distribution/Simple/Build/Macros.hs, dist/build/Distribution/Simple/Build/Macros.p_o )
  2216. 550.55 s [Cabal] [ 99 of 146] Compiling Distribution.Backpack.Id ( src/Distribution/Backpack/Id.hs, dist/build/Distribution/Backpack/Id.p_o )
  2217. 550.55 s [Cabal] [100 of 146] Compiling Distribution.Backpack.ConfiguredComponent ( src/Distribution/Backpack/ConfiguredComponent.hs, dist/build/Distribution/Backpack/ConfiguredComponent.p_o )
  2218. 552.13 s [Cabal] [101 of 146] Compiling Distribution.Backpack.LinkedComponent ( src/Distribution/Backpack/LinkedComponent.hs, dist/build/Distribution/Backpack/LinkedComponent.p_o )
  2219. 555.49 s [Cabal] [102 of 146] Compiling Distribution.Backpack.ComponentsGraph ( src/Distribution/Backpack/ComponentsGraph.hs, dist/build/Distribution/Backpack/ComponentsGraph.p_o )
  2220. 555.51 s [Cabal] [103 of 146] Compiling Distribution.Simple.Program.Ld ( src/Distribution/Simple/Program/Ld.hs, dist/build/Distribution/Simple/Program/Ld.p_o )
  2221. 555.51 s [Cabal] [104 of 146] Compiling Distribution.Simple.Program.Ar ( src/Distribution/Simple/Program/Ar.hs, dist/build/Distribution/Simple/Program/Ar.p_o )
  2222. 555.51 s [Cabal] [105 of 146] Compiling Distribution.Simple.ConfigureScript ( src/Distribution/Simple/ConfigureScript.hs, dist/build/Distribution/Simple/ConfigureScript.p_o )
  2223. 555.51 s [Cabal] [106 of 146] Compiling Distribution.Simple.Setup.Clean ( src/Distribution/Simple/Setup/Clean.hs, dist/build/Distribution/Simple/Setup/Clean.p_o )
  2224. 555.51 s [Cabal] [107 of 146] Compiling Distribution.Simple.Setup.Build ( src/Distribution/Simple/Setup/Build.hs, dist/build/Distribution/Simple/Setup/Build.p_o )
  2225. 555.51 s [Cabal] [108 of 146] Compiling Distribution.Simple.Setup.Benchmark ( src/Distribution/Simple/Setup/Benchmark.hs, dist/build/Distribution/Simple/Setup/Benchmark.p_o )
  2226. 555.51 s [Cabal] [109 of 146] Compiling Distribution.Simple.Setup ( src/Distribution/Simple/Setup.hs, dist/build/Distribution/Simple/Setup.p_o )
  2227. 555.51 s [Cabal] [110 of 146] Compiling Distribution.Simple.Build.Inputs ( src/Distribution/Simple/Build/Inputs.hs, dist/build/Distribution/Simple/Build/Inputs.p_o )
  2228. 555.51 s [Cabal] [111 of 146] Compiling Distribution.Simple.BuildTarget ( src/Distribution/Simple/BuildTarget.hs, dist/build/Distribution/Simple/BuildTarget.p_o )
  2229. 555.54 s [Cabal] [112 of 146] Compiling Distribution.Simple.BuildPaths ( src/Distribution/Simple/BuildPaths.hs, dist/build/Distribution/Simple/BuildPaths.p_o )
  2230. 555.54 s [Cabal] [113 of 146] Compiling Distribution.Simple.UHC ( src/Distribution/Simple/UHC.hs, dist/build/Distribution/Simple/UHC.p_o )
  2231. 555.54 s [Cabal] [114 of 146] Compiling Distribution.Simple.HaskellSuite ( src/Distribution/Simple/HaskellSuite.hs, dist/build/Distribution/Simple/HaskellSuite.p_o )
  2232. 555.54 s [Cabal] [115 of 146] Compiling Distribution.Simple.GHC.Internal ( src/Distribution/Simple/GHC/Internal.hs, dist/build/Distribution/Simple/GHC/Internal.p_o )
  2233. 555.54 s [Cabal] [116 of 146] Compiling Distribution.Simple.GHC.EnvironmentParser ( src/Distribution/Simple/GHC/EnvironmentParser.hs, dist/build/Distribution/Simple/GHC/EnvironmentParser.p_o )
  2234. 556.01 s [Cabal] [117 of 146] Compiling Distribution.Simple.GHCJS ( src/Distribution/Simple/GHCJS.hs, dist/build/Distribution/Simple/GHCJS.p_o )
  2235. 560.17 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 )
  2236. 560.17 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 )
  2237. 560.17 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 )
  2238. 560.17 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 )
  2239. 560.17 s [Cabal] [122 of 146] Compiling Distribution.Simple.GHC.Build ( src/Distribution/Simple/GHC/Build.hs, dist/build/Distribution/Simple/GHC/Build.p_o )
  2240. 560.17 s [Cabal] [123 of 146] Compiling Distribution.Simple.GHC ( src/Distribution/Simple/GHC.hs, dist/build/Distribution/Simple/GHC.p_o )
  2241. 561.28 s [Cabal] [124 of 146] Compiling Distribution.Simple.ShowBuildInfo ( src/Distribution/Simple/ShowBuildInfo.hs, dist/build/Distribution/Simple/ShowBuildInfo.p_o )
  2242. 561.77 s [Cabal] [125 of 146] Compiling Distribution.Simple.Install ( src/Distribution/Simple/Install.hs, dist/build/Distribution/Simple/Install.p_o )
  2243. 561.95 s [Cabal] [126 of 146] Compiling Distribution.Simple.Build.PathsModule ( src/Distribution/Simple/Build/PathsModule.hs, dist/build/Distribution/Simple/Build/PathsModule.p_o )
  2244. 561.95 s [Cabal] [127 of 146] Compiling Distribution.Simple.Test.LibV09 ( src/Distribution/Simple/Test/LibV09.hs, dist/build/Distribution/Simple/Test/LibV09.p_o )
  2245. 561.95 s [Cabal] [128 of 146] Compiling Distribution.Simple.Test.ExeV10 ( src/Distribution/Simple/Test/ExeV10.hs, dist/build/Distribution/Simple/Test/ExeV10.p_o )
  2246. 561.95 s [Cabal] [129 of 146] Compiling Distribution.PackageDescription.Check.Paths ( src/Distribution/PackageDescription/Check/Paths.hs, dist/build/Distribution/PackageDescription/Check/Paths.p_o )
  2247. 561.95 s [Cabal] [130 of 146] Compiling Distribution.PackageDescription.Check.Target ( src/Distribution/PackageDescription/Check/Target.hs, dist/build/Distribution/PackageDescription/Check/Target.p_o )
  2248. 561.95 s [Cabal] [131 of 146] Compiling Distribution.PackageDescription.Check ( src/Distribution/PackageDescription/Check.hs, dist/build/Distribution/PackageDescription/Check.p_o )
  2249. 562.80 s [Cabal] [132 of 146] Compiling Distribution.Make ( src/Distribution/Make.hs, dist/build/Distribution/Make.p_o )
  2250. 562.80 s [Cabal] [133 of 146] Compiling Distribution.Compat.Time ( src/Distribution/Compat/Time.hs, dist/build/Distribution/Compat/Time.p_o )
  2251. 562.80 s [Cabal] [134 of 146] Compiling Distribution.Backpack.ReadyComponent ( src/Distribution/Backpack/ReadyComponent.hs, dist/build/Distribution/Backpack/ReadyComponent.p_o )
  2252. 562.80 s [Cabal] [135 of 146] Compiling Distribution.Backpack.Configure ( src/Distribution/Backpack/Configure.hs, dist/build/Distribution/Backpack/Configure.p_o )
  2253. 562.80 s [Cabal] [136 of 146] Compiling Distribution.Backpack.DescribeUnitId ( src/Distribution/Backpack/DescribeUnitId.hs, dist/build/Distribution/Backpack/DescribeUnitId.p_o )
  2254. 562.80 s [Cabal] [137 of 146] Compiling Distribution.Simple.Register ( src/Distribution/Simple/Register.hs, dist/build/Distribution/Simple/Register.p_o )
  2255. 562.80 s [Cabal] [138 of 146] Compiling Distribution.Simple.PreProcess ( src/Distribution/Simple/PreProcess.hs, dist/build/Distribution/Simple/PreProcess.p_o )
  2256. 562.80 s [Cabal] [139 of 146] Compiling Distribution.Simple.UserHooks ( src/Distribution/Simple/UserHooks.hs, dist/build/Distribution/Simple/UserHooks.p_o )
  2257. 562.80 s [Cabal] [140 of 146] Compiling Distribution.Simple.Bench ( src/Distribution/Simple/Bench.hs, dist/build/Distribution/Simple/Bench.p_o )
  2258. 562.80 s [Cabal] [141 of 146] Compiling Distribution.Simple.Configure ( src/Distribution/Simple/Configure.hs, dist/build/Distribution/Simple/Configure.p_o )
  2259. 569.21 s [Cabal] [142 of 146] Compiling Distribution.Simple.Test ( src/Distribution/Simple/Test.hs, dist/build/Distribution/Simple/Test.p_o )
  2260. 569.77 s [Cabal] [143 of 146] Compiling Distribution.Simple.SrcDist ( src/Distribution/Simple/SrcDist.hs, dist/build/Distribution/Simple/SrcDist.p_o )
  2261. 570.84 s [Cabal] [144 of 146] Compiling Distribution.Simple.Build ( src/Distribution/Simple/Build.hs, dist/build/Distribution/Simple/Build.p_o )
  2262. 571.82 s [Cabal] [145 of 146] Compiling Distribution.Simple.Haddock ( src/Distribution/Simple/Haddock.hs, dist/build/Distribution/Simple/Haddock.p_o )
  2263. 575.34 s [Cabal] [146 of 146] Compiling Distribution.Simple ( src/Distribution/Simple.hs, dist/build/Distribution/Simple.p_o )
  2264. 579.97 s [Cabal] buildPhase completed in 3 minutes 29 seconds
  2265. 579.98 s [Cabal] Phase: haddockPhase
  2266. 580.27 s [Cabal] Preprocessing library for Cabal-3.12.1.0..
  2267. 580.31 s [Cabal] Running Haddock on library for Cabal-3.12.1.0..
  2268. 580.47 s [Cabal] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
  2269. 582.72 s [Cabal] 0% ( 0 / 5) in 'Distribution.Backpack.FullUnitId'
  2270. 582.72 s [Cabal] Missing documentation for:
  2271. 582.72 s [Cabal] Module header
  2272. 582.72 s [Cabal] FullUnitId (src/Distribution/Backpack/FullUnitId.hs:15)
  2273. 582.72 s [Cabal] FullDb (src/Distribution/Backpack/FullUnitId.hs:18)
  2274. 582.72 s [Cabal] expandOpenUnitId (src/Distribution/Backpack/FullUnitId.hs:20)
  2275. 582.72 s [Cabal] expandUnitId (src/Distribution/Backpack/FullUnitId.hs:26)
  2276. 582.74 s [Cabal] Warning: 'ModuleSubst' is out of scope.
  2277. 582.74 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2278. 582.74 s [Cabal] 100% ( 2 / 2) in 'Distribution.Backpack.ModSubst'
  2279. 582.81 s [Cabal] Warning: 'ModuleShape' is out of scope.
  2280. 582.81 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2281. 582.81 s [Cabal] Warning: 'Module' is out of scope.
  2282. 582.81 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2283. 583.11 s [Cabal] 80% ( 4 / 5) in 'Distribution.Backpack.ModuleShape'
  2284. 583.11 s [Cabal] Missing documentation for:
  2285. 583.11 s [Cabal] shapeInstalledPackage (src/Distribution/Backpack/ModuleShape.hs:76)
  2286. 583.15 s [Cabal] 0% ( 0 / 5) in 'Distribution.Backpack.PreModuleShape'
  2287. 583.15 s [Cabal] Missing documentation for:
  2288. 583.15 s [Cabal] Module header
  2289. 583.15 s [Cabal] PreModuleShape (src/Distribution/Backpack/PreModuleShape.hs:22)
  2290. 583.15 s [Cabal] toPreModuleShape (src/Distribution/Backpack/PreModuleShape.hs:28)
  2291. 583.15 s [Cabal] renamePreModuleShape (src/Distribution/Backpack/PreModuleShape.hs:31)
  2292. 583.15 s [Cabal] mixLinkPreModuleShape (src/Distribution/Backpack/PreModuleShape.hs:40)
  2293. 583.25 s [Cabal] Warning: 'async' is out of scope.
  2294. 583.25 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2295. 583.31 s [Cabal] 50% ( 1 / 2) in 'Distribution.Compat.CreatePipe'
  2296. 583.31 s [Cabal] Missing documentation for:
  2297. 583.31 s [Cabal] Module header
  2298. 583.33 s [Cabal] 75% ( 3 / 4) in 'Distribution.Compat.Directory'
  2299. 583.33 s [Cabal] Missing documentation for:
  2300. 583.33 s [Cabal] Module header
  2301. 583.35 s [Cabal] 66% ( 2 / 3) in 'Distribution.Compat.FilePath'
  2302. 583.35 s [Cabal] Missing documentation for:
  2303. 583.35 s [Cabal] Module header
  2304. 583.37 s [Cabal] Warning: 'GetShortPathName' is out of scope.
  2305. 583.37 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2306. 583.66 s [Cabal] 100% ( 2 / 2) in 'Distribution.Compat.Prelude.Internal'
  2307. 583.68 s [Cabal] Warning: 'delegate_ctlc' is out of scope.
  2308. 583.68 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2309. 583.68 s [Cabal] 80% ( 4 / 5) in 'Distribution.Compat.Process'
  2310. 583.68 s [Cabal] Missing documentation for:
  2311. 583.68 s [Cabal] Module header
  2312. 583.70 s [Cabal] 66% ( 2 / 3) in 'Distribution.Compat.ResponseFile'
  2313. 583.70 s [Cabal] Missing documentation for:
  2314. 583.70 s [Cabal] Module header
  2315. 583.79 s [Cabal] Warning: 'Verbosity' is out of scope.
  2316. 583.79 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2317. 583.79 s [Cabal] 66% ( 6 / 9) in 'Distribution.Compat.Stack'
  2318. 583.79 s [Cabal] Missing documentation for:
  2319. 583.79 s [Cabal] Module header
  2320. 583.79 s [Cabal] WithCallStack (src/Distribution/Compat/Stack.hs:31)
  2321. 583.79 s [Cabal] withLexicalCallStack (src/Distribution/Compat/Stack.hs:73)
  2322. 583.93 s [Cabal] Warning: 'ReturnInOrder' is out of scope.
  2323. 583.93 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2324. 585.21 s [Cabal] 50% ( 5 / 10) in 'Distribution.ReadE'
  2325. 585.21 s [Cabal] Missing documentation for:
  2326. 585.21 s [Cabal] succeedReadE (src/Distribution/ReadE.hs:46)
  2327. 585.24 s [Cabal] failReadE (src/Distribution/ReadE.hs:49)
  2328. 585.24 s [Cabal] parsecToReadE (src/Distribution/ReadE.hs:56)
  2329. 585.24 s [Cabal] parsecToReadEErr (src/Distribution/ReadE.hs:60)
  2330. 585.24 s [Cabal] unexpectMsgString (src/Distribution/ReadE.hs:66)
  2331. 585.29 s [Cabal] 100% ( 6 / 6) in 'Distribution.Simple.BuildToolDepends'
  2332. 585.34 s [Cabal] Warning: 'a' is out of scope.
  2333. 585.34 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2334. 585.34 s [Cabal] Warning: 'b' is out of scope.
  2335. 585.34 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2336. 585.34 s [Cabal] 100% ( 5 / 5) in 'Distribution.Simple.CCompiler'
  2337. 585.46 s [Cabal] 100% ( 12 / 12) in 'Distribution.Simple.Flag'
  2338. 585.64 s [Cabal] 0% ( 0 / 3) in 'Distribution.Simple.InstallDirs.Internal'
  2339. 585.64 s [Cabal] Missing documentation for:
  2340. 585.64 s [Cabal] Module header
  2341. 585.64 s [Cabal] PathComponent (src/Distribution/Simple/InstallDirs/Internal.hs:12)
  2342. 585.64 s [Cabal] PathTemplateVariable (src/Distribution/Simple/InstallDirs/Internal.hs:20)
  2343. 585.89 s [Cabal] 47% ( 11 / 23) in 'Distribution.Simple.InstallDirs'
  2344. 585.89 s [Cabal] Missing documentation for:
  2345. 585.89 s [Cabal] defaultInstallDirs (src/Distribution/Simple/InstallDirs.hs:178)
  2346. 585.89 s [Cabal] defaultInstallDirs' (src/Distribution/Simple/InstallDirs.hs:181)
  2347. 585.89 s [Cabal] combineInstallDirs (src/Distribution/Simple/InstallDirs.hs:116)
  2348. 585.89 s [Cabal] PathTemplateVariable (src/Distribution/Simple/InstallDirs/Internal.hs:20)
  2349. 585.89 s [Cabal] PathTemplateEnv (src/Distribution/Simple/InstallDirs.hs:395)
  2350. 585.89 s [Cabal] combinePathTemplate (src/Distribution/Simple/InstallDirs.hs:409)
  2351. 585.89 s [Cabal] substPathTemplate (src/Distribution/Simple/InstallDirs.hs:413)
  2352. 585.89 s [Cabal] platformTemplateEnv (src/Distribution/Simple/InstallDirs.hs:451)
  2353. 585.89 s [Cabal] compilerTemplateEnv (src/Distribution/Simple/InstallDirs.hs:446)
  2354. 585.89 s [Cabal] packageTemplateEnv (src/Distribution/Simple/InstallDirs.hs:436)
  2355. 585.89 s [Cabal] abiTemplateEnv (src/Distribution/Simple/InstallDirs.hs:457)
  2356. 585.89 s [Cabal] installDirsTemplateEnv (src/Distribution/Simple/InstallDirs.hs:476)
  2357. 586.07 s [Cabal] Warning: 'strip' is out of scope.
  2358. 586.07 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2359. 586.07 s [Cabal] 100% ( 2 / 2) in 'Distribution.Simple.Program.Internal'
  2360. 586.11 s [Cabal] 22% ( 2 / 9) in 'Distribution.TestSuite'
  2361. 586.11 s [Cabal] Missing documentation for:
  2362. 586.11 s [Cabal] TestInstance (src/Distribution/TestSuite.hs:30)
  2363. 586.11 s [Cabal] OptionDescr (src/Distribution/TestSuite.hs:49)
  2364. 586.11 s [Cabal] OptionType (src/Distribution/TestSuite.hs:59)
  2365. 586.11 s [Cabal] Test (src/Distribution/TestSuite.hs:78)
  2366. 586.12 s [Cabal] Options (src/Distribution/TestSuite.hs:94)
  2367. 586.12 s [Cabal] Progress (src/Distribution/TestSuite.hs:96)
  2368. 586.12 s [Cabal] Result (src/Distribution/TestSuite.hs:100)
  2369. 586.15 s [Cabal] 50% ( 1 / 2) in 'Distribution.Types.AnnotatedId'
  2370. 586.15 s [Cabal] Missing documentation for:
  2371. 586.15 s [Cabal] Module header
  2372. 586.17 s [Cabal] Warning: 'LinkedComponent' is out of scope.
  2373. 586.17 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2374. 586.17 s [Cabal] Warning: 'pc_pkgid' is out of scope.
  2375. 586.17 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2376. 586.18 s [Cabal] Warning: 'CSubLibName' is out of scope.
  2377. 586.18 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2378. 586.18 s [Cabal] 20% ( 1 / 5) in 'Distribution.Types.ComponentInclude'
  2379. 586.18 s [Cabal] Missing documentation for:
  2380. 586.18 s [Cabal] Module header
  2381. 586.19 s [Cabal] ComponentInclude (src/Distribution/Types/ComponentInclude.hs:16)
  2382. 586.19 s [Cabal] ci_id (src/Distribution/Types/ComponentInclude.hs:24)
  2383. 586.19 s [Cabal] ci_pkgid (src/Distribution/Types/ComponentInclude.hs:27)
  2384. 586.26 s [Cabal] Warning: 'BuildInfo' is out of scope.
  2385. 586.26 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2386. 586.26 s [Cabal] 25% ( 1 / 4) in 'Distribution.Types.ComponentLocalBuildInfo'
  2387. 586.26 s [Cabal] Missing documentation for:
  2388. 586.26 s [Cabal] Module header
  2389. 586.26 s [Cabal] componentIsIndefinite (src/Distribution/Types/ComponentLocalBuildInfo.hs:121)
  2390. 586.26 s [Cabal] maybeComponentInstantiatedWith (src/Distribution/Types/ComponentLocalBuildInfo.hs:125)
  2391. 586.32 s [Cabal] 0% ( 0 / 2) in 'Distribution.Types.DumpBuildInfo'
  2392. 586.32 s [Cabal] Missing documentation for:
  2393. 586.32 s [Cabal] Module header
  2394. 586.32 s [Cabal] DumpBuildInfo (src/Distribution/Types/DumpBuildInfo.hs:10)
  2395. 586.34 s [Cabal] 50% ( 1 / 2) in 'Distribution.Types.GivenComponent'
  2396. 586.34 s [Cabal] Missing documentation for:
  2397. 586.34 s [Cabal] Module header
  2398. 586.36 s [Cabal] 100% ( 5 / 5) in 'Distribution.Types.PackageName.Magic'
  2399. 586.37 s [Cabal] 80% ( 4 / 5) in 'Distribution.Types.ParStrat'
  2400. 586.37 s [Cabal] Missing documentation for:
  2401. 586.37 s [Cabal] Module header
  2402. 586.43 s [Cabal] Warning: 'LocalBuildInfo' is out of scope.
  2403. 586.43 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2404. 586.43 s [Cabal] 50% ( 1 / 2) in 'Distribution.Types.TargetInfo'
  2405. 586.43 s [Cabal] Missing documentation for:
  2406. 586.43 s [Cabal] Module header
  2407. 586.46 s [Cabal] Warning: 'hClose' is out of scope.
  2408. 586.46 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2409. 586.46 s [Cabal] 100% ( 8 / 8) in 'Distribution.Utils.IOData'
  2410. 586.50 s [Cabal] Warning: 'ByteString' is out of scope.
  2411. 586.50 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2412. 586.50 s [Cabal] 75% ( 3 / 4) in 'Distribution.Utils.Json'
  2413. 586.50 s [Cabal] Missing documentation for:
  2414. 586.50 s [Cabal] Json (src/Distribution/Utils/Json.hs:20)
  2415. 586.53 s [Cabal] Warning: 'mapAccumL' is out of scope.
  2416. 586.53 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2417. 586.53 s [Cabal] 50% ( 1 / 2) in 'Distribution.Utils.MapAccum'
  2418. 586.53 s [Cabal] Missing documentation for:
  2419. 586.53 s [Cabal] Module header
  2420. 586.55 s [Cabal] 100% ( 5 / 5) in 'Distribution.Utils.Progress'
  2421. 586.63 s [Cabal] 0% ( 0 / 3) in 'Distribution.Verbosity.Internal'
  2422. 586.63 s [Cabal] Missing documentation for:
  2423. 586.63 s [Cabal] Module header
  2424. 586.63 s [Cabal] VerbosityLevel (src/Distribution/Verbosity/Internal.hs:12)
  2425. 586.63 s [Cabal] VerbosityFlag (src/Distribution/Verbosity/Internal.hs:18)
  2426. 586.76 s [Cabal] Warning: 'stderr' is out of scope.
  2427. 586.76 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2428. 586.76 s [Cabal] Warning: 'stdout' is out of scope.
  2429. 586.76 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2430. 586.76 s [Cabal] 87% ( 35 / 40) in 'Distribution.Verbosity'
  2431. 586.76 s [Cabal] Missing documentation for:
  2432. 586.76 s [Cabal] Verbosity (src/Distribution/Verbosity.hs:90)
  2433. 586.76 s [Cabal] flagToVerbosity (src/Distribution/Verbosity.hs:240)
  2434. 586.76 s [Cabal] showForCabal (src/Distribution/Verbosity.hs:243)
  2435. 586.76 s [Cabal] showForGHC (src/Distribution/Verbosity.hs:266)
  2436. 586.76 s [Cabal] verboseHasFlags (src/Distribution/Verbosity.hs:334)
  2437. 586.95 s [Cabal] Warning: 'simpleProgram' is out of scope.
  2438. 586.95 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2439. 586.95 s [Cabal] Warning: 'findProgramOnSearchPath' is out of scope.
  2440. 586.95 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2441. 586.95 s [Cabal] Warning: 'findExecutable' is out of scope.
  2442. 586.95 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2443. 586.95 s [Cabal] 83% ( 10 / 12) in 'Distribution.Simple.Program.Types'
  2444. 586.95 s [Cabal] Missing documentation for:
  2445. 586.95 s [Cabal] ProgramSearchPathEntry (src/Distribution/Simple/Program/Types.hs:105)
  2446. 586.95 s [Cabal] ProgArg (src/Distribution/Simple/Program/Types.hs:83)
  2447. 587.46 s [Cabal] 60% ( 3 / 5) in 'Distribution.Simple.PreProcess.Types'
  2448. 587.46 s [Cabal] Missing documentation for:
  2449. 587.46 s [Cabal] builtinHaskellSuffixes (src/Distribution/Simple/PreProcess/Types.hs:110)
  2450. 587.46 s [Cabal] builtinHaskellBootSuffixes (src/Distribution/Simple/PreProcess/Types.hs:113)
  2451. 587.62 s [Cabal] 0% ( 0 / 5) in 'Distribution.Simple.Errors'
  2452. 587.62 s [Cabal] Missing documentation for:
  2453. 587.62 s [Cabal] Module header
  2454. 587.62 s [Cabal] CabalException (src/Distribution/Simple/Errors.hs:46)
  2455. 587.62 s [Cabal] FailedDependency (src/Distribution/Simple/Errors.hs:39)
  2456. 587.62 s [Cabal] exceptionCode (src/Distribution/Simple/Errors.hs:178)
  2457. 587.62 s [Cabal] exceptionMessage (src/Distribution/Simple/Errors.hs:314)
  2458. 587.87 s [Cabal] 100% ( 3 / 3) in 'Distribution.Simple.PreProcess.Unlit'
  2459. 588.02 s [Cabal] Warning: 'UnitIdU' is ambiguous. It is defined
  2460. 588.02 s [Cabal] * at src/Distribution/Backpack/UnifyM.hs:261:5
  2461. 588.02 s [Cabal] * at src/Distribution/Backpack/UnifyM.hs:268:1
  2462. 588.02 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  2463. 588.02 s [Cabal] by specifying the type/value namespace explicitly.
  2464. 588.02 s [Cabal] Defaulting to the one defined at src/Distribution/Backpack/UnifyM.hs:260:1
  2465. 588.02 s [Cabal] Warning: 'ModuleU' is ambiguous. It is defined
  2466. 588.02 s [Cabal] * at src/Distribution/Backpack/UnifyM.hs:256:5
  2467. 588.02 s [Cabal] * at src/Distribution/Backpack/UnifyM.hs:265:1
  2468. 588.02 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  2469. 588.02 s [Cabal] by specifying the type/value namespace explicitly.
  2470. 588.03 s [Cabal] Defaulting to the one defined at src/Distribution/Backpack/UnifyM.hs:255:1
  2471. 588.03 s [Cabal] Warning: 'ModuleSubst' is out of scope.
  2472. 588.03 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2473. 588.70 s [Cabal] Warning: 'die' is out of scope.
  2474. 588.70 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2475. 588.70 s [Cabal] Warning: 'rawSystem' is out of scope.
  2476. 588.70 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2477. 588.70 s [Cabal] Warning: 'action' is out of scope.
  2478. 588.70 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2479. 588.70 s [Cabal] Warning: 'CreatePipe' is out of scope.
  2480. 588.70 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2481. 588.70 s [Cabal] Warning: 'waitForProcess' is out of scope.
  2482. 588.70 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2483. 588.70 s [Cabal] Warning: 'findModuleFile' is out of scope.
  2484. 588.70 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2485. 588.70 s [Cabal] Warning: 'createDirectoryIfMissing' is out of scope.
  2486. 588.70 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2487. 588.70 s [Cabal] Warning: 'ByteString' is out of scope.
  2488. 588.70 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2489. 588.70 s [Cabal] 85% (122 /142) in 'Distribution.Simple.Utils'
  2490. 588.70 s [Cabal] Missing documentation for:
  2491. 588.70 s [Cabal] cabalVersion (src/Distribution/Simple/Utils.hs:283)
  2492. 588.70 s [Cabal] dieNoVerbosity (src/Distribution/Simple/Utils.hs:345)
  2493. 588.70 s [Cabal] die' (src/Distribution/Simple/Utils.hs:375)
  2494. 588.70 s [Cabal] dieWithException (src/Distribution/Simple/Utils.hs:388)
  2495. 588.70 s [Cabal] dieWithLocation' (src/Distribution/Simple/Utils.hs:364)
  2496. 588.71 s [Cabal] dieNoWrap (src/Distribution/Simple/Utils.hs:407)
  2497. 588.71 s [Cabal] topHandler (src/Distribution/Simple/Utils.hs:514)
  2498. 588.71 s [Cabal] topHandlerWith (src/Distribution/Simple/Utils.hs:463)
  2499. 588.71 s [Cabal] infoNoWrap (src/Distribution/Simple/Utils.hs:602)
  2500. 588.71 s [Cabal] VerboseException (src/Distribution/Simple/Utils.hs:384)
  2501. 588.71 s [Cabal] setFileOrdinary (src/Distribution/Compat/CopyFile.hs:73)
  2502. 588.71 s [Cabal] setFileExecutable (src/Distribution/Compat/CopyFile.hs:73)
  2503. 588.71 s [Cabal] shortRelativePath (src/Distribution/Simple/Utils.hs:1746)
  2504. 588.71 s [Cabal] findFirstFile (src/Distribution/Simple/Utils.hs:1300)
  2505. 588.71 s [Cabal] findAllFilesWithExtension (src/Distribution/Simple/Utils.hs:1272)
  2506. 588.71 s [Cabal] addLibraryPath (src/Distribution/Simple/Utils.hs:1392)
  2507. 588.71 s [Cabal] defaultTempFileOptions (src/Distribution/Simple/Utils.hs:1637)
  2508. 588.71 s [Cabal] createTempDirectory (src/Distribution/Compat/Internal/TempFile.hs:123)
  2509. 588.71 s [Cabal] equating
  2510. 588.71 s [Cabal] unintersperse
  2511. 589.09 s [Cabal] 66% ( 6 / 9) in 'Distribution.Utils.NubList'
  2512. 589.09 s [Cabal] Missing documentation for:
  2513. 589.09 s [Cabal] Module header
  2514. 589.09 s [Cabal] fromNubList (src/Distribution/Utils/NubList.hs:24)
  2515. 589.09 s [Cabal] fromNubListR (src/Distribution/Utils/NubList.hs:83)
  2516. 589.14 s [Cabal] Warning: 'die' is out of scope.
  2517. 589.14 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2518. 589.14 s [Cabal] 85% ( 6 / 7) in 'Distribution.Utils.LogProgress'
  2519. 589.14 s [Cabal] Missing documentation for:
  2520. 589.14 s [Cabal] Module header
  2521. 589.20 s [Cabal] 30% ( 4 / 13) in 'Distribution.Simple.Program.Run'
  2522. 589.20 s [Cabal] Missing documentation for:
  2523. 589.20 s [Cabal] IOEncoding (src/Distribution/Simple/Program/Run.hs:61)
  2524. 589.20 s [Cabal] emptyProgramInvocation (src/Distribution/Simple/Program/Run.hs:70)
  2525. 589.20 s [Cabal] simpleProgramInvocation (src/Distribution/Simple/Program/Run.hs:82)
  2526. 589.20 s [Cabal] programInvocation (src/Distribution/Simple/Program/Run.hs:89)
  2527. 589.20 s [Cabal] runProgramInvocation (src/Distribution/Simple/Program/Run.hs:100)
  2528. 589.20 s [Cabal] getProgramInvocationOutput (src/Distribution/Simple/Program/Run.hs:157)
  2529. 589.20 s [Cabal] getProgramInvocationLBS (src/Distribution/Simple/Program/Run.hs:165)
  2530. 589.20 s [Cabal] getProgramInvocationOutputAndErrors (src/Distribution/Simple/Program/Run.hs:173)
  2531. 589.20 s [Cabal] getProgramInvocationLBSAndErrors (src/Distribution/Simple/Program/Run.hs:185)
  2532. 589.61 s [Cabal] 100% ( 4 / 4) in 'Distribution.Simple.Program.Script'
  2533. 589.76 s [Cabal] 50% ( 1 / 2) in 'Distribution.Simple.Program.ResponseFile'
  2534. 589.76 s [Cabal] Missing documentation for:
  2535. 589.76 s [Cabal] withResponseFile (src/Distribution/Simple/Program/ResponseFile.hs:24)
  2536. 589.85 s [Cabal] 66% ( 2 / 3) in 'Distribution.Simple.Program.Hpc'
  2537. 589.85 s [Cabal] Missing documentation for:
  2538. 589.85 s [Cabal] union (src/Distribution/Simple/Program/Hpc.hs:105)
  2539. 589.90 s [Cabal] 63% ( 7 / 11) in 'Distribution.Simple.Program.Find'
  2540. 589.90 s [Cabal] Missing documentation for:
  2541. 589.90 s [Cabal] ProgramSearchPathEntry (src/Distribution/Simple/Program/Types.hs:105)
  2542. 589.90 s [Cabal] defaultProgramSearchPath (src/Distribution/Simple/Program/Find.hs:65)
  2543. 589.90 s [Cabal] findProgramOnSearchPath (src/Distribution/Simple/Program/Find.hs:77)
  2544. 589.90 s [Cabal] logExtraProgramSearchPath (src/Distribution/Simple/Program/Find.hs:68)
  2545. 590.04 s [Cabal] Warning: 'UnitIndex' is out of scope.
  2546. 590.04 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2547. 590.04 s [Cabal] Warning: 'InstalledPackageInfo' is out of scope.
  2548. 590.04 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2549. 590.04 s [Cabal] Warning: 'Cabal' is out of scope.
  2550. 590.04 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2551. 590.04 s [Cabal] Warning: 'PackageDB' is out of scope.
  2552. 590.04 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2553. 590.04 s [Cabal] 92% ( 38 / 41) in 'Distribution.Simple.PackageIndex'
  2554. 590.04 s [Cabal] Missing documentation for:
  2555. 590.04 s [Cabal] SearchResult (src/Distribution/Simple/PackageIndex.hs:559)
  2556. 590.04 s [Cabal] topologicalOrder (src/Distribution/Simple/PackageIndex.hs:666)
  2557. 590.05 s [Cabal] reverseTopologicalOrder (src/Distribution/Simple/PackageIndex.hs:674)
  2558. 590.23 s [Cabal] 50% ( 3 / 6) in 'Distribution.Simple.PackageDescription'
  2559. 590.30 s [Cabal] Missing documentation for:
  2560. 590.30 s [Cabal] readGenericPackageDescription (src/Distribution/Simple/PackageDescription.hs:44)
  2561. 590.30 s [Cabal] readHookedBuildInfo (src/Distribution/Simple/PackageDescription.hs:47)
  2562. 590.30 s [Cabal] parseString (src/Distribution/Simple/PackageDescription.hs:72)
  2563. 590.37 s [Cabal] Warning: 'matchDirFileGlob' is out of scope.
  2564. 590.37 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2565. 590.37 s [Cabal] Warning: 'Version' is out of scope.
  2566. 590.37 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2567. 590.37 s [Cabal] 68% ( 15 / 22) in 'Distribution.Simple.Glob.Internal'
  2568. 590.37 s [Cabal] Missing documentation for:
  2569. 590.37 s [Cabal] parseFileGlob (src/Distribution/Simple/Glob/Internal.hs:137)
  2570. 590.37 s [Cabal] enableMultidot (src/Distribution/Simple/Glob/Internal.hs:177)
  2571. 590.37 s [Cabal] dispGlobPieces (src/Distribution/Simple/Glob/Internal.hs:233)
  2572. 590.37 s [Cabal] isGlobEscapedChar (src/Distribution/Simple/Glob/Internal.hs:251)
  2573. 590.37 s [Cabal] GlobSyntaxError (src/Distribution/Simple/Glob/Internal.hs:260)
  2574. 590.37 s [Cabal] explainGlobSyntaxError (src/Distribution/Simple/Glob/Internal.hs:271)
  2575. 590.37 s [Cabal] GlobResult (src/Distribution/Simple/Glob/Internal.hs:318)
  2576. 590.56 s [Cabal] Warning: 'die'' is out of scope.
  2577. 590.56 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2578. 590.56 s [Cabal] Warning: 'Version' is out of scope.
  2579. 590.56 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2580. 590.56 s [Cabal] Warning: 'die' is out of scope.
  2581. 590.56 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2582. 590.57 s [Cabal] 75% ( 12 / 16) in 'Distribution.Simple.Glob'
  2583. 590.57 s [Cabal] Missing documentation for:
  2584. 590.57 s [Cabal] GlobResult (src/Distribution/Simple/Glob/Internal.hs:318)
  2585. 590.57 s [Cabal] parseFileGlob (src/Distribution/Simple/Glob/Internal.hs:137)
  2586. 590.57 s [Cabal] GlobSyntaxError (src/Distribution/Simple/Glob/Internal.hs:260)
  2587. 590.57 s [Cabal] explainGlobSyntaxError (src/Distribution/Simple/Glob/Internal.hs:271)
  2588. 590.69 s [Cabal] Warning: 'm' is out of scope.
  2589. 590.69 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2590. 590.69 s [Cabal] Warning: 'local' is out of scope.
  2591. 590.69 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2592. 590.69 s [Cabal] Warning: 'ask' is out of scope.
  2593. 590.69 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2594. 590.85 s [Cabal] Warning: 'TaraAnn' is out of scope.
  2595. 590.85 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2596. 590.98 s [Cabal] Warning: 'LocalBuildInfo' is out of scope.
  2597. 590.98 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2598. 590.98 s [Cabal] 68% ( 33 / 48) in 'Distribution.Simple.Compiler'
  2599. 590.98 s [Cabal] Missing documentation for:
  2600. 590.98 s [Cabal] Compiler (src/Distribution/Simple/Compiler.hs:91)
  2601. 590.98 s [Cabal] showCompilerId (src/Distribution/Simple/Compiler.hs:112)
  2602. 590.98 s [Cabal] showCompilerIdWithAbi (src/Distribution/Simple/Compiler.hs:115)
  2603. 590.98 s [Cabal] compilerFlavor (src/Distribution/Simple/Compiler.hs:122)
  2604. 590.98 s [Cabal] compilerVersion (src/Distribution/Simple/Compiler.hs:125)
  2605. 590.98 s [Cabal] compilerInfo (src/Distribution/Simple/Compiler.hs:154)
  2606. 590.98 s [Cabal] absolutePackageDBPath (src/Distribution/Simple/Compiler.hs:212)
  2607. 590.98 s [Cabal] flagToOptimisationLevel (src/Distribution/Simple/Compiler.hs:236)
  2608. 590.98 s [Cabal] flagToDebugInfoLevel (src/Distribution/Simple/Compiler.hs:269)
  2609. 590.98 s [Cabal] CompilerFlag (src/Distribution/Simple/Compiler.hs:310)
  2610. 590.98 s [Cabal] languageToFlags (src/Distribution/Simple/Compiler.hs:294)
  2611. 590.98 s [Cabal] unsupportedLanguages (src/Distribution/Simple/Compiler.hs:289)
  2612. 590.98 s [Cabal] knownProfDetailLevels (src/Distribution/Simple/Compiler.hs:475)
  2613. 590.98 s [Cabal] flagToProfDetailLevel (src/Distribution/Simple/Compiler.hs:463)
  2614. 590.98 s [Cabal] showProfDetailLevel (src/Distribution/Simple/Compiler.hs:485)
  2615. 591.13 s [Cabal] 65% ( 17 / 26) in 'Distribution.Simple.Program.HcPkg'
  2616. 591.13 s [Cabal] Missing documentation for:
  2617. 591.13 s [Cabal] initInvocation (src/Distribution/Simple/Program/HcPkg.hs:386)
  2618. 591.13 s [Cabal] registerInvocation (src/Distribution/Simple/Program/HcPkg.hs:394)
  2619. 591.13 s [Cabal] unregisterInvocation (src/Distribution/Simple/Program/HcPkg.hs:423)
  2620. 591.13 s [Cabal] recacheInvocation (src/Distribution/Simple/Program/HcPkg.hs:434)
  2621. 591.13 s [Cabal] exposeInvocation (src/Distribution/Simple/Program/HcPkg.hs:444)
  2622. 591.13 s [Cabal] hideInvocation (src/Distribution/Simple/Program/HcPkg.hs:467)
  2623. 591.13 s [Cabal] dumpInvocation (src/Distribution/Simple/Program/HcPkg.hs:478)
  2624. 591.13 s [Cabal] describeInvocation (src/Distribution/Simple/Program/HcPkg.hs:455)
  2625. 591.13 s [Cabal] listInvocation (src/Distribution/Simple/Program/HcPkg.hs:491)
  2626. 591.32 s [Cabal] 18% ( 2 / 11) in 'Distribution.Simple.Program.GHC'
  2627. 591.32 s [Cabal] Missing documentation for:
  2628. 591.32 s [Cabal] Module header
  2629. 591.32 s [Cabal] GhcMode (src/Distribution/Simple/Program/GHC.hs:585)
  2630. 591.32 s [Cabal] GhcOptimisation (src/Distribution/Simple/Program/GHC.hs:600)
  2631. 591.32 s [Cabal] GhcDynLinkMode (src/Distribution/Simple/Program/GHC.hs:611)
  2632. 591.32 s [Cabal] GhcProfAuto (src/Distribution/Simple/Program/GHC.hs:620)
  2633. 591.32 s [Cabal] ghcInvocation (src/Distribution/Simple/Program/GHC.hs:641)
  2634. 591.32 s [Cabal] renderGhcOptions (src/Distribution/Simple/Program/GHC.hs:658)
  2635. 591.32 s [Cabal] runGHC (src/Distribution/Simple/Program/GHC.hs:631)
  2636. 591.32 s [Cabal] normaliseGhcArgs (src/Distribution/Simple/Program/GHC.hs:48)
  2637. 591.84 s [Cabal] 12% ( 4 / 31) in 'Distribution.Simple.Program.Builtin'
  2638. 591.84 s [Cabal] Missing documentation for:
  2639. 591.84 s [Cabal] ghcProgram (src/Distribution/Simple/Program/Builtin.hs:103)
  2640. 591.84 s [Cabal] ghcPkgProgram (src/Distribution/Simple/Program/Builtin.hs:144)
  2641. 591.84 s [Cabal] runghcProgram (src/Distribution/Simple/Program/Builtin.hs:134)
  2642. 591.84 s [Cabal] ghcjsProgram (src/Distribution/Simple/Program/Builtin.hs:155)
  2643. 591.84 s [Cabal] ghcjsPkgProgram (src/Distribution/Simple/Program/Builtin.hs:162)
  2644. 591.84 s [Cabal] hmakeProgram (src/Distribution/Simple/Program/Builtin.hs:173)
  2645. 591.84 s [Cabal] jhcProgram (src/Distribution/Simple/Program/Builtin.hs:184)
  2646. 591.84 s [Cabal] haskellSuiteProgram (src/Distribution/Simple/Program/Builtin.hs:227)
  2647. 591.84 s [Cabal] haskellSuitePkgProgram (src/Distribution/Simple/Program/Builtin.hs:238)
  2648. 591.84 s [Cabal] uhcProgram (src/Distribution/Simple/Program/Builtin.hs:196)
  2649. 591.84 s [Cabal] gccProgram (src/Distribution/Simple/Program/Builtin.hs:267)
  2650. 591.84 s [Cabal] arProgram (src/Distribution/Simple/Program/Builtin.hs:273)
  2651. 591.84 s [Cabal] stripProgram (src/Distribution/Simple/Program/Builtin.hs:276)
  2652. 591.84 s [Cabal] happyProgram (src/Distribution/Simple/Program/Builtin.hs:245)
  2653. 591.84 s [Cabal] alexProgram (src/Distribution/Simple/Program/Builtin.hs:256)
  2654. 591.84 s [Cabal] hsc2hsProgram (src/Distribution/Simple/Program/Builtin.hs:283)
  2655. 591.84 s [Cabal] c2hsProgram (src/Distribution/Simple/Program/Builtin.hs:294)
  2656. 591.84 s [Cabal] cpphsProgram (src/Distribution/Simple/Program/Builtin.hs:300)
  2657. 591.84 s [Cabal] hscolourProgram (src/Distribution/Simple/Program/Builtin.hs:310)
  2658. 591.84 s [Cabal] doctestProgram (src/Distribution/Simple/Program/Builtin.hs:323)
  2659. 591.84 s [Cabal] haddockProgram (src/Distribution/Simple/Program/Builtin.hs:334)
  2660. 591.84 s [Cabal] greencardProgram (src/Distribution/Simple/Program/Builtin.hs:346)
  2661. 591.84 s [Cabal] ldProgram (src/Distribution/Simple/Program/Builtin.hs:349)
  2662. 591.84 s [Cabal] tarProgram (src/Distribution/Simple/Program/Builtin.hs:390)
  2663. 591.84 s [Cabal] cppProgram (src/Distribution/Simple/Program/Builtin.hs:408)
  2664. 591.84 s [Cabal] pkgConfigProgram (src/Distribution/Simple/Program/Builtin.hs:411)
  2665. 591.84 s [Cabal] hpcProgram (src/Distribution/Simple/Program/Builtin.hs:202)
  2666. 591.95 s [Cabal] Warning: 'Programs' is out of scope.
  2667. 591.95 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2668. 591.95 s [Cabal] Warning: 'AnyVersion' is out of scope.
  2669. 591.95 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2670. 591.95 s [Cabal] 82% ( 28 / 34) in 'Distribution.Simple.Program.Db'
  2671. 591.95 s [Cabal] Missing documentation for:
  2672. 591.95 s [Cabal] emptyProgramDb (src/Distribution/Simple/Program/Db.hs:106)
  2673. 591.95 s [Cabal] defaultProgramDb (src/Distribution/Simple/Program/Db.hs:109)
  2674. 591.95 s [Cabal] addKnownPrograms (src/Distribution/Simple/Program/Db.hs:189)
  2675. 591.95 s [Cabal] lookupKnownProgram (src/Distribution/Simple/Program/Db.hs:192)
  2676. 591.95 s [Cabal] knownPrograms (src/Distribution/Simple/Program/Db.hs:196)
  2677. 591.95 s [Cabal] userMaybeSpecifyPath (src/Distribution/Simple/Program/Db.hs:254)
  2678. 592.07 s [Cabal] 50% ( 40 / 80) in 'Distribution.Simple.Program'
  2679. 592.07 s [Cabal] Missing documentation for:
  2680. 592.07 s [Cabal] ProgramSearchPathEntry (src/Distribution/Simple/Program/Types.hs:105)
  2681. 592.07 s [Cabal] findProgramOnSearchPath (src/Distribution/Simple/Program/Find.hs:77)
  2682. 592.07 s [Cabal] defaultProgramSearchPath (src/Distribution/Simple/Program/Find.hs:65)
  2683. 592.07 s [Cabal] ProgArg (src/Distribution/Simple/Program/Types.hs:83)
  2684. 592.07 s [Cabal] emptyProgramInvocation (src/Distribution/Simple/Program/Run.hs:70)
  2685. 592.07 s [Cabal] simpleProgramInvocation (src/Distribution/Simple/Program/Run.hs:82)
  2686. 592.07 s [Cabal] programInvocation (src/Distribution/Simple/Program/Run.hs:89)
  2687. 592.07 s [Cabal] runProgramInvocation (src/Distribution/Simple/Program/Run.hs:100)
  2688. 592.07 s [Cabal] getProgramInvocationOutput (src/Distribution/Simple/Program/Run.hs:157)
  2689. 592.07 s [Cabal] getProgramInvocationLBS (src/Distribution/Simple/Program/Run.hs:165)
  2690. 592.07 s [Cabal] defaultProgramDb (src/Distribution/Simple/Program/Db.hs:109)
  2691. 592.07 s [Cabal] emptyProgramDb (src/Distribution/Simple/Program/Db.hs:106)
  2692. 592.07 s [Cabal] addKnownPrograms (src/Distribution/Simple/Program/Db.hs:189)
  2693. 592.07 s [Cabal] lookupKnownProgram (src/Distribution/Simple/Program/Db.hs:192)
  2694. 592.07 s [Cabal] knownPrograms (src/Distribution/Simple/Program/Db.hs:196)
  2695. 592.07 s [Cabal] userMaybeSpecifyPath (src/Distribution/Simple/Program/Db.hs:254)
  2696. 592.07 s [Cabal] ghcProgram (src/Distribution/Simple/Program/Builtin.hs:103)
  2697. 592.07 s [Cabal] ghcPkgProgram (src/Distribution/Simple/Program/Builtin.hs:144)
  2698. 592.07 s [Cabal] ghcjsProgram (src/Distribution/Simple/Program/Builtin.hs:155)
  2699. 592.07 s [Cabal] ghcjsPkgProgram (src/Distribution/Simple/Program/Builtin.hs:162)
  2700. 592.07 s [Cabal] hmakeProgram (src/Distribution/Simple/Program/Builtin.hs:173)
  2701. 592.07 s [Cabal] jhcProgram (src/Distribution/Simple/Program/Builtin.hs:184)
  2702. 592.07 s [Cabal] uhcProgram (src/Distribution/Simple/Program/Builtin.hs:196)
  2703. 592.07 s [Cabal] gccProgram (src/Distribution/Simple/Program/Builtin.hs:267)
  2704. 592.07 s [Cabal] arProgram (src/Distribution/Simple/Program/Builtin.hs:273)
  2705. 592.07 s [Cabal] stripProgram (src/Distribution/Simple/Program/Builtin.hs:276)
  2706. 592.07 s [Cabal] happyProgram (src/Distribution/Simple/Program/Builtin.hs:245)
  2707. 592.07 s [Cabal] alexProgram (src/Distribution/Simple/Program/Builtin.hs:256)
  2708. 592.07 s [Cabal] hsc2hsProgram (src/Distribution/Simple/Program/Builtin.hs:283)
  2709. 592.07 s [Cabal] c2hsProgram (src/Distribution/Simple/Program/Builtin.hs:294)
  2710. 592.07 s [Cabal] cpphsProgram (src/Distribution/Simple/Program/Builtin.hs:300)
  2711. 592.07 s [Cabal] hscolourProgram (src/Distribution/Simple/Program/Builtin.hs:310)
  2712. 592.07 s [Cabal] doctestProgram (src/Distribution/Simple/Program/Builtin.hs:323)
  2713. 592.07 s [Cabal] haddockProgram (src/Distribution/Simple/Program/Builtin.hs:334)
  2714. 592.07 s [Cabal] greencardProgram (src/Distribution/Simple/Program/Builtin.hs:346)
  2715. 592.07 s [Cabal] ldProgram (src/Distribution/Simple/Program/Builtin.hs:349)
  2716. 592.07 s [Cabal] tarProgram (src/Distribution/Simple/Program/Builtin.hs:390)
  2717. 592.07 s [Cabal] cppProgram (src/Distribution/Simple/Program/Builtin.hs:408)
  2718. 592.07 s [Cabal] pkgConfigProgram (src/Distribution/Simple/Program/Builtin.hs:411)
  2719. 592.07 s [Cabal] hpcProgram (src/Distribution/Simple/Program/Builtin.hs:202)
  2720. 592.16 s [Cabal] 33% ( 1 / 3) in 'Distribution.Simple.Program.Strip'
  2721. 592.16 s [Cabal] Missing documentation for:
  2722. 592.16 s [Cabal] stripLib (src/Distribution/Simple/Program/Strip.hs:51)
  2723. 592.16 s [Cabal] stripExe (src/Distribution/Simple/Program/Strip.hs:40)
  2724. 592.29 s [Cabal] Warning: 'GetOpt' is out of scope.
  2725. 592.29 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2726. 592.29 s [Cabal] Warning: 'smart' is out of scope.
  2727. 592.29 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2728. 592.29 s [Cabal] 61% ( 33 / 54) in 'Distribution.Simple.Command'
  2729. 592.29 s [Cabal] Missing documentation for:
  2730. 592.29 s [Cabal] CommandUI (src/Distribution/Simple/Command.hs:97)
  2731. 592.29 s [Cabal] CommandParse (src/Distribution/Simple/Command.hs:596)
  2732. 592.29 s [Cabal] helpCommandUI (src/Distribution/Simple/Command.hs:763)
  2733. 592.29 s [Cabal] ShowOrParseArgs (src/Distribution/Simple/Command.hs:116)
  2734. 592.29 s [Cabal] Command (src/Distribution/Simple/Command.hs:608)
  2735. 592.29 s [Cabal] commandAddAction (src/Distribution/Simple/Command.hs:617)
  2736. 592.29 s [Cabal] CommandType (src/Distribution/Simple/Command.hs:607)
  2737. 592.29 s [Cabal] commandFromSpec (src/Distribution/Simple/Command.hs:787)
  2738. 592.29 s [Cabal] commandsRun (src/Distribution/Simple/Command.hs:654)
  2739. 592.29 s [Cabal] commandsRunWithFallback (src/Distribution/Simple/Command.hs:669)
  2740. 592.29 s [Cabal] defaultCommandFallback (src/Distribution/Simple/Command.hs:662)
  2741. 592.29 s [Cabal] Name (src/Distribution/Simple/Command.hs:117)
  2742. 592.29 s [Cabal] liftOption (src/Distribution/Simple/Command.hs:373)
  2743. 592.29 s [Cabal] Description (src/Distribution/Simple/Command.hs:118)
  2744. 592.29 s [Cabal] OptFlags (src/Distribution/Simple/Command.hs:160)
  2745. 592.29 s [Cabal] ArgPlaceHolder (src/Distribution/Simple/Command.hs:161)
  2746. 592.29 s [Cabal] MkOptDescr (src/Distribution/Simple/Command.hs:200)
  2747. 592.29 s [Cabal] optArgDef' (src/Distribution/Simple/Command.hs:269)
  2748. 592.29 s [Cabal] noArg (src/Distribution/Simple/Command.hs:278)
  2749. 592.29 s [Cabal] boolOpt (src/Distribution/Simple/Command.hs:281)
  2750. 592.29 s [Cabal] boolOpt' (src/Distribution/Simple/Command.hs:293)
  2751. 592.45 s [Cabal] Warning: 'progDb' is out of scope.
  2752. 592.45 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2753. 592.97 s [Cabal] Warning: 'haddocksInterfaces' is out of scope.
  2754. 592.97 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2755. 592.97 s [Cabal] Warning: 'haddocksAction' is out of scope.
  2756. 592.97 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2757. 593.61 s [Cabal] Warning: 'InstalledPackageInfo' is out of scope.
  2758. 593.61 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2759. 593.61 s [Cabal] 77% ( 7 / 9) in 'Distribution.Types.LocalBuildConfig'
  2760. 593.61 s [Cabal] Missing documentation for:
  2761. 593.61 s [Cabal] Module header
  2762. 593.61 s [Cabal] buildOptionsConfigFlags (src/Distribution/Types/LocalBuildConfig.hs:201)
  2763. 593.99 s [Cabal] Warning: 'Component' is out of scope.
  2764. 593.99 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2765. 593.99 s [Cabal] Warning: 'LocalBuildInfo' is ambiguous. It is defined
  2766. 593.99 s [Cabal] * at src/Distribution/Types/LocalBuildInfo.hs:180:1
  2767. 593.99 s [Cabal] * at src/Distribution/Types/LocalBuildInfo.hs:129:1
  2768. 593.99 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  2769. 593.99 s [Cabal] by specifying the type/value namespace explicitly.
  2770. 593.99 s [Cabal] Defaulting to the one defined at src/Distribution/Types/LocalBuildInfo.hs:129:1
  2771. 593.99 s [Cabal] Warning: 'LocalBuildDescr' is out of scope.
  2772. 593.99 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2773. 593.99 s [Cabal] Warning: 'LocalBuildConfig' is out of scope.
  2774. 593.99 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2775. 593.99 s [Cabal] 53% ( 16 / 30) in 'Distribution.Types.LocalBuildInfo'
  2776. 593.99 s [Cabal] Missing documentation for:
  2777. 593.99 s [Cabal] Module header
  2778. 593.99 s [Cabal] buildDir (src/Distribution/Types/LocalBuildInfo.hs:276)
  2779. 593.99 s [Cabal] buildDirPBD (src/Distribution/Types/LocalBuildInfo.hs:280)
  2780. 593.99 s [Cabal] configFlagsBuildDir (src/Distribution/Types/LocalBuildInfo.hs:284)
  2781. 593.99 s [Cabal] cabalFilePath (src/Distribution/Types/LocalBuildInfo.hs:287)
  2782. 593.99 s [Cabal] progPrefix (src/Distribution/Types/LocalBuildInfo.hs:291)
  2783. 593.99 s [Cabal] progSuffix (src/Distribution/Types/LocalBuildInfo.hs:291)
  2784. 593.99 s [Cabal] unitIdTarget' (src/Distribution/Types/LocalBuildInfo.hs:359)
  2785. 593.99 s [Cabal] componentNameTargets (src/Distribution/Types/LocalBuildInfo.hs:419)
  2786. 593.99 s [Cabal] unitIdTarget (src/Distribution/Types/LocalBuildInfo.hs:422)
  2787. 593.99 s [Cabal] allTargetsInBuildOrder (src/Distribution/Types/LocalBuildInfo.hs:425)
  2788. 593.99 s [Cabal] withAllTargetsInBuildOrder (src/Distribution/Types/LocalBuildInfo.hs:428)
  2789. 593.99 s [Cabal] neededTargetsInBuildOrder (src/Distribution/Types/LocalBuildInfo.hs:431)
  2790. 593.99 s [Cabal] withNeededTargetsInBuildOrder (src/Distribution/Types/LocalBuildInfo.hs:434)
  2791. 594.04 s [Cabal] Warning: 'compBuildOrder' is out of scope.
  2792. 594.04 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2793. 594.04 s [Cabal] 49% ( 31 / 63) in 'Distribution.Simple.LocalBuildInfo'
  2794. 594.04 s [Cabal] Missing documentation for:
  2795. 594.04 s [Cabal] buildDir (src/Distribution/Types/LocalBuildInfo.hs:276)
  2796. 594.04 s [Cabal] cabalFilePath (src/Distribution/Types/LocalBuildInfo.hs:287)
  2797. 594.04 s [Cabal] progPrefix (src/Distribution/Types/LocalBuildInfo.hs:291)
  2798. 594.04 s [Cabal] progSuffix (src/Distribution/Types/LocalBuildInfo.hs:291)
  2799. 594.04 s [Cabal] Component
  2800. 594.04 s [Cabal] ComponentName
  2801. 594.04 s [Cabal] LibraryName
  2802. 594.04 s [Cabal] defaultLibName
  2803. 594.04 s [Cabal] showComponentName
  2804. 594.04 s [Cabal] componentBuildDir (src/Distribution/Simple/LocalBuildInfo.hs:111)
  2805. 594.04 s [Cabal] foldComponent
  2806. 594.04 s [Cabal] componentName
  2807. 594.04 s [Cabal] componentBuildInfo
  2808. 594.04 s [Cabal] lookupComponent
  2809. 594.04 s [Cabal] getComponent
  2810. 594.04 s [Cabal] allComponentsInBuildOrder (src/Distribution/Simple/LocalBuildInfo.hs:208)
  2811. 594.04 s [Cabal] withTestLBI (src/Distribution/Simple/LocalBuildInfo.hs:168)
  2812. 594.04 s [Cabal] enabledTestLBIs (src/Distribution/Simple/LocalBuildInfo.hs:176)
  2813. 594.04 s [Cabal] enabledBenchLBIs (src/Distribution/Simple/LocalBuildInfo.hs:186)
  2814. 594.04 s [Cabal] PathTemplateVariable (src/Distribution/Simple/InstallDirs/Internal.hs:20)
  2815. 594.04 s [Cabal] PathTemplateEnv (src/Distribution/Simple/InstallDirs.hs:395)
  2816. 594.04 s [Cabal] defaultInstallDirs (src/Distribution/Simple/InstallDirs.hs:178)
  2817. 594.04 s [Cabal] defaultInstallDirs' (src/Distribution/Simple/InstallDirs.hs:181)
  2818. 594.04 s [Cabal] combineInstallDirs (src/Distribution/Simple/InstallDirs.hs:116)
  2819. 594.04 s [Cabal] combinePathTemplate (src/Distribution/Simple/InstallDirs.hs:409)
  2820. 594.04 s [Cabal] platformTemplateEnv (src/Distribution/Simple/InstallDirs.hs:451)
  2821. 594.04 s [Cabal] compilerTemplateEnv (src/Distribution/Simple/InstallDirs.hs:446)
  2822. 594.04 s [Cabal] packageTemplateEnv (src/Distribution/Simple/InstallDirs.hs:436)
  2823. 594.04 s [Cabal] abiTemplateEnv (src/Distribution/Simple/InstallDirs.hs:457)
  2824. 594.04 s [Cabal] installDirsTemplateEnv (src/Distribution/Simple/InstallDirs.hs:476)
  2825. 594.04 s [Cabal] absoluteInstallCommandDirs (src/Distribution/Simple/LocalBuildInfo.hs:372)
  2826. 594.04 s [Cabal] substPathTemplate (src/Distribution/Simple/LocalBuildInfo.hs:430)
  2827. 594.08 s [Cabal] 71% ( 10 / 14) in 'Distribution.Simple.Test.Log'
  2828. 594.08 s [Cabal] Missing documentation for:
  2829. 594.08 s [Cabal] Module header
  2830. 594.08 s [Cabal] TestLogs (src/Distribution/Simple/Test/Log.hs:66)
  2831. 594.08 s [Cabal] summarizeSuiteStart (src/Distribution/Simple/Test/Log.hs:192)
  2832. 594.08 s [Cabal] testSuiteLogPath (src/Distribution/Simple/Test/Log.hs:118)
  2833. 594.11 s [Cabal] 55% ( 5 / 9) in 'Distribution.Simple.Hpc'
  2834. 594.11 s [Cabal] Missing documentation for:
  2835. 594.11 s [Cabal] Way (src/Distribution/Simple/Hpc.hs:55)
  2836. 594.11 s [Cabal] htmlDir (src/Distribution/Simple/Hpc.hs:98)
  2837. 594.11 s [Cabal] mixDir (src/Distribution/Simple/Hpc.hs:71)
  2838. 594.11 s [Cabal] tixDir (src/Distribution/Simple/Hpc.hs:79)
  2839. 594.12 s [Cabal] 50% ( 1 / 2) in 'Distribution.Simple.Build.PackageInfoModule'
  2840. 594.12 s [Cabal] Missing documentation for:
  2841. 594.12 s [Cabal] generatePackageInfoModule (src/Distribution/Simple/Build/PackageInfoModule.hs:36)
  2842. 594.14 s [Cabal] 100% ( 3 / 3) in 'Distribution.Simple.Build.Macros'
  2843. 594.16 s [Cabal] Warning: 'computeCompatPackageName' is out of scope.
  2844. 594.16 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2845. 594.19 s [Cabal] 54% ( 6 / 11) in 'Distribution.Backpack.ConfiguredComponent'
  2846. 594.19 s [Cabal] Missing documentation for:
  2847. 594.19 s [Cabal] toConfiguredComponent (src/Distribution/Backpack/ConfiguredComponent.hs:172)
  2848. 594.19 s [Cabal] toConfiguredComponents (src/Distribution/Backpack/ConfiguredComponent.hs:307)
  2849. 594.19 s [Cabal] ConfiguredComponentMap (src/Distribution/Backpack/ConfiguredComponent.hs:169)
  2850. 594.19 s [Cabal] extendConfiguredComponentMap (src/Distribution/Backpack/ConfiguredComponent.hs:288)
  2851. 594.20 s [Cabal] newPackageDepsBehaviour (src/Distribution/Backpack/ConfiguredComponent.hs:349)
  2852. 594.25 s [Cabal] Warning: 'ReadyComponent' is out of scope.
  2853. 594.25 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2854. 594.25 s [Cabal] Warning: 'ModSubst' is out of scope.
  2855. 594.25 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2856. 594.25 s [Cabal] 54% ( 6 / 11) in 'Distribution.Backpack.LinkedComponent'
  2857. 594.25 s [Cabal] Missing documentation for:
  2858. 594.25 s [Cabal] toLinkedComponent (src/Distribution/Backpack/LinkedComponent.hs:114)
  2859. 594.25 s [Cabal] toLinkedComponents (src/Distribution/Backpack/LinkedComponent.hs:407)
  2860. 594.25 s [Cabal] dispLinkedComponent (src/Distribution/Backpack/LinkedComponent.hs:98)
  2861. 594.25 s [Cabal] LinkedComponentMap (src/Distribution/Backpack/LinkedComponent.hs:430)
  2862. 594.25 s [Cabal] extendLinkedComponentMap (src/Distribution/Backpack/LinkedComponent.hs:432)
  2863. 594.30 s [Cabal] 100% ( 7 / 7) in 'Distribution.Backpack.ComponentsGraph'
  2864. 594.32 s [Cabal] 100% ( 2 / 2) in 'Distribution.Simple.Program.Ld'
  2865. 594.52 s [Cabal] 100% ( 3 / 3) in 'Distribution.Simple.Program.Ar'
  2866. 594.66 s [Cabal] Warning: 'CommandUI' is out of scope.
  2867. 594.66 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2868. 594.66 s [Cabal] Warning: 'Monoid' is out of scope.
  2869. 594.66 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2870. 594.66 s [Cabal] 25% ( 26 /102) in 'Distribution.Simple.Setup'
  2871. 594.66 s [Cabal] Missing documentation for:
  2872. 594.66 s [Cabal] emptyGlobalFlags (src/Distribution/Simple/Setup/Global.hs:114)
  2873. 594.66 s [Cabal] defaultGlobalFlags (src/Distribution/Simple/Setup/Global.hs:53)
  2874. 594.66 s [Cabal] globalCommand (src/Distribution/Simple/Setup/Global.hs:60)
  2875. 594.66 s [Cabal] emptyConfigFlags (src/Distribution/Simple/Setup/Config.hs:1023)
  2876. 594.66 s [Cabal] defaultConfigFlags (src/Distribution/Simple/Setup/Config.hs:309)
  2877. 594.66 s [Cabal] configureCommand (src/Distribution/Simple/Setup/Config.hs:355)
  2878. 594.66 s [Cabal] configAbsolutePaths (src/Distribution/Simple/Setup/Config.hs:301)
  2879. 594.66 s [Cabal] readPackageDbList (src/Distribution/Simple/Setup/Config.hs:868)
  2880. 594.66 s [Cabal] showPackageDbList (src/Distribution/Simple/Setup/Config.hs:880)
  2881. 594.66 s [Cabal] emptyCopyFlags (src/Distribution/Simple/Setup/Copy.hs:145)
  2882. 594.66 s [Cabal] defaultCopyFlags (src/Distribution/Simple/Setup/Copy.hs:61)
  2883. 594.66 s [Cabal] copyCommand (src/Distribution/Simple/Setup/Copy.hs:71)
  2884. 594.66 s [Cabal] emptyInstallFlags (src/Distribution/Simple/Setup/Install.hs:150)
  2885. 594.66 s [Cabal] defaultInstallFlags (src/Distribution/Simple/Setup/Install.hs:60)
  2886. 594.66 s [Cabal] installCommand (src/Distribution/Simple/Setup/Install.hs:72)
  2887. 594.66 s [Cabal] HaddockFlags (src/Distribution/Simple/Setup/Haddock.hs:83)
  2888. 594.66 s [Cabal] emptyHaddockFlags (src/Distribution/Simple/Setup/Haddock.hs:356)
  2889. 594.66 s [Cabal] defaultHaddockFlags (src/Distribution/Simple/Setup/Haddock.hs:115)
  2890. 594.66 s [Cabal] haddockCommand (src/Distribution/Simple/Setup/Haddock.hs:145)
  2891. 594.66 s [Cabal] HaddockProjectFlags (src/Distribution/Simple/Setup/Haddock.hs:379)
  2892. 594.66 s [Cabal] emptyHaddockProjectFlags (src/Distribution/Simple/Setup/Haddock.hs:598)
  2893. 594.66 s [Cabal] defaultHaddockProjectFlags (src/Distribution/Simple/Setup/Haddock.hs:421)
  2894. 594.66 s [Cabal] haddockProjectCommand (src/Distribution/Simple/Setup/Haddock.hs:445)
  2895. 594.66 s [Cabal] HscolourFlags (src/Distribution/Simple/Setup/Hscolour.hs:42)
  2896. 594.66 s [Cabal] emptyHscolourFlags (src/Distribution/Simple/Setup/Hscolour.hs:57)
  2897. 594.66 s [Cabal] defaultHscolourFlags (src/Distribution/Simple/Setup/Hscolour.hs:60)
  2898. 594.66 s [Cabal] hscolourCommand (src/Distribution/Simple/Setup/Hscolour.hs:80)
  2899. 594.66 s [Cabal] BuildFlags (src/Distribution/Simple/Setup/Build.hs:47)
  2900. 594.66 s [Cabal] emptyBuildFlags (src/Distribution/Simple/Setup/Build.hs:157)
  2901. 594.66 s [Cabal] defaultBuildFlags (src/Distribution/Simple/Setup/Build.hs:64)
  2902. 594.66 s [Cabal] buildCommand (src/Distribution/Simple/Setup/Build.hs:77)
  2903. 594.66 s [Cabal] DumpBuildInfo (src/Distribution/Types/DumpBuildInfo.hs:10)
  2904. 594.66 s [Cabal] ReplFlags (src/Distribution/Simple/Setup/Repl.hs:63)
  2905. 594.66 s [Cabal] defaultReplFlags (src/Distribution/Simple/Setup/Repl.hs:76)
  2906. 594.66 s [Cabal] replCommand (src/Distribution/Simple/Setup/Repl.hs:94)
  2907. 594.66 s [Cabal] ReplOptions (src/Distribution/Simple/Setup/Repl.hs:46)
  2908. 594.66 s [Cabal] CleanFlags (src/Distribution/Simple/Setup/Clean.hs:42)
  2909. 594.66 s [Cabal] emptyCleanFlags (src/Distribution/Simple/Setup/Clean.hs:89)
  2910. 594.66 s [Cabal] defaultCleanFlags (src/Distribution/Simple/Setup/Clean.hs:53)
  2911. 594.66 s [Cabal] cleanCommand (src/Distribution/Simple/Setup/Clean.hs:62)
  2912. 594.66 s [Cabal] emptyRegisterFlags (src/Distribution/Simple/Setup/Register.hs:187)
  2913. 594.66 s [Cabal] defaultRegisterFlags (src/Distribution/Simple/Setup/Register.hs:60)
  2914. 594.66 s [Cabal] registerCommand (src/Distribution/Simple/Setup/Register.hs:74)
  2915. 594.66 s [Cabal] unregisterCommand (src/Distribution/Simple/Setup/Register.hs:141)
  2916. 594.66 s [Cabal] emptySDistFlags (src/Distribution/Simple/Setup/SDist.hs:105)
  2917. 594.66 s [Cabal] defaultSDistFlags (src/Distribution/Simple/Setup/SDist.hs:52)
  2918. 594.66 s [Cabal] sdistCommand (src/Distribution/Simple/Setup/SDist.hs:62)
  2919. 594.66 s [Cabal] TestFlags (src/Distribution/Simple/Setup/Test.hs:82)
  2920. 594.66 s [Cabal] emptyTestFlags (src/Distribution/Simple/Setup/Test.hs:246)
  2921. 594.66 s [Cabal] defaultTestFlags (src/Distribution/Simple/Setup/Test.hs:99)
  2922. 594.66 s [Cabal] testCommand (src/Distribution/Simple/Setup/Test.hs:113)
  2923. 594.67 s [Cabal] TestShowDetails (src/Distribution/Simple/Setup/Test.hs:51)
  2924. 594.67 s [Cabal] BenchmarkFlags (src/Distribution/Simple/Setup/Benchmark.hs:45)
  2925. 594.67 s [Cabal] emptyBenchmarkFlags (src/Distribution/Simple/Setup/Benchmark.hs:123)
  2926. 594.67 s [Cabal] defaultBenchmarkFlags (src/Distribution/Simple/Setup/Benchmark.hs:55)
  2927. 594.67 s [Cabal] benchmarkCommand (src/Distribution/Simple/Setup/Benchmark.hs:63)
  2928. 594.67 s [Cabal] configureOptions (src/Distribution/Simple/Setup/Config.hs:402)
  2929. 594.67 s [Cabal] configureCCompiler (src/Distribution/Simple/Setup/Common.hs:323)
  2930. 594.67 s [Cabal] configureLinker (src/Distribution/Simple/Setup/Common.hs:329)
  2931. 594.67 s [Cabal] buildOptions (src/Distribution/Simple/Setup/Build.hs:125)
  2932. 594.67 s [Cabal] haddockOptions (src/Distribution/Simple/Setup/Haddock.hs:183)
  2933. 594.67 s [Cabal] haddockProjectOptions (src/Distribution/Simple/Setup/Haddock.hs:483)
  2934. 594.67 s [Cabal] installDirsOptions (src/Distribution/Simple/Setup/Config.hs:919)
  2935. 594.67 s [Cabal] testOptions' (src/Distribution/Simple/Setup/Test.hs:133)
  2936. 594.67 s [Cabal] benchmarkOptions' (src/Distribution/Simple/Setup/Benchmark.hs:83)
  2937. 594.67 s [Cabal] programFlagsDescription (src/Distribution/Simple/Setup/Common.hs:104)
  2938. 594.67 s [Cabal] replOptions (src/Distribution/Simple/Setup/Repl.hs:182)
  2939. 594.67 s [Cabal] defaultDistPref (src/Distribution/Simple/Setup/Common.hs:64)
  2940. 594.67 s [Cabal] optionDistPref (src/Distribution/Simple/Setup/Common.hs:250)
  2941. 594.67 s [Cabal] boolOpt (src/Distribution/Simple/Setup/Common.hs:224)
  2942. 594.67 s [Cabal] boolOpt' (src/Distribution/Simple/Setup/Common.hs:230)
  2943. 594.67 s [Cabal] trueArg (src/Distribution/Simple/Setup/Common.hs:236)
  2944. 594.67 s [Cabal] falseArg (src/Distribution/Simple/Setup/Common.hs:236)
  2945. 594.67 s [Cabal] optionVerbosity (src/Distribution/Simple/Setup/Common.hs:271)
  2946. 594.67 s [Cabal] buildingWhatVerbosity (src/Distribution/Simple/Setup.hs:179)
  2947. 594.67 s [Cabal] buildingWhatDistPref (src/Distribution/Simple/Setup.hs:186)
  2948. 594.67 s [Cabal] Warning: 'Library' is out of scope.
  2949. 594.67 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2950. 594.67 s [Cabal] 81% ( 13 / 16) in 'Distribution.Simple.Build.Inputs'
  2951. 594.67 s [Cabal] Missing documentation for:
  2952. 594.67 s [Cabal] Module header
  2953. 594.67 s [Cabal] buildingWhatVerbosity (src/Distribution/Simple/Setup.hs:179)
  2954. 594.67 s [Cabal] buildingWhatDistPref (src/Distribution/Simple/Setup.hs:186)
  2955. 594.74 s [Cabal] Warning: 'matchExactly' is out of scope.
  2956. 594.74 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2957. 594.74 s [Cabal] Warning: 'ambiguousWith' is out of scope.
  2958. 594.74 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2959. 594.74 s [Cabal] Warning: 'shadows' is out of scope.
  2960. 594.74 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2961. 594.74 s [Cabal] 57% ( 11 / 19) in 'Distribution.Simple.BuildTarget'
  2962. 594.74 s [Cabal] Missing documentation for:
  2963. 594.74 s [Cabal] QualLevel (src/Distribution/Simple/BuildTarget.hs:371)
  2964. 594.74 s [Cabal] buildTargetComponentName (src/Distribution/Simple/BuildTarget.hs:135)
  2965. 594.74 s [Cabal] readUserBuildTargets (src/Distribution/Simple/BuildTarget.hs:178)
  2966. 594.74 s [Cabal] showUserBuildTarget (src/Distribution/Simple/BuildTarget.hs:254)
  2967. 594.74 s [Cabal] UserBuildTargetProblem (src/Distribution/Simple/BuildTarget.hs:242)
  2968. 594.74 s [Cabal] reportUserBuildTargetProblems (src/Distribution/Simple/BuildTarget.hs:246)
  2969. 594.74 s [Cabal] BuildTargetProblem (src/Distribution/Simple/BuildTarget.hs:334)
  2970. 594.74 s [Cabal] reportBuildTargetProblems (src/Distribution/Simple/BuildTarget.hs:396)
  2971. 594.84 s [Cabal] Warning: 'lib' is out of scope.
  2972. 594.84 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2973. 594.84 s [Cabal] Warning: 'C' is out of scope.
  2974. 594.84 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2975. 594.84 s [Cabal] 58% ( 18 / 31) in 'Distribution.Simple.BuildPaths'
  2976. 594.84 s [Cabal] Missing documentation for:
  2977. 594.84 s [Cabal] defaultDistPref (src/Distribution/Simple/Setup/Common.hs:64)
  2978. 594.84 s [Cabal] srcPref (src/Distribution/Simple/BuildPaths.hs:73)
  2979. 594.84 s [Cabal] hscolourPref (src/Distribution/Simple/BuildPaths.hs:76)
  2980. 594.84 s [Cabal] cppHeaderName (src/Distribution/Simple/BuildPaths.hs:107)
  2981. 594.84 s [Cabal] haddockName (src/Distribution/Simple/BuildPaths.hs:128)
  2982. 594.84 s [Cabal] mkLibName (src/Distribution/Simple/BuildPaths.hs:219)
  2983. 594.84 s [Cabal] mkProfLibName (src/Distribution/Simple/BuildPaths.hs:222)
  2984. 594.84 s [Cabal] mkSharedLibName (src/Distribution/Simple/BuildPaths.hs:237)
  2985. 594.84 s [Cabal] mkStaticLibName (src/Distribution/Simple/BuildPaths.hs:243)
  2986. 594.84 s [Cabal] getSourceFiles (src/Distribution/Simple/BuildPaths.hs:186)
  2987. 594.84 s [Cabal] getLibSourceFiles (src/Distribution/Simple/BuildPaths.hs:134)
  2988. 594.84 s [Cabal] getExeSourceFiles (src/Distribution/Simple/BuildPaths.hs:151)
  2989. 594.84 s [Cabal] getFLibSourceFiles (src/Distribution/Simple/BuildPaths.hs:170)
  2990. 594.87 s [Cabal] 12% ( 1 / 8) in 'Distribution.Simple.UHC'
  2991. 594.87 s [Cabal] Missing documentation for:
  2992. 594.87 s [Cabal] configure (src/Distribution/Simple/UHC.hs:58)
  2993. 594.87 s [Cabal] getInstalledPackages (src/Distribution/Simple/UHC.hs:112)
  2994. 594.87 s [Cabal] buildLib (src/Distribution/Simple/UHC.hs:201)
  2995. 594.87 s [Cabal] buildExe (src/Distribution/Simple/UHC.hs:235)
  2996. 594.87 s [Cabal] installLib (src/Distribution/Simple/UHC.hs:314)
  2997. 594.87 s [Cabal] registerPackage (src/Distribution/Simple/UHC.hs:343)
  2998. 594.87 s [Cabal] inplacePackageDbPath (src/Distribution/Simple/UHC.hs:364)
  2999. 594.91 s [Cabal] 0% ( 0 / 13) in 'Distribution.Simple.HaskellSuite'
  3000. 594.91 s [Cabal] Missing documentation for:
  3001. 594.91 s [Cabal] Module header
  3002. 594.91 s [Cabal] configure (src/Distribution/Simple/HaskellSuite.hs:30)
  3003. 594.91 s [Cabal] hstoolVersion (src/Distribution/Simple/HaskellSuite.hs:92)
  3004. 594.91 s [Cabal] numericVersion (src/Distribution/Simple/HaskellSuite.hs:95)
  3005. 594.91 s [Cabal] getCompilerVersion (src/Distribution/Simple/HaskellSuite.hs:98)
  3006. 594.91 s [Cabal] getExtensions (src/Distribution/Simple/HaskellSuite.hs:112)
  3007. 594.91 s [Cabal] getLanguages (src/Distribution/Simple/HaskellSuite.hs:120)
  3008. 594.91 s [Cabal] getInstalledPackages (src/Distribution/Simple/HaskellSuite.hs:130)
  3009. 594.91 s [Cabal] buildLib (src/Distribution/Simple/HaskellSuite.hs:166)
  3010. 594.91 s [Cabal] installLib (src/Distribution/Simple/HaskellSuite.hs:211)
  3011. 594.91 s [Cabal] registerPackage (src/Distribution/Simple/HaskellSuite.hs:239)
  3012. 594.91 s [Cabal] initPackageDB (src/Distribution/Simple/HaskellSuite.hs:256)
  3013. 594.91 s [Cabal] packageDbOpt (src/Distribution/Simple/HaskellSuite.hs:264)
  3014. 594.98 s [Cabal] Warning: 'Arch' is ambiguous. It is defined
  3015. 594.98 s [Cabal] * in ‘Distribution.Types.ConfVar’
  3016. 594.98 s [Cabal] * in ‘Distribution.System’
  3017. 594.98 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  3018. 594.98 s [Cabal] by specifying the type/value namespace explicitly.
  3019. 594.98 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.ConfVar’
  3020. 594.98 s [Cabal] Warning: 'OS' is ambiguous. It is defined
  3021. 594.98 s [Cabal] * in ‘Distribution.Types.ConfVar’
  3022. 594.98 s [Cabal] * in ‘Distribution.System’
  3023. 594.98 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  3024. 594.98 s [Cabal] by specifying the type/value namespace explicitly.
  3025. 594.98 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.ConfVar’
  3026. 595.17 s [Cabal] Warning: 'hsLibraries' is out of scope.
  3027. 595.17 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  3028. 595.17 s [Cabal] 52% ( 20 / 38) in 'Distribution.Simple.GHCJS'
  3029. 595.17 s [Cabal] Missing documentation for:
  3030. 595.17 s [Cabal] Module header
  3031. 595.17 s [Cabal] getGhcInfo (src/Distribution/Simple/GHCJS.hs:307)
  3032. 595.17 s [Cabal] configure (src/Distribution/Simple/GHCJS.hs:111)
  3033. 595.17 s [Cabal] buildLib (src/Distribution/Simple/GHCJS.hs:455)
  3034. 595.17 s [Cabal] replLib (src/Distribution/Simple/GHCJS.hs:465)
  3035. 595.17 s [Cabal] replFLib (src/Distribution/Simple/GHCJS.hs:882)
  3036. 595.17 s [Cabal] replExe (src/Distribution/Simple/GHCJS.hs:905)
  3037. 595.17 s [Cabal] hcPkgInfo (src/Distribution/Simple/GHCJS.hs:1967)
  3038. 595.17 s [Cabal] registerPackage (src/Distribution/Simple/GHCJS.hs:1985)
  3039. 595.17 s [Cabal] componentGhcOptions (src/Distribution/Simple/GHCJS.hs:1773)
  3040. 595.17 s [Cabal] componentCcGhcOptions (src/Distribution/Simple/GHC/Internal.hs:341)
  3041. 595.17 s [Cabal] getLibDir (src/Distribution/Simple/GHCJS.hs:354)
  3042. 595.17 s [Cabal] isDynamic (src/Distribution/Simple/GHCJS.hs:1947)
  3043. 595.17 s [Cabal] pkgRoot (src/Distribution/Simple/GHCJS.hs:2000)
  3044. 595.17 s [Cabal] readGhcEnvironmentFile (src/Distribution/Simple/GHC/EnvironmentParser.hs:56)
  3045. 595.17 s [Cabal] parseGhcEnvironmentFile (src/Distribution/Simple/GHC/EnvironmentParser.hs:53)
  3046. 595.17 s [Cabal] ParseErrorExc (src/Distribution/Simple/GHC/EnvironmentParser.hs:48)
  3047. 595.17 s [Cabal] getImplInfo (src/Distribution/Simple/GHC/ImplInfo.hs:69)
  3048. 595.68 s [Cabal] Warning: 'PreBuildComponentRules' is out of scope.
  3049. 595.68 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  3050. 595.77 s [Cabal] Warning: 'hsLibraries' is out of scope.
  3051. 595.77 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  3052. 595.83 s [Cabal] 55% ( 21 / 38) in 'Distribution.Simple.GHC'
  3053. 595.83 s [Cabal] Missing documentation for:
  3054. 595.83 s [Cabal] getGhcInfo (src/Distribution/Simple/GHC.hs:386)
  3055. 595.83 s [Cabal] configure (src/Distribution/Simple/GHC.hs:149)
  3056. 595.83 s [Cabal] getInstalledPackagesMonitorFiles (src/Distribution/Simple/GHC.hs:539)
  3057. 595.83 s [Cabal] buildLib (src/Distribution/Simple/GHC.hs:570)
  3058. 595.83 s [Cabal] replLib (src/Distribution/Simple/GHC.hs:582)
  3059. 595.83 s [Cabal] replFLib (src/Distribution/Simple/GHC.hs:628)
  3060. 595.83 s [Cabal] replExe (src/Distribution/Simple/GHC.hs:653)
  3061. 595.83 s [Cabal] hcPkgInfo (src/Distribution/Simple/GHC.hs:959)
  3062. 595.83 s [Cabal] registerPackage (src/Distribution/Simple/GHC.hs:977)
  3063. 595.83 s [Cabal] componentGhcOptions (src/Distribution/Simple/GHC/Internal.hs:515)
  3064. 595.83 s [Cabal] componentCcGhcOptions (src/Distribution/Simple/GHC/Internal.hs:341)
  3065. 595.83 s [Cabal] getLibDir (src/Distribution/Simple/GHC.hs:450)
  3066. 595.83 s [Cabal] pkgRoot (src/Distribution/Simple/GHC.hs:992)
  3067. 595.83 s [Cabal] readGhcEnvironmentFile (src/Distribution/Simple/GHC/EnvironmentParser.hs:56)
  3068. 595.83 s [Cabal] parseGhcEnvironmentFile (src/Distribution/Simple/GHC/EnvironmentParser.hs:53)
  3069. 595.83 s [Cabal] ParseErrorExc (src/Distribution/Simple/GHC/EnvironmentParser.hs:48)
  3070. 595.83 s [Cabal] getImplInfo (src/Distribution/Simple/GHC/ImplInfo.hs:69)
  3071. 595.91 s [Cabal] 60% ( 3 / 5) in 'Distribution.Simple.ShowBuildInfo'
  3072. 595.91 s [Cabal] Missing documentation for:
  3073. 595.91 s [Cabal] mkCompilerInfo (src/Distribution/Simple/ShowBuildInfo.hs:133)
  3074. 595.91 s [Cabal] mkComponentInfo (src/Distribution/Simple/ShowBuildInfo.hs:141)
  3075. 595.93 s [Cabal] Warning: 'register' is out of scope.
  3076. 595.93 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  3077. 595.93 s [Cabal] 100% ( 2 / 2) in 'Distribution.Simple.Install'
  3078. 595.98 s [Cabal] 66% ( 2 / 3) in 'Distribution.Simple.Build.PathsModule'
  3079. 595.98 s [Cabal] Missing documentation for:
  3080. 595.98 s [Cabal] generatePathsModule (src/Distribution/Simple/Build/PathsModule.hs:41)
  3081. 596.01 s [Cabal] Warning: 'TestSuite' is out of scope.
  3082. 596.01 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  3083. 596.01 s [Cabal] 75% ( 6 / 8) in 'Distribution.Simple.Test.LibV09'
  3084. 596.01 s [Cabal] Missing documentation for:
  3085. 596.01 s [Cabal] Module header
  3086. 596.01 s [Cabal] runTest (src/Distribution/Simple/Test/LibV09.hs:57)
  3087. 596.04 s [Cabal] 0% ( 0 / 2) in 'Distribution.Simple.Test.ExeV10'
  3088. 596.04 s [Cabal] Missing documentation for:
  3089. 596.04 s [Cabal] Module header
  3090. 596.04 s [Cabal] runTest (src/Distribution/Simple/Test/ExeV10.hs:51)
  3091. 596.06 s [Cabal] Warning: 'dist' is out of scope.
  3092. 596.06 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  3093. 596.23 s [Cabal] 89% ( 17 / 19) in 'Distribution.PackageDescription.Check'
  3094. 596.23 s [Cabal] Missing documentation for:
  3095. 596.23 s [Cabal] CheckExplanationIDString (src/Distribution/PackageDescription/Check/Warning.hs:590)
  3096. 596.23 s [Cabal] ppCheckExplanationId (src/Distribution/PackageDescription/Check/Warning.hs:596)
  3097. 596.31 s [Cabal] 66% ( 4 / 6) in 'Distribution.Make'
  3098. 596.31 s [Cabal] Missing documentation for:
  3099. 596.31 s [Cabal] defaultMain (src/Distribution/Make.hs:84)
  3100. 596.31 s [Cabal] defaultMainArgs (src/Distribution/Make.hs:87)
  3101. 596.33 s [Cabal] Warning: 'sleepFileTimeCalibrate' is out of scope.
  3102. 596.33 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  3103. 596.33 s [Cabal] 85% ( 6 / 7) in 'Distribution.Compat.Time'
  3104. 596.33 s [Cabal] Missing documentation for:
  3105. 596.33 s [Cabal] Module header
  3106. 596.36 s [Cabal] Warning: 'componentPackageDeps' is out of scope.
  3107. 596.36 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  3108. 596.36 s [Cabal] Warning: 'InstalledPackageInfo' is out of scope.
  3109. 596.36 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  3110. 596.36 s [Cabal] Warning: 'improveUnitId' is out of scope.
  3111. 596.36 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  3112. 596.36 s [Cabal] Warning: 'HashedUnitId' is out of scope.
  3113. 596.36 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  3114. 596.40 s [Cabal] 50% ( 1 / 2) in 'Distribution.Backpack.Configure'
  3115. 596.40 s [Cabal] Missing documentation for:
  3116. 596.40 s [Cabal] configureComponentLocalBuildInfos (src/Distribution/Backpack/Configure.hs:65)
  3117. 596.42 s [Cabal] Warning: 'OpenModule' is out of scope.
  3118. 596.42 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  3119. 596.42 s [Cabal] Warning: 'Module' is out of scope.
  3120. 596.42 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  3121. 596.42 s [Cabal] 50% ( 1 / 2) in 'Distribution.Backpack.DescribeUnitId'
  3122. 596.42 s [Cabal] Missing documentation for:
  3123. 596.42 s [Cabal] Module header
  3124. 596.75 s [Cabal] 52% ( 9 / 17) in 'Distribution.Simple.Register'
  3125. 596.75 s [Cabal] Missing documentation for:
  3126. 596.75 s [Cabal] register (src/Distribution/Simple/Register.hs:93)
  3127. 596.75 s [Cabal] unregister (src/Distribution/Simple/Register.hs:702)
  3128. 596.75 s [Cabal] internalPackageDBPath (src/Distribution/Simple/Register.hs:737)
  3129. 596.75 s [Cabal] initPackageDB (src/Distribution/Simple/Register.hs:354)
  3130. 596.75 s [Cabal] doesPackageDBExist (src/Distribution/Simple/Register.hs:374)
  3131. 596.75 s [Cabal] deletePackageDB (src/Distribution/Simple/Register.hs:382)
  3132. 596.75 s [Cabal] registerPackage (src/Distribution/Simple/Register.hs:422)
  3133. 596.75 s [Cabal] generateRegistrationInfo (src/Distribution/Simple/Register.hs:250)
  3134. 596.84 s [Cabal] 40% ( 9 / 22) in 'Distribution.Simple.PreProcess'
  3135. 596.84 s [Cabal] Missing documentation for:
  3136. 596.84 s [Cabal] builtinHaskellSuffixes (src/Distribution/Simple/PreProcess/Types.hs:110)
  3137. 596.84 s [Cabal] builtinHaskellBootSuffixes (src/Distribution/Simple/PreProcess/Types.hs:113)
  3138. 596.84 s [Cabal] mkSimplePreProcessor (src/Distribution/Simple/PreProcess.hs:103)
  3139. 596.84 s [Cabal] runSimplePreProcessor (src/Distribution/Simple/PreProcess.hs:118)
  3140. 596.84 s [Cabal] ppCpp (src/Distribution/Simple/PreProcess.hs:406)
  3141. 596.84 s [Cabal] ppCpp' (src/Distribution/Simple/PreProcess.hs:409)
  3142. 596.84 s [Cabal] ppGreenCard (src/Distribution/Simple/PreProcess.hs:381)
  3143. 596.84 s [Cabal] ppC2hs (src/Distribution/Simple/PreProcess.hs:650)
  3144. 596.84 s [Cabal] ppHsc2hs (src/Distribution/Simple/PreProcess.hs:475)
  3145. 596.84 s [Cabal] ppHappy (src/Distribution/Simple/PreProcess.hs:812)
  3146. 596.84 s [Cabal] ppAlex (src/Distribution/Simple/PreProcess.hs:821)
  3147. 596.84 s [Cabal] ppUnlit (src/Distribution/Simple/PreProcess.hs:396)
  3148. 596.84 s [Cabal] platformDefines (src/Distribution/Simple/PreProcess.hs:719)
  3149. 596.93 s [Cabal] 75% ( 3 / 4) in 'Distribution.Simple.UserHooks'
  3150. 596.93 s [Cabal] Missing documentation for:
  3151. 596.93 s [Cabal] Args (src/Distribution/Simple/UserHooks.hs:45)
  3152. 596.95 s [Cabal] 100% ( 2 / 2) in 'Distribution.Simple.Bench'
  3153. 597.08 s [Cabal] Warning: 'UserHooks' is out of scope.
  3154. 597.08 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  3155. 597.08 s [Cabal] 85% ( 23 / 27) in 'Distribution.Simple.Configure'
  3156. 597.08 s [Cabal] Missing documentation for:
  3157. 597.08 s [Cabal] configCompilerEx (src/Distribution/Simple/Configure.hs:2267)
  3158. 597.08 s [Cabal] configCompilerAuxEx (src/Distribution/Simple/Configure.hs:2255)
  3159. 597.08 s [Cabal] checkForeignDeps (src/Distribution/Simple/Configure.hs:2292)
  3160. 597.08 s [Cabal] platformDefines (src/Distribution/Simple/PreProcess.hs:719)
  3161. 597.31 s [Cabal] 100% ( 2 / 2) in 'Distribution.Simple.Test'
  3162. 597.36 s [Cabal] Warning: 'die' is out of scope.
  3163. 597.36 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  3164. 597.36 s [Cabal] Warning: 'errorPrefix' is out of scope.
  3165. 597.36 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  3166. 597.36 s [Cabal] 100% ( 15 / 15) in 'Distribution.Simple.SrcDist'
  3167. 597.45 s [Cabal] Warning: 'autogenComponentsModuleDir' is out of scope.
  3168. 597.45 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  3169. 597.45 s [Cabal] 88% ( 15 / 17) in 'Distribution.Simple.Build'
  3170. 597.45 s [Cabal] Missing documentation for:
  3171. 597.45 s [Cabal] repl (src/Distribution/Simple/Build.hs:267)
  3172. 597.45 s [Cabal] AutogenFile (src/Distribution/Simple/Build.hs:1078)
  3173. 597.62 s [Cabal] Warning: 'haddocks' is out of scope.
  3174. 597.62 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  3175. 597.62 s [Cabal] Warning: 'Haddock' is out of scope.
  3176. 597.62 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  3177. 597.62 s [Cabal] Warning: 'HaddocksFlags' is out of scope.
  3178. 597.62 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  3179. 597.62 s [Cabal] 66% ( 4 / 6) in 'Distribution.Simple.Haddock'
  3180. 597.62 s [Cabal] Missing documentation for:
  3181. 597.62 s [Cabal] haddock (src/Distribution/Simple/Haddock.hs:207)
  3182. 597.62 s [Cabal] hscolour (src/Distribution/Simple/Haddock.hs:1119)
  3183. 597.84 s [Cabal] 95% ( 20 / 21) in 'Distribution.Simple'
  3184. 597.84 s [Cabal] Missing documentation for:
  3185. 597.84 s [Cabal] Args (src/Distribution/Simple/UserHooks.hs:45)
  3186. 598.72 s [Cabal] Warning: Distribution.Backpack.ModuleShape: could not find link destinations for:
  3187. 598.72 s [Cabal]
  3188. 598.72 s [Cabal] - Distribution.Utils.Structured.structureHash'
  3189. 598.72 s [Cabal] - Distribution.Utils.Structured.Tagged
  3190. 598.72 s [Cabal] Warning: Distribution.ReadE: could not find link destinations for:
  3191. 598.72 s [Cabal]
  3192. 598.72 s [Cabal] - Distribution.ReadE.ErrorMsg
  3193. 598.72 s [Cabal] Warning: Distribution.Simple.Flag: could not find link destinations for:
  3194. 598.72 s [Cabal]
  3195. 598.72 s [Cabal] - Distribution.Utils.Structured.structureHash'
  3196. 598.73 s [Cabal] - Distribution.Utils.Structured.Tagged
  3197. 598.73 s [Cabal] Warning: Distribution.Simple.InstallDirs.Internal: could not find link destinations for:
  3198. 598.73 s [Cabal]
  3199. 598.73 s [Cabal] - Distribution.Utils.Structured.structureHash'
  3200. 598.73 s [Cabal] - Distribution.Utils.Structured.Tagged
  3201. 598.73 s [Cabal] Warning: Distribution.Simple.InstallDirs: could not find link destinations for:
  3202. 598.73 s [Cabal]
  3203. 598.73 s [Cabal] - Distribution.Utils.Structured.structureHash'
  3204. 598.74 s [Cabal] - Distribution.Utils.Structured.Tagged
  3205. 598.74 s [Cabal] Warning: Distribution.Types.ComponentLocalBuildInfo: could not find link destinations for:
  3206. 598.74 s [Cabal]
  3207. 598.74 s [Cabal] - Distribution.Utils.Structured.structureHash'
  3208. 598.74 s [Cabal] - Distribution.Utils.Structured.Tagged
  3209. 598.74 s [Cabal] Warning: Distribution.Types.DumpBuildInfo: could not find link destinations for:
  3210. 598.74 s [Cabal]
  3211. 598.74 s [Cabal] - Distribution.Utils.Structured.structureHash'
  3212. 598.74 s [Cabal] - Distribution.Utils.Structured.Tagged
  3213. 598.74 s [Cabal] Warning: Distribution.Types.GivenComponent: could not find link destinations for:
  3214. 598.75 s [Cabal]
  3215. 598.75 s [Cabal] - Distribution.Utils.Structured.structureHash'
  3216. 598.75 s [Cabal] - Distribution.Utils.Structured.Tagged
  3217. 598.75 s [Cabal] Warning: Distribution.Types.TargetInfo: could not find link destinations for:
  3218. 598.75 s [Cabal]
  3219. 598.75 s [Cabal] - Distribution.Utils.Structured.structureHash'
  3220. 598.75 s [Cabal] - Distribution.Utils.Structured.Tagged
  3221. 598.75 s [Cabal] Warning: Distribution.Verbosity.Internal: could not find link destinations for:
  3222. 598.75 s [Cabal]
  3223. 598.75 s [Cabal] - Distribution.Utils.Structured.structureHash'
  3224. 598.75 s [Cabal] - Distribution.Utils.Structured.Tagged
  3225. 598.75 s [Cabal] Warning: Distribution.Verbosity: could not find link destinations for:
  3226. 598.75 s [Cabal]
  3227. 598.75 s [Cabal] - Distribution.Utils.Structured.structureHash'
  3228. 598.75 s [Cabal] - Distribution.Utils.Structured.Tagged
  3229. 598.75 s [Cabal] Warning: Distribution.Simple.Program.Types: could not find link destinations for:
  3230. 598.75 s [Cabal]
  3231. 598.75 s [Cabal] - Distribution.Utils.Structured.structureHash'
  3232. 598.76 s [Cabal] - Distribution.Utils.Structured.Tagged
  3233. 598.76 s [Cabal] Warning: Distribution.Simple.PreProcess.Types: could not find link destinations for:
  3234. 598.76 s [Cabal]
  3235. 598.76 s [Cabal] - Distribution.Utils.Structured.structureHash'
  3236. 598.76 s [Cabal] - Distribution.Utils.Structured.Tagged
  3237. 598.76 s [Cabal] Warning: Distribution.Simple.Utils: could not find link destinations for:
  3238. 598.76 s [Cabal]
  3239. 598.76 s [Cabal] - Distribution.Simple.Utils.withMetadata
  3240. 598.77 s [Cabal] - Distribution.Simple.Utils.NormalMark
  3241. 598.77 s [Cabal] - Distribution.Simple.Utils.AlwaysTrace
  3242. 598.77 s [Cabal] - Distribution.Simple.Utils.errorPrefix
  3243. 598.77 s [Cabal] Warning: Distribution.Utils.NubList: could not find link destinations for:
  3244. 598.77 s [Cabal]
  3245. 598.77 s [Cabal] - Distribution.Utils.Structured.structureHash'
  3246. 598.77 s [Cabal] - Distribution.Utils.Structured.Tagged
  3247. 598.77 s [Cabal] Warning: Distribution.Utils.LogProgress: could not find link destinations for:
  3248. 598.77 s [Cabal]
  3249. 598.77 s [Cabal] - Distribution.Utils.LogProgress.CtxMsg
  3250. 598.77 s [Cabal] Warning: Distribution.Simple.Program.Find: could not find link destinations for:
  3251. 598.77 s [Cabal]
  3252. 598.77 s [Cabal] - Distribution.Utils.Structured.structureHash'
  3253. 598.78 s [Cabal] - Distribution.Utils.Structured.Tagged
  3254. 598.78 s [Cabal] - Distribution.Simple.Program.Find.findExecutable
  3255. 598.78 s [Cabal] Warning: Distribution.Simple.PackageIndex: could not find link destinations for:
  3256. 598.78 s [Cabal]
  3257. 598.78 s [Cabal] - Distribution.Utils.Structured.structureHash'
  3258. 598.78 s [Cabal] - Distribution.Utils.Structured.Tagged
  3259. 598.78 s [Cabal] - Distribution.Simple.PackageIndex.DepUniqueKey
  3260. 598.78 s [Cabal] Warning: Distribution.Simple.Glob.Internal: could not find link destinations for:
  3261. 598.78 s [Cabal]
  3262. 598.78 s [Cabal] - Distribution.Utils.Structured.structureHash'
  3263. 598.78 s [Cabal] - Distribution.Utils.Structured.Tagged
  3264. 598.78 s [Cabal] Warning: Distribution.Simple.Glob: could not find link destinations for:
  3265. 598.78 s [Cabal]
  3266. 598.78 s [Cabal] - Distribution.Utils.Structured.structureHash'
  3267. 598.78 s [Cabal] - Distribution.Utils.Structured.Tagged
  3268. 598.78 s [Cabal] Warning: Distribution.Simple.Compiler: could not find link destinations for:
  3269. 598.78 s [Cabal]
  3270. 598.78 s [Cabal] - Distribution.Utils.Structured.structureHash'
  3271. 598.79 s [Cabal] - Distribution.Utils.Structured.Tagged
  3272. 598.79 s [Cabal] - Distribution.Simple.Compiler.extensionToFlag
  3273. 598.79 s [Cabal] Warning: Distribution.Simple.Program.Db: could not find link destinations for:
  3274. 598.79 s [Cabal]
  3275. 598.79 s [Cabal] - Distribution.Utils.Structured.structureHash'
  3276. 598.79 s [Cabal] - Distribution.Utils.Structured.Tagged
  3277. 598.79 s [Cabal] Warning: Distribution.Simple.Program: could not find link destinations for:
  3278. 598.79 s [Cabal]
  3279. 598.79 s [Cabal] - Distribution.Utils.Structured.structureHash'
  3280. 598.80 s [Cabal] - Distribution.Utils.Structured.Tagged
  3281. 598.80 s [Cabal] Warning: Distribution.Types.LocalBuildConfig: could not find link destinations for:
  3282. 598.80 s [Cabal]
  3283. 598.80 s [Cabal] - Distribution.Utils.Structured.structureHash'
  3284. 598.81 s [Cabal] - Distribution.Utils.Structured.Tagged
  3285. 598.81 s [Cabal] Warning: Distribution.Types.LocalBuildInfo: could not find link destinations for:
  3286. 598.81 s [Cabal]
  3287. 598.81 s [Cabal] - Distribution.Utils.Structured.structureHash'
  3288. 598.81 s [Cabal] - Distribution.Utils.Structured.Tagged
  3289. 598.81 s [Cabal] Warning: Distribution.Simple.LocalBuildInfo: could not find link destinations for:
  3290. 598.81 s [Cabal]
  3291. 598.81 s [Cabal] - Distribution.Utils.Structured.structureHash'
  3292. 598.82 s [Cabal] - Distribution.Utils.Structured.Tagged
  3293. 598.85 s [Cabal] - Distribution.Types.ComponentName.NotLibComponentName
  3294. 598.85 s [Cabal] Warning: Distribution.Simple.Setup: could not find link destinations for:
  3295. 598.85 s [Cabal]
  3296. 598.85 s [Cabal] - Distribution.Utils.Structured.structureHash'
  3297. 598.90 s [Cabal] - Distribution.Utils.Structured.Tagged
  3298. 598.91 s [Cabal] - Distribution.Simple.Setup.Common.programDbPaths
  3299. 598.91 s [Cabal] Warning: Distribution.Simple.Build.Inputs: could not find link destinations for:
  3300. 598.91 s [Cabal]
  3301. 598.91 s [Cabal] - Distribution.Utils.Structured.structureHash'
  3302. 598.91 s [Cabal] - Distribution.Utils.Structured.Tagged
  3303. 598.91 s [Cabal] Warning: Distribution.Simple.BuildTarget: could not find link destinations for:
  3304. 598.91 s [Cabal]
  3305. 598.91 s [Cabal] - Distribution.Simple.BuildTarget.matchInexactly
  3306. 598.91 s [Cabal] - Distribution.Simple.BuildTarget.findMatch
  3307. 598.91 s [Cabal] - Distribution.Simple.BuildTarget.None
  3308. 598.91 s [Cabal] - Distribution.Simple.BuildTarget.Unambiguous
  3309. 598.91 s [Cabal] - Distribution.Simple.BuildTarget.Ambiguous
  3310. 598.91 s [Cabal] Warning: Distribution.Simple.GHCJS: could not find link destinations for:
  3311. 598.91 s [Cabal]
  3312. 598.91 s [Cabal] - Distribution.Simple.GHCJS.gbuild
  3313. 598.91 s [Cabal] - Distribution.Simple.GHCJS.GBuildMode
  3314. 598.91 s [Cabal] - Distribution.Simple.GHCJS.BuildSources
  3315. 598.91 s [Cabal] Warning: Distribution.PackageDescription.Check: could not find link destinations for:
  3316. 598.91 s [Cabal]
  3317. 598.91 s [Cabal] - Distribution.PackageDescription.Check.Warning.CEType
  3318. 598.91 s [Cabal] - Distribution.PackageDescription.Check.Warning.WarnLang
  3319. 598.91 s [Cabal] - Distribution.PackageDescription.Check.checkPackagePrim
  3320. 598.91 s [Cabal] - Distribution.PackageDescription.Check.pd2gpd
  3321. 598.91 s [Cabal] Warning: Distribution.Make: could not find link destinations for:
  3322. 598.91 s [Cabal]
  3323. 598.91 s [Cabal] - Distribution.Utils.Structured.structureHash'
  3324. 598.92 s [Cabal] - Distribution.Utils.Structured.Tagged
  3325. 598.92 s [Cabal] Warning: Distribution.Compat.Time: could not find link destinations for:
  3326. 598.92 s [Cabal]
  3327. 598.92 s [Cabal] - Distribution.Utils.Structured.structureHash'
  3328. 598.92 s [Cabal] - Distribution.Utils.Structured.Tagged
  3329. 598.92 s [Cabal] Warning: Distribution.Backpack.Configure: could not find link destinations for:
  3330. 598.92 s [Cabal]
  3331. 598.92 s [Cabal] - Distribution.Backpack.PreExistingComponent.PreExistingComponent
  3332. 598.92 s [Cabal] - Distribution.Backpack.PreExistingComponent.PromisedComponent
  3333. 598.92 s [Cabal] Warning: Distribution.Simple.PreProcess: could not find link destinations for:
  3334. 598.92 s [Cabal]
  3335. 598.92 s [Cabal] - Distribution.Utils.Structured.structureHash'
  3336. 598.92 s [Cabal] - Distribution.Utils.Structured.Tagged
  3337. 598.92 s [Cabal] Warning: Distribution.Simple.Configure: could not find link destinations for:
  3338. 598.92 s [Cabal]
  3339. 598.92 s [Cabal] - Distribution.Simple.Configure.PromisedDependency
  3340. 611.59 s [Cabal] Documentation created: dist/doc/html/Cabal/index.html,
  3341. 611.59 s [Cabal] dist/doc/html/Cabal/Cabal.txt
  3342. 611.71 s [Cabal] haddockPhase completed in 32 seconds
  3343. 611.71 s [Cabal] Phase: installPhase
  3344. 611.91 s [Cabal] Installing library in /nix/store/ffjdnzr7rz0imc9d8qsw1p044mfghgvs-Cabal-3.12.1.0/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN
  3345. 616.48 s [Cabal] Phase: fixupPhase
  3346. 616.51 s [Cabal] shrinking RPATHs of ELF executables and libraries in /nix/store/ffjdnzr7rz0imc9d8qsw1p044mfghgvs-Cabal-3.12.1.0
  3347. 616.51 s [Cabal] shrinking /nix/store/ffjdnzr7rz0imc9d8qsw1p044mfghgvs-Cabal-3.12.1.0/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/libHSCabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN-ghc9.4.8.so
  3348. 616.64 s [Cabal] checking for references to /build/ in /nix/store/ffjdnzr7rz0imc9d8qsw1p044mfghgvs-Cabal-3.12.1.0...
  3349. 616.78 s [Cabal] patching script interpreter paths in /nix/store/ffjdnzr7rz0imc9d8qsw1p044mfghgvs-Cabal-3.12.1.0
  3350. 616.80 s [Cabal] stripping (with command strip and flags -S -p) in /nix/store/ffjdnzr7rz0imc9d8qsw1p044mfghgvs-Cabal-3.12.1.0/lib
  3351. 618.45 s [Cabal] shrinking RPATHs of ELF executables and libraries in /nix/store/zlcvgfn7i0v30gr3rcp2ln3fhcfw9n3p-Cabal-3.12.1.0-doc
  3352. 618.52 s [Cabal] checking for references to /build/ in /nix/store/zlcvgfn7i0v30gr3rcp2ln3fhcfw9n3p-Cabal-3.12.1.0-doc...
  3353. 618.60 s [Cabal] patching script interpreter paths in /nix/store/zlcvgfn7i0v30gr3rcp2ln3fhcfw9n3p-Cabal-3.12.1.0-doc
  3354. 619.15 s [Cabal:post-build] Uploading to cachix cache "sellout": /nix/store/ffjdnzr7rz0imc9d8qsw1p044mfghgvs-Cabal-3.12.1.0 /nix/store/zlcvgfn7i0v30gr3rcp2ln3fhcfw9n3p-Cabal-3.12.1.0-doc
  3355. 619.73 s [Cabal:post-build] Nothing to push - all store paths are already on Cachix.
  3356. 619.76 s [Cabal:post-build] Uploading to the NixCI cache: /nix/store/ffjdnzr7rz0imc9d8qsw1p044mfghgvs-Cabal-3.12.1.0 /nix/store/zlcvgfn7i0v30gr3rcp2ln3fhcfw9n3p-Cabal-3.12.1.0-doc
  3357. 619.90 s [Cabal:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  3358. 620.00 s [Cabal:post-build] copying 1 paths...
  3359. 620.00 s [Cabal:post-build] copying path '/nix/store/ffjdnzr7rz0imc9d8qsw1p044mfghgvs-Cabal-3.12.1.0' to 'https://cache.nix-ci.com'...
  3360. 680.20 s [Cabal:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  3361. 680.42 s [Cabal:post-build] copying 0 paths...
  3362. 680.64 s Progress: 2 of 22 built, 161 of 161 downloaded from cache
  3363. 680.77 s Building /nix/store/y3rib6pk5hkwq1qfwyrjdr0dk5mw6a73-cabal-doctest-1.0.12.drv
  3364. 680.86 s Building /nix/store/risqmps20ycp5nxc5s63nzh8bxjpa4k0-ghc-paths-0.1.0.12.drv
  3365. 680.90 s [cabal-doctest] Phase: setupCompilerEnvironmentPhase
  3366. 680.92 s [cabal-doctest] Build with /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8.
  3367. 681.02 s [ghc-paths] Phase: setupCompilerEnvironmentPhase
  3368. 681.02 s [ghc-paths] Build with /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8.
  3369. 681.38 s [cabal-doctest] Phase: unpackPhase
  3370. 681.40 s [cabal-doctest] unpacking source archive /nix/store/ckph819l8a613hapx2pwbjv3yzi8gm3k-cabal-doctest-1.0.12.tar.gz
  3371. 681.42 s [cabal-doctest] source root is cabal-doctest-1.0.12
  3372. 681.44 s [cabal-doctest] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "cabal-doctest-1.0.12/src/Distribution/Extra/Doctest.hs"
  3373. 681.46 s [cabal-doctest] Phase: patchPhase
  3374. 681.46 s [ghc-paths] Phase: unpackPhase
  3375. 681.46 s [ghc-paths] unpacking source archive /nix/store/jbdk3r2ic959xyc0394gn6n61wgjf6n0-ghc-paths-0.1.0.12.tar.gz
  3376. 681.46 s [ghc-paths] source root is ghc-paths-0.1.0.12
  3377. 681.50 s [cabal-doctest] Phase: compileBuildDriverPhase
  3378. 681.50 s [ghc-paths] setting SOURCE_DATE_EPOCH to timestamp 1566388706 of file "ghc-paths-0.1.0.12/Setup.hs"
  3379. 681.50 s [cabal-doctest] setupCompileFlags: -package-db=/build/tmp.THGHVZi23N/setup-package.conf.d -threaded
  3380. 681.50 s [ghc-paths] Phase: patchPhase
  3381. 681.52 s [ghc-paths] Replace Cabal file with edited version from mirror://hackage/ghc-paths-0.1.0.12/revision/8.cabal.
  3382. 681.52 s [ghc-paths] applying patch /nix/store/57w4xa43g7ilkdjd7mplrn8l3pvmyklf-ghc-paths-nix.patch
  3383. 681.53 s [ghc-paths] patching file GHC/Paths.hs
  3384. 681.53 s [ghc-paths] Phase: compileBuildDriverPhase
  3385. 681.54 s [ghc-paths] setupCompileFlags: -package-db=/build/tmp.pmalKQUep8/setup-package.conf.d -threaded
  3386. 681.69 s [cabal-doctest] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.THGHVZi23N/Main.o )
  3387. 681.81 s [ghc-paths] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.pmalKQUep8/Main.o )
  3388. 681.93 s [cabal-doctest] [2 of 2] Linking Setup
  3389. 682.65 s [ghc-paths] [2 of 2] Linking Setup
  3390. 685.99 s [cabal-doctest] Phase: updateAutotoolsGnuConfigScriptsPhase
  3391. 686.03 s [cabal-doctest] Phase: configurePhase
  3392. 686.05 s [cabal-doctest] configureFlags: --verbose --prefix=/nix/store/nz6l5dgsy18891l06s4h3hhyrpy1p69z-cabal-doctest-1.0.12 --libdir=$prefix/lib/$compiler --libsubdir=$abi/$libname --docdir=/nix/store/3jbn3gxm3qwzynl5a8w1bm6115k07h5z-cabal-doctest-1.0.12-doc/share/doc/cabal-doctest-1.0.12 --with-gcc=gcc --package-db=/build/tmp.THGHVZi23N/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/ffyzkisqs4vc4mg28bwwlyqjf8i9ph6b-ncurses-6.5/lib --extra-lib-dirs=/nix/store/n28qgdj8c1q41kf7n4y1jxa6ckp85m3c-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/hi0ar880110k6jsmmili7dh1gq3cg2a9-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/g09cflpnp4g80q56sj9dng1qzv4v4ybc-numactl-2.0.18/lib
  3393. 686.64 s [ghc-paths] Phase: updateAutotoolsGnuConfigScriptsPhase
  3394. 686.67 s [ghc-paths] Phase: configurePhase
  3395. 686.68 s [ghc-paths] configureFlags: --verbose --prefix=/nix/store/wdj03y2n465ii8hm047wlp20pi9l05cd-ghc-paths-0.1.0.12 --libdir=$prefix/lib/$compiler --libsubdir=$abi/$libname --docdir=/nix/store/3kif841p4hc0z521pn7if0xl1bri7naq-ghc-paths-0.1.0.12-doc/share/doc/ghc-paths-0.1.0.12 --with-gcc=gcc --package-db=/build/tmp.pmalKQUep8/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/ffyzkisqs4vc4mg28bwwlyqjf8i9ph6b-ncurses-6.5/lib --extra-lib-dirs=/nix/store/n28qgdj8c1q41kf7n4y1jxa6ckp85m3c-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/hi0ar880110k6jsmmili7dh1gq3cg2a9-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/g09cflpnp4g80q56sj9dng1qzv4v4ybc-numactl-2.0.18/lib
  3396. 686.70 s [ghc-paths] Using Parsec parser
  3397. 686.70 s [ghc-paths] Configuring ghc-paths-0.1.0.12...
  3398. 687.34 s [cabal-doctest] Using Parsec parser
  3399. 687.34 s [cabal-doctest] Configuring cabal-doctest-1.0.12...
  3400. 687.34 s [cabal-doctest] Dependency Cabal >=1.24 && <3.16: using Cabal-3.12.1.0
  3401. 687.34 s [cabal-doctest] Dependency base >=4.9 && <5: using base-4.17.2.1
  3402. 687.34 s [cabal-doctest] Dependency directory >=1.3 && <2: using directory-1.3.7.1
  3403. 687.34 s [cabal-doctest] Dependency filepath >=1.4 && <2: using filepath-1.4.2.2
  3404. 688.26 s [cabal-doctest] Source component graph: component lib
  3405. 688.26 s [cabal-doctest] Configured component graph:
  3406. 688.26 s [cabal-doctest] component cabal-doctest-1.0.12-7IOee4d8EeSYFTisSbXWK
  3407. 688.26 s [cabal-doctest] include Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN
  3408. 688.26 s [cabal-doctest] include base-4.17.2.1
  3409. 688.26 s [cabal-doctest] include directory-1.3.7.1
  3410. 688.26 s [cabal-doctest] include filepath-1.4.2.2
  3411. 688.26 s [cabal-doctest] Linked component graph:
  3412. 688.26 s [cabal-doctest] unit cabal-doctest-1.0.12-7IOee4d8EeSYFTisSbXWK
  3413. 688.26 s [cabal-doctest] include Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN
  3414. 688.26 s [cabal-doctest] include base-4.17.2.1
  3415. 688.26 s [cabal-doctest] include directory-1.3.7.1
  3416. 688.26 s [cabal-doctest] include filepath-1.4.2.2
  3417. 688.26 s [cabal-doctest] Distribution.Extra.Doctest=cabal-doctest-1.0.12-7IOee4d8EeSYFTisSbXWK:Distribution.Extra.Doctest
  3418. 688.26 s [cabal-doctest] Ready component graph:
  3419. 688.26 s [cabal-doctest] definite cabal-doctest-1.0.12-7IOee4d8EeSYFTisSbXWK
  3420. 688.26 s [cabal-doctest] depends Cabal-3.12.1.0-HBHTu5yQHIL4DJUNF8SoN
  3421. 688.26 s [cabal-doctest] depends base-4.17.2.1
  3422. 688.26 s [cabal-doctest] depends directory-1.3.7.1
  3423. 688.26 s [cabal-doctest] depends filepath-1.4.2.2
  3424. 688.26 s [cabal-doctest] Using Cabal-3.8.1.0 compiled by ghc-9.4
  3425. 688.26 s [cabal-doctest] Using compiler: ghc-9.4.8
  3426. 688.26 s [cabal-doctest] Using install prefix:
  3427. 688.27 s [cabal-doctest] /nix/store/nz6l5dgsy18891l06s4h3hhyrpy1p69z-cabal-doctest-1.0.12
  3428. 688.27 s [cabal-doctest] Executables installed in:
  3429. 688.27 s [cabal-doctest] /nix/store/nz6l5dgsy18891l06s4h3hhyrpy1p69z-cabal-doctest-1.0.12/bin
  3430. 688.27 s [cabal-doctest] Libraries installed in:
  3431. 688.27 s [cabal-doctest] /nix/store/nz6l5dgsy18891l06s4h3hhyrpy1p69z-cabal-doctest-1.0.12/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/cabal-doctest-1.0.12-7IOee4d8EeSYFTisSbXWK
  3432. 688.27 s [cabal-doctest] Dynamic Libraries installed in:
  3433. 688.27 s [cabal-doctest] /nix/store/nz6l5dgsy18891l06s4h3hhyrpy1p69z-cabal-doctest-1.0.12/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8
  3434. 688.27 s [cabal-doctest] Private executables installed in:
  3435. 688.27 s [cabal-doctest] /nix/store/nz6l5dgsy18891l06s4h3hhyrpy1p69z-cabal-doctest-1.0.12/libexec/x86_64-linux-ghc-9.4.8/cabal-doctest-1.0.12
  3436. 688.27 s [cabal-doctest] Data files installed in:
  3437. 688.27 s [cabal-doctest] /nix/store/nz6l5dgsy18891l06s4h3hhyrpy1p69z-cabal-doctest-1.0.12/share/x86_64-linux-ghc-9.4.8/cabal-doctest-1.0.12
  3438. 688.27 s [cabal-doctest] Documentation installed in:
  3439. 688.27 s [cabal-doctest] /nix/store/3jbn3gxm3qwzynl5a8w1bm6115k07h5z-cabal-doctest-1.0.12-doc/share/doc/cabal-doctest-1.0.12
  3440. 688.27 s [cabal-doctest] Configuration files installed in:
  3441. 688.27 s [cabal-doctest] /nix/store/nz6l5dgsy18891l06s4h3hhyrpy1p69z-cabal-doctest-1.0.12/etc
  3442. 688.27 s [cabal-doctest] No alex found
  3443. 688.27 s [cabal-doctest] Using ar found on system at:
  3444. 688.27 s [cabal-doctest] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  3445. 688.27 s [cabal-doctest] No c2hs found
  3446. 688.27 s [cabal-doctest] No cpphs found
  3447. 688.27 s [cabal-doctest] No doctest found
  3448. 688.27 s [cabal-doctest] Using gcc version 14.3.0 given by user at:
  3449. 688.27 s [cabal-doctest] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  3450. 688.27 s [cabal-doctest] Using ghc version 9.4.8 found on system at:
  3451. 688.27 s [cabal-doctest] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/ghc
  3452. 688.27 s [cabal-doctest] Using ghc-pkg version 9.4.8 found on system at:
  3453. 688.27 s [cabal-doctest] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/ghc-pkg-9.4.8
  3454. 688.27 s [cabal-doctest] No ghcjs found
  3455. 688.27 s [cabal-doctest] No ghcjs-pkg found
  3456. 688.27 s [cabal-doctest] No greencard found
  3457. 688.27 s [cabal-doctest] Using haddock version 2.27.0 found on system at:
  3458. 688.27 s [cabal-doctest] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/haddock-ghc-9.4.8
  3459. 688.27 s [cabal-doctest] No happy found
  3460. 688.27 s [cabal-doctest] Using haskell-suite found on system at: haskell-suite-dummy-location
  3461. 688.27 s [cabal-doctest] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  3462. 688.27 s [cabal-doctest] No hmake found
  3463. 688.27 s [cabal-doctest] Using hpc version 0.68 found on system at:
  3464. 688.27 s [cabal-doctest] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/hpc
  3465. 688.27 s [cabal-doctest] Using hsc2hs version 0.68.8 found on system at:
  3466. 688.27 s [cabal-doctest] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/hsc2hs
  3467. 688.27 s [cabal-doctest] Using hscolour version 1.25 found on system at:
  3468. 688.27 s [cabal-doctest] /nix/store/87hdxxa93g58b2w9ylr2idn2a40i3fdc-hscolour-1.25/bin/HsColour
  3469. 688.27 s [cabal-doctest] No jhc found
  3470. 688.27 s [cabal-doctest] Using ld found on system at:
  3471. 688.27 s [cabal-doctest] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ld.gold
  3472. 688.27 s [cabal-doctest] No pkg-config found
  3473. 688.27 s [cabal-doctest] Using runghc version 9.4.8 found on system at:
  3474. 688.27 s [cabal-doctest] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/runghc-9.4.8
  3475. 688.27 s [cabal-doctest] Using strip version 2.44 found on system at:
  3476. 688.27 s [cabal-doctest] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  3477. 688.27 s [cabal-doctest] Using tar found on system at:
  3478. 688.27 s [cabal-doctest] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  3479. 688.27 s [cabal-doctest] No uhc found
  3480. 688.30 s [cabal-doctest] Phase: buildPhase
  3481. 688.53 s [cabal-doctest] Preprocessing library for cabal-doctest-1.0.12..
  3482. 688.53 s [cabal-doctest] Building library for cabal-doctest-1.0.12..
  3483. 688.67 s [ghc-paths] Dependency base >=3 && <5: using base-4.17.2.1
  3484. 688.67 s [ghc-paths] Source component graph: component lib
  3485. 688.67 s [ghc-paths] Configured component graph:
  3486. 688.67 s [ghc-paths] component ghc-paths-0.1.0.12-8lmZj1VFo8V7iNy4rcXCyj
  3487. 688.67 s [ghc-paths] include base-4.17.2.1
  3488. 688.67 s [ghc-paths] Linked component graph:
  3489. 688.67 s [ghc-paths] unit ghc-paths-0.1.0.12-8lmZj1VFo8V7iNy4rcXCyj
  3490. 688.67 s [ghc-paths] include base-4.17.2.1
  3491. 688.67 s [ghc-paths] GHC.Paths=ghc-paths-0.1.0.12-8lmZj1VFo8V7iNy4rcXCyj:GHC.Paths
  3492. 688.67 s [ghc-paths] Ready component graph:
  3493. 688.67 s [ghc-paths] definite ghc-paths-0.1.0.12-8lmZj1VFo8V7iNy4rcXCyj
  3494. 688.67 s [ghc-paths] depends base-4.17.2.1
  3495. 688.67 s [ghc-paths] Using Cabal-3.12.1.0 compiled by ghc-9.4
  3496. 688.67 s [ghc-paths] Using compiler: ghc-9.4.8
  3497. 688.67 s [ghc-paths] Using install prefix:
  3498. 688.67 s [ghc-paths] /nix/store/wdj03y2n465ii8hm047wlp20pi9l05cd-ghc-paths-0.1.0.12
  3499. 688.67 s [ghc-paths] Executables installed in:
  3500. 688.67 s [ghc-paths] /nix/store/wdj03y2n465ii8hm047wlp20pi9l05cd-ghc-paths-0.1.0.12/bin
  3501. 688.67 s [ghc-paths] Libraries installed in:
  3502. 688.67 s [ghc-paths] /nix/store/wdj03y2n465ii8hm047wlp20pi9l05cd-ghc-paths-0.1.0.12/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/ghc-paths-0.1.0.12-8lmZj1VFo8V7iNy4rcXCyj
  3503. 688.67 s [ghc-paths] Dynamic Libraries installed in:
  3504. 688.67 s [ghc-paths] /nix/store/wdj03y2n465ii8hm047wlp20pi9l05cd-ghc-paths-0.1.0.12/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8
  3505. 688.68 s [ghc-paths] Private executables installed in:
  3506. 688.68 s [ghc-paths] /nix/store/wdj03y2n465ii8hm047wlp20pi9l05cd-ghc-paths-0.1.0.12/libexec/x86_64-linux-ghc-9.4.8/ghc-paths-0.1.0.12
  3507. 688.68 s [ghc-paths] Data files installed in:
  3508. 688.68 s [ghc-paths] /nix/store/wdj03y2n465ii8hm047wlp20pi9l05cd-ghc-paths-0.1.0.12/share/x86_64-linux-ghc-9.4.8/ghc-paths-0.1.0.12
  3509. 688.68 s [ghc-paths] Documentation installed in:
  3510. 688.68 s [ghc-paths] /nix/store/3kif841p4hc0z521pn7if0xl1bri7naq-ghc-paths-0.1.0.12-doc/share/doc/ghc-paths-0.1.0.12
  3511. 688.68 s [ghc-paths] Configuration files installed in:
  3512. 688.68 s [ghc-paths] /nix/store/wdj03y2n465ii8hm047wlp20pi9l05cd-ghc-paths-0.1.0.12/etc
  3513. 688.68 s [ghc-paths] No alex found
  3514. 688.68 s [ghc-paths] Using ar found on system at:
  3515. 688.68 s [ghc-paths] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  3516. 688.68 s [ghc-paths] No c2hs found
  3517. 688.68 s [ghc-paths] No cpphs found
  3518. 688.68 s [ghc-paths] No doctest found
  3519. 688.68 s [ghc-paths] Using gcc version 14.3.0 given by user at:
  3520. 688.68 s [ghc-paths] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  3521. 688.68 s [ghc-paths] Using ghc version 9.4.8 found on system at:
  3522. 688.68 s [ghc-paths] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/ghc
  3523. 688.68 s [ghc-paths] Using ghc-pkg version 9.4.8 found on system at:
  3524. 688.68 s [ghc-paths] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/ghc-pkg-9.4.8
  3525. 688.68 s [ghc-paths] No ghcjs found
  3526. 688.68 s [ghc-paths] No ghcjs-pkg found
  3527. 688.68 s [ghc-paths] No greencard found
  3528. 688.68 s [ghc-paths] Using haddock version 2.27.0 found on system at:
  3529. 688.68 s [ghc-paths] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/haddock-ghc-9.4.8
  3530. 688.68 s [ghc-paths] No happy found
  3531. 688.68 s [ghc-paths] Using haskell-suite found on system at: haskell-suite-dummy-location
  3532. 688.68 s [ghc-paths] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  3533. 688.68 s [ghc-paths] No hmake found
  3534. 688.68 s [ghc-paths] Using hpc version 0.68 found on system at:
  3535. 688.68 s [ghc-paths] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/hpc
  3536. 688.68 s [ghc-paths] Using hsc2hs version 0.68.8 found on system at:
  3537. 688.68 s [ghc-paths] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/hsc2hs
  3538. 688.68 s [ghc-paths] Using hscolour version 1.25 found on system at:
  3539. 688.68 s [ghc-paths] /nix/store/87hdxxa93g58b2w9ylr2idn2a40i3fdc-hscolour-1.25/bin/HsColour
  3540. 688.68 s [ghc-paths] No jhc found
  3541. 688.68 s [ghc-paths] Using ld found on system at:
  3542. 688.68 s [ghc-paths] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ld.gold
  3543. 688.68 s [ghc-paths] No pkg-config found
  3544. 688.68 s [ghc-paths] Using runghc version 9.4.8 found on system at:
  3545. 688.68 s [ghc-paths] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/runghc-9.4.8
  3546. 688.68 s [ghc-paths] Using strip version 2.44 found on system at:
  3547. 688.68 s [ghc-paths] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  3548. 688.68 s [ghc-paths] Using tar found on system at:
  3549. 688.68 s [ghc-paths] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  3550. 688.68 s [ghc-paths] No uhc found
  3551. 688.68 s [ghc-paths] Running: /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/ghc --print-libdir -j16 '+RTS' -A64M -RTS -haddock
  3552. 688.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 )
  3553. 688.84 s [ghc-paths] Phase: buildPhase
  3554. 688.97 s [ghc-paths] Preprocessing library for ghc-paths-0.1.0.12...
  3555. 688.97 s [ghc-paths] Building library for ghc-paths-0.1.0.12...
  3556. 689.22 s [ghc-paths] [1 of 1] Compiling GHC.Paths ( GHC/Paths.hs, dist/build/GHC/Paths.o, dist/build/GHC/Paths.dyn_o )
  3557. 690.01 s [ghc-paths] [1 of 1] Compiling GHC.Paths ( GHC/Paths.hs, dist/build/GHC/Paths.p_o )
  3558. 692.33 s [ghc-paths] Phase: checkPhase
  3559. 692.40 s [ghc-paths] Package has no test suites.
  3560. 692.42 s [ghc-paths] Phase: haddockPhase
  3561. 692.76 s [cabal-doctest] [1 of 1] Compiling Distribution.Extra.Doctest ( src/Distribution/Extra/Doctest.hs, dist/build/Distribution/Extra/Doctest.p_o )
  3562. 692.83 s [ghc-paths] Preprocessing library for ghc-paths-0.1.0.12...
  3563. 692.83 s [ghc-paths] Running Haddock on library for ghc-paths-0.1.0.12...
  3564. 693.47 s [ghc-paths] 0% ( 0 / 5) in 'GHC.Paths'
  3565. 693.47 s [ghc-paths] Missing documentation for:
  3566. 693.47 s [ghc-paths] Module header
  3567. 693.47 s [ghc-paths] ghc (GHC/Paths.hs:29)
  3568. 693.47 s [ghc-paths] ghc_pkg (GHC/Paths.hs:29)
  3569. 693.47 s [ghc-paths] libdir (GHC/Paths.hs:29)
  3570. 693.47 s [ghc-paths] docdir (GHC/Paths.hs:29)
  3571. 697.41 s [ghc-paths] Documentation created: dist/doc/html/ghc-paths/,
  3572. 697.41 s [ghc-paths] dist/doc/html/ghc-paths/ghc-paths.txt
  3573. 697.59 s [ghc-paths] Phase: installPhase
  3574. 697.71 s [ghc-paths] Installing library in /nix/store/wdj03y2n465ii8hm047wlp20pi9l05cd-ghc-paths-0.1.0.12/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/ghc-paths-0.1.0.12-8lmZj1VFo8V7iNy4rcXCyj
  3575. 698.19 s [ghc-paths] Phase: fixupPhase
  3576. 698.23 s [ghc-paths] shrinking RPATHs of ELF executables and libraries in /nix/store/wdj03y2n465ii8hm047wlp20pi9l05cd-ghc-paths-0.1.0.12
  3577. 698.25 s [ghc-paths] shrinking /nix/store/wdj03y2n465ii8hm047wlp20pi9l05cd-ghc-paths-0.1.0.12/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/libHSghc-paths-0.1.0.12-8lmZj1VFo8V7iNy4rcXCyj-ghc9.4.8.so
  3578. 698.25 s [ghc-paths] checking for references to /build/ in /nix/store/wdj03y2n465ii8hm047wlp20pi9l05cd-ghc-paths-0.1.0.12...
  3579. 698.29 s [ghc-paths] patching script interpreter paths in /nix/store/wdj03y2n465ii8hm047wlp20pi9l05cd-ghc-paths-0.1.0.12
  3580. 698.30 s [ghc-paths] stripping (with command strip and flags -S -p) in /nix/store/wdj03y2n465ii8hm047wlp20pi9l05cd-ghc-paths-0.1.0.12/lib
  3581. 698.80 s [ghc-paths] shrinking RPATHs of ELF executables and libraries in /nix/store/3kif841p4hc0z521pn7if0xl1bri7naq-ghc-paths-0.1.0.12-doc
  3582. 698.81 s [ghc-paths] checking for references to /build/ in /nix/store/3kif841p4hc0z521pn7if0xl1bri7naq-ghc-paths-0.1.0.12-doc...
  3583. 698.86 s [ghc-paths] patching script interpreter paths in /nix/store/3kif841p4hc0z521pn7if0xl1bri7naq-ghc-paths-0.1.0.12-doc
  3584. 699.19 s [ghc-paths:post-build] Uploading to cachix cache "sellout": /nix/store/3kif841p4hc0z521pn7if0xl1bri7naq-ghc-paths-0.1.0.12-doc /nix/store/wdj03y2n465ii8hm047wlp20pi9l05cd-ghc-paths-0.1.0.12
  3585. 700.58 s [ghc-paths:post-build] Nothing to push - all store paths are already on Cachix.
  3586. 700.63 s [ghc-paths:post-build] Uploading to the NixCI cache: /nix/store/3kif841p4hc0z521pn7if0xl1bri7naq-ghc-paths-0.1.0.12-doc /nix/store/wdj03y2n465ii8hm047wlp20pi9l05cd-ghc-paths-0.1.0.12
  3587. 701.04 s [ghc-paths:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  3588. 701.20 s [ghc-paths:post-build] copying 1 paths...
  3589. 701.20 s [ghc-paths:post-build] copying path '/nix/store/wdj03y2n465ii8hm047wlp20pi9l05cd-ghc-paths-0.1.0.12' to 'https://cache.nix-ci.com'...
  3590. 701.68 s [ghc-paths:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  3591. 701.91 s [ghc-paths:post-build] copying 0 paths...
  3592. 701.95 s Progress: 3 of 22 built (1 building), 161 of 161 downloaded from cache
  3593. 702.20 s Building /nix/store/k7k1z2d30zr0ird9kl6v9cjxds6vpaws-doctest-0.24.2.drv
  3594. 702.20 s [cabal-doctest] Phase: checkPhase
  3595. 702.20 s [cabal-doctest] Package has no test suites.
  3596. 702.20 s [cabal-doctest] Phase: haddockPhase
  3597. 702.20 s [cabal-doctest] Preprocessing library for cabal-doctest-1.0.12..
  3598. 702.20 s [cabal-doctest] Running Haddock on library for cabal-doctest-1.0.12..
  3599. 702.20 s [cabal-doctest] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
  3600. 702.46 s [doctest] Phase: setupCompilerEnvironmentPhase
  3601. 702.48 s [doctest] Build with /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8.
  3602. 702.55 s [cabal-doctest] 100% ( 7 / 7) in 'Distribution.Extra.Doctest'
  3603. 703.18 s [doctest] Phase: unpackPhase
  3604. 703.19 s [doctest] unpacking source archive /nix/store/bhl15ifbap4vkm5qbpgwa3svq4yanr2l-doctest-0.24.2.tar.gz
  3605. 703.21 s [doctest] source root is doctest-0.24.2
  3606. 703.23 s [doctest] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "doctest-0.24.2/test/UtilSpec.hs"
  3607. 703.26 s [doctest] Phase: patchPhase
  3608. 703.28 s [doctest] Phase: compileBuildDriverPhase
  3609. 703.29 s [doctest] setupCompileFlags: -package-db=/build/tmp.gI46dqSqEP/setup-package.conf.d -threaded
  3610. 703.45 s [doctest] [1 of 2] Compiling Main ( Setup.lhs, /build/tmp.gI46dqSqEP/Main.o )
  3611. 703.63 s [doctest] [2 of 2] Linking Setup
  3612. 706.53 s [doctest] Phase: updateAutotoolsGnuConfigScriptsPhase
  3613. 706.57 s [doctest] Phase: configurePhase
  3614. 706.59 s [doctest] configureFlags: --verbose --prefix=/nix/store/jbbd7dp036y9l3jv36q5ffbsn5s78wcn-doctest-0.24.2 --libdir=$prefix/lib/$compiler --libsubdir=$abi/$libname --docdir=/nix/store/d6qd929y8siwb5rbfv14xg36dlblmhwg-doctest-0.24.2-doc/share/doc/doctest-0.24.2 --with-gcc=gcc --package-db=/build/tmp.gI46dqSqEP/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/ffyzkisqs4vc4mg28bwwlyqjf8i9ph6b-ncurses-6.5/lib --extra-lib-dirs=/nix/store/n28qgdj8c1q41kf7n4y1jxa6ckp85m3c-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/hi0ar880110k6jsmmili7dh1gq3cg2a9-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/g09cflpnp4g80q56sj9dng1qzv4v4ybc-numactl-2.0.18/lib --extra-lib-dirs=/nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/lib
  3615. 707.53 s [doctest] Using Parsec parser
  3616. 707.53 s [doctest] Configuring doctest-0.24.2...
  3617. 707.53 s [doctest] Flags chosen: cabal-doctest=False
  3618. 707.53 s [doctest] Dependency base >=4.12 && <5: using base-4.17.2.1
  3619. 707.53 s [doctest] Dependency code-page >=0.1: using code-page-0.2.1
  3620. 707.54 s [doctest] Dependency containers: using containers-0.6.7
  3621. 707.54 s [doctest] Dependency deepseq: using deepseq-1.4.8.0
  3622. 707.54 s [doctest] Dependency directory: using directory-1.3.7.1
  3623. 707.54 s [doctest] Dependency exceptions: using exceptions-0.10.5
  3624. 707.54 s [doctest] Dependency filepath: using filepath-1.4.2.2
  3625. 707.54 s [doctest] Dependency ghc >=8.6 && <9.14: using ghc-9.4.8
  3626. 707.54 s [doctest] Dependency ghc-paths >=0.1.0.9: using ghc-paths-0.1.0.12
  3627. 707.54 s [doctest] Dependency process: using process-1.6.18.0
  3628. 707.54 s [doctest] Dependency syb >=0.3: using syb-0.7.2.4
  3629. 707.54 s [doctest] Dependency temporary: using temporary-1.3
  3630. 707.54 s [doctest] Dependency transformers: using transformers-0.5.6.2
  3631. 707.54 s [doctest] Dependency base >=4.12 && <5: using base-4.17.2.1
  3632. 707.54 s [doctest] Dependency doctest: using doctest-0.24.2
  3633. 707.54 s [doctest] Dependency HUnit: using HUnit-1.6.2.0
  3634. 707.54 s [doctest] Dependency QuickCheck >=2.13.1: using QuickCheck-2.15.0.1
  3635. 707.54 s [doctest] Dependency base >=4.12 && <5: using base-4.17.2.1
  3636. 707.54 s [doctest] Dependency code-page >=0.1: using code-page-0.2.1
  3637. 707.54 s [doctest] Dependency containers: using containers-0.6.7
  3638. 707.54 s [doctest] Dependency deepseq: using deepseq-1.4.8.0
  3639. 707.54 s [doctest] Dependency directory: using directory-1.3.7.1
  3640. 707.54 s [doctest] Dependency exceptions: using exceptions-0.10.5
  3641. 707.54 s [doctest] Dependency filepath: using filepath-1.4.2.2
  3642. 707.54 s [doctest] Dependency ghc >=8.6 && <9.14: using ghc-9.4.8
  3643. 707.54 s [doctest] Dependency ghc-paths >=0.1.0.9: using ghc-paths-0.1.0.12
  3644. 707.54 s [doctest] Dependency hspec >=2.3.0: using hspec-2.11.14
  3645. 707.54 s [doctest] Dependency hspec-core >=2.3.0: using hspec-core-2.11.14
  3646. 707.54 s [doctest] Dependency mockery: using mockery-0.3.5
  3647. 707.54 s [doctest] Dependency process: using process-1.6.18.0
  3648. 707.54 s [doctest] Dependency silently >=1.2.4: using silently-1.2.5.4
  3649. 707.54 s [doctest] Dependency stringbuilder >=0.4: using stringbuilder-0.5.1
  3650. 707.54 s [doctest] Dependency syb >=0.3: using syb-0.7.2.4
  3651. 707.54 s [doctest] Dependency temporary: using temporary-1.3
  3652. 707.54 s [doctest] Dependency transformers: using transformers-0.5.6.2
  3653. 707.92 s [doctest] Source component graph:
  3654. 707.92 s [doctest] component test:spec
  3655. 707.92 s [doctest] component lib
  3656. 707.92 s [doctest] component exe:doctest dependency lib
  3657. 707.92 s [doctest] Configured component graph:
  3658. 707.92 s [doctest] component doctest-0.24.2-8B2S5OYPA9mBub9KxF3tOS-spec
  3659. 707.92 s [doctest] include HUnit-1.6.2.0-GZI6Kc0pBxs4XSBauXwdfA
  3660. 707.92 s [doctest] include QuickCheck-2.15.0.1-H9C4qdCN40J1jJ9nkbU8lt
  3661. 707.92 s [doctest] include base-4.17.2.1
  3662. 707.92 s [doctest] include code-page-0.2.1-LeQPy5FeQvS92HSQRBnpzj
  3663. 707.92 s [doctest] include containers-0.6.7
  3664. 707.92 s [doctest] include deepseq-1.4.8.0
  3665. 707.92 s [doctest] include directory-1.3.7.1
  3666. 707.92 s [doctest] include exceptions-0.10.5
  3667. 707.92 s [doctest] include filepath-1.4.2.2
  3668. 707.92 s [doctest] include ghc-9.4.8
  3669. 707.92 s [doctest] include ghc-paths-0.1.0.12-8lmZj1VFo8V7iNy4rcXCyj
  3670. 707.92 s [doctest] include hspec-2.11.14-8PnEgFFxGXWcarqEvNWao
  3671. 707.92 s [doctest] include hspec-core-2.11.14-44JEUBQaBV8AsFck3fmlPx
  3672. 707.92 s [doctest] include mockery-0.3.5-87RIIY0h7q6HGiqZ0yQPlW
  3673. 707.92 s [doctest] include process-1.6.18.0
  3674. 707.92 s [doctest] include silently-1.2.5.4-6fxu1qBymv4CrCGqkpMTl5
  3675. 707.92 s [doctest] include stringbuilder-0.5.1-AisLcFSgoYA5h5XBEGd9QP
  3676. 707.92 s [doctest] include syb-0.7.2.4-7xddrprlBP2BU3qzFjb3KS
  3677. 707.92 s [doctest] include temporary-1.3-GGW3bDEdunp7TUxZ1ZaiZc
  3678. 707.92 s [doctest] include transformers-0.5.6.2
  3679. 707.92 s [doctest] component doctest-0.24.2-I8Dj1Qj4flA6uA6Qf1gy88
  3680. 707.92 s [doctest] include base-4.17.2.1
  3681. 707.92 s [doctest] include code-page-0.2.1-LeQPy5FeQvS92HSQRBnpzj
  3682. 707.92 s [doctest] include containers-0.6.7
  3683. 707.92 s [doctest] include deepseq-1.4.8.0
  3684. 707.92 s [doctest] include directory-1.3.7.1
  3685. 707.92 s [doctest] include exceptions-0.10.5
  3686. 707.92 s [doctest] include filepath-1.4.2.2
  3687. 707.92 s [doctest] include ghc-9.4.8
  3688. 707.92 s [doctest] include ghc-paths-0.1.0.12-8lmZj1VFo8V7iNy4rcXCyj
  3689. 707.93 s [doctest] include process-1.6.18.0
  3690. 707.93 s [doctest] include syb-0.7.2.4-7xddrprlBP2BU3qzFjb3KS
  3691. 707.93 s [doctest] include temporary-1.3-GGW3bDEdunp7TUxZ1ZaiZc
  3692. 707.93 s [doctest] include transformers-0.5.6.2
  3693. 707.93 s [doctest] component doctest-0.24.2-EWumxpWJwNOEH8LULfU4wU-doctest
  3694. 707.93 s [doctest] include base-4.17.2.1
  3695. 707.93 s [doctest] include doctest-0.24.2-I8Dj1Qj4flA6uA6Qf1gy88
  3696. 707.93 s [doctest] Linked component graph:
  3697. 707.93 s [doctest] unit doctest-0.24.2-8B2S5OYPA9mBub9KxF3tOS-spec
  3698. 707.93 s [doctest] include HUnit-1.6.2.0-GZI6Kc0pBxs4XSBauXwdfA
  3699. 707.93 s [doctest] include QuickCheck-2.15.0.1-H9C4qdCN40J1jJ9nkbU8lt
  3700. 707.93 s [doctest] include base-4.17.2.1
  3701. 707.93 s [doctest] include code-page-0.2.1-LeQPy5FeQvS92HSQRBnpzj
  3702. 707.93 s [doctest] include containers-0.6.7
  3703. 707.93 s [doctest] include deepseq-1.4.8.0
  3704. 707.93 s [doctest] include directory-1.3.7.1
  3705. 707.93 s [doctest] include exceptions-0.10.5
  3706. 707.93 s [doctest] include filepath-1.4.2.2
  3707. 707.93 s [doctest] include ghc-9.4.8
  3708. 707.93 s [doctest] include ghc-paths-0.1.0.12-8lmZj1VFo8V7iNy4rcXCyj
  3709. 707.93 s [doctest] include hspec-2.11.14-8PnEgFFxGXWcarqEvNWao
  3710. 707.93 s [doctest] include hspec-core-2.11.14-44JEUBQaBV8AsFck3fmlPx
  3711. 707.93 s [doctest] include mockery-0.3.5-87RIIY0h7q6HGiqZ0yQPlW
  3712. 707.93 s [doctest] include process-1.6.18.0
  3713. 707.93 s [doctest] include silently-1.2.5.4-6fxu1qBymv4CrCGqkpMTl5
  3714. 707.93 s [doctest] include stringbuilder-0.5.1-AisLcFSgoYA5h5XBEGd9QP
  3715. 707.93 s [doctest] include syb-0.7.2.4-7xddrprlBP2BU3qzFjb3KS
  3716. 707.93 s [doctest] include temporary-1.3-GGW3bDEdunp7TUxZ1ZaiZc
  3717. 707.93 s [doctest] include transformers-0.5.6.2
  3718. 707.93 s [doctest] unit doctest-0.24.2-I8Dj1Qj4flA6uA6Qf1gy88
  3719. 707.93 s [doctest] include base-4.17.2.1
  3720. 707.93 s [doctest] include code-page-0.2.1-LeQPy5FeQvS92HSQRBnpzj
  3721. 707.93 s [doctest] include containers-0.6.7
  3722. 707.93 s [doctest] include deepseq-1.4.8.0
  3723. 707.93 s [doctest] include directory-1.3.7.1
  3724. 707.93 s [doctest] include exceptions-0.10.5
  3725. 707.93 s [doctest] include filepath-1.4.2.2
  3726. 707.93 s [doctest] include ghc-9.4.8
  3727. 707.93 s [doctest] include ghc-paths-0.1.0.12-8lmZj1VFo8V7iNy4rcXCyj
  3728. 707.93 s [doctest] include process-1.6.18.0
  3729. 707.93 s [doctest] include syb-0.7.2.4-7xddrprlBP2BU3qzFjb3KS
  3730. 707.93 s [doctest] include temporary-1.3-GGW3bDEdunp7TUxZ1ZaiZc
  3731. 707.93 s [doctest] include transformers-0.5.6.2
  3732. 707.93 s [doctest] Test.DocTest=doctest-0.24.2-I8Dj1Qj4flA6uA6Qf1gy88:Test.DocTest,Test.DocTest.Internal.Cabal=doctest-0.24.2-I8Dj1Qj4flA6uA6Qf1gy88:Test.DocTest.Internal.Cabal,Test.DocTest.Internal.Extract=doctest-0.24.2-I8Dj1Qj4flA6uA6Qf1gy88:Test.DocTest.Internal.Extract,Test.DocTest.Internal.Location=doctest-0.24.2-I8Dj1Qj4flA6uA6Qf1gy88:Test.DocTest.Internal.Location,Test.DocTest.Internal.Parse=doctest-0.24.2-I8Dj1Qj4flA6uA6Qf1gy88:Test.DocTest.Internal.Parse,Test.DocTest.Internal.Run=doctest-0.24.2-I8Dj1Qj4flA6uA6Qf1gy88:Test.DocTest.Internal.Run
  3733. 707.93 s [doctest] unit doctest-0.24.2-EWumxpWJwNOEH8LULfU4wU-doctest
  3734. 707.93 s [doctest] include base-4.17.2.1
  3735. 707.93 s [doctest] include doctest-0.24.2-I8Dj1Qj4flA6uA6Qf1gy88
  3736. 707.93 s [doctest] Ready component graph:
  3737. 707.93 s [doctest] definite doctest-0.24.2-I8Dj1Qj4flA6uA6Qf1gy88
  3738. 707.93 s [doctest] depends base-4.17.2.1
  3739. 707.93 s [doctest] depends code-page-0.2.1-LeQPy5FeQvS92HSQRBnpzj
  3740. 707.93 s [doctest] depends containers-0.6.7
  3741. 707.93 s [doctest] depends deepseq-1.4.8.0
  3742. 707.93 s [doctest] depends directory-1.3.7.1
  3743. 707.93 s [doctest] depends exceptions-0.10.5
  3744. 707.93 s [doctest] depends filepath-1.4.2.2
  3745. 707.93 s [doctest] depends ghc-9.4.8
  3746. 707.93 s [doctest] depends ghc-paths-0.1.0.12-8lmZj1VFo8V7iNy4rcXCyj
  3747. 707.93 s [doctest] depends process-1.6.18.0
  3748. 707.93 s [doctest] depends syb-0.7.2.4-7xddrprlBP2BU3qzFjb3KS
  3749. 707.93 s [doctest] depends temporary-1.3-GGW3bDEdunp7TUxZ1ZaiZc
  3750. 707.93 s [doctest] depends transformers-0.5.6.2
  3751. 707.93 s [doctest] definite doctest-0.24.2-EWumxpWJwNOEH8LULfU4wU-doctest
  3752. 707.93 s [doctest] depends base-4.17.2.1
  3753. 707.93 s [doctest] depends doctest-0.24.2-I8Dj1Qj4flA6uA6Qf1gy88
  3754. 707.93 s [doctest] definite doctest-0.24.2-8B2S5OYPA9mBub9KxF3tOS-spec
  3755. 707.93 s [doctest] depends HUnit-1.6.2.0-GZI6Kc0pBxs4XSBauXwdfA
  3756. 707.93 s [doctest] depends QuickCheck-2.15.0.1-H9C4qdCN40J1jJ9nkbU8lt
  3757. 707.93 s [doctest] depends base-4.17.2.1
  3758. 707.93 s [doctest] depends code-page-0.2.1-LeQPy5FeQvS92HSQRBnpzj
  3759. 707.93 s [doctest] depends containers-0.6.7
  3760. 707.93 s [doctest] depends deepseq-1.4.8.0
  3761. 707.93 s [doctest] depends directory-1.3.7.1
  3762. 707.93 s [doctest] depends exceptions-0.10.5
  3763. 707.93 s [doctest] depends filepath-1.4.2.2
  3764. 707.93 s [doctest] depends ghc-9.4.8
  3765. 707.93 s [doctest] depends ghc-paths-0.1.0.12-8lmZj1VFo8V7iNy4rcXCyj
  3766. 707.93 s [doctest] depends hspec-2.11.14-8PnEgFFxGXWcarqEvNWao
  3767. 707.93 s [doctest] depends hspec-core-2.11.14-44JEUBQaBV8AsFck3fmlPx
  3768. 707.93 s [doctest] depends mockery-0.3.5-87RIIY0h7q6HGiqZ0yQPlW
  3769. 707.93 s [doctest] depends process-1.6.18.0
  3770. 707.93 s [doctest] depends silently-1.2.5.4-6fxu1qBymv4CrCGqkpMTl5
  3771. 707.93 s [doctest] depends stringbuilder-0.5.1-AisLcFSgoYA5h5XBEGd9QP
  3772. 707.94 s [doctest] depends syb-0.7.2.4-7xddrprlBP2BU3qzFjb3KS
  3773. 707.94 s [doctest] depends temporary-1.3-GGW3bDEdunp7TUxZ1ZaiZc
  3774. 707.94 s [doctest] depends transformers-0.5.6.2
  3775. 707.94 s [doctest] Using Cabal-3.8.1.0 compiled by ghc-9.4
  3776. 707.94 s [doctest] Using compiler: ghc-9.4.8
  3777. 707.94 s [doctest] Using install prefix:
  3778. 707.94 s [doctest] /nix/store/jbbd7dp036y9l3jv36q5ffbsn5s78wcn-doctest-0.24.2
  3779. 707.94 s [doctest] Executables installed in:
  3780. 707.94 s [doctest] /nix/store/jbbd7dp036y9l3jv36q5ffbsn5s78wcn-doctest-0.24.2/bin
  3781. 707.94 s [doctest] Libraries installed in:
  3782. 707.94 s [doctest] /nix/store/jbbd7dp036y9l3jv36q5ffbsn5s78wcn-doctest-0.24.2/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/doctest-0.24.2-I8Dj1Qj4flA6uA6Qf1gy88
  3783. 707.94 s [doctest] Dynamic Libraries installed in:
  3784. 707.94 s [doctest] /nix/store/jbbd7dp036y9l3jv36q5ffbsn5s78wcn-doctest-0.24.2/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8
  3785. 707.94 s [doctest] Private executables installed in:
  3786. 707.94 s [doctest] /nix/store/jbbd7dp036y9l3jv36q5ffbsn5s78wcn-doctest-0.24.2/libexec/x86_64-linux-ghc-9.4.8/doctest-0.24.2
  3787. 707.94 s [doctest] Data files installed in:
  3788. 707.94 s [doctest] /nix/store/jbbd7dp036y9l3jv36q5ffbsn5s78wcn-doctest-0.24.2/share/x86_64-linux-ghc-9.4.8/doctest-0.24.2
  3789. 707.94 s [doctest] Documentation installed in:
  3790. 707.94 s [doctest] /nix/store/d6qd929y8siwb5rbfv14xg36dlblmhwg-doctest-0.24.2-doc/share/doc/doctest-0.24.2
  3791. 707.94 s [doctest] Configuration files installed in:
  3792. 707.94 s [doctest] /nix/store/jbbd7dp036y9l3jv36q5ffbsn5s78wcn-doctest-0.24.2/etc
  3793. 707.94 s [doctest] No alex found
  3794. 707.94 s [doctest] Using ar found on system at:
  3795. 707.94 s [doctest] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  3796. 707.94 s [doctest] No c2hs found
  3797. 707.94 s [doctest] No cpphs found
  3798. 707.94 s [doctest] No doctest found
  3799. 707.94 s [doctest] Using gcc version 14.3.0 given by user at:
  3800. 707.94 s [doctest] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  3801. 707.94 s [doctest] Using ghc version 9.4.8 found on system at:
  3802. 707.94 s [doctest] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/ghc
  3803. 707.94 s [doctest] Using ghc-pkg version 9.4.8 found on system at:
  3804. 707.94 s [doctest] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/ghc-pkg-9.4.8
  3805. 707.94 s [doctest] No ghcjs found
  3806. 707.94 s [doctest] No ghcjs-pkg found
  3807. 707.94 s [doctest] No greencard found
  3808. 707.94 s [doctest] Using haddock version 2.27.0 found on system at:
  3809. 707.94 s [doctest] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/haddock-ghc-9.4.8
  3810. 707.94 s [doctest] No happy found
  3811. 707.94 s [doctest] Using haskell-suite found on system at: haskell-suite-dummy-location
  3812. 707.94 s [doctest] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  3813. 707.94 s [doctest] No hmake found
  3814. 707.94 s [doctest] Using hpc version 0.68 found on system at:
  3815. 707.94 s [doctest] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/hpc
  3816. 707.94 s [doctest] Using hsc2hs version 0.68.8 found on system at:
  3817. 707.94 s [doctest] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/hsc2hs
  3818. 707.94 s [doctest] Using hscolour version 1.25 found on system at:
  3819. 707.94 s [doctest] /nix/store/87hdxxa93g58b2w9ylr2idn2a40i3fdc-hscolour-1.25/bin/HsColour
  3820. 707.94 s [doctest] No jhc found
  3821. 707.94 s [doctest] Using ld found on system at:
  3822. 707.94 s [doctest] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ld.gold
  3823. 707.94 s [doctest] No pkg-config found
  3824. 707.94 s [doctest] Using runghc version 9.4.8 found on system at:
  3825. 707.94 s [doctest] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/runghc-9.4.8
  3826. 708.27 s [doctest] Using strip version 2.44 found on system at:
  3827. 708.30 s [doctest] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  3828. 708.30 s [doctest] Using tar found on system at:
  3829. 708.30 s [doctest] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  3830. 708.30 s [doctest] No uhc found
  3831. 708.31 s [doctest] Phase: buildPhase
  3832. 708.50 s [doctest] Preprocessing library for doctest-0.24.2..
  3833. 708.52 s [doctest] Building library for doctest-0.24.2..
  3834. 709.41 s [doctest] [ 1 of 26] Compiling Imports ( src/Imports.hs, dist/build/Imports.o, dist/build/Imports.dyn_o )
  3835. 709.78 s [doctest] [ 2 of 26] Compiling GhcUtil ( src/GhcUtil.hs, dist/build/GhcUtil.o, dist/build/GhcUtil.dyn_o )
  3836. 711.83 s [cabal-doctest] Documentation created: dist/doc/html/cabal-doctest/index.html,
  3837. 711.83 s [cabal-doctest] dist/doc/html/cabal-doctest/cabal-doctest.txt
  3838. 711.99 s [cabal-doctest] Phase: installPhase
  3839. 712.12 s [cabal-doctest] Installing library in /nix/store/nz6l5dgsy18891l06s4h3hhyrpy1p69z-cabal-doctest-1.0.12/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/cabal-doctest-1.0.12-7IOee4d8EeSYFTisSbXWK
  3840. 712.63 s [cabal-doctest] Phase: fixupPhase
  3841. 712.72 s [cabal-doctest] shrinking RPATHs of ELF executables and libraries in /nix/store/nz6l5dgsy18891l06s4h3hhyrpy1p69z-cabal-doctest-1.0.12
  3842. 712.72 s [cabal-doctest] shrinking /nix/store/nz6l5dgsy18891l06s4h3hhyrpy1p69z-cabal-doctest-1.0.12/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/libHScabal-doctest-1.0.12-7IOee4d8EeSYFTisSbXWK-ghc9.4.8.so
  3843. 712.73 s [cabal-doctest] checking for references to /build/ in /nix/store/nz6l5dgsy18891l06s4h3hhyrpy1p69z-cabal-doctest-1.0.12...
  3844. 712.77 s [cabal-doctest] patching script interpreter paths in /nix/store/nz6l5dgsy18891l06s4h3hhyrpy1p69z-cabal-doctest-1.0.12
  3845. 712.78 s [cabal-doctest] stripping (with command strip and flags -S -p) in /nix/store/nz6l5dgsy18891l06s4h3hhyrpy1p69z-cabal-doctest-1.0.12/lib
  3846. 712.89 s [cabal-doctest] shrinking RPATHs of ELF executables and libraries in /nix/store/3jbn3gxm3qwzynl5a8w1bm6115k07h5z-cabal-doctest-1.0.12-doc
  3847. 712.91 s [cabal-doctest] checking for references to /build/ in /nix/store/3jbn3gxm3qwzynl5a8w1bm6115k07h5z-cabal-doctest-1.0.12-doc...
  3848. 712.95 s [cabal-doctest] patching script interpreter paths in /nix/store/3jbn3gxm3qwzynl5a8w1bm6115k07h5z-cabal-doctest-1.0.12-doc
  3849. 713.24 s [cabal-doctest:post-build] Uploading to cachix cache "sellout": /nix/store/3jbn3gxm3qwzynl5a8w1bm6115k07h5z-cabal-doctest-1.0.12-doc /nix/store/nz6l5dgsy18891l06s4h3hhyrpy1p69z-cabal-doctest-1.0.12
  3850. 714.43 s [cabal-doctest:post-build] Nothing to push - all store paths are already on Cachix.
  3851. 714.46 s [cabal-doctest:post-build] Uploading to the NixCI cache: /nix/store/3jbn3gxm3qwzynl5a8w1bm6115k07h5z-cabal-doctest-1.0.12-doc /nix/store/nz6l5dgsy18891l06s4h3hhyrpy1p69z-cabal-doctest-1.0.12
  3852. 714.69 s [cabal-doctest:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  3853. 714.85 s [cabal-doctest:post-build] copying 1 paths...
  3854. 714.85 s [cabal-doctest:post-build] copying path '/nix/store/nz6l5dgsy18891l06s4h3hhyrpy1p69z-cabal-doctest-1.0.12' to 'https://cache.nix-ci.com'...
  3855. 715.51 s [cabal-doctest:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  3856. 715.68 s [cabal-doctest:post-build] copying 0 paths...
  3857. 715.88 s Progress: 4 of 22 built (1 building), 161 of 161 downloaded from cache
  3858. 715.88 s [doctest] [ 3 of 26] Compiling Cabal.ReplOptions ( src/Cabal/ReplOptions.hs, dist/build/Cabal/ReplOptions.o, dist/build/Cabal/ReplOptions.dyn_o )
  3859. 715.88 s [doctest] [ 4 of 26] Compiling Cabal.Paths ( src/Cabal/Paths.hs, dist/build/Cabal/Paths.o, dist/build/Cabal/Paths.dyn_o )
  3860. 715.88 s [doctest] [ 5 of 26] Compiling Cabal.Options ( src/Cabal/Options.hs, dist/build/Cabal/Options.o, dist/build/Cabal/Options.dyn_o )
  3861. 715.88 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 )
  3862. 715.88 s [doctest] [ 7 of 26] Compiling Interpreter ( src/Interpreter.hs, dist/build/Interpreter.o, dist/build/Interpreter.dyn_o )
  3863. 715.88 s [doctest] [ 8 of 26] Compiling Location ( src/Location.hs, dist/build/Location.o, dist/build/Location.dyn_o )
  3864. 715.88 s [doctest] [ 9 of 26] Compiling PackageDBs ( src/PackageDBs.hs, dist/build/PackageDBs.o, dist/build/PackageDBs.dyn_o )
  3865. 715.88 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 )
  3866. 715.88 s [doctest] [11 of 26] Compiling Info ( src/Info.hs, dist/build/Info.o, dist/build/Info.dyn_o )
  3867. 715.88 s [doctest] [12 of 26] Compiling Options ( src/Options.hs, dist/build/Options.o, dist/build/Options.dyn_o )
  3868. 715.88 s [doctest] [13 of 26] Compiling Cabal ( src/Cabal.hs, dist/build/Cabal.o, dist/build/Cabal.dyn_o )
  3869. 715.88 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 )
  3870. 715.88 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 )
  3871. 715.88 s [doctest] [16 of 26] Compiling Util ( src/Util.hs, dist/build/Util.o, dist/build/Util.dyn_o )
  3872. 715.88 s [doctest] [17 of 26] Compiling Extract ( src/Extract.hs, dist/build/Extract.o, dist/build/Extract.dyn_o )
  3873. 715.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 )
  3874. 715.88 s [doctest] [19 of 26] Compiling Parse ( src/Parse.hs, dist/build/Parse.o, dist/build/Parse.dyn_o )
  3875. 715.88 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 )
  3876. 715.88 s [doctest] [21 of 26] Compiling Runner.Example ( src/Runner/Example.hs, dist/build/Runner/Example.o, dist/build/Runner/Example.dyn_o )
  3877. 716.44 s [doctest] [22 of 26] Compiling Property ( src/Property.hs, dist/build/Property.o, dist/build/Property.dyn_o )
  3878. 716.44 s [doctest] [23 of 26] Compiling Runner ( src/Runner.hs, dist/build/Runner.o, dist/build/Runner.dyn_o )
  3879. 717.95 s [doctest] [24 of 26] Compiling Run ( src/Run.hs, dist/build/Run.o, dist/build/Run.dyn_o )
  3880. 718.35 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 )
  3881. 718.41 s [doctest] [26 of 26] Compiling Test.DocTest ( src/Test/DocTest.hs, dist/build/Test/DocTest.o, dist/build/Test/DocTest.dyn_o )
  3882. 720.07 s [doctest] [ 1 of 26] Compiling Imports ( src/Imports.hs, dist/build/Imports.p_o )
  3883. 720.71 s [doctest] [ 2 of 26] Compiling GhcUtil ( src/GhcUtil.hs, dist/build/GhcUtil.p_o )
  3884. 724.71 s [doctest] [ 3 of 26] Compiling Cabal.ReplOptions ( src/Cabal/ReplOptions.hs, dist/build/Cabal/ReplOptions.p_o )
  3885. 724.71 s [doctest] [ 4 of 26] Compiling Cabal.Paths ( src/Cabal/Paths.hs, dist/build/Cabal/Paths.p_o )
  3886. 724.71 s [doctest] [ 5 of 26] Compiling Cabal.Options ( src/Cabal/Options.hs, dist/build/Cabal/Options.p_o )
  3887. 724.93 s [doctest] [ 6 of 26] Compiling Language.Haskell.GhciWrapper ( src/Language/Haskell/GhciWrapper.hs, dist/build/Language/Haskell/GhciWrapper.p_o )
  3888. 724.93 s [doctest] [ 7 of 26] Compiling Interpreter ( src/Interpreter.hs, dist/build/Interpreter.p_o )
  3889. 724.93 s [doctest] [ 8 of 26] Compiling Location ( src/Location.hs, dist/build/Location.p_o )
  3890. 724.93 s [doctest] [ 9 of 26] Compiling PackageDBs ( src/PackageDBs.hs, dist/build/PackageDBs.p_o )
  3891. 724.93 s [doctest] [10 of 26] Compiling Paths_doctest ( dist/build/autogen/Paths_doctest.hs, dist/build/Paths_doctest.p_o )
  3892. 724.93 s [doctest] [11 of 26] Compiling Info ( src/Info.hs, dist/build/Info.p_o )
  3893. 724.93 s [doctest] [12 of 26] Compiling Options ( src/Options.hs, dist/build/Options.p_o )
  3894. 725.33 s [doctest] [13 of 26] Compiling Cabal ( src/Cabal.hs, dist/build/Cabal.p_o )
  3895. 725.70 s [doctest] [14 of 26] Compiling Test.DocTest.Internal.Cabal ( src/Test/DocTest/Internal/Cabal.hs, dist/build/Test/DocTest/Internal/Cabal.p_o )
  3896. 726.11 s [doctest] [15 of 26] Compiling Test.DocTest.Internal.Location ( src/Test/DocTest/Internal/Location.hs, dist/build/Test/DocTest/Internal/Location.p_o )
  3897. 726.11 s [doctest] [16 of 26] Compiling Util ( src/Util.hs, dist/build/Util.p_o )
  3898. 726.11 s [doctest] [17 of 26] Compiling Extract ( src/Extract.hs, dist/build/Extract.p_o )
  3899. 726.69 s [doctest] [18 of 26] Compiling Test.DocTest.Internal.Extract ( src/Test/DocTest/Internal/Extract.hs, dist/build/Test/DocTest/Internal/Extract.p_o )
  3900. 727.05 s [doctest] [19 of 26] Compiling Parse ( src/Parse.hs, dist/build/Parse.p_o )
  3901. 727.76 s [doctest] [20 of 26] Compiling Test.DocTest.Internal.Parse ( src/Test/DocTest/Internal/Parse.hs, dist/build/Test/DocTest/Internal/Parse.p_o )
  3902. 728.19 s [doctest] [21 of 26] Compiling Runner.Example ( src/Runner/Example.hs, dist/build/Runner/Example.p_o )
  3903. 728.88 s [doctest] [22 of 26] Compiling Property ( src/Property.hs, dist/build/Property.p_o )
  3904. 728.88 s [doctest] [23 of 26] Compiling Runner ( src/Runner.hs, dist/build/Runner.p_o )
  3905. 730.25 s [doctest] [24 of 26] Compiling Run ( src/Run.hs, dist/build/Run.p_o )
  3906. 730.89 s [doctest] [25 of 26] Compiling Test.DocTest.Internal.Run ( src/Test/DocTest/Internal/Run.hs, dist/build/Test/DocTest/Internal/Run.p_o )
  3907. 731.20 s [doctest] [26 of 26] Compiling Test.DocTest ( src/Test/DocTest.hs, dist/build/Test/DocTest.p_o )
  3908. 737.68 s [doctest] Preprocessing executable 'doctest' for doctest-0.24.2..
  3909. 737.68 s [doctest] Building executable 'doctest' for doctest-0.24.2..
  3910. 737.92 s [doctest] [1 of 2] Compiling Main ( driver/doctest.hs, dist/build/doctest/doctest-tmp/Main.o )
  3911. 738.36 s [doctest] [2 of 2] Compiling Paths_doctest ( dist/build/doctest/autogen/Paths_doctest.hs, dist/build/doctest/doctest-tmp/Paths_doctest.o )
  3912. 738.82 s [doctest] [3 of 3] Linking dist/build/doctest/doctest
  3913. 743.36 s [doctest] Preprocessing test suite 'spec' for doctest-0.24.2..
  3914. 743.38 s [doctest] Building test suite 'spec' for doctest-0.24.2..
  3915. 744.60 s [doctest] [ 1 of 44] Compiling Imports ( src/Imports.hs, dist/build/spec/spec-tmp/Imports.o )
  3916. 744.80 s [doctest] [ 2 of 44] Compiling GhcUtil ( src/GhcUtil.hs, dist/build/spec/spec-tmp/GhcUtil.o )
  3917. 746.59 s [doctest] [ 3 of 44] Compiling Cabal.ReplOptions ( src/Cabal/ReplOptions.hs, dist/build/spec/spec-tmp/Cabal/ReplOptions.o )
  3918. 746.84 s [doctest] [ 4 of 44] Compiling Cabal.ReplOptionsSpec ( test/Cabal/ReplOptionsSpec.hs, dist/build/spec/spec-tmp/Cabal/ReplOptionsSpec.o )
  3919. 747.63 s [doctest] [ 5 of 44] Compiling Cabal.Paths ( src/Cabal/Paths.hs, dist/build/spec/spec-tmp/Cabal/Paths.o )
  3920. 747.63 s [doctest] [ 6 of 44] Compiling Cabal.Options ( src/Cabal/Options.hs, dist/build/spec/spec-tmp/Cabal/Options.o )
  3921. 747.63 s [doctest] [ 7 of 44] Compiling Cabal.OptionsSpec ( test/Cabal/OptionsSpec.hs, dist/build/spec/spec-tmp/Cabal/OptionsSpec.o )
  3922. 748.21 s [doctest] [ 8 of 44] Compiling Language.Haskell.GhciWrapper ( src/Language/Haskell/GhciWrapper.hs, dist/build/spec/spec-tmp/Language/Haskell/GhciWrapper.o )
  3923. 748.21 s [doctest] [ 9 of 44] Compiling Interpreter ( src/Interpreter.hs, dist/build/spec/spec-tmp/Interpreter.o )
  3924. 748.21 s [doctest] [10 of 44] Compiling InterpreterSpec ( test/InterpreterSpec.hs, dist/build/spec/spec-tmp/InterpreterSpec.o )
  3925. 748.21 s [doctest] [11 of 44] Compiling Info ( src/Info.hs, dist/build/spec/spec-tmp/Info.o )
  3926. 748.21 s [doctest] [12 of 44] Compiling InfoSpec ( test/InfoSpec.hs, dist/build/spec/spec-tmp/InfoSpec.o )
  3927. 748.21 s [doctest] [13 of 44] Compiling Cabal ( src/Cabal.hs, dist/build/spec/spec-tmp/Cabal.o )
  3928. 748.21 s [doctest] [14 of 44] Compiling Cabal.PathsSpec ( test/Cabal/PathsSpec.hs, dist/build/spec/spec-tmp/Cabal/PathsSpec.o )
  3929. 748.21 s [doctest] [15 of 44] Compiling Language.Haskell.GhciWrapperSpec ( test/Language/Haskell/GhciWrapperSpec.hs, dist/build/spec/spec-tmp/Language/Haskell/GhciWrapperSpec.o )
  3930. 748.21 s [doctest] [16 of 44] Compiling Location ( src/Location.hs, dist/build/spec/spec-tmp/Location.o )
  3931. 748.21 s [doctest] [17 of 44] Compiling LocationSpec ( test/LocationSpec.hs, dist/build/spec/spec-tmp/LocationSpec.o )
  3932. 748.21 s [doctest] [18 of 44] Compiling Options ( src/Options.hs, dist/build/spec/spec-tmp/Options.o )
  3933. 748.21 s [doctest] [19 of 44] Compiling OptionsSpec ( test/OptionsSpec.hs, dist/build/spec/spec-tmp/OptionsSpec.o )
  3934. 748.64 s [doctest] [20 of 44] Compiling PackageDBs ( src/PackageDBs.hs, dist/build/spec/spec-tmp/PackageDBs.o )
  3935. 748.64 s [doctest] [21 of 44] Compiling PackageDBsSpec ( test/PackageDBsSpec.hs, dist/build/spec/spec-tmp/PackageDBsSpec.o )
  3936. 748.66 s [doctest] [22 of 44] Compiling Paths_doctest ( dist/build/spec/autogen/Paths_doctest.hs, dist/build/spec/spec-tmp/Paths_doctest.o )
  3937. 748.66 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 )
  3938. 748.66 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 )
  3939. 748.66 s [doctest] [25 of 44] Compiling Util ( src/Util.hs, dist/build/spec/spec-tmp/Util.o )
  3940. 748.66 s [doctest] [26 of 44] Compiling Extract ( src/Extract.hs, dist/build/spec/spec-tmp/Extract.o )
  3941. 748.66 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 )
  3942. 748.66 s [doctest] [28 of 44] Compiling Parse ( src/Parse.hs, dist/build/spec/spec-tmp/Parse.o )
  3943. 748.84 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 )
  3944. 748.86 s [doctest] [30 of 44] Compiling Runner.Example ( src/Runner/Example.hs, dist/build/spec/spec-tmp/Runner/Example.o )
  3945. 749.50 s [doctest] [31 of 44] Compiling Runner.ExampleSpec ( test/Runner/ExampleSpec.hs, dist/build/spec/spec-tmp/Runner/ExampleSpec.o )
  3946. 750.86 s [doctest] [32 of 44] Compiling Property ( src/Property.hs, dist/build/spec/spec-tmp/Property.o )
  3947. 750.86 s [doctest] [33 of 44] Compiling Runner ( src/Runner.hs, dist/build/spec/spec-tmp/Runner.o )
  3948. 750.86 s [doctest] [34 of 44] Compiling RunnerSpec ( test/RunnerSpec.hs, dist/build/spec/spec-tmp/RunnerSpec.o )
  3949. 750.86 s [doctest] [35 of 44] Compiling Run ( src/Run.hs, dist/build/spec/spec-tmp/Run.o )
  3950. 750.87 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 )
  3951. 750.89 s [doctest] [37 of 44] Compiling Test.DocTest ( src/Test/DocTest.hs, dist/build/spec/spec-tmp/Test/DocTest.o )
  3952. 750.91 s [doctest] [38 of 44] Compiling RunSpec ( test/RunSpec.hs, dist/build/spec/spec-tmp/RunSpec.o )
  3953. 751.68 s [doctest] [39 of 44] Compiling MainSpec ( test/MainSpec.hs, dist/build/spec/spec-tmp/MainSpec.o )
  3954. 751.93 s [doctest] [40 of 44] Compiling PropertySpec ( test/PropertySpec.hs, dist/build/spec/spec-tmp/PropertySpec.o )
  3955. 751.93 s [doctest] [41 of 44] Compiling ParseSpec ( test/ParseSpec.hs, dist/build/spec/spec-tmp/ParseSpec.o )
  3956. 751.93 s [doctest] [42 of 44] Compiling ExtractSpec ( test/ExtractSpec.hs, dist/build/spec/spec-tmp/ExtractSpec.o )
  3957. 751.93 s [doctest] [43 of 44] Compiling UtilSpec ( test/UtilSpec.hs, dist/build/spec/spec-tmp/UtilSpec.o )
  3958. 751.93 s [doctest] [44 of 44] Compiling Main ( test/Spec.hs, dist/build/spec/spec-tmp/Main.o )
  3959. 754.01 s [doctest] [45 of 45] Linking dist/build/spec/spec
  3960. 758.94 s [doctest] buildPhase completed in 50 seconds
  3961. 758.94 s [doctest] Phase: checkPhase
  3962. 759.01 s [doctest] Running 1 test suites...
  3963. 759.01 s [doctest] Test suite spec: RUNNING...
  3964. 759.03 s [doctest]
  3965. 759.03 s [doctest] Extract
  3966. 759.03 s [doctest] extract
  3967. 759.15 s [doctest] extracts documentation for a top-level declaration [✔]
  3968. 759.21 s [doctest] extracts documentation from argument list [✔]
  3969. 759.23 s [doctest] extracts documentation for a type class function [✔]
  3970. 759.28 s [doctest] extracts documentation from the argument list of a type class function [✔]
  3971. 759.33 s [doctest] extracts documentation from the module header [✔]
  3972. 759.39 s [doctest] extracts documentation from imported modules [✔]
  3973. 759.42 s [doctest] extracts documentation from export list [✔]
  3974. 759.49 s [doctest] extracts documentation from named chunks [✔]
  3975. 759.56 s [doctest] returns docstrings in the same order they appear in the source [✔]
  3976. 759.62 s [doctest] extracts $setup code [✔]
  3977. 759.65 s [doctest] fails on invalid flags [✔]
  3978. 759.65 s [doctest] extract (regression tests)
  3979. 759.69 s [doctest] works with infix operators [✔]
  3980. 759.72 s [doctest] works with parallel list comprehensions [✔]
  3981. 759.76 s [doctest] works with list comprehensions in instance definitions [✔]
  3982. 759.80 s [doctest] works with foreign imports [✔]
  3983. 759.85 s [doctest] works for rewrite rules [✔]
  3984. 759.90 s [doctest] works for rewrite rules with type signatures [✔]
  3985. 759.95 s [doctest] strips CR from dos line endings [✔]
  3986. 760.06 s [doctest] works with a module that splices in an expression from an other module [✔]
  3987. 760.11 s [doctest] works for type families and GHC 7.6.1 [✔]
  3988. 760.11 s [doctest] Info
  3989. 760.11 s [doctest] formatInfo
  3990. 760.19 s [doctest] formats --info output [✔]
  3991. 760.19 s [doctest] Interpreter
  3992. 760.19 s [doctest] interpreterSupported
  3993. 760.27 s [doctest] indicates whether GHCi is supported on current platform [✔]
  3994. 760.28 s [doctest] ghcInfo
  3995. 760.36 s [doctest] includes "Have interpreter" [✔]
  3996. 760.36 s [doctest] safeEval
  3997. 760.73 s [doctest] evaluates an expression [✔]
  3998. 761.13 s [doctest] returns Left on unterminated multiline command [✔]
  3999. 761.13 s [doctest] filterExpression
  4000. 761.13 s [doctest] removes :set -XTemplateHaskell [✔]
  4001. 761.13 s [doctest] filters -XTemplateHaskell [✔]
  4002. 761.14 s [doctest] leaves :set-statement that do not set -XTemplateHaskell alone [✔]
  4003. 761.14 s [doctest] Language.Haskell.GhciWrapper
  4004. 761.14 s [doctest] evalEcho
  4005. 761.50 s [doctest] prints result to stdout [✔]
  4006. 761.50 s [doctest] evalWith
  4007. 761.50 s [doctest] with PreserveIt
  4008. 761.87 s [doctest] preserves it [✔]
  4009. 761.87 s [doctest] eval
  4010. 762.21 s [doctest] shows literals [✔]
  4011. 762.64 s [doctest] shows string literals containing Unicode [✔]
  4012. 762.97 s [doctest] evaluates simple expressions [✔]
  4013. 763.34 s [doctest] supports let bindings [✔]
  4014. 763.78 s [doctest] allows import statements [✔]
  4015. 764.19 s [doctest] captures stdout [✔]
  4016. 764.57 s [doctest] captures stdout (Unicode) [✔]
  4017. 765.00 s [doctest] captures stdout (empty line) [✔]
  4018. 765.52 s [doctest] captures stdout (multiple lines) [✔]
  4019. 765.99 s [doctest] captures stderr [✔]
  4020. 766.41 s [doctest] captures stderr (Unicode) [✔]
  4021. 766.81 s [doctest] shows exceptions [✔]
  4022. 767.24 s [doctest] shows exceptions (ExitCode) [✔]
  4023. 767.60 s [doctest] gives an error message for identifiers that are not in scope [✔]
  4024. 767.60 s [doctest] when configVerbose is True
  4025. 768.01 s [doctest] prints prompt [✔]
  4026. 768.01 s [doctest] with -XOverloadedStrings, -Wall and -Werror
  4027. 768.40 s [doctest] does not fail on marker expression (bug fix) [✔]
  4028. 768.40 s [doctest] with NoImplicitPrelude
  4029. 768.78 s [doctest] works [✔]
  4030. 768.78 s [doctest] with a strange String type
  4031. 769.20 s [doctest] works [✔]
  4032. 769.20 s [doctest] Location
  4033. 769.20 s [doctest] toLocation
  4034. 769.20 s [doctest] works for a regular SrcSpan [✔]
  4035. 769.20 s [doctest] works for a single-line SrcSpan [✔]
  4036. 769.20 s [doctest] works for a SrcSpan that corresponds to single point [✔]
  4037. 769.20 s [doctest] works for a bad SrcSpan [✔]
  4038. 769.20 s [doctest] works for a SrcLoc with bad locations [✔]
  4039. 769.20 s [doctest] enumerate
  4040. 769.21 s [doctest] replicates UnhelpfulLocation [✔]
  4041. 769.21 s [doctest] enumerates Location [✔]
  4042. 769.21 s [doctest] Main
  4043. 769.21 s [doctest] doctest
  4044. 769.80 s [doctest] testSimple [✔]
  4045. 770.38 s [doctest] it-variable [✔]
  4046. 771.01 s [doctest] it-variable in $setup [✔]
  4047. 771.53 s [doctest] failing [✔]
  4048. 772.25 s [doctest] skips subsequent examples from the same group if an example fails [✔]
  4049. 772.25 s [doctest] without --fail-fast
  4050. 773.23 s [doctest] continuous even if some tests fail [✔]
  4051. 773.23 s [doctest] with --fail-fast
  4052. 773.83 s [doctest] stops after the first failure [✔]
  4053. 774.55 s [doctest] stops after failures in $setup [✔]
  4054. 775.98 s [doctest] testImport [✔]
  4055. 776.73 s [doctest] testCommentLocation [✔]
  4056. 777.13 s [doctest] testPutStr [✔]
  4057. 777.52 s [doctest] fails on multi-line expressions, introduced with :{ [✔]
  4058. 778.05 s [doctest] testBlankline [✔]
  4059. 778.53 s [doctest] examples from the same Haddock comment share the same scope [✔]
  4060. 779.00 s [doctest] testDocumentationForArguments [✔]
  4061. 779.60 s [doctest] template-haskell [✔]
  4062. 780.07 s [doctest] handles source files with CRLF line endings [✔]
  4063. 780.53 s [doctest] runs $setup before each test group [✔]
  4064. 781.05 s [doctest] skips subsequent tests from a module, if $setup fails [✔]
  4065. 781.64 s [doctest] ignores trailing whitespace when matching test output [✔]
  4066. 781.64 s [doctest] doctest as a runner for QuickCheck properties
  4067. 782.45 s [doctest] runs a boolean property [✔]
  4068. 783.21 s [doctest] runs an explicitly quantified property [✔]
  4069. 783.99 s [doctest] runs an implicitly quantified property [✔]
  4070. 784.81 s [doctest] reports a failing property [✔]
  4071. 785.72 s [doctest] runs a boolean property with an explicit type signature [✔]
  4072. 786.40 s [doctest] runs $setup before each property [✔]
  4073. 786.40 s [doctest] doctest (regression tests)
  4074. 787.41 s [doctest] bugfixWorkingDirectory [✔]
  4075. 787.95 s [doctest] bugfixOutputToStdErr [✔]
  4076. 788.48 s [doctest] bugfixImportHierarchical [✔]
  4077. 789.02 s [doctest] bugfixMultipleModules [✔]
  4078. 790.12 s [doctest] testCPP [✔]
  4079. 790.98 s [doctest] template-haskell-bugfix [✔]
  4080. 791.50 s [doctest] doesn't clash with user bindings of stdout/stderr [✔]
  4081. 792.00 s [doctest] doesn't get confused by doctests using System.IO imports [✔]
  4082. 792.00 s [doctest] Options
  4083. 792.00 s [doctest] parseOptions
  4084. 792.00 s [doctest] strips --optghc [✔]
  4085. 792.00 s [doctest] strips --optghc= [✔]
  4086. 792.00 s [doctest] with ghc options that are not valid with --interactive
  4087. 792.05 s [doctest] returns ProxyToGhc [✔]
  4088. 792.05 s [doctest] +++ OK, passed 100 tests.
  4089. 792.05 s [doctest] with --interactive
  4090. 792.05 s [doctest] disables magic mode [✔]
  4091. 792.05 s [doctest] filters out --interactive [✔]
  4092. 792.05 s [doctest] accepts --fast [✔]
  4093. 792.05 s [doctest] --no-magic
  4094. 792.05 s [doctest] without --no-magic
  4095. 792.05 s [doctest] enables magic mode [✔]
  4096. 792.05 s [doctest] with --no-magic
  4097. 792.05 s [doctest] disables magic mode [✔]
  4098. 792.05 s [doctest] --fast
  4099. 792.05 s [doctest] without --fast
  4100. 792.05 s [doctest] disables fast mode [✔]
  4101. 792.05 s [doctest] with --fast
  4102. 792.05 s [doctest] enables fast mode [✔]
  4103. 792.05 s [doctest] --preserve-it
  4104. 792.05 s [doctest] without --preserve-it
  4105. 792.05 s [doctest] does not preserve the `it` variable [✔]
  4106. 792.05 s [doctest] with --preserve-it
  4107. 792.05 s [doctest] preserves the `it` variable [✔]
  4108. 792.05 s [doctest] --fail-fast
  4109. 792.05 s [doctest] without --fail-fast
  4110. 792.05 s [doctest] disables fail-fast mode [✔]
  4111. 792.05 s [doctest] with --fail-fast
  4112. 792.05 s [doctest] enables fail-fast mode [✔]
  4113. 792.05 s [doctest] with --help
  4114. 792.05 s [doctest] outputs usage information [✔]
  4115. 792.05 s [doctest] with --version
  4116. 792.05 s [doctest] outputs version information [✔]
  4117. 792.05 s [doctest] with --info
  4118. 792.12 s [doctest] outputs machine readable version information [✔]
  4119. 792.12 s [doctest] --verbose
  4120. 792.12 s [doctest] without --verbose
  4121. 792.12 s [doctest] is not verbose by default [✔]
  4122. 792.13 s [doctest] with --verbose
  4123. 792.13 s [doctest] parses verbose option [✔]
  4124. 792.13 s [doctest] PackageDBs
  4125. 792.13 s [doctest] getPackageDBsFromEnv
  4126. 792.13 s [doctest] uses global and user when no env used [✔]
  4127. 792.13 s [doctest] respects GHC_PACKAGE_PATH [✔]
  4128. 792.13 s [doctest] Parse
  4129. 792.13 s [doctest] extractDocTests
  4130. 792.17 s [doctest] extracts properties from a module [✔]
  4131. 792.27 s [doctest] extracts examples from a module [✔]
  4132. 792.36 s [doctest] extracts examples from documentation for non-exported names [✔]
  4133. 792.46 s [doctest] extracts multiple examples from a module [✔]
  4134. 792.51 s [doctest] returns an empty list, if documentation contains no examples [✔]
  4135. 792.60 s [doctest] sets setup code to Nothing, if it does not contain any tests [✔]
  4136. 792.67 s [doctest] keeps modules that only contain setup code [✔]
  4137. 792.67 s [doctest] parseInteractions (an internal function)
  4138. 792.67 s [doctest] parses an interaction [✔]
  4139. 792.67 s [doctest] drops whitespace as appropriate [✔]
  4140. 792.67 s [doctest] parses an interaction without a result [✔]
  4141. 792.67 s [doctest] works with a complex example [✔]
  4142. 792.67 s [doctest] attaches location information to parsed interactions [✔]
  4143. 792.67 s [doctest] basic multiline [✔]
  4144. 792.67 s [doctest] multiline align output [✔]
  4145. 792.67 s [doctest] multiline align output with >>> [✔]
  4146. 792.67 s [doctest] parses wild cards lines [✔]
  4147. 792.67 s [doctest] parses wild card chunks [✔]
  4148. 792.67 s [doctest] parseProperties (an internal function)
  4149. 792.67 s [doctest] parses a property [✔]
  4150. 792.67 s [doctest] mkLineChunks (an internal function)
  4151. 792.68 s [doctest] replaces ellipsis with WildCardChunks [✔]
  4152. 792.68 s [doctest] doesn't replace fewer than 3 consecutive dots [✔]
  4153. 792.68 s [doctest] handles leading and trailing dots [✔]
  4154. 792.68 s [doctest] handles leading and trailing ellipsis [✔]
  4155. 792.68 s [doctest] Property
  4156. 792.68 s [doctest] runProperty
  4157. 793.27 s [doctest] reports a failing property [✔]
  4158. 793.89 s [doctest] runs a Bool property [✔]
  4159. 794.51 s [doctest] runs a Bool property with an explicit type signature [✔]
  4160. 795.19 s [doctest] runs an implicitly quantified property [✔]
  4161. 795.87 s [doctest] runs an implicitly quantified property even with GHC 7.4 [✔]
  4162. 796.46 s [doctest] runs an explicitly quantified property [✔]
  4163. 797.04 s [doctest] allows to mix implicit and explicit quantification [✔]
  4164. 797.74 s [doctest] reports the value for which a property fails [✔]
  4165. 798.43 s [doctest] reports the values for which a property that takes multiple arguments fails [✔]
  4166. 799.13 s [doctest] defaults ambiguous type variables to Integer [✔]
  4167. 799.13 s [doctest] freeVariables
  4168. 799.57 s [doctest] finds a free variables in a term [✔]
  4169. 800.02 s [doctest] ignores duplicates [✔]
  4170. 800.55 s [doctest] works for terms with multiple names [✔]
  4171. 801.00 s [doctest] works for names that contain a prime [✔]
  4172. 801.44 s [doctest] works for names that are similar to other names that are in scope [✔]
  4173. 801.44 s [doctest] parseNotInScope
  4174. 801.44 s [doctest] when error message was produced by GHC 7.4.1
  4175. 801.44 s [doctest] extracts a variable name of variable that is not in scope from an error message [✔]
  4176. 801.44 s [doctest] ignores duplicates [✔]
  4177. 801.44 s [doctest] works for variable names that contain a prime [✔]
  4178. 801.44 s [doctest] works for error messages with suggestions [✔]
  4179. 801.44 s [doctest] when error message was produced by GHC 8.0.1
  4180. 801.44 s [doctest] extracts a variable name of variable that is not in scope from an error message [✔]
  4181. 801.44 s [doctest] ignores duplicates [✔]
  4182. 801.44 s [doctest] works for variable names that contain a prime [✔]
  4183. 801.44 s [doctest] works for error messages with suggestions [✔]
  4184. 801.44 s [doctest] Run
  4185. 801.44 s [doctest] doctest
  4186. 802.01 s [doctest] exits with ExitFailure if at least one test case fails [✔]
  4187. 802.01 s [doctest] prints help on --help [✔]
  4188. 802.01 s [doctest] prints version on --version [✔]
  4189. 802.83 s [doctest] accepts arbitrary GHC options [✔]
  4190. 803.49 s [doctest] accepts GHC options with --optghc [✔]
  4191. 804.21 s [doctest] prints a deprecation message for --optghc [✔]
  4192. 804.36 s [doctest] prints error message on invalid option [✔]
  4193. 805.05 s [doctest] interprets GHC response files [✔]
  4194. 805.66 s [doctest] prints verbose description of a specification [✔]
  4195. 806.48 s [doctest] prints verbose description of a property [✔]
  4196. 807.17 s [doctest] prints verbose error [✔]
  4197. 807.96 s [doctest] can deal with potentially problematic GHC options [✔]
  4198. 807.96 s [doctest] doctestWithResult
  4199. 807.96 s [doctest] on parse error
  4200. 808.02 s [doctest] aborts with (ExitFailure 1) [✔]
  4201. 808.12 s [doctest] prints a useful error message [✔]
  4202. 808.12 s [doctest] expandDirs
  4203. 808.12 s [doctest] expands a directory [✔]
  4204. 808.12 s [doctest] ignores files [✔]
  4205. 808.12 s [doctest] ignores random things [✔]
  4206. 808.12 s [doctest] Runner
  4207. 808.12 s [doctest] report
  4208. 808.12 s [doctest] when mode is interactive
  4209. 808.12 s [doctest] writes to stderr [✔]
  4210. 808.12 s [doctest] when mode is non-interactive
  4211. 808.12 s [doctest] writes to stderr [✔]
  4212. 808.12 s [doctest] report_
  4213. 808.12 s [doctest] when mode is interactive
  4214. 808.12 s [doctest] writes transient output to stderr [✔]
  4215. 808.12 s [doctest] when mode is non-interactive
  4216. 808.12 s [doctest] is ignored [✔]
  4217. 808.12 s [doctest] Runner.Example
  4218. 808.12 s [doctest] mkResult
  4219. 808.18 s [doctest] returns Equal when output matches [✔]
  4220. 808.18 s [doctest] +++ OK, passed 100 tests.
  4221. 808.18 s [doctest] ignores trailing whitespace [✔]
  4222. 808.18 s [doctest] with WildCardLine
  4223. 808.18 s [doctest] matches zero lines [✔]
  4224. 808.18 s [doctest] matches first zero line [✔]
  4225. 808.18 s [doctest] matches final zero line [✔]
  4226. 808.18 s [doctest] matches an arbitrary number of lines [✔]
  4227. 808.19 s [doctest] matches an arbitrary number of lines (quickcheck) [✔]
  4228. 808.19 s [doctest] +++ OK, passed 100 tests.
  4229. 808.19 s [doctest] with WildCardChunk
  4230. 808.19 s [doctest] matches an arbitrary line chunk [✔]
  4231. 808.19 s [doctest] matches an arbitrary line chunk at end [✔]
  4232. 808.19 s [doctest] does not match at end [✔]
  4233. 808.19 s [doctest] does not match at start [✔]
  4234. 808.19 s [doctest] when output does not match
  4235. 808.19 s [doctest] constructs failure message [✔]
  4236. 808.19 s [doctest] constructs failure message for multi-line output [✔]
  4237. 808.19 s [doctest] when any output line contains "unsafe" characters
  4238. 808.19 s [doctest] uses show to format output lines [✔]
  4239. 808.19 s [doctest] insert caret after last matching character on different lengths [✔]
  4240. 808.19 s [doctest] insert caret after mismatching line for multi-line output [✔]
  4241. 808.19 s [doctest] insert caret after mismatching line with the longest match for multi-line wildcard pattern [✔]
  4242. 808.19 s [doctest] insert caret after longest match for wildcard [✔]
  4243. 808.19 s [doctest] show expanded pattern for long matches [✔]
  4244. 808.19 s [doctest] Util
  4245. 808.19 s [doctest] convertDosLineEndings
  4246. 808.19 s [doctest] converts CRLF to LF [✔]
  4247. 808.19 s [doctest] strips a trailing CR [✔]
  4248. 808.19 s [doctest] takeWhileEnd
  4249. 808.19 s [doctest] returns the longest suffix of elements that satisfy a given predicate [✔]
  4250. 808.19 s [doctest]
  4251. 808.19 s [doctest] Finished in 49.1588 seconds
  4252. 808.19 s [doctest] 198 examples, 0 failures
  4253. 808.24 s [doctest] Test suite spec: PASS
  4254. 808.24 s [doctest] Test suite logged to: dist/test/doctest-0.24.2-spec.log
  4255. 808.24 s [doctest] 1 of 1 test suites (1 of 1 test cases) passed.
  4256. 808.26 s [doctest] checkPhase completed in 50 seconds
  4257. 808.26 s [doctest] Phase: haddockPhase
  4258. 808.59 s [doctest] Preprocessing library for doctest-0.24.2..
  4259. 808.61 s [doctest] Running Haddock on library for doctest-0.24.2..
  4260. 808.79 s [doctest] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
  4261. 812.35 s [doctest] 0% ( 0 / 2) in 'Test.DocTest.Internal.Cabal'
  4262. 812.36 s [doctest] Missing documentation for:
  4263. 812.36 s [doctest] Module header
  4264. 812.36 s [doctest] doctest (src/Test/DocTest/Internal/Cabal.hs:9)
  4265. 812.37 s [doctest] 88% ( 8 / 9) in 'Test.DocTest.Internal.Location'
  4266. 812.37 s [doctest] Missing documentation for:
  4267. 812.37 s [doctest] Module header
  4268. 812.75 s [doctest] 66% ( 2 / 3) in 'Test.DocTest.Internal.Extract'
  4269. 812.75 s [doctest] Missing documentation for:
  4270. 812.75 s [doctest] Module header
  4271. 812.86 s [doctest] 22% ( 2 / 9) in 'Test.DocTest.Internal.Parse'
  4272. 812.86 s [doctest] Missing documentation for:
  4273. 812.86 s [doctest] Module header
  4274. 812.86 s [doctest] DocTest (src/Parse.hs:29)
  4275. 812.86 s [doctest] Expression (src/Parse.hs:44)
  4276. 812.86 s [doctest] ExpectedResult (src/Parse.hs:45)
  4277. 812.86 s [doctest] ExpectedLine (src/Parse.hs:38)
  4278. 812.86 s [doctest] LineChunk (src/Parse.hs:32)
  4279. 812.86 s [doctest] parseModules (src/Parse.hs:59)
  4280. 813.22 s [doctest] Warning: 'report_' is out of scope.
  4281. 813.22 s [doctest] If you qualify the identifier, haddock can try to link it anyway.
  4282. 813.48 s [doctest] 15% ( 2 / 13) in 'Test.DocTest.Internal.Run'
  4283. 813.48 s [doctest] Missing documentation for:
  4284. 813.48 s [doctest] Module header
  4285. 813.48 s [doctest] doctestWithRepl (src/Run.hs:66)
  4286. 813.48 s [doctest] Config (src/Options.hs:58)
  4287. 813.48 s [doctest] defaultConfig (src/Options.hs:67)
  4288. 813.48 s [doctest] doctestWith (src/Run.hs:136)
  4289. 813.48 s [doctest] Result (src/Run.hs:139)
  4290. 813.48 s [doctest] formatSummary (src/Runner.hs:57)
  4291. 813.48 s [doctest] isSuccess (src/Runner.hs:54)
  4292. 813.48 s [doctest] evaluateResult (src/Run.hs:141)
  4293. 813.48 s [doctest] doctestWithResult (src/Run.hs:144)
  4294. 813.48 s [doctest] runDocTests (src/Run.hs:154)
  4295. 813.48 s [doctest] 50% ( 1 / 2) in 'Test.DocTest'
  4296. 813.48 s [doctest] Missing documentation for:
  4297. 813.48 s [doctest] Module header
  4298. 835.29 s [doctest] Documentation created: dist/doc/html/doctest/index.html,
  4299. 835.31 s [doctest] dist/doc/html/doctest/doctest.txt
  4300. 835.58 s [doctest] Preprocessing executable 'doctest' for doctest-0.24.2..
  4301. 835.58 s [doctest] Preprocessing test suite 'spec' for doctest-0.24.2..
  4302. 835.65 s [doctest] Phase: installPhase
  4303. 835.93 s [doctest] Installing library in /nix/store/jbbd7dp036y9l3jv36q5ffbsn5s78wcn-doctest-0.24.2/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/doctest-0.24.2-I8Dj1Qj4flA6uA6Qf1gy88
  4304. 836.24 s [doctest] Installing executable doctest in /nix/store/jbbd7dp036y9l3jv36q5ffbsn5s78wcn-doctest-0.24.2/bin
  4305. 836.24 s [doctest] Warning: The directory
  4306. 836.24 s [doctest] /nix/store/jbbd7dp036y9l3jv36q5ffbsn5s78wcn-doctest-0.24.2/bin is not in the
  4307. 836.24 s [doctest] system search path.
  4308. 837.90 s [doctest] Phase: fixupPhase
  4309. 837.94 s [doctest] shrinking RPATHs of ELF executables and libraries in /nix/store/jbbd7dp036y9l3jv36q5ffbsn5s78wcn-doctest-0.24.2
  4310. 837.94 s [doctest] shrinking /nix/store/jbbd7dp036y9l3jv36q5ffbsn5s78wcn-doctest-0.24.2/bin/doctest
  4311. 838.21 s [doctest] shrinking /nix/store/jbbd7dp036y9l3jv36q5ffbsn5s78wcn-doctest-0.24.2/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/libHSdoctest-0.24.2-I8Dj1Qj4flA6uA6Qf1gy88-ghc9.4.8.so
  4312. 838.23 s [doctest] checking for references to /build/ in /nix/store/jbbd7dp036y9l3jv36q5ffbsn5s78wcn-doctest-0.24.2...
  4313. 838.42 s [doctest] patching script interpreter paths in /nix/store/jbbd7dp036y9l3jv36q5ffbsn5s78wcn-doctest-0.24.2
  4314. 838.44 s [doctest] stripping (with command strip and flags -S -p) in /nix/store/jbbd7dp036y9l3jv36q5ffbsn5s78wcn-doctest-0.24.2/lib /nix/store/jbbd7dp036y9l3jv36q5ffbsn5s78wcn-doctest-0.24.2/bin
  4315. 839.24 s [doctest] shrinking RPATHs of ELF executables and libraries in /nix/store/d6qd929y8siwb5rbfv14xg36dlblmhwg-doctest-0.24.2-doc
  4316. 839.26 s [doctest] checking for references to /build/ in /nix/store/d6qd929y8siwb5rbfv14xg36dlblmhwg-doctest-0.24.2-doc...
  4317. 839.31 s [doctest] patching script interpreter paths in /nix/store/d6qd929y8siwb5rbfv14xg36dlblmhwg-doctest-0.24.2-doc
  4318. 840.10 s [doctest:post-build] Uploading to cachix cache "sellout": /nix/store/d6qd929y8siwb5rbfv14xg36dlblmhwg-doctest-0.24.2-doc /nix/store/jbbd7dp036y9l3jv36q5ffbsn5s78wcn-doctest-0.24.2
  4319. 840.77 s [doctest:post-build] Nothing to push - all store paths are already on Cachix.
  4320. 840.82 s [doctest:post-build] Uploading to the NixCI cache: /nix/store/d6qd929y8siwb5rbfv14xg36dlblmhwg-doctest-0.24.2-doc /nix/store/jbbd7dp036y9l3jv36q5ffbsn5s78wcn-doctest-0.24.2
  4321. 840.94 s [doctest:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  4322. 841.06 s [doctest:post-build] copying 1 paths...
  4323. 841.06 s [doctest:post-build] copying path '/nix/store/jbbd7dp036y9l3jv36q5ffbsn5s78wcn-doctest-0.24.2' to 'https://cache.nix-ci.com'...
  4324. 893.61 s [doctest:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  4325. 893.71 s [doctest:post-build] copying 0 paths...
  4326. 893.74 s Progress: 5 of 22 built, 161 of 161 downloaded from cache
  4327. 893.82 s Building /nix/store/j360g18grw99wqxp9ixv7pqay6yxdhkr-duoids-0.0.1.0.drv
  4328. 893.88 s Building /nix/store/vk0hh2yldk3zdscmvxi5ni5fz9wvb06q-vector-0.13.2.0.drv
  4329. 893.95 s [duoids] Phase: setupCompilerEnvironmentPhase
  4330. 893.95 s [duoids] Build with /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8.
  4331. 894.08 s [vector] Phase: setupCompilerEnvironmentPhase
  4332. 894.09 s [vector] Build with /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8.
  4333. 894.34 s [duoids] Phase: unpackPhase
  4334. 894.43 s [vector] Phase: unpackPhase
  4335. 894.55 s [duoids] unpacking source archive /nix/store/j3nhvvhbp8d5l29mqdaf8f513lxyga6r-z8smrhvl4j2a1x1vb5nv502a87a6wsx7-source/./core
  4336. 894.55 s [vector] unpacking source archive /nix/store/ysi2m95adzhn3nmggwppnxvmps3a93x3-vector-0.13.2.0.tar.gz
  4337. 894.57 s [vector] source root is vector-0.13.2.0
  4338. 894.57 s [duoids] source root is core
  4339. 894.58 s [vector] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "vector-0.13.2.0/vector.cabal"
  4340. 894.59 s [duoids] Phase: patchPhase
  4341. 894.59 s [vector] Phase: patchPhase
  4342. 894.60 s [vector] Replace Cabal file with edited version from mirror://hackage/vector-0.13.2.0/revision/2.cabal.
  4343. 894.60 s [duoids] Phase: compileBuildDriverPhase
  4344. 894.60 s [duoids] setupCompileFlags: -package-db=/build/tmp.PcfHOtmjZM/setup-package.conf.d -threaded
  4345. 894.60 s [vector] Run jailbreak-cabal to lift version restrictions on build inputs.
  4346. 894.66 s [vector] Phase: compileBuildDriverPhase
  4347. 894.66 s [vector] setupCompileFlags: -package-db=/build/tmp.hZL8pAGKki/setup-package.conf.d -threaded
  4348. 894.75 s [duoids] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.PcfHOtmjZM/Main.o )
  4349. 894.81 s [vector] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.hZL8pAGKki/Main.o )
  4350. 894.88 s [duoids] [2 of 2] Linking Setup
  4351. 894.90 s [vector] [2 of 2] Linking Setup
  4352. 897.50 s [vector] Phase: updateAutotoolsGnuConfigScriptsPhase
  4353. 897.53 s [vector] Phase: configurePhase
  4354. 897.54 s [vector] configureFlags: --verbose --prefix=/nix/store/zwx2a4ffc7zak6cbip0l9cgpmig6ncvd-vector-0.13.2.0 --libdir=$prefix/lib/$compiler --libsubdir=$abi/$libname --with-gcc=gcc --package-db=/build/tmp.hZL8pAGKki/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --extra-lib-dirs=/nix/store/ffyzkisqs4vc4mg28bwwlyqjf8i9ph6b-ncurses-6.5/lib --extra-lib-dirs=/nix/store/n28qgdj8c1q41kf7n4y1jxa6ckp85m3c-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/hi0ar880110k6jsmmili7dh1gq3cg2a9-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/g09cflpnp4g80q56sj9dng1qzv4v4ybc-numactl-2.0.18/lib --extra-lib-dirs=/nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/lib
  4355. 897.70 s [duoids] Phase: updateAutotoolsGnuConfigScriptsPhase
  4356. 897.71 s [duoids] Phase: configurePhase
  4357. 897.72 s [duoids] configureFlags: --verbose --prefix=/nix/store/sbjyg7prrvz721rvkkyhsrjmwwr13jap-duoids-0.0.1.0 --libdir=$prefix/lib/$compiler --libsubdir=$abi/$libname --docdir=/nix/store/9fkmq4jhvhdmmsyc5j3fgyqp19jc1xcs-duoids-0.0.1.0-doc/share/doc/duoids-0.0.1.0 --with-gcc=gcc --package-db=/build/tmp.PcfHOtmjZM/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --ghc-options=-Werror --extra-lib-dirs=/nix/store/ffyzkisqs4vc4mg28bwwlyqjf8i9ph6b-ncurses-6.5/lib --extra-lib-dirs=/nix/store/n28qgdj8c1q41kf7n4y1jxa6ckp85m3c-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/hi0ar880110k6jsmmili7dh1gq3cg2a9-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/g09cflpnp4g80q56sj9dng1qzv4v4ybc-numactl-2.0.18/lib --extra-lib-dirs=/nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/lib
  4358. 897.74 s [duoids] Using Parsec parser
  4359. 897.74 s [duoids] Configuring duoids-0.0.1.0...
  4360. 898.51 s [duoids] Flags chosen: lint=False, noisy-deprecations=True
  4361. 898.55 s [vector] Using Parsec parser
  4362. 898.55 s [vector] Configuring vector-0.13.2.0...
  4363. 898.55 s [vector] Flags chosen: boundschecks=True, internalchecks=False, unsafechecks=False,
  4364. 898.55 s [vector] wall=False
  4365. 898.55 s [vector] Dependency base: using base-4.17.2.1
  4366. 898.55 s [vector] Dependency deepseq: using deepseq-1.4.8.0
  4367. 898.56 s [vector] Dependency primitive: using primitive-0.9.1.0
  4368. 898.56 s [vector] Dependency vector-stream: using vector-stream-0.1.0.1
  4369. 898.56 s [vector] Dependency base: using base-4.17.2.1
  4370. 898.56 s [vector] Dependency random: using random-1.2.1.3
  4371. 898.56 s [vector] Dependency tasty: using tasty-1.5.3
  4372. 898.56 s [vector] Dependency vector: using vector-0.13.2.0
  4373. 898.56 s [vector] Dependency QuickCheck: using QuickCheck-2.15.0.1
  4374. 898.56 s [vector] Dependency base: using base-4.17.2.1
  4375. 898.56 s [vector] Dependency base-orphans: using base-orphans-0.9.3
  4376. 898.56 s [vector] Dependency primitive: using primitive-0.9.1.0
  4377. 898.56 s [vector] Dependency random: using random-1.2.1.3
  4378. 898.56 s [vector] Dependency tasty: using tasty-1.5.3
  4379. 898.56 s [vector] Dependency tasty-hunit: using tasty-hunit-0.10.2
  4380. 898.56 s [vector] Dependency tasty-quickcheck: using tasty-quickcheck-0.11.1
  4381. 898.56 s [vector] Dependency template-haskell: using template-haskell-2.19.0.0
  4382. 898.56 s [vector] Dependency transformers: using transformers-0.5.6.2
  4383. 898.56 s [vector] Dependency vector: using vector-0.13.2.0
  4384. 898.56 s [vector] Dependency QuickCheck: using QuickCheck-2.15.0.1
  4385. 898.56 s [vector] Dependency base: using base-4.17.2.1
  4386. 898.56 s [vector] Dependency base-orphans: using base-orphans-0.9.3
  4387. 898.56 s [vector] Dependency primitive: using primitive-0.9.1.0
  4388. 898.56 s [vector] Dependency random: using random-1.2.1.3
  4389. 898.56 s [vector] Dependency tasty: using tasty-1.5.3
  4390. 898.56 s [vector] Dependency tasty-hunit: using tasty-hunit-0.10.2
  4391. 898.56 s [vector] Dependency tasty-quickcheck: using tasty-quickcheck-0.11.1
  4392. 898.56 s [vector] Dependency template-haskell: using template-haskell-2.19.0.0
  4393. 898.56 s [vector] Dependency transformers: using transformers-0.5.6.2
  4394. 898.56 s [vector] Dependency vector: using vector-0.13.2.0
  4395. 898.56 s [vector] Dependency base: using base-4.17.2.1
  4396. 898.56 s [vector] Dependency doctest: using doctest-0.24.2
  4397. 898.56 s [vector] Dependency primitive: using primitive-0.9.1.0
  4398. 898.56 s [vector] Dependency vector: using vector-0.13.2.0
  4399. 898.56 s [vector] Dependency base: using base-4.17.2.1
  4400. 898.56 s [vector] Dependency primitive: using primitive-0.9.1.0
  4401. 898.56 s [vector] Dependency tasty: using tasty-1.5.3
  4402. 898.56 s [vector] Dependency tasty-inspection-testing: using tasty-inspection-testing-0.2.1
  4403. 898.56 s [vector] Dependency vector: using vector-0.13.2.0
  4404. 898.91 s [vector] Source component graph:
  4405. 898.94 s [vector] component lib
  4406. 898.94 s [vector] component lib:benchmarks-O2 dependency lib
  4407. 898.94 s [vector] component test:vector-doctest dependency lib
  4408. 898.94 s [vector] component test:vector-inspection dependency lib
  4409. 898.94 s [vector] component test:vector-tests-O0 dependency lib
  4410. 898.94 s [vector] component test:vector-tests-O2 dependency lib
  4411. 898.94 s [vector] Configured component graph:
  4412. 898.94 s [vector] component vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf
  4413. 898.94 s [vector] include base-4.17.2.1
  4414. 898.94 s [vector] include deepseq-1.4.8.0
  4415. 898.94 s [vector] include primitive-0.9.1.0-IzoEy6gcvXy7FAbkwCq547
  4416. 898.94 s [vector] include vector-stream-0.1.0.1-F03bfhC0HhqL26lQDSs4vb
  4417. 898.94 s [vector] component vector-0.13.2.0-Buajc9dwOtY17MYNPDdyiX-benchmarks-O2
  4418. 898.94 s [vector] include base-4.17.2.1
  4419. 898.94 s [vector] include random-1.2.1.3-EBsIWSQBdMjJ1kHbvwBdg2
  4420. 898.94 s [vector] include tasty-1.5.3-JmKTCIqeCnz2cfDkXVBEQb
  4421. 898.94 s [vector] include vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf
  4422. 898.94 s [vector] component vector-0.13.2.0-BrHxLv2KUPv5Fn8v7eQoOx-vector-doctest
  4423. 898.94 s [vector] include base-4.17.2.1
  4424. 898.94 s [vector] include doctest-0.24.2-I8Dj1Qj4flA6uA6Qf1gy88
  4425. 898.94 s [vector] include primitive-0.9.1.0-IzoEy6gcvXy7FAbkwCq547
  4426. 898.94 s [vector] include vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf
  4427. 898.94 s [vector] component vector-0.13.2.0-5Q4kMcUxhdwEKrCweElQP4-vector-inspection
  4428. 898.94 s [vector] include base-4.17.2.1
  4429. 898.94 s [vector] include primitive-0.9.1.0-IzoEy6gcvXy7FAbkwCq547
  4430. 898.94 s [vector] include tasty-1.5.3-JmKTCIqeCnz2cfDkXVBEQb
  4431. 898.94 s [vector] include tasty-inspection-testing-0.2.1-48CUMaIHGWv8RqzO1O1dns
  4432. 898.94 s [vector] include vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf
  4433. 898.94 s [vector] component vector-0.13.2.0-HRM4UhWJxA9CssEeWd3cIj-vector-tests-O0
  4434. 898.94 s [vector] include QuickCheck-2.15.0.1-H9C4qdCN40J1jJ9nkbU8lt
  4435. 898.94 s [vector] include base-4.17.2.1
  4436. 898.94 s [vector] include base-orphans-0.9.3-BnQ7VdntHVR2bPjqU1A3eC
  4437. 898.94 s [vector] include primitive-0.9.1.0-IzoEy6gcvXy7FAbkwCq547
  4438. 898.94 s [vector] include random-1.2.1.3-EBsIWSQBdMjJ1kHbvwBdg2
  4439. 898.94 s [vector] include tasty-1.5.3-JmKTCIqeCnz2cfDkXVBEQb
  4440. 898.94 s [vector] include tasty-hunit-0.10.2-BKEPVyyDdHQLqQfkhUYBIs
  4441. 898.94 s [vector] include tasty-quickcheck-0.11.1-I2kaBODHeTY9Cl9vsHe7
  4442. 898.94 s [vector] include template-haskell-2.19.0.0
  4443. 898.94 s [vector] include transformers-0.5.6.2
  4444. 898.94 s [vector] include vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf
  4445. 898.94 s [vector] component vector-0.13.2.0-HvmzB5mUEm43fHZBv42gz1-vector-tests-O2
  4446. 898.94 s [vector] include QuickCheck-2.15.0.1-H9C4qdCN40J1jJ9nkbU8lt
  4447. 898.94 s [vector] include base-4.17.2.1
  4448. 898.94 s [vector] include base-orphans-0.9.3-BnQ7VdntHVR2bPjqU1A3eC
  4449. 898.94 s [vector] include primitive-0.9.1.0-IzoEy6gcvXy7FAbkwCq547
  4450. 898.94 s [vector] include random-1.2.1.3-EBsIWSQBdMjJ1kHbvwBdg2
  4451. 898.94 s [vector] include tasty-1.5.3-JmKTCIqeCnz2cfDkXVBEQb
  4452. 898.94 s [vector] include tasty-hunit-0.10.2-BKEPVyyDdHQLqQfkhUYBIs
  4453. 898.94 s [vector] include tasty-quickcheck-0.11.1-I2kaBODHeTY9Cl9vsHe7
  4454. 898.94 s [vector] include template-haskell-2.19.0.0
  4455. 898.94 s [vector] include transformers-0.5.6.2
  4456. 898.94 s [vector] include vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf
  4457. 898.94 s [vector] Linked component graph:
  4458. 898.94 s [vector] unit vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf
  4459. 898.94 s [vector] include base-4.17.2.1
  4460. 898.94 s [vector] include deepseq-1.4.8.0
  4461. 898.94 s [vector] include primitive-0.9.1.0-IzoEy6gcvXy7FAbkwCq547
  4462. 898.94 s [vector] include vector-stream-0.1.0.1-F03bfhC0HhqL26lQDSs4vb
  4463. 898.94 s [vector] Data.Vector=vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf:Data.Vector,Data.Vector.Fusion.Bundle=vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf:Data.Vector.Fusion.Bundle,Data.Vector.Fusion.Bundle.Monadic=vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf:Data.Vector.Fusion.Bundle.Monadic,Data.Vector.Fusion.Bundle.Size=vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf:Data.Vector.Fusion.Bundle.Size,Data.Vector.Fusion.Stream.Monadic=vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf:Data.Vector.Fusion.Stream.Monadic,Data.Vector.Fusion.Util=vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf:Data.Vector.Fusion.Util,Data.Vector.Generic=vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf:Data.Vector.Generic,Data.Vector.Generic.Base=vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf:Data.Vector.Generic.Base,Data.Vector.Generic.Mutable=vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf:Data.Vector.Generic.Mutable,Data.Vector.Generic.Mutable.Base=vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf:Data.Vector.Generic.Mutable.Base,Data.Vector.Generic.New=vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf:Data.Vector.Generic.New,Data.Vector.Internal.Check=vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf:Data.Vector.Internal.Check,Data.Vector.Mutable=vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf:Data.Vector.Mutable,Data.Vector.Primitive=vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf:Data.Vector.Primitive,Data.Vector.Primitive.Mutable=vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf:Data.Vector.Primitive.Mutable,Data.Vector.Storable=vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf:Data.Vector.Storable,Data.Vector.Storable.Internal=vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf:Data.Vector.Storable.Internal,Data.Vector.Storable.Mutable=vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf:Data.Vector.Storable.Mutable,Data.Vector.Strict=vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf:Data.Vector.Strict,Data.Vector.Strict.Mutable=vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf:Data.Vector.Strict.Mutable,Data.Vector.Unboxed=vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf:Data.Vector.Unboxed,Data.Vector.Unboxed.Base=vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf:Data.Vector.Unboxed.Base,Data.Vector.Unboxed.Mutable=vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf:Data.Vector.Unboxed.Mutable
  4464. 898.94 s [vector] unit vector-0.13.2.0-Buajc9dwOtY17MYNPDdyiX-benchmarks-O2
  4465. 898.94 s [vector] include base-4.17.2.1
  4466. 898.94 s [vector] include random-1.2.1.3-EBsIWSQBdMjJ1kHbvwBdg2
  4467. 898.94 s [vector] include tasty-1.5.3-JmKTCIqeCnz2cfDkXVBEQb
  4468. 898.94 s [vector] include vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf
  4469. 898.94 s [vector] Bench.Vector.Algo.AwShCC=vector-0.13.2.0-Buajc9dwOtY17MYNPDdyiX-benchmarks-O2:Bench.Vector.Algo.AwShCC,Bench.Vector.Algo.FindIndexR=vector-0.13.2.0-Buajc9dwOtY17MYNPDdyiX-benchmarks-O2:Bench.Vector.Algo.FindIndexR,Bench.Vector.Algo.HybCC=vector-0.13.2.0-Buajc9dwOtY17MYNPDdyiX-benchmarks-O2:Bench.Vector.Algo.HybCC,Bench.Vector.Algo.Leaffix=vector-0.13.2.0-Buajc9dwOtY17MYNPDdyiX-benchmarks-O2:Bench.Vector.Algo.Leaffix,Bench.Vector.Algo.ListRank=vector-0.13.2.0-Buajc9dwOtY17MYNPDdyiX-benchmarks-O2:Bench.Vector.Algo.ListRank,Bench.Vector.Algo.MutableSet=vector-0.13.2.0-Buajc9dwOtY17MYNPDdyiX-benchmarks-O2:Bench.Vector.Algo.MutableSet,Bench.Vector.Algo.NextPermutation=vector-0.13.2.0-Buajc9dwOtY17MYNPDdyiX-benchmarks-O2:Bench.Vector.Algo.NextPermutation,Bench.Vector.Algo.Quickhull=vector-0.13.2.0-Buajc9dwOtY17MYNPDdyiX-benchmarks-O2:Bench.Vector.Algo.Quickhull,Bench.Vector.Algo.Rootfix=vector-0.13.2.0-Buajc9dwOtY17MYNPDdyiX-benchmarks-O2:Bench.Vector.Algo.Rootfix,Bench.Vector.Algo.Spectral=vector-0.13.2.0-Buajc9dwOtY17MYNPDdyiX-benchmarks-O2:Bench.Vector.Algo.Spectral,Bench.Vector.Algo.Tridiag=vector-0.13.2.0-Buajc9dwOtY17MYNPDdyiX-benchmarks-O2:Bench.Vector.Algo.Tridiag,Bench.Vector.Tasty=vector-0.13.2.0-Buajc9dwOtY17MYNPDdyiX-benchmarks-O2:Bench.Vector.Tasty,Bench.Vector.TestData.Graph=vector-0.13.2.0-Buajc9dwOtY17MYNPDdyiX-benchmarks-O2:Bench.Vector.TestData.Graph,Bench.Vector.TestData.ParenTree=vector-0.13.2.0-Buajc9dwOtY17MYNPDdyiX-benchmarks-O2:Bench.Vector.TestData.ParenTree
  4470. 898.94 s [vector] unit vector-0.13.2.0-BrHxLv2KUPv5Fn8v7eQoOx-vector-doctest
  4471. 898.94 s [vector] include base-4.17.2.1
  4472. 898.94 s [vector] include doctest-0.24.2-I8Dj1Qj4flA6uA6Qf1gy88
  4473. 898.94 s [vector] include primitive-0.9.1.0-IzoEy6gcvXy7FAbkwCq547
  4474. 898.94 s [vector] include vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf
  4475. 898.94 s [vector] unit vector-0.13.2.0-5Q4kMcUxhdwEKrCweElQP4-vector-inspection
  4476. 898.94 s [vector] include base-4.17.2.1
  4477. 898.94 s [vector] include primitive-0.9.1.0-IzoEy6gcvXy7FAbkwCq547
  4478. 898.94 s [vector] include tasty-1.5.3-JmKTCIqeCnz2cfDkXVBEQb
  4479. 898.94 s [vector] include tasty-inspection-testing-0.2.1-48CUMaIHGWv8RqzO1O1dns
  4480. 898.94 s [vector] include vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf
  4481. 898.94 s [vector] unit vector-0.13.2.0-HRM4UhWJxA9CssEeWd3cIj-vector-tests-O0
  4482. 898.94 s [vector] include QuickCheck-2.15.0.1-H9C4qdCN40J1jJ9nkbU8lt
  4483. 898.94 s [vector] include base-4.17.2.1
  4484. 898.94 s [vector] include base-orphans-0.9.3-BnQ7VdntHVR2bPjqU1A3eC
  4485. 898.94 s [vector] include primitive-0.9.1.0-IzoEy6gcvXy7FAbkwCq547
  4486. 898.95 s [vector] include random-1.2.1.3-EBsIWSQBdMjJ1kHbvwBdg2
  4487. 898.95 s [vector] include tasty-1.5.3-JmKTCIqeCnz2cfDkXVBEQb
  4488. 898.95 s [vector] include tasty-hunit-0.10.2-BKEPVyyDdHQLqQfkhUYBIs
  4489. 898.95 s [vector] include tasty-quickcheck-0.11.1-I2kaBODHeTY9Cl9vsHe7
  4490. 898.95 s [vector] include template-haskell-2.19.0.0
  4491. 898.95 s [vector] include transformers-0.5.6.2
  4492. 898.95 s [vector] include vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf
  4493. 898.95 s [vector] unit vector-0.13.2.0-HvmzB5mUEm43fHZBv42gz1-vector-tests-O2
  4494. 898.95 s [vector] include QuickCheck-2.15.0.1-H9C4qdCN40J1jJ9nkbU8lt
  4495. 898.95 s [vector] include base-4.17.2.1
  4496. 898.95 s [vector] include base-orphans-0.9.3-BnQ7VdntHVR2bPjqU1A3eC
  4497. 899.38 s [duoids] Dependency base >=4.16.0 && <4.17 || >=4.17.0 && <4.18 || >=4.18.0 && <4.19 ||
  4498. 899.38 s [duoids] >=4.19.0 && <4.20 || >=4.20.0 && <4.21 || >=4.21.0 && <4.22 || >=4.22.0 &&
  4499. 899.38 s [duoids] <4.23: using base-4.17.2.1
  4500. 899.38 s [duoids] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  4501. 899.39 s [duoids] Dependency base >=4.16.0 && <4.17 || >=4.17.0 && <4.18 || >=4.18.0 && <4.19 ||
  4502. 899.39 s [duoids] >=4.19.0 && <4.20 || >=4.20.0 && <4.21 || >=4.21.0 && <4.22 || >=4.22.0 &&
  4503. 899.39 s [duoids] <4.23: using base-4.17.2.1
  4504. 899.39 s [duoids] Dependency doctest >=0.18.2 && <0.19 || >=0.20.1 && <0.21 || >=0.21.1 && <0.22
  4505. 899.39 s [duoids] || >=0.22.6 && <0.23 || >=0.24.0 && <0.25 || >=0.25.0 && <0.26: using
  4506. 899.39 s [duoids] doctest-0.24.2
  4507. 899.39 s [duoids] Dependency duoids: using duoids-0.0.1.0
  4508. 899.39 s [duoids] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  4509. 899.39 s [duoids] Source component graph:
  4510. 899.39 s [duoids] component lib
  4511. 899.39 s [duoids] component test:doctests dependency lib
  4512. 899.39 s [duoids] Configured component graph:
  4513. 899.39 s [duoids] component duoids-0.0.1.0-7Tv3jMouVtXFOM5hnlF6gw
  4514. 899.39 s [duoids] include base-4.17.2.1
  4515. 899.39 s [duoids] include ghc-compat-plugin-0.1.0.1-EF6fkbvBW8o6hs1RRExbcG
  4516. 899.39 s [duoids] component duoids-0.0.1.0-9dBekLPPk8y2uam0bo73MY-doctests
  4517. 899.39 s [duoids] include base-4.17.2.1
  4518. 899.39 s [duoids] include doctest-0.24.2-I8Dj1Qj4flA6uA6Qf1gy88
  4519. 899.39 s [duoids] include duoids-0.0.1.0-7Tv3jMouVtXFOM5hnlF6gw
  4520. 899.39 s [duoids] include ghc-compat-plugin-0.1.0.1-EF6fkbvBW8o6hs1RRExbcG
  4521. 899.39 s [duoids] Linked component graph:
  4522. 899.39 s [duoids] unit duoids-0.0.1.0-7Tv3jMouVtXFOM5hnlF6gw
  4523. 899.39 s [duoids] include base-4.17.2.1
  4524. 899.39 s [duoids] include ghc-compat-plugin-0.1.0.1-EF6fkbvBW8o6hs1RRExbcG
  4525. 899.39 s [duoids] Control.Duoidal=duoids-0.0.1.0-7Tv3jMouVtXFOM5hnlF6gw:Control.Duoidal,Control.Duoidal.Either=duoids-0.0.1.0-7Tv3jMouVtXFOM5hnlF6gw:Control.Duoidal.Either,Control.Duoidal.Laws=duoids-0.0.1.0-7Tv3jMouVtXFOM5hnlF6gw:Control.Duoidal.Laws,Data.Duoid=duoids-0.0.1.0-7Tv3jMouVtXFOM5hnlF6gw:Data.Duoid,Data.Duoid.Laws=duoids-0.0.1.0-7Tv3jMouVtXFOM5hnlF6gw:Data.Duoid.Laws
  4526. 899.39 s [duoids] unit duoids-0.0.1.0-9dBekLPPk8y2uam0bo73MY-doctests
  4527. 899.39 s [duoids] include base-4.17.2.1
  4528. 899.39 s [duoids] include doctest-0.24.2-I8Dj1Qj4flA6uA6Qf1gy88
  4529. 899.39 s [duoids] include duoids-0.0.1.0-7Tv3jMouVtXFOM5hnlF6gw
  4530. 899.39 s [duoids] include ghc-compat-plugin-0.1.0.1-EF6fkbvBW8o6hs1RRExbcG
  4531. 899.39 s [duoids] Ready component graph:
  4532. 899.39 s [duoids] definite duoids-0.0.1.0-7Tv3jMouVtXFOM5hnlF6gw
  4533. 899.39 s [duoids] depends base-4.17.2.1
  4534. 899.39 s [duoids] depends ghc-compat-plugin-0.1.0.1-EF6fkbvBW8o6hs1RRExbcG
  4535. 899.39 s [duoids] definite duoids-0.0.1.0-9dBekLPPk8y2uam0bo73MY-doctests
  4536. 899.39 s [duoids] depends base-4.17.2.1
  4537. 899.39 s [duoids] depends doctest-0.24.2-I8Dj1Qj4flA6uA6Qf1gy88
  4538. 899.39 s [duoids] depends duoids-0.0.1.0-7Tv3jMouVtXFOM5hnlF6gw
  4539. 899.39 s [duoids] depends ghc-compat-plugin-0.1.0.1-EF6fkbvBW8o6hs1RRExbcG
  4540. 899.39 s [duoids] Using Cabal-3.12.1.0 compiled by ghc-9.4
  4541. 899.39 s [duoids] Using compiler: ghc-9.4.8
  4542. 899.39 s [duoids] Using install prefix:
  4543. 899.39 s [duoids] /nix/store/sbjyg7prrvz721rvkkyhsrjmwwr13jap-duoids-0.0.1.0
  4544. 899.39 s [duoids] Executables installed in:
  4545. 899.39 s [duoids] /nix/store/sbjyg7prrvz721rvkkyhsrjmwwr13jap-duoids-0.0.1.0/bin
  4546. 899.39 s [duoids] Libraries installed in:
  4547. 899.39 s [duoids] /nix/store/sbjyg7prrvz721rvkkyhsrjmwwr13jap-duoids-0.0.1.0/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/duoids-0.0.1.0-7Tv3jMouVtXFOM5hnlF6gw
  4548. 899.39 s [duoids] Dynamic Libraries installed in:
  4549. 899.39 s [duoids] /nix/store/sbjyg7prrvz721rvkkyhsrjmwwr13jap-duoids-0.0.1.0/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8
  4550. 899.39 s [duoids] Private executables installed in:
  4551. 899.39 s [duoids] /nix/store/sbjyg7prrvz721rvkkyhsrjmwwr13jap-duoids-0.0.1.0/libexec/x86_64-linux-ghc-9.4.8/duoids-0.0.1.0
  4552. 899.39 s [duoids] Data files installed in:
  4553. 899.39 s [duoids] /nix/store/sbjyg7prrvz721rvkkyhsrjmwwr13jap-duoids-0.0.1.0/share/x86_64-linux-ghc-9.4.8/duoids-0.0.1.0
  4554. 899.39 s [duoids] Documentation installed in:
  4555. 899.39 s [duoids] /nix/store/9fkmq4jhvhdmmsyc5j3fgyqp19jc1xcs-duoids-0.0.1.0-doc/share/doc/duoids-0.0.1.0
  4556. 899.39 s [duoids] Configuration files installed in:
  4557. 899.39 s [duoids] /nix/store/sbjyg7prrvz721rvkkyhsrjmwwr13jap-duoids-0.0.1.0/etc
  4558. 899.39 s [duoids] No alex found
  4559. 899.39 s [duoids] Using ar found on system at:
  4560. 899.39 s [duoids] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  4561. 899.39 s [duoids] No c2hs found
  4562. 899.39 s [duoids] No cpphs found
  4563. 899.39 s [duoids] Using doctest version 0.24.2 found on system at:
  4564. 899.39 s [duoids] /nix/store/jbbd7dp036y9l3jv36q5ffbsn5s78wcn-doctest-0.24.2/bin/doctest
  4565. 899.39 s [duoids] Using gcc version 14.3.0 given by user at:
  4566. 899.39 s [duoids] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  4567. 899.39 s [duoids] Using ghc version 9.4.8 found on system at:
  4568. 899.39 s [duoids] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/ghc
  4569. 899.39 s [duoids] Using ghc-pkg version 9.4.8 found on system at:
  4570. 899.39 s [duoids] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/ghc-pkg-9.4.8
  4571. 899.39 s [duoids] No ghcjs found
  4572. 899.39 s [duoids] No ghcjs-pkg found
  4573. 899.39 s [duoids] No greencard found
  4574. 899.39 s [duoids] Using haddock version 2.27.0 found on system at:
  4575. 899.39 s [duoids] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/haddock-ghc-9.4.8
  4576. 899.40 s [duoids] No happy found
  4577. 899.40 s [duoids] Using haskell-suite found on system at: haskell-suite-dummy-location
  4578. 899.40 s [duoids] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  4579. 899.40 s [duoids] No hmake found
  4580. 899.40 s [duoids] Using hpc version 0.68 found on system at:
  4581. 899.40 s [duoids] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/hpc
  4582. 899.40 s [duoids] Using hsc2hs version 0.68.8 found on system at:
  4583. 899.40 s [duoids] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/hsc2hs
  4584. 899.40 s [duoids] Using hscolour version 1.25 found on system at:
  4585. 899.40 s [duoids] /nix/store/87hdxxa93g58b2w9ylr2idn2a40i3fdc-hscolour-1.25/bin/HsColour
  4586. 899.40 s [duoids] No jhc found
  4587. 899.40 s [duoids] Using ld found on system at:
  4588. 899.40 s [duoids] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ld.gold
  4589. 899.40 s [duoids] No pkg-config found
  4590. 899.40 s [duoids] Using runghc version 9.4.8 found on system at:
  4591. 899.40 s [duoids] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/runghc-9.4.8
  4592. 899.40 s [duoids] Using strip version 2.44 found on system at:
  4593. 899.40 s [duoids] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  4594. 899.40 s [duoids] Using tar found on system at:
  4595. 899.40 s [duoids] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  4596. 899.40 s [duoids] No uhc found
  4597. 899.55 s [vector] include primitive-0.9.1.0-IzoEy6gcvXy7FAbkwCq547
  4598. 899.55 s [vector] include random-1.2.1.3-EBsIWSQBdMjJ1kHbvwBdg2
  4599. 899.55 s [vector] include tasty-1.5.3-JmKTCIqeCnz2cfDkXVBEQb
  4600. 899.55 s [vector] include tasty-hunit-0.10.2-BKEPVyyDdHQLqQfkhUYBIs
  4601. 899.55 s [vector] include tasty-quickcheck-0.11.1-I2kaBODHeTY9Cl9vsHe7
  4602. 899.55 s [vector] include template-haskell-2.19.0.0
  4603. 899.55 s [vector] include transformers-0.5.6.2
  4604. 899.55 s [vector] include vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf
  4605. 899.55 s [vector] Ready component graph:
  4606. 899.55 s [vector] definite vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf
  4607. 899.55 s [vector] depends base-4.17.2.1
  4608. 899.55 s [vector] depends deepseq-1.4.8.0
  4609. 899.55 s [vector] depends primitive-0.9.1.0-IzoEy6gcvXy7FAbkwCq547
  4610. 899.55 s [vector] depends vector-stream-0.1.0.1-F03bfhC0HhqL26lQDSs4vb
  4611. 899.55 s [vector] definite vector-0.13.2.0-BrHxLv2KUPv5Fn8v7eQoOx-vector-doctest
  4612. 899.55 s [vector] depends base-4.17.2.1
  4613. 899.55 s [vector] depends doctest-0.24.2-I8Dj1Qj4flA6uA6Qf1gy88
  4614. 899.55 s [vector] depends primitive-0.9.1.0-IzoEy6gcvXy7FAbkwCq547
  4615. 899.55 s [vector] depends vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf
  4616. 899.55 s [vector] definite vector-0.13.2.0-Buajc9dwOtY17MYNPDdyiX-benchmarks-O2
  4617. 899.55 s [vector] depends base-4.17.2.1
  4618. 899.55 s [vector] depends random-1.2.1.3-EBsIWSQBdMjJ1kHbvwBdg2
  4619. 899.55 s [vector] depends tasty-1.5.3-JmKTCIqeCnz2cfDkXVBEQb
  4620. 899.55 s [vector] depends vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf
  4621. 899.55 s [vector] definite vector-0.13.2.0-HRM4UhWJxA9CssEeWd3cIj-vector-tests-O0
  4622. 899.55 s [vector] depends QuickCheck-2.15.0.1-H9C4qdCN40J1jJ9nkbU8lt
  4623. 899.55 s [vector] depends base-4.17.2.1
  4624. 899.55 s [vector] depends base-orphans-0.9.3-BnQ7VdntHVR2bPjqU1A3eC
  4625. 899.55 s [vector] depends primitive-0.9.1.0-IzoEy6gcvXy7FAbkwCq547
  4626. 899.55 s [vector] depends random-1.2.1.3-EBsIWSQBdMjJ1kHbvwBdg2
  4627. 899.55 s [vector] depends tasty-1.5.3-JmKTCIqeCnz2cfDkXVBEQb
  4628. 899.55 s [vector] depends tasty-hunit-0.10.2-BKEPVyyDdHQLqQfkhUYBIs
  4629. 899.55 s [vector] depends tasty-quickcheck-0.11.1-I2kaBODHeTY9Cl9vsHe7
  4630. 899.55 s [vector] depends template-haskell-2.19.0.0
  4631. 899.55 s [vector] depends transformers-0.5.6.2
  4632. 899.55 s [vector] depends vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf
  4633. 899.55 s [vector] definite vector-0.13.2.0-HvmzB5mUEm43fHZBv42gz1-vector-tests-O2
  4634. 899.55 s [vector] depends QuickCheck-2.15.0.1-H9C4qdCN40J1jJ9nkbU8lt
  4635. 899.55 s [vector] depends base-4.17.2.1
  4636. 899.55 s [vector] depends base-orphans-0.9.3-BnQ7VdntHVR2bPjqU1A3eC
  4637. 899.55 s [vector] depends primitive-0.9.1.0-IzoEy6gcvXy7FAbkwCq547
  4638. 899.55 s [vector] depends random-1.2.1.3-EBsIWSQBdMjJ1kHbvwBdg2
  4639. 899.56 s [vector] depends tasty-1.5.3-JmKTCIqeCnz2cfDkXVBEQb
  4640. 899.56 s [vector] depends tasty-hunit-0.10.2-BKEPVyyDdHQLqQfkhUYBIs
  4641. 899.56 s [vector] depends tasty-quickcheck-0.11.1-I2kaBODHeTY9Cl9vsHe7
  4642. 899.56 s [vector] depends template-haskell-2.19.0.0
  4643. 899.56 s [vector] depends transformers-0.5.6.2
  4644. 899.56 s [vector] depends vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf
  4645. 899.56 s [vector] definite vector-0.13.2.0-5Q4kMcUxhdwEKrCweElQP4-vector-inspection
  4646. 899.56 s [vector] depends base-4.17.2.1
  4647. 899.56 s [vector] depends primitive-0.9.1.0-IzoEy6gcvXy7FAbkwCq547
  4648. 899.56 s [vector] depends tasty-1.5.3-JmKTCIqeCnz2cfDkXVBEQb
  4649. 899.56 s [vector] depends tasty-inspection-testing-0.2.1-48CUMaIHGWv8RqzO1O1dns
  4650. 899.56 s [vector] depends vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf
  4651. 899.56 s [vector] Using Cabal-3.8.1.0 compiled by ghc-9.4
  4652. 899.56 s [vector] Using compiler: ghc-9.4.8
  4653. 899.56 s [vector] Using install prefix:
  4654. 899.56 s [vector] /nix/store/zwx2a4ffc7zak6cbip0l9cgpmig6ncvd-vector-0.13.2.0
  4655. 899.56 s [vector] Executables installed in:
  4656. 899.56 s [vector] /nix/store/zwx2a4ffc7zak6cbip0l9cgpmig6ncvd-vector-0.13.2.0/bin
  4657. 899.56 s [vector] Libraries installed in:
  4658. 899.56 s [vector] /nix/store/zwx2a4ffc7zak6cbip0l9cgpmig6ncvd-vector-0.13.2.0/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf
  4659. 899.56 s [vector] Dynamic Libraries installed in:
  4660. 899.56 s [vector] /nix/store/zwx2a4ffc7zak6cbip0l9cgpmig6ncvd-vector-0.13.2.0/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8
  4661. 899.56 s [vector] Private executables installed in:
  4662. 899.56 s [vector] /nix/store/zwx2a4ffc7zak6cbip0l9cgpmig6ncvd-vector-0.13.2.0/libexec/x86_64-linux-ghc-9.4.8/vector-0.13.2.0
  4663. 899.56 s [vector] Data files installed in:
  4664. 899.56 s [vector] /nix/store/zwx2a4ffc7zak6cbip0l9cgpmig6ncvd-vector-0.13.2.0/share/x86_64-linux-ghc-9.4.8/vector-0.13.2.0
  4665. 899.56 s [vector] Documentation installed in:
  4666. 899.56 s [vector] /nix/store/zwx2a4ffc7zak6cbip0l9cgpmig6ncvd-vector-0.13.2.0/share/doc/x86_64-linux-ghc-9.4.8/vector-0.13.2.0
  4667. 899.56 s [vector] Configuration files installed in:
  4668. 899.56 s [vector] /nix/store/zwx2a4ffc7zak6cbip0l9cgpmig6ncvd-vector-0.13.2.0/etc
  4669. 899.56 s [vector] No alex found
  4670. 899.56 s [vector] Using ar found on system at:
  4671. 899.56 s [vector] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  4672. 899.56 s [vector] No c2hs found
  4673. 899.56 s [vector] No cpphs found
  4674. 899.56 s [vector] Using doctest version 0.24.2 found on system at:
  4675. 899.56 s [vector] /nix/store/jbbd7dp036y9l3jv36q5ffbsn5s78wcn-doctest-0.24.2/bin/doctest
  4676. 899.56 s [vector] Using gcc version 14.3.0 given by user at:
  4677. 899.56 s [vector] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  4678. 899.56 s [vector] Using ghc version 9.4.8 found on system at:
  4679. 899.56 s [vector] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/ghc
  4680. 899.56 s [vector] Using ghc-pkg version 9.4.8 found on system at:
  4681. 899.56 s [vector] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/ghc-pkg-9.4.8
  4682. 899.56 s [vector] No ghcjs found
  4683. 899.56 s [vector] No ghcjs-pkg found
  4684. 899.56 s [vector] No greencard found
  4685. 899.56 s [vector] Using haddock version 2.27.0 found on system at:
  4686. 899.56 s [vector] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/haddock-ghc-9.4.8
  4687. 899.56 s [vector] No happy found
  4688. 899.56 s [vector] Using haskell-suite found on system at: haskell-suite-dummy-location
  4689. 899.56 s [vector] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  4690. 899.56 s [vector] No hmake found
  4691. 899.56 s [vector] Using hpc version 0.68 found on system at:
  4692. 899.56 s [vector] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/hpc
  4693. 899.56 s [vector] Using hsc2hs version 0.68.8 found on system at:
  4694. 899.56 s [vector] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/hsc2hs
  4695. 899.56 s [vector] Using hscolour version 1.25 found on system at:
  4696. 899.56 s [vector] /nix/store/87hdxxa93g58b2w9ylr2idn2a40i3fdc-hscolour-1.25/bin/HsColour
  4697. 899.56 s [vector] No jhc found
  4698. 899.56 s [vector] Using ld found on system at:
  4699. 899.56 s [vector] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ld.gold
  4700. 899.56 s [vector] No pkg-config found
  4701. 899.56 s [vector] Using runghc version 9.4.8 found on system at:
  4702. 899.56 s [vector] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/runghc-9.4.8
  4703. 899.56 s [vector] Using strip version 2.44 found on system at:
  4704. 899.56 s [vector] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  4705. 899.56 s [vector] Using tar found on system at:
  4706. 899.56 s [vector] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  4707. 899.56 s [vector] No uhc found
  4708. 899.58 s [vector] Phase: buildPhase
  4709. 899.79 s [vector] Preprocessing library for vector-0.13.2.0..
  4710. 899.82 s [vector] Building library for vector-0.13.2.0..
  4711. 899.92 s [duoids] Phase: buildPhase
  4712. 900.11 s [duoids] Preprocessing library for duoids-0.0.1.0...
  4713. 900.11 s [duoids] Building library for duoids-0.0.1.0...
  4714. 900.43 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 )
  4715. 901.55 s [duoids] [2 of 6] Compiling Data.Duoid ( src/Data/Duoid.hs, dist/build/Data/Duoid.o, dist/build/Data/Duoid.dyn_o )
  4716. 901.79 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 )
  4717. 902.01 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 )
  4718. 902.02 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 )
  4719. 902.56 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 )
  4720. 902.56 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 )
  4721. 902.56 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 )
  4722. 902.56 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 )
  4723. 904.71 s [duoids] [3 of 6] Compiling Control.Duoidal ( src/Control/Duoidal.hs, dist/build/Control/Duoidal.o, dist/build/Control/Duoidal.dyn_o )
  4724. 909.37 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 )
  4725. 909.45 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 )
  4726. 909.45 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 )
  4727. 910.19 s [duoids] [1 of 6] Compiling Control.Duoidal.Async ( src/Control/Duoidal/Async.hs, dist/build/Control/Duoidal/Async.p_o )
  4728. 911.39 s [duoids] [2 of 6] Compiling Data.Duoid ( src/Data/Duoid.hs, dist/build/Data/Duoid.p_o )
  4729. 915.14 s [duoids] [3 of 6] Compiling Control.Duoidal ( src/Control/Duoidal.hs, dist/build/Control/Duoidal.p_o )
  4730. 916.62 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 )
  4731. 919.99 s [duoids] [4 of 6] Compiling Control.Duoidal.Either ( src/Control/Duoidal/Either.hs, dist/build/Control/Duoidal/Either.p_o )
  4732. 920.82 s [duoids] [5 of 6] Compiling Data.Duoid.Laws ( src/Data/Duoid/Laws.hs, dist/build/Data/Duoid/Laws.p_o )
  4733. 920.82 s [duoids] [6 of 6] Compiling Control.Duoidal.Laws ( src/Control/Duoidal/Laws.hs, dist/build/Control/Duoidal/Laws.p_o )
  4734. 924.05 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 )
  4735. 926.54 s [duoids] Preprocessing test suite 'doctests' for duoids-0.0.1.0...
  4736. 926.54 s [duoids] Building test suite 'doctests' for duoids-0.0.1.0...
  4737. 926.78 s [duoids] [1 of 2] Compiling Build_doctests ( dist/build/doctests/autogen/Build_doctests.hs, dist/build/doctests/doctests-tmp/Build_doctests.o )
  4738. 927.66 s [duoids] [2 of 2] Compiling Main ( tests/doctests.hs, dist/build/doctests/doctests-tmp/Main.o )
  4739. 928.86 s [duoids] [3 of 3] Linking dist/build/doctests/doctests
  4740. 929.61 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 )
  4741. 930.63 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 )
  4742. 932.51 s [duoids] buildPhase completed in 33 seconds
  4743. 932.51 s [duoids] Phase: checkPhase
  4744. 932.90 s [duoids] Running 1 test suites...
  4745. 932.90 s [duoids] Test suite doctests: RUNNING...
  4746. 933.62 s [duoids]
  4747. 933.62 s [duoids] on the commandline: warning:
  4748. 933.62 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  4749. 933.62 s [duoids]
  4750. 933.62 s [duoids] on the commandline: warning:
  4751. 933.62 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  4752. 933.62 s [duoids]
  4753. 933.62 s [duoids] on the commandline: warning:
  4754. 933.62 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  4755. 933.62 s [duoids]
  4756. 933.62 s [duoids] on the commandline: warning:
  4757. 933.62 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  4758. 933.62 s [duoids]
  4759. 933.62 s [duoids] on the commandline: warning:
  4760. 933.62 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  4761. 933.62 s [duoids]
  4762. 933.62 s [duoids] on the commandline: warning:
  4763. 933.62 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  4764. 933.63 s [duoids]
  4765. 933.63 s [duoids] on the commandline: warning:
  4766. 933.63 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  4767. 933.63 s [duoids]
  4768. 933.63 s [duoids] on the commandline: warning:
  4769. 933.63 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  4770. 933.63 s [duoids]
  4771. 933.63 s [duoids] on the commandline: warning:
  4772. 933.63 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  4773. 933.63 s [duoids]
  4774. 933.63 s [duoids] on the commandline: warning:
  4775. 933.63 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  4776. 936.21 s [duoids] Examples: 5 Tried: 5 Errors: 0 Failures: 0
  4777. 936.32 s [duoids] NameLib Nothing
  4778. 936.32 s [duoids] ----------------------------------------
  4779. 936.36 s [duoids] Test suite doctests: PASS
  4780. 936.36 s [duoids] Test suite logged to: dist/test/duoids-0.0.1.0-doctests.log
  4781. 936.36 s [duoids] 1 of 1 test suites (1 of 1 test cases) passed.
  4782. 936.38 s [duoids] Phase: haddockPhase
  4783. 936.73 s [duoids] Preprocessing library for duoids-0.0.1.0...
  4784. 936.73 s [duoids] Running Haddock on library for duoids-0.0.1.0...
  4785. 937.87 s [duoids] Warning: 'cancel' is out of scope.
  4786. 937.87 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  4787. 937.87 s [duoids] Warning: 'Applicative' is out of scope.
  4788. 937.88 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  4789. 937.88 s [duoids] Warning: 'Alternative' is out of scope.
  4790. 937.88 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  4791. 938.73 s [duoids] 100% ( 10 / 10) in 'Data.Duoid'
  4792. 939.89 s [duoids] Warning: 'ExceptT' is out of scope.
  4793. 939.89 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  4794. 939.90 s [duoids] Warning: 'NoDefaultPrelude' is out of scope.
  4795. 939.90 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  4796. 939.90 s [duoids] Warning: 'Validation' is out of scope.
  4797. 939.90 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  4798. 939.90 s [duoids] Warning: 'fail' is out of scope.
  4799. 939.90 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  4800. 939.90 s [duoids] Warning: 'MonadFail' is out of scope.
  4801. 939.90 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  4802. 939.90 s [duoids] Warning: 'Writer' is out of scope.
  4803. 939.90 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  4804. 939.90 s [duoids] Warning: 'Set' is out of scope.
  4805. 939.90 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  4806. 939.90 s [duoids] Warning: 'Char' is out of scope.
  4807. 939.90 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  4808. 939.90 s [duoids] 100% ( 60 / 60) in 'Control.Duoidal'
  4809. 940.59 s [duoids] 100% ( 2 / 2) in 'Control.Duoidal.Either'
  4810. 940.63 s [duoids] Warning: 'Normal' is out of scope.
  4811. 940.63 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  4812. 940.63 s [duoids] 100% ( 12 / 12) in 'Data.Duoid.Laws'
  4813. 940.67 s [duoids] 100% ( 6 / 6) in 'Control.Duoidal.Laws'
  4814. 947.47 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 )
  4815. 947.48 s [vector] [13 of 23] Compiling Data.Vector ( src/Data/Vector.hs, dist/build/Data/Vector.o, dist/build/Data/Vector.dyn_o )
  4816. 955.01 s [duoids] Documentation created: dist/doc/html/duoids/, dist/doc/html/duoids/duoids.txt
  4817. 955.14 s [duoids] Preprocessing test suite 'doctests' for duoids-0.0.1.0...
  4818. 955.17 s [duoids] Phase: installPhase
  4819. 955.34 s [duoids] Installing library in /nix/store/sbjyg7prrvz721rvkkyhsrjmwwr13jap-duoids-0.0.1.0/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/duoids-0.0.1.0-7Tv3jMouVtXFOM5hnlF6gw
  4820. 956.45 s [duoids] Phase: fixupPhase
  4821. 956.53 s [duoids] shrinking RPATHs of ELF executables and libraries in /nix/store/sbjyg7prrvz721rvkkyhsrjmwwr13jap-duoids-0.0.1.0
  4822. 956.54 s [duoids] shrinking /nix/store/sbjyg7prrvz721rvkkyhsrjmwwr13jap-duoids-0.0.1.0/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/libHSduoids-0.0.1.0-7Tv3jMouVtXFOM5hnlF6gw-ghc9.4.8.so
  4823. 956.56 s [duoids] checking for references to /build/ in /nix/store/sbjyg7prrvz721rvkkyhsrjmwwr13jap-duoids-0.0.1.0...
  4824. 956.62 s [duoids] patching script interpreter paths in /nix/store/sbjyg7prrvz721rvkkyhsrjmwwr13jap-duoids-0.0.1.0
  4825. 956.63 s [duoids] stripping (with command strip and flags -S -p) in /nix/store/sbjyg7prrvz721rvkkyhsrjmwwr13jap-duoids-0.0.1.0/lib
  4826. 956.97 s [duoids] shrinking RPATHs of ELF executables and libraries in /nix/store/9fkmq4jhvhdmmsyc5j3fgyqp19jc1xcs-duoids-0.0.1.0-doc
  4827. 956.98 s [duoids] checking for references to /build/ in /nix/store/9fkmq4jhvhdmmsyc5j3fgyqp19jc1xcs-duoids-0.0.1.0-doc...
  4828. 957.03 s [duoids] patching script interpreter paths in /nix/store/9fkmq4jhvhdmmsyc5j3fgyqp19jc1xcs-duoids-0.0.1.0-doc
  4829. 957.33 s [duoids:post-build] Uploading to cachix cache "sellout": /nix/store/9fkmq4jhvhdmmsyc5j3fgyqp19jc1xcs-duoids-0.0.1.0-doc /nix/store/sbjyg7prrvz721rvkkyhsrjmwwr13jap-duoids-0.0.1.0
  4830. 958.51 s [duoids:post-build] Pushing 2 paths (39 are already present) using zstd to cache sellout ⏳
  4831. 958.51 s [duoids:post-build]
  4832. 959.01 s [duoids:post-build] Pushing /nix/store/9fkmq4jhvhdmmsyc5j3fgyqp19jc1xcs-duoids-0.0.1.0-doc (2.43 MiB)
  4833. 959.45 s [duoids:post-build] Pushing /nix/store/sbjyg7prrvz721rvkkyhsrjmwwr13jap-duoids-0.0.1.0 (8.28 MiB)
  4834. 960.96 s [duoids:post-build]
  4835. 960.96 s [duoids:post-build] All done.
  4836. 961.04 s [duoids:post-build] Uploading to the NixCI cache: /nix/store/9fkmq4jhvhdmmsyc5j3fgyqp19jc1xcs-duoids-0.0.1.0-doc /nix/store/sbjyg7prrvz721rvkkyhsrjmwwr13jap-duoids-0.0.1.0
  4837. 961.11 s [duoids:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  4838. 961.22 s [duoids:post-build] copying 2 paths...
  4839. 961.22 s [duoids:post-build] copying path '/nix/store/9fkmq4jhvhdmmsyc5j3fgyqp19jc1xcs-duoids-0.0.1.0-doc' to 'https://cache.nix-ci.com'...
  4840. 961.86 s [duoids:post-build] copying path '/nix/store/sbjyg7prrvz721rvkkyhsrjmwwr13jap-duoids-0.0.1.0' to 'https://cache.nix-ci.com'...
  4841. 965.71 s [duoids:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  4842. 966.08 s [duoids:post-build] copying 1 paths...
  4843. 966.09 s [duoids:post-build] copying path '/nix/store/j360g18grw99wqxp9ixv7pqay6yxdhkr-duoids-0.0.1.0.drv' to 'https://cache.nix-ci.com'...
  4844. 966.37 s Progress: 6 of 22 built (1 building), 161 of 161 downloaded from cache
  4845. 966.47 s Building /nix/store/3mmddg0as7zv1x9jqnpa7gx826vzwryi-duoidal-transformers-0.0.1.0.drv
  4846. 966.57 s Building /nix/store/b3wadv5r1llmx3d714jk31ihka9zvw1i-duoids-hedgehog-0.0.1.0.drv
  4847. 966.64 s [duoidal-transformers] Phase: setupCompilerEnvironmentPhase
  4848. 966.65 s [duoidal-transformers] Build with /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8.
  4849. 966.87 s [duoids-hedgehog] Phase: setupCompilerEnvironmentPhase
  4850. 966.88 s [duoids-hedgehog] Build with /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8.
  4851. 967.08 s [duoidal-transformers] Phase: unpackPhase
  4852. 967.09 s [duoidal-transformers] unpacking source archive /nix/store/j3nhvvhbp8d5l29mqdaf8f513lxyga6r-z8smrhvl4j2a1x1vb5nv502a87a6wsx7-source/./transformers
  4853. 967.14 s [duoidal-transformers] source root is transformers
  4854. 967.17 s [duoidal-transformers] Phase: patchPhase
  4855. 967.21 s [duoidal-transformers] Phase: compileBuildDriverPhase
  4856. 967.22 s [duoidal-transformers] setupCompileFlags: -package-db=/build/tmp.hG3rbxnCsK/setup-package.conf.d -threaded
  4857. 967.36 s [duoidal-transformers] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.hG3rbxnCsK/Main.o )
  4858. 967.47 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 )
  4859. 967.47 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 )
  4860. 967.47 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 )
  4861. 967.47 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 )
  4862. 967.47 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 )
  4863. 967.47 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 )
  4864. 967.47 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 )
  4865. 967.48 s [duoids-hedgehog] Phase: unpackPhase
  4866. 967.48 s [duoidal-transformers] [2 of 2] Linking Setup
  4867. 967.49 s [duoids-hedgehog] unpacking source archive /nix/store/j3nhvvhbp8d5l29mqdaf8f513lxyga6r-z8smrhvl4j2a1x1vb5nv502a87a6wsx7-source/./hedgehog
  4868. 967.51 s [duoids-hedgehog] source root is hedgehog
  4869. 967.53 s [duoids-hedgehog] Phase: patchPhase
  4870. 967.54 s [duoids-hedgehog] Phase: compileBuildDriverPhase
  4871. 967.55 s [duoids-hedgehog] setupCompileFlags: -package-db=/build/tmp.BJM16ghD29/setup-package.conf.d -threaded
  4872. 967.69 s [duoids-hedgehog] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.BJM16ghD29/Main.o )
  4873. 967.94 s [duoids-hedgehog] [2 of 2] Linking Setup
  4874. 970.07 s [duoidal-transformers] Phase: updateAutotoolsGnuConfigScriptsPhase
  4875. 970.09 s [duoidal-transformers] Phase: configurePhase
  4876. 970.09 s [duoidal-transformers] configureFlags: --verbose --prefix=/nix/store/jvs2x0lbr3np33x2nb3k7r7qdirwmrd6-duoidal-transformers-0.0.1.0 --libdir=$prefix/lib/$compiler --libsubdir=$abi/$libname --docdir=/nix/store/z4hjjf6gawip8vpz9sai74dba7321an8-duoidal-transformers-0.0.1.0-doc/share/doc/duoidal-transformers-0.0.1.0 --with-gcc=gcc --package-db=/build/tmp.hG3rbxnCsK/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --ghc-options=-Werror --extra-lib-dirs=/nix/store/ffyzkisqs4vc4mg28bwwlyqjf8i9ph6b-ncurses-6.5/lib --extra-lib-dirs=/nix/store/n28qgdj8c1q41kf7n4y1jxa6ckp85m3c-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/hi0ar880110k6jsmmili7dh1gq3cg2a9-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/g09cflpnp4g80q56sj9dng1qzv4v4ybc-numactl-2.0.18/lib --extra-lib-dirs=/nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/lib
  4877. 970.12 s [duoidal-transformers] Using Parsec parser
  4878. 970.12 s [duoidal-transformers] Configuring duoidal-transformers-0.0.1.0...
  4879. 970.44 s [duoids-hedgehog] Phase: updateAutotoolsGnuConfigScriptsPhase
  4880. 970.47 s [duoids-hedgehog] Phase: configurePhase
  4881. 970.49 s [duoids-hedgehog] configureFlags: --verbose --prefix=/nix/store/wwl2nv34m1jxv0i13ilwqhcxnkr7rzrw-duoids-hedgehog-0.0.1.0 --libdir=$prefix/lib/$compiler --libsubdir=$abi/$libname --docdir=/nix/store/zsiqggg4ifvk2jliqlfdqdp7va4k7mvq-duoids-hedgehog-0.0.1.0-doc/share/doc/duoids-hedgehog-0.0.1.0 --with-gcc=gcc --package-db=/build/tmp.BJM16ghD29/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --ghc-options=-Werror --extra-lib-dirs=/nix/store/ffyzkisqs4vc4mg28bwwlyqjf8i9ph6b-ncurses-6.5/lib --extra-lib-dirs=/nix/store/n28qgdj8c1q41kf7n4y1jxa6ckp85m3c-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/hi0ar880110k6jsmmili7dh1gq3cg2a9-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/g09cflpnp4g80q56sj9dng1qzv4v4ybc-numactl-2.0.18/lib --extra-lib-dirs=/nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/lib
  4882. 970.52 s [duoids-hedgehog] Using Parsec parser
  4883. 970.52 s [duoids-hedgehog] Configuring duoids-hedgehog-0.0.1.0...
  4884. 970.85 s [duoidal-transformers] Flags chosen: lint=False, noisy-deprecations=True
  4885. 971.31 s [duoids-hedgehog] Flags chosen: lint=False, noisy-deprecations=True
  4886. 971.69 s [duoidal-transformers] Dependency base >=4.16.0 && <4.17 || >=4.17.0 && <4.18 || >=4.18.0 && <4.19 ||
  4887. 971.71 s [duoidal-transformers] >=4.19.0 && <4.20 || >=4.20.0 && <4.21 || >=4.21.0 && <4.22 || >=4.22.0 &&
  4888. 971.71 s [duoidal-transformers] <4.23: using base-4.17.2.1
  4889. 971.71 s [duoidal-transformers] Dependency duoids >=0.0.1 && <0.1: using duoids-0.0.1.0
  4890. 971.71 s [duoidal-transformers] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  4891. 971.71 s [duoidal-transformers] Dependency transformers >=0.5.6 && <0.6 || >=0.6.1 && <0.7: using
  4892. 971.71 s [duoidal-transformers] transformers-0.5.6.2
  4893. 971.71 s [duoidal-transformers] Dependency base >=4.16.0 && <4.17 || >=4.17.0 && <4.18 || >=4.18.0 && <4.19 ||
  4894. 971.71 s [duoidal-transformers] >=4.19.0 && <4.20 || >=4.20.0 && <4.21 || >=4.21.0 && <4.22 || >=4.22.0 &&
  4895. 971.71 s [duoidal-transformers] <4.23: using base-4.17.2.1
  4896. 971.71 s [duoidal-transformers] Dependency doctest >=0.18.2 && <0.19 || >=0.20.1 && <0.21 || >=0.21.1 && <0.22
  4897. 971.71 s [duoidal-transformers] || >=0.22.6 && <0.23 || >=0.24.0 && <0.25 || >=0.25.0 && <0.26: using
  4898. 971.71 s [duoidal-transformers] doctest-0.24.2
  4899. 971.71 s [duoidal-transformers] Dependency duoidal-transformers: using duoidal-transformers-0.0.1.0
  4900. 971.71 s [duoidal-transformers] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  4901. 971.71 s [duoidal-transformers] Source component graph:
  4902. 971.71 s [duoidal-transformers] component lib
  4903. 971.71 s [duoidal-transformers] component test:doctests dependency lib
  4904. 971.71 s [duoidal-transformers] Configured component graph:
  4905. 971.71 s [duoidal-transformers] component duoidal-transformers-0.0.1.0-Ls4zbd6q0AcIZMkgnCzXIs
  4906. 971.71 s [duoidal-transformers] include base-4.17.2.1
  4907. 971.71 s [duoidal-transformers] include duoids-0.0.1.0-7Tv3jMouVtXFOM5hnlF6gw
  4908. 971.71 s [duoidal-transformers] include ghc-compat-plugin-0.1.0.1-EF6fkbvBW8o6hs1RRExbcG
  4909. 971.71 s [duoidal-transformers] include transformers-0.5.6.2
  4910. 971.71 s [duoidal-transformers] component duoidal-transformers-0.0.1.0-JWSh9Im2QnVLjGYmRTptN2-doctests
  4911. 971.71 s [duoidal-transformers] include base-4.17.2.1
  4912. 971.71 s [duoidal-transformers] include doctest-0.24.2-I8Dj1Qj4flA6uA6Qf1gy88
  4913. 971.71 s [duoidal-transformers] include duoidal-transformers-0.0.1.0-Ls4zbd6q0AcIZMkgnCzXIs
  4914. 971.71 s [duoidal-transformers] include ghc-compat-plugin-0.1.0.1-EF6fkbvBW8o6hs1RRExbcG
  4915. 971.71 s [duoidal-transformers] Linked component graph:
  4916. 971.71 s [duoidal-transformers] unit duoidal-transformers-0.0.1.0-Ls4zbd6q0AcIZMkgnCzXIs
  4917. 971.71 s [duoidal-transformers] include base-4.17.2.1
  4918. 971.71 s [duoidal-transformers] include duoids-0.0.1.0-7Tv3jMouVtXFOM5hnlF6gw
  4919. 971.71 s [duoidal-transformers] include ghc-compat-plugin-0.1.0.1-EF6fkbvBW8o6hs1RRExbcG
  4920. 971.71 s [duoidal-transformers] include transformers-0.5.6.2
  4921. 971.71 s [duoidal-transformers] Control.Duoidal.Trans.Class=duoidal-transformers-0.0.1.0-Ls4zbd6q0AcIZMkgnCzXIs:Control.Duoidal.Trans.Class,Control.Duoidal.Trans.Orphans=duoidal-transformers-0.0.1.0-Ls4zbd6q0AcIZMkgnCzXIs:Control.Duoidal.Trans.Orphans
  4922. 971.71 s [duoidal-transformers] unit duoidal-transformers-0.0.1.0-JWSh9Im2QnVLjGYmRTptN2-doctests
  4923. 971.71 s [duoidal-transformers] include base-4.17.2.1
  4924. 971.71 s [duoidal-transformers] include doctest-0.24.2-I8Dj1Qj4flA6uA6Qf1gy88
  4925. 971.71 s [duoidal-transformers] include duoidal-transformers-0.0.1.0-Ls4zbd6q0AcIZMkgnCzXIs
  4926. 971.71 s [duoidal-transformers] include ghc-compat-plugin-0.1.0.1-EF6fkbvBW8o6hs1RRExbcG
  4927. 971.71 s [duoidal-transformers] Ready component graph:
  4928. 971.71 s [duoidal-transformers] definite duoidal-transformers-0.0.1.0-Ls4zbd6q0AcIZMkgnCzXIs
  4929. 971.72 s [duoidal-transformers] depends base-4.17.2.1
  4930. 971.72 s [duoidal-transformers] depends duoids-0.0.1.0-7Tv3jMouVtXFOM5hnlF6gw
  4931. 971.72 s [duoidal-transformers] depends ghc-compat-plugin-0.1.0.1-EF6fkbvBW8o6hs1RRExbcG
  4932. 971.72 s [duoidal-transformers] depends transformers-0.5.6.2
  4933. 971.72 s [duoidal-transformers] definite duoidal-transformers-0.0.1.0-JWSh9Im2QnVLjGYmRTptN2-doctests
  4934. 971.72 s [duoidal-transformers] depends base-4.17.2.1
  4935. 971.72 s [duoidal-transformers] depends doctest-0.24.2-I8Dj1Qj4flA6uA6Qf1gy88
  4936. 971.72 s [duoidal-transformers] depends duoidal-transformers-0.0.1.0-Ls4zbd6q0AcIZMkgnCzXIs
  4937. 971.72 s [duoidal-transformers] depends ghc-compat-plugin-0.1.0.1-EF6fkbvBW8o6hs1RRExbcG
  4938. 971.72 s [duoidal-transformers] Using Cabal-3.12.1.0 compiled by ghc-9.4
  4939. 971.72 s [duoidal-transformers] Using compiler: ghc-9.4.8
  4940. 971.72 s [duoidal-transformers] Using install prefix:
  4941. 971.72 s [duoidal-transformers] /nix/store/jvs2x0lbr3np33x2nb3k7r7qdirwmrd6-duoidal-transformers-0.0.1.0
  4942. 971.72 s [duoidal-transformers] Executables installed in:
  4943. 971.72 s [duoidal-transformers] /nix/store/jvs2x0lbr3np33x2nb3k7r7qdirwmrd6-duoidal-transformers-0.0.1.0/bin
  4944. 971.72 s [duoidal-transformers] Libraries installed in:
  4945. 971.72 s [duoidal-transformers] /nix/store/jvs2x0lbr3np33x2nb3k7r7qdirwmrd6-duoidal-transformers-0.0.1.0/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/duoidal-transformers-0.0.1.0-Ls4zbd6q0AcIZMkgnCzXIs
  4946. 971.72 s [duoidal-transformers] Dynamic Libraries installed in:
  4947. 971.72 s [duoidal-transformers] /nix/store/jvs2x0lbr3np33x2nb3k7r7qdirwmrd6-duoidal-transformers-0.0.1.0/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8
  4948. 971.72 s [duoidal-transformers] Private executables installed in:
  4949. 971.72 s [duoidal-transformers] /nix/store/jvs2x0lbr3np33x2nb3k7r7qdirwmrd6-duoidal-transformers-0.0.1.0/libexec/x86_64-linux-ghc-9.4.8/duoidal-transformers-0.0.1.0
  4950. 971.72 s [duoidal-transformers] Data files installed in:
  4951. 971.72 s [duoidal-transformers] /nix/store/jvs2x0lbr3np33x2nb3k7r7qdirwmrd6-duoidal-transformers-0.0.1.0/share/x86_64-linux-ghc-9.4.8/duoidal-transformers-0.0.1.0
  4952. 971.72 s [duoidal-transformers] Documentation installed in:
  4953. 971.72 s [duoidal-transformers] /nix/store/z4hjjf6gawip8vpz9sai74dba7321an8-duoidal-transformers-0.0.1.0-doc/share/doc/duoidal-transformers-0.0.1.0
  4954. 971.72 s [duoidal-transformers] Configuration files installed in:
  4955. 971.72 s [duoidal-transformers] /nix/store/jvs2x0lbr3np33x2nb3k7r7qdirwmrd6-duoidal-transformers-0.0.1.0/etc
  4956. 971.72 s [duoidal-transformers] No alex found
  4957. 971.72 s [duoidal-transformers] Using ar found on system at:
  4958. 971.72 s [duoidal-transformers] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  4959. 971.72 s [duoidal-transformers] No c2hs found
  4960. 971.72 s [duoidal-transformers] No cpphs found
  4961. 971.72 s [duoidal-transformers] Using doctest version 0.24.2 found on system at:
  4962. 971.72 s [duoidal-transformers] /nix/store/jbbd7dp036y9l3jv36q5ffbsn5s78wcn-doctest-0.24.2/bin/doctest
  4963. 971.72 s [duoidal-transformers] Using gcc version 14.3.0 given by user at:
  4964. 971.72 s [duoidal-transformers] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  4965. 971.72 s [duoidal-transformers] Using ghc version 9.4.8 found on system at:
  4966. 971.72 s [duoidal-transformers] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/ghc
  4967. 971.72 s [duoidal-transformers] Using ghc-pkg version 9.4.8 found on system at:
  4968. 971.72 s [duoidal-transformers] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/ghc-pkg-9.4.8
  4969. 971.72 s [duoidal-transformers] No ghcjs found
  4970. 971.72 s [duoidal-transformers] No ghcjs-pkg found
  4971. 971.72 s [duoidal-transformers] No greencard found
  4972. 971.72 s [duoidal-transformers] Using haddock version 2.27.0 found on system at:
  4973. 971.72 s [duoidal-transformers] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/haddock-ghc-9.4.8
  4974. 971.72 s [duoidal-transformers] No happy found
  4975. 971.72 s [duoidal-transformers] Using haskell-suite found on system at: haskell-suite-dummy-location
  4976. 971.72 s [duoidal-transformers] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  4977. 971.73 s [duoidal-transformers] No hmake found
  4978. 971.73 s [duoidal-transformers] Using hpc version 0.68 found on system at:
  4979. 971.73 s [duoidal-transformers] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/hpc
  4980. 971.73 s [duoidal-transformers] Using hsc2hs version 0.68.8 found on system at:
  4981. 971.73 s [duoidal-transformers] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/hsc2hs
  4982. 971.73 s [duoidal-transformers] Using hscolour version 1.25 found on system at:
  4983. 971.73 s [duoidal-transformers] /nix/store/87hdxxa93g58b2w9ylr2idn2a40i3fdc-hscolour-1.25/bin/HsColour
  4984. 971.73 s [duoidal-transformers] No jhc found
  4985. 971.73 s [duoidal-transformers] Using ld found on system at:
  4986. 971.73 s [duoidal-transformers] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ld.gold
  4987. 971.73 s [duoidal-transformers] No pkg-config found
  4988. 971.73 s [duoidal-transformers] Using runghc version 9.4.8 found on system at:
  4989. 971.73 s [duoidal-transformers] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/runghc-9.4.8
  4990. 971.73 s [duoidal-transformers] Using strip version 2.44 found on system at:
  4991. 971.73 s [duoidal-transformers] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  4992. 971.73 s [duoidal-transformers] Using tar found on system at:
  4993. 971.73 s [duoidal-transformers] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  4994. 971.73 s [duoidal-transformers] No uhc found
  4995. 972.03 s [duoids-hedgehog] Dependency base >=4.16.0 && <4.17 || >=4.17.0 && <4.18 || >=4.18.0 && <4.19 ||
  4996. 972.03 s [duoids-hedgehog] >=4.19.0 && <4.20 || >=4.20.0 && <4.21 || >=4.21.0 && <4.22 || >=4.22.0 &&
  4997. 972.03 s [duoids-hedgehog] <4.23: using base-4.17.2.1
  4998. 972.03 s [duoids-hedgehog] Dependency duoids >=0.0.1 && <0.1: using duoids-0.0.1.0
  4999. 972.03 s [duoids-hedgehog] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  5000. 972.03 s [duoids-hedgehog] Dependency hedgehog >=1.1 && <1.3 || >=1.4 && <1.6 || >=1.7 && <1.8: using
  5001. 972.03 s [duoids-hedgehog] hedgehog-1.5
  5002. 972.03 s [duoids-hedgehog] Dependency base >=4.16.0 && <4.17 || >=4.17.0 && <4.18 || >=4.18.0 && <4.19 ||
  5003. 972.03 s [duoids-hedgehog] >=4.19.0 && <4.20 || >=4.20.0 && <4.21 || >=4.21.0 && <4.22 || >=4.22.0 &&
  5004. 972.03 s [duoids-hedgehog] <4.23: using base-4.17.2.1
  5005. 972.03 s [duoids-hedgehog] Dependency duoids-hedgehog: using duoids-hedgehog-0.0.1.0
  5006. 972.03 s [duoids-hedgehog] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  5007. 972.03 s [duoids-hedgehog] Dependency hedgehog >=1.1 && <1.3 || >=1.4 && <1.6 || >=1.7 && <1.8: using
  5008. 972.03 s [duoids-hedgehog] hedgehog-1.5
  5009. 972.03 s [duoids-hedgehog] Dependency base >=4.16.0 && <4.17 || >=4.17.0 && <4.18 || >=4.18.0 && <4.19 ||
  5010. 972.03 s [duoids-hedgehog] >=4.19.0 && <4.20 || >=4.20.0 && <4.21 || >=4.21.0 && <4.22 || >=4.22.0 &&
  5011. 972.03 s [duoids-hedgehog] <4.23: using base-4.17.2.1
  5012. 972.03 s [duoids-hedgehog] Dependency doctest >=0.18.2 && <0.19 || >=0.20.1 && <0.21 || >=0.21.1 && <0.22
  5013. 972.03 s [duoids-hedgehog] || >=0.22.6 && <0.23 || >=0.24.0 && <0.25 || >=0.25.0 && <0.26: using
  5014. 972.03 s [duoids-hedgehog] doctest-0.24.2
  5015. 972.03 s [duoids-hedgehog] Dependency duoids-hedgehog: using duoids-hedgehog-0.0.1.0
  5016. 972.03 s [duoids-hedgehog] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  5017. 972.03 s [duoids-hedgehog] Source component graph:
  5018. 972.03 s [duoids-hedgehog] component lib
  5019. 972.03 s [duoids-hedgehog] component test:doctests dependency lib
  5020. 972.03 s [duoids-hedgehog] component test:laws dependency lib
  5021. 972.03 s [duoids-hedgehog] Configured component graph:
  5022. 972.03 s [duoids-hedgehog] component duoids-hedgehog-0.0.1.0-86kvglxhXlf4EPSPhK634D
  5023. 972.03 s [duoids-hedgehog] include base-4.17.2.1
  5024. 972.03 s [duoids-hedgehog] include duoids-0.0.1.0-7Tv3jMouVtXFOM5hnlF6gw
  5025. 972.03 s [duoids-hedgehog] include ghc-compat-plugin-0.1.0.1-EF6fkbvBW8o6hs1RRExbcG
  5026. 972.03 s [duoids-hedgehog] include hedgehog-1.5-4fqlZQKIbDIIs4YNb6VW27
  5027. 972.03 s [duoids-hedgehog] component duoids-hedgehog-0.0.1.0-Ce7fnzFA8EBFuU4J9Smv9F-doctests
  5028. 972.03 s [duoids-hedgehog] include base-4.17.2.1
  5029. 972.03 s [duoids-hedgehog] include doctest-0.24.2-I8Dj1Qj4flA6uA6Qf1gy88
  5030. 972.03 s [duoids-hedgehog] include duoids-hedgehog-0.0.1.0-86kvglxhXlf4EPSPhK634D
  5031. 972.03 s [duoids-hedgehog] include ghc-compat-plugin-0.1.0.1-EF6fkbvBW8o6hs1RRExbcG
  5032. 972.03 s [duoids-hedgehog] component duoids-hedgehog-0.0.1.0-DcjcA1tcS8J4yAZvtN6TIk-laws
  5033. 972.04 s [duoids-hedgehog] include base-4.17.2.1
  5034. 972.04 s [duoids-hedgehog] include duoids-hedgehog-0.0.1.0-86kvglxhXlf4EPSPhK634D
  5035. 972.04 s [duoids-hedgehog] include ghc-compat-plugin-0.1.0.1-EF6fkbvBW8o6hs1RRExbcG
  5036. 972.04 s [duoids-hedgehog] include hedgehog-1.5-4fqlZQKIbDIIs4YNb6VW27
  5037. 972.04 s [duoids-hedgehog] Linked component graph:
  5038. 972.04 s [duoids-hedgehog] unit duoids-hedgehog-0.0.1.0-86kvglxhXlf4EPSPhK634D
  5039. 972.04 s [duoids-hedgehog] include base-4.17.2.1
  5040. 972.04 s [duoids-hedgehog] include duoids-0.0.1.0-7Tv3jMouVtXFOM5hnlF6gw
  5041. 972.04 s [duoids-hedgehog] include ghc-compat-plugin-0.1.0.1-EF6fkbvBW8o6hs1RRExbcG
  5042. 972.04 s [duoids-hedgehog] include hedgehog-1.5-4fqlZQKIbDIIs4YNb6VW27
  5043. 972.04 s [duoids-hedgehog] Test.Duoid=duoids-hedgehog-0.0.1.0-86kvglxhXlf4EPSPhK634D:Test.Duoid,Test.Duoidal=duoids-hedgehog-0.0.1.0-86kvglxhXlf4EPSPhK634D:Test.Duoidal
  5044. 972.04 s [duoids-hedgehog] unit duoids-hedgehog-0.0.1.0-Ce7fnzFA8EBFuU4J9Smv9F-doctests
  5045. 972.04 s [duoids-hedgehog] include base-4.17.2.1
  5046. 972.04 s [duoids-hedgehog] include doctest-0.24.2-I8Dj1Qj4flA6uA6Qf1gy88
  5047. 972.04 s [duoids-hedgehog] include duoids-hedgehog-0.0.1.0-86kvglxhXlf4EPSPhK634D
  5048. 972.04 s [duoids-hedgehog] include ghc-compat-plugin-0.1.0.1-EF6fkbvBW8o6hs1RRExbcG
  5049. 972.04 s [duoids-hedgehog] unit duoids-hedgehog-0.0.1.0-DcjcA1tcS8J4yAZvtN6TIk-laws
  5050. 972.04 s [duoids-hedgehog] include base-4.17.2.1
  5051. 972.04 s [duoids-hedgehog] include duoids-hedgehog-0.0.1.0-86kvglxhXlf4EPSPhK634D
  5052. 972.04 s [duoids-hedgehog] include ghc-compat-plugin-0.1.0.1-EF6fkbvBW8o6hs1RRExbcG
  5053. 972.04 s [duoids-hedgehog] include hedgehog-1.5-4fqlZQKIbDIIs4YNb6VW27
  5054. 972.04 s [duoids-hedgehog] Ready component graph:
  5055. 972.04 s [duoids-hedgehog] definite duoids-hedgehog-0.0.1.0-86kvglxhXlf4EPSPhK634D
  5056. 972.04 s [duoids-hedgehog] depends base-4.17.2.1
  5057. 972.04 s [duoids-hedgehog] depends duoids-0.0.1.0-7Tv3jMouVtXFOM5hnlF6gw
  5058. 972.04 s [duoids-hedgehog] depends ghc-compat-plugin-0.1.0.1-EF6fkbvBW8o6hs1RRExbcG
  5059. 972.04 s [duoids-hedgehog] depends hedgehog-1.5-4fqlZQKIbDIIs4YNb6VW27
  5060. 972.04 s [duoids-hedgehog] definite duoids-hedgehog-0.0.1.0-Ce7fnzFA8EBFuU4J9Smv9F-doctests
  5061. 972.04 s [duoids-hedgehog] depends base-4.17.2.1
  5062. 972.04 s [duoids-hedgehog] depends doctest-0.24.2-I8Dj1Qj4flA6uA6Qf1gy88
  5063. 972.04 s [duoids-hedgehog] depends duoids-hedgehog-0.0.1.0-86kvglxhXlf4EPSPhK634D
  5064. 972.04 s [duoids-hedgehog] depends ghc-compat-plugin-0.1.0.1-EF6fkbvBW8o6hs1RRExbcG
  5065. 972.04 s [duoids-hedgehog] definite duoids-hedgehog-0.0.1.0-DcjcA1tcS8J4yAZvtN6TIk-laws
  5066. 972.04 s [duoids-hedgehog] depends base-4.17.2.1
  5067. 972.04 s [duoids-hedgehog] depends duoids-hedgehog-0.0.1.0-86kvglxhXlf4EPSPhK634D
  5068. 972.04 s [duoids-hedgehog] depends ghc-compat-plugin-0.1.0.1-EF6fkbvBW8o6hs1RRExbcG
  5069. 972.04 s [duoids-hedgehog] depends hedgehog-1.5-4fqlZQKIbDIIs4YNb6VW27
  5070. 972.04 s [duoids-hedgehog] Using Cabal-3.12.1.0 compiled by ghc-9.4
  5071. 972.04 s [duoids-hedgehog] Using compiler: ghc-9.4.8
  5072. 972.04 s [duoids-hedgehog] Using install prefix:
  5073. 972.04 s [duoids-hedgehog] /nix/store/wwl2nv34m1jxv0i13ilwqhcxnkr7rzrw-duoids-hedgehog-0.0.1.0
  5074. 972.04 s [duoids-hedgehog] Executables installed in:
  5075. 972.04 s [duoids-hedgehog] /nix/store/wwl2nv34m1jxv0i13ilwqhcxnkr7rzrw-duoids-hedgehog-0.0.1.0/bin
  5076. 972.04 s [duoids-hedgehog] Libraries installed in:
  5077. 972.04 s [duoids-hedgehog] /nix/store/wwl2nv34m1jxv0i13ilwqhcxnkr7rzrw-duoids-hedgehog-0.0.1.0/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/duoids-hedgehog-0.0.1.0-86kvglxhXlf4EPSPhK634D
  5078. 972.04 s [duoids-hedgehog] Dynamic Libraries installed in:
  5079. 972.04 s [duoids-hedgehog] /nix/store/wwl2nv34m1jxv0i13ilwqhcxnkr7rzrw-duoids-hedgehog-0.0.1.0/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8
  5080. 972.04 s [duoids-hedgehog] Private executables installed in:
  5081. 972.04 s [duoids-hedgehog] /nix/store/wwl2nv34m1jxv0i13ilwqhcxnkr7rzrw-duoids-hedgehog-0.0.1.0/libexec/x86_64-linux-ghc-9.4.8/duoids-hedgehog-0.0.1.0
  5082. 972.04 s [duoids-hedgehog] Data files installed in:
  5083. 972.04 s [duoids-hedgehog] /nix/store/wwl2nv34m1jxv0i13ilwqhcxnkr7rzrw-duoids-hedgehog-0.0.1.0/share/x86_64-linux-ghc-9.4.8/duoids-hedgehog-0.0.1.0
  5084. 972.04 s [duoids-hedgehog] Documentation installed in:
  5085. 972.04 s [duoids-hedgehog] /nix/store/zsiqggg4ifvk2jliqlfdqdp7va4k7mvq-duoids-hedgehog-0.0.1.0-doc/share/doc/duoids-hedgehog-0.0.1.0
  5086. 972.04 s [duoids-hedgehog] Configuration files installed in:
  5087. 972.04 s [duoids-hedgehog] /nix/store/wwl2nv34m1jxv0i13ilwqhcxnkr7rzrw-duoids-hedgehog-0.0.1.0/etc
  5088. 972.04 s [duoids-hedgehog] No alex found
  5089. 972.04 s [duoids-hedgehog] Using ar found on system at:
  5090. 972.04 s [duoids-hedgehog] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  5091. 972.04 s [duoids-hedgehog] No c2hs found
  5092. 972.04 s [duoids-hedgehog] No cpphs found
  5093. 972.04 s [duoids-hedgehog] Using doctest version 0.24.2 found on system at:
  5094. 972.04 s [duoids-hedgehog] /nix/store/jbbd7dp036y9l3jv36q5ffbsn5s78wcn-doctest-0.24.2/bin/doctest
  5095. 972.04 s [duoids-hedgehog] Using gcc version 14.3.0 given by user at:
  5096. 972.04 s [duoids-hedgehog] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  5097. 972.04 s [duoids-hedgehog] Using ghc version 9.4.8 found on system at:
  5098. 972.04 s [duoids-hedgehog] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/ghc
  5099. 972.04 s [duoids-hedgehog] Using ghc-pkg version 9.4.8 found on system at:
  5100. 972.04 s [duoids-hedgehog] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/ghc-pkg-9.4.8
  5101. 972.04 s [duoids-hedgehog] No ghcjs found
  5102. 972.04 s [duoids-hedgehog] No ghcjs-pkg found
  5103. 972.04 s [duoids-hedgehog] No greencard found
  5104. 972.04 s [duoids-hedgehog] Using haddock version 2.27.0 found on system at:
  5105. 972.04 s [duoids-hedgehog] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/haddock-ghc-9.4.8
  5106. 972.04 s [duoids-hedgehog] No happy found
  5107. 972.04 s [duoids-hedgehog] Using haskell-suite found on system at: haskell-suite-dummy-location
  5108. 972.04 s [duoids-hedgehog] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  5109. 972.04 s [duoids-hedgehog] No hmake found
  5110. 972.04 s [duoids-hedgehog] Using hpc version 0.68 found on system at:
  5111. 972.04 s [duoids-hedgehog] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/hpc
  5112. 972.04 s [duoids-hedgehog] Using hsc2hs version 0.68.8 found on system at:
  5113. 972.04 s [duoids-hedgehog] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/hsc2hs
  5114. 972.04 s [duoids-hedgehog] Using hscolour version 1.25 found on system at:
  5115. 972.04 s [duoids-hedgehog] /nix/store/87hdxxa93g58b2w9ylr2idn2a40i3fdc-hscolour-1.25/bin/HsColour
  5116. 972.04 s [duoids-hedgehog] No jhc found
  5117. 972.04 s [duoids-hedgehog] Using ld found on system at:
  5118. 972.04 s [duoids-hedgehog] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ld.gold
  5119. 972.04 s [duoids-hedgehog] No pkg-config found
  5120. 972.04 s [duoids-hedgehog] Using runghc version 9.4.8 found on system at:
  5121. 972.04 s [duoids-hedgehog] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/runghc-9.4.8
  5122. 972.04 s [duoids-hedgehog] Using strip version 2.44 found on system at:
  5123. 972.04 s [duoids-hedgehog] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  5124. 972.04 s [duoids-hedgehog] Using tar found on system at:
  5125. 972.04 s [duoids-hedgehog] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  5126. 972.04 s [duoids-hedgehog] No uhc found
  5127. 972.24 s [duoidal-transformers] Phase: buildPhase
  5128. 972.39 s [duoidal-transformers] Preprocessing library for duoidal-transformers-0.0.1.0...
  5129. 972.39 s [duoidal-transformers] Building library for duoidal-transformers-0.0.1.0...
  5130. 972.65 s [duoids-hedgehog] Phase: buildPhase
  5131. 972.66 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 )
  5132. 972.88 s [duoids-hedgehog] Preprocessing library for duoids-hedgehog-0.0.1.0...
  5133. 972.88 s [duoids-hedgehog] Building library for duoids-hedgehog-0.0.1.0...
  5134. 973.24 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 )
  5135. 973.36 s [duoids-hedgehog] [1 of 2] Compiling Test.Duoid ( src/Test/Duoid.hs, dist/build/Test/Duoid.o, dist/build/Test/Duoid.dyn_o )
  5136. 974.53 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 )
  5137. 974.84 s [duoids-hedgehog] [2 of 2] Compiling Test.Duoidal ( src/Test/Duoidal.hs, dist/build/Test/Duoidal.o, dist/build/Test/Duoidal.dyn_o )
  5138. 975.21 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 )
  5139. 975.30 s [duoids-hedgehog] [1 of 2] Compiling Test.Duoid ( src/Test/Duoid.hs, dist/build/Test/Duoid.p_o )
  5140. 977.21 s [duoids-hedgehog] [2 of 2] Compiling Test.Duoidal ( src/Test/Duoidal.hs, dist/build/Test/Duoidal.p_o )
  5141. 981.72 s [duoidal-transformers] Preprocessing test suite 'doctests' for duoidal-transformers-0.0.1.0...
  5142. 981.72 s [duoidal-transformers] Building test suite 'doctests' for duoidal-transformers-0.0.1.0...
  5143. 981.99 s [duoidal-transformers] [1 of 2] Compiling Build_doctests ( dist/build/doctests/autogen/Build_doctests.hs, dist/build/doctests/doctests-tmp/Build_doctests.o )
  5144. 982.83 s [duoids-hedgehog] Preprocessing test suite 'doctests' for duoids-hedgehog-0.0.1.0...
  5145. 982.83 s [duoids-hedgehog] Building test suite 'doctests' for duoids-hedgehog-0.0.1.0...
  5146. 982.92 s [duoidal-transformers] [2 of 2] Compiling Main ( tests/doctests.hs, dist/build/doctests/doctests-tmp/Main.o )
  5147. 983.12 s [duoids-hedgehog] [1 of 2] Compiling Build_doctests ( dist/build/doctests/autogen/Build_doctests.hs, dist/build/doctests/doctests-tmp/Build_doctests.o )
  5148. 984.17 s [duoidal-transformers] [3 of 3] Linking dist/build/doctests/doctests
  5149. 984.64 s [duoids-hedgehog] [2 of 2] Compiling Main ( tests/doctests.hs, dist/build/doctests/doctests-tmp/Main.o )
  5150. 985.47 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 )
  5151. 986.15 s [duoids-hedgehog] [3 of 3] Linking dist/build/doctests/doctests
  5152. 989.39 s [duoidal-transformers] Phase: checkPhase
  5153. 990.33 s [duoidal-transformers] Running 1 test suites...
  5154. 990.42 s [duoidal-transformers] Test suite doctests: RUNNING...
  5155. 991.00 s [duoidal-transformers]
  5156. 991.00 s [duoidal-transformers] on the commandline: warning:
  5157. 991.00 s [duoidal-transformers] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  5158. 991.00 s [duoidal-transformers]
  5159. 991.00 s [duoidal-transformers] on the commandline: warning:
  5160. 991.00 s [duoidal-transformers] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  5161. 991.01 s [duoidal-transformers]
  5162. 991.01 s [duoidal-transformers] on the commandline: warning:
  5163. 991.01 s [duoidal-transformers] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  5164. 991.10 s [duoids-hedgehog] Preprocessing test suite 'laws' for duoids-hedgehog-0.0.1.0...
  5165. 991.10 s [duoids-hedgehog] Building test suite 'laws' for duoids-hedgehog-0.0.1.0...
  5166. 991.38 s [duoids-hedgehog] [1 of 1] Compiling Main ( tests/laws.hs, dist/build/laws/laws-tmp/Main.o )
  5167. 991.53 s [duoidal-transformers] Examples: 0 Tried: 0 Errors: 0 Failures: 0
  5168. 991.61 s [duoidal-transformers] NameLib Nothing
  5169. 991.61 s [duoidal-transformers] ----------------------------------------
  5170. 991.65 s [duoidal-transformers] Test suite doctests: PASS
  5171. 991.65 s [duoidal-transformers] Test suite logged to: dist/test/duoidal-transformers-0.0.1.0-doctests.log
  5172. 991.65 s [duoidal-transformers] 1 of 1 test suites (1 of 1 test cases) passed.
  5173. 991.80 s [duoidal-transformers] Phase: haddockPhase
  5174. 992.71 s [duoidal-transformers] Preprocessing library for duoidal-transformers-0.0.1.0...
  5175. 992.71 s [duoidal-transformers] Running Haddock on library for duoidal-transformers-0.0.1.0...
  5176. 993.70 s [duoidal-transformers] Warning: 'MonadTrans' is out of scope.
  5177. 993.70 s [duoidal-transformers] If you qualify the identifier, haddock can try to link it anyway.
  5178. 993.70 s [duoidal-transformers] 100% ( 3 / 3) in 'Control.Duoidal.Trans.Class'
  5179. 993.88 s [duoids-hedgehog] [2 of 2] Linking dist/build/laws/laws
  5180. 994.58 s [duoidal-transformers] 100% ( 1 / 1) in 'Control.Duoidal.Trans.Orphans'
  5181. 997.10 s [duoids-hedgehog] Phase: checkPhase
  5182. 997.88 s [duoids-hedgehog] Running 2 test suites...
  5183. 997.89 s [duoids-hedgehog] Test suite doctests: RUNNING...
  5184. 1000.04 s [duoids-hedgehog] Examples: 0 Tried: 0 Errors: 0 Failures: 0
  5185. 1000.14 s [duoids-hedgehog] NameLib Nothing
  5186. 1000.14 s [duoids-hedgehog] ----------------------------------------
  5187. 1000.20 s [duoids-hedgehog] Test suite doctests: PASS
  5188. 1000.20 s [duoids-hedgehog] Test suite logged to: dist/test/duoids-hedgehog-0.0.1.0-doctests.log
  5189. 1000.20 s [duoids-hedgehog] Test suite laws: RUNNING...
  5190. 1000.21 s [duoids-hedgehog] ━━━ Duoid Int ━━━
  5191. 1000.22 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  5192. 1000.23 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  5193. 1000.23 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  5194. 1000.23 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  5195. 1000.23 s [duoids-hedgehog] ✓ 4 succeeded.
  5196. 1000.23 s [duoids-hedgehog] ━━━ Duoid Int16 ━━━
  5197. 1000.23 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  5198. 1000.23 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  5199. 1000.23 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  5200. 1000.23 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  5201. 1000.23 s [duoids-hedgehog] ✓ 4 succeeded.
  5202. 1000.23 s [duoids-hedgehog] ━━━ Duoid Int32 ━━━
  5203. 1000.24 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  5204. 1000.24 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  5205. 1000.24 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  5206. 1000.24 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  5207. 1000.24 s [duoids-hedgehog] ✓ 4 succeeded.
  5208. 1000.24 s [duoids-hedgehog] ━━━ Duoid Int64 ━━━
  5209. 1000.24 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  5210. 1000.24 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  5211. 1000.24 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  5212. 1000.24 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  5213. 1000.24 s [duoids-hedgehog] ✓ 4 succeeded.
  5214. 1000.24 s [duoids-hedgehog] ━━━ Duoid Int8 ━━━
  5215. 1000.24 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  5216. 1000.24 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  5217. 1000.24 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  5218. 1000.25 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  5219. 1000.25 s [duoids-hedgehog] ✓ 4 succeeded.
  5220. 1000.25 s [duoids-hedgehog] ━━━ Duoid.Normal Natural ━━━
  5221. 1000.26 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  5222. 1000.26 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  5223. 1000.26 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  5224. 1000.26 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  5225. 1000.26 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  5226. 1000.26 s [duoids-hedgehog] ✓ 5 succeeded.
  5227. 1000.26 s [duoids-hedgehog] ━━━ Duoid.Normal (Ratio Natural) ━━━
  5228. 1000.26 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  5229. 1000.26 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  5230. 1000.26 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  5231. 1000.26 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  5232. 1000.26 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  5233. 1000.26 s [duoids-hedgehog] ✓ 5 succeeded.
  5234. 1000.26 s [duoids-hedgehog] ━━━ Duoid (Ratio Integer) ━━━
  5235. 1000.27 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  5236. 1000.27 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  5237. 1000.27 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  5238. 1000.27 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  5239. 1000.27 s [duoids-hedgehog] ✓ 4 succeeded.
  5240. 1000.27 s [duoids-hedgehog] ━━━ Duoid.Normal Word ━━━
  5241. 1000.27 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  5242. 1000.27 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  5243. 1000.27 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  5244. 1000.27 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  5245. 1000.28 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  5246. 1000.28 s [duoids-hedgehog] ✓ 5 succeeded.
  5247. 1000.28 s [duoids-hedgehog] ━━━ Duoid.Normal Word16 ━━━
  5248. 1000.28 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  5249. 1000.28 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  5250. 1000.28 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  5251. 1000.28 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  5252. 1000.28 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  5253. 1000.28 s [duoids-hedgehog] ✓ 5 succeeded.
  5254. 1000.28 s [duoids-hedgehog] ━━━ Duoid.Normal Word32 ━━━
  5255. 1000.28 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  5256. 1000.28 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  5257. 1000.28 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  5258. 1000.28 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  5259. 1000.28 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  5260. 1000.28 s [duoids-hedgehog] ✓ 5 succeeded.
  5261. 1000.28 s [duoids-hedgehog] ━━━ Duoid.Normal Word64 ━━━
  5262. 1000.28 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  5263. 1000.28 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  5264. 1000.28 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  5265. 1000.28 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  5266. 1000.29 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  5267. 1000.29 s [duoids-hedgehog] ✓ 5 succeeded.
  5268. 1000.29 s [duoids-hedgehog] ━━━ Duoid.Normal Word8 ━━━
  5269. 1000.29 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  5270. 1000.29 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  5271. 1000.29 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  5272. 1000.29 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  5273. 1000.29 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  5274. 1000.29 s [duoids-hedgehog] ✓ 5 succeeded.
  5275. 1000.30 s [duoids-hedgehog] Test suite laws: PASS
  5276. 1000.30 s [duoids-hedgehog] Test suite logged to: dist/test/duoids-hedgehog-0.0.1.0-laws.log
  5277. 1000.30 s [duoids-hedgehog] 2 of 2 test suites (2 of 2 test cases) passed.
  5278. 1000.32 s [duoids-hedgehog] Phase: haddockPhase
  5279. 1000.86 s [duoids-hedgehog] Preprocessing library for duoids-hedgehog-0.0.1.0...
  5280. 1000.86 s [duoids-hedgehog] Running Haddock on library for duoids-hedgehog-0.0.1.0...
  5281. 1000.86 s [duoids-hedgehog] Warning: The documentation for the following packages are not installed. No
  5282. 1000.86 s [duoids-hedgehog] links will be generated to these packages: hedgehog-1.5
  5283. 1002.00 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 )
  5284. 1003.17 s [duoids-hedgehog] 100% ( 3 / 3) in 'Test.Duoid'
  5285. 1003.74 s [duoids-hedgehog] 100% ( 2 / 2) in 'Test.Duoidal'
  5286. 1003.81 s [duoids-hedgehog] Warning: Test.Duoid: could not find link destinations for:
  5287. 1003.85 s [duoids-hedgehog]
  5288. 1003.85 s [duoids-hedgehog] - Hedgehog.Internal.Gen.Gen
  5289. 1003.85 s [duoids-hedgehog] - Hedgehog.Internal.Property.Group
  5290. 1003.85 s [duoids-hedgehog] Warning: Test.Duoidal: could not find link destinations for:
  5291. 1003.85 s [duoids-hedgehog]
  5292. 1003.85 s [duoids-hedgehog] - Hedgehog.Internal.Gen.Gen
  5293. 1003.85 s [duoids-hedgehog] - Hedgehog.Internal.Property.Group
  5294. 1011.95 s [duoidal-transformers] Documentation created: dist/doc/html/duoidal-transformers/,
  5295. 1011.97 s [duoidal-transformers] dist/doc/html/duoidal-transformers/duoidal-transformers.txt
  5296. 1012.07 s [duoidal-transformers] Preprocessing test suite 'doctests' for duoidal-transformers-0.0.1.0...
  5297. 1012.09 s [duoidal-transformers] Phase: installPhase
  5298. 1012.32 s [duoidal-transformers] Installing library in /nix/store/jvs2x0lbr3np33x2nb3k7r7qdirwmrd6-duoidal-transformers-0.0.1.0/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/duoidal-transformers-0.0.1.0-Ls4zbd6q0AcIZMkgnCzXIs
  5299. 1012.86 s [duoidal-transformers] Phase: fixupPhase
  5300. 1012.90 s [duoidal-transformers] shrinking RPATHs of ELF executables and libraries in /nix/store/jvs2x0lbr3np33x2nb3k7r7qdirwmrd6-duoidal-transformers-0.0.1.0
  5301. 1012.91 s [duoidal-transformers] shrinking /nix/store/jvs2x0lbr3np33x2nb3k7r7qdirwmrd6-duoidal-transformers-0.0.1.0/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/libHSduoidal-transformers-0.0.1.0-Ls4zbd6q0AcIZMkgnCzXIs-ghc9.4.8.so
  5302. 1012.93 s [duoidal-transformers] checking for references to /build/ in /nix/store/jvs2x0lbr3np33x2nb3k7r7qdirwmrd6-duoidal-transformers-0.0.1.0...
  5303. 1012.99 s [duoidal-transformers] patching script interpreter paths in /nix/store/jvs2x0lbr3np33x2nb3k7r7qdirwmrd6-duoidal-transformers-0.0.1.0
  5304. 1013.01 s [duoidal-transformers] stripping (with command strip and flags -S -p) in /nix/store/jvs2x0lbr3np33x2nb3k7r7qdirwmrd6-duoidal-transformers-0.0.1.0/lib
  5305. 1013.10 s [duoidal-transformers] shrinking RPATHs of ELF executables and libraries in /nix/store/z4hjjf6gawip8vpz9sai74dba7321an8-duoidal-transformers-0.0.1.0-doc
  5306. 1013.11 s [duoidal-transformers] checking for references to /build/ in /nix/store/z4hjjf6gawip8vpz9sai74dba7321an8-duoidal-transformers-0.0.1.0-doc...
  5307. 1013.15 s [duoidal-transformers] patching script interpreter paths in /nix/store/z4hjjf6gawip8vpz9sai74dba7321an8-duoidal-transformers-0.0.1.0-doc
  5308. 1013.39 s [duoidal-transformers:post-build] Uploading to cachix cache "sellout": /nix/store/jvs2x0lbr3np33x2nb3k7r7qdirwmrd6-duoidal-transformers-0.0.1.0 /nix/store/z4hjjf6gawip8vpz9sai74dba7321an8-duoidal-transformers-0.0.1.0-doc
  5309. 1014.65 s [duoidal-transformers:post-build] Pushing 2 paths (41 are already present) using zstd to cache sellout ⏳
  5310. 1014.65 s [duoidal-transformers:post-build]
  5311. 1015.14 s [duoidal-transformers:post-build] Pushing /nix/store/z4hjjf6gawip8vpz9sai74dba7321an8-duoidal-transformers-0.0.1.0-doc (370.16 KiB)
  5312. 1018.52 s [duoidal-transformers:post-build] Pushing /nix/store/jvs2x0lbr3np33x2nb3k7r7qdirwmrd6-duoidal-transformers-0.0.1.0 (765.29 KiB)
  5313. 1019.39 s [duoidal-transformers:post-build]
  5314. 1019.39 s [duoidal-transformers:post-build] All done.
  5315. 1019.47 s [duoidal-transformers:post-build] Uploading to the NixCI cache: /nix/store/jvs2x0lbr3np33x2nb3k7r7qdirwmrd6-duoidal-transformers-0.0.1.0 /nix/store/z4hjjf6gawip8vpz9sai74dba7321an8-duoidal-transformers-0.0.1.0-doc
  5316. 1019.86 s [duoidal-transformers:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  5317. 1019.92 s [duoidal-transformers:post-build] copying 2 paths...
  5318. 1019.92 s [duoidal-transformers:post-build] copying path '/nix/store/z4hjjf6gawip8vpz9sai74dba7321an8-duoidal-transformers-0.0.1.0-doc' to 'https://cache.nix-ci.com'...
  5319. 1020.26 s [duoidal-transformers:post-build] copying path '/nix/store/jvs2x0lbr3np33x2nb3k7r7qdirwmrd6-duoidal-transformers-0.0.1.0' to 'https://cache.nix-ci.com'...
  5320. 1021.05 s [duoidal-transformers:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  5321. 1021.33 s [duoidal-transformers:post-build] copying 1 paths...
  5322. 1021.34 s [duoidal-transformers:post-build] copying path '/nix/store/3mmddg0as7zv1x9jqnpa7gx826vzwryi-duoidal-transformers-0.0.1.0.drv' to 'https://cache.nix-ci.com'...
  5323. 1021.58 s Progress: 7 of 21 built (2 building), 161 of 161 downloaded from cache
  5324. 1021.58 s [duoids-hedgehog] Documentation created: dist/doc/html/duoids-hedgehog/,
  5325. 1021.58 s [duoids-hedgehog] dist/doc/html/duoids-hedgehog/duoids-hedgehog.txt
  5326. 1021.58 s [duoids-hedgehog] Preprocessing test suite 'doctests' for duoids-hedgehog-0.0.1.0...
  5327. 1021.58 s [duoids-hedgehog] Preprocessing test suite 'laws' for duoids-hedgehog-0.0.1.0...
  5328. 1021.58 s [duoids-hedgehog] Phase: installPhase
  5329. 1021.58 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 )
  5330. 1021.64 s [duoids-hedgehog] Installing library in /nix/store/wwl2nv34m1jxv0i13ilwqhcxnkr7rzrw-duoids-hedgehog-0.0.1.0/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/duoids-hedgehog-0.0.1.0-86kvglxhXlf4EPSPhK634D
  5331. 1022.48 s [duoids-hedgehog] Phase: fixupPhase
  5332. 1022.53 s [duoids-hedgehog] shrinking RPATHs of ELF executables and libraries in /nix/store/wwl2nv34m1jxv0i13ilwqhcxnkr7rzrw-duoids-hedgehog-0.0.1.0
  5333. 1022.54 s [duoids-hedgehog] shrinking /nix/store/wwl2nv34m1jxv0i13ilwqhcxnkr7rzrw-duoids-hedgehog-0.0.1.0/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/libHSduoids-hedgehog-0.0.1.0-86kvglxhXlf4EPSPhK634D-ghc9.4.8.so
  5334. 1022.57 s [duoids-hedgehog] checking for references to /build/ in /nix/store/wwl2nv34m1jxv0i13ilwqhcxnkr7rzrw-duoids-hedgehog-0.0.1.0...
  5335. 1022.58 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 )
  5336. 1022.62 s [duoids-hedgehog] patching script interpreter paths in /nix/store/wwl2nv34m1jxv0i13ilwqhcxnkr7rzrw-duoids-hedgehog-0.0.1.0
  5337. 1022.63 s [duoids-hedgehog] stripping (with command strip and flags -S -p) in /nix/store/wwl2nv34m1jxv0i13ilwqhcxnkr7rzrw-duoids-hedgehog-0.0.1.0/lib
  5338. 1022.71 s [duoids-hedgehog] shrinking RPATHs of ELF executables and libraries in /nix/store/zsiqggg4ifvk2jliqlfdqdp7va4k7mvq-duoids-hedgehog-0.0.1.0-doc
  5339. 1022.72 s [duoids-hedgehog] checking for references to /build/ in /nix/store/zsiqggg4ifvk2jliqlfdqdp7va4k7mvq-duoids-hedgehog-0.0.1.0-doc...
  5340. 1022.76 s [duoids-hedgehog] patching script interpreter paths in /nix/store/zsiqggg4ifvk2jliqlfdqdp7va4k7mvq-duoids-hedgehog-0.0.1.0-doc
  5341. 1022.99 s [duoids-hedgehog:post-build] Uploading to cachix cache "sellout": /nix/store/wwl2nv34m1jxv0i13ilwqhcxnkr7rzrw-duoids-hedgehog-0.0.1.0 /nix/store/zsiqggg4ifvk2jliqlfdqdp7va4k7mvq-duoids-hedgehog-0.0.1.0-doc
  5342. 1023.96 s [duoids-hedgehog:post-build] Pushing 2 paths (104 are already present) using zstd to cache sellout ⏳
  5343. 1023.96 s [duoids-hedgehog:post-build]
  5344. 1024.31 s [duoids-hedgehog:post-build] Pushing /nix/store/wwl2nv34m1jxv0i13ilwqhcxnkr7rzrw-duoids-hedgehog-0.0.1.0 (547.60 KiB)
  5345. 1024.45 s [duoids-hedgehog:post-build] Pushing /nix/store/zsiqggg4ifvk2jliqlfdqdp7va4k7mvq-duoids-hedgehog-0.0.1.0-doc (314.66 KiB)
  5346. 1025.35 s [duoids-hedgehog:post-build]
  5347. 1025.35 s [duoids-hedgehog:post-build] All done.
  5348. 1025.44 s [duoids-hedgehog:post-build] Uploading to the NixCI cache: /nix/store/wwl2nv34m1jxv0i13ilwqhcxnkr7rzrw-duoids-hedgehog-0.0.1.0 /nix/store/zsiqggg4ifvk2jliqlfdqdp7va4k7mvq-duoids-hedgehog-0.0.1.0-doc
  5349. 1025.59 s [duoids-hedgehog:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  5350. 1025.62 s [duoids-hedgehog:post-build] copying 2 paths...
  5351. 1025.62 s [duoids-hedgehog:post-build] copying path '/nix/store/zsiqggg4ifvk2jliqlfdqdp7va4k7mvq-duoids-hedgehog-0.0.1.0-doc' to 'https://cache.nix-ci.com'...
  5352. 1025.98 s [duoids-hedgehog:post-build] copying path '/nix/store/wwl2nv34m1jxv0i13ilwqhcxnkr7rzrw-duoids-hedgehog-0.0.1.0' to 'https://cache.nix-ci.com'...
  5353. 1026.52 s [duoids-hedgehog:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  5354. 1026.76 s [duoids-hedgehog:post-build] copying 1 paths...
  5355. 1026.77 s [duoids-hedgehog:post-build] copying path '/nix/store/b3wadv5r1llmx3d714jk31ihka9zvw1i-duoids-hedgehog-0.0.1.0.drv' to 'https://cache.nix-ci.com'...
  5356. 1027.00 s Progress: 8 of 20 built (1 building), 161 of 161 downloaded from cache
  5357. 1027.00 s [vector] [ 2 of 23] Compiling Data.Vector.Fusion.Util ( src/Data/Vector/Fusion/Util.hs, dist/build/Data/Vector/Fusion/Util.p_o )
  5358. 1027.00 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 )
  5359. 1027.00 s [vector] [ 4 of 23] Compiling Data.Vector.Generic.Mutable.Base ( src/Data/Vector/Generic/Mutable/Base.hs, dist/build/Data/Vector/Generic/Mutable/Base.p_o )
  5360. 1027.00 s [vector] [ 5 of 23] Compiling Data.Vector.Generic.Base ( src/Data/Vector/Generic/Base.hs, dist/build/Data/Vector/Generic/Base.p_o )
  5361. 1027.00 s [vector] [ 6 of 23] Compiling Data.Vector.Internal.Check ( src/Data/Vector/Internal/Check.hs, dist/build/Data/Vector/Internal/Check.p_o )
  5362. 1027.00 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 )
  5363. 1034.56 s [vector] [ 8 of 23] Compiling Data.Vector.Fusion.Bundle ( src/Data/Vector/Fusion/Bundle.hs, dist/build/Data/Vector/Fusion/Bundle.p_o )
  5364. 1041.51 s [vector] [ 9 of 23] Compiling Data.Vector.Generic.Mutable ( src/Data/Vector/Generic/Mutable.hs, dist/build/Data/Vector/Generic/Mutable.p_o )
  5365. 1047.83 s [vector] [10 of 23] Compiling Data.Vector.Generic.New ( src/Data/Vector/Generic/New.hs, dist/build/Data/Vector/Generic/New.p_o )
  5366. 1049.29 s [vector] [11 of 23] Compiling Data.Vector.Generic ( src/Data/Vector/Generic.hs, dist/build/Data/Vector/Generic.p_o )
  5367. 1070.20 s [vector] [12 of 23] Compiling Data.Vector.Mutable ( src/Data/Vector/Mutable.hs, dist/build/Data/Vector/Mutable.p_o )
  5368. 1070.21 s [vector] [13 of 23] Compiling Data.Vector ( src/Data/Vector.hs, dist/build/Data/Vector.p_o )
  5369. 1092.51 s [vector] [14 of 23] Compiling Data.Vector.Primitive.Mutable ( src/Data/Vector/Primitive/Mutable.hs, dist/build/Data/Vector/Primitive/Mutable.p_o )
  5370. 1092.52 s [vector] [15 of 23] Compiling Data.Vector.Primitive ( src/Data/Vector/Primitive.hs, dist/build/Data/Vector/Primitive.p_o )
  5371. 1092.52 s [vector] [16 of 23] Compiling Data.Vector.Storable.Internal ( src/Data/Vector/Storable/Internal.hs, dist/build/Data/Vector/Storable/Internal.p_o )
  5372. 1092.52 s [vector] [17 of 23] Compiling Data.Vector.Storable.Mutable ( src/Data/Vector/Storable/Mutable.hs, dist/build/Data/Vector/Storable/Mutable.p_o )
  5373. 1092.52 s [vector] [18 of 23] Compiling Data.Vector.Storable ( src/Data/Vector/Storable.hs, dist/build/Data/Vector/Storable.p_o )
  5374. 1093.55 s [vector] [19 of 23] Compiling Data.Vector.Strict.Mutable ( src/Data/Vector/Strict/Mutable.hs, dist/build/Data/Vector/Strict/Mutable.p_o )
  5375. 1093.55 s [vector] [20 of 23] Compiling Data.Vector.Strict ( src/Data/Vector/Strict.hs, dist/build/Data/Vector/Strict.p_o )
  5376. 1113.80 s [vector] [21 of 23] Compiling Data.Vector.Unboxed.Base ( src/Data/Vector/Unboxed/Base.hs, dist/build/Data/Vector/Unboxed/Base.p_o )
  5377. 1128.17 s [vector] [22 of 23] Compiling Data.Vector.Unboxed ( src/Data/Vector/Unboxed.hs, dist/build/Data/Vector/Unboxed.p_o )
  5378. 1139.23 s [vector] [23 of 23] Compiling Data.Vector.Unboxed.Mutable ( src/Data/Vector/Unboxed/Mutable.hs, dist/build/Data/Vector/Unboxed/Mutable.p_o )
  5379. 1141.30 s [vector] Preprocessing test suite 'vector-doctest' for vector-0.13.2.0..
  5380. 1141.30 s [vector] Building test suite 'vector-doctest' for vector-0.13.2.0..
  5381. 1141.38 s [vector] [1 of 1] Compiling Main ( tests/doctests.hs, dist/build/vector-doctest/vector-doctest-tmp/Main.o )
  5382. 1141.86 s [vector] [2 of 2] Linking dist/build/vector-doctest/vector-doctest
  5383. 1144.10 s [vector] Preprocessing library 'benchmarks-O2' for vector-0.13.2.0..
  5384. 1144.10 s [vector] Building library 'benchmarks-O2' for vector-0.13.2.0..
  5385. 1144.18 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 )
  5386. 1147.44 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 )
  5387. 1147.45 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 )
  5388. 1147.56 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 )
  5389. 1147.56 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 )
  5390. 1147.56 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 )
  5391. 1147.56 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 )
  5392. 1147.56 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 )
  5393. 1147.57 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 )
  5394. 1147.57 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 )
  5395. 1147.57 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 )
  5396. 1147.57 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 )
  5397. 1147.57 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 )
  5398. 1147.57 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 )
  5399. 1147.93 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 )
  5400. 1151.25 s [vector] [ 2 of 14] Compiling Bench.Vector.Algo.FindIndexR ( benchlib/Bench/Vector/Algo/FindIndexR.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/FindIndexR.p_o )
  5401. 1151.25 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 )
  5402. 1151.25 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 )
  5403. 1151.25 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 )
  5404. 1151.25 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 )
  5405. 1151.25 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 )
  5406. 1151.25 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 )
  5407. 1151.25 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 )
  5408. 1151.25 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 )
  5409. 1151.25 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 )
  5410. 1151.25 s [vector] [12 of 14] Compiling Bench.Vector.Tasty ( benchlib/Bench/Vector/Tasty.hs, dist/build/benchmarks-O2/Bench/Vector/Tasty.p_o )
  5411. 1151.25 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 )
  5412. 1151.25 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 )
  5413. 1153.55 s [vector] Preprocessing test suite 'vector-tests-O0' for vector-0.13.2.0..
  5414. 1153.55 s [vector] Building test suite 'vector-tests-O0' for vector-0.13.2.0..
  5415. 1153.74 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 )
  5416. 1153.99 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 )
  5417. 1155.89 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 )
  5418. 1155.89 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 )
  5419. 1157.56 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 )
  5420. 1157.81 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 )
  5421. 1157.81 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 )
  5422. 1157.81 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 )
  5423. 1157.81 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 )
  5424. 1157.81 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 )
  5425. 1157.81 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 )
  5426. 1157.81 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 )
  5427. 1158.64 s [vector] [13 of 13] Linking dist/build/vector-tests-O0/vector-tests-O0
  5428. 1160.49 s [vector] Preprocessing test suite 'vector-tests-O2' for vector-0.13.2.0..
  5429. 1160.51 s [vector] Building test suite 'vector-tests-O2' for vector-0.13.2.0..
  5430. 1160.71 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 )
  5431. 1161.13 s [vector] [ 2 of 12] Compiling Tests.Vector.UnitTests ( tests/Tests/Vector/UnitTests.hs, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/UnitTests.o, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/UnitTests.dyn_o )
  5432. 1175.29 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 )
  5433. 1175.30 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 )
  5434. 1184.78 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 )
  5435. 1259.03 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 )
  5436. 1259.05 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 )
  5437. 1259.05 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 )
  5438. 1259.05 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 )
  5439. 1259.05 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 )
  5440. 1259.05 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 )
  5441. 1259.05 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 )
  5442. 1260.08 s [vector] [13 of 13] Linking dist/build/vector-tests-O2/vector-tests-O2
  5443. 1261.71 s [vector] Preprocessing test suite 'vector-inspection' for vector-0.13.2.0..
  5444. 1261.71 s [vector] Building test suite 'vector-inspection' for vector-0.13.2.0..
  5445. 1261.93 s [vector] [1 of 4] Compiling Inspect ( tests-inspect/Inspect.hs, dist/build/vector-inspection/vector-inspection-tmp/Inspect.o, dist/build/vector-inspection/vector-inspection-tmp/Inspect.dyn_o )
  5446. 1263.00 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 )
  5447. 1263.00 s [vector] [3 of 4] Compiling Inspect.DerivingVia ( tests-inspect/Inspect/DerivingVia.hs, dist/build/vector-inspection/vector-inspection-tmp/Inspect/DerivingVia.o, dist/build/vector-inspection/vector-inspection-tmp/Inspect/DerivingVia.dyn_o )
  5448. 1265.05 s [vector] [4 of 4] Compiling Main ( tests-inspect/main.hs, dist/build/vector-inspection/vector-inspection-tmp/Main.o )
  5449. 1266.23 s [vector] [5 of 5] Linking dist/build/vector-inspection/vector-inspection
  5450. 1267.98 s [vector] buildPhase completed in 6 minutes 8 seconds
  5451. 1267.98 s [vector] Phase: checkPhase
  5452. 1268.21 s [vector] Running 2 test suites...
  5453. 1268.21 s [vector] Test suite vector-tests-O0: RUNNING...
  5454. 1268.66 s [vector] toplevel
  5455. 1268.66 s [vector] Data.Vector.Fusion.Bundle
  5456. 1268.67 s [vector] fromList.toList == id: OK
  5457. 1268.67 s [vector] +++ OK, passed 100 tests.
  5458. 1268.67 s [vector] toList.fromList == id: OK
  5459. 1268.67 s [vector] +++ OK, passed 100 tests.
  5460. 1268.67 s [vector] eq: OK
  5461. 1268.67 s [vector] +++ OK, passed 100 tests.
  5462. 1268.67 s [vector] length: OK
  5463. 1268.67 s [vector] +++ OK, passed 100 tests.
  5464. 1268.67 s [vector] null: OK
  5465. 1268.67 s [vector] +++ OK, passed 100 tests.
  5466. 1268.67 s [vector] empty: OK
  5467. 1268.67 s [vector] +++ OK, passed 100 tests.
  5468. 1268.67 s [vector] singleton: OK
  5469. 1268.67 s [vector] +++ OK, passed 100 tests.
  5470. 1268.70 s [vector] replicate: OK
  5471. 1268.70 s [vector] +++ OK, passed 100 tests.
  5472. 1268.70 s [vector] cons: OK
  5473. 1268.70 s [vector] +++ OK, passed 100 tests.
  5474. 1268.70 s [vector] snoc: OK
  5475. 1268.70 s [vector] +++ OK, passed 100 tests.
  5476. 1268.70 s [vector] append: OK
  5477. 1268.70 s [vector] +++ OK, passed 100 tests.
  5478. 1268.70 s [vector] head: OK
  5479. 1268.70 s [vector] +++ OK, passed 100 tests; 20 discarded.
  5480. 1268.70 s [vector] last: OK
  5481. 1268.70 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5482. 1268.70 s [vector] index: OK
  5483. 1268.70 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5484. 1268.70 s [vector] extract: OK
  5485. 1268.70 s [vector] +++ OK, passed 100 tests.
  5486. 1268.70 s [vector] init: OK
  5487. 1268.70 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5488. 1268.70 s [vector] tail: OK
  5489. 1268.70 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5490. 1268.70 s [vector] take: OK
  5491. 1268.70 s [vector] +++ OK, passed 100 tests.
  5492. 1268.70 s [vector] drop: OK
  5493. 1268.70 s [vector] +++ OK, passed 100 tests.
  5494. 1268.70 s [vector] map: OK
  5495. 1268.70 s [vector] +++ OK, passed 100 tests.
  5496. 1268.70 s [vector] zipWith: OK
  5497. 1268.70 s [vector] +++ OK, passed 100 tests.
  5498. 1268.70 s [vector] zipWith3: OK
  5499. 1268.70 s [vector] +++ OK, passed 100 tests.
  5500. 1268.70 s [vector] filter: OK (0.02s)
  5501. 1268.70 s [vector] +++ OK, passed 100 tests.
  5502. 1268.70 s [vector] takeWhile: OK
  5503. 1268.70 s [vector] +++ OK, passed 100 tests.
  5504. 1268.70 s [vector] dropWhile: OK
  5505. 1268.70 s [vector] +++ OK, passed 100 tests.
  5506. 1268.70 s [vector] elem: OK
  5507. 1268.70 s [vector] +++ OK, passed 100 tests.
  5508. 1268.70 s [vector] notElem: OK
  5509. 1268.70 s [vector] +++ OK, passed 100 tests.
  5510. 1268.70 s [vector] find: OK
  5511. 1268.70 s [vector] +++ OK, passed 100 tests.
  5512. 1268.70 s [vector] findIndex: OK
  5513. 1268.70 s [vector] +++ OK, passed 100 tests.
  5514. 1268.70 s [vector] foldl: OK
  5515. 1268.70 s [vector] +++ OK, passed 100 tests.
  5516. 1268.70 s [vector] foldl1: OK
  5517. 1268.70 s [vector] +++ OK, passed 100 tests; 12 discarded.
  5518. 1268.70 s [vector] foldl': OK
  5519. 1268.70 s [vector] +++ OK, passed 100 tests.
  5520. 1268.70 s [vector] foldl1': OK
  5521. 1268.70 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5522. 1268.70 s [vector] foldr: OK
  5523. 1268.70 s [vector] +++ OK, passed 100 tests.
  5524. 1268.70 s [vector] foldr1: OK
  5525. 1268.70 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5526. 1268.70 s [vector] prescanl: OK
  5527. 1268.70 s [vector] +++ OK, passed 100 tests.
  5528. 1268.70 s [vector] prescanl': OK
  5529. 1268.70 s [vector] +++ OK, passed 100 tests.
  5530. 1268.71 s [vector] postscanl: OK
  5531. 1268.71 s [vector] +++ OK, passed 100 tests.
  5532. 1268.71 s [vector] postscanl': OK
  5533. 1268.71 s [vector] +++ OK, passed 100 tests.
  5534. 1268.71 s [vector] scanl: OK
  5535. 1268.71 s [vector] +++ OK, passed 100 tests.
  5536. 1268.71 s [vector] scanl': OK
  5537. 1268.71 s [vector] +++ OK, passed 100 tests.
  5538. 1268.71 s [vector] scanl1: OK
  5539. 1268.71 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5540. 1268.71 s [vector] scanl1': OK
  5541. 1268.71 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5542. 1268.71 s [vector] concatMap: OK
  5543. 1268.71 s [vector] +++ OK, passed 100 tests.
  5544. 1268.71 s [vector] unfoldr: OK
  5545. 1268.71 s [vector] +++ OK, passed 100 tests.
  5546. 1268.71 s [vector] and: OK
  5547. 1268.71 s [vector] +++ OK, passed 100 tests.
  5548. 1268.71 s [vector] or: OK
  5549. 1268.71 s [vector] +++ OK, passed 100 tests.
  5550. 1268.71 s [vector] Tests.Vector.Boxed
  5551. 1268.71 s [vector] Bool
  5552. 1268.71 s [vector] fromList.toList == id: OK
  5553. 1268.71 s [vector] +++ OK, passed 100 tests.
  5554. 1268.71 s [vector] toList.fromList == id: OK
  5555. 1268.71 s [vector] +++ OK, passed 100 tests.
  5556. 1268.71 s [vector] unstream.stream == id: OK
  5557. 1268.71 s [vector] +++ OK, passed 100 tests.
  5558. 1268.71 s [vector] stream.unstream == id: OK
  5559. 1268.71 s [vector] +++ OK, passed 100 tests.
  5560. 1268.71 s [vector] eq: OK
  5561. 1268.71 s [vector] +++ OK, passed 100 tests.
  5562. 1268.71 s [vector] length: OK
  5563. 1268.71 s [vector] +++ OK, passed 100 tests.
  5564. 1268.71 s [vector] null: OK
  5565. 1268.71 s [vector] +++ OK, passed 100 tests.
  5566. 1268.71 s [vector] index: OK
  5567. 1268.71 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5568. 1268.71 s [vector] safeIndex: OK
  5569. 1268.71 s [vector] +++ OK, passed 100 tests.
  5570. 1268.71 s [vector] head: OK
  5571. 1268.71 s [vector] +++ OK, passed 100 tests; 21 discarded.
  5572. 1268.71 s [vector] last: OK
  5573. 1268.71 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5574. 1268.71 s [vector] unsafeIndex: OK
  5575. 1268.71 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5576. 1268.71 s [vector] unsafeHead: OK
  5577. 1268.71 s [vector] +++ OK, passed 100 tests; 11 discarded.
  5578. 1268.72 s [vector] unsafeLast: OK
  5579. 1268.72 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5580. 1268.72 s [vector] slice: OK
  5581. 1268.72 s [vector] +++ OK, passed 100 tests.
  5582. 1268.72 s [vector] init: OK
  5583. 1268.73 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5584. 1268.73 s [vector] tail: OK
  5585. 1268.73 s [vector] +++ OK, passed 100 tests; 12 discarded.
  5586. 1268.73 s [vector] take: OK
  5587. 1268.73 s [vector] +++ OK, passed 100 tests.
  5588. 1268.73 s [vector] drop: OK
  5589. 1268.73 s [vector] +++ OK, passed 100 tests.
  5590. 1268.73 s [vector] splitAt: OK
  5591. 1268.73 s [vector] +++ OK, passed 100 tests.
  5592. 1268.73 s [vector] empty: OK
  5593. 1268.73 s [vector] +++ OK, passed 100 tests.
  5594. 1268.73 s [vector] singleton: OK
  5595. 1268.73 s [vector] +++ OK, passed 100 tests.
  5596. 1268.75 s [vector] replicate: OK
  5597. 1268.75 s [vector] +++ OK, passed 100 tests.
  5598. 1268.75 s [vector] generate: OK
  5599. 1268.75 s [vector] +++ OK, passed 100 tests.
  5600. 1268.75 s [vector] iterateN: OK
  5601. 1268.75 s [vector] +++ OK, passed 100 tests.
  5602. 1268.75 s [vector] iterateNM: OK (0.10s)
  5603. 1268.75 s [vector] +++ OK, passed 100 tests.
  5604. 1268.75 s [vector] generateM: OK (0.14s)
  5605. 1268.75 s [vector] +++ OK, passed 100 tests.
  5606. 1268.75 s [vector] replicateM: OK (0.02s)
  5607. 1268.75 s [vector] +++ OK, passed 100 tests.
  5608. 1268.75 s [vector] create: OK
  5609. 1268.75 s [vector] +++ OK, passed 100 tests.
  5610. 1268.75 s [vector] createT: OK
  5611. 1268.75 s [vector] +++ OK, passed 100 tests.
  5612. 1268.75 s [vector] unfoldr: OK
  5613. 1268.75 s [vector] +++ OK, passed 100 tests.
  5614. 1268.75 s [vector] unfoldrN: OK
  5615. 1268.75 s [vector] +++ OK, passed 100 tests.
  5616. 1268.75 s [vector] unfoldrExactN: OK
  5617. 1268.75 s [vector] +++ OK, passed 100 tests.
  5618. 1268.80 s [vector] unfoldrM: OK (0.03s)
  5619. 1268.80 s [vector] +++ OK, passed 100 tests.
  5620. 1268.84 s [vector] unfoldrNM: OK (0.04s)
  5621. 1268.84 s [vector] +++ OK, passed 100 tests.
  5622. 1268.92 s [vector] unfoldrExactNM: OK (0.08s)
  5623. 1268.92 s [vector] +++ OK, passed 100 tests.
  5624. 1268.92 s [vector] constructN: OK
  5625. 1268.92 s [vector] +++ OK, passed 100 tests.
  5626. 1268.92 s [vector] constructrN: OK
  5627. 1268.92 s [vector] +++ OK, passed 100 tests.
  5628. 1268.92 s [vector] cons: OK
  5629. 1268.92 s [vector] +++ OK, passed 100 tests.
  5630. 1268.93 s [vector] snoc: OK
  5631. 1268.93 s [vector] +++ OK, passed 100 tests.
  5632. 1268.93 s [vector] append: OK
  5633. 1268.93 s [vector] +++ OK, passed 100 tests.
  5634. 1268.95 s [vector] concat: OK (0.02s)
  5635. 1268.96 s [vector] +++ OK, passed 100 tests.
  5636. 1268.96 s [vector] force: OK
  5637. 1268.96 s [vector] +++ OK, passed 100 tests.
  5638. 1268.96 s [vector] upd: OK
  5639. 1268.97 s [vector] +++ OK, passed 100 tests.
  5640. 1268.97 s [vector] accum: OK
  5641. 1268.97 s [vector] +++ OK, passed 100 tests.
  5642. 1268.98 s [vector] reverse: OK
  5643. 1268.98 s [vector] +++ OK, passed 100 tests.
  5644. 1268.98 s [vector] backpermute: OK
  5645. 1268.98 s [vector] +++ OK, passed 100 tests.
  5646. 1268.98 s [vector] map: OK
  5647. 1268.98 s [vector] +++ OK, passed 100 tests.
  5648. 1268.98 s [vector] imap: OK
  5649. 1268.98 s [vector] +++ OK, passed 100 tests.
  5650. 1268.99 s [vector] concatMap: OK
  5651. 1268.99 s [vector] +++ OK, passed 100 tests.
  5652. 1269.00 s [vector] mapM: OK
  5653. 1269.00 s [vector] +++ OK, passed 100 tests.
  5654. 1269.01 s [vector] mapM_: OK (0.02s)
  5655. 1269.01 s [vector] +++ OK, passed 100 tests.
  5656. 1269.02 s [vector] forM: OK
  5657. 1269.02 s [vector] +++ OK, passed 100 tests.
  5658. 1269.04 s [vector] forM_: OK (0.02s)
  5659. 1269.05 s [vector] +++ OK, passed 100 tests.
  5660. 1269.06 s [vector] imapM: OK
  5661. 1269.06 s [vector] +++ OK, passed 100 tests.
  5662. 1269.06 s [vector] imapM_: OK (0.02s)
  5663. 1269.07 s [vector] +++ OK, passed 100 tests.
  5664. 1269.07 s [vector] zipWith: OK
  5665. 1269.07 s [vector] +++ OK, passed 100 tests.
  5666. 1269.07 s [vector] zipWith3: OK
  5667. 1269.07 s [vector] +++ OK, passed 100 tests.
  5668. 1269.07 s [vector] izipWith: OK
  5669. 1269.07 s [vector] +++ OK, passed 100 tests.
  5670. 1269.08 s [vector] izipWith3: OK
  5671. 1269.10 s [vector] +++ OK, passed 100 tests.
  5672. 1269.10 s [vector] izipWithM: OK
  5673. 1269.10 s [vector] +++ OK, passed 100 tests.
  5674. 1269.12 s [vector] izipWithM_: OK (0.04s)
  5675. 1269.12 s [vector] +++ OK, passed 100 tests.
  5676. 1269.13 s [vector] zipWithM: OK
  5677. 1269.13 s [vector] +++ OK, passed 100 tests.
  5678. 1269.15 s [vector] zipWithM_: OK (0.02s)
  5679. 1269.15 s [vector] +++ OK, passed 100 tests.
  5680. 1269.15 s [vector] filter: OK
  5681. 1269.15 s [vector] +++ OK, passed 100 tests.
  5682. 1269.17 s [vector] ifilter: OK
  5683. 1269.17 s [vector] +++ OK, passed 100 tests.
  5684. 1269.19 s [vector] filterM: OK (0.04s)
  5685. 1269.19 s [vector] +++ OK, passed 100 tests.
  5686. 1269.20 s [vector] uniq: OK
  5687. 1269.20 s [vector] +++ OK, passed 100 tests.
  5688. 1269.20 s [vector] mapMaybe: OK
  5689. 1269.20 s [vector] +++ OK, passed 100 tests.
  5690. 1269.20 s [vector] imapMaybe: OK
  5691. 1269.21 s [vector] +++ OK, passed 100 tests.
  5692. 1269.21 s [vector] takeWhile: OK
  5693. 1269.21 s [vector] +++ OK, passed 100 tests.
  5694. 1269.21 s [vector] dropWhile: OK
  5695. 1269.21 s [vector] +++ OK, passed 100 tests.
  5696. 1269.21 s [vector] partition: OK
  5697. 1269.21 s [vector] +++ OK, passed 100 tests.
  5698. 1269.22 s [vector] partitionWith: OK
  5699. 1269.22 s [vector] +++ OK, passed 100 tests.
  5700. 1269.22 s [vector] span: OK
  5701. 1269.22 s [vector] +++ OK, passed 100 tests.
  5702. 1269.22 s [vector] break: OK
  5703. 1269.22 s [vector] +++ OK, passed 100 tests.
  5704. 1269.22 s [vector] spanR: OK
  5705. 1269.22 s [vector] +++ OK, passed 100 tests.
  5706. 1269.23 s [vector] breakR: OK
  5707. 1269.23 s [vector] +++ OK, passed 100 tests.
  5708. 1269.23 s [vector] groupBy: OK
  5709. 1269.23 s [vector] +++ OK, passed 100 tests.
  5710. 1269.23 s [vector] elem: OK
  5711. 1269.23 s [vector] +++ OK, passed 100 tests.
  5712. 1269.23 s [vector] notElem: OK
  5713. 1269.23 s [vector] +++ OK, passed 100 tests.
  5714. 1269.23 s [vector] find: OK
  5715. 1269.23 s [vector] +++ OK, passed 100 tests.
  5716. 1269.23 s [vector] findIndex: OK
  5717. 1269.23 s [vector] +++ OK, passed 100 tests.
  5718. 1269.24 s [vector] findIndexR: OK
  5719. 1269.24 s [vector] +++ OK, passed 100 tests.
  5720. 1269.24 s [vector] findIndices: OK
  5721. 1269.24 s [vector] +++ OK, passed 100 tests.
  5722. 1269.24 s [vector] elemIndex: OK
  5723. 1269.25 s [vector] +++ OK, passed 100 tests.
  5724. 1269.25 s [vector] elemIndices: OK
  5725. 1269.25 s [vector] +++ OK, passed 100 tests.
  5726. 1269.25 s [vector] foldl: OK
  5727. 1269.25 s [vector] +++ OK, passed 100 tests.
  5728. 1269.25 s [vector] foldl1: OK
  5729. 1269.25 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5730. 1269.25 s [vector] foldl': OK
  5731. 1269.25 s [vector] +++ OK, passed 100 tests.
  5732. 1269.26 s [vector] foldl1': OK
  5733. 1269.26 s [vector] +++ OK, passed 100 tests; 20 discarded.
  5734. 1269.26 s [vector] foldr: OK
  5735. 1269.26 s [vector] +++ OK, passed 100 tests.
  5736. 1269.26 s [vector] foldr1: OK
  5737. 1269.26 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5738. 1269.26 s [vector] foldr': OK
  5739. 1269.26 s [vector] +++ OK, passed 100 tests.
  5740. 1269.27 s [vector] foldr1': OK
  5741. 1269.27 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5742. 1269.28 s [vector] ifoldl: OK
  5743. 1269.28 s [vector] +++ OK, passed 100 tests.
  5744. 1269.28 s [vector] ifoldl': OK
  5745. 1269.28 s [vector] +++ OK, passed 100 tests.
  5746. 1269.29 s [vector] ifoldr: OK
  5747. 1269.29 s [vector] +++ OK, passed 100 tests.
  5748. 1269.31 s [vector] ifoldr': OK
  5749. 1269.31 s [vector] +++ OK, passed 100 tests.
  5750. 1269.32 s [vector] ifoldM: OK
  5751. 1269.32 s [vector] +++ OK, passed 100 tests.
  5752. 1269.32 s [vector] ifoldM': OK (0.02s)
  5753. 1269.32 s [vector] +++ OK, passed 100 tests.
  5754. 1269.35 s [vector] ifoldM_: OK (0.02s)
  5755. 1269.35 s [vector] +++ OK, passed 100 tests.
  5756. 1269.35 s [vector] ifoldM'_: OK (0.02s)
  5757. 1269.35 s [vector] +++ OK, passed 100 tests.
  5758. 1269.36 s [vector] all: OK
  5759. 1269.36 s [vector] +++ OK, passed 100 tests.
  5760. 1269.36 s [vector] any: OK
  5761. 1269.36 s [vector] +++ OK, passed 100 tests.
  5762. 1269.37 s [vector] prescanl: OK
  5763. 1269.37 s [vector] +++ OK, passed 100 tests.
  5764. 1269.37 s [vector] prescanl': OK
  5765. 1269.37 s [vector] +++ OK, passed 100 tests.
  5766. 1269.37 s [vector] postscanl: OK
  5767. 1269.37 s [vector] +++ OK, passed 100 tests.
  5768. 1269.37 s [vector] postscanl': OK
  5769. 1269.37 s [vector] +++ OK, passed 100 tests.
  5770. 1269.38 s [vector] scanl: OK
  5771. 1269.39 s [vector] +++ OK, passed 100 tests.
  5772. 1269.39 s [vector] scanl': OK
  5773. 1269.39 s [vector] +++ OK, passed 100 tests.
  5774. 1269.39 s [vector] scanl1: OK
  5775. 1269.40 s [vector] +++ OK, passed 100 tests.
  5776. 1269.40 s [vector] scanl1': OK
  5777. 1269.40 s [vector] +++ OK, passed 100 tests.
  5778. 1269.40 s [vector] iscanl: OK
  5779. 1269.40 s [vector] +++ OK, passed 100 tests.
  5780. 1269.41 s [vector] iscanl': OK
  5781. 1269.41 s [vector] +++ OK, passed 100 tests.
  5782. 1269.41 s [vector] prescanr: OK
  5783. 1269.41 s [vector] +++ OK, passed 100 tests.
  5784. 1269.41 s [vector] prescanr': OK
  5785. 1269.41 s [vector] +++ OK, passed 100 tests.
  5786. 1269.41 s [vector] postscanr: OK
  5787. 1269.41 s [vector] +++ OK, passed 100 tests.
  5788. 1269.42 s [vector] postscanr': OK
  5789. 1269.42 s [vector] +++ OK, passed 100 tests.
  5790. 1269.42 s [vector] scanr: OK
  5791. 1269.42 s [vector] +++ OK, passed 100 tests.
  5792. 1269.43 s [vector] scanr': OK
  5793. 1269.43 s [vector] +++ OK, passed 100 tests.
  5794. 1269.43 s [vector] scanr1: OK
  5795. 1269.43 s [vector] +++ OK, passed 100 tests.
  5796. 1269.44 s [vector] scanr1': OK
  5797. 1269.44 s [vector] +++ OK, passed 100 tests.
  5798. 1269.44 s [vector] iscanr: OK
  5799. 1269.44 s [vector] +++ OK, passed 100 tests.
  5800. 1269.45 s [vector] iscanr': OK
  5801. 1269.45 s [vector] +++ OK, passed 100 tests.
  5802. 1269.45 s [vector] mut_read: OK
  5803. 1269.45 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5804. 1269.45 s [vector] mut_write: OK
  5805. 1269.46 s [vector] +++ OK, passed 100 tests; 12 discarded.
  5806. 1269.46 s [vector] mut_modify: OK
  5807. 1269.46 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5808. 1269.47 s [vector] mut_generate: OK
  5809. 1269.47 s [vector] +++ OK, passed 100 tests.
  5810. 1269.48 s [vector] mut_generateM: OK (0.01s)
  5811. 1269.48 s [vector] +++ OK, passed 100 tests.
  5812. 1269.48 s [vector] mut_mapM_: OK (0.01s)
  5813. 1269.48 s [vector] +++ OK, passed 100 tests.
  5814. 1269.50 s [vector] mut_imapM_: OK
  5815. 1269.50 s [vector] +++ OK, passed 100 tests.
  5816. 1269.54 s [vector] mut_forM_: OK
  5817. 1269.54 s [vector] +++ OK, passed 100 tests.
  5818. 1269.57 s [vector] mut_iforM_: OK (0.03s)
  5819. 1269.57 s [vector] +++ OK, passed 100 tests.
  5820. 1269.57 s [vector] mut_foldr: OK
  5821. 1269.57 s [vector] +++ OK, passed 100 tests.
  5822. 1269.57 s [vector] mut_foldr': OK
  5823. 1269.57 s [vector] +++ OK, passed 100 tests.
  5824. 1269.57 s [vector] mut_foldl: OK
  5825. 1269.57 s [vector] +++ OK, passed 100 tests.
  5826. 1269.57 s [vector] mut_foldl': OK
  5827. 1269.58 s [vector] +++ OK, passed 100 tests.
  5828. 1269.58 s [vector] mut_ifoldr: OK
  5829. 1269.58 s [vector] +++ OK, passed 100 tests.
  5830. 1269.58 s [vector] mut_ifoldr': OK
  5831. 1269.58 s [vector] +++ OK, passed 100 tests.
  5832. 1269.59 s [vector] mut_ifoldl: OK
  5833. 1269.59 s [vector] +++ OK, passed 100 tests.
  5834. 1269.59 s [vector] mut_ifoldl': OK
  5835. 1269.59 s [vector] +++ OK, passed 100 tests.
  5836. 1269.59 s [vector] mut_foldM: OK
  5837. 1269.59 s [vector] +++ OK, passed 100 tests.
  5838. 1269.59 s [vector] mut_foldM': OK
  5839. 1269.59 s [vector] +++ OK, passed 100 tests.
  5840. 1269.60 s [vector] mut_foldrM: OK
  5841. 1269.60 s [vector] +++ OK, passed 100 tests.
  5842. 1269.60 s [vector] mut_foldrM': OK
  5843. 1269.60 s [vector] +++ OK, passed 100 tests.
  5844. 1269.60 s [vector] mut_ifoldM: OK
  5845. 1269.60 s [vector] +++ OK, passed 100 tests.
  5846. 1269.61 s [vector] mut_ifoldM': OK
  5847. 1269.62 s [vector] +++ OK, passed 100 tests.
  5848. 1269.62 s [vector] mut_ifoldrM: OK
  5849. 1269.62 s [vector] +++ OK, passed 100 tests.
  5850. 1269.62 s [vector] mut_ifoldrM': OK
  5851. 1269.62 s [vector] +++ OK, passed 100 tests.
  5852. 1269.62 s [vector] compare: OK
  5853. 1269.62 s [vector] +++ OK, passed 100 tests.
  5854. 1269.63 s [vector] maximum: OK
  5855. 1269.63 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5856. 1269.63 s [vector] minimum: OK
  5857. 1269.63 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5858. 1269.63 s [vector] minIndex: OK
  5859. 1269.63 s [vector] +++ OK, passed 100 tests; 20 discarded.
  5860. 1269.63 s [vector] maxIndex: OK
  5861. 1269.63 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5862. 1269.64 s [vector] maximumBy: OK
  5863. 1269.64 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5864. 1269.64 s [vector] minimumBy: OK
  5865. 1269.64 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5866. 1269.64 s [vector] maximumOn: OK
  5867. 1269.64 s [vector] +++ OK, passed 100 tests; 20 discarded.
  5868. 1269.64 s [vector] minimumOn: OK
  5869. 1269.64 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5870. 1269.64 s [vector] maxIndexBy: OK
  5871. 1269.64 s [vector] +++ OK, passed 100 tests; 28 discarded.
  5872. 1269.64 s [vector] minIndexBy: OK
  5873. 1269.64 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5874. 1269.65 s [vector] ListFirstMaxIndexWins: OK
  5875. 1269.65 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5876. 1269.65 s [vector] FalseListFirstMaxIndexWins: OK
  5877. 1269.65 s [vector] +++ OK, failed as expected. (after 1 test):
  5878. 1269.65 s [vector] Exception:
  5879. 1269.65 s [vector] Prelude.foldr1: empty list
  5880. 1269.65 s [vector] CallStack (from HasCallStack):
  5881. 1269.65 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  5882. 1269.65 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  5883. 1269.65 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  5884. 1269.65 s [vector] []
  5885. 1269.65 s [vector] zip: OK
  5886. 1269.65 s [vector] +++ OK, passed 100 tests.
  5887. 1269.65 s [vector] zip3: OK
  5888. 1269.65 s [vector] +++ OK, passed 100 tests.
  5889. 1269.66 s [vector] unzip: OK
  5890. 1269.66 s [vector] +++ OK, passed 100 tests.
  5891. 1269.66 s [vector] unzip3: OK
  5892. 1269.66 s [vector] +++ OK, passed 100 tests.
  5893. 1269.66 s [vector] indexed: OK
  5894. 1269.67 s [vector] +++ OK, passed 100 tests.
  5895. 1269.68 s [vector] update: OK
  5896. 1269.68 s [vector] +++ OK, passed 100 tests.
  5897. 1269.68 s [vector] concat: OK (0.02s)
  5898. 1269.68 s [vector] +++ OK, passed 100 tests.
  5899. 1269.68 s [vector] mempty: OK
  5900. 1269.68 s [vector] +++ OK, passed 100 tests.
  5901. 1269.69 s [vector] mappend: OK
  5902. 1269.70 s [vector] +++ OK, passed 100 tests.
  5903. 1269.70 s [vector] mconcat: OK (0.01s)
  5904. 1269.70 s [vector] +++ OK, passed 100 tests.
  5905. 1269.70 s [vector] fmap: OK
  5906. 1269.70 s [vector] +++ OK, passed 100 tests.
  5907. 1269.72 s [vector] return: OK
  5908. 1269.72 s [vector] +++ OK, passed 100 tests.
  5909. 1269.72 s [vector] bind: OK (0.02s)
  5910. 1269.72 s [vector] +++ OK, passed 100 tests.
  5911. 1269.72 s [vector] mzip: OK
  5912. 1269.72 s [vector] +++ OK, passed 100 tests.
  5913. 1269.72 s [vector] munzip: OK
  5914. 1269.72 s [vector] +++ OK, passed 100 tests.
  5915. 1269.74 s [vector] applicative_pure: OK
  5916. 1269.74 s [vector] +++ OK, passed 100 tests.
  5917. 1269.75 s [vector] applicative_appl: OK (0.03s)
  5918. 1269.75 s [vector] +++ OK, passed 100 tests.
  5919. 1269.75 s [vector] alternative_empty: OK
  5920. 1269.75 s [vector] +++ OK, passed 100 tests.
  5921. 1269.76 s [vector] alternative_or: OK
  5922. 1269.76 s [vector] +++ OK, passed 100 tests.
  5923. 1269.80 s [vector] sequence: OK (0.03s)
  5924. 1269.80 s [vector] +++ OK, passed 100 tests.
  5925. 1269.80 s [vector] sequence_: OK (0.01s)
  5926. 1269.80 s [vector] +++ OK, passed 100 tests.
  5927. 1269.80 s [vector] glength: OK
  5928. 1269.80 s [vector] +++ OK, passed 100 tests.
  5929. 1269.80 s [vector] and: OK
  5930. 1269.80 s [vector] +++ OK, passed 100 tests.
  5931. 1269.80 s [vector] or: OK
  5932. 1269.80 s [vector] +++ OK, passed 100 tests.
  5933. 1269.80 s [vector] Int
  5934. 1269.80 s [vector] fromList.toList == id: OK
  5935. 1269.80 s [vector] +++ OK, passed 100 tests.
  5936. 1269.80 s [vector] toList.fromList == id: OK
  5937. 1269.80 s [vector] +++ OK, passed 100 tests.
  5938. 1269.80 s [vector] unstream.stream == id: OK
  5939. 1269.80 s [vector] +++ OK, passed 100 tests.
  5940. 1269.80 s [vector] stream.unstream == id: OK
  5941. 1269.80 s [vector] +++ OK, passed 100 tests.
  5942. 1269.80 s [vector] eq: OK
  5943. 1269.80 s [vector] +++ OK, passed 100 tests.
  5944. 1269.80 s [vector] length: OK
  5945. 1269.80 s [vector] +++ OK, passed 100 tests.
  5946. 1269.80 s [vector] null: OK
  5947. 1269.81 s [vector] +++ OK, passed 100 tests.
  5948. 1269.81 s [vector] index: OK
  5949. 1269.81 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5950. 1269.81 s [vector] safeIndex: OK
  5951. 1269.81 s [vector] +++ OK, passed 100 tests.
  5952. 1269.81 s [vector] head: OK
  5953. 1269.81 s [vector] +++ OK, passed 100 tests; 22 discarded.
  5954. 1269.81 s [vector] last: OK
  5955. 1269.81 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5956. 1269.81 s [vector] unsafeIndex: OK
  5957. 1269.81 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5958. 1269.81 s [vector] unsafeHead: OK
  5959. 1269.81 s [vector] +++ OK, passed 100 tests; 20 discarded.
  5960. 1269.81 s [vector] unsafeLast: OK
  5961. 1269.81 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5962. 1269.81 s [vector] slice: OK
  5963. 1269.81 s [vector] +++ OK, passed 100 tests.
  5964. 1269.81 s [vector] init: OK
  5965. 1269.81 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5966. 1269.81 s [vector] tail: OK
  5967. 1269.81 s [vector] +++ OK, passed 100 tests; 12 discarded.
  5968. 1269.81 s [vector] take: OK
  5969. 1269.81 s [vector] +++ OK, passed 100 tests.
  5970. 1269.81 s [vector] drop: OK
  5971. 1269.81 s [vector] +++ OK, passed 100 tests.
  5972. 1269.81 s [vector] splitAt: OK
  5973. 1269.81 s [vector] +++ OK, passed 100 tests.
  5974. 1269.81 s [vector] empty: OK
  5975. 1269.81 s [vector] +++ OK, passed 100 tests.
  5976. 1269.81 s [vector] singleton: OK
  5977. 1269.81 s [vector] +++ OK, passed 100 tests.
  5978. 1269.81 s [vector] replicate: OK
  5979. 1269.81 s [vector] +++ OK, passed 100 tests.
  5980. 1269.81 s [vector] generate: OK
  5981. 1269.81 s [vector] +++ OK, passed 100 tests.
  5982. 1269.81 s [vector] iterateN: OK
  5983. 1269.81 s [vector] +++ OK, passed 100 tests.
  5984. 1269.88 s [vector] iterateNM: OK (0.07s)
  5985. 1269.88 s [vector] +++ OK, passed 100 tests.
  5986. 1269.91 s [vector] generateM: OK
  5987. 1269.91 s [vector] +++ OK, passed 100 tests.
  5988. 1269.91 s [vector] replicateM: OK
  5989. 1269.91 s [vector] +++ OK, passed 100 tests.
  5990. 1269.92 s [vector] create: OK
  5991. 1269.92 s [vector] +++ OK, passed 100 tests.
  5992. 1269.92 s [vector] createT: OK
  5993. 1269.92 s [vector] +++ OK, passed 100 tests.
  5994. 1269.92 s [vector] unfoldr: OK
  5995. 1269.92 s [vector] +++ OK, passed 100 tests.
  5996. 1269.92 s [vector] unfoldrN: OK
  5997. 1269.92 s [vector] +++ OK, passed 100 tests.
  5998. 1269.92 s [vector] unfoldrExactN: OK
  5999. 1269.92 s [vector] +++ OK, passed 100 tests.
  6000. 1269.92 s [vector] unfoldrM: OK
  6001. 1269.92 s [vector] +++ OK, passed 100 tests.
  6002. 1269.94 s [vector] unfoldrNM: OK
  6003. 1269.94 s [vector] +++ OK, passed 100 tests.
  6004. 1269.95 s [vector] unfoldrExactNM: OK (0.02s)
  6005. 1269.96 s [vector] +++ OK, passed 100 tests.
  6006. 1269.96 s [vector] constructN: OK (0.02s)
  6007. 1269.96 s [vector] +++ OK, passed 100 tests.
  6008. 1269.96 s [vector] constructrN: OK
  6009. 1269.96 s [vector] +++ OK, passed 100 tests.
  6010. 1269.96 s [vector] cons: OK
  6011. 1269.96 s [vector] +++ OK, passed 100 tests.
  6012. 1269.96 s [vector] snoc: OK
  6013. 1269.96 s [vector] +++ OK, passed 100 tests.
  6014. 1269.96 s [vector] append: OK
  6015. 1269.97 s [vector] +++ OK, passed 100 tests.
  6016. 1269.97 s [vector] concat: OK (0.01s)
  6017. 1269.97 s [vector] +++ OK, passed 100 tests.
  6018. 1269.97 s [vector] force: OK
  6019. 1269.98 s [vector] +++ OK, passed 100 tests.
  6020. 1269.98 s [vector] upd: OK
  6021. 1269.98 s [vector] +++ OK, passed 100 tests.
  6022. 1269.98 s [vector] accum: OK
  6023. 1269.98 s [vector] +++ OK, passed 100 tests.
  6024. 1269.98 s [vector] reverse: OK
  6025. 1269.98 s [vector] +++ OK, passed 100 tests.
  6026. 1269.98 s [vector] backpermute: OK
  6027. 1269.98 s [vector] +++ OK, passed 100 tests.
  6028. 1269.99 s [vector] map: OK
  6029. 1269.99 s [vector] +++ OK, passed 100 tests.
  6030. 1269.99 s [vector] imap: OK
  6031. 1269.99 s [vector] +++ OK, passed 100 tests.
  6032. 1269.99 s [vector] concatMap: OK
  6033. 1269.99 s [vector] +++ OK, passed 100 tests.
  6034. 1269.99 s [vector] mapM: OK
  6035. 1270.00 s [vector] +++ OK, passed 100 tests.
  6036. 1270.03 s [vector] mapM_: OK (0.03s)
  6037. 1270.03 s [vector] +++ OK, passed 100 tests.
  6038. 1270.04 s [vector] forM: OK
  6039. 1270.04 s [vector] +++ OK, passed 100 tests.
  6040. 1270.08 s [vector] forM_: OK (0.04s)
  6041. 1270.08 s [vector] +++ OK, passed 100 tests.
  6042. 1270.08 s [vector] imapM: OK
  6043. 1270.09 s [vector] +++ OK, passed 100 tests.
  6044. 1270.11 s [vector] imapM_: OK (0.03s)
  6045. 1270.11 s [vector] +++ OK, passed 100 tests.
  6046. 1270.11 s [vector] zipWith: OK
  6047. 1270.11 s [vector] +++ OK, passed 100 tests.
  6048. 1270.12 s [vector] zipWith3: OK
  6049. 1270.12 s [vector] +++ OK, passed 100 tests.
  6050. 1270.12 s [vector] izipWith: OK
  6051. 1270.12 s [vector] +++ OK, passed 100 tests.
  6052. 1270.12 s [vector] izipWith3: OK
  6053. 1270.13 s [vector] +++ OK, passed 100 tests.
  6054. 1270.14 s [vector] izipWithM: OK
  6055. 1270.14 s [vector] +++ OK, passed 100 tests.
  6056. 1270.15 s [vector] izipWithM_: OK (0.02s)
  6057. 1270.15 s [vector] +++ OK, passed 100 tests.
  6058. 1270.16 s [vector] zipWithM: OK
  6059. 1270.16 s [vector] +++ OK, passed 100 tests.
  6060. 1270.17 s [vector] zipWithM_: OK (0.01s)
  6061. 1270.17 s [vector] +++ OK, passed 100 tests.
  6062. 1270.17 s [vector] filter: OK
  6063. 1270.17 s [vector] +++ OK, passed 100 tests.
  6064. 1270.17 s [vector] ifilter: OK
  6065. 1270.17 s [vector] +++ OK, passed 100 tests.
  6066. 1270.20 s [vector] filterM: OK (0.03s)
  6067. 1270.20 s [vector] +++ OK, passed 100 tests.
  6068. 1270.21 s [vector] uniq: OK
  6069. 1270.21 s [vector] +++ OK, passed 100 tests.
  6070. 1270.21 s [vector] mapMaybe: OK
  6071. 1270.21 s [vector] +++ OK, passed 100 tests.
  6072. 1270.21 s [vector] imapMaybe: OK
  6073. 1270.21 s [vector] +++ OK, passed 100 tests.
  6074. 1270.21 s [vector] takeWhile: OK
  6075. 1270.21 s [vector] +++ OK, passed 100 tests.
  6076. 1270.21 s [vector] dropWhile: OK
  6077. 1270.21 s [vector] +++ OK, passed 100 tests.
  6078. 1270.21 s [vector] partition: OK
  6079. 1270.21 s [vector] +++ OK, passed 100 tests.
  6080. 1270.22 s [vector] partitionWith: OK
  6081. 1270.22 s [vector] +++ OK, passed 100 tests.
  6082. 1270.22 s [vector] span: OK
  6083. 1270.22 s [vector] +++ OK, passed 100 tests.
  6084. 1270.22 s [vector] break: OK
  6085. 1270.22 s [vector] +++ OK, passed 100 tests.
  6086. 1270.23 s [vector] spanR: OK
  6087. 1270.23 s [vector] +++ OK, passed 100 tests.
  6088. 1270.23 s [vector] breakR: OK
  6089. 1270.23 s [vector] +++ OK, passed 100 tests.
  6090. 1270.23 s [vector] groupBy: OK
  6091. 1270.23 s [vector] +++ OK, passed 100 tests.
  6092. 1270.23 s [vector] elem: OK
  6093. 1270.23 s [vector] +++ OK, passed 100 tests.
  6094. 1270.23 s [vector] notElem: OK
  6095. 1270.23 s [vector] +++ OK, passed 100 tests.
  6096. 1270.23 s [vector] find: OK
  6097. 1270.23 s [vector] +++ OK, passed 100 tests.
  6098. 1270.23 s [vector] findIndex: OK
  6099. 1270.23 s [vector] +++ OK, passed 100 tests.
  6100. 1270.23 s [vector] findIndexR: OK
  6101. 1270.23 s [vector] +++ OK, passed 100 tests.
  6102. 1270.24 s [vector] findIndices: OK
  6103. 1270.24 s [vector] +++ OK, passed 100 tests.
  6104. 1270.24 s [vector] elemIndex: OK
  6105. 1270.24 s [vector] +++ OK, passed 100 tests.
  6106. 1270.24 s [vector] elemIndices: OK
  6107. 1270.24 s [vector] +++ OK, passed 100 tests.
  6108. 1270.24 s [vector] foldl: OK
  6109. 1270.24 s [vector] +++ OK, passed 100 tests.
  6110. 1270.25 s [vector] foldl1: OK
  6111. 1270.25 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6112. 1270.25 s [vector] foldl': OK
  6113. 1270.25 s [vector] +++ OK, passed 100 tests.
  6114. 1270.26 s [vector] foldl1': OK
  6115. 1270.26 s [vector] +++ OK, passed 100 tests; 20 discarded.
  6116. 1270.26 s [vector] foldr: OK
  6117. 1270.26 s [vector] +++ OK, passed 100 tests.
  6118. 1270.27 s [vector] foldr1: OK
  6119. 1270.27 s [vector] +++ OK, passed 100 tests; 20 discarded.
  6120. 1270.27 s [vector] foldr': OK
  6121. 1270.27 s [vector] +++ OK, passed 100 tests.
  6122. 1270.27 s [vector] foldr1': OK
  6123. 1270.27 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6124. 1270.28 s [vector] ifoldl: OK
  6125. 1270.28 s [vector] +++ OK, passed 100 tests.
  6126. 1270.28 s [vector] ifoldl': OK
  6127. 1270.28 s [vector] +++ OK, passed 100 tests.
  6128. 1270.28 s [vector] ifoldr: OK
  6129. 1270.28 s [vector] +++ OK, passed 100 tests.
  6130. 1270.29 s [vector] ifoldr': OK
  6131. 1270.29 s [vector] +++ OK, passed 100 tests.
  6132. 1270.29 s [vector] ifoldM: OK
  6133. 1270.29 s [vector] +++ OK, passed 100 tests.
  6134. 1270.29 s [vector] ifoldM': OK
  6135. 1270.29 s [vector] +++ OK, passed 100 tests.
  6136. 1270.34 s [vector] ifoldM_: OK (0.04s)
  6137. 1270.34 s [vector] +++ OK, passed 100 tests.
  6138. 1270.37 s [vector] ifoldM'_: OK (0.03s)
  6139. 1270.37 s [vector] +++ OK, passed 100 tests.
  6140. 1270.37 s [vector] all: OK
  6141. 1270.37 s [vector] +++ OK, passed 100 tests.
  6142. 1270.37 s [vector] any: OK
  6143. 1270.37 s [vector] +++ OK, passed 100 tests.
  6144. 1270.37 s [vector] prescanl: OK
  6145. 1270.37 s [vector] +++ OK, passed 100 tests.
  6146. 1270.37 s [vector] prescanl': OK
  6147. 1270.37 s [vector] +++ OK, passed 100 tests.
  6148. 1270.37 s [vector] postscanl: OK
  6149. 1270.37 s [vector] +++ OK, passed 100 tests.
  6150. 1270.40 s [vector] postscanl': OK
  6151. 1270.40 s [vector] +++ OK, passed 100 tests.
  6152. 1270.40 s [vector] scanl: OK (0.01s)
  6153. 1270.40 s [vector] +++ OK, passed 100 tests.
  6154. 1270.42 s [vector] scanl': OK (0.02s)
  6155. 1270.42 s [vector] +++ OK, passed 100 tests.
  6156. 1270.42 s [vector] scanl1: OK (0.01s)
  6157. 1270.42 s [vector] +++ OK, passed 100 tests.
  6158. 1270.44 s [vector] scanl1': OK
  6159. 1270.44 s [vector] +++ OK, passed 100 tests.
  6160. 1270.46 s [vector] iscanl: OK (0.01s)
  6161. 1270.46 s [vector] +++ OK, passed 100 tests.
  6162. 1270.47 s [vector] iscanl': OK (0.02s)
  6163. 1270.47 s [vector] +++ OK, passed 100 tests.
  6164. 1270.47 s [vector] prescanr: OK
  6165. 1270.47 s [vector] +++ OK, passed 100 tests.
  6166. 1270.48 s [vector] prescanr': OK
  6167. 1270.48 s [vector] +++ OK, passed 100 tests.
  6168. 1270.50 s [vector] postscanr: OK
  6169. 1270.50 s [vector] +++ OK, passed 100 tests.
  6170. 1270.50 s [vector] postscanr': OK (0.01s)
  6171. 1270.50 s [vector] +++ OK, passed 100 tests.
  6172. 1270.50 s [vector] scanr: OK
  6173. 1270.50 s [vector] +++ OK, passed 100 tests.
  6174. 1270.51 s [vector] scanr': OK
  6175. 1270.51 s [vector] +++ OK, passed 100 tests.
  6176. 1270.54 s [vector] scanr1: OK
  6177. 1270.54 s [vector] +++ OK, passed 100 tests.
  6178. 1270.54 s [vector] scanr1': OK (0.02s)
  6179. 1270.54 s [vector] +++ OK, passed 100 tests.
  6180. 1270.55 s [vector] iscanr: OK
  6181. 1270.55 s [vector] +++ OK, passed 100 tests.
  6182. 1270.56 s [vector] iscanr': OK
  6183. 1270.56 s [vector] +++ OK, passed 100 tests.
  6184. 1270.56 s [vector] mut_read: OK
  6185. 1270.56 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6186. 1270.56 s [vector] mut_write: OK
  6187. 1270.56 s [vector] +++ OK, passed 100 tests; 20 discarded.
  6188. 1270.56 s [vector] mut_modify: OK
  6189. 1270.56 s [vector] +++ OK, passed 100 tests; 22 discarded.
  6190. 1270.57 s [vector] mut_generate: OK
  6191. 1270.57 s [vector] +++ OK, passed 100 tests.
  6192. 1270.60 s [vector] mut_generateM: OK (0.01s)
  6193. 1270.60 s [vector] +++ OK, passed 100 tests.
  6194. 1270.61 s [vector] mut_mapM_: OK (0.02s)
  6195. 1270.61 s [vector] +++ OK, passed 100 tests.
  6196. 1270.61 s [vector] mut_imapM_: OK (0.02s)
  6197. 1270.61 s [vector] +++ OK, passed 100 tests.
  6198. 1270.66 s [vector] mut_forM_: OK (0.02s)
  6199. 1270.66 s [vector] +++ OK, passed 100 tests.
  6200. 1270.67 s [vector] mut_iforM_: OK (0.03s)
  6201. 1270.67 s [vector] +++ OK, passed 100 tests.
  6202. 1270.67 s [vector] mut_foldr: OK
  6203. 1270.67 s [vector] +++ OK, passed 100 tests.
  6204. 1270.68 s [vector] mut_foldr': OK
  6205. 1270.68 s [vector] +++ OK, passed 100 tests.
  6206. 1270.69 s [vector] mut_foldl: OK
  6207. 1270.69 s [vector] +++ OK, passed 100 tests.
  6208. 1270.69 s [vector] mut_foldl': OK
  6209. 1270.69 s [vector] +++ OK, passed 100 tests.
  6210. 1270.70 s [vector] mut_ifoldr: OK
  6211. 1270.71 s [vector] +++ OK, passed 100 tests.
  6212. 1270.71 s [vector] mut_ifoldr': OK
  6213. 1270.71 s [vector] +++ OK, passed 100 tests.
  6214. 1270.71 s [vector] mut_ifoldl: OK
  6215. 1270.71 s [vector] +++ OK, passed 100 tests.
  6216. 1270.71 s [vector] mut_ifoldl': OK
  6217. 1270.71 s [vector] +++ OK, passed 100 tests.
  6218. 1270.71 s [vector] mut_foldM: OK
  6219. 1270.71 s [vector] +++ OK, passed 100 tests.
  6220. 1270.71 s [vector] mut_foldM': OK
  6221. 1270.71 s [vector] +++ OK, passed 100 tests.
  6222. 1270.71 s [vector] mut_foldrM: OK
  6223. 1270.71 s [vector] +++ OK, passed 100 tests.
  6224. 1270.72 s [vector] mut_foldrM': OK
  6225. 1270.72 s [vector] +++ OK, passed 100 tests.
  6226. 1270.72 s [vector] mut_ifoldM: OK
  6227. 1270.72 s [vector] +++ OK, passed 100 tests.
  6228. 1270.73 s [vector] mut_ifoldM': OK
  6229. 1270.73 s [vector] +++ OK, passed 100 tests.
  6230. 1270.73 s [vector] mut_ifoldrM: OK
  6231. 1270.73 s [vector] +++ OK, passed 100 tests.
  6232. 1270.73 s [vector] mut_ifoldrM': OK
  6233. 1270.73 s [vector] +++ OK, passed 100 tests.
  6234. 1270.73 s [vector] compare: OK
  6235. 1270.73 s [vector] +++ OK, passed 100 tests.
  6236. 1270.73 s [vector] maximum: OK
  6237. 1270.74 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6238. 1270.74 s [vector] minimum: OK
  6239. 1270.74 s [vector] +++ OK, passed 100 tests; 10 discarded.
  6240. 1270.74 s [vector] minIndex: OK
  6241. 1270.74 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6242. 1270.74 s [vector] maxIndex: OK
  6243. 1270.74 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6244. 1270.74 s [vector] maximumBy: OK
  6245. 1270.74 s [vector] +++ OK, passed 100 tests; 11 discarded.
  6246. 1270.74 s [vector] minimumBy: OK
  6247. 1270.74 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6248. 1270.74 s [vector] maximumOn: OK
  6249. 1270.74 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6250. 1270.74 s [vector] minimumOn: OK
  6251. 1270.74 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6252. 1270.74 s [vector] maxIndexBy: OK
  6253. 1270.74 s [vector] +++ OK, passed 100 tests; 21 discarded.
  6254. 1270.74 s [vector] minIndexBy: OK
  6255. 1270.74 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6256. 1270.74 s [vector] ListFirstMaxIndexWins: OK
  6257. 1270.74 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6258. 1270.75 s [vector] FalseListFirstMaxIndexWins: OK
  6259. 1270.75 s [vector] +++ OK, failed as expected. (after 1 test):
  6260. 1270.75 s [vector] Exception:
  6261. 1270.75 s [vector] Prelude.foldr1: empty list
  6262. 1270.75 s [vector] CallStack (from HasCallStack):
  6263. 1270.75 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  6264. 1270.75 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  6265. 1270.75 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  6266. 1270.75 s [vector] []
  6267. 1270.75 s [vector] zip: OK
  6268. 1270.75 s [vector] +++ OK, passed 100 tests.
  6269. 1270.75 s [vector] zip3: OK
  6270. 1270.75 s [vector] +++ OK, passed 100 tests.
  6271. 1270.75 s [vector] unzip: OK
  6272. 1270.75 s [vector] +++ OK, passed 100 tests.
  6273. 1270.75 s [vector] unzip3: OK
  6274. 1270.75 s [vector] +++ OK, passed 100 tests.
  6275. 1270.75 s [vector] indexed: OK
  6276. 1270.75 s [vector] +++ OK, passed 100 tests.
  6277. 1270.75 s [vector] update: OK
  6278. 1270.75 s [vector] +++ OK, passed 100 tests.
  6279. 1270.76 s [vector] concat: OK
  6280. 1270.76 s [vector] +++ OK, passed 100 tests.
  6281. 1270.76 s [vector] mempty: OK
  6282. 1270.76 s [vector] +++ OK, passed 100 tests.
  6283. 1270.77 s [vector] mappend: OK
  6284. 1270.78 s [vector] +++ OK, passed 100 tests.
  6285. 1270.79 s [vector] mconcat: OK (0.02s)
  6286. 1270.79 s [vector] +++ OK, passed 100 tests.
  6287. 1270.79 s [vector] fmap: OK
  6288. 1270.79 s [vector] +++ OK, passed 100 tests.
  6289. 1270.79 s [vector] return: OK
  6290. 1270.79 s [vector] +++ OK, passed 100 tests.
  6291. 1270.81 s [vector] bind: OK (0.01s)
  6292. 1270.81 s [vector] +++ OK, passed 100 tests.
  6293. 1270.81 s [vector] mzip: OK
  6294. 1270.81 s [vector] +++ OK, passed 100 tests.
  6295. 1270.81 s [vector] munzip: OK
  6296. 1270.81 s [vector] +++ OK, passed 100 tests.
  6297. 1270.81 s [vector] applicative_pure: OK
  6298. 1270.81 s [vector] +++ OK, passed 100 tests.
  6299. 1270.84 s [vector] applicative_appl: OK (0.03s)
  6300. 1270.84 s [vector] +++ OK, passed 100 tests.
  6301. 1270.84 s [vector] alternative_empty: OK
  6302. 1270.85 s [vector] +++ OK, passed 100 tests.
  6303. 1270.85 s [vector] alternative_or: OK
  6304. 1270.85 s [vector] +++ OK, passed 100 tests.
  6305. 1270.92 s [vector] sequence: OK (0.06s)
  6306. 1270.92 s [vector] +++ OK, passed 100 tests.
  6307. 1270.94 s [vector] sequence_: OK (0.03s)
  6308. 1270.94 s [vector] +++ OK, passed 100 tests.
  6309. 1270.94 s [vector] glength: OK
  6310. 1270.94 s [vector] +++ OK, passed 100 tests.
  6311. 1270.94 s [vector] sum: OK
  6312. 1270.94 s [vector] +++ OK, passed 100 tests.
  6313. 1270.94 s [vector] product: OK
  6314. 1270.94 s [vector] +++ OK, passed 100 tests.
  6315. 1270.94 s [vector] enumFromN: OK
  6316. 1270.94 s [vector] +++ OK, passed 100 tests.
  6317. 1270.95 s [vector] enumFromThenN: OK
  6318. 1270.95 s [vector] +++ OK, passed 100 tests.
  6319. 1270.95 s [vector] enumFromTo: OK
  6320. 1270.95 s [vector] +++ OK, passed 100 tests.
  6321. 1270.95 s [vector] enumFromThenTo: OK
  6322. 1270.95 s [vector] +++ OK, passed 100 tests; 11 discarded.
  6323. 1270.95 s [vector] unstream
  6324. 1270.95 s [vector] unstream == vunstream (exact): OK
  6325. 1270.95 s [vector] +++ OK, passed 100 tests.
  6326. 1270.95 s [vector] unstream == vunstream (unknown): OK
  6327. 1270.95 s [vector] +++ OK, passed 100 tests.
  6328. 1270.95 s [vector] unstreamR ~= vunstream (exact): OK
  6329. 1270.95 s [vector] +++ OK, passed 100 tests.
  6330. 1270.96 s [vector] unstreamR ~= vunstream (unknown): OK
  6331. 1270.96 s [vector] +++ OK, passed 100 tests.
  6332. 1270.96 s [vector] Tests.Vector.Primitive
  6333. 1270.96 s [vector] Int
  6334. 1270.96 s [vector] fromList.toList == id: OK
  6335. 1270.96 s [vector] +++ OK, passed 100 tests.
  6336. 1270.96 s [vector] toList.fromList == id: OK
  6337. 1270.96 s [vector] +++ OK, passed 100 tests.
  6338. 1270.96 s [vector] unstream.stream == id: OK
  6339. 1270.96 s [vector] +++ OK, passed 100 tests.
  6340. 1270.96 s [vector] stream.unstream == id: OK
  6341. 1270.96 s [vector] +++ OK, passed 100 tests.
  6342. 1270.96 s [vector] eq: OK
  6343. 1270.96 s [vector] +++ OK, passed 100 tests.
  6344. 1270.96 s [vector] length: OK
  6345. 1270.96 s [vector] +++ OK, passed 100 tests.
  6346. 1270.96 s [vector] null: OK
  6347. 1270.96 s [vector] +++ OK, passed 100 tests.
  6348. 1270.96 s [vector] index: OK
  6349. 1270.96 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6350. 1270.96 s [vector] safeIndex: OK
  6351. 1270.96 s [vector] +++ OK, passed 100 tests.
  6352. 1270.96 s [vector] head: OK
  6353. 1270.96 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6354. 1270.96 s [vector] last: OK
  6355. 1270.96 s [vector] +++ OK, passed 100 tests; 11 discarded.
  6356. 1270.96 s [vector] unsafeIndex: OK
  6357. 1270.96 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6358. 1270.96 s [vector] unsafeHead: OK
  6359. 1270.96 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6360. 1270.96 s [vector] unsafeLast: OK
  6361. 1270.96 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6362. 1270.97 s [vector] slice: OK
  6363. 1270.97 s [vector] +++ OK, passed 100 tests.
  6364. 1270.97 s [vector] init: OK
  6365. 1270.97 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6366. 1270.97 s [vector] tail: OK
  6367. 1270.97 s [vector] +++ OK, passed 100 tests; 20 discarded.
  6368. 1270.97 s [vector] take: OK
  6369. 1270.97 s [vector] +++ OK, passed 100 tests.
  6370. 1270.97 s [vector] drop: OK
  6371. 1270.97 s [vector] +++ OK, passed 100 tests.
  6372. 1270.97 s [vector] splitAt: OK
  6373. 1270.97 s [vector] +++ OK, passed 100 tests.
  6374. 1270.97 s [vector] empty: OK
  6375. 1270.97 s [vector] +++ OK, passed 100 tests.
  6376. 1270.97 s [vector] singleton: OK
  6377. 1270.97 s [vector] +++ OK, passed 100 tests.
  6378. 1270.97 s [vector] replicate: OK
  6379. 1270.97 s [vector] +++ OK, passed 100 tests.
  6380. 1270.97 s [vector] generate: OK
  6381. 1270.97 s [vector] +++ OK, passed 100 tests.
  6382. 1270.97 s [vector] iterateN: OK
  6383. 1270.97 s [vector] +++ OK, passed 100 tests.
  6384. 1271.04 s [vector] iterateNM: OK (0.05s)
  6385. 1271.04 s [vector] +++ OK, passed 100 tests.
  6386. 1271.04 s [vector] generateM: OK (0.02s)
  6387. 1271.04 s [vector] +++ OK, passed 100 tests.
  6388. 1271.05 s [vector] replicateM: OK
  6389. 1271.05 s [vector] +++ OK, passed 100 tests.
  6390. 1271.05 s [vector] create: OK
  6391. 1271.05 s [vector] +++ OK, passed 100 tests.
  6392. 1271.05 s [vector] createT: OK
  6393. 1271.05 s [vector] +++ OK, passed 100 tests.
  6394. 1271.05 s [vector] unfoldr: OK
  6395. 1271.06 s [vector] +++ OK, passed 100 tests.
  6396. 1271.06 s [vector] unfoldrN: OK
  6397. 1271.09 s [vector] +++ OK, passed 100 tests.
  6398. 1271.10 s [vector] unfoldrExactN: OK
  6399. 1271.10 s [vector] +++ OK, passed 100 tests.
  6400. 1271.10 s [vector] unfoldrM: OK
  6401. 1271.11 s [vector] +++ OK, passed 100 tests.
  6402. 1271.11 s [vector] unfoldrNM: OK
  6403. 1271.11 s [vector] +++ OK, passed 100 tests.
  6404. 1271.13 s [vector] unfoldrExactNM: OK (0.07s)
  6405. 1271.13 s [vector] +++ OK, passed 100 tests.
  6406. 1271.13 s [vector] constructN: OK
  6407. 1271.14 s [vector] +++ OK, passed 100 tests.
  6408. 1271.14 s [vector] constructrN: OK
  6409. 1271.14 s [vector] +++ OK, passed 100 tests.
  6410. 1271.14 s [vector] cons: OK
  6411. 1271.14 s [vector] +++ OK, passed 100 tests.
  6412. 1271.14 s [vector] snoc: OK
  6413. 1271.15 s [vector] +++ OK, passed 100 tests.
  6414. 1271.16 s [vector] append: OK
  6415. 1271.16 s [vector] +++ OK, passed 100 tests.
  6416. 1271.17 s [vector] concat: OK (0.02s)
  6417. 1271.17 s [vector] +++ OK, passed 100 tests.
  6418. 1271.17 s [vector] force: OK
  6419. 1271.17 s [vector] +++ OK, passed 100 tests.
  6420. 1271.17 s [vector] upd: OK
  6421. 1271.18 s [vector] +++ OK, passed 100 tests.
  6422. 1271.18 s [vector] accum: OK
  6423. 1271.18 s [vector] +++ OK, passed 100 tests.
  6424. 1271.18 s [vector] reverse: OK
  6425. 1271.19 s [vector] +++ OK, passed 100 tests.
  6426. 1271.19 s [vector] backpermute: OK
  6427. 1271.19 s [vector] +++ OK, passed 100 tests.
  6428. 1271.19 s [vector] map: OK
  6429. 1271.20 s [vector] +++ OK, passed 100 tests.
  6430. 1271.20 s [vector] imap: OK
  6431. 1271.21 s [vector] +++ OK, passed 100 tests.
  6432. 1271.21 s [vector] concatMap: OK
  6433. 1271.21 s [vector] +++ OK, passed 100 tests.
  6434. 1271.21 s [vector] mapM: OK
  6435. 1271.21 s [vector] +++ OK, passed 100 tests.
  6436. 1271.23 s [vector] mapM_: OK (0.02s)
  6437. 1271.36 s [vector] +++ OK, passed 100 tests.
  6438. 1271.36 s [vector] forM: OK
  6439. 1271.36 s [vector] +++ OK, passed 100 tests.
  6440. 1271.36 s [vector] forM_: OK (0.02s)
  6441. 1271.36 s [vector] +++ OK, passed 100 tests.
  6442. 1271.36 s [vector] imapM: OK
  6443. 1271.36 s [vector] +++ OK, passed 100 tests.
  6444. 1271.36 s [vector] imapM_: OK (0.05s)
  6445. 1271.36 s [vector] +++ OK, passed 100 tests.
  6446. 1271.36 s [vector] zipWith: OK
  6447. 1271.36 s [vector] +++ OK, passed 100 tests.
  6448. 1271.36 s [vector] zipWith3: OK
  6449. 1271.36 s [vector] +++ OK, passed 100 tests.
  6450. 1271.36 s [vector] izipWith: OK
  6451. 1271.36 s [vector] +++ OK, passed 100 tests.
  6452. 1271.36 s [vector] izipWith3: OK
  6453. 1271.36 s [vector] +++ OK, passed 100 tests.
  6454. 1271.36 s [vector] izipWithM: OK
  6455. 1271.36 s [vector] +++ OK, passed 100 tests.
  6456. 1271.36 s [vector] izipWithM_: OK (0.02s)
  6457. 1271.36 s [vector] +++ OK, passed 100 tests.
  6458. 1271.37 s [vector] zipWithM: OK
  6459. 1271.38 s [vector] +++ OK, passed 100 tests.
  6460. 1271.38 s [vector] zipWithM_: OK (0.02s)
  6461. 1271.38 s [vector] +++ OK, passed 100 tests.
  6462. 1271.39 s [vector] filter: OK
  6463. 1271.39 s [vector] +++ OK, passed 100 tests.
  6464. 1271.39 s [vector] ifilter: OK
  6465. 1271.39 s [vector] +++ OK, passed 100 tests.
  6466. 1271.43 s [vector] filterM: OK (0.04s)
  6467. 1271.43 s [vector] +++ OK, passed 100 tests.
  6468. 1271.43 s [vector] uniq: OK
  6469. 1271.44 s [vector] +++ OK, passed 100 tests.
  6470. 1271.44 s [vector] mapMaybe: OK
  6471. 1271.44 s [vector] +++ OK, passed 100 tests.
  6472. 1271.44 s [vector] imapMaybe: OK
  6473. 1271.44 s [vector] +++ OK, passed 100 tests.
  6474. 1271.44 s [vector] takeWhile: OK
  6475. 1271.44 s [vector] +++ OK, passed 100 tests.
  6476. 1271.45 s [vector] dropWhile: OK
  6477. 1271.45 s [vector] +++ OK, passed 100 tests.
  6478. 1271.45 s [vector] partition: OK
  6479. 1271.45 s [vector] +++ OK, passed 100 tests.
  6480. 1271.45 s [vector] partitionWith: OK
  6481. 1271.45 s [vector] +++ OK, passed 100 tests.
  6482. 1271.46 s [vector] span: OK
  6483. 1271.46 s [vector] +++ OK, passed 100 tests.
  6484. 1271.46 s [vector] break: OK
  6485. 1271.46 s [vector] +++ OK, passed 100 tests.
  6486. 1271.46 s [vector] spanR: OK
  6487. 1271.46 s [vector] +++ OK, passed 100 tests.
  6488. 1271.46 s [vector] breakR: OK
  6489. 1271.46 s [vector] +++ OK, passed 100 tests.
  6490. 1271.46 s [vector] groupBy: OK
  6491. 1271.46 s [vector] +++ OK, passed 100 tests.
  6492. 1271.46 s [vector] elem: OK
  6493. 1271.46 s [vector] +++ OK, passed 100 tests.
  6494. 1271.47 s [vector] notElem: OK
  6495. 1271.47 s [vector] +++ OK, passed 100 tests.
  6496. 1271.47 s [vector] find: OK
  6497. 1271.47 s [vector] +++ OK, passed 100 tests.
  6498. 1271.47 s [vector] findIndex: OK
  6499. 1271.47 s [vector] +++ OK, passed 100 tests.
  6500. 1271.47 s [vector] findIndexR: OK
  6501. 1271.47 s [vector] +++ OK, passed 100 tests.
  6502. 1271.47 s [vector] findIndices: OK
  6503. 1271.47 s [vector] +++ OK, passed 100 tests.
  6504. 1271.47 s [vector] elemIndex: OK
  6505. 1271.47 s [vector] +++ OK, passed 100 tests.
  6506. 1271.47 s [vector] elemIndices: OK
  6507. 1271.47 s [vector] +++ OK, passed 100 tests.
  6508. 1271.48 s [vector] foldl: OK
  6509. 1271.48 s [vector] +++ OK, passed 100 tests.
  6510. 1271.48 s [vector] foldl1: OK
  6511. 1271.48 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6512. 1271.48 s [vector] foldl': OK
  6513. 1271.49 s [vector] +++ OK, passed 100 tests.
  6514. 1271.49 s [vector] foldl1': OK
  6515. 1271.49 s [vector] +++ OK, passed 100 tests; 21 discarded.
  6516. 1271.49 s [vector] foldr: OK
  6517. 1271.49 s [vector] +++ OK, passed 100 tests.
  6518. 1271.49 s [vector] foldr1: OK
  6519. 1271.49 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6520. 1271.50 s [vector] foldr': OK
  6521. 1271.50 s [vector] +++ OK, passed 100 tests.
  6522. 1271.50 s [vector] foldr1': OK
  6523. 1271.51 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6524. 1271.51 s [vector] ifoldl: OK
  6525. 1271.51 s [vector] +++ OK, passed 100 tests.
  6526. 1271.51 s [vector] ifoldl': OK
  6527. 1271.52 s [vector] +++ OK, passed 100 tests.
  6528. 1271.52 s [vector] ifoldr: OK
  6529. 1271.52 s [vector] +++ OK, passed 100 tests.
  6530. 1271.53 s [vector] ifoldr': OK
  6531. 1271.53 s [vector] +++ OK, passed 100 tests.
  6532. 1271.53 s [vector] ifoldM: OK
  6533. 1271.53 s [vector] +++ OK, passed 100 tests.
  6534. 1271.53 s [vector] ifoldM': OK
  6535. 1271.53 s [vector] +++ OK, passed 100 tests.
  6536. 1271.57 s [vector] ifoldM_: OK (0.03s)
  6537. 1271.57 s [vector] +++ OK, passed 100 tests.
  6538. 1271.59 s [vector] ifoldM'_: OK (0.02s)
  6539. 1271.59 s [vector] +++ OK, passed 100 tests.
  6540. 1271.59 s [vector] all: OK
  6541. 1271.59 s [vector] +++ OK, passed 100 tests.
  6542. 1271.59 s [vector] any: OK
  6543. 1271.59 s [vector] +++ OK, passed 100 tests.
  6544. 1271.60 s [vector] prescanl: OK
  6545. 1271.60 s [vector] +++ OK, passed 100 tests.
  6546. 1271.60 s [vector] prescanl': OK
  6547. 1271.61 s [vector] +++ OK, passed 100 tests.
  6548. 1271.61 s [vector] postscanl: OK
  6549. 1271.61 s [vector] +++ OK, passed 100 tests.
  6550. 1271.61 s [vector] postscanl': OK
  6551. 1271.61 s [vector] +++ OK, passed 100 tests.
  6552. 1271.61 s [vector] scanl: OK
  6553. 1271.61 s [vector] +++ OK, passed 100 tests.
  6554. 1271.62 s [vector] scanl': OK
  6555. 1271.62 s [vector] +++ OK, passed 100 tests.
  6556. 1271.62 s [vector] scanl1: OK
  6557. 1271.62 s [vector] +++ OK, passed 100 tests.
  6558. 1271.63 s [vector] scanl1': OK
  6559. 1271.64 s [vector] +++ OK, passed 100 tests.
  6560. 1271.64 s [vector] iscanl: OK
  6561. 1271.64 s [vector] +++ OK, passed 100 tests.
  6562. 1271.64 s [vector] iscanl': OK
  6563. 1271.64 s [vector] +++ OK, passed 100 tests.
  6564. 1271.65 s [vector] prescanr: OK
  6565. 1271.65 s [vector] +++ OK, passed 100 tests.
  6566. 1271.66 s [vector] prescanr': OK
  6567. 1271.66 s [vector] +++ OK, passed 100 tests.
  6568. 1271.67 s [vector] postscanr: OK
  6569. 1271.67 s [vector] +++ OK, passed 100 tests.
  6570. 1271.67 s [vector] postscanr': OK
  6571. 1271.67 s [vector] +++ OK, passed 100 tests.
  6572. 1271.67 s [vector] scanr: OK
  6573. 1271.67 s [vector] +++ OK, passed 100 tests.
  6574. 1271.67 s [vector] scanr': OK
  6575. 1271.67 s [vector] +++ OK, passed 100 tests.
  6576. 1271.68 s [vector] scanr1: OK
  6577. 1271.68 s [vector] +++ OK, passed 100 tests.
  6578. 1271.69 s [vector] scanr1': OK
  6579. 1271.69 s [vector] +++ OK, passed 100 tests.
  6580. 1271.69 s [vector] iscanr: OK
  6581. 1271.69 s [vector] +++ OK, passed 100 tests.
  6582. 1271.69 s [vector] iscanr': OK
  6583. 1271.69 s [vector] +++ OK, passed 100 tests.
  6584. 1271.69 s [vector] mut_read: OK
  6585. 1271.69 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6586. 1271.70 s [vector] mut_write: OK
  6587. 1271.70 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6588. 1271.70 s [vector] mut_modify: OK
  6589. 1271.71 s [vector] +++ OK, passed 100 tests; 21 discarded.
  6590. 1271.72 s [vector] mut_generate: OK
  6591. 1271.72 s [vector] +++ OK, passed 100 tests.
  6592. 1271.72 s [vector] mut_generateM: OK (0.01s)
  6593. 1271.72 s [vector] +++ OK, passed 100 tests.
  6594. 1271.73 s [vector] mut_mapM_: OK (0.02s)
  6595. 1271.74 s [vector] +++ OK, passed 100 tests.
  6596. 1271.77 s [vector] mut_imapM_: OK (0.03s)
  6597. 1271.78 s [vector] +++ OK, passed 100 tests.
  6598. 1271.80 s [vector] mut_forM_: OK (0.03s)
  6599. 1271.80 s [vector] +++ OK, passed 100 tests.
  6600. 1271.81 s [vector] mut_iforM_: OK (0.03s)
  6601. 1271.82 s [vector] +++ OK, passed 100 tests.
  6602. 1271.82 s [vector] mut_foldr: OK
  6603. 1271.83 s [vector] +++ OK, passed 100 tests.
  6604. 1271.83 s [vector] mut_foldr': OK
  6605. 1271.83 s [vector] +++ OK, passed 100 tests.
  6606. 1271.83 s [vector] mut_foldl: OK
  6607. 1271.83 s [vector] +++ OK, passed 100 tests.
  6608. 1271.83 s [vector] mut_foldl': OK
  6609. 1271.83 s [vector] +++ OK, passed 100 tests.
  6610. 1271.84 s [vector] mut_ifoldr: OK
  6611. 1271.84 s [vector] +++ OK, passed 100 tests.
  6612. 1271.85 s [vector] mut_ifoldr': OK
  6613. 1271.85 s [vector] +++ OK, passed 100 tests.
  6614. 1271.85 s [vector] mut_ifoldl: OK
  6615. 1271.85 s [vector] +++ OK, passed 100 tests.
  6616. 1271.86 s [vector] mut_ifoldl': OK
  6617. 1271.86 s [vector] +++ OK, passed 100 tests.
  6618. 1271.87 s [vector] mut_foldM: OK
  6619. 1271.87 s [vector] +++ OK, passed 100 tests.
  6620. 1271.87 s [vector] mut_foldM': OK
  6621. 1271.87 s [vector] +++ OK, passed 100 tests.
  6622. 1271.89 s [vector] mut_foldrM: OK
  6623. 1271.89 s [vector] +++ OK, passed 100 tests.
  6624. 1271.89 s [vector] mut_foldrM': OK
  6625. 1271.89 s [vector] +++ OK, passed 100 tests.
  6626. 1271.90 s [vector] mut_ifoldM: OK
  6627. 1271.90 s [vector] +++ OK, passed 100 tests.
  6628. 1271.91 s [vector] mut_ifoldM': OK
  6629. 1271.91 s [vector] +++ OK, passed 100 tests.
  6630. 1271.91 s [vector] mut_ifoldrM: OK
  6631. 1271.91 s [vector] +++ OK, passed 100 tests.
  6632. 1271.91 s [vector] mut_ifoldrM': OK
  6633. 1271.91 s [vector] +++ OK, passed 100 tests.
  6634. 1271.91 s [vector] compare: OK
  6635. 1271.91 s [vector] +++ OK, passed 100 tests.
  6636. 1271.91 s [vector] maximum: OK
  6637. 1271.91 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6638. 1271.91 s [vector] minimum: OK
  6639. 1271.91 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6640. 1271.91 s [vector] minIndex: OK
  6641. 1271.91 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6642. 1271.92 s [vector] maxIndex: OK
  6643. 1271.92 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6644. 1271.92 s [vector] maximumBy: OK
  6645. 1271.92 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6646. 1271.92 s [vector] minimumBy: OK
  6647. 1271.92 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6648. 1271.92 s [vector] maximumOn: OK
  6649. 1271.92 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6650. 1271.92 s [vector] minimumOn: OK
  6651. 1271.92 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6652. 1271.92 s [vector] maxIndexBy: OK
  6653. 1271.92 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6654. 1271.92 s [vector] minIndexBy: OK
  6655. 1271.92 s [vector] +++ OK, passed 100 tests; 20 discarded.
  6656. 1271.92 s [vector] ListFirstMaxIndexWins: OK
  6657. 1271.92 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6658. 1271.92 s [vector] FalseListFirstMaxIndexWins: OK
  6659. 1271.92 s [vector] +++ OK, failed as expected. (after 1 test):
  6660. 1271.92 s [vector] Exception:
  6661. 1271.92 s [vector] Prelude.foldr1: empty list
  6662. 1271.92 s [vector] CallStack (from HasCallStack):
  6663. 1271.92 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  6664. 1271.92 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  6665. 1271.92 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  6666. 1271.92 s [vector] []
  6667. 1271.92 s [vector] mempty: OK
  6668. 1271.92 s [vector] +++ OK, passed 100 tests.
  6669. 1271.93 s [vector] mappend: OK
  6670. 1271.93 s [vector] +++ OK, passed 100 tests.
  6671. 1271.96 s [vector] mconcat: OK (0.03s)
  6672. 1271.96 s [vector] +++ OK, passed 100 tests.
  6673. 1271.96 s [vector] glength: OK
  6674. 1271.96 s [vector] +++ OK, passed 100 tests.
  6675. 1271.96 s [vector] sum: OK
  6676. 1271.96 s [vector] +++ OK, passed 100 tests.
  6677. 1271.96 s [vector] product: OK
  6678. 1271.96 s [vector] +++ OK, passed 100 tests.
  6679. 1271.96 s [vector] enumFromN: OK
  6680. 1271.96 s [vector] +++ OK, passed 100 tests.
  6681. 1271.97 s [vector] enumFromThenN: OK
  6682. 1271.97 s [vector] +++ OK, passed 100 tests.
  6683. 1271.97 s [vector] enumFromTo: OK
  6684. 1271.97 s [vector] +++ OK, passed 100 tests.
  6685. 1271.97 s [vector] enumFromThenTo: OK
  6686. 1271.97 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6687. 1271.97 s [vector] Double
  6688. 1271.97 s [vector] fromList.toList == id: OK
  6689. 1271.97 s [vector] +++ OK, passed 100 tests.
  6690. 1271.98 s [vector] toList.fromList == id: OK
  6691. 1271.98 s [vector] +++ OK, passed 100 tests.
  6692. 1271.98 s [vector] unstream.stream == id: OK
  6693. 1271.98 s [vector] +++ OK, passed 100 tests.
  6694. 1271.98 s [vector] stream.unstream == id: OK
  6695. 1271.98 s [vector] +++ OK, passed 100 tests.
  6696. 1271.98 s [vector] eq: OK
  6697. 1271.98 s [vector] +++ OK, passed 100 tests.
  6698. 1271.98 s [vector] length: OK
  6699. 1271.98 s [vector] +++ OK, passed 100 tests.
  6700. 1271.98 s [vector] null: OK
  6701. 1271.98 s [vector] +++ OK, passed 100 tests.
  6702. 1271.98 s [vector] index: OK
  6703. 1271.98 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6704. 1271.99 s [vector] safeIndex: OK
  6705. 1271.99 s [vector] +++ OK, passed 100 tests.
  6706. 1271.99 s [vector] head: OK
  6707. 1271.99 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6708. 1271.99 s [vector] last: OK
  6709. 1271.99 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6710. 1271.99 s [vector] unsafeIndex: OK
  6711. 1271.99 s [vector] +++ OK, passed 100 tests; 11 discarded.
  6712. 1271.99 s [vector] unsafeHead: OK
  6713. 1271.99 s [vector] +++ OK, passed 100 tests; 22 discarded.
  6714. 1271.99 s [vector] unsafeLast: OK
  6715. 1271.99 s [vector] +++ OK, passed 100 tests; 11 discarded.
  6716. 1271.99 s [vector] slice: OK
  6717. 1271.99 s [vector] +++ OK, passed 100 tests.
  6718. 1271.99 s [vector] init: OK
  6719. 1271.99 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6720. 1272.00 s [vector] tail: OK
  6721. 1272.00 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6722. 1272.00 s [vector] take: OK
  6723. 1272.00 s [vector] +++ OK, passed 100 tests.
  6724. 1272.00 s [vector] drop: OK
  6725. 1272.00 s [vector] +++ OK, passed 100 tests.
  6726. 1272.00 s [vector] splitAt: OK
  6727. 1272.00 s [vector] +++ OK, passed 100 tests.
  6728. 1272.00 s [vector] empty: OK
  6729. 1272.00 s [vector] +++ OK, passed 100 tests.
  6730. 1272.00 s [vector] singleton: OK
  6731. 1272.00 s [vector] +++ OK, passed 100 tests.
  6732. 1272.00 s [vector] replicate: OK
  6733. 1272.00 s [vector] +++ OK, passed 100 tests.
  6734. 1272.00 s [vector] generate: OK
  6735. 1272.00 s [vector] +++ OK, passed 100 tests.
  6736. 1272.01 s [vector] iterateN: OK
  6737. 1272.02 s [vector] +++ OK, passed 100 tests.
  6738. 1272.09 s [vector] iterateNM: OK (0.07s)
  6739. 1272.10 s [vector] +++ OK, passed 100 tests.
  6740. 1272.15 s [vector] generateM: OK (0.07s)
  6741. 1272.15 s [vector] +++ OK, passed 100 tests.
  6742. 1272.17 s [vector] replicateM: OK (0.02s)
  6743. 1272.17 s [vector] +++ OK, passed 100 tests.
  6744. 1272.17 s [vector] create: OK
  6745. 1272.17 s [vector] +++ OK, passed 100 tests.
  6746. 1272.17 s [vector] createT: OK
  6747. 1272.17 s [vector] +++ OK, passed 100 tests.
  6748. 1272.17 s [vector] unfoldr: OK
  6749. 1272.17 s [vector] +++ OK, passed 100 tests.
  6750. 1272.18 s [vector] unfoldrN: OK
  6751. 1272.18 s [vector] +++ OK, passed 100 tests.
  6752. 1272.18 s [vector] unfoldrExactN: OK
  6753. 1272.18 s [vector] +++ OK, passed 100 tests.
  6754. 1272.19 s [vector] unfoldrM: OK
  6755. 1272.20 s [vector] +++ OK, passed 100 tests.
  6756. 1272.20 s [vector] unfoldrNM: OK
  6757. 1272.20 s [vector] +++ OK, passed 100 tests.
  6758. 1272.25 s [vector] unfoldrExactNM: OK (0.07s)
  6759. 1272.25 s [vector] +++ OK, passed 100 tests.
  6760. 1272.29 s [vector] constructN: OK (0.02s)
  6761. 1272.29 s [vector] +++ OK, passed 100 tests.
  6762. 1272.30 s [vector] constructrN: OK (0.02s)
  6763. 1272.30 s [vector] +++ OK, passed 100 tests.
  6764. 1272.31 s [vector] cons: OK
  6765. 1272.31 s [vector] +++ OK, passed 100 tests.
  6766. 1272.31 s [vector] snoc: OK
  6767. 1272.31 s [vector] +++ OK, passed 100 tests.
  6768. 1272.31 s [vector] append: OK
  6769. 1272.31 s [vector] +++ OK, passed 100 tests.
  6770. 1272.35 s [vector] concat: OK (0.04s)
  6771. 1272.35 s [vector] +++ OK, passed 100 tests.
  6772. 1272.35 s [vector] force: OK
  6773. 1272.35 s [vector] +++ OK, passed 100 tests.
  6774. 1272.37 s [vector] upd: OK
  6775. 1272.38 s [vector] +++ OK, passed 100 tests.
  6776. 1272.38 s [vector] accum: OK (0.03s)
  6777. 1272.38 s [vector] +++ OK, passed 100 tests.
  6778. 1272.39 s [vector] reverse: OK
  6779. 1272.39 s [vector] +++ OK, passed 100 tests.
  6780. 1272.39 s [vector] backpermute: OK
  6781. 1272.39 s [vector] +++ OK, passed 100 tests.
  6782. 1272.40 s [vector] map: OK (0.01s)
  6783. 1272.40 s [vector] +++ OK, passed 100 tests.
  6784. 1272.43 s [vector] imap: OK
  6785. 1272.43 s [vector] +++ OK, passed 100 tests.
  6786. 1272.44 s [vector] concatMap: OK (0.01s)
  6787. 1272.44 s [vector] +++ OK, passed 100 tests.
  6788. 1272.44 s [vector] mapM: OK
  6789. 1272.44 s [vector] +++ OK, passed 100 tests.
  6790. 1272.49 s [vector] mapM_: OK (0.02s)
  6791. 1272.49 s [vector] +++ OK, passed 100 tests.
  6792. 1272.49 s [vector] forM: OK (0.01s)
  6793. 1272.49 s [vector] +++ OK, passed 100 tests.
  6794. 1272.53 s [vector] forM_: OK (0.04s)
  6795. 1272.54 s [vector] +++ OK, passed 100 tests.
  6796. 1272.55 s [vector] imapM: OK (0.01s)
  6797. 1272.56 s [vector] +++ OK, passed 100 tests.
  6798. 1272.60 s [vector] imapM_: OK (0.04s)
  6799. 1272.60 s [vector] +++ OK, passed 100 tests.
  6800. 1272.64 s [vector] zipWith: OK (0.02s)
  6801. 1272.64 s [vector] +++ OK, passed 100 tests.
  6802. 1272.64 s [vector] zipWith3: OK (0.02s)
  6803. 1272.64 s [vector] +++ OK, passed 100 tests.
  6804. 1272.66 s [vector] izipWith: OK (0.02s)
  6805. 1272.66 s [vector] +++ OK, passed 100 tests.
  6806. 1272.68 s [vector] izipWith3: OK (0.02s)
  6807. 1272.68 s [vector] +++ OK, passed 100 tests.
  6808. 1272.68 s [vector] izipWithM: OK (0.02s)
  6809. 1272.68 s [vector] +++ OK, passed 100 tests.
  6810. 1272.73 s [vector] izipWithM_: OK (0.03s)
  6811. 1272.73 s [vector] +++ OK, passed 100 tests.
  6812. 1272.73 s [vector] zipWithM: OK (0.01s)
  6813. 1272.73 s [vector] +++ OK, passed 100 tests.
  6814. 1272.79 s [vector] zipWithM_: OK (0.04s)
  6815. 1272.79 s [vector] +++ OK, passed 100 tests.
  6816. 1272.79 s [vector] filter: OK
  6817. 1272.79 s [vector] +++ OK, passed 100 tests.
  6818. 1272.81 s [vector] ifilter: OK
  6819. 1272.82 s [vector] +++ OK, passed 100 tests.
  6820. 1272.85 s [vector] filterM: OK (0.05s)
  6821. 1272.85 s [vector] +++ OK, passed 100 tests.
  6822. 1272.86 s [vector] uniq: OK
  6823. 1272.87 s [vector] +++ OK, passed 100 tests.
  6824. 1272.87 s [vector] mapMaybe: OK
  6825. 1272.87 s [vector] +++ OK, passed 100 tests.
  6826. 1272.87 s [vector] imapMaybe: OK
  6827. 1272.87 s [vector] +++ OK, passed 100 tests.
  6828. 1272.87 s [vector] takeWhile: OK
  6829. 1272.87 s [vector] +++ OK, passed 100 tests.
  6830. 1272.87 s [vector] dropWhile: OK
  6831. 1272.88 s [vector] +++ OK, passed 100 tests.
  6832. 1272.89 s [vector] partition: OK
  6833. 1272.89 s [vector] +++ OK, passed 100 tests.
  6834. 1272.89 s [vector] partitionWith: OK
  6835. 1272.89 s [vector] +++ OK, passed 100 tests.
  6836. 1272.89 s [vector] span: OK
  6837. 1272.89 s [vector] +++ OK, passed 100 tests.
  6838. 1272.89 s [vector] break: OK
  6839. 1272.89 s [vector] +++ OK, passed 100 tests.
  6840. 1272.89 s [vector] spanR: OK
  6841. 1272.89 s [vector] +++ OK, passed 100 tests.
  6842. 1272.89 s [vector] breakR: OK
  6843. 1272.89 s [vector] +++ OK, passed 100 tests.
  6844. 1272.91 s [vector] groupBy: OK (0.01s)
  6845. 1272.91 s [vector] +++ OK, passed 100 tests.
  6846. 1272.91 s [vector] elem: OK
  6847. 1272.91 s [vector] +++ OK, passed 100 tests.
  6848. 1272.91 s [vector] notElem: OK
  6849. 1272.91 s [vector] +++ OK, passed 100 tests.
  6850. 1272.92 s [vector] find: OK
  6851. 1272.92 s [vector] +++ OK, passed 100 tests.
  6852. 1272.92 s [vector] findIndex: OK
  6853. 1272.92 s [vector] +++ OK, passed 100 tests.
  6854. 1272.92 s [vector] findIndexR: OK
  6855. 1272.92 s [vector] +++ OK, passed 100 tests.
  6856. 1272.93 s [vector] findIndices: OK
  6857. 1272.93 s [vector] +++ OK, passed 100 tests.
  6858. 1272.93 s [vector] elemIndex: OK
  6859. 1272.93 s [vector] +++ OK, passed 100 tests.
  6860. 1272.93 s [vector] elemIndices: OK
  6861. 1272.94 s [vector] +++ OK, passed 100 tests.
  6862. 1272.95 s [vector] foldl: OK (0.01s)
  6863. 1272.96 s [vector] +++ OK, passed 100 tests.
  6864. 1272.97 s [vector] foldl1: OK (0.01s)
  6865. 1272.97 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6866. 1272.99 s [vector] foldl': OK (0.01s)
  6867. 1272.99 s [vector] +++ OK, passed 100 tests.
  6868. 1273.00 s [vector] foldl1': OK (0.01s)
  6869. 1273.00 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6870. 1273.00 s [vector] foldr: OK (0.01s)
  6871. 1273.00 s [vector] +++ OK, passed 100 tests.
  6872. 1273.02 s [vector] foldr1: OK
  6873. 1273.02 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6874. 1273.03 s [vector] foldr': OK
  6875. 1273.03 s [vector] +++ OK, passed 100 tests.
  6876. 1273.05 s [vector] foldr1': OK
  6877. 1273.05 s [vector] +++ OK, passed 100 tests; 20 discarded.
  6878. 1273.06 s [vector] ifoldl: OK (0.02s)
  6879. 1273.06 s [vector] +++ OK, passed 100 tests.
  6880. 1273.07 s [vector] ifoldl': OK
  6881. 1273.07 s [vector] +++ OK, passed 100 tests.
  6882. 1273.10 s [vector] ifoldr: OK (0.01s)
  6883. 1273.10 s [vector] +++ OK, passed 100 tests.
  6884. 1273.14 s [vector] ifoldr': OK (0.04s)
  6885. 1273.14 s [vector] +++ OK, passed 100 tests.
  6886. 1273.18 s [vector] ifoldM: OK (0.04s)
  6887. 1273.18 s [vector] +++ OK, passed 100 tests.
  6888. 1273.19 s [vector] ifoldM': OK (0.03s)
  6889. 1273.19 s [vector] +++ OK, passed 100 tests.
  6890. 1273.25 s [vector] ifoldM_: OK (0.05s)
  6891. 1273.25 s [vector] +++ OK, passed 100 tests.
  6892. 1273.29 s [vector] ifoldM'_: OK (0.05s)
  6893. 1273.29 s [vector] +++ OK, passed 100 tests.
  6894. 1273.29 s [vector] all: OK
  6895. 1273.29 s [vector] +++ OK, passed 100 tests.
  6896. 1273.29 s [vector] any: OK
  6897. 1273.29 s [vector] +++ OK, passed 100 tests.
  6898. 1273.31 s [vector] prescanl: OK (0.01s)
  6899. 1273.32 s [vector] +++ OK, passed 100 tests.
  6900. 1273.33 s [vector] prescanl': OK (0.02s)
  6901. 1273.33 s [vector] +++ OK, passed 100 tests.
  6902. 1273.35 s [vector] postscanl: OK (0.03s)
  6903. 1273.36 s [vector] +++ OK, passed 100 tests.
  6904. 1273.38 s [vector] postscanl': OK (0.02s)
  6905. 1273.38 s [vector] +++ OK, passed 100 tests.
  6906. 1273.39 s [vector] scanl: OK
  6907. 1273.40 s [vector] +++ OK, passed 100 tests.
  6908. 1273.41 s [vector] scanl': OK (0.01s)
  6909. 1273.41 s [vector] +++ OK, passed 100 tests.
  6910. 1273.42 s [vector] scanl1: OK
  6911. 1273.42 s [vector] +++ OK, passed 100 tests.
  6912. 1273.43 s [vector] scanl1': OK (0.01s)
  6913. 1273.44 s [vector] +++ OK, passed 100 tests.
  6914. 1273.45 s [vector] iscanl: OK (0.01s)
  6915. 1273.45 s [vector] +++ OK, passed 100 tests.
  6916. 1273.46 s [vector] iscanl': OK
  6917. 1273.46 s [vector] +++ OK, passed 100 tests.
  6918. 1273.49 s [vector] prescanr: OK
  6919. 1273.49 s [vector] +++ OK, passed 100 tests.
  6920. 1273.50 s [vector] prescanr': OK (0.01s)
  6921. 1273.50 s [vector] +++ OK, passed 100 tests.
  6922. 1273.51 s [vector] postscanr: OK (0.01s)
  6923. 1273.52 s [vector] +++ OK, passed 100 tests.
  6924. 1273.53 s [vector] postscanr': OK (0.02s)
  6925. 1273.53 s [vector] +++ OK, passed 100 tests.
  6926. 1273.53 s [vector] scanr: OK (0.01s)
  6927. 1273.53 s [vector] +++ OK, passed 100 tests.
  6928. 1273.55 s [vector] scanr': OK (0.01s)
  6929. 1273.56 s [vector] +++ OK, passed 100 tests.
  6930. 1273.56 s [vector] scanr1: OK (0.02s)
  6931. 1273.56 s [vector] +++ OK, passed 100 tests.
  6932. 1273.59 s [vector] scanr1': OK
  6933. 1273.59 s [vector] +++ OK, passed 100 tests.
  6934. 1273.61 s [vector] iscanr: OK (0.02s)
  6935. 1273.62 s [vector] +++ OK, passed 100 tests.
  6936. 1273.62 s [vector] iscanr': OK (0.02s)
  6937. 1273.62 s [vector] +++ OK, passed 100 tests.
  6938. 1273.62 s [vector] mut_read: OK
  6939. 1273.64 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6940. 1273.64 s [vector] mut_write: OK
  6941. 1273.64 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6942. 1273.64 s [vector] mut_modify: OK
  6943. 1273.64 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6944. 1273.64 s [vector] mut_generate: OK
  6945. 1273.64 s [vector] +++ OK, passed 100 tests.
  6946. 1273.65 s [vector] mut_generateM: OK (0.02s)
  6947. 1273.65 s [vector] +++ OK, passed 100 tests.
  6948. 1273.70 s [vector] mut_mapM_: OK (0.04s)
  6949. 1273.70 s [vector] +++ OK, passed 100 tests.
  6950. 1273.74 s [vector] mut_imapM_: OK (0.03s)
  6951. 1273.74 s [vector] +++ OK, passed 100 tests.
  6952. 1273.79 s [vector] mut_forM_: OK (0.02s)
  6953. 1273.79 s [vector] +++ OK, passed 100 tests.
  6954. 1273.83 s [vector] mut_iforM_: OK (0.04s)
  6955. 1273.83 s [vector] +++ OK, passed 100 tests.
  6956. 1273.84 s [vector] mut_foldr: OK (0.01s)
  6957. 1273.84 s [vector] +++ OK, passed 100 tests.
  6958. 1273.84 s [vector] mut_foldr': OK (0.01s)
  6959. 1273.84 s [vector] +++ OK, passed 100 tests.
  6960. 1273.86 s [vector] mut_foldl: OK
  6961. 1273.86 s [vector] +++ OK, passed 100 tests.
  6962. 1273.87 s [vector] mut_foldl': OK (0.02s)
  6963. 1273.88 s [vector] +++ OK, passed 100 tests.
  6964. 1273.89 s [vector] mut_ifoldr: OK (0.02s)
  6965. 1273.90 s [vector] +++ OK, passed 100 tests.
  6966. 1273.90 s [vector] mut_ifoldr': OK (0.01s)
  6967. 1273.90 s [vector] +++ OK, passed 100 tests.
  6968. 1273.93 s [vector] mut_ifoldl: OK
  6969. 1273.93 s [vector] +++ OK, passed 100 tests.
  6970. 1273.94 s [vector] mut_ifoldl': OK (0.02s)
  6971. 1273.94 s [vector] +++ OK, passed 100 tests.
  6972. 1273.95 s [vector] mut_foldM: OK (0.01s)
  6973. 1273.95 s [vector] +++ OK, passed 100 tests.
  6974. 1273.97 s [vector] mut_foldM': OK (0.02s)
  6975. 1273.97 s [vector] +++ OK, passed 100 tests.
  6976. 1273.97 s [vector] mut_foldrM: OK (0.01s)
  6977. 1273.98 s [vector] +++ OK, passed 100 tests.
  6978. 1273.99 s [vector] mut_foldrM': OK (0.01s)
  6979. 1274.00 s [vector] +++ OK, passed 100 tests.
  6980. 1274.01 s [vector] mut_ifoldM: OK (0.02s)
  6981. 1274.02 s [vector] +++ OK, passed 100 tests.
  6982. 1274.03 s [vector] mut_ifoldM': OK (0.02s)
  6983. 1274.03 s [vector] +++ OK, passed 100 tests.
  6984. 1274.05 s [vector] mut_ifoldrM: OK (0.01s)
  6985. 1274.05 s [vector] +++ OK, passed 100 tests.
  6986. 1274.05 s [vector] mut_ifoldrM': OK (0.02s)
  6987. 1274.05 s [vector] +++ OK, passed 100 tests.
  6988. 1274.06 s [vector] compare: OK
  6989. 1274.06 s [vector] +++ OK, passed 100 tests.
  6990. 1274.06 s [vector] maximum: OK
  6991. 1274.06 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6992. 1274.06 s [vector] minimum: OK
  6993. 1274.06 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6994. 1274.06 s [vector] minIndex: OK
  6995. 1274.06 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6996. 1274.06 s [vector] maxIndex: OK
  6997. 1274.06 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6998. 1274.06 s [vector] maximumBy: OK
  6999. 1274.06 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7000. 1274.06 s [vector] minimumBy: OK
  7001. 1274.06 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7002. 1274.06 s [vector] maximumOn: OK
  7003. 1274.06 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7004. 1274.07 s [vector] minimumOn: OK
  7005. 1274.07 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7006. 1274.07 s [vector] maxIndexBy: OK
  7007. 1274.07 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7008. 1274.07 s [vector] minIndexBy: OK
  7009. 1274.07 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7010. 1274.07 s [vector] ListFirstMaxIndexWins: OK
  7011. 1274.07 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7012. 1274.07 s [vector] FalseListFirstMaxIndexWins: OK
  7013. 1274.07 s [vector] +++ OK, failed as expected. (after 1 test):
  7014. 1274.07 s [vector] Exception:
  7015. 1274.07 s [vector] Prelude.foldr1: empty list
  7016. 1274.07 s [vector] CallStack (from HasCallStack):
  7017. 1274.07 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  7018. 1274.07 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  7019. 1274.07 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  7020. 1274.07 s [vector] []
  7021. 1274.07 s [vector] mempty: OK
  7022. 1274.07 s [vector] +++ OK, passed 100 tests.
  7023. 1274.07 s [vector] mappend: OK
  7024. 1274.07 s [vector] +++ OK, passed 100 tests.
  7025. 1274.10 s [vector] mconcat: OK (0.02s)
  7026. 1274.10 s [vector] +++ OK, passed 100 tests.
  7027. 1274.10 s [vector] glength: OK
  7028. 1274.10 s [vector] +++ OK, passed 100 tests.
  7029. 1274.10 s [vector] sum: OK
  7030. 1274.10 s [vector] +++ OK, passed 100 tests.
  7031. 1274.10 s [vector] product: OK
  7032. 1274.10 s [vector] +++ OK, passed 100 tests.
  7033. 1274.10 s [vector] enumFromN: OK
  7034. 1274.10 s [vector] +++ OK, passed 100 tests.
  7035. 1274.11 s [vector] enumFromThenN: OK
  7036. 1274.11 s [vector] +++ OK, passed 100 tests.
  7037. 1274.11 s [vector] enumFromTo: OK
  7038. 1274.11 s [vector] +++ OK, passed 100 tests.
  7039. 1274.12 s [vector] enumFromThenTo: OK
  7040. 1274.12 s [vector] +++ OK, passed 100 tests; 3 discarded.
  7041. 1274.12 s [vector] unstream
  7042. 1274.14 s [vector] unstream == vunstream (exact): OK
  7043. 1274.14 s [vector] +++ OK, passed 100 tests.
  7044. 1274.14 s [vector] unstream == vunstream (unknown): OK
  7045. 1274.14 s [vector] +++ OK, passed 100 tests.
  7046. 1274.15 s [vector] unstreamR ~= vunstream (exact): OK
  7047. 1274.15 s [vector] +++ OK, passed 100 tests.
  7048. 1274.15 s [vector] unstreamR ~= vunstream (unknown): OK
  7049. 1274.15 s [vector] +++ OK, passed 100 tests.
  7050. 1274.15 s [vector] Tests.Vector.Storable
  7051. 1274.15 s [vector] Data.Vector.Storable.Vector (Int)
  7052. 1274.16 s [vector] fromList.toList == id: OK
  7053. 1274.16 s [vector] +++ OK, passed 100 tests.
  7054. 1274.17 s [vector] toList.fromList == id: OK
  7055. 1274.17 s [vector] +++ OK, passed 100 tests.
  7056. 1274.17 s [vector] unstream.stream == id: OK
  7057. 1274.17 s [vector] +++ OK, passed 100 tests.
  7058. 1274.18 s [vector] stream.unstream == id: OK
  7059. 1274.18 s [vector] +++ OK, passed 100 tests.
  7060. 1274.18 s [vector] eq: OK
  7061. 1274.18 s [vector] +++ OK, passed 100 tests.
  7062. 1274.19 s [vector] length: OK
  7063. 1274.19 s [vector] +++ OK, passed 100 tests.
  7064. 1274.19 s [vector] null: OK
  7065. 1274.19 s [vector] +++ OK, passed 100 tests.
  7066. 1274.19 s [vector] index: OK
  7067. 1274.19 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7068. 1274.20 s [vector] safeIndex: OK
  7069. 1274.20 s [vector] +++ OK, passed 100 tests.
  7070. 1274.20 s [vector] head: OK
  7071. 1274.20 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7072. 1274.21 s [vector] last: OK
  7073. 1274.21 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7074. 1274.21 s [vector] unsafeIndex: OK
  7075. 1274.21 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7076. 1274.21 s [vector] unsafeHead: OK
  7077. 1274.21 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7078. 1274.21 s [vector] unsafeLast: OK
  7079. 1274.21 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7080. 1274.22 s [vector] slice: OK
  7081. 1274.22 s [vector] +++ OK, passed 100 tests.
  7082. 1274.22 s [vector] init: OK
  7083. 1274.22 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7084. 1274.22 s [vector] tail: OK
  7085. 1274.22 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7086. 1274.22 s [vector] take: OK
  7087. 1274.22 s [vector] +++ OK, passed 100 tests.
  7088. 1274.22 s [vector] drop: OK
  7089. 1274.22 s [vector] +++ OK, passed 100 tests.
  7090. 1274.22 s [vector] splitAt: OK
  7091. 1274.22 s [vector] +++ OK, passed 100 tests.
  7092. 1274.22 s [vector] empty: OK
  7093. 1274.22 s [vector] +++ OK, passed 100 tests.
  7094. 1274.22 s [vector] singleton: OK
  7095. 1274.22 s [vector] +++ OK, passed 100 tests.
  7096. 1274.22 s [vector] replicate: OK
  7097. 1274.22 s [vector] +++ OK, passed 100 tests.
  7098. 1274.22 s [vector] generate: OK
  7099. 1274.22 s [vector] +++ OK, passed 100 tests.
  7100. 1274.24 s [vector] iterateN: OK
  7101. 1274.24 s [vector] +++ OK, passed 100 tests.
  7102. 1274.29 s [vector] iterateNM: OK (0.06s)
  7103. 1274.29 s [vector] +++ OK, passed 100 tests.
  7104. 1274.30 s [vector] generateM: OK (0.02s)
  7105. 1274.30 s [vector] +++ OK, passed 100 tests.
  7106. 1274.33 s [vector] replicateM: OK
  7107. 1274.33 s [vector] +++ OK, passed 100 tests.
  7108. 1274.33 s [vector] create: OK (0.02s)
  7109. 1274.33 s [vector] +++ OK, passed 100 tests.
  7110. 1274.33 s [vector] createT: OK
  7111. 1274.33 s [vector] +++ OK, passed 100 tests.
  7112. 1274.34 s [vector] unfoldr: OK
  7113. 1274.34 s [vector] +++ OK, passed 100 tests.
  7114. 1274.34 s [vector] unfoldrN: OK
  7115. 1274.34 s [vector] +++ OK, passed 100 tests.
  7116. 1274.34 s [vector] unfoldrExactN: OK
  7117. 1274.34 s [vector] +++ OK, passed 100 tests.
  7118. 1274.34 s [vector] unfoldrM: OK
  7119. 1274.34 s [vector] +++ OK, passed 100 tests.
  7120. 1274.35 s [vector] unfoldrNM: OK
  7121. 1274.35 s [vector] +++ OK, passed 100 tests.
  7122. 1274.40 s [vector] unfoldrExactNM: OK (0.05s)
  7123. 1274.40 s [vector] +++ OK, passed 100 tests.
  7124. 1274.40 s [vector] constructN: OK
  7125. 1274.40 s [vector] +++ OK, passed 100 tests.
  7126. 1274.41 s [vector] constructrN: OK
  7127. 1274.41 s [vector] +++ OK, passed 100 tests.
  7128. 1274.41 s [vector] cons: OK
  7129. 1274.41 s [vector] +++ OK, passed 100 tests.
  7130. 1274.41 s [vector] snoc: OK
  7131. 1274.41 s [vector] +++ OK, passed 100 tests.
  7132. 1274.41 s [vector] append: OK
  7133. 1274.41 s [vector] +++ OK, passed 100 tests.
  7134. 1274.43 s [vector] concat: OK (0.01s)
  7135. 1274.43 s [vector] +++ OK, passed 100 tests.
  7136. 1274.43 s [vector] force: OK
  7137. 1274.43 s [vector] +++ OK, passed 100 tests.
  7138. 1274.43 s [vector] upd: OK
  7139. 1274.43 s [vector] +++ OK, passed 100 tests.
  7140. 1274.43 s [vector] accum: OK
  7141. 1274.43 s [vector] +++ OK, passed 100 tests.
  7142. 1274.44 s [vector] reverse: OK
  7143. 1274.44 s [vector] +++ OK, passed 100 tests.
  7144. 1274.44 s [vector] backpermute: OK
  7145. 1274.44 s [vector] +++ OK, passed 100 tests.
  7146. 1274.44 s [vector] map: OK
  7147. 1274.44 s [vector] +++ OK, passed 100 tests.
  7148. 1274.44 s [vector] imap: OK
  7149. 1274.45 s [vector] +++ OK, passed 100 tests.
  7150. 1274.45 s [vector] concatMap: OK
  7151. 1274.45 s [vector] +++ OK, passed 100 tests.
  7152. 1274.46 s [vector] mapM: OK
  7153. 1274.46 s [vector] +++ OK, passed 100 tests.
  7154. 1274.47 s [vector] mapM_: OK (0.02s)
  7155. 1274.47 s [vector] +++ OK, passed 100 tests.
  7156. 1274.47 s [vector] forM: OK
  7157. 1274.47 s [vector] +++ OK, passed 100 tests.
  7158. 1274.49 s [vector] forM_: OK (0.02s)
  7159. 1274.50 s [vector] +++ OK, passed 100 tests.
  7160. 1274.50 s [vector] imapM: OK
  7161. 1274.50 s [vector] +++ OK, passed 100 tests.
  7162. 1274.52 s [vector] imapM_: OK
  7163. 1274.52 s [vector] +++ OK, passed 100 tests.
  7164. 1274.53 s [vector] zipWith: OK
  7165. 1274.53 s [vector] +++ OK, passed 100 tests.
  7166. 1274.53 s [vector] zipWith3: OK
  7167. 1274.54 s [vector] +++ OK, passed 100 tests.
  7168. 1274.54 s [vector] izipWith: OK
  7169. 1274.54 s [vector] +++ OK, passed 100 tests.
  7170. 1274.54 s [vector] izipWith3: OK
  7171. 1274.54 s [vector] +++ OK, passed 100 tests.
  7172. 1274.54 s [vector] izipWithM: OK
  7173. 1274.54 s [vector] +++ OK, passed 100 tests.
  7174. 1274.55 s [vector] izipWithM_: OK (0.02s)
  7175. 1274.55 s [vector] +++ OK, passed 100 tests.
  7176. 1274.55 s [vector] zipWithM: OK
  7177. 1274.55 s [vector] +++ OK, passed 100 tests.
  7178. 1274.57 s [vector] zipWithM_: OK
  7179. 1274.57 s [vector] +++ OK, passed 100 tests.
  7180. 1274.58 s [vector] filter: OK
  7181. 1274.58 s [vector] +++ OK, passed 100 tests.
  7182. 1274.60 s [vector] ifilter: OK
  7183. 1274.60 s [vector] +++ OK, passed 100 tests.
  7184. 1274.62 s [vector] filterM: OK (0.04s)
  7185. 1274.62 s [vector] +++ OK, passed 100 tests.
  7186. 1274.62 s [vector] uniq: OK
  7187. 1274.63 s [vector] +++ OK, passed 100 tests.
  7188. 1274.63 s [vector] mapMaybe: OK
  7189. 1274.63 s [vector] +++ OK, passed 100 tests.
  7190. 1274.63 s [vector] imapMaybe: OK
  7191. 1274.63 s [vector] +++ OK, passed 100 tests.
  7192. 1274.63 s [vector] takeWhile: OK
  7193. 1274.63 s [vector] +++ OK, passed 100 tests.
  7194. 1274.63 s [vector] dropWhile: OK
  7195. 1274.63 s [vector] +++ OK, passed 100 tests.
  7196. 1274.63 s [vector] partition: OK
  7197. 1274.63 s [vector] +++ OK, passed 100 tests.
  7198. 1274.64 s [vector] partitionWith: OK
  7199. 1274.64 s [vector] +++ OK, passed 100 tests.
  7200. 1274.64 s [vector] span: OK
  7201. 1274.64 s [vector] +++ OK, passed 100 tests.
  7202. 1274.64 s [vector] break: OK
  7203. 1274.64 s [vector] +++ OK, passed 100 tests.
  7204. 1274.64 s [vector] spanR: OK
  7205. 1274.64 s [vector] +++ OK, passed 100 tests.
  7206. 1274.65 s [vector] breakR: OK
  7207. 1274.65 s [vector] +++ OK, passed 100 tests.
  7208. 1274.65 s [vector] groupBy: OK
  7209. 1274.65 s [vector] +++ OK, passed 100 tests.
  7210. 1274.65 s [vector] elem: OK
  7211. 1274.65 s [vector] +++ OK, passed 100 tests.
  7212. 1274.65 s [vector] notElem: OK
  7213. 1274.65 s [vector] +++ OK, passed 100 tests.
  7214. 1274.65 s [vector] find: OK
  7215. 1274.65 s [vector] +++ OK, passed 100 tests.
  7216. 1274.65 s [vector] findIndex: OK
  7217. 1274.65 s [vector] +++ OK, passed 100 tests.
  7218. 1274.66 s [vector] findIndexR: OK
  7219. 1274.66 s [vector] +++ OK, passed 100 tests.
  7220. 1274.66 s [vector] findIndices: OK
  7221. 1274.66 s [vector] +++ OK, passed 100 tests.
  7222. 1274.66 s [vector] elemIndex: OK
  7223. 1274.66 s [vector] +++ OK, passed 100 tests.
  7224. 1274.66 s [vector] elemIndices: OK
  7225. 1274.66 s [vector] +++ OK, passed 100 tests.
  7226. 1274.67 s [vector] foldl: OK
  7227. 1274.67 s [vector] +++ OK, passed 100 tests.
  7228. 1274.68 s [vector] foldl1: OK
  7229. 1274.68 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7230. 1274.68 s [vector] foldl': OK
  7231. 1274.68 s [vector] +++ OK, passed 100 tests.
  7232. 1274.68 s [vector] foldl1': OK
  7233. 1274.68 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7234. 1274.69 s [vector] foldr: OK
  7235. 1274.69 s [vector] +++ OK, passed 100 tests.
  7236. 1274.69 s [vector] foldr1: OK
  7237. 1274.69 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7238. 1274.69 s [vector] foldr': OK
  7239. 1274.69 s [vector] +++ OK, passed 100 tests.
  7240. 1274.69 s [vector] foldr1': OK
  7241. 1274.69 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7242. 1274.70 s [vector] ifoldl: OK
  7243. 1274.70 s [vector] +++ OK, passed 100 tests.
  7244. 1274.71 s [vector] ifoldl': OK
  7245. 1274.71 s [vector] +++ OK, passed 100 tests.
  7246. 1274.72 s [vector] ifoldr: OK
  7247. 1274.72 s [vector] +++ OK, passed 100 tests.
  7248. 1274.72 s [vector] ifoldr': OK
  7249. 1274.72 s [vector] +++ OK, passed 100 tests.
  7250. 1274.72 s [vector] ifoldM: OK
  7251. 1274.72 s [vector] +++ OK, passed 100 tests.
  7252. 1274.73 s [vector] ifoldM': OK
  7253. 1274.74 s [vector] +++ OK, passed 100 tests.
  7254. 1274.77 s [vector] ifoldM_: OK (0.04s)
  7255. 1274.78 s [vector] +++ OK, passed 100 tests.
  7256. 1274.78 s [vector] ifoldM'_: OK (0.02s)
  7257. 1274.78 s [vector] +++ OK, passed 100 tests.
  7258. 1274.78 s [vector] all: OK
  7259. 1274.78 s [vector] +++ OK, passed 100 tests.
  7260. 1274.78 s [vector] any: OK
  7261. 1274.79 s [vector] +++ OK, passed 100 tests.
  7262. 1274.79 s [vector] prescanl: OK
  7263. 1274.79 s [vector] +++ OK, passed 100 tests.
  7264. 1274.79 s [vector] prescanl': OK
  7265. 1274.79 s [vector] +++ OK, passed 100 tests.
  7266. 1274.79 s [vector] postscanl: OK
  7267. 1274.79 s [vector] +++ OK, passed 100 tests.
  7268. 1274.80 s [vector] postscanl': OK
  7269. 1274.80 s [vector] +++ OK, passed 100 tests.
  7270. 1274.81 s [vector] scanl: OK
  7271. 1274.81 s [vector] +++ OK, passed 100 tests.
  7272. 1274.81 s [vector] scanl': OK
  7273. 1274.81 s [vector] +++ OK, passed 100 tests.
  7274. 1274.81 s [vector] scanl1: OK
  7275. 1274.81 s [vector] +++ OK, passed 100 tests.
  7276. 1274.81 s [vector] scanl1': OK
  7277. 1274.81 s [vector] +++ OK, passed 100 tests.
  7278. 1274.81 s [vector] iscanl: OK
  7279. 1274.81 s [vector] +++ OK, passed 100 tests.
  7280. 1274.82 s [vector] iscanl': OK
  7281. 1274.82 s [vector] +++ OK, passed 100 tests.
  7282. 1274.82 s [vector] prescanr: OK
  7283. 1274.82 s [vector] +++ OK, passed 100 tests.
  7284. 1274.82 s [vector] prescanr': OK
  7285. 1274.82 s [vector] +++ OK, passed 100 tests.
  7286. 1274.83 s [vector] postscanr: OK
  7287. 1274.83 s [vector] +++ OK, passed 100 tests.
  7288. 1274.83 s [vector] postscanr': OK
  7289. 1274.83 s [vector] +++ OK, passed 100 tests.
  7290. 1274.83 s [vector] scanr: OK
  7291. 1274.83 s [vector] +++ OK, passed 100 tests.
  7292. 1274.83 s [vector] scanr': OK
  7293. 1274.84 s [vector] +++ OK, passed 100 tests.
  7294. 1274.84 s [vector] scanr1: OK
  7295. 1274.84 s [vector] +++ OK, passed 100 tests.
  7296. 1274.85 s [vector] scanr1': OK
  7297. 1274.85 s [vector] +++ OK, passed 100 tests.
  7298. 1274.85 s [vector] iscanr: OK
  7299. 1274.85 s [vector] +++ OK, passed 100 tests.
  7300. 1274.85 s [vector] iscanr': OK
  7301. 1274.85 s [vector] +++ OK, passed 100 tests.
  7302. 1274.85 s [vector] mut_read: OK
  7303. 1274.85 s [vector] +++ OK, passed 100 tests; 22 discarded.
  7304. 1274.85 s [vector] mut_write: OK
  7305. 1274.85 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7306. 1274.85 s [vector] mut_modify: OK
  7307. 1274.85 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7308. 1274.87 s [vector] mut_generate: OK
  7309. 1274.87 s [vector] +++ OK, passed 100 tests.
  7310. 1274.88 s [vector] mut_generateM: OK (0.01s)
  7311. 1274.88 s [vector] +++ OK, passed 100 tests.
  7312. 1274.90 s [vector] mut_mapM_: OK (0.02s)
  7313. 1274.90 s [vector] +++ OK, passed 100 tests.
  7314. 1274.91 s [vector] mut_imapM_: OK (0.02s)
  7315. 1274.92 s [vector] +++ OK, passed 100 tests.
  7316. 1274.93 s [vector] mut_forM_: OK (0.02s)
  7317. 1274.94 s [vector] +++ OK, passed 100 tests.
  7318. 1274.95 s [vector] mut_iforM_: OK (0.02s)
  7319. 1274.95 s [vector] +++ OK, passed 100 tests.
  7320. 1274.95 s [vector] mut_foldr: OK
  7321. 1274.95 s [vector] +++ OK, passed 100 tests.
  7322. 1274.95 s [vector] mut_foldr': OK
  7323. 1274.95 s [vector] +++ OK, passed 100 tests.
  7324. 1274.95 s [vector] mut_foldl: OK
  7325. 1274.95 s [vector] +++ OK, passed 100 tests.
  7326. 1274.97 s [vector] mut_foldl': OK
  7327. 1274.97 s [vector] +++ OK, passed 100 tests.
  7328. 1274.97 s [vector] mut_ifoldr: OK
  7329. 1274.97 s [vector] +++ OK, passed 100 tests.
  7330. 1274.98 s [vector] mut_ifoldr': OK
  7331. 1274.98 s [vector] +++ OK, passed 100 tests.
  7332. 1274.99 s [vector] mut_ifoldl: OK (0.01s)
  7333. 1274.99 s [vector] +++ OK, passed 100 tests.
  7334. 1275.00 s [vector] mut_ifoldl': OK
  7335. 1275.00 s [vector] +++ OK, passed 100 tests.
  7336. 1275.00 s [vector] mut_foldM: OK
  7337. 1275.00 s [vector] +++ OK, passed 100 tests.
  7338. 1275.01 s [vector] mut_foldM': OK
  7339. 1275.01 s [vector] +++ OK, passed 100 tests.
  7340. 1275.01 s [vector] mut_foldrM: OK
  7341. 1275.01 s [vector] +++ OK, passed 100 tests.
  7342. 1275.02 s [vector] mut_foldrM': OK
  7343. 1275.02 s [vector] +++ OK, passed 100 tests.
  7344. 1275.02 s [vector] mut_ifoldM: OK
  7345. 1275.02 s [vector] +++ OK, passed 100 tests.
  7346. 1275.03 s [vector] mut_ifoldM': OK
  7347. 1275.03 s [vector] +++ OK, passed 100 tests.
  7348. 1275.04 s [vector] mut_ifoldrM: OK
  7349. 1275.04 s [vector] +++ OK, passed 100 tests.
  7350. 1275.04 s [vector] mut_ifoldrM': OK
  7351. 1275.04 s [vector] +++ OK, passed 100 tests.
  7352. 1275.04 s [vector] compare: OK
  7353. 1275.04 s [vector] +++ OK, passed 100 tests.
  7354. 1275.04 s [vector] maximum: OK
  7355. 1275.04 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7356. 1275.04 s [vector] minimum: OK
  7357. 1275.04 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7358. 1275.04 s [vector] minIndex: OK
  7359. 1275.05 s [vector] +++ OK, passed 100 tests; 11 discarded.
  7360. 1275.05 s [vector] maxIndex: OK
  7361. 1275.05 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7362. 1275.05 s [vector] maximumBy: OK
  7363. 1275.05 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7364. 1275.05 s [vector] minimumBy: OK
  7365. 1275.05 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7366. 1275.05 s [vector] maximumOn: OK
  7367. 1275.05 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7368. 1275.05 s [vector] minimumOn: OK
  7369. 1275.05 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7370. 1275.05 s [vector] maxIndexBy: OK
  7371. 1275.05 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7372. 1275.05 s [vector] minIndexBy: OK
  7373. 1275.05 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7374. 1275.05 s [vector] ListFirstMaxIndexWins: OK
  7375. 1275.05 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7376. 1275.05 s [vector] FalseListFirstMaxIndexWins: OK
  7377. 1275.05 s [vector] +++ OK, failed as expected. (after 1 test):
  7378. 1275.05 s [vector] Exception:
  7379. 1275.05 s [vector] Prelude.foldr1: empty list
  7380. 1275.05 s [vector] CallStack (from HasCallStack):
  7381. 1275.05 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  7382. 1275.05 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  7383. 1275.05 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  7384. 1275.05 s [vector] []
  7385. 1275.05 s [vector] mempty: OK
  7386. 1275.05 s [vector] +++ OK, passed 100 tests.
  7387. 1275.07 s [vector] mappend: OK
  7388. 1275.07 s [vector] +++ OK, passed 100 tests.
  7389. 1275.07 s [vector] mconcat: OK (0.01s)
  7390. 1275.07 s [vector] +++ OK, passed 100 tests.
  7391. 1275.07 s [vector] glength: OK
  7392. 1275.07 s [vector] +++ OK, passed 100 tests.
  7393. 1275.07 s [vector] sum: OK
  7394. 1275.07 s [vector] +++ OK, passed 100 tests.
  7395. 1275.07 s [vector] product: OK
  7396. 1275.07 s [vector] +++ OK, passed 100 tests.
  7397. 1275.07 s [vector] enumFromN: OK
  7398. 1275.07 s [vector] +++ OK, passed 100 tests.
  7399. 1275.08 s [vector] enumFromThenN: OK
  7400. 1275.08 s [vector] +++ OK, passed 100 tests.
  7401. 1275.08 s [vector] enumFromTo: OK
  7402. 1275.08 s [vector] +++ OK, passed 100 tests.
  7403. 1275.08 s [vector] enumFromThenTo: OK
  7404. 1275.08 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7405. 1275.08 s [vector] Data.Vector.Storable.Vector (Double)
  7406. 1275.08 s [vector] fromList.toList == id: OK
  7407. 1275.08 s [vector] +++ OK, passed 100 tests.
  7408. 1275.08 s [vector] toList.fromList == id: OK
  7409. 1275.09 s [vector] +++ OK, passed 100 tests.
  7410. 1275.09 s [vector] unstream.stream == id: OK
  7411. 1275.09 s [vector] +++ OK, passed 100 tests.
  7412. 1275.09 s [vector] stream.unstream == id: OK
  7413. 1275.09 s [vector] +++ OK, passed 100 tests.
  7414. 1275.09 s [vector] eq: OK
  7415. 1275.09 s [vector] +++ OK, passed 100 tests.
  7416. 1275.09 s [vector] length: OK
  7417. 1275.09 s [vector] +++ OK, passed 100 tests.
  7418. 1275.09 s [vector] null: OK
  7419. 1275.09 s [vector] +++ OK, passed 100 tests.
  7420. 1275.09 s [vector] index: OK
  7421. 1275.09 s [vector] +++ OK, passed 100 tests; 11 discarded.
  7422. 1275.09 s [vector] safeIndex: OK
  7423. 1275.09 s [vector] +++ OK, passed 100 tests.
  7424. 1275.09 s [vector] head: OK
  7425. 1275.09 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7426. 1275.10 s [vector] last: OK
  7427. 1275.10 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7428. 1275.10 s [vector] unsafeIndex: OK
  7429. 1275.10 s [vector] +++ OK, passed 100 tests; 21 discarded.
  7430. 1275.10 s [vector] unsafeHead: OK
  7431. 1275.10 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7432. 1275.10 s [vector] unsafeLast: OK
  7433. 1275.10 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7434. 1275.10 s [vector] slice: OK
  7435. 1275.10 s [vector] +++ OK, passed 100 tests.
  7436. 1275.10 s [vector] init: OK
  7437. 1275.10 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7438. 1275.11 s [vector] tail: OK
  7439. 1275.11 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7440. 1275.11 s [vector] take: OK
  7441. 1275.11 s [vector] +++ OK, passed 100 tests.
  7442. 1275.11 s [vector] drop: OK
  7443. 1275.11 s [vector] +++ OK, passed 100 tests.
  7444. 1275.11 s [vector] splitAt: OK
  7445. 1275.11 s [vector] +++ OK, passed 100 tests.
  7446. 1275.11 s [vector] empty: OK
  7447. 1275.11 s [vector] +++ OK, passed 100 tests.
  7448. 1275.11 s [vector] singleton: OK
  7449. 1275.11 s [vector] +++ OK, passed 100 tests.
  7450. 1275.11 s [vector] replicate: OK
  7451. 1275.11 s [vector] +++ OK, passed 100 tests.
  7452. 1275.12 s [vector] generate: OK
  7453. 1275.12 s [vector] +++ OK, passed 100 tests.
  7454. 1275.12 s [vector] iterateN: OK
  7455. 1275.12 s [vector] +++ OK, passed 100 tests.
  7456. 1275.19 s [vector] iterateNM: OK (0.06s)
  7457. 1275.19 s [vector] +++ OK, passed 100 tests.
  7458. 1275.25 s [vector] generateM: OK (0.05s)
  7459. 1275.25 s [vector] +++ OK, passed 100 tests.
  7460. 1275.25 s [vector] replicateM: OK
  7461. 1275.25 s [vector] +++ OK, passed 100 tests.
  7462. 1275.25 s [vector] create: OK
  7463. 1275.25 s [vector] +++ OK, passed 100 tests.
  7464. 1275.25 s [vector] createT: OK
  7465. 1275.25 s [vector] +++ OK, passed 100 tests.
  7466. 1275.25 s [vector] unfoldr: OK
  7467. 1275.25 s [vector] +++ OK, passed 100 tests.
  7468. 1275.25 s [vector] unfoldrN: OK
  7469. 1275.25 s [vector] +++ OK, passed 100 tests.
  7470. 1275.25 s [vector] unfoldrExactN: OK
  7471. 1275.25 s [vector] +++ OK, passed 100 tests.
  7472. 1275.26 s [vector] unfoldrM: OK
  7473. 1275.27 s [vector] +++ OK, passed 100 tests.
  7474. 1275.27 s [vector] unfoldrNM: OK
  7475. 1275.27 s [vector] +++ OK, passed 100 tests.
  7476. 1275.31 s [vector] unfoldrExactNM: OK (0.05s)
  7477. 1275.32 s [vector] +++ OK, passed 100 tests.
  7478. 1275.33 s [vector] constructN: OK (0.02s)
  7479. 1275.34 s [vector] +++ OK, passed 100 tests.
  7480. 1275.35 s [vector] constructrN: OK (0.02s)
  7481. 1275.35 s [vector] +++ OK, passed 100 tests.
  7482. 1275.35 s [vector] cons: OK
  7483. 1275.35 s [vector] +++ OK, passed 100 tests.
  7484. 1275.35 s [vector] snoc: OK
  7485. 1275.35 s [vector] +++ OK, passed 100 tests.
  7486. 1275.37 s [vector] append: OK
  7487. 1275.37 s [vector] +++ OK, passed 100 tests.
  7488. 1275.38 s [vector] concat: OK (0.02s)
  7489. 1275.38 s [vector] +++ OK, passed 100 tests.
  7490. 1275.38 s [vector] force: OK
  7491. 1275.38 s [vector] +++ OK, passed 100 tests.
  7492. 1275.39 s [vector] upd: OK
  7493. 1275.40 s [vector] +++ OK, passed 100 tests.
  7494. 1275.40 s [vector] accum: OK (0.02s)
  7495. 1275.40 s [vector] +++ OK, passed 100 tests.
  7496. 1275.40 s [vector] reverse: OK
  7497. 1275.40 s [vector] +++ OK, passed 100 tests.
  7498. 1275.40 s [vector] backpermute: OK
  7499. 1275.41 s [vector] +++ OK, passed 100 tests.
  7500. 1275.41 s [vector] map: OK
  7501. 1275.41 s [vector] +++ OK, passed 100 tests.
  7502. 1275.42 s [vector] imap: OK
  7503. 1275.42 s [vector] +++ OK, passed 100 tests.
  7504. 1275.44 s [vector] concatMap: OK
  7505. 1275.44 s [vector] +++ OK, passed 100 tests.
  7506. 1275.46 s [vector] mapM: OK (0.02s)
  7507. 1275.46 s [vector] +++ OK, passed 100 tests.
  7508. 1275.51 s [vector] mapM_: OK (0.07s)
  7509. 1275.52 s [vector] +++ OK, passed 100 tests.
  7510. 1275.52 s [vector] forM: OK
  7511. 1275.52 s [vector] +++ OK, passed 100 tests.
  7512. 1275.56 s [vector] forM_: OK (0.03s)
  7513. 1275.56 s [vector] +++ OK, passed 100 tests.
  7514. 1275.57 s [vector] imapM: OK
  7515. 1275.58 s [vector] +++ OK, passed 100 tests.
  7516. 1275.61 s [vector] imapM_: OK (0.04s)
  7517. 1275.61 s [vector] +++ OK, passed 100 tests.
  7518. 1275.64 s [vector] zipWith: OK (0.02s)
  7519. 1275.64 s [vector] +++ OK, passed 100 tests.
  7520. 1275.65 s [vector] zipWith3: OK (0.02s)
  7521. 1275.65 s [vector] +++ OK, passed 100 tests.
  7522. 1275.67 s [vector] izipWith: OK (0.02s)
  7523. 1275.67 s [vector] +++ OK, passed 100 tests.
  7524. 1275.69 s [vector] izipWith3: OK (0.01s)
  7525. 1275.70 s [vector] +++ OK, passed 100 tests.
  7526. 1275.70 s [vector] izipWithM: OK (0.01s)
  7527. 1275.70 s [vector] +++ OK, passed 100 tests.
  7528. 1275.76 s [vector] izipWithM_: OK (0.03s)
  7529. 1275.76 s [vector] +++ OK, passed 100 tests.
  7530. 1275.78 s [vector] zipWithM: OK (0.02s)
  7531. 1275.78 s [vector] +++ OK, passed 100 tests.
  7532. 1275.82 s [vector] zipWithM_: OK (0.05s)
  7533. 1275.82 s [vector] +++ OK, passed 100 tests.
  7534. 1275.82 s [vector] filter: OK
  7535. 1275.82 s [vector] +++ OK, passed 100 tests.
  7536. 1275.83 s [vector] ifilter: OK
  7537. 1275.83 s [vector] +++ OK, passed 100 tests.
  7538. 1275.87 s [vector] filterM: OK (0.04s)
  7539. 1275.87 s [vector] +++ OK, passed 100 tests.
  7540. 1275.88 s [vector] uniq: OK
  7541. 1275.88 s [vector] +++ OK, passed 100 tests.
  7542. 1275.88 s [vector] mapMaybe: OK
  7543. 1275.88 s [vector] +++ OK, passed 100 tests.
  7544. 1275.90 s [vector] imapMaybe: OK
  7545. 1275.90 s [vector] +++ OK, passed 100 tests.
  7546. 1275.91 s [vector] takeWhile: OK
  7547. 1275.91 s [vector] +++ OK, passed 100 tests.
  7548. 1275.91 s [vector] dropWhile: OK
  7549. 1275.91 s [vector] +++ OK, passed 100 tests.
  7550. 1275.91 s [vector] partition: OK
  7551. 1275.91 s [vector] +++ OK, passed 100 tests.
  7552. 1275.91 s [vector] partitionWith: OK
  7553. 1275.91 s [vector] +++ OK, passed 100 tests.
  7554. 1275.92 s [vector] span: OK
  7555. 1275.92 s [vector] +++ OK, passed 100 tests.
  7556. 1275.92 s [vector] break: OK
  7557. 1275.92 s [vector] +++ OK, passed 100 tests.
  7558. 1275.92 s [vector] spanR: OK
  7559. 1275.92 s [vector] +++ OK, passed 100 tests.
  7560. 1275.93 s [vector] breakR: OK
  7561. 1275.93 s [vector] +++ OK, passed 100 tests.
  7562. 1275.93 s [vector] groupBy: OK (0.01s)
  7563. 1275.93 s [vector] +++ OK, passed 100 tests.
  7564. 1275.93 s [vector] elem: OK
  7565. 1275.93 s [vector] +++ OK, passed 100 tests.
  7566. 1275.94 s [vector] notElem: OK
  7567. 1275.94 s [vector] +++ OK, passed 100 tests.
  7568. 1275.94 s [vector] find: OK
  7569. 1275.95 s [vector] +++ OK, passed 100 tests.
  7570. 1275.95 s [vector] findIndex: OK
  7571. 1275.95 s [vector] +++ OK, passed 100 tests.
  7572. 1275.95 s [vector] findIndexR: OK
  7573. 1275.95 s [vector] +++ OK, passed 100 tests.
  7574. 1275.95 s [vector] findIndices: OK
  7575. 1275.95 s [vector] +++ OK, passed 100 tests.
  7576. 1275.95 s [vector] elemIndex: OK
  7577. 1275.95 s [vector] +++ OK, passed 100 tests.
  7578. 1275.95 s [vector] elemIndices: OK
  7579. 1275.95 s [vector] +++ OK, passed 100 tests.
  7580. 1275.97 s [vector] foldl: OK
  7581. 1275.97 s [vector] +++ OK, passed 100 tests.
  7582. 1275.97 s [vector] foldl1: OK (0.01s)
  7583. 1275.97 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7584. 1275.99 s [vector] foldl': OK (0.01s)
  7585. 1275.99 s [vector] +++ OK, passed 100 tests.
  7586. 1276.01 s [vector] foldl1': OK (0.02s)
  7587. 1276.01 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7588. 1276.03 s [vector] foldr: OK (0.01s)
  7589. 1276.03 s [vector] +++ OK, passed 100 tests.
  7590. 1276.03 s [vector] foldr1: OK (0.02s)
  7591. 1276.04 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7592. 1276.05 s [vector] foldr': OK (0.02s)
  7593. 1276.06 s [vector] +++ OK, passed 100 tests.
  7594. 1276.07 s [vector] foldr1': OK (0.02s)
  7595. 1276.07 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7596. 1276.08 s [vector] ifoldl: OK
  7597. 1276.08 s [vector] +++ OK, passed 100 tests.
  7598. 1276.11 s [vector] ifoldl': OK
  7599. 1276.11 s [vector] +++ OK, passed 100 tests.
  7600. 1276.12 s [vector] ifoldr: OK (0.02s)
  7601. 1276.12 s [vector] +++ OK, passed 100 tests.
  7602. 1276.13 s [vector] ifoldr': OK (0.02s)
  7603. 1276.14 s [vector] +++ OK, passed 100 tests.
  7604. 1276.15 s [vector] ifoldM: OK (0.02s)
  7605. 1276.16 s [vector] +++ OK, passed 100 tests.
  7606. 1276.17 s [vector] ifoldM': OK (0.02s)
  7607. 1276.17 s [vector] +++ OK, passed 100 tests.
  7608. 1276.21 s [vector] ifoldM_: OK (0.04s)
  7609. 1276.21 s [vector] +++ OK, passed 100 tests.
  7610. 1276.26 s [vector] ifoldM'_: OK (0.04s)
  7611. 1276.26 s [vector] +++ OK, passed 100 tests.
  7612. 1276.40 s [vector] all: OK
  7613. 1276.40 s [vector] +++ OK, passed 100 tests.
  7614. 1276.40 s [vector] any: OK
  7615. 1276.40 s [vector] +++ OK, passed 100 tests.
  7616. 1276.40 s [vector] prescanl: OK (0.02s)
  7617. 1276.40 s [vector] +++ OK, passed 100 tests.
  7618. 1276.40 s [vector] prescanl': OK
  7619. 1276.40 s [vector] +++ OK, passed 100 tests.
  7620. 1276.40 s [vector] postscanl: OK
  7621. 1276.40 s [vector] +++ OK, passed 100 tests.
  7622. 1276.40 s [vector] postscanl': OK (0.01s)
  7623. 1276.40 s [vector] +++ OK, passed 100 tests.
  7624. 1276.40 s [vector] scanl: OK (0.01s)
  7625. 1276.40 s [vector] +++ OK, passed 100 tests.
  7626. 1276.40 s [vector] scanl': OK (0.01s)
  7627. 1276.40 s [vector] +++ OK, passed 100 tests.
  7628. 1276.40 s [vector] scanl1: OK (0.01s)
  7629. 1276.40 s [vector] +++ OK, passed 100 tests.
  7630. 1276.40 s [vector] scanl1': OK
  7631. 1276.40 s [vector] +++ OK, passed 100 tests.
  7632. 1276.41 s [vector] iscanl: OK (0.01s)
  7633. 1276.41 s [vector] +++ OK, passed 100 tests.
  7634. 1276.43 s [vector] iscanl': OK (0.02s)
  7635. 1276.43 s [vector] +++ OK, passed 100 tests.
  7636. 1276.44 s [vector] prescanr: OK (0.01s)
  7637. 1276.44 s [vector] +++ OK, passed 100 tests.
  7638. 1276.45 s [vector] prescanr': OK (0.02s)
  7639. 1276.46 s [vector] +++ OK, passed 100 tests.
  7640. 1276.47 s [vector] postscanr: OK (0.02s)
  7641. 1276.48 s [vector] +++ OK, passed 100 tests.
  7642. 1276.49 s [vector] postscanr': OK (0.03s)
  7643. 1276.49 s [vector] +++ OK, passed 100 tests.
  7644. 1276.50 s [vector] scanr: OK (0.02s)
  7645. 1276.50 s [vector] +++ OK, passed 100 tests.
  7646. 1276.52 s [vector] scanr': OK
  7647. 1276.52 s [vector] +++ OK, passed 100 tests.
  7648. 1276.53 s [vector] scanr1: OK (0.01s)
  7649. 1276.53 s [vector] +++ OK, passed 100 tests.
  7650. 1276.55 s [vector] scanr1': OK (0.01s)
  7651. 1276.55 s [vector] +++ OK, passed 100 tests.
  7652. 1276.56 s [vector] iscanr: OK
  7653. 1276.56 s [vector] +++ OK, passed 100 tests.
  7654. 1276.58 s [vector] iscanr': OK (0.02s)
  7655. 1276.58 s [vector] +++ OK, passed 100 tests.
  7656. 1276.58 s [vector] mut_read: OK
  7657. 1276.58 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7658. 1276.58 s [vector] mut_write: OK
  7659. 1276.58 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7660. 1276.58 s [vector] mut_modify: OK
  7661. 1276.58 s [vector] +++ OK, passed 100 tests; 20 discarded.
  7662. 1276.58 s [vector] mut_generate: OK
  7663. 1276.58 s [vector] +++ OK, passed 100 tests.
  7664. 1276.61 s [vector] mut_generateM: OK
  7665. 1276.61 s [vector] +++ OK, passed 100 tests.
  7666. 1276.65 s [vector] mut_mapM_: OK (0.04s)
  7667. 1276.66 s [vector] +++ OK, passed 100 tests.
  7668. 1276.69 s [vector] mut_imapM_: OK (0.04s)
  7669. 1276.69 s [vector] +++ OK, passed 100 tests.
  7670. 1276.73 s [vector] mut_forM_: OK (0.04s)
  7671. 1276.74 s [vector] +++ OK, passed 100 tests.
  7672. 1276.77 s [vector] mut_iforM_: OK (0.04s)
  7673. 1276.78 s [vector] +++ OK, passed 100 tests.
  7674. 1276.79 s [vector] mut_foldr: OK (0.01s)
  7675. 1276.80 s [vector] +++ OK, passed 100 tests.
  7676. 1276.81 s [vector] mut_foldr': OK (0.01s)
  7677. 1276.81 s [vector] +++ OK, passed 100 tests.
  7678. 1276.82 s [vector] mut_foldl: OK (0.01s)
  7679. 1276.82 s [vector] +++ OK, passed 100 tests.
  7680. 1276.84 s [vector] mut_foldl': OK (0.01s)
  7681. 1276.84 s [vector] +++ OK, passed 100 tests.
  7682. 1276.85 s [vector] mut_ifoldr: OK (0.01s)
  7683. 1276.85 s [vector] +++ OK, passed 100 tests.
  7684. 1276.85 s [vector] mut_ifoldr': OK (0.01s)
  7685. 1276.85 s [vector] +++ OK, passed 100 tests.
  7686. 1276.87 s [vector] mut_ifoldl: OK (0.01s)
  7687. 1276.88 s [vector] +++ OK, passed 100 tests.
  7688. 1276.88 s [vector] mut_ifoldl': OK (0.02s)
  7689. 1276.88 s [vector] +++ OK, passed 100 tests.
  7690. 1276.89 s [vector] mut_foldM: OK
  7691. 1276.90 s [vector] +++ OK, passed 100 tests.
  7692. 1276.91 s [vector] mut_foldM': OK (0.02s)
  7693. 1276.91 s [vector] +++ OK, passed 100 tests.
  7694. 1276.94 s [vector] mut_foldrM: OK (0.02s)
  7695. 1276.94 s [vector] +++ OK, passed 100 tests.
  7696. 1276.95 s [vector] mut_foldrM': OK (0.02s)
  7697. 1276.95 s [vector] +++ OK, passed 100 tests.
  7698. 1276.97 s [vector] mut_ifoldM: OK (0.02s)
  7699. 1276.98 s [vector] +++ OK, passed 100 tests.
  7700. 1276.99 s [vector] mut_ifoldM': OK (0.02s)
  7701. 1276.99 s [vector] +++ OK, passed 100 tests.
  7702. 1277.01 s [vector] mut_ifoldrM: OK (0.02s)
  7703. 1277.02 s [vector] +++ OK, passed 100 tests.
  7704. 1277.02 s [vector] mut_ifoldrM': OK (0.02s)
  7705. 1277.02 s [vector] +++ OK, passed 100 tests.
  7706. 1277.02 s [vector] compare: OK
  7707. 1277.02 s [vector] +++ OK, passed 100 tests.
  7708. 1277.02 s [vector] maximum: OK
  7709. 1277.02 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7710. 1277.02 s [vector] minimum: OK
  7711. 1277.02 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7712. 1277.03 s [vector] minIndex: OK
  7713. 1277.03 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7714. 1277.03 s [vector] maxIndex: OK
  7715. 1277.03 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7716. 1277.03 s [vector] maximumBy: OK
  7717. 1277.03 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7718. 1277.03 s [vector] minimumBy: OK
  7719. 1277.03 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7720. 1277.03 s [vector] maximumOn: OK
  7721. 1277.03 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7722. 1277.03 s [vector] minimumOn: OK
  7723. 1277.03 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7724. 1277.03 s [vector] maxIndexBy: OK
  7725. 1277.03 s [vector] +++ OK, passed 100 tests; 20 discarded.
  7726. 1277.04 s [vector] minIndexBy: OK
  7727. 1277.04 s [vector] +++ OK, passed 100 tests; 11 discarded.
  7728. 1277.04 s [vector] ListFirstMaxIndexWins: OK
  7729. 1277.04 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7730. 1277.04 s [vector] FalseListFirstMaxIndexWins: OK
  7731. 1277.04 s [vector] +++ OK, failed as expected. (after 1 test):
  7732. 1277.04 s [vector] Exception:
  7733. 1277.04 s [vector] Prelude.foldr1: empty list
  7734. 1277.04 s [vector] CallStack (from HasCallStack):
  7735. 1277.04 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  7736. 1277.04 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  7737. 1277.04 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  7738. 1277.04 s [vector] []
  7739. 1277.04 s [vector] mempty: OK
  7740. 1277.04 s [vector] +++ OK, passed 100 tests.
  7741. 1277.04 s [vector] mappend: OK
  7742. 1277.04 s [vector] +++ OK, passed 100 tests.
  7743. 1277.06 s [vector] mconcat: OK
  7744. 1277.06 s [vector] +++ OK, passed 100 tests.
  7745. 1277.06 s [vector] glength: OK
  7746. 1277.06 s [vector] +++ OK, passed 100 tests.
  7747. 1277.06 s [vector] sum: OK
  7748. 1277.06 s [vector] +++ OK, passed 100 tests.
  7749. 1277.06 s [vector] product: OK
  7750. 1277.06 s [vector] +++ OK, passed 100 tests.
  7751. 1277.06 s [vector] enumFromN: OK
  7752. 1277.06 s [vector] +++ OK, passed 100 tests.
  7753. 1277.07 s [vector] enumFromThenN: OK
  7754. 1277.07 s [vector] +++ OK, passed 100 tests.
  7755. 1277.07 s [vector] enumFromTo: OK
  7756. 1277.07 s [vector] +++ OK, passed 100 tests.
  7757. 1277.07 s [vector] enumFromThenTo: OK
  7758. 1277.07 s [vector] +++ OK, passed 100 tests.
  7759. 1277.07 s [vector] unstream
  7760. 1277.07 s [vector] unstream == vunstream (exact): OK
  7761. 1277.07 s [vector] +++ OK, passed 100 tests.
  7762. 1277.08 s [vector] unstream == vunstream (unknown): OK
  7763. 1277.08 s [vector] +++ OK, passed 100 tests.
  7764. 1277.08 s [vector] unstreamR ~= vunstream (exact): OK
  7765. 1277.08 s [vector] +++ OK, passed 100 tests.
  7766. 1277.08 s [vector] unstreamR ~= vunstream (unknown): OK
  7767. 1277.08 s [vector] +++ OK, passed 100 tests.
  7768. 1277.08 s [vector] Tests.Vector.Strict
  7769. 1277.08 s [vector] Bool
  7770. 1277.08 s [vector] fromList.toList == id: OK
  7771. 1277.08 s [vector] +++ OK, passed 100 tests.
  7772. 1277.08 s [vector] toList.fromList == id: OK
  7773. 1277.08 s [vector] +++ OK, passed 100 tests.
  7774. 1277.08 s [vector] unstream.stream == id: OK
  7775. 1277.08 s [vector] +++ OK, passed 100 tests.
  7776. 1277.08 s [vector] stream.unstream == id: OK
  7777. 1277.08 s [vector] +++ OK, passed 100 tests.
  7778. 1277.08 s [vector] eq: OK
  7779. 1277.08 s [vector] +++ OK, passed 100 tests.
  7780. 1277.08 s [vector] length: OK
  7781. 1277.08 s [vector] +++ OK, passed 100 tests.
  7782. 1277.08 s [vector] null: OK
  7783. 1277.08 s [vector] +++ OK, passed 100 tests.
  7784. 1277.08 s [vector] index: OK
  7785. 1277.08 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7786. 1277.08 s [vector] safeIndex: OK
  7787. 1277.08 s [vector] +++ OK, passed 100 tests.
  7788. 1277.08 s [vector] head: OK
  7789. 1277.08 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7790. 1277.08 s [vector] last: OK
  7791. 1277.08 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7792. 1277.08 s [vector] unsafeIndex: OK
  7793. 1277.08 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7794. 1277.08 s [vector] unsafeHead: OK
  7795. 1277.08 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7796. 1277.08 s [vector] unsafeLast: OK
  7797. 1277.08 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7798. 1277.08 s [vector] slice: OK
  7799. 1277.08 s [vector] +++ OK, passed 100 tests.
  7800. 1277.08 s [vector] init: OK
  7801. 1277.08 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7802. 1277.09 s [vector] tail: OK
  7803. 1277.09 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7804. 1277.09 s [vector] take: OK
  7805. 1277.09 s [vector] +++ OK, passed 100 tests.
  7806. 1277.09 s [vector] drop: OK
  7807. 1277.09 s [vector] +++ OK, passed 100 tests.
  7808. 1277.09 s [vector] splitAt: OK
  7809. 1277.09 s [vector] +++ OK, passed 100 tests.
  7810. 1277.09 s [vector] empty: OK
  7811. 1277.09 s [vector] +++ OK, passed 100 tests.
  7812. 1277.09 s [vector] singleton: OK
  7813. 1277.09 s [vector] +++ OK, passed 100 tests.
  7814. 1277.09 s [vector] replicate: OK
  7815. 1277.09 s [vector] +++ OK, passed 100 tests.
  7816. 1277.09 s [vector] generate: OK
  7817. 1277.09 s [vector] +++ OK, passed 100 tests.
  7818. 1277.09 s [vector] iterateN: OK
  7819. 1277.09 s [vector] +++ OK, passed 100 tests.
  7820. 1277.13 s [vector] iterateNM: OK (0.03s)
  7821. 1277.13 s [vector] +++ OK, passed 100 tests.
  7822. 1277.14 s [vector] generateM: OK (0.02s)
  7823. 1277.14 s [vector] +++ OK, passed 100 tests.
  7824. 1277.15 s [vector] replicateM: OK
  7825. 1277.15 s [vector] +++ OK, passed 100 tests.
  7826. 1277.15 s [vector] create: OK
  7827. 1277.15 s [vector] +++ OK, passed 100 tests.
  7828. 1277.15 s [vector] createT: OK
  7829. 1277.15 s [vector] +++ OK, passed 100 tests.
  7830. 1277.15 s [vector] unfoldr: OK
  7831. 1277.15 s [vector] +++ OK, passed 100 tests.
  7832. 1277.15 s [vector] unfoldrN: OK
  7833. 1277.15 s [vector] +++ OK, passed 100 tests.
  7834. 1277.15 s [vector] unfoldrExactN: OK
  7835. 1277.15 s [vector] +++ OK, passed 100 tests.
  7836. 1277.15 s [vector] unfoldrM: OK
  7837. 1277.15 s [vector] +++ OK, passed 100 tests.
  7838. 1277.17 s [vector] unfoldrNM: OK
  7839. 1277.17 s [vector] +++ OK, passed 100 tests.
  7840. 1277.20 s [vector] unfoldrExactNM: OK (0.05s)
  7841. 1277.20 s [vector] +++ OK, passed 100 tests.
  7842. 1277.20 s [vector] constructN: OK
  7843. 1277.21 s [vector] +++ OK, passed 100 tests.
  7844. 1277.21 s [vector] constructrN: OK
  7845. 1277.21 s [vector] +++ OK, passed 100 tests.
  7846. 1277.21 s [vector] cons: OK
  7847. 1277.21 s [vector] +++ OK, passed 100 tests.
  7848. 1277.21 s [vector] snoc: OK
  7849. 1277.21 s [vector] +++ OK, passed 100 tests.
  7850. 1277.21 s [vector] append: OK
  7851. 1277.21 s [vector] +++ OK, passed 100 tests.
  7852. 1277.22 s [vector] concat: OK
  7853. 1277.22 s [vector] +++ OK, passed 100 tests.
  7854. 1277.22 s [vector] force: OK
  7855. 1277.22 s [vector] +++ OK, passed 100 tests.
  7856. 1277.22 s [vector] upd: OK
  7857. 1277.22 s [vector] +++ OK, passed 100 tests.
  7858. 1277.22 s [vector] accum: OK
  7859. 1277.22 s [vector] +++ OK, passed 100 tests.
  7860. 1277.22 s [vector] reverse: OK
  7861. 1277.22 s [vector] +++ OK, passed 100 tests.
  7862. 1277.23 s [vector] backpermute: OK
  7863. 1277.23 s [vector] +++ OK, passed 100 tests.
  7864. 1277.23 s [vector] map: OK
  7865. 1277.23 s [vector] +++ OK, passed 100 tests.
  7866. 1277.23 s [vector] imap: OK
  7867. 1277.23 s [vector] +++ OK, passed 100 tests.
  7868. 1277.23 s [vector] concatMap: OK
  7869. 1277.23 s [vector] +++ OK, passed 100 tests.
  7870. 1277.23 s [vector] mapM: OK
  7871. 1277.23 s [vector] +++ OK, passed 100 tests.
  7872. 1277.24 s [vector] mapM_: OK
  7873. 1277.24 s [vector] +++ OK, passed 100 tests.
  7874. 1277.24 s [vector] forM: OK
  7875. 1277.24 s [vector] +++ OK, passed 100 tests.
  7876. 1277.26 s [vector] forM_: OK
  7877. 1277.26 s [vector] +++ OK, passed 100 tests.
  7878. 1277.26 s [vector] imapM: OK
  7879. 1277.26 s [vector] +++ OK, passed 100 tests.
  7880. 1277.28 s [vector] imapM_: OK
  7881. 1277.28 s [vector] +++ OK, passed 100 tests.
  7882. 1277.28 s [vector] zipWith: OK
  7883. 1277.28 s [vector] +++ OK, passed 100 tests.
  7884. 1277.28 s [vector] zipWith3: OK
  7885. 1277.28 s [vector] +++ OK, passed 100 tests.
  7886. 1277.28 s [vector] izipWith: OK
  7887. 1277.28 s [vector] +++ OK, passed 100 tests.
  7888. 1277.29 s [vector] izipWith3: OK
  7889. 1277.29 s [vector] +++ OK, passed 100 tests.
  7890. 1277.29 s [vector] izipWithM: OK
  7891. 1277.30 s [vector] +++ OK, passed 100 tests.
  7892. 1277.30 s [vector] izipWithM_: OK
  7893. 1277.31 s [vector] +++ OK, passed 100 tests.
  7894. 1277.31 s [vector] zipWithM: OK
  7895. 1277.31 s [vector] +++ OK, passed 100 tests.
  7896. 1277.32 s [vector] zipWithM_: OK
  7897. 1277.32 s [vector] +++ OK, passed 100 tests.
  7898. 1277.32 s [vector] filter: OK
  7899. 1277.32 s [vector] +++ OK, passed 100 tests.
  7900. 1277.32 s [vector] ifilter: OK
  7901. 1277.32 s [vector] +++ OK, passed 100 tests.
  7902. 1277.33 s [vector] filterM: OK (0.02s)
  7903. 1277.33 s [vector] +++ OK, passed 100 tests.
  7904. 1277.33 s [vector] uniq: OK
  7905. 1277.33 s [vector] +++ OK, passed 100 tests.
  7906. 1277.33 s [vector] mapMaybe: OK
  7907. 1277.33 s [vector] +++ OK, passed 100 tests.
  7908. 1277.33 s [vector] imapMaybe: OK
  7909. 1277.33 s [vector] +++ OK, passed 100 tests.
  7910. 1277.33 s [vector] takeWhile: OK
  7911. 1277.33 s [vector] +++ OK, passed 100 tests.
  7912. 1277.33 s [vector] dropWhile: OK
  7913. 1277.33 s [vector] +++ OK, passed 100 tests.
  7914. 1277.33 s [vector] partition: OK
  7915. 1277.33 s [vector] +++ OK, passed 100 tests.
  7916. 1277.34 s [vector] partitionWith: OK
  7917. 1277.34 s [vector] +++ OK, passed 100 tests.
  7918. 1277.34 s [vector] span: OK
  7919. 1277.34 s [vector] +++ OK, passed 100 tests.
  7920. 1277.34 s [vector] break: OK
  7921. 1277.34 s [vector] +++ OK, passed 100 tests.
  7922. 1277.34 s [vector] spanR: OK
  7923. 1277.34 s [vector] +++ OK, passed 100 tests.
  7924. 1277.34 s [vector] breakR: OK
  7925. 1277.34 s [vector] +++ OK, passed 100 tests.
  7926. 1277.34 s [vector] groupBy: OK
  7927. 1277.34 s [vector] +++ OK, passed 100 tests.
  7928. 1277.34 s [vector] elem: OK
  7929. 1277.34 s [vector] +++ OK, passed 100 tests.
  7930. 1277.34 s [vector] notElem: OK
  7931. 1277.34 s [vector] +++ OK, passed 100 tests.
  7932. 1277.34 s [vector] find: OK
  7933. 1277.34 s [vector] +++ OK, passed 100 tests.
  7934. 1277.34 s [vector] findIndex: OK
  7935. 1277.34 s [vector] +++ OK, passed 100 tests.
  7936. 1277.34 s [vector] findIndexR: OK
  7937. 1277.34 s [vector] +++ OK, passed 100 tests.
  7938. 1277.35 s [vector] findIndices: OK
  7939. 1277.35 s [vector] +++ OK, passed 100 tests.
  7940. 1277.35 s [vector] elemIndex: OK
  7941. 1277.35 s [vector] +++ OK, passed 100 tests.
  7942. 1277.35 s [vector] elemIndices: OK
  7943. 1277.35 s [vector] +++ OK, passed 100 tests.
  7944. 1277.35 s [vector] foldl: OK
  7945. 1277.35 s [vector] +++ OK, passed 100 tests.
  7946. 1277.35 s [vector] foldl1: OK
  7947. 1277.35 s [vector] +++ OK, passed 100 tests; 21 discarded.
  7948. 1277.35 s [vector] foldl': OK
  7949. 1277.35 s [vector] +++ OK, passed 100 tests.
  7950. 1277.35 s [vector] foldl1': OK
  7951. 1277.35 s [vector] +++ OK, passed 100 tests; 22 discarded.
  7952. 1277.35 s [vector] foldr: OK
  7953. 1277.35 s [vector] +++ OK, passed 100 tests.
  7954. 1277.36 s [vector] foldr1: OK
  7955. 1277.36 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7956. 1277.36 s [vector] foldr': OK
  7957. 1277.36 s [vector] +++ OK, passed 100 tests.
  7958. 1277.37 s [vector] foldr1': OK
  7959. 1277.37 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7960. 1277.37 s [vector] ifoldl: OK
  7961. 1277.37 s [vector] +++ OK, passed 100 tests.
  7962. 1277.37 s [vector] ifoldl': OK
  7963. 1277.37 s [vector] +++ OK, passed 100 tests.
  7964. 1277.37 s [vector] ifoldr: OK
  7965. 1277.37 s [vector] +++ OK, passed 100 tests.
  7966. 1277.37 s [vector] ifoldr': OK
  7967. 1277.37 s [vector] +++ OK, passed 100 tests.
  7968. 1277.37 s [vector] ifoldM: OK
  7969. 1277.37 s [vector] +++ OK, passed 100 tests.
  7970. 1277.38 s [vector] ifoldM': OK
  7971. 1277.38 s [vector] +++ OK, passed 100 tests.
  7972. 1277.40 s [vector] ifoldM_: OK (0.02s)
  7973. 1277.40 s [vector] +++ OK, passed 100 tests.
  7974. 1277.40 s [vector] ifoldM'_: OK (0.02s)
  7975. 1277.41 s [vector] +++ OK, passed 100 tests.
  7976. 1277.41 s [vector] all: OK
  7977. 1277.41 s [vector] +++ OK, passed 100 tests.
  7978. 1277.41 s [vector] any: OK
  7979. 1277.41 s [vector] +++ OK, passed 100 tests.
  7980. 1277.41 s [vector] prescanl: OK
  7981. 1277.41 s [vector] +++ OK, passed 100 tests.
  7982. 1277.41 s [vector] prescanl': OK
  7983. 1277.41 s [vector] +++ OK, passed 100 tests.
  7984. 1277.42 s [vector] postscanl: OK
  7985. 1277.42 s [vector] +++ OK, passed 100 tests.
  7986. 1277.42 s [vector] postscanl': OK
  7987. 1277.42 s [vector] +++ OK, passed 100 tests.
  7988. 1277.42 s [vector] scanl: OK
  7989. 1277.42 s [vector] +++ OK, passed 100 tests.
  7990. 1277.42 s [vector] scanl': OK
  7991. 1277.42 s [vector] +++ OK, passed 100 tests.
  7992. 1277.42 s [vector] scanl1: OK
  7993. 1277.42 s [vector] +++ OK, passed 100 tests.
  7994. 1277.42 s [vector] scanl1': OK
  7995. 1277.43 s [vector] +++ OK, passed 100 tests.
  7996. 1277.43 s [vector] iscanl: OK
  7997. 1277.43 s [vector] +++ OK, passed 100 tests.
  7998. 1277.43 s [vector] iscanl': OK
  7999. 1277.43 s [vector] +++ OK, passed 100 tests.
  8000. 1277.43 s [vector] prescanr: OK
  8001. 1277.43 s [vector] +++ OK, passed 100 tests.
  8002. 1277.43 s [vector] prescanr': OK
  8003. 1277.43 s [vector] +++ OK, passed 100 tests.
  8004. 1277.44 s [vector] postscanr: OK
  8005. 1277.44 s [vector] +++ OK, passed 100 tests.
  8006. 1277.44 s [vector] postscanr': OK
  8007. 1277.44 s [vector] +++ OK, passed 100 tests.
  8008. 1277.44 s [vector] scanr: OK
  8009. 1277.44 s [vector] +++ OK, passed 100 tests.
  8010. 1277.44 s [vector] scanr': OK
  8011. 1277.44 s [vector] +++ OK, passed 100 tests.
  8012. 1277.44 s [vector] scanr1: OK
  8013. 1277.44 s [vector] +++ OK, passed 100 tests.
  8014. 1277.44 s [vector] scanr1': OK
  8015. 1277.44 s [vector] +++ OK, passed 100 tests.
  8016. 1277.45 s [vector] iscanr: OK
  8017. 1277.45 s [vector] +++ OK, passed 100 tests.
  8018. 1277.45 s [vector] iscanr': OK
  8019. 1277.45 s [vector] +++ OK, passed 100 tests.
  8020. 1277.45 s [vector] mut_read: OK
  8021. 1277.45 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8022. 1277.45 s [vector] mut_write: OK
  8023. 1277.46 s [vector] +++ OK, passed 100 tests; 20 discarded.
  8024. 1277.46 s [vector] mut_modify: OK
  8025. 1277.46 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8026. 1277.46 s [vector] mut_generate: OK
  8027. 1277.46 s [vector] +++ OK, passed 100 tests.
  8028. 1277.46 s [vector] mut_generateM: OK
  8029. 1277.46 s [vector] +++ OK, passed 100 tests.
  8030. 1277.49 s [vector] mut_mapM_: OK
  8031. 1277.49 s [vector] +++ OK, passed 100 tests.
  8032. 1277.49 s [vector] mut_imapM_: OK (0.01s)
  8033. 1277.49 s [vector] +++ OK, passed 100 tests.
  8034. 1277.50 s [vector] mut_forM_: OK
  8035. 1277.50 s [vector] +++ OK, passed 100 tests.
  8036. 1277.51 s [vector] mut_iforM_: OK (0.01s)
  8037. 1277.51 s [vector] +++ OK, passed 100 tests.
  8038. 1277.51 s [vector] mut_foldr: OK
  8039. 1277.51 s [vector] +++ OK, passed 100 tests.
  8040. 1277.52 s [vector] mut_foldr': OK
  8041. 1277.52 s [vector] +++ OK, passed 100 tests.
  8042. 1277.52 s [vector] mut_foldl: OK
  8043. 1277.52 s [vector] +++ OK, passed 100 tests.
  8044. 1277.52 s [vector] mut_foldl': OK
  8045. 1277.52 s [vector] +++ OK, passed 100 tests.
  8046. 1277.52 s [vector] mut_ifoldr: OK
  8047. 1277.52 s [vector] +++ OK, passed 100 tests.
  8048. 1277.52 s [vector] mut_ifoldr': OK
  8049. 1277.53 s [vector] +++ OK, passed 100 tests.
  8050. 1277.53 s [vector] mut_ifoldl: OK
  8051. 1277.53 s [vector] +++ OK, passed 100 tests.
  8052. 1277.53 s [vector] mut_ifoldl': OK
  8053. 1277.53 s [vector] +++ OK, passed 100 tests.
  8054. 1277.53 s [vector] mut_foldM: OK
  8055. 1277.53 s [vector] +++ OK, passed 100 tests.
  8056. 1277.54 s [vector] mut_foldM': OK
  8057. 1277.54 s [vector] +++ OK, passed 100 tests.
  8058. 1277.54 s [vector] mut_foldrM: OK
  8059. 1277.54 s [vector] +++ OK, passed 100 tests.
  8060. 1277.54 s [vector] mut_foldrM': OK
  8061. 1277.54 s [vector] +++ OK, passed 100 tests.
  8062. 1277.54 s [vector] mut_ifoldM: OK
  8063. 1277.54 s [vector] +++ OK, passed 100 tests.
  8064. 1277.55 s [vector] mut_ifoldM': OK
  8065. 1277.55 s [vector] +++ OK, passed 100 tests.
  8066. 1277.55 s [vector] mut_ifoldrM: OK
  8067. 1277.55 s [vector] +++ OK, passed 100 tests.
  8068. 1277.55 s [vector] mut_ifoldrM': OK
  8069. 1277.55 s [vector] +++ OK, passed 100 tests.
  8070. 1277.55 s [vector] compare: OK
  8071. 1277.55 s [vector] +++ OK, passed 100 tests.
  8072. 1277.55 s [vector] maximum: OK
  8073. 1277.55 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8074. 1277.55 s [vector] minimum: OK
  8075. 1277.55 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8076. 1277.55 s [vector] minIndex: OK
  8077. 1277.55 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8078. 1277.55 s [vector] maxIndex: OK
  8079. 1277.55 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8080. 1277.55 s [vector] maximumBy: OK
  8081. 1277.55 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8082. 1277.55 s [vector] minimumBy: OK
  8083. 1277.55 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8084. 1277.55 s [vector] maximumOn: OK
  8085. 1277.55 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8086. 1277.55 s [vector] minimumOn: OK
  8087. 1277.55 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8088. 1277.55 s [vector] maxIndexBy: OK
  8089. 1277.55 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8090. 1277.55 s [vector] minIndexBy: OK
  8091. 1277.55 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8092. 1277.55 s [vector] ListFirstMaxIndexWins: OK
  8093. 1277.55 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8094. 1277.55 s [vector] FalseListFirstMaxIndexWins: OK
  8095. 1277.55 s [vector] +++ OK, failed as expected. (after 1 test):
  8096. 1277.55 s [vector] Exception:
  8097. 1277.55 s [vector] Prelude.foldr1: empty list
  8098. 1277.55 s [vector] CallStack (from HasCallStack):
  8099. 1277.55 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  8100. 1277.56 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  8101. 1277.56 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  8102. 1277.56 s [vector] []
  8103. 1277.56 s [vector] zip: OK
  8104. 1277.56 s [vector] +++ OK, passed 100 tests.
  8105. 1277.56 s [vector] zip3: OK
  8106. 1277.56 s [vector] +++ OK, passed 100 tests.
  8107. 1277.56 s [vector] unzip: OK
  8108. 1277.56 s [vector] +++ OK, passed 100 tests.
  8109. 1277.56 s [vector] unzip3: OK
  8110. 1277.56 s [vector] +++ OK, passed 100 tests.
  8111. 1277.56 s [vector] indexed: OK
  8112. 1277.56 s [vector] +++ OK, passed 100 tests.
  8113. 1277.56 s [vector] update: OK
  8114. 1277.56 s [vector] +++ OK, passed 100 tests.
  8115. 1277.57 s [vector] concat: OK
  8116. 1277.57 s [vector] +++ OK, passed 100 tests.
  8117. 1277.57 s [vector] mempty: OK
  8118. 1277.57 s [vector] +++ OK, passed 100 tests.
  8119. 1277.57 s [vector] mappend: OK
  8120. 1277.57 s [vector] +++ OK, passed 100 tests.
  8121. 1277.58 s [vector] mconcat: OK
  8122. 1277.58 s [vector] +++ OK, passed 100 tests.
  8123. 1277.58 s [vector] fmap: OK
  8124. 1277.58 s [vector] +++ OK, passed 100 tests.
  8125. 1277.58 s [vector] return: OK
  8126. 1277.59 s [vector] +++ OK, passed 100 tests.
  8127. 1277.59 s [vector] bind: OK (0.01s)
  8128. 1277.59 s [vector] +++ OK, passed 100 tests.
  8129. 1277.59 s [vector] mzip: OK
  8130. 1277.60 s [vector] +++ OK, passed 100 tests.
  8131. 1277.61 s [vector] munzip: OK
  8132. 1277.61 s [vector] +++ OK, passed 100 tests.
  8133. 1277.61 s [vector] applicative_pure: OK
  8134. 1277.61 s [vector] +++ OK, passed 100 tests.
  8135. 1277.61 s [vector] applicative_appl: OK (0.02s)
  8136. 1277.61 s [vector] +++ OK, passed 100 tests.
  8137. 1277.61 s [vector] alternative_empty: OK
  8138. 1277.61 s [vector] +++ OK, passed 100 tests.
  8139. 1277.61 s [vector] alternative_or: OK
  8140. 1277.61 s [vector] +++ OK, passed 100 tests.
  8141. 1277.67 s [vector] sequence: OK (0.05s)
  8142. 1277.67 s [vector] +++ OK, passed 100 tests.
  8143. 1277.67 s [vector] sequence_: OK
  8144. 1277.67 s [vector] +++ OK, passed 100 tests.
  8145. 1277.67 s [vector] glength: OK
  8146. 1277.67 s [vector] +++ OK, passed 100 tests.
  8147. 1277.67 s [vector] and: OK
  8148. 1277.67 s [vector] +++ OK, passed 100 tests.
  8149. 1277.68 s [vector] or: OK
  8150. 1277.68 s [vector] +++ OK, passed 100 tests.
  8151. 1277.68 s [vector] Int
  8152. 1277.68 s [vector] fromList.toList == id: OK
  8153. 1277.68 s [vector] +++ OK, passed 100 tests.
  8154. 1277.68 s [vector] toList.fromList == id: OK
  8155. 1277.68 s [vector] +++ OK, passed 100 tests.
  8156. 1277.68 s [vector] unstream.stream == id: OK
  8157. 1277.68 s [vector] +++ OK, passed 100 tests.
  8158. 1277.68 s [vector] stream.unstream == id: OK
  8159. 1277.68 s [vector] +++ OK, passed 100 tests.
  8160. 1277.68 s [vector] eq: OK
  8161. 1277.68 s [vector] +++ OK, passed 100 tests.
  8162. 1277.68 s [vector] length: OK
  8163. 1277.68 s [vector] +++ OK, passed 100 tests.
  8164. 1277.68 s [vector] null: OK
  8165. 1277.68 s [vector] +++ OK, passed 100 tests.
  8166. 1277.68 s [vector] index: OK
  8167. 1277.68 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8168. 1277.68 s [vector] safeIndex: OK
  8169. 1277.68 s [vector] +++ OK, passed 100 tests.
  8170. 1277.68 s [vector] head: OK
  8171. 1277.68 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8172. 1277.68 s [vector] last: OK
  8173. 1277.68 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8174. 1277.68 s [vector] unsafeIndex: OK
  8175. 1277.68 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8176. 1277.68 s [vector] unsafeHead: OK
  8177. 1277.68 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8178. 1277.68 s [vector] unsafeLast: OK
  8179. 1277.68 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8180. 1277.68 s [vector] slice: OK
  8181. 1277.68 s [vector] +++ OK, passed 100 tests.
  8182. 1277.68 s [vector] init: OK
  8183. 1277.68 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8184. 1277.68 s [vector] tail: OK
  8185. 1277.68 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8186. 1277.68 s [vector] take: OK
  8187. 1277.68 s [vector] +++ OK, passed 100 tests.
  8188. 1277.69 s [vector] drop: OK
  8189. 1277.69 s [vector] +++ OK, passed 100 tests.
  8190. 1277.69 s [vector] splitAt: OK
  8191. 1277.69 s [vector] +++ OK, passed 100 tests.
  8192. 1277.69 s [vector] empty: OK
  8193. 1277.69 s [vector] +++ OK, passed 100 tests.
  8194. 1277.69 s [vector] singleton: OK
  8195. 1277.69 s [vector] +++ OK, passed 100 tests.
  8196. 1277.69 s [vector] replicate: OK
  8197. 1277.69 s [vector] +++ OK, passed 100 tests.
  8198. 1277.69 s [vector] generate: OK
  8199. 1277.69 s [vector] +++ OK, passed 100 tests.
  8200. 1277.69 s [vector] iterateN: OK
  8201. 1277.69 s [vector] +++ OK, passed 100 tests.
  8202. 1277.73 s [vector] iterateNM: OK (0.03s)
  8203. 1277.73 s [vector] +++ OK, passed 100 tests.
  8204. 1277.75 s [vector] generateM: OK (0.01s)
  8205. 1277.75 s [vector] +++ OK, passed 100 tests.
  8206. 1277.75 s [vector] replicateM: OK (0.01s)
  8207. 1277.75 s [vector] +++ OK, passed 100 tests.
  8208. 1277.75 s [vector] create: OK
  8209. 1277.75 s [vector] +++ OK, passed 100 tests.
  8210. 1277.76 s [vector] createT: OK
  8211. 1277.76 s [vector] +++ OK, passed 100 tests.
  8212. 1277.76 s [vector] unfoldr: OK
  8213. 1277.76 s [vector] +++ OK, passed 100 tests.
  8214. 1277.76 s [vector] unfoldrN: OK
  8215. 1277.76 s [vector] +++ OK, passed 100 tests.
  8216. 1277.77 s [vector] unfoldrExactN: OK
  8217. 1277.77 s [vector] +++ OK, passed 100 tests.
  8218. 1277.77 s [vector] unfoldrM: OK
  8219. 1277.77 s [vector] +++ OK, passed 100 tests.
  8220. 1277.78 s [vector] unfoldrNM: OK
  8221. 1277.80 s [vector] +++ OK, passed 100 tests.
  8222. 1277.85 s [vector] unfoldrExactNM: OK (0.07s)
  8223. 1277.85 s [vector] +++ OK, passed 100 tests.
  8224. 1277.86 s [vector] constructN: OK
  8225. 1277.86 s [vector] +++ OK, passed 100 tests.
  8226. 1277.86 s [vector] constructrN: OK
  8227. 1277.86 s [vector] +++ OK, passed 100 tests.
  8228. 1277.86 s [vector] cons: OK
  8229. 1277.86 s [vector] +++ OK, passed 100 tests.
  8230. 1277.86 s [vector] snoc: OK
  8231. 1277.86 s [vector] +++ OK, passed 100 tests.
  8232. 1277.86 s [vector] append: OK
  8233. 1277.86 s [vector] +++ OK, passed 100 tests.
  8234. 1277.87 s [vector] concat: OK
  8235. 1277.87 s [vector] +++ OK, passed 100 tests.
  8236. 1277.87 s [vector] force: OK
  8237. 1277.87 s [vector] +++ OK, passed 100 tests.
  8238. 1277.88 s [vector] upd: OK
  8239. 1277.88 s [vector] +++ OK, passed 100 tests.
  8240. 1277.88 s [vector] accum: OK
  8241. 1277.88 s [vector] +++ OK, passed 100 tests.
  8242. 1277.89 s [vector] reverse: OK
  8243. 1277.89 s [vector] +++ OK, passed 100 tests.
  8244. 1277.89 s [vector] backpermute: OK
  8245. 1277.89 s [vector] +++ OK, passed 100 tests.
  8246. 1277.89 s [vector] map: OK
  8247. 1277.89 s [vector] +++ OK, passed 100 tests.
  8248. 1277.89 s [vector] imap: OK
  8249. 1277.89 s [vector] +++ OK, passed 100 tests.
  8250. 1277.89 s [vector] concatMap: OK
  8251. 1277.89 s [vector] +++ OK, passed 100 tests.
  8252. 1277.89 s [vector] mapM: OK
  8253. 1277.89 s [vector] +++ OK, passed 100 tests.
  8254. 1277.91 s [vector] mapM_: OK (0.01s)
  8255. 1277.91 s [vector] +++ OK, passed 100 tests.
  8256. 1277.91 s [vector] forM: OK
  8257. 1277.92 s [vector] +++ OK, passed 100 tests.
  8258. 1277.93 s [vector] forM_: OK (0.02s)
  8259. 1277.93 s [vector] +++ OK, passed 100 tests.
  8260. 1277.94 s [vector] imapM: OK
  8261. 1277.94 s [vector] +++ OK, passed 100 tests.
  8262. 1277.95 s [vector] imapM_: OK (0.02s)
  8263. 1277.95 s [vector] +++ OK, passed 100 tests.
  8264. 1277.95 s [vector] zipWith: OK
  8265. 1277.95 s [vector] +++ OK, passed 100 tests.
  8266. 1277.95 s [vector] zipWith3: OK
  8267. 1277.95 s [vector] +++ OK, passed 100 tests.
  8268. 1277.96 s [vector] izipWith: OK
  8269. 1277.96 s [vector] +++ OK, passed 100 tests.
  8270. 1277.96 s [vector] izipWith3: OK
  8271. 1277.96 s [vector] +++ OK, passed 100 tests.
  8272. 1277.96 s [vector] izipWithM: OK
  8273. 1277.96 s [vector] +++ OK, passed 100 tests.
  8274. 1277.97 s [vector] izipWithM_: OK (0.01s)
  8275. 1277.98 s [vector] +++ OK, passed 100 tests.
  8276. 1277.99 s [vector] zipWithM: OK
  8277. 1277.99 s [vector] +++ OK, passed 100 tests.
  8278. 1277.99 s [vector] zipWithM_: OK (0.01s)
  8279. 1277.99 s [vector] +++ OK, passed 100 tests.
  8280. 1277.99 s [vector] filter: OK
  8281. 1277.99 s [vector] +++ OK, passed 100 tests.
  8282. 1278.00 s [vector] ifilter: OK
  8283. 1278.00 s [vector] +++ OK, passed 100 tests.
  8284. 1278.04 s [vector] filterM: OK (0.02s)
  8285. 1278.04 s [vector] +++ OK, passed 100 tests.
  8286. 1278.04 s [vector] uniq: OK
  8287. 1278.04 s [vector] +++ OK, passed 100 tests.
  8288. 1278.04 s [vector] mapMaybe: OK
  8289. 1278.04 s [vector] +++ OK, passed 100 tests.
  8290. 1278.04 s [vector] imapMaybe: OK
  8291. 1278.04 s [vector] +++ OK, passed 100 tests.
  8292. 1278.04 s [vector] takeWhile: OK
  8293. 1278.04 s [vector] +++ OK, passed 100 tests.
  8294. 1278.04 s [vector] dropWhile: OK
  8295. 1278.04 s [vector] +++ OK, passed 100 tests.
  8296. 1278.05 s [vector] partition: OK
  8297. 1278.05 s [vector] +++ OK, passed 100 tests.
  8298. 1278.05 s [vector] partitionWith: OK
  8299. 1278.05 s [vector] +++ OK, passed 100 tests.
  8300. 1278.05 s [vector] span: OK
  8301. 1278.05 s [vector] +++ OK, passed 100 tests.
  8302. 1278.05 s [vector] break: OK
  8303. 1278.05 s [vector] +++ OK, passed 100 tests.
  8304. 1278.05 s [vector] spanR: OK
  8305. 1278.05 s [vector] +++ OK, passed 100 tests.
  8306. 1278.05 s [vector] breakR: OK
  8307. 1278.05 s [vector] +++ OK, passed 100 tests.
  8308. 1278.05 s [vector] groupBy: OK
  8309. 1278.05 s [vector] +++ OK, passed 100 tests.
  8310. 1278.06 s [vector] elem: OK
  8311. 1278.06 s [vector] +++ OK, passed 100 tests.
  8312. 1278.06 s [vector] notElem: OK
  8313. 1278.06 s [vector] +++ OK, passed 100 tests.
  8314. 1278.06 s [vector] find: OK
  8315. 1278.06 s [vector] +++ OK, passed 100 tests.
  8316. 1278.06 s [vector] findIndex: OK
  8317. 1278.06 s [vector] +++ OK, passed 100 tests.
  8318. 1278.06 s [vector] findIndexR: OK
  8319. 1278.06 s [vector] +++ OK, passed 100 tests.
  8320. 1278.06 s [vector] findIndices: OK
  8321. 1278.06 s [vector] +++ OK, passed 100 tests.
  8322. 1278.06 s [vector] elemIndex: OK
  8323. 1278.06 s [vector] +++ OK, passed 100 tests.
  8324. 1278.06 s [vector] elemIndices: OK
  8325. 1278.06 s [vector] +++ OK, passed 100 tests.
  8326. 1278.06 s [vector] foldl: OK
  8327. 1278.06 s [vector] +++ OK, passed 100 tests.
  8328. 1278.07 s [vector] foldl1: OK
  8329. 1278.07 s [vector] +++ OK, passed 100 tests; 20 discarded.
  8330. 1278.07 s [vector] foldl': OK
  8331. 1278.07 s [vector] +++ OK, passed 100 tests.
  8332. 1278.07 s [vector] foldl1': OK
  8333. 1278.08 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8334. 1278.08 s [vector] foldr: OK
  8335. 1278.08 s [vector] +++ OK, passed 100 tests.
  8336. 1278.09 s [vector] foldr1: OK
  8337. 1278.09 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8338. 1278.09 s [vector] foldr': OK
  8339. 1278.09 s [vector] +++ OK, passed 100 tests.
  8340. 1278.09 s [vector] foldr1': OK
  8341. 1278.09 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8342. 1278.09 s [vector] ifoldl: OK
  8343. 1278.09 s [vector] +++ OK, passed 100 tests.
  8344. 1278.09 s [vector] ifoldl': OK
  8345. 1278.09 s [vector] +++ OK, passed 100 tests.
  8346. 1278.10 s [vector] ifoldr: OK
  8347. 1278.10 s [vector] +++ OK, passed 100 tests.
  8348. 1278.10 s [vector] ifoldr': OK
  8349. 1278.10 s [vector] +++ OK, passed 100 tests.
  8350. 1278.11 s [vector] ifoldM: OK
  8351. 1278.11 s [vector] +++ OK, passed 100 tests.
  8352. 1278.11 s [vector] ifoldM': OK
  8353. 1278.11 s [vector] +++ OK, passed 100 tests.
  8354. 1278.13 s [vector] ifoldM_: OK (0.02s)
  8355. 1278.13 s [vector] +++ OK, passed 100 tests.
  8356. 1278.14 s [vector] ifoldM'_: OK (0.02s)
  8357. 1278.15 s [vector] +++ OK, passed 100 tests.
  8358. 1278.15 s [vector] all: OK
  8359. 1278.15 s [vector] +++ OK, passed 100 tests.
  8360. 1278.15 s [vector] any: OK
  8361. 1278.15 s [vector] +++ OK, passed 100 tests.
  8362. 1278.15 s [vector] prescanl: OK
  8363. 1278.15 s [vector] +++ OK, passed 100 tests.
  8364. 1278.15 s [vector] prescanl': OK
  8365. 1278.15 s [vector] +++ OK, passed 100 tests.
  8366. 1278.16 s [vector] postscanl: OK
  8367. 1278.16 s [vector] +++ OK, passed 100 tests.
  8368. 1278.16 s [vector] postscanl': OK
  8369. 1278.16 s [vector] +++ OK, passed 100 tests.
  8370. 1278.16 s [vector] scanl: OK
  8371. 1278.16 s [vector] +++ OK, passed 100 tests.
  8372. 1278.17 s [vector] scanl': OK
  8373. 1278.17 s [vector] +++ OK, passed 100 tests.
  8374. 1278.17 s [vector] scanl1: OK
  8375. 1278.17 s [vector] +++ OK, passed 100 tests.
  8376. 1278.17 s [vector] scanl1': OK
  8377. 1278.17 s [vector] +++ OK, passed 100 tests.
  8378. 1278.18 s [vector] iscanl: OK
  8379. 1278.18 s [vector] +++ OK, passed 100 tests.
  8380. 1278.18 s [vector] iscanl': OK
  8381. 1278.18 s [vector] +++ OK, passed 100 tests.
  8382. 1278.18 s [vector] prescanr: OK
  8383. 1278.18 s [vector] +++ OK, passed 100 tests.
  8384. 1278.18 s [vector] prescanr': OK
  8385. 1278.18 s [vector] +++ OK, passed 100 tests.
  8386. 1278.18 s [vector] postscanr: OK
  8387. 1278.18 s [vector] +++ OK, passed 100 tests.
  8388. 1278.19 s [vector] postscanr': OK
  8389. 1278.19 s [vector] +++ OK, passed 100 tests.
  8390. 1278.19 s [vector] scanr: OK
  8391. 1278.19 s [vector] +++ OK, passed 100 tests.
  8392. 1278.19 s [vector] scanr': OK
  8393. 1278.19 s [vector] +++ OK, passed 100 tests.
  8394. 1278.19 s [vector] scanr1: OK
  8395. 1278.19 s [vector] +++ OK, passed 100 tests.
  8396. 1278.20 s [vector] scanr1': OK
  8397. 1278.20 s [vector] +++ OK, passed 100 tests.
  8398. 1278.20 s [vector] iscanr: OK
  8399. 1278.20 s [vector] +++ OK, passed 100 tests.
  8400. 1278.20 s [vector] iscanr': OK
  8401. 1278.20 s [vector] +++ OK, passed 100 tests.
  8402. 1278.20 s [vector] mut_read: OK
  8403. 1278.20 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8404. 1278.21 s [vector] mut_write: OK
  8405. 1278.21 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8406. 1278.21 s [vector] mut_modify: OK
  8407. 1278.21 s [vector] +++ OK, passed 100 tests; 11 discarded.
  8408. 1278.22 s [vector] mut_generate: OK
  8409. 1278.22 s [vector] +++ OK, passed 100 tests.
  8410. 1278.23 s [vector] mut_generateM: OK (0.01s)
  8411. 1278.23 s [vector] +++ OK, passed 100 tests.
  8412. 1278.23 s [vector] mut_mapM_: OK (0.01s)
  8413. 1278.24 s [vector] +++ OK, passed 100 tests.
  8414. 1278.25 s [vector] mut_imapM_: OK (0.02s)
  8415. 1278.25 s [vector] +++ OK, passed 100 tests.
  8416. 1278.27 s [vector] mut_forM_: OK (0.02s)
  8417. 1278.27 s [vector] +++ OK, passed 100 tests.
  8418. 1278.28 s [vector] mut_iforM_: OK (0.02s)
  8419. 1278.28 s [vector] +++ OK, passed 100 tests.
  8420. 1278.28 s [vector] mut_foldr: OK
  8421. 1278.28 s [vector] +++ OK, passed 100 tests.
  8422. 1278.28 s [vector] mut_foldr': OK
  8423. 1278.28 s [vector] +++ OK, passed 100 tests.
  8424. 1278.29 s [vector] mut_foldl: OK
  8425. 1278.29 s [vector] +++ OK, passed 100 tests.
  8426. 1278.29 s [vector] mut_foldl': OK
  8427. 1278.29 s [vector] +++ OK, passed 100 tests.
  8428. 1278.29 s [vector] mut_ifoldr: OK
  8429. 1278.29 s [vector] +++ OK, passed 100 tests.
  8430. 1278.30 s [vector] mut_ifoldr': OK
  8431. 1278.30 s [vector] +++ OK, passed 100 tests.
  8432. 1278.31 s [vector] mut_ifoldl: OK
  8433. 1278.31 s [vector] +++ OK, passed 100 tests.
  8434. 1278.31 s [vector] mut_ifoldl': OK
  8435. 1278.31 s [vector] +++ OK, passed 100 tests.
  8436. 1278.31 s [vector] mut_foldM: OK
  8437. 1278.31 s [vector] +++ OK, passed 100 tests.
  8438. 1278.31 s [vector] mut_foldM': OK
  8439. 1278.31 s [vector] +++ OK, passed 100 tests.
  8440. 1278.31 s [vector] mut_foldrM: OK
  8441. 1278.31 s [vector] +++ OK, passed 100 tests.
  8442. 1278.32 s [vector] mut_foldrM': OK
  8443. 1278.32 s [vector] +++ OK, passed 100 tests.
  8444. 1278.32 s [vector] mut_ifoldM: OK
  8445. 1278.32 s [vector] +++ OK, passed 100 tests.
  8446. 1278.32 s [vector] mut_ifoldM': OK
  8447. 1278.32 s [vector] +++ OK, passed 100 tests.
  8448. 1278.33 s [vector] mut_ifoldrM: OK
  8449. 1278.33 s [vector] +++ OK, passed 100 tests.
  8450. 1278.33 s [vector] mut_ifoldrM': OK
  8451. 1278.33 s [vector] +++ OK, passed 100 tests.
  8452. 1278.33 s [vector] compare: OK
  8453. 1278.33 s [vector] +++ OK, passed 100 tests.
  8454. 1278.33 s [vector] maximum: OK
  8455. 1278.33 s [vector] +++ OK, passed 100 tests; 21 discarded.
  8456. 1278.33 s [vector] minimum: OK
  8457. 1278.33 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8458. 1278.33 s [vector] minIndex: OK
  8459. 1278.33 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8460. 1278.33 s [vector] maxIndex: OK
  8461. 1278.33 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8462. 1278.34 s [vector] maximumBy: OK
  8463. 1278.34 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8464. 1278.34 s [vector] minimumBy: OK
  8465. 1278.34 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8466. 1278.34 s [vector] maximumOn: OK
  8467. 1278.34 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8468. 1278.34 s [vector] minimumOn: OK
  8469. 1278.34 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8470. 1278.34 s [vector] maxIndexBy: OK
  8471. 1278.34 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8472. 1278.34 s [vector] minIndexBy: OK
  8473. 1278.34 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8474. 1278.34 s [vector] ListFirstMaxIndexWins: OK
  8475. 1278.34 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8476. 1278.34 s [vector] FalseListFirstMaxIndexWins: OK
  8477. 1278.34 s [vector] +++ OK, failed as expected. (after 1 test):
  8478. 1278.34 s [vector] Exception:
  8479. 1278.34 s [vector] Prelude.foldr1: empty list
  8480. 1278.34 s [vector] CallStack (from HasCallStack):
  8481. 1278.34 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  8482. 1278.34 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  8483. 1278.34 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  8484. 1278.34 s [vector] []
  8485. 1278.34 s [vector] zip: OK
  8486. 1278.34 s [vector] +++ OK, passed 100 tests.
  8487. 1278.34 s [vector] zip3: OK
  8488. 1278.34 s [vector] +++ OK, passed 100 tests.
  8489. 1278.34 s [vector] unzip: OK
  8490. 1278.34 s [vector] +++ OK, passed 100 tests.
  8491. 1278.35 s [vector] unzip3: OK
  8492. 1278.35 s [vector] +++ OK, passed 100 tests.
  8493. 1278.36 s [vector] indexed: OK
  8494. 1278.36 s [vector] +++ OK, passed 100 tests.
  8495. 1278.36 s [vector] update: OK
  8496. 1278.36 s [vector] +++ OK, passed 100 tests.
  8497. 1278.36 s [vector] concat: OK (0.01s)
  8498. 1278.36 s [vector] +++ OK, passed 100 tests.
  8499. 1278.36 s [vector] mempty: OK
  8500. 1278.36 s [vector] +++ OK, passed 100 tests.
  8501. 1278.36 s [vector] mappend: OK
  8502. 1278.36 s [vector] +++ OK, passed 100 tests.
  8503. 1278.37 s [vector] mconcat: OK
  8504. 1278.37 s [vector] +++ OK, passed 100 tests.
  8505. 1278.37 s [vector] fmap: OK
  8506. 1278.37 s [vector] +++ OK, passed 100 tests.
  8507. 1278.37 s [vector] return: OK
  8508. 1278.37 s [vector] +++ OK, passed 100 tests.
  8509. 1278.39 s [vector] bind: OK (0.02s)
  8510. 1278.39 s [vector] +++ OK, passed 100 tests.
  8511. 1278.39 s [vector] mzip: OK
  8512. 1278.40 s [vector] +++ OK, passed 100 tests.
  8513. 1278.40 s [vector] munzip: OK
  8514. 1278.40 s [vector] +++ OK, passed 100 tests.
  8515. 1278.40 s [vector] applicative_pure: OK
  8516. 1278.40 s [vector] +++ OK, passed 100 tests.
  8517. 1278.45 s [vector] applicative_appl: OK (0.04s)
  8518. 1278.45 s [vector] +++ OK, passed 100 tests.
  8519. 1278.45 s [vector] alternative_empty: OK
  8520. 1278.45 s [vector] +++ OK, passed 100 tests.
  8521. 1278.47 s [vector] alternative_or: OK
  8522. 1278.47 s [vector] +++ OK, passed 100 tests.
  8523. 1278.53 s [vector] sequence: OK (0.06s)
  8524. 1278.53 s [vector] +++ OK, passed 100 tests.
  8525. 1278.53 s [vector] sequence_: OK (0.01s)
  8526. 1278.53 s [vector] +++ OK, passed 100 tests.
  8527. 1278.53 s [vector] glength: OK
  8528. 1278.53 s [vector] +++ OK, passed 100 tests.
  8529. 1278.53 s [vector] sum: OK
  8530. 1278.53 s [vector] +++ OK, passed 100 tests.
  8531. 1278.53 s [vector] product: OK
  8532. 1278.53 s [vector] +++ OK, passed 100 tests.
  8533. 1278.53 s [vector] enumFromN: OK
  8534. 1278.53 s [vector] +++ OK, passed 100 tests.
  8535. 1278.53 s [vector] enumFromThenN: OK
  8536. 1278.53 s [vector] +++ OK, passed 100 tests.
  8537. 1278.53 s [vector] enumFromTo: OK
  8538. 1278.54 s [vector] +++ OK, passed 100 tests.
  8539. 1278.54 s [vector] enumFromThenTo: OK
  8540. 1278.54 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8541. 1278.54 s [vector] unstream
  8542. 1278.54 s [vector] unstream == vunstream (exact): OK
  8543. 1278.54 s [vector] +++ OK, passed 100 tests.
  8544. 1278.54 s [vector] unstream == vunstream (unknown): OK
  8545. 1278.54 s [vector] +++ OK, passed 100 tests.
  8546. 1278.54 s [vector] unstreamR ~= vunstream (exact): OK
  8547. 1278.54 s [vector] +++ OK, passed 100 tests.
  8548. 1278.54 s [vector] unstreamR ~= vunstream (unknown): OK
  8549. 1278.54 s [vector] +++ OK, passed 100 tests.
  8550. 1278.54 s [vector] Tests.Vector.Unboxed
  8551. 1278.54 s [vector] ()
  8552. 1278.54 s [vector] fromList.toList == id: OK
  8553. 1278.54 s [vector] +++ OK, passed 100 tests.
  8554. 1278.54 s [vector] toList.fromList == id: OK
  8555. 1278.54 s [vector] +++ OK, passed 100 tests.
  8556. 1278.54 s [vector] unstream.stream == id: OK
  8557. 1278.54 s [vector] +++ OK, passed 100 tests.
  8558. 1278.54 s [vector] stream.unstream == id: OK
  8559. 1278.54 s [vector] +++ OK, passed 100 tests.
  8560. 1278.54 s [vector] eq: OK
  8561. 1278.54 s [vector] +++ OK, passed 100 tests.
  8562. 1278.54 s [vector] length: OK
  8563. 1278.54 s [vector] +++ OK, passed 100 tests.
  8564. 1278.54 s [vector] null: OK
  8565. 1278.54 s [vector] +++ OK, passed 100 tests.
  8566. 1278.54 s [vector] index: OK
  8567. 1278.54 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8568. 1278.54 s [vector] safeIndex: OK
  8569. 1278.54 s [vector] +++ OK, passed 100 tests.
  8570. 1278.54 s [vector] head: OK
  8571. 1278.55 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8572. 1278.55 s [vector] last: OK
  8573. 1278.55 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8574. 1278.55 s [vector] unsafeIndex: OK
  8575. 1278.55 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8576. 1278.55 s [vector] unsafeHead: OK
  8577. 1278.55 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8578. 1278.55 s [vector] unsafeLast: OK
  8579. 1278.55 s [vector] +++ OK, passed 100 tests; 20 discarded.
  8580. 1278.55 s [vector] slice: OK
  8581. 1278.55 s [vector] +++ OK, passed 100 tests.
  8582. 1278.55 s [vector] init: OK
  8583. 1278.55 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8584. 1278.55 s [vector] tail: OK
  8585. 1278.55 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8586. 1278.55 s [vector] take: OK
  8587. 1278.55 s [vector] +++ OK, passed 100 tests.
  8588. 1278.55 s [vector] drop: OK
  8589. 1278.55 s [vector] +++ OK, passed 100 tests.
  8590. 1278.55 s [vector] splitAt: OK
  8591. 1278.55 s [vector] +++ OK, passed 100 tests.
  8592. 1278.55 s [vector] empty: OK
  8593. 1278.55 s [vector] +++ OK, passed 100 tests.
  8594. 1278.55 s [vector] singleton: OK
  8595. 1278.55 s [vector] +++ OK, passed 100 tests.
  8596. 1278.55 s [vector] replicate: OK
  8597. 1278.55 s [vector] +++ OK, passed 100 tests.
  8598. 1278.55 s [vector] generate: OK
  8599. 1278.55 s [vector] +++ OK, passed 100 tests.
  8600. 1278.56 s [vector] iterateN: OK
  8601. 1278.56 s [vector] +++ OK, passed 100 tests.
  8602. 1278.62 s [vector] iterateNM: OK (0.05s)
  8603. 1278.62 s [vector] +++ OK, passed 100 tests.
  8604. 1278.64 s [vector] generateM: OK (0.02s)
  8605. 1278.64 s [vector] +++ OK, passed 100 tests.
  8606. 1278.65 s [vector] replicateM: OK (0.02s)
  8607. 1278.65 s [vector] +++ OK, passed 100 tests.
  8608. 1278.65 s [vector] create: OK
  8609. 1278.65 s [vector] +++ OK, passed 100 tests.
  8610. 1278.65 s [vector] createT: OK
  8611. 1278.66 s [vector] +++ OK, passed 100 tests.
  8612. 1278.66 s [vector] unfoldr: OK
  8613. 1278.66 s [vector] +++ OK, passed 100 tests.
  8614. 1278.66 s [vector] unfoldrN: OK
  8615. 1278.66 s [vector] +++ OK, passed 100 tests.
  8616. 1278.66 s [vector] unfoldrExactN: OK
  8617. 1278.67 s [vector] +++ OK, passed 100 tests.
  8618. 1278.68 s [vector] unfoldrM: OK
  8619. 1278.68 s [vector] +++ OK, passed 100 tests.
  8620. 1278.69 s [vector] unfoldrNM: OK (0.01s)
  8621. 1278.69 s [vector] +++ OK, passed 100 tests.
  8622. 1278.72 s [vector] unfoldrExactNM: OK (0.04s)
  8623. 1278.72 s [vector] +++ OK, passed 100 tests.
  8624. 1278.72 s [vector] constructN: OK
  8625. 1278.72 s [vector] +++ OK, passed 100 tests.
  8626. 1278.72 s [vector] constructrN: OK
  8627. 1278.72 s [vector] +++ OK, passed 100 tests.
  8628. 1278.72 s [vector] cons: OK
  8629. 1278.73 s [vector] +++ OK, passed 100 tests.
  8630. 1278.73 s [vector] snoc: OK
  8631. 1278.73 s [vector] +++ OK, passed 100 tests.
  8632. 1278.73 s [vector] append: OK
  8633. 1278.73 s [vector] +++ OK, passed 100 tests.
  8634. 1278.74 s [vector] concat: OK (0.01s)
  8635. 1278.74 s [vector] +++ OK, passed 100 tests.
  8636. 1278.74 s [vector] force: OK
  8637. 1278.74 s [vector] +++ OK, passed 100 tests.
  8638. 1278.74 s [vector] upd: OK
  8639. 1278.74 s [vector] +++ OK, passed 100 tests.
  8640. 1278.74 s [vector] accum: OK
  8641. 1278.74 s [vector] +++ OK, passed 100 tests.
  8642. 1278.74 s [vector] reverse: OK
  8643. 1278.74 s [vector] +++ OK, passed 100 tests.
  8644. 1278.75 s [vector] backpermute: OK
  8645. 1278.75 s [vector] +++ OK, passed 100 tests.
  8646. 1278.75 s [vector] map: OK
  8647. 1278.75 s [vector] +++ OK, passed 100 tests.
  8648. 1278.75 s [vector] imap: OK
  8649. 1278.75 s [vector] +++ OK, passed 100 tests.
  8650. 1278.75 s [vector] concatMap: OK
  8651. 1278.75 s [vector] +++ OK, passed 100 tests.
  8652. 1278.75 s [vector] mapM: OK
  8653. 1278.75 s [vector] +++ OK, passed 100 tests.
  8654. 1278.76 s [vector] mapM_: OK (0.01s)
  8655. 1278.76 s [vector] +++ OK, passed 100 tests.
  8656. 1278.78 s [vector] forM: OK
  8657. 1278.78 s [vector] +++ OK, passed 100 tests.
  8658. 1278.78 s [vector] forM_: OK (0.01s)
  8659. 1278.78 s [vector] +++ OK, passed 100 tests.
  8660. 1278.79 s [vector] imapM: OK
  8661. 1278.79 s [vector] +++ OK, passed 100 tests.
  8662. 1278.79 s [vector] imapM_: OK (0.01s)
  8663. 1278.79 s [vector] +++ OK, passed 100 tests.
  8664. 1278.79 s [vector] zipWith: OK
  8665. 1278.79 s [vector] +++ OK, passed 100 tests.
  8666. 1278.79 s [vector] zipWith3: OK
  8667. 1278.79 s [vector] +++ OK, passed 100 tests.
  8668. 1278.80 s [vector] izipWith: OK
  8669. 1278.80 s [vector] +++ OK, passed 100 tests.
  8670. 1278.81 s [vector] izipWith3: OK
  8671. 1278.81 s [vector] +++ OK, passed 100 tests.
  8672. 1278.81 s [vector] izipWithM: OK
  8673. 1278.81 s [vector] +++ OK, passed 100 tests.
  8674. 1278.81 s [vector] izipWithM_: OK
  8675. 1278.81 s [vector] +++ OK, passed 100 tests.
  8676. 1278.81 s [vector] zipWithM: OK
  8677. 1278.81 s [vector] +++ OK, passed 100 tests.
  8678. 1278.82 s [vector] zipWithM_: OK
  8679. 1278.82 s [vector] +++ OK, passed 100 tests.
  8680. 1278.82 s [vector] filter: OK
  8681. 1278.83 s [vector] +++ OK, passed 100 tests.
  8682. 1278.84 s [vector] ifilter: OK
  8683. 1278.84 s [vector] +++ OK, passed 100 tests.
  8684. 1278.84 s [vector] filterM: OK (0.02s)
  8685. 1278.84 s [vector] +++ OK, passed 100 tests.
  8686. 1278.84 s [vector] uniq: OK
  8687. 1278.84 s [vector] +++ OK, passed 100 tests.
  8688. 1278.84 s [vector] mapMaybe: OK
  8689. 1278.84 s [vector] +++ OK, passed 100 tests.
  8690. 1278.84 s [vector] imapMaybe: OK
  8691. 1278.84 s [vector] +++ OK, passed 100 tests.
  8692. 1278.84 s [vector] takeWhile: OK
  8693. 1278.84 s [vector] +++ OK, passed 100 tests.
  8694. 1278.84 s [vector] dropWhile: OK
  8695. 1278.84 s [vector] +++ OK, passed 100 tests.
  8696. 1278.84 s [vector] partition: OK
  8697. 1278.84 s [vector] +++ OK, passed 100 tests.
  8698. 1278.84 s [vector] partitionWith: OK
  8699. 1278.84 s [vector] +++ OK, passed 100 tests.
  8700. 1278.84 s [vector] span: OK
  8701. 1278.84 s [vector] +++ OK, passed 100 tests.
  8702. 1278.84 s [vector] break: OK
  8703. 1278.84 s [vector] +++ OK, passed 100 tests.
  8704. 1278.84 s [vector] spanR: OK
  8705. 1278.84 s [vector] +++ OK, passed 100 tests.
  8706. 1278.85 s [vector] breakR: OK
  8707. 1278.85 s [vector] +++ OK, passed 100 tests.
  8708. 1278.85 s [vector] groupBy: OK
  8709. 1278.85 s [vector] +++ OK, passed 100 tests.
  8710. 1278.85 s [vector] elem: OK
  8711. 1278.85 s [vector] +++ OK, passed 100 tests.
  8712. 1278.85 s [vector] notElem: OK
  8713. 1278.85 s [vector] +++ OK, passed 100 tests.
  8714. 1278.85 s [vector] find: OK
  8715. 1278.85 s [vector] +++ OK, passed 100 tests.
  8716. 1278.85 s [vector] findIndex: OK
  8717. 1278.85 s [vector] +++ OK, passed 100 tests.
  8718. 1278.85 s [vector] findIndexR: OK
  8719. 1278.85 s [vector] +++ OK, passed 100 tests.
  8720. 1278.85 s [vector] findIndices: OK
  8721. 1278.85 s [vector] +++ OK, passed 100 tests.
  8722. 1278.85 s [vector] elemIndex: OK
  8723. 1278.85 s [vector] +++ OK, passed 100 tests.
  8724. 1278.85 s [vector] elemIndices: OK
  8725. 1278.85 s [vector] +++ OK, passed 100 tests.
  8726. 1278.85 s [vector] foldl: OK
  8727. 1278.85 s [vector] +++ OK, passed 100 tests.
  8728. 1278.85 s [vector] foldl1: OK
  8729. 1278.85 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8730. 1278.86 s [vector] foldl': OK
  8731. 1278.86 s [vector] +++ OK, passed 100 tests.
  8732. 1278.86 s [vector] foldl1': OK
  8733. 1278.86 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8734. 1278.86 s [vector] foldr: OK
  8735. 1278.86 s [vector] +++ OK, passed 100 tests.
  8736. 1278.86 s [vector] foldr1: OK
  8737. 1278.86 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8738. 1278.86 s [vector] foldr': OK
  8739. 1278.86 s [vector] +++ OK, passed 100 tests.
  8740. 1278.86 s [vector] foldr1': OK
  8741. 1278.86 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8742. 1278.86 s [vector] ifoldl: OK
  8743. 1278.86 s [vector] +++ OK, passed 100 tests.
  8744. 1278.86 s [vector] ifoldl': OK
  8745. 1278.86 s [vector] +++ OK, passed 100 tests.
  8746. 1278.86 s [vector] ifoldr: OK
  8747. 1278.86 s [vector] +++ OK, passed 100 tests.
  8748. 1278.86 s [vector] ifoldr': OK
  8749. 1278.86 s [vector] +++ OK, passed 100 tests.
  8750. 1278.86 s [vector] ifoldM: OK
  8751. 1278.86 s [vector] +++ OK, passed 100 tests.
  8752. 1278.87 s [vector] ifoldM': OK
  8753. 1278.87 s [vector] +++ OK, passed 100 tests.
  8754. 1278.88 s [vector] ifoldM_: OK (0.01s)
  8755. 1278.88 s [vector] +++ OK, passed 100 tests.
  8756. 1278.89 s [vector] ifoldM'_: OK
  8757. 1278.89 s [vector] +++ OK, passed 100 tests.
  8758. 1278.89 s [vector] all: OK
  8759. 1278.89 s [vector] +++ OK, passed 100 tests.
  8760. 1278.89 s [vector] any: OK
  8761. 1278.89 s [vector] +++ OK, passed 100 tests.
  8762. 1278.89 s [vector] prescanl: OK
  8763. 1278.89 s [vector] +++ OK, passed 100 tests.
  8764. 1278.90 s [vector] prescanl': OK
  8765. 1278.90 s [vector] +++ OK, passed 100 tests.
  8766. 1278.90 s [vector] postscanl: OK
  8767. 1278.90 s [vector] +++ OK, passed 100 tests.
  8768. 1278.90 s [vector] postscanl': OK
  8769. 1278.90 s [vector] +++ OK, passed 100 tests.
  8770. 1278.90 s [vector] scanl: OK
  8771. 1278.90 s [vector] +++ OK, passed 100 tests.
  8772. 1278.90 s [vector] scanl': OK
  8773. 1278.91 s [vector] +++ OK, passed 100 tests.
  8774. 1278.91 s [vector] scanl1: OK
  8775. 1278.91 s [vector] +++ OK, passed 100 tests.
  8776. 1278.91 s [vector] scanl1': OK
  8777. 1278.91 s [vector] +++ OK, passed 100 tests.
  8778. 1278.91 s [vector] iscanl: OK
  8779. 1278.91 s [vector] +++ OK, passed 100 tests.
  8780. 1278.91 s [vector] iscanl': OK
  8781. 1278.91 s [vector] +++ OK, passed 100 tests.
  8782. 1278.91 s [vector] prescanr: OK
  8783. 1278.91 s [vector] +++ OK, passed 100 tests.
  8784. 1278.91 s [vector] prescanr': OK
  8785. 1278.91 s [vector] +++ OK, passed 100 tests.
  8786. 1278.91 s [vector] postscanr: OK
  8787. 1278.91 s [vector] +++ OK, passed 100 tests.
  8788. 1278.91 s [vector] postscanr': OK
  8789. 1278.91 s [vector] +++ OK, passed 100 tests.
  8790. 1278.91 s [vector] scanr: OK
  8791. 1278.91 s [vector] +++ OK, passed 100 tests.
  8792. 1278.91 s [vector] scanr': OK
  8793. 1278.91 s [vector] +++ OK, passed 100 tests.
  8794. 1278.91 s [vector] scanr1: OK
  8795. 1278.91 s [vector] +++ OK, passed 100 tests.
  8796. 1278.92 s [vector] scanr1': OK
  8797. 1278.92 s [vector] +++ OK, passed 100 tests.
  8798. 1278.92 s [vector] iscanr: OK
  8799. 1278.92 s [vector] +++ OK, passed 100 tests.
  8800. 1278.92 s [vector] iscanr': OK
  8801. 1278.92 s [vector] +++ OK, passed 100 tests.
  8802. 1278.92 s [vector] mut_read: OK
  8803. 1278.92 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8804. 1278.92 s [vector] mut_write: OK
  8805. 1278.92 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8806. 1278.92 s [vector] mut_modify: OK
  8807. 1278.92 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8808. 1278.93 s [vector] mut_generate: OK
  8809. 1278.93 s [vector] +++ OK, passed 100 tests.
  8810. 1278.93 s [vector] mut_generateM: OK
  8811. 1278.93 s [vector] +++ OK, passed 100 tests.
  8812. 1278.95 s [vector] mut_mapM_: OK (0.01s)
  8813. 1278.95 s [vector] +++ OK, passed 100 tests.
  8814. 1278.95 s [vector] mut_imapM_: OK (0.01s)
  8815. 1278.96 s [vector] +++ OK, passed 100 tests.
  8816. 1278.96 s [vector] mut_forM_: OK
  8817. 1278.96 s [vector] +++ OK, passed 100 tests.
  8818. 1278.97 s [vector] mut_iforM_: OK
  8819. 1278.97 s [vector] +++ OK, passed 100 tests.
  8820. 1278.97 s [vector] mut_foldr: OK
  8821. 1278.97 s [vector] +++ OK, passed 100 tests.
  8822. 1278.97 s [vector] mut_foldr': OK
  8823. 1278.97 s [vector] +++ OK, passed 100 tests.
  8824. 1278.97 s [vector] mut_foldl: OK
  8825. 1278.97 s [vector] +++ OK, passed 100 tests.
  8826. 1278.97 s [vector] mut_foldl': OK
  8827. 1278.97 s [vector] +++ OK, passed 100 tests.
  8828. 1278.97 s [vector] mut_ifoldr: OK
  8829. 1278.97 s [vector] +++ OK, passed 100 tests.
  8830. 1278.97 s [vector] mut_ifoldr': OK
  8831. 1278.97 s [vector] +++ OK, passed 100 tests.
  8832. 1278.97 s [vector] mut_ifoldl: OK
  8833. 1278.97 s [vector] +++ OK, passed 100 tests.
  8834. 1278.98 s [vector] mut_ifoldl': OK
  8835. 1278.98 s [vector] +++ OK, passed 100 tests.
  8836. 1278.98 s [vector] mut_foldM: OK
  8837. 1278.98 s [vector] +++ OK, passed 100 tests.
  8838. 1278.98 s [vector] mut_foldM': OK
  8839. 1278.98 s [vector] +++ OK, passed 100 tests.
  8840. 1278.98 s [vector] mut_foldrM: OK
  8841. 1278.98 s [vector] +++ OK, passed 100 tests.
  8842. 1278.98 s [vector] mut_foldrM': OK
  8843. 1278.98 s [vector] +++ OK, passed 100 tests.
  8844. 1278.98 s [vector] mut_ifoldM: OK
  8845. 1278.98 s [vector] +++ OK, passed 100 tests.
  8846. 1278.99 s [vector] mut_ifoldM': OK
  8847. 1278.99 s [vector] +++ OK, passed 100 tests.
  8848. 1278.99 s [vector] mut_ifoldrM: OK
  8849. 1278.99 s [vector] +++ OK, passed 100 tests.
  8850. 1278.99 s [vector] mut_ifoldrM': OK
  8851. 1278.99 s [vector] +++ OK, passed 100 tests.
  8852. 1278.99 s [vector] compare: OK
  8853. 1278.99 s [vector] +++ OK, passed 100 tests.
  8854. 1278.99 s [vector] maximum: OK
  8855. 1278.99 s [vector] +++ OK, passed 100 tests; 20 discarded.
  8856. 1278.99 s [vector] minimum: OK
  8857. 1278.99 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8858. 1278.99 s [vector] minIndex: OK
  8859. 1278.99 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8860. 1278.99 s [vector] maxIndex: OK
  8861. 1278.99 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8862. 1278.99 s [vector] maximumBy: OK
  8863. 1278.99 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8864. 1278.99 s [vector] minimumBy: OK
  8865. 1278.99 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8866. 1279.00 s [vector] maximumOn: OK
  8867. 1279.00 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8868. 1279.00 s [vector] minimumOn: OK
  8869. 1279.00 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8870. 1279.00 s [vector] maxIndexBy: OK
  8871. 1279.00 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8872. 1279.00 s [vector] minIndexBy: OK
  8873. 1279.00 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8874. 1279.00 s [vector] ListFirstMaxIndexWins: OK
  8875. 1279.00 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8876. 1279.00 s [vector] FalseListFirstMaxIndexWins: OK
  8877. 1279.00 s [vector] +++ OK, failed as expected. (after 1 test):
  8878. 1279.00 s [vector] Exception:
  8879. 1279.00 s [vector] Prelude.foldr1: empty list
  8880. 1279.00 s [vector] CallStack (from HasCallStack):
  8881. 1279.00 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  8882. 1279.00 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  8883. 1279.00 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  8884. 1279.00 s [vector] []
  8885. 1279.00 s [vector] zip: OK
  8886. 1279.01 s [vector] +++ OK, passed 100 tests.
  8887. 1279.01 s [vector] zip3: OK
  8888. 1279.01 s [vector] +++ OK, passed 100 tests.
  8889. 1279.01 s [vector] unzip: OK
  8890. 1279.01 s [vector] +++ OK, passed 100 tests.
  8891. 1279.01 s [vector] unzip3: OK
  8892. 1279.01 s [vector] +++ OK, passed 100 tests.
  8893. 1279.01 s [vector] indexed: OK
  8894. 1279.01 s [vector] +++ OK, passed 100 tests.
  8895. 1279.02 s [vector] update: OK
  8896. 1279.02 s [vector] +++ OK, passed 100 tests.
  8897. 1279.02 s [vector] mempty: OK
  8898. 1279.02 s [vector] +++ OK, passed 100 tests.
  8899. 1279.02 s [vector] mappend: OK
  8900. 1279.02 s [vector] +++ OK, passed 100 tests.
  8901. 1279.02 s [vector] mconcat: OK
  8902. 1279.02 s [vector] +++ OK, passed 100 tests.
  8903. 1279.02 s [vector] glength: OK
  8904. 1279.02 s [vector] +++ OK, passed 100 tests.
  8905. 1279.02 s [vector] (Bool)
  8906. 1279.02 s [vector] fromList.toList == id: OK
  8907. 1279.02 s [vector] +++ OK, passed 100 tests.
  8908. 1279.02 s [vector] toList.fromList == id: OK
  8909. 1279.02 s [vector] +++ OK, passed 100 tests.
  8910. 1279.03 s [vector] unstream.stream == id: OK
  8911. 1279.03 s [vector] +++ OK, passed 100 tests.
  8912. 1279.03 s [vector] stream.unstream == id: OK
  8913. 1279.03 s [vector] +++ OK, passed 100 tests.
  8914. 1279.03 s [vector] eq: OK
  8915. 1279.03 s [vector] +++ OK, passed 100 tests.
  8916. 1279.03 s [vector] length: OK
  8917. 1279.03 s [vector] +++ OK, passed 100 tests.
  8918. 1279.03 s [vector] null: OK
  8919. 1279.03 s [vector] +++ OK, passed 100 tests.
  8920. 1279.03 s [vector] index: OK
  8921. 1279.03 s [vector] +++ OK, passed 100 tests; 10 discarded.
  8922. 1279.03 s [vector] safeIndex: OK
  8923. 1279.03 s [vector] +++ OK, passed 100 tests.
  8924. 1279.03 s [vector] head: OK
  8925. 1279.03 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8926. 1279.03 s [vector] last: OK
  8927. 1279.03 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8928. 1279.03 s [vector] unsafeIndex: OK
  8929. 1279.03 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8930. 1279.03 s [vector] unsafeHead: OK
  8931. 1279.03 s [vector] +++ OK, passed 100 tests; 23 discarded.
  8932. 1279.03 s [vector] unsafeLast: OK
  8933. 1279.03 s [vector] +++ OK, passed 100 tests; 22 discarded.
  8934. 1279.03 s [vector] slice: OK
  8935. 1279.03 s [vector] +++ OK, passed 100 tests.
  8936. 1279.03 s [vector] init: OK
  8937. 1279.03 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8938. 1279.03 s [vector] tail: OK
  8939. 1279.03 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8940. 1279.04 s [vector] take: OK
  8941. 1279.04 s [vector] +++ OK, passed 100 tests.
  8942. 1279.04 s [vector] drop: OK
  8943. 1279.04 s [vector] +++ OK, passed 100 tests.
  8944. 1279.04 s [vector] splitAt: OK
  8945. 1279.04 s [vector] +++ OK, passed 100 tests.
  8946. 1279.04 s [vector] empty: OK
  8947. 1279.04 s [vector] +++ OK, passed 100 tests.
  8948. 1279.04 s [vector] singleton: OK
  8949. 1279.04 s [vector] +++ OK, passed 100 tests.
  8950. 1279.04 s [vector] replicate: OK
  8951. 1279.04 s [vector] +++ OK, passed 100 tests.
  8952. 1279.04 s [vector] generate: OK
  8953. 1279.05 s [vector] +++ OK, passed 100 tests.
  8954. 1279.06 s [vector] iterateN: OK
  8955. 1279.06 s [vector] +++ OK, passed 100 tests.
  8956. 1279.08 s [vector] iterateNM: OK (0.04s)
  8957. 1279.08 s [vector] +++ OK, passed 100 tests.
  8958. 1279.11 s [vector] generateM: OK (0.01s)
  8959. 1279.11 s [vector] +++ OK, passed 100 tests.
  8960. 1279.12 s [vector] replicateM: OK (0.01s)
  8961. 1279.12 s [vector] +++ OK, passed 100 tests.
  8962. 1279.12 s [vector] create: OK
  8963. 1279.12 s [vector] +++ OK, passed 100 tests.
  8964. 1279.12 s [vector] createT: OK
  8965. 1279.12 s [vector] +++ OK, passed 100 tests.
  8966. 1279.12 s [vector] unfoldr: OK
  8967. 1279.12 s [vector] +++ OK, passed 100 tests.
  8968. 1279.12 s [vector] unfoldrN: OK
  8969. 1279.13 s [vector] +++ OK, passed 100 tests.
  8970. 1279.13 s [vector] unfoldrExactN: OK
  8971. 1279.13 s [vector] +++ OK, passed 100 tests.
  8972. 1279.13 s [vector] unfoldrM: OK
  8973. 1279.13 s [vector] +++ OK, passed 100 tests.
  8974. 1279.14 s [vector] unfoldrNM: OK
  8975. 1279.14 s [vector] +++ OK, passed 100 tests.
  8976. 1279.21 s [vector] unfoldrExactNM: OK (0.05s)
  8977. 1279.21 s [vector] +++ OK, passed 100 tests.
  8978. 1279.21 s [vector] constructN: OK
  8979. 1279.21 s [vector] +++ OK, passed 100 tests.
  8980. 1279.21 s [vector] constructrN: OK
  8981. 1279.21 s [vector] +++ OK, passed 100 tests.
  8982. 1279.21 s [vector] cons: OK
  8983. 1279.21 s [vector] +++ OK, passed 100 tests.
  8984. 1279.22 s [vector] snoc: OK
  8985. 1279.22 s [vector] +++ OK, passed 100 tests.
  8986. 1279.23 s [vector] append: OK
  8987. 1279.23 s [vector] +++ OK, passed 100 tests.
  8988. 1279.23 s [vector] concat: OK (0.01s)
  8989. 1279.23 s [vector] +++ OK, passed 100 tests.
  8990. 1279.23 s [vector] force: OK
  8991. 1279.23 s [vector] +++ OK, passed 100 tests.
  8992. 1279.23 s [vector] upd: OK
  8993. 1279.23 s [vector] +++ OK, passed 100 tests.
  8994. 1279.24 s [vector] accum: OK
  8995. 1279.24 s [vector] +++ OK, passed 100 tests.
  8996. 1279.24 s [vector] reverse: OK
  8997. 1279.24 s [vector] +++ OK, passed 100 tests.
  8998. 1279.24 s [vector] backpermute: OK
  8999. 1279.24 s [vector] +++ OK, passed 100 tests.
  9000. 1279.24 s [vector] map: OK
  9001. 1279.24 s [vector] +++ OK, passed 100 tests.
  9002. 1279.24 s [vector] imap: OK
  9003. 1279.24 s [vector] +++ OK, passed 100 tests.
  9004. 1279.25 s [vector] concatMap: OK
  9005. 1279.25 s [vector] +++ OK, passed 100 tests.
  9006. 1279.25 s [vector] mapM: OK
  9007. 1279.25 s [vector] +++ OK, passed 100 tests.
  9008. 1279.26 s [vector] mapM_: OK (0.01s)
  9009. 1279.26 s [vector] +++ OK, passed 100 tests.
  9010. 1279.26 s [vector] forM: OK
  9011. 1279.27 s [vector] +++ OK, passed 100 tests.
  9012. 1279.28 s [vector] forM_: OK (0.01s)
  9013. 1279.29 s [vector] +++ OK, passed 100 tests.
  9014. 1279.29 s [vector] imapM: OK
  9015. 1279.30 s [vector] +++ OK, passed 100 tests.
  9016. 1279.30 s [vector] imapM_: OK (0.02s)
  9017. 1279.30 s [vector] +++ OK, passed 100 tests.
  9018. 1279.30 s [vector] zipWith: OK
  9019. 1279.30 s [vector] +++ OK, passed 100 tests.
  9020. 1279.30 s [vector] zipWith3: OK
  9021. 1279.30 s [vector] +++ OK, passed 100 tests.
  9022. 1279.30 s [vector] izipWith: OK
  9023. 1279.30 s [vector] +++ OK, passed 100 tests.
  9024. 1279.30 s [vector] izipWith3: OK
  9025. 1279.30 s [vector] +++ OK, passed 100 tests.
  9026. 1279.31 s [vector] izipWithM: OK
  9027. 1279.31 s [vector] +++ OK, passed 100 tests.
  9028. 1279.33 s [vector] izipWithM_: OK (0.01s)
  9029. 1279.33 s [vector] +++ OK, passed 100 tests.
  9030. 1279.34 s [vector] zipWithM: OK
  9031. 1279.34 s [vector] +++ OK, passed 100 tests.
  9032. 1279.35 s [vector] zipWithM_: OK (0.01s)
  9033. 1279.35 s [vector] +++ OK, passed 100 tests.
  9034. 1279.35 s [vector] filter: OK
  9035. 1279.35 s [vector] +++ OK, passed 100 tests.
  9036. 1279.35 s [vector] ifilter: OK
  9037. 1279.35 s [vector] +++ OK, passed 100 tests.
  9038. 1279.37 s [vector] filterM: OK (0.02s)
  9039. 1279.37 s [vector] +++ OK, passed 100 tests.
  9040. 1279.37 s [vector] uniq: OK
  9041. 1279.37 s [vector] +++ OK, passed 100 tests.
  9042. 1279.37 s [vector] mapMaybe: OK
  9043. 1279.37 s [vector] +++ OK, passed 100 tests.
  9044. 1279.38 s [vector] imapMaybe: OK
  9045. 1279.38 s [vector] +++ OK, passed 100 tests.
  9046. 1279.38 s [vector] takeWhile: OK
  9047. 1279.38 s [vector] +++ OK, passed 100 tests.
  9048. 1279.38 s [vector] dropWhile: OK
  9049. 1279.38 s [vector] +++ OK, passed 100 tests.
  9050. 1279.38 s [vector] partition: OK
  9051. 1279.38 s [vector] +++ OK, passed 100 tests.
  9052. 1279.38 s [vector] partitionWith: OK
  9053. 1279.38 s [vector] +++ OK, passed 100 tests.
  9054. 1279.38 s [vector] span: OK
  9055. 1279.38 s [vector] +++ OK, passed 100 tests.
  9056. 1279.38 s [vector] break: OK
  9057. 1279.38 s [vector] +++ OK, passed 100 tests.
  9058. 1279.38 s [vector] spanR: OK
  9059. 1279.38 s [vector] +++ OK, passed 100 tests.
  9060. 1279.38 s [vector] breakR: OK
  9061. 1279.39 s [vector] +++ OK, passed 100 tests.
  9062. 1279.39 s [vector] groupBy: OK
  9063. 1279.39 s [vector] +++ OK, passed 100 tests.
  9064. 1279.39 s [vector] elem: OK
  9065. 1279.39 s [vector] +++ OK, passed 100 tests.
  9066. 1279.39 s [vector] notElem: OK
  9067. 1279.39 s [vector] +++ OK, passed 100 tests.
  9068. 1279.39 s [vector] find: OK
  9069. 1279.39 s [vector] +++ OK, passed 100 tests.
  9070. 1279.39 s [vector] findIndex: OK
  9071. 1279.39 s [vector] +++ OK, passed 100 tests.
  9072. 1279.39 s [vector] findIndexR: OK
  9073. 1279.39 s [vector] +++ OK, passed 100 tests.
  9074. 1279.39 s [vector] findIndices: OK
  9075. 1279.39 s [vector] +++ OK, passed 100 tests.
  9076. 1279.39 s [vector] elemIndex: OK
  9077. 1279.39 s [vector] +++ OK, passed 100 tests.
  9078. 1279.39 s [vector] elemIndices: OK
  9079. 1279.39 s [vector] +++ OK, passed 100 tests.
  9080. 1279.39 s [vector] foldl: OK
  9081. 1279.39 s [vector] +++ OK, passed 100 tests.
  9082. 1279.39 s [vector] foldl1: OK
  9083. 1279.39 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9084. 1279.40 s [vector] foldl': OK
  9085. 1279.40 s [vector] +++ OK, passed 100 tests.
  9086. 1279.40 s [vector] foldl1': OK
  9087. 1279.40 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9088. 1279.40 s [vector] foldr: OK
  9089. 1279.40 s [vector] +++ OK, passed 100 tests.
  9090. 1279.40 s [vector] foldr1: OK
  9091. 1279.40 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9092. 1279.40 s [vector] foldr': OK
  9093. 1279.40 s [vector] +++ OK, passed 100 tests.
  9094. 1279.40 s [vector] foldr1': OK
  9095. 1279.40 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9096. 1279.41 s [vector] ifoldl: OK
  9097. 1279.41 s [vector] +++ OK, passed 100 tests.
  9098. 1279.41 s [vector] ifoldl': OK
  9099. 1279.41 s [vector] +++ OK, passed 100 tests.
  9100. 1279.41 s [vector] ifoldr: OK
  9101. 1279.41 s [vector] +++ OK, passed 100 tests.
  9102. 1279.42 s [vector] ifoldr': OK
  9103. 1279.42 s [vector] +++ OK, passed 100 tests.
  9104. 1279.42 s [vector] ifoldM: OK
  9105. 1279.42 s [vector] +++ OK, passed 100 tests.
  9106. 1279.43 s [vector] ifoldM': OK
  9107. 1279.43 s [vector] +++ OK, passed 100 tests.
  9108. 1279.44 s [vector] ifoldM_: OK (0.02s)
  9109. 1279.44 s [vector] +++ OK, passed 100 tests.
  9110. 1279.45 s [vector] ifoldM'_: OK
  9111. 1279.45 s [vector] +++ OK, passed 100 tests.
  9112. 1279.45 s [vector] all: OK
  9113. 1279.45 s [vector] +++ OK, passed 100 tests.
  9114. 1279.46 s [vector] any: OK
  9115. 1279.46 s [vector] +++ OK, passed 100 tests.
  9116. 1279.46 s [vector] prescanl: OK
  9117. 1279.46 s [vector] +++ OK, passed 100 tests.
  9118. 1279.46 s [vector] prescanl': OK
  9119. 1279.46 s [vector] +++ OK, passed 100 tests.
  9120. 1279.46 s [vector] postscanl: OK
  9121. 1279.46 s [vector] +++ OK, passed 100 tests.
  9122. 1279.46 s [vector] postscanl': OK
  9123. 1279.46 s [vector] +++ OK, passed 100 tests.
  9124. 1279.46 s [vector] scanl: OK
  9125. 1279.46 s [vector] +++ OK, passed 100 tests.
  9126. 1279.47 s [vector] scanl': OK
  9127. 1279.47 s [vector] +++ OK, passed 100 tests.
  9128. 1279.47 s [vector] scanl1: OK
  9129. 1279.47 s [vector] +++ OK, passed 100 tests.
  9130. 1279.47 s [vector] scanl1': OK
  9131. 1279.47 s [vector] +++ OK, passed 100 tests.
  9132. 1279.47 s [vector] iscanl: OK
  9133. 1279.47 s [vector] +++ OK, passed 100 tests.
  9134. 1279.48 s [vector] iscanl': OK
  9135. 1279.48 s [vector] +++ OK, passed 100 tests.
  9136. 1279.48 s [vector] prescanr: OK
  9137. 1279.48 s [vector] +++ OK, passed 100 tests.
  9138. 1279.48 s [vector] prescanr': OK
  9139. 1279.48 s [vector] +++ OK, passed 100 tests.
  9140. 1279.48 s [vector] postscanr: OK
  9141. 1279.48 s [vector] +++ OK, passed 100 tests.
  9142. 1279.48 s [vector] postscanr': OK
  9143. 1279.48 s [vector] +++ OK, passed 100 tests.
  9144. 1279.49 s [vector] scanr: OK
  9145. 1279.49 s [vector] +++ OK, passed 100 tests.
  9146. 1279.49 s [vector] scanr': OK
  9147. 1279.49 s [vector] +++ OK, passed 100 tests.
  9148. 1279.49 s [vector] scanr1: OK
  9149. 1279.49 s [vector] +++ OK, passed 100 tests.
  9150. 1279.49 s [vector] scanr1': OK
  9151. 1279.49 s [vector] +++ OK, passed 100 tests.
  9152. 1279.50 s [vector] iscanr: OK
  9153. 1279.50 s [vector] +++ OK, passed 100 tests.
  9154. 1279.50 s [vector] iscanr': OK
  9155. 1279.50 s [vector] +++ OK, passed 100 tests.
  9156. 1279.50 s [vector] mut_read: OK
  9157. 1279.50 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9158. 1279.50 s [vector] mut_write: OK
  9159. 1279.50 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9160. 1279.50 s [vector] mut_modify: OK
  9161. 1279.50 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9162. 1279.51 s [vector] mut_generate: OK
  9163. 1279.51 s [vector] +++ OK, passed 100 tests.
  9164. 1279.51 s [vector] mut_generateM: OK
  9165. 1279.51 s [vector] +++ OK, passed 100 tests.
  9166. 1279.53 s [vector] mut_mapM_: OK (0.01s)
  9167. 1279.53 s [vector] +++ OK, passed 100 tests.
  9168. 1279.55 s [vector] mut_imapM_: OK (0.01s)
  9169. 1279.55 s [vector] +++ OK, passed 100 tests.
  9170. 1279.56 s [vector] mut_forM_: OK (0.01s)
  9171. 1279.56 s [vector] +++ OK, passed 100 tests.
  9172. 1279.57 s [vector] mut_iforM_: OK (0.01s)
  9173. 1279.57 s [vector] +++ OK, passed 100 tests.
  9174. 1279.57 s [vector] mut_foldr: OK
  9175. 1279.57 s [vector] +++ OK, passed 100 tests.
  9176. 1279.57 s [vector] mut_foldr': OK
  9177. 1279.57 s [vector] +++ OK, passed 100 tests.
  9178. 1279.57 s [vector] mut_foldl: OK
  9179. 1279.57 s [vector] +++ OK, passed 100 tests.
  9180. 1279.57 s [vector] mut_foldl': OK
  9181. 1279.57 s [vector] +++ OK, passed 100 tests.
  9182. 1279.58 s [vector] mut_ifoldr: OK
  9183. 1279.58 s [vector] +++ OK, passed 100 tests.
  9184. 1279.58 s [vector] mut_ifoldr': OK
  9185. 1279.58 s [vector] +++ OK, passed 100 tests.
  9186. 1279.58 s [vector] mut_ifoldl: OK
  9187. 1279.58 s [vector] +++ OK, passed 100 tests.
  9188. 1279.58 s [vector] mut_ifoldl': OK
  9189. 1279.58 s [vector] +++ OK, passed 100 tests.
  9190. 1279.59 s [vector] mut_foldM: OK
  9191. 1279.59 s [vector] +++ OK, passed 100 tests.
  9192. 1279.59 s [vector] mut_foldM': OK
  9193. 1279.59 s [vector] +++ OK, passed 100 tests.
  9194. 1279.59 s [vector] mut_foldrM: OK
  9195. 1279.59 s [vector] +++ OK, passed 100 tests.
  9196. 1279.60 s [vector] mut_foldrM': OK
  9197. 1279.60 s [vector] +++ OK, passed 100 tests.
  9198. 1279.61 s [vector] mut_ifoldM: OK
  9199. 1279.61 s [vector] +++ OK, passed 100 tests.
  9200. 1279.61 s [vector] mut_ifoldM': OK
  9201. 1279.61 s [vector] +++ OK, passed 100 tests.
  9202. 1279.61 s [vector] mut_ifoldrM: OK
  9203. 1279.61 s [vector] +++ OK, passed 100 tests.
  9204. 1279.61 s [vector] mut_ifoldrM': OK
  9205. 1279.61 s [vector] +++ OK, passed 100 tests.
  9206. 1279.61 s [vector] compare: OK
  9207. 1279.61 s [vector] +++ OK, passed 100 tests.
  9208. 1279.61 s [vector] maximum: OK
  9209. 1279.61 s [vector] +++ OK, passed 100 tests; 22 discarded.
  9210. 1279.61 s [vector] minimum: OK
  9211. 1279.61 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9212. 1279.61 s [vector] minIndex: OK
  9213. 1279.61 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9214. 1279.61 s [vector] maxIndex: OK
  9215. 1279.61 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9216. 1279.61 s [vector] maximumBy: OK
  9217. 1279.61 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9218. 1279.61 s [vector] minimumBy: OK
  9219. 1279.61 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9220. 1279.61 s [vector] maximumOn: OK
  9221. 1279.61 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9222. 1279.61 s [vector] minimumOn: OK
  9223. 1279.61 s [vector] +++ OK, passed 100 tests; 12 discarded.
  9224. 1279.61 s [vector] maxIndexBy: OK
  9225. 1279.61 s [vector] +++ OK, passed 100 tests; 12 discarded.
  9226. 1279.61 s [vector] minIndexBy: OK
  9227. 1279.61 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9228. 1279.61 s [vector] ListFirstMaxIndexWins: OK
  9229. 1279.61 s [vector] +++ OK, passed 100 tests; 20 discarded.
  9230. 1279.61 s [vector] FalseListFirstMaxIndexWins: OK
  9231. 1279.61 s [vector] +++ OK, failed as expected. (after 1 test):
  9232. 1279.61 s [vector] Exception:
  9233. 1279.61 s [vector] Prelude.foldr1: empty list
  9234. 1279.61 s [vector] CallStack (from HasCallStack):
  9235. 1279.61 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  9236. 1279.61 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  9237. 1279.61 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  9238. 1279.61 s [vector] []
  9239. 1279.62 s [vector] zip: OK
  9240. 1279.62 s [vector] +++ OK, passed 100 tests.
  9241. 1279.62 s [vector] zip3: OK
  9242. 1279.62 s [vector] +++ OK, passed 100 tests.
  9243. 1279.63 s [vector] unzip: OK
  9244. 1279.63 s [vector] +++ OK, passed 100 tests.
  9245. 1279.63 s [vector] unzip3: OK
  9246. 1279.63 s [vector] +++ OK, passed 100 tests.
  9247. 1279.63 s [vector] indexed: OK
  9248. 1279.63 s [vector] +++ OK, passed 100 tests.
  9249. 1279.63 s [vector] update: OK
  9250. 1279.63 s [vector] +++ OK, passed 100 tests.
  9251. 1279.63 s [vector] mempty: OK
  9252. 1279.63 s [vector] +++ OK, passed 100 tests.
  9253. 1279.63 s [vector] mappend: OK
  9254. 1279.63 s [vector] +++ OK, passed 100 tests.
  9255. 1279.64 s [vector] mconcat: OK (0.01s)
  9256. 1279.64 s [vector] +++ OK, passed 100 tests.
  9257. 1279.64 s [vector] glength: OK
  9258. 1279.64 s [vector] +++ OK, passed 100 tests.
  9259. 1279.64 s [vector] and: OK
  9260. 1279.64 s [vector] +++ OK, passed 100 tests.
  9261. 1279.64 s [vector] or: OK
  9262. 1279.64 s [vector] +++ OK, passed 100 tests.
  9263. 1279.64 s [vector] (Int)
  9264. 1279.64 s [vector] fromList.toList == id: OK
  9265. 1279.64 s [vector] +++ OK, passed 100 tests.
  9266. 1279.64 s [vector] toList.fromList == id: OK
  9267. 1279.64 s [vector] +++ OK, passed 100 tests.
  9268. 1279.64 s [vector] unstream.stream == id: OK
  9269. 1279.65 s [vector] +++ OK, passed 100 tests.
  9270. 1279.65 s [vector] stream.unstream == id: OK
  9271. 1279.65 s [vector] +++ OK, passed 100 tests.
  9272. 1279.65 s [vector] eq: OK
  9273. 1279.65 s [vector] +++ OK, passed 100 tests.
  9274. 1279.65 s [vector] length: OK
  9275. 1279.65 s [vector] +++ OK, passed 100 tests.
  9276. 1279.65 s [vector] null: OK
  9277. 1279.65 s [vector] +++ OK, passed 100 tests.
  9278. 1279.65 s [vector] index: OK
  9279. 1279.65 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9280. 1279.65 s [vector] safeIndex: OK
  9281. 1279.65 s [vector] +++ OK, passed 100 tests.
  9282. 1279.65 s [vector] head: OK
  9283. 1279.65 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9284. 1279.65 s [vector] last: OK
  9285. 1279.65 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9286. 1279.65 s [vector] unsafeIndex: OK
  9287. 1279.65 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9288. 1279.65 s [vector] unsafeHead: OK
  9289. 1279.65 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9290. 1279.65 s [vector] unsafeLast: OK
  9291. 1279.65 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9292. 1279.65 s [vector] slice: OK
  9293. 1279.65 s [vector] +++ OK, passed 100 tests.
  9294. 1279.65 s [vector] init: OK
  9295. 1279.65 s [vector] +++ OK, passed 100 tests; 27 discarded.
  9296. 1279.65 s [vector] tail: OK
  9297. 1279.65 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9298. 1279.65 s [vector] take: OK
  9299. 1279.65 s [vector] +++ OK, passed 100 tests.
  9300. 1279.65 s [vector] drop: OK
  9301. 1279.65 s [vector] +++ OK, passed 100 tests.
  9302. 1279.66 s [vector] splitAt: OK
  9303. 1279.66 s [vector] +++ OK, passed 100 tests.
  9304. 1279.66 s [vector] empty: OK
  9305. 1279.66 s [vector] +++ OK, passed 100 tests.
  9306. 1279.66 s [vector] singleton: OK
  9307. 1279.66 s [vector] +++ OK, passed 100 tests.
  9308. 1279.66 s [vector] replicate: OK
  9309. 1279.66 s [vector] +++ OK, passed 100 tests.
  9310. 1279.66 s [vector] generate: OK
  9311. 1279.66 s [vector] +++ OK, passed 100 tests.
  9312. 1279.66 s [vector] iterateN: OK
  9313. 1279.66 s [vector] +++ OK, passed 100 tests.
  9314. 1279.70 s [vector] iterateNM: OK (0.03s)
  9315. 1279.70 s [vector] +++ OK, passed 100 tests.
  9316. 1279.73 s [vector] generateM: OK (0.01s)
  9317. 1279.73 s [vector] +++ OK, passed 100 tests.
  9318. 1279.73 s [vector] replicateM: OK
  9319. 1279.73 s [vector] +++ OK, passed 100 tests.
  9320. 1279.74 s [vector] create: OK
  9321. 1279.74 s [vector] +++ OK, passed 100 tests.
  9322. 1279.74 s [vector] createT: OK
  9323. 1279.74 s [vector] +++ OK, passed 100 tests.
  9324. 1279.74 s [vector] unfoldr: OK
  9325. 1279.74 s [vector] +++ OK, passed 100 tests.
  9326. 1279.74 s [vector] unfoldrN: OK
  9327. 1279.74 s [vector] +++ OK, passed 100 tests.
  9328. 1279.74 s [vector] unfoldrExactN: OK
  9329. 1279.75 s [vector] +++ OK, passed 100 tests.
  9330. 1279.75 s [vector] unfoldrM: OK (0.01s)
  9331. 1279.75 s [vector] +++ OK, passed 100 tests.
  9332. 1279.76 s [vector] unfoldrNM: OK
  9333. 1279.76 s [vector] +++ OK, passed 100 tests.
  9334. 1279.80 s [vector] unfoldrExactNM: OK
  9335. 1279.80 s [vector] +++ OK, passed 100 tests.
  9336. 1279.81 s [vector] constructN: OK (0.02s)
  9337. 1279.81 s [vector] +++ OK, passed 100 tests.
  9338. 1279.81 s [vector] constructrN: OK
  9339. 1279.81 s [vector] +++ OK, passed 100 tests.
  9340. 1279.81 s [vector] cons: OK
  9341. 1279.81 s [vector] +++ OK, passed 100 tests.
  9342. 1279.81 s [vector] snoc: OK
  9343. 1279.81 s [vector] +++ OK, passed 100 tests.
  9344. 1279.81 s [vector] append: OK
  9345. 1279.81 s [vector] +++ OK, passed 100 tests.
  9346. 1279.83 s [vector] concat: OK (0.02s)
  9347. 1279.83 s [vector] +++ OK, passed 100 tests.
  9348. 1279.84 s [vector] force: OK
  9349. 1279.84 s [vector] +++ OK, passed 100 tests.
  9350. 1279.84 s [vector] upd: OK
  9351. 1279.84 s [vector] +++ OK, passed 100 tests.
  9352. 1279.84 s [vector] accum: OK
  9353. 1279.84 s [vector] +++ OK, passed 100 tests.
  9354. 1279.84 s [vector] reverse: OK
  9355. 1279.84 s [vector] +++ OK, passed 100 tests.
  9356. 1279.84 s [vector] backpermute: OK
  9357. 1279.84 s [vector] +++ OK, passed 100 tests.
  9358. 1279.85 s [vector] map: OK
  9359. 1279.85 s [vector] +++ OK, passed 100 tests.
  9360. 1279.85 s [vector] imap: OK
  9361. 1279.85 s [vector] +++ OK, passed 100 tests.
  9362. 1279.86 s [vector] concatMap: OK
  9363. 1279.86 s [vector] +++ OK, passed 100 tests.
  9364. 1279.88 s [vector] mapM: OK
  9365. 1279.88 s [vector] +++ OK, passed 100 tests.
  9366. 1279.90 s [vector] mapM_: OK (0.03s)
  9367. 1279.90 s [vector] +++ OK, passed 100 tests.
  9368. 1279.90 s [vector] forM: OK
  9369. 1279.90 s [vector] +++ OK, passed 100 tests.
  9370. 1279.93 s [vector] forM_: OK
  9371. 1279.93 s [vector] +++ OK, passed 100 tests.
  9372. 1279.93 s [vector] imapM: OK
  9373. 1279.93 s [vector] +++ OK, passed 100 tests.
  9374. 1279.94 s [vector] imapM_: OK (0.02s)
  9375. 1279.94 s [vector] +++ OK, passed 100 tests.
  9376. 1279.95 s [vector] zipWith: OK
  9377. 1279.95 s [vector] +++ OK, passed 100 tests.
  9378. 1279.95 s [vector] zipWith3: OK
  9379. 1279.95 s [vector] +++ OK, passed 100 tests.
  9380. 1279.95 s [vector] izipWith: OK
  9381. 1279.95 s [vector] +++ OK, passed 100 tests.
  9382. 1279.95 s [vector] izipWith3: OK
  9383. 1279.95 s [vector] +++ OK, passed 100 tests.
  9384. 1279.96 s [vector] izipWithM: OK
  9385. 1279.96 s [vector] +++ OK, passed 100 tests.
  9386. 1279.97 s [vector] izipWithM_: OK
  9387. 1279.97 s [vector] +++ OK, passed 100 tests.
  9388. 1279.99 s [vector] zipWithM: OK
  9389. 1279.99 s [vector] +++ OK, passed 100 tests.
  9390. 1279.99 s [vector] zipWithM_: OK (0.01s)
  9391. 1279.99 s [vector] +++ OK, passed 100 tests.
  9392. 1279.99 s [vector] filter: OK
  9393. 1279.99 s [vector] +++ OK, passed 100 tests.
  9394. 1279.99 s [vector] ifilter: OK
  9395. 1279.99 s [vector] +++ OK, passed 100 tests.
  9396. 1280.02 s [vector] filterM: OK (0.03s)
  9397. 1280.02 s [vector] +++ OK, passed 100 tests.
  9398. 1280.02 s [vector] uniq: OK
  9399. 1280.02 s [vector] +++ OK, passed 100 tests.
  9400. 1280.03 s [vector] mapMaybe: OK
  9401. 1280.03 s [vector] +++ OK, passed 100 tests.
  9402. 1280.03 s [vector] imapMaybe: OK
  9403. 1280.03 s [vector] +++ OK, passed 100 tests.
  9404. 1280.03 s [vector] takeWhile: OK
  9405. 1280.03 s [vector] +++ OK, passed 100 tests.
  9406. 1280.03 s [vector] dropWhile: OK
  9407. 1280.03 s [vector] +++ OK, passed 100 tests.
  9408. 1280.03 s [vector] partition: OK
  9409. 1280.03 s [vector] +++ OK, passed 100 tests.
  9410. 1280.03 s [vector] partitionWith: OK
  9411. 1280.03 s [vector] +++ OK, passed 100 tests.
  9412. 1280.03 s [vector] span: OK
  9413. 1280.04 s [vector] +++ OK, passed 100 tests.
  9414. 1280.04 s [vector] break: OK
  9415. 1280.04 s [vector] +++ OK, passed 100 tests.
  9416. 1280.04 s [vector] spanR: OK
  9417. 1280.04 s [vector] +++ OK, passed 100 tests.
  9418. 1280.04 s [vector] breakR: OK
  9419. 1280.04 s [vector] +++ OK, passed 100 tests.
  9420. 1280.04 s [vector] groupBy: OK
  9421. 1280.04 s [vector] +++ OK, passed 100 tests.
  9422. 1280.04 s [vector] elem: OK
  9423. 1280.04 s [vector] +++ OK, passed 100 tests.
  9424. 1280.04 s [vector] notElem: OK
  9425. 1280.04 s [vector] +++ OK, passed 100 tests.
  9426. 1280.04 s [vector] find: OK
  9427. 1280.04 s [vector] +++ OK, passed 100 tests.
  9428. 1280.04 s [vector] findIndex: OK
  9429. 1280.05 s [vector] +++ OK, passed 100 tests.
  9430. 1280.05 s [vector] findIndexR: OK
  9431. 1280.05 s [vector] +++ OK, passed 100 tests.
  9432. 1280.05 s [vector] findIndices: OK
  9433. 1280.05 s [vector] +++ OK, passed 100 tests.
  9434. 1280.05 s [vector] elemIndex: OK
  9435. 1280.05 s [vector] +++ OK, passed 100 tests.
  9436. 1280.05 s [vector] elemIndices: OK
  9437. 1280.05 s [vector] +++ OK, passed 100 tests.
  9438. 1280.05 s [vector] foldl: OK
  9439. 1280.06 s [vector] +++ OK, passed 100 tests.
  9440. 1280.06 s [vector] foldl1: OK
  9441. 1280.06 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9442. 1280.06 s [vector] foldl': OK
  9443. 1280.06 s [vector] +++ OK, passed 100 tests.
  9444. 1280.06 s [vector] foldl1': OK
  9445. 1280.06 s [vector] +++ OK, passed 100 tests; 23 discarded.
  9446. 1280.06 s [vector] foldr: OK
  9447. 1280.06 s [vector] +++ OK, passed 100 tests.
  9448. 1280.07 s [vector] foldr1: OK
  9449. 1280.07 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9450. 1280.07 s [vector] foldr': OK
  9451. 1280.07 s [vector] +++ OK, passed 100 tests.
  9452. 1280.07 s [vector] foldr1': OK
  9453. 1280.07 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9454. 1280.07 s [vector] ifoldl: OK
  9455. 1280.07 s [vector] +++ OK, passed 100 tests.
  9456. 1280.08 s [vector] ifoldl': OK
  9457. 1280.09 s [vector] +++ OK, passed 100 tests.
  9458. 1280.09 s [vector] ifoldr: OK
  9459. 1280.09 s [vector] +++ OK, passed 100 tests.
  9460. 1280.09 s [vector] ifoldr': OK
  9461. 1280.09 s [vector] +++ OK, passed 100 tests.
  9462. 1280.09 s [vector] ifoldM: OK
  9463. 1280.09 s [vector] +++ OK, passed 100 tests.
  9464. 1280.11 s [vector] ifoldM': OK
  9465. 1280.11 s [vector] +++ OK, passed 100 tests.
  9466. 1280.12 s [vector] ifoldM_: OK (0.02s)
  9467. 1280.12 s [vector] +++ OK, passed 100 tests.
  9468. 1280.13 s [vector] ifoldM'_: OK (0.02s)
  9469. 1280.13 s [vector] +++ OK, passed 100 tests.
  9470. 1280.13 s [vector] all: OK
  9471. 1280.13 s [vector] +++ OK, passed 100 tests.
  9472. 1280.14 s [vector] any: OK
  9473. 1280.14 s [vector] +++ OK, passed 100 tests.
  9474. 1280.14 s [vector] prescanl: OK
  9475. 1280.15 s [vector] +++ OK, passed 100 tests.
  9476. 1280.15 s [vector] prescanl': OK
  9477. 1280.15 s [vector] +++ OK, passed 100 tests.
  9478. 1280.15 s [vector] postscanl: OK
  9479. 1280.15 s [vector] +++ OK, passed 100 tests.
  9480. 1280.15 s [vector] postscanl': OK
  9481. 1280.15 s [vector] +++ OK, passed 100 tests.
  9482. 1280.15 s [vector] scanl: OK
  9483. 1280.15 s [vector] +++ OK, passed 100 tests.
  9484. 1280.16 s [vector] scanl': OK
  9485. 1280.16 s [vector] +++ OK, passed 100 tests.
  9486. 1280.17 s [vector] scanl1: OK
  9487. 1280.17 s [vector] +++ OK, passed 100 tests.
  9488. 1280.18 s [vector] scanl1': OK
  9489. 1280.18 s [vector] +++ OK, passed 100 tests.
  9490. 1280.18 s [vector] iscanl: OK
  9491. 1280.18 s [vector] +++ OK, passed 100 tests.
  9492. 1280.18 s [vector] iscanl': OK
  9493. 1280.18 s [vector] +++ OK, passed 100 tests.
  9494. 1280.18 s [vector] prescanr: OK
  9495. 1280.18 s [vector] +++ OK, passed 100 tests.
  9496. 1280.18 s [vector] prescanr': OK
  9497. 1280.18 s [vector] +++ OK, passed 100 tests.
  9498. 1280.18 s [vector] postscanr: OK
  9499. 1280.18 s [vector] +++ OK, passed 100 tests.
  9500. 1280.19 s [vector] postscanr': OK
  9501. 1280.19 s [vector] +++ OK, passed 100 tests.
  9502. 1280.19 s [vector] scanr: OK
  9503. 1280.19 s [vector] +++ OK, passed 100 tests.
  9504. 1280.19 s [vector] scanr': OK
  9505. 1280.19 s [vector] +++ OK, passed 100 tests.
  9506. 1280.19 s [vector] scanr1: OK
  9507. 1280.19 s [vector] +++ OK, passed 100 tests.
  9508. 1280.20 s [vector] scanr1': OK
  9509. 1280.20 s [vector] +++ OK, passed 100 tests.
  9510. 1280.20 s [vector] iscanr: OK
  9511. 1280.20 s [vector] +++ OK, passed 100 tests.
  9512. 1280.20 s [vector] iscanr': OK
  9513. 1280.20 s [vector] +++ OK, passed 100 tests.
  9514. 1280.20 s [vector] mut_read: OK
  9515. 1280.20 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9516. 1280.21 s [vector] mut_write: OK
  9517. 1280.21 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9518. 1280.21 s [vector] mut_modify: OK
  9519. 1280.21 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9520. 1280.21 s [vector] mut_generate: OK
  9521. 1280.21 s [vector] +++ OK, passed 100 tests.
  9522. 1280.23 s [vector] mut_generateM: OK
  9523. 1280.23 s [vector] +++ OK, passed 100 tests.
  9524. 1280.25 s [vector] mut_mapM_: OK (0.02s)
  9525. 1280.25 s [vector] +++ OK, passed 100 tests.
  9526. 1280.25 s [vector] mut_imapM_: OK (0.02s)
  9527. 1280.25 s [vector] +++ OK, passed 100 tests.
  9528. 1280.27 s [vector] mut_forM_: OK (0.02s)
  9529. 1280.27 s [vector] +++ OK, passed 100 tests.
  9530. 1280.29 s [vector] mut_iforM_: OK (0.02s)
  9531. 1280.29 s [vector] +++ OK, passed 100 tests.
  9532. 1280.29 s [vector] mut_foldr: OK
  9533. 1280.29 s [vector] +++ OK, passed 100 tests.
  9534. 1280.30 s [vector] mut_foldr': OK
  9535. 1280.30 s [vector] +++ OK, passed 100 tests.
  9536. 1280.30 s [vector] mut_foldl: OK
  9537. 1280.30 s [vector] +++ OK, passed 100 tests.
  9538. 1280.30 s [vector] mut_foldl': OK
  9539. 1280.30 s [vector] +++ OK, passed 100 tests.
  9540. 1280.31 s [vector] mut_ifoldr: OK
  9541. 1280.31 s [vector] +++ OK, passed 100 tests.
  9542. 1280.31 s [vector] mut_ifoldr': OK
  9543. 1280.31 s [vector] +++ OK, passed 100 tests.
  9544. 1280.31 s [vector] mut_ifoldl: OK
  9545. 1280.31 s [vector] +++ OK, passed 100 tests.
  9546. 1280.31 s [vector] mut_ifoldl': OK
  9547. 1280.32 s [vector] +++ OK, passed 100 tests.
  9548. 1280.32 s [vector] mut_foldM: OK
  9549. 1280.32 s [vector] +++ OK, passed 100 tests.
  9550. 1280.33 s [vector] mut_foldM': OK
  9551. 1280.33 s [vector] +++ OK, passed 100 tests.
  9552. 1280.33 s [vector] mut_foldrM: OK
  9553. 1280.33 s [vector] +++ OK, passed 100 tests.
  9554. 1280.33 s [vector] mut_foldrM': OK
  9555. 1280.33 s [vector] +++ OK, passed 100 tests.
  9556. 1280.33 s [vector] mut_ifoldM: OK
  9557. 1280.33 s [vector] +++ OK, passed 100 tests.
  9558. 1280.34 s [vector] mut_ifoldM': OK
  9559. 1280.34 s [vector] +++ OK, passed 100 tests.
  9560. 1280.34 s [vector] mut_ifoldrM: OK
  9561. 1280.35 s [vector] +++ OK, passed 100 tests.
  9562. 1280.35 s [vector] mut_ifoldrM': OK
  9563. 1280.35 s [vector] +++ OK, passed 100 tests.
  9564. 1280.35 s [vector] compare: OK
  9565. 1280.35 s [vector] +++ OK, passed 100 tests.
  9566. 1280.35 s [vector] maximum: OK
  9567. 1280.35 s [vector] +++ OK, passed 100 tests; 22 discarded.
  9568. 1280.35 s [vector] minimum: OK
  9569. 1280.35 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9570. 1280.35 s [vector] minIndex: OK
  9571. 1280.35 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9572. 1280.35 s [vector] maxIndex: OK
  9573. 1280.35 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9574. 1280.35 s [vector] maximumBy: OK
  9575. 1280.35 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9576. 1280.35 s [vector] minimumBy: OK
  9577. 1280.35 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9578. 1280.35 s [vector] maximumOn: OK
  9579. 1280.35 s [vector] +++ OK, passed 100 tests; 12 discarded.
  9580. 1280.35 s [vector] minimumOn: OK
  9581. 1280.35 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9582. 1280.35 s [vector] maxIndexBy: OK
  9583. 1280.35 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9584. 1280.35 s [vector] minIndexBy: OK
  9585. 1280.35 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9586. 1280.36 s [vector] ListFirstMaxIndexWins: OK
  9587. 1280.36 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9588. 1280.36 s [vector] FalseListFirstMaxIndexWins: OK
  9589. 1280.36 s [vector] +++ OK, failed as expected. (after 1 test):
  9590. 1280.36 s [vector] Exception:
  9591. 1280.36 s [vector] Prelude.foldr1: empty list
  9592. 1280.36 s [vector] CallStack (from HasCallStack):
  9593. 1280.36 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  9594. 1280.36 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  9595. 1280.36 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  9596. 1280.36 s [vector] []
  9597. 1280.36 s [vector] zip: OK
  9598. 1280.36 s [vector] +++ OK, passed 100 tests.
  9599. 1280.36 s [vector] zip3: OK
  9600. 1280.36 s [vector] +++ OK, passed 100 tests.
  9601. 1280.36 s [vector] unzip: OK
  9602. 1280.36 s [vector] +++ OK, passed 100 tests.
  9603. 1280.36 s [vector] unzip3: OK
  9604. 1280.37 s [vector] +++ OK, passed 100 tests.
  9605. 1280.37 s [vector] indexed: OK
  9606. 1280.37 s [vector] +++ OK, passed 100 tests.
  9607. 1280.37 s [vector] update: OK
  9608. 1280.37 s [vector] +++ OK, passed 100 tests.
  9609. 1280.37 s [vector] mempty: OK
  9610. 1280.37 s [vector] +++ OK, passed 100 tests.
  9611. 1280.37 s [vector] mappend: OK
  9612. 1280.37 s [vector] +++ OK, passed 100 tests.
  9613. 1280.38 s [vector] mconcat: OK (0.01s)
  9614. 1280.38 s [vector] +++ OK, passed 100 tests.
  9615. 1280.39 s [vector] glength: OK
  9616. 1280.39 s [vector] +++ OK, passed 100 tests.
  9617. 1280.39 s [vector] sum: OK
  9618. 1280.39 s [vector] +++ OK, passed 100 tests.
  9619. 1280.39 s [vector] product: OK
  9620. 1280.39 s [vector] +++ OK, passed 100 tests.
  9621. 1280.39 s [vector] enumFromN: OK
  9622. 1280.39 s [vector] +++ OK, passed 100 tests.
  9623. 1280.39 s [vector] enumFromThenN: OK
  9624. 1280.39 s [vector] +++ OK, passed 100 tests.
  9625. 1280.39 s [vector] enumFromTo: OK
  9626. 1280.39 s [vector] +++ OK, passed 100 tests.
  9627. 1280.39 s [vector] enumFromThenTo: OK
  9628. 1280.39 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9629. 1280.39 s [vector] (Float)
  9630. 1280.39 s [vector] fromList.toList == id: OK
  9631. 1280.39 s [vector] +++ OK, passed 100 tests.
  9632. 1280.39 s [vector] toList.fromList == id: OK
  9633. 1280.39 s [vector] +++ OK, passed 100 tests.
  9634. 1280.40 s [vector] unstream.stream == id: OK
  9635. 1280.40 s [vector] +++ OK, passed 100 tests.
  9636. 1280.40 s [vector] stream.unstream == id: OK
  9637. 1280.40 s [vector] +++ OK, passed 100 tests.
  9638. 1280.40 s [vector] eq: OK
  9639. 1280.40 s [vector] +++ OK, passed 100 tests.
  9640. 1280.40 s [vector] length: OK
  9641. 1280.40 s [vector] +++ OK, passed 100 tests.
  9642. 1280.40 s [vector] null: OK
  9643. 1280.40 s [vector] +++ OK, passed 100 tests.
  9644. 1280.40 s [vector] index: OK
  9645. 1280.40 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9646. 1280.40 s [vector] safeIndex: OK
  9647. 1280.40 s [vector] +++ OK, passed 100 tests.
  9648. 1280.40 s [vector] head: OK
  9649. 1280.40 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9650. 1280.40 s [vector] last: OK
  9651. 1280.41 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9652. 1280.41 s [vector] unsafeIndex: OK
  9653. 1280.41 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9654. 1280.41 s [vector] unsafeHead: OK
  9655. 1280.41 s [vector] +++ OK, passed 100 tests; 21 discarded.
  9656. 1280.41 s [vector] unsafeLast: OK
  9657. 1280.41 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9658. 1280.41 s [vector] slice: OK
  9659. 1280.41 s [vector] +++ OK, passed 100 tests.
  9660. 1280.41 s [vector] init: OK
  9661. 1280.41 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9662. 1280.41 s [vector] tail: OK
  9663. 1280.41 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9664. 1280.41 s [vector] take: OK
  9665. 1280.41 s [vector] +++ OK, passed 100 tests.
  9666. 1280.42 s [vector] drop: OK
  9667. 1280.42 s [vector] +++ OK, passed 100 tests.
  9668. 1280.42 s [vector] splitAt: OK
  9669. 1280.42 s [vector] +++ OK, passed 100 tests.
  9670. 1280.42 s [vector] empty: OK
  9671. 1280.42 s [vector] +++ OK, passed 100 tests.
  9672. 1280.42 s [vector] singleton: OK
  9673. 1280.42 s [vector] +++ OK, passed 100 tests.
  9674. 1280.42 s [vector] replicate: OK
  9675. 1280.42 s [vector] +++ OK, passed 100 tests.
  9676. 1280.42 s [vector] generate: OK
  9677. 1280.43 s [vector] +++ OK, passed 100 tests.
  9678. 1280.43 s [vector] iterateN: OK
  9679. 1280.43 s [vector] +++ OK, passed 100 tests.
  9680. 1280.49 s [vector] iterateNM: OK (0.07s)
  9681. 1280.49 s [vector] +++ OK, passed 100 tests.
  9682. 1280.53 s [vector] generateM: OK (0.02s)
  9683. 1280.53 s [vector] +++ OK, passed 100 tests.
  9684. 1280.53 s [vector] replicateM: OK (0.01s)
  9685. 1280.53 s [vector] +++ OK, passed 100 tests.
  9686. 1280.53 s [vector] create: OK
  9687. 1280.53 s [vector] +++ OK, passed 100 tests.
  9688. 1280.53 s [vector] createT: OK
  9689. 1280.53 s [vector] +++ OK, passed 100 tests.
  9690. 1280.53 s [vector] unfoldr: OK
  9691. 1280.53 s [vector] +++ OK, passed 100 tests.
  9692. 1280.53 s [vector] unfoldrN: OK
  9693. 1280.53 s [vector] +++ OK, passed 100 tests.
  9694. 1280.53 s [vector] unfoldrExactN: OK
  9695. 1280.53 s [vector] +++ OK, passed 100 tests.
  9696. 1280.54 s [vector] unfoldrM: OK
  9697. 1280.54 s [vector] +++ OK, passed 100 tests.
  9698. 1280.55 s [vector] unfoldrNM: OK
  9699. 1280.55 s [vector] +++ OK, passed 100 tests.
  9700. 1280.61 s [vector] unfoldrExactNM: OK (0.07s)
  9701. 1280.61 s [vector] +++ OK, passed 100 tests.
  9702. 1280.63 s [vector] constructN: OK (0.01s)
  9703. 1280.64 s [vector] +++ OK, passed 100 tests.
  9704. 1280.64 s [vector] constructrN: OK (0.01s)
  9705. 1280.64 s [vector] +++ OK, passed 100 tests.
  9706. 1280.64 s [vector] cons: OK
  9707. 1280.64 s [vector] +++ OK, passed 100 tests.
  9708. 1280.65 s [vector] snoc: OK
  9709. 1280.65 s [vector] +++ OK, passed 100 tests.
  9710. 1280.66 s [vector] append: OK
  9711. 1280.66 s [vector] +++ OK, passed 100 tests.
  9712. 1280.70 s [vector] concat: OK (0.05s)
  9713. 1280.71 s [vector] +++ OK, passed 100 tests.
  9714. 1280.72 s [vector] force: OK
  9715. 1280.72 s [vector] +++ OK, passed 100 tests.
  9716. 1280.73 s [vector] upd: OK
  9717. 1280.73 s [vector] +++ OK, passed 100 tests.
  9718. 1280.73 s [vector] accum: OK (0.02s)
  9719. 1280.73 s [vector] +++ OK, passed 100 tests.
  9720. 1280.74 s [vector] reverse: OK
  9721. 1280.74 s [vector] +++ OK, passed 100 tests.
  9722. 1280.74 s [vector] backpermute: OK
  9723. 1280.74 s [vector] +++ OK, passed 100 tests.
  9724. 1280.77 s [vector] map: OK
  9725. 1280.77 s [vector] +++ OK, passed 100 tests.
  9726. 1280.77 s [vector] imap: OK (0.02s)
  9727. 1280.77 s [vector] +++ OK, passed 100 tests.
  9728. 1280.79 s [vector] concatMap: OK (0.01s)
  9729. 1280.79 s [vector] +++ OK, passed 100 tests.
  9730. 1280.79 s [vector] mapM: OK
  9731. 1280.79 s [vector] +++ OK, passed 100 tests.
  9732. 1280.83 s [vector] mapM_: OK (0.04s)
  9733. 1280.84 s [vector] +++ OK, passed 100 tests.
  9734. 1280.84 s [vector] forM: OK
  9735. 1280.84 s [vector] +++ OK, passed 100 tests.
  9736. 1280.87 s [vector] forM_: OK (0.03s)
  9737. 1280.88 s [vector] +++ OK, passed 100 tests.
  9738. 1280.89 s [vector] imapM: OK
  9739. 1280.90 s [vector] +++ OK, passed 100 tests.
  9740. 1280.93 s [vector] imapM_: OK (0.04s)
  9741. 1280.93 s [vector] +++ OK, passed 100 tests.
  9742. 1280.94 s [vector] zipWith: OK
  9743. 1280.94 s [vector] +++ OK, passed 100 tests.
  9744. 1280.95 s [vector] zipWith3: OK (0.01s)
  9745. 1280.95 s [vector] +++ OK, passed 100 tests.
  9746. 1280.95 s [vector] izipWith: OK
  9747. 1280.95 s [vector] +++ OK, passed 100 tests.
  9748. 1280.97 s [vector] izipWith3: OK
  9749. 1280.97 s [vector] +++ OK, passed 100 tests.
  9750. 1280.97 s [vector] izipWithM: OK
  9751. 1280.98 s [vector] +++ OK, passed 100 tests.
  9752. 1280.99 s [vector] izipWithM_: OK (0.03s)
  9753. 1281.00 s [vector] +++ OK, passed 100 tests.
  9754. 1281.00 s [vector] zipWithM: OK
  9755. 1281.00 s [vector] +++ OK, passed 100 tests.
  9756. 1281.03 s [vector] zipWithM_: OK (0.01s)
  9757. 1281.03 s [vector] +++ OK, passed 100 tests.
  9758. 1281.03 s [vector] filter: OK
  9759. 1281.03 s [vector] +++ OK, passed 100 tests.
  9760. 1281.05 s [vector] ifilter: OK
  9761. 1281.06 s [vector] +++ OK, passed 100 tests.
  9762. 1281.09 s [vector] filterM: OK (0.05s)
  9763. 1281.09 s [vector] +++ OK, passed 100 tests.
  9764. 1281.09 s [vector] uniq: OK
  9765. 1281.09 s [vector] +++ OK, passed 100 tests.
  9766. 1281.09 s [vector] mapMaybe: OK
  9767. 1281.09 s [vector] +++ OK, passed 100 tests.
  9768. 1281.10 s [vector] imapMaybe: OK
  9769. 1281.10 s [vector] +++ OK, passed 100 tests.
  9770. 1281.10 s [vector] takeWhile: OK
  9771. 1281.10 s [vector] +++ OK, passed 100 tests.
  9772. 1281.10 s [vector] dropWhile: OK
  9773. 1281.10 s [vector] +++ OK, passed 100 tests.
  9774. 1281.12 s [vector] partition: OK
  9775. 1281.12 s [vector] +++ OK, passed 100 tests.
  9776. 1281.13 s [vector] partitionWith: OK
  9777. 1281.13 s [vector] +++ OK, passed 100 tests.
  9778. 1281.13 s [vector] span: OK
  9779. 1281.13 s [vector] +++ OK, passed 100 tests.
  9780. 1281.13 s [vector] break: OK
  9781. 1281.13 s [vector] +++ OK, passed 100 tests.
  9782. 1281.13 s [vector] spanR: OK
  9783. 1281.13 s [vector] +++ OK, passed 100 tests.
  9784. 1281.13 s [vector] breakR: OK
  9785. 1281.13 s [vector] +++ OK, passed 100 tests.
  9786. 1281.14 s [vector] groupBy: OK
  9787. 1281.14 s [vector] +++ OK, passed 100 tests.
  9788. 1281.14 s [vector] elem: OK
  9789. 1281.14 s [vector] +++ OK, passed 100 tests.
  9790. 1281.14 s [vector] notElem: OK
  9791. 1281.15 s [vector] +++ OK, passed 100 tests.
  9792. 1281.15 s [vector] find: OK
  9793. 1281.15 s [vector] +++ OK, passed 100 tests.
  9794. 1281.15 s [vector] findIndex: OK
  9795. 1281.15 s [vector] +++ OK, passed 100 tests.
  9796. 1281.16 s [vector] findIndexR: OK
  9797. 1281.16 s [vector] +++ OK, passed 100 tests.
  9798. 1281.16 s [vector] findIndices: OK
  9799. 1281.16 s [vector] +++ OK, passed 100 tests.
  9800. 1281.16 s [vector] elemIndex: OK
  9801. 1281.16 s [vector] +++ OK, passed 100 tests.
  9802. 1281.17 s [vector] elemIndices: OK
  9803. 1281.17 s [vector] +++ OK, passed 100 tests.
  9804. 1281.17 s [vector] foldl: OK
  9805. 1281.17 s [vector] +++ OK, passed 100 tests.
  9806. 1281.19 s [vector] foldl1: OK (0.01s)
  9807. 1281.19 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9808. 1281.21 s [vector] foldl': OK (0.01s)
  9809. 1281.21 s [vector] +++ OK, passed 100 tests.
  9810. 1281.22 s [vector] foldl1': OK (0.01s)
  9811. 1281.22 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9812. 1281.22 s [vector] foldr: OK (0.01s)
  9813. 1281.22 s [vector] +++ OK, passed 100 tests.
  9814. 1281.23 s [vector] foldr1: OK
  9815. 1281.23 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9816. 1281.25 s [vector] foldr': OK
  9817. 1281.25 s [vector] +++ OK, passed 100 tests.
  9818. 1281.26 s [vector] foldr1': OK (0.01s)
  9819. 1281.46 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9820. 1281.46 s [vector] ifoldl: OK
  9821. 1281.46 s [vector] +++ OK, passed 100 tests.
  9822. 1281.46 s [vector] ifoldl': OK
  9823. 1281.46 s [vector] +++ OK, passed 100 tests.
  9824. 1281.46 s [vector] ifoldr: OK
  9825. 1281.46 s [vector] +++ OK, passed 100 tests.
  9826. 1281.46 s [vector] ifoldr': OK
  9827. 1281.46 s [vector] +++ OK, passed 100 tests.
  9828. 1281.46 s [vector] ifoldM: OK (0.01s)
  9829. 1281.46 s [vector] +++ OK, passed 100 tests.
  9830. 1281.46 s [vector] ifoldM': OK (0.01s)
  9831. 1281.46 s [vector] +++ OK, passed 100 tests.
  9832. 1281.46 s [vector] ifoldM_: OK (0.03s)
  9833. 1281.46 s [vector] +++ OK, passed 100 tests.
  9834. 1281.46 s [vector] ifoldM'_: OK (0.03s)
  9835. 1281.46 s [vector] +++ OK, passed 100 tests.
  9836. 1281.46 s [vector] all: OK
  9837. 1281.46 s [vector] +++ OK, passed 100 tests.
  9838. 1281.46 s [vector] any: OK
  9839. 1281.46 s [vector] +++ OK, passed 100 tests.
  9840. 1281.46 s [vector] prescanl: OK
  9841. 1281.46 s [vector] +++ OK, passed 100 tests.
  9842. 1281.46 s [vector] prescanl': OK (0.01s)
  9843. 1281.46 s [vector] +++ OK, passed 100 tests.
  9844. 1281.46 s [vector] postscanl: OK
  9845. 1281.46 s [vector] +++ OK, passed 100 tests.
  9846. 1281.46 s [vector] postscanl': OK
  9847. 1281.46 s [vector] +++ OK, passed 100 tests.
  9848. 1281.46 s [vector] scanl: OK
  9849. 1281.46 s [vector] +++ OK, passed 100 tests.
  9850. 1281.46 s [vector] scanl': OK
  9851. 1281.46 s [vector] +++ OK, passed 100 tests.
  9852. 1281.46 s [vector] scanl1: OK
  9853. 1281.46 s [vector] +++ OK, passed 100 tests.
  9854. 1281.46 s [vector] scanl1': OK
  9855. 1281.46 s [vector] +++ OK, passed 100 tests.
  9856. 1281.47 s [vector] iscanl: OK
  9857. 1281.47 s [vector] +++ OK, passed 100 tests.
  9858. 1281.48 s [vector] iscanl': OK
  9859. 1281.48 s [vector] +++ OK, passed 100 tests.
  9860. 1281.48 s [vector] prescanr: OK
  9861. 1281.48 s [vector] +++ OK, passed 100 tests.
  9862. 1281.49 s [vector] prescanr': OK
  9863. 1281.49 s [vector] +++ OK, passed 100 tests.
  9864. 1281.51 s [vector] postscanr: OK
  9865. 1281.51 s [vector] +++ OK, passed 100 tests.
  9866. 1281.51 s [vector] postscanr': OK
  9867. 1281.51 s [vector] +++ OK, passed 100 tests.
  9868. 1281.53 s [vector] scanr: OK
  9869. 1281.53 s [vector] +++ OK, passed 100 tests.
  9870. 1281.53 s [vector] scanr': OK
  9871. 1281.53 s [vector] +++ OK, passed 100 tests.
  9872. 1281.53 s [vector] scanr1: OK
  9873. 1281.53 s [vector] +++ OK, passed 100 tests.
  9874. 1281.54 s [vector] scanr1': OK
  9875. 1281.54 s [vector] +++ OK, passed 100 tests.
  9876. 1281.56 s [vector] iscanr: OK (0.01s)
  9877. 1281.57 s [vector] +++ OK, passed 100 tests.
  9878. 1281.57 s [vector] iscanr': OK (0.01s)
  9879. 1281.57 s [vector] +++ OK, passed 100 tests.
  9880. 1281.57 s [vector] mut_read: OK
  9881. 1281.57 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9882. 1281.57 s [vector] mut_write: OK
  9883. 1281.57 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9884. 1281.57 s [vector] mut_modify: OK
  9885. 1281.57 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9886. 1281.57 s [vector] mut_generate: OK
  9887. 1281.57 s [vector] +++ OK, passed 100 tests.
  9888. 1281.61 s [vector] mut_generateM: OK (0.03s)
  9889. 1281.61 s [vector] +++ OK, passed 100 tests.
  9890. 1281.64 s [vector] mut_mapM_: OK (0.04s)
  9891. 1281.64 s [vector] +++ OK, passed 100 tests.
  9892. 1281.67 s [vector] mut_imapM_: OK (0.01s)
  9893. 1281.68 s [vector] +++ OK, passed 100 tests.
  9894. 1281.71 s [vector] mut_forM_: OK (0.04s)
  9895. 1281.71 s [vector] +++ OK, passed 100 tests.
  9896. 1281.75 s [vector] mut_iforM_: OK (0.04s)
  9897. 1281.75 s [vector] +++ OK, passed 100 tests.
  9898. 1281.77 s [vector] mut_foldr: OK
  9899. 1281.77 s [vector] +++ OK, passed 100 tests.
  9900. 1281.77 s [vector] mut_foldr': OK
  9901. 1281.77 s [vector] +++ OK, passed 100 tests.
  9902. 1281.79 s [vector] mut_foldl: OK
  9903. 1281.79 s [vector] +++ OK, passed 100 tests.
  9904. 1281.80 s [vector] mut_foldl': OK
  9905. 1281.80 s [vector] +++ OK, passed 100 tests.
  9906. 1281.80 s [vector] mut_ifoldr: OK (0.01s)
  9907. 1281.80 s [vector] +++ OK, passed 100 tests.
  9908. 1281.81 s [vector] mut_ifoldr': OK
  9909. 1281.82 s [vector] +++ OK, passed 100 tests.
  9910. 1281.82 s [vector] mut_ifoldl: OK
  9911. 1281.82 s [vector] +++ OK, passed 100 tests.
  9912. 1281.82 s [vector] mut_ifoldl': OK
  9913. 1281.82 s [vector] +++ OK, passed 100 tests.
  9914. 1281.84 s [vector] mut_foldM: OK
  9915. 1281.85 s [vector] +++ OK, passed 100 tests.
  9916. 1281.86 s [vector] mut_foldM': OK
  9917. 1281.86 s [vector] +++ OK, passed 100 tests.
  9918. 1281.87 s [vector] mut_foldrM: OK
  9919. 1281.87 s [vector] +++ OK, passed 100 tests.
  9920. 1281.87 s [vector] mut_foldrM': OK
  9921. 1281.87 s [vector] +++ OK, passed 100 tests.
  9922. 1281.87 s [vector] mut_ifoldM: OK
  9923. 1281.87 s [vector] +++ OK, passed 100 tests.
  9924. 1281.88 s [vector] mut_ifoldM': OK
  9925. 1281.88 s [vector] +++ OK, passed 100 tests.
  9926. 1281.89 s [vector] mut_ifoldrM: OK
  9927. 1281.90 s [vector] +++ OK, passed 100 tests.
  9928. 1281.90 s [vector] mut_ifoldrM': OK (0.01s)
  9929. 1281.90 s [vector] +++ OK, passed 100 tests.
  9930. 1281.90 s [vector] compare: OK
  9931. 1281.90 s [vector] +++ OK, passed 100 tests.
  9932. 1281.90 s [vector] maximum: OK
  9933. 1281.90 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9934. 1281.90 s [vector] minimum: OK
  9935. 1281.90 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9936. 1281.90 s [vector] minIndex: OK
  9937. 1281.90 s [vector] +++ OK, passed 100 tests; 12 discarded.
  9938. 1281.90 s [vector] maxIndex: OK
  9939. 1281.90 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9940. 1281.91 s [vector] maximumBy: OK
  9941. 1281.91 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9942. 1281.91 s [vector] minimumBy: OK
  9943. 1281.91 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9944. 1281.91 s [vector] maximumOn: OK
  9945. 1281.91 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9946. 1281.91 s [vector] minimumOn: OK
  9947. 1281.91 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9948. 1281.91 s [vector] maxIndexBy: OK
  9949. 1281.91 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9950. 1281.91 s [vector] minIndexBy: OK
  9951. 1281.91 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9952. 1281.91 s [vector] ListFirstMaxIndexWins: OK
  9953. 1281.91 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9954. 1281.91 s [vector] FalseListFirstMaxIndexWins: OK
  9955. 1281.91 s [vector] +++ OK, failed as expected. (after 1 test):
  9956. 1281.91 s [vector] Exception:
  9957. 1281.91 s [vector] Prelude.foldr1: empty list
  9958. 1281.91 s [vector] CallStack (from HasCallStack):
  9959. 1281.91 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  9960. 1281.91 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  9961. 1281.91 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  9962. 1281.91 s [vector] []
  9963. 1281.91 s [vector] zip: OK
  9964. 1281.91 s [vector] +++ OK, passed 100 tests.
  9965. 1281.92 s [vector] zip3: OK
  9966. 1281.92 s [vector] +++ OK, passed 100 tests.
  9967. 1281.92 s [vector] unzip: OK
  9968. 1281.92 s [vector] +++ OK, passed 100 tests.
  9969. 1281.92 s [vector] unzip3: OK
  9970. 1281.92 s [vector] +++ OK, passed 100 tests.
  9971. 1281.93 s [vector] indexed: OK
  9972. 1281.93 s [vector] +++ OK, passed 100 tests.
  9973. 1281.93 s [vector] update: OK
  9974. 1281.93 s [vector] +++ OK, passed 100 tests.
  9975. 1281.93 s [vector] mempty: OK
  9976. 1281.93 s [vector] +++ OK, passed 100 tests.
  9977. 1281.93 s [vector] mappend: OK
  9978. 1281.93 s [vector] +++ OK, passed 100 tests.
  9979. 1281.95 s [vector] mconcat: OK (0.02s)
  9980. 1281.95 s [vector] +++ OK, passed 100 tests.
  9981. 1281.95 s [vector] glength: OK
  9982. 1281.96 s [vector] +++ OK, passed 100 tests.
  9983. 1281.96 s [vector] sum: OK
  9984. 1281.96 s [vector] +++ OK, passed 100 tests.
  9985. 1281.96 s [vector] product: OK
  9986. 1281.96 s [vector] +++ OK, passed 100 tests.
  9987. 1281.96 s [vector] enumFromN: OK
  9988. 1281.96 s [vector] +++ OK, passed 100 tests.
  9989. 1281.96 s [vector] enumFromThenN: OK
  9990. 1281.96 s [vector] +++ OK, passed 100 tests.
  9991. 1281.96 s [vector] enumFromTo: OK
  9992. 1281.96 s [vector] +++ OK, passed 100 tests.
  9993. 1281.96 s [vector] enumFromThenTo: OK
  9994. 1281.96 s [vector] +++ OK, passed 100 tests; 4 discarded.
  9995. 1281.96 s [vector] (Double)
  9996. 1281.96 s [vector] fromList.toList == id: OK
  9997. 1281.96 s [vector] +++ OK, passed 100 tests.
  9998. 1281.96 s [vector] toList.fromList == id: OK
  9999. 1281.96 s [vector] +++ OK, passed 100 tests.
  10000. 1281.96 s [vector] unstream.stream == id: OK
  10001. 1281.96 s [vector] +++ OK, passed 100 tests.
  10002. 1281.96 s [vector] stream.unstream == id: OK
  10003. 1281.96 s [vector] +++ OK, passed 100 tests.
  10004. 1281.97 s [vector] eq: OK
  10005. 1281.97 s [vector] +++ OK, passed 100 tests.
  10006. 1281.97 s [vector] length: OK
  10007. 1281.97 s [vector] +++ OK, passed 100 tests.
  10008. 1281.97 s [vector] null: OK
  10009. 1281.97 s [vector] +++ OK, passed 100 tests.
  10010. 1281.97 s [vector] index: OK
  10011. 1281.97 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10012. 1281.97 s [vector] safeIndex: OK
  10013. 1281.97 s [vector] +++ OK, passed 100 tests.
  10014. 1281.97 s [vector] head: OK
  10015. 1281.97 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10016. 1281.97 s [vector] last: OK
  10017. 1281.97 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10018. 1281.97 s [vector] unsafeIndex: OK
  10019. 1281.97 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10020. 1281.97 s [vector] unsafeHead: OK
  10021. 1281.97 s [vector] +++ OK, passed 100 tests; 27 discarded.
  10022. 1281.97 s [vector] unsafeLast: OK
  10023. 1281.97 s [vector] +++ OK, passed 100 tests; 20 discarded.
  10024. 1281.97 s [vector] slice: OK
  10025. 1281.97 s [vector] +++ OK, passed 100 tests.
  10026. 1281.98 s [vector] init: OK
  10027. 1281.98 s [vector] +++ OK, passed 100 tests; 23 discarded.
  10028. 1281.98 s [vector] tail: OK
  10029. 1281.98 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10030. 1281.98 s [vector] take: OK
  10031. 1281.98 s [vector] +++ OK, passed 100 tests.
  10032. 1281.98 s [vector] drop: OK
  10033. 1281.98 s [vector] +++ OK, passed 100 tests.
  10034. 1281.98 s [vector] splitAt: OK
  10035. 1281.98 s [vector] +++ OK, passed 100 tests.
  10036. 1281.98 s [vector] empty: OK
  10037. 1281.98 s [vector] +++ OK, passed 100 tests.
  10038. 1281.98 s [vector] singleton: OK
  10039. 1281.98 s [vector] +++ OK, passed 100 tests.
  10040. 1281.98 s [vector] replicate: OK
  10041. 1281.98 s [vector] +++ OK, passed 100 tests.
  10042. 1281.99 s [vector] generate: OK
  10043. 1281.99 s [vector] +++ OK, passed 100 tests.
  10044. 1281.99 s [vector] iterateN: OK
  10045. 1281.99 s [vector] +++ OK, passed 100 tests.
  10046. 1282.10 s [vector] iterateNM: OK (0.09s)
  10047. 1282.10 s [vector] +++ OK, passed 100 tests.
  10048. 1282.13 s [vector] generateM: OK (0.04s)
  10049. 1282.13 s [vector] +++ OK, passed 100 tests.
  10050. 1282.14 s [vector] replicateM: OK
  10051. 1282.14 s [vector] +++ OK, passed 100 tests.
  10052. 1282.14 s [vector] create: OK
  10053. 1282.14 s [vector] +++ OK, passed 100 tests.
  10054. 1282.14 s [vector] createT: OK
  10055. 1282.14 s [vector] +++ OK, passed 100 tests.
  10056. 1282.14 s [vector] unfoldr: OK
  10057. 1282.14 s [vector] +++ OK, passed 100 tests.
  10058. 1282.14 s [vector] unfoldrN: OK
  10059. 1282.14 s [vector] +++ OK, passed 100 tests.
  10060. 1282.14 s [vector] unfoldrExactN: OK
  10061. 1282.14 s [vector] +++ OK, passed 100 tests.
  10062. 1282.15 s [vector] unfoldrM: OK
  10063. 1282.15 s [vector] +++ OK, passed 100 tests.
  10064. 1282.15 s [vector] unfoldrNM: OK
  10065. 1282.15 s [vector] +++ OK, passed 100 tests.
  10066. 1282.27 s [vector] unfoldrExactNM: OK (0.11s)
  10067. 1282.27 s [vector] +++ OK, passed 100 tests.
  10068. 1282.28 s [vector] constructN: OK (0.02s)
  10069. 1282.28 s [vector] +++ OK, passed 100 tests.
  10070. 1282.31 s [vector] constructrN: OK (0.01s)
  10071. 1282.31 s [vector] +++ OK, passed 100 tests.
  10072. 1282.31 s [vector] cons: OK
  10073. 1282.31 s [vector] +++ OK, passed 100 tests.
  10074. 1282.31 s [vector] snoc: OK
  10075. 1282.31 s [vector] +++ OK, passed 100 tests.
  10076. 1282.31 s [vector] append: OK
  10077. 1282.31 s [vector] +++ OK, passed 100 tests.
  10078. 1282.35 s [vector] concat: OK (0.04s)
  10079. 1282.35 s [vector] +++ OK, passed 100 tests.
  10080. 1282.35 s [vector] force: OK
  10081. 1282.35 s [vector] +++ OK, passed 100 tests.
  10082. 1282.35 s [vector] upd: OK
  10083. 1282.35 s [vector] +++ OK, passed 100 tests.
  10084. 1282.38 s [vector] accum: OK (0.03s)
  10085. 1282.39 s [vector] +++ OK, passed 100 tests.
  10086. 1282.39 s [vector] reverse: OK
  10087. 1282.39 s [vector] +++ OK, passed 100 tests.
  10088. 1282.39 s [vector] backpermute: OK
  10089. 1282.39 s [vector] +++ OK, passed 100 tests.
  10090. 1282.40 s [vector] map: OK
  10091. 1282.40 s [vector] +++ OK, passed 100 tests.
  10092. 1282.41 s [vector] imap: OK
  10093. 1282.41 s [vector] +++ OK, passed 100 tests.
  10094. 1282.43 s [vector] concatMap: OK
  10095. 1282.43 s [vector] +++ OK, passed 100 tests.
  10096. 1282.44 s [vector] mapM: OK
  10097. 1282.44 s [vector] +++ OK, passed 100 tests.
  10098. 1282.47 s [vector] mapM_: OK (0.04s)
  10099. 1282.47 s [vector] +++ OK, passed 100 tests.
  10100. 1282.47 s [vector] forM: OK
  10101. 1282.47 s [vector] +++ OK, passed 100 tests.
  10102. 1282.51 s [vector] forM_: OK (0.04s)
  10103. 1282.51 s [vector] +++ OK, passed 100 tests.
  10104. 1282.53 s [vector] imapM: OK (0.01s)
  10105. 1282.53 s [vector] +++ OK, passed 100 tests.
  10106. 1282.59 s [vector] imapM_: OK (0.07s)
  10107. 1282.59 s [vector] +++ OK, passed 100 tests.
  10108. 1282.61 s [vector] zipWith: OK (0.02s)
  10109. 1282.61 s [vector] +++ OK, passed 100 tests.
  10110. 1282.64 s [vector] zipWith3: OK (0.02s)
  10111. 1282.64 s [vector] +++ OK, passed 100 tests.
  10112. 1282.67 s [vector] izipWith: OK
  10113. 1282.68 s [vector] +++ OK, passed 100 tests.
  10114. 1282.69 s [vector] izipWith3: OK (0.02s)
  10115. 1282.70 s [vector] +++ OK, passed 100 tests.
  10116. 1282.70 s [vector] izipWithM: OK (0.01s)
  10117. 1282.70 s [vector] +++ OK, passed 100 tests.
  10118. 1282.73 s [vector] izipWithM_: OK (0.02s)
  10119. 1282.74 s [vector] +++ OK, passed 100 tests.
  10120. 1282.74 s [vector] zipWithM: OK (0.01s)
  10121. 1282.74 s [vector] +++ OK, passed 100 tests.
  10122. 1282.77 s [vector] zipWithM_: OK (0.02s)
  10123. 1282.77 s [vector] +++ OK, passed 100 tests.
  10124. 1282.79 s [vector] filter: OK
  10125. 1282.79 s [vector] +++ OK, passed 100 tests.
  10126. 1282.80 s [vector] ifilter: OK
  10127. 1282.80 s [vector] +++ OK, passed 100 tests.
  10128. 1282.84 s [vector] filterM: OK (0.06s)
  10129. 1282.84 s [vector] +++ OK, passed 100 tests.
  10130. 1282.84 s [vector] uniq: OK
  10131. 1282.84 s [vector] +++ OK, passed 100 tests.
  10132. 1282.85 s [vector] mapMaybe: OK
  10133. 1282.85 s [vector] +++ OK, passed 100 tests.
  10134. 1282.86 s [vector] imapMaybe: OK
  10135. 1282.86 s [vector] +++ OK, passed 100 tests.
  10136. 1282.87 s [vector] takeWhile: OK
  10137. 1282.87 s [vector] +++ OK, passed 100 tests.
  10138. 1282.87 s [vector] dropWhile: OK
  10139. 1282.87 s [vector] +++ OK, passed 100 tests.
  10140. 1282.87 s [vector] partition: OK
  10141. 1282.87 s [vector] +++ OK, passed 100 tests.
  10142. 1282.88 s [vector] partitionWith: OK
  10143. 1282.88 s [vector] +++ OK, passed 100 tests.
  10144. 1282.89 s [vector] span: OK
  10145. 1282.89 s [vector] +++ OK, passed 100 tests.
  10146. 1282.89 s [vector] break: OK
  10147. 1282.89 s [vector] +++ OK, passed 100 tests.
  10148. 1282.89 s [vector] spanR: OK
  10149. 1282.89 s [vector] +++ OK, passed 100 tests.
  10150. 1282.89 s [vector] breakR: OK
  10151. 1282.90 s [vector] +++ OK, passed 100 tests.
  10152. 1282.90 s [vector] groupBy: OK
  10153. 1282.90 s [vector] +++ OK, passed 100 tests.
  10154. 1282.90 s [vector] elem: OK
  10155. 1282.90 s [vector] +++ OK, passed 100 tests.
  10156. 1282.90 s [vector] notElem: OK
  10157. 1282.90 s [vector] +++ OK, passed 100 tests.
  10158. 1282.90 s [vector] find: OK
  10159. 1282.90 s [vector] +++ OK, passed 100 tests.
  10160. 1282.90 s [vector] findIndex: OK
  10161. 1282.90 s [vector] +++ OK, passed 100 tests.
  10162. 1282.90 s [vector] findIndexR: OK
  10163. 1282.90 s [vector] +++ OK, passed 100 tests.
  10164. 1282.91 s [vector] findIndices: OK
  10165. 1282.91 s [vector] +++ OK, passed 100 tests.
  10166. 1282.91 s [vector] elemIndex: OK
  10167. 1282.91 s [vector] +++ OK, passed 100 tests.
  10168. 1282.91 s [vector] elemIndices: OK
  10169. 1282.91 s [vector] +++ OK, passed 100 tests.
  10170. 1282.93 s [vector] foldl: OK (0.02s)
  10171. 1282.94 s [vector] +++ OK, passed 100 tests.
  10172. 1282.95 s [vector] foldl1: OK (0.01s)
  10173. 1282.96 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10174. 1282.97 s [vector] foldl': OK (0.01s)
  10175. 1282.97 s [vector] +++ OK, passed 100 tests.
  10176. 1282.98 s [vector] foldl1': OK (0.01s)
  10177. 1282.98 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10178. 1282.99 s [vector] foldr: OK (0.01s)
  10179. 1282.99 s [vector] +++ OK, passed 100 tests.
  10180. 1283.01 s [vector] foldr1: OK (0.01s)
  10181. 1283.01 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10182. 1283.01 s [vector] foldr': OK (0.01s)
  10183. 1283.01 s [vector] +++ OK, passed 100 tests.
  10184. 1283.02 s [vector] foldr1': OK
  10185. 1283.02 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10186. 1283.05 s [vector] ifoldl: OK (0.01s)
  10187. 1283.06 s [vector] +++ OK, passed 100 tests.
  10188. 1283.07 s [vector] ifoldl': OK (0.02s)
  10189. 1283.07 s [vector] +++ OK, passed 100 tests.
  10190. 1283.08 s [vector] ifoldr: OK
  10191. 1283.08 s [vector] +++ OK, passed 100 tests.
  10192. 1283.10 s [vector] ifoldr': OK
  10193. 1283.10 s [vector] +++ OK, passed 100 tests.
  10194. 1283.11 s [vector] ifoldM: OK (0.01s)
  10195. 1283.11 s [vector] +++ OK, passed 100 tests.
  10196. 1283.13 s [vector] ifoldM': OK (0.02s)
  10197. 1283.14 s [vector] +++ OK, passed 100 tests.
  10198. 1283.17 s [vector] ifoldM_: OK (0.04s)
  10199. 1283.18 s [vector] +++ OK, passed 100 tests.
  10200. 1283.21 s [vector] ifoldM'_: OK (0.04s)
  10201. 1283.21 s [vector] +++ OK, passed 100 tests.
  10202. 1283.21 s [vector] all: OK
  10203. 1283.21 s [vector] +++ OK, passed 100 tests.
  10204. 1283.21 s [vector] any: OK
  10205. 1283.21 s [vector] +++ OK, passed 100 tests.
  10206. 1283.23 s [vector] prescanl: OK (0.01s)
  10207. 1283.24 s [vector] +++ OK, passed 100 tests.
  10208. 1283.25 s [vector] prescanl': OK (0.01s)
  10209. 1283.25 s [vector] +++ OK, passed 100 tests.
  10210. 1283.26 s [vector] postscanl: OK (0.02s)
  10211. 1283.26 s [vector] +++ OK, passed 100 tests.
  10212. 1283.27 s [vector] postscanl': OK
  10213. 1283.27 s [vector] +++ OK, passed 100 tests.
  10214. 1283.29 s [vector] scanl: OK (0.01s)
  10215. 1283.30 s [vector] +++ OK, passed 100 tests.
  10216. 1283.32 s [vector] scanl': OK (0.01s)
  10217. 1283.32 s [vector] +++ OK, passed 100 tests.
  10218. 1283.32 s [vector] scanl1: OK (0.02s)
  10219. 1283.32 s [vector] +++ OK, passed 100 tests.
  10220. 1283.34 s [vector] scanl1': OK (0.02s)
  10221. 1283.34 s [vector] +++ OK, passed 100 tests.
  10222. 1283.37 s [vector] iscanl: OK
  10223. 1283.38 s [vector] +++ OK, passed 100 tests.
  10224. 1283.38 s [vector] iscanl': OK (0.02s)
  10225. 1283.38 s [vector] +++ OK, passed 100 tests.
  10226. 1283.39 s [vector] prescanr: OK
  10227. 1283.39 s [vector] +++ OK, passed 100 tests.
  10228. 1283.41 s [vector] prescanr': OK (0.02s)
  10229. 1283.41 s [vector] +++ OK, passed 100 tests.
  10230. 1283.43 s [vector] postscanr: OK (0.02s)
  10231. 1283.44 s [vector] +++ OK, passed 100 tests.
  10232. 1283.45 s [vector] postscanr': OK (0.02s)
  10233. 1283.46 s [vector] +++ OK, passed 100 tests.
  10234. 1283.47 s [vector] scanr: OK (0.01s)
  10235. 1283.47 s [vector] +++ OK, passed 100 tests.
  10236. 1283.49 s [vector] scanr': OK (0.01s)
  10237. 1283.49 s [vector] +++ OK, passed 100 tests.
  10238. 1283.49 s [vector] scanr1: OK (0.01s)
  10239. 1283.49 s [vector] +++ OK, passed 100 tests.
  10240. 1283.50 s [vector] scanr1': OK
  10241. 1283.50 s [vector] +++ OK, passed 100 tests.
  10242. 1283.53 s [vector] iscanr: OK (0.02s)
  10243. 1283.54 s [vector] +++ OK, passed 100 tests.
  10244. 1283.54 s [vector] iscanr': OK (0.02s)
  10245. 1283.54 s [vector] +++ OK, passed 100 tests.
  10246. 1283.54 s [vector] mut_read: OK
  10247. 1283.54 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10248. 1283.54 s [vector] mut_write: OK
  10249. 1283.54 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10250. 1283.54 s [vector] mut_modify: OK
  10251. 1283.55 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10252. 1283.56 s [vector] mut_generate: OK
  10253. 1283.56 s [vector] +++ OK, passed 100 tests.
  10254. 1283.57 s [vector] mut_generateM: OK (0.01s)
  10255. 1283.57 s [vector] +++ OK, passed 100 tests.
  10256. 1283.61 s [vector] mut_mapM_: OK (0.05s)
  10257. 1283.62 s [vector] +++ OK, passed 100 tests.
  10258. 1283.65 s [vector] mut_imapM_: OK (0.05s)
  10259. 1283.65 s [vector] +++ OK, passed 100 tests.
  10260. 1283.71 s [vector] mut_forM_: OK (0.04s)
  10261. 1283.72 s [vector] +++ OK, passed 100 tests.
  10262. 1283.75 s [vector] mut_iforM_: OK (0.04s)
  10263. 1283.75 s [vector] +++ OK, passed 100 tests.
  10264. 1283.76 s [vector] mut_foldr: OK (0.01s)
  10265. 1283.76 s [vector] +++ OK, passed 100 tests.
  10266. 1283.76 s [vector] mut_foldr': OK (0.01s)
  10267. 1283.76 s [vector] +++ OK, passed 100 tests.
  10268. 1283.78 s [vector] mut_foldl: OK
  10269. 1283.78 s [vector] +++ OK, passed 100 tests.
  10270. 1283.79 s [vector] mut_foldl': OK (0.01s)
  10271. 1283.79 s [vector] +++ OK, passed 100 tests.
  10272. 1283.81 s [vector] mut_ifoldr: OK
  10273. 1283.81 s [vector] +++ OK, passed 100 tests.
  10274. 1283.83 s [vector] mut_ifoldr': OK (0.01s)
  10275. 1283.83 s [vector] +++ OK, passed 100 tests.
  10276. 1283.83 s [vector] mut_ifoldl: OK (0.02s)
  10277. 1283.83 s [vector] +++ OK, passed 100 tests.
  10278. 1283.85 s [vector] mut_ifoldl': OK (0.01s)
  10279. 1283.85 s [vector] +++ OK, passed 100 tests.
  10280. 1283.87 s [vector] mut_foldM: OK
  10281. 1283.87 s [vector] +++ OK, passed 100 tests.
  10282. 1283.87 s [vector] mut_foldM': OK (0.01s)
  10283. 1283.87 s [vector] +++ OK, passed 100 tests.
  10284. 1283.89 s [vector] mut_foldrM: OK (0.01s)
  10285. 1283.89 s [vector] +++ OK, passed 100 tests.
  10286. 1283.91 s [vector] mut_foldrM': OK (0.01s)
  10287. 1283.92 s [vector] +++ OK, passed 100 tests.
  10288. 1283.95 s [vector] mut_ifoldM: OK (0.02s)
  10289. 1283.95 s [vector] +++ OK, passed 100 tests.
  10290. 1283.95 s [vector] mut_ifoldM': OK (0.01s)
  10291. 1283.95 s [vector] +++ OK, passed 100 tests.
  10292. 1283.95 s [vector] mut_ifoldrM: OK (0.02s)
  10293. 1283.95 s [vector] +++ OK, passed 100 tests.
  10294. 1283.97 s [vector] mut_ifoldrM': OK (0.02s)
  10295. 1283.97 s [vector] +++ OK, passed 100 tests.
  10296. 1283.97 s [vector] compare: OK
  10297. 1283.97 s [vector] +++ OK, passed 100 tests.
  10298. 1283.97 s [vector] maximum: OK
  10299. 1283.97 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10300. 1283.97 s [vector] minimum: OK
  10301. 1283.97 s [vector] +++ OK, passed 100 tests; 20 discarded.
  10302. 1283.97 s [vector] minIndex: OK
  10303. 1283.97 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10304. 1283.98 s [vector] maxIndex: OK
  10305. 1283.98 s [vector] +++ OK, passed 100 tests; 11 discarded.
  10306. 1283.98 s [vector] maximumBy: OK
  10307. 1283.98 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10308. 1283.98 s [vector] minimumBy: OK
  10309. 1283.98 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10310. 1283.98 s [vector] maximumOn: OK
  10311. 1283.98 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10312. 1283.98 s [vector] minimumOn: OK
  10313. 1283.98 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10314. 1283.98 s [vector] maxIndexBy: OK
  10315. 1283.98 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10316. 1283.98 s [vector] minIndexBy: OK
  10317. 1283.98 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10318. 1283.98 s [vector] ListFirstMaxIndexWins: OK
  10319. 1283.98 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10320. 1283.99 s [vector] FalseListFirstMaxIndexWins: OK
  10321. 1283.99 s [vector] +++ OK, failed as expected. (after 1 test):
  10322. 1283.99 s [vector] Exception:
  10323. 1283.99 s [vector] Prelude.foldr1: empty list
  10324. 1283.99 s [vector] CallStack (from HasCallStack):
  10325. 1283.99 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  10326. 1283.99 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  10327. 1283.99 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  10328. 1283.99 s [vector] []
  10329. 1283.99 s [vector] zip: OK
  10330. 1283.99 s [vector] +++ OK, passed 100 tests.
  10331. 1283.99 s [vector] zip3: OK
  10332. 1283.99 s [vector] +++ OK, passed 100 tests.
  10333. 1283.99 s [vector] unzip: OK
  10334. 1283.99 s [vector] +++ OK, passed 100 tests.
  10335. 1283.99 s [vector] unzip3: OK
  10336. 1283.99 s [vector] +++ OK, passed 100 tests.
  10337. 1283.99 s [vector] indexed: OK
  10338. 1283.99 s [vector] +++ OK, passed 100 tests.
  10339. 1284.00 s [vector] update: OK
  10340. 1284.00 s [vector] +++ OK, passed 100 tests.
  10341. 1284.00 s [vector] mempty: OK
  10342. 1284.00 s [vector] +++ OK, passed 100 tests.
  10343. 1284.01 s [vector] mappend: OK
  10344. 1284.01 s [vector] +++ OK, passed 100 tests.
  10345. 1284.02 s [vector] mconcat: OK (0.02s)
  10346. 1284.02 s [vector] +++ OK, passed 100 tests.
  10347. 1284.02 s [vector] glength: OK
  10348. 1284.02 s [vector] +++ OK, passed 100 tests.
  10349. 1284.03 s [vector] sum: OK
  10350. 1284.03 s [vector] +++ OK, passed 100 tests.
  10351. 1284.03 s [vector] product: OK
  10352. 1284.03 s [vector] +++ OK, passed 100 tests.
  10353. 1284.03 s [vector] enumFromN: OK
  10354. 1284.03 s [vector] +++ OK, passed 100 tests.
  10355. 1284.03 s [vector] enumFromThenN: OK
  10356. 1284.03 s [vector] +++ OK, passed 100 tests.
  10357. 1284.03 s [vector] enumFromTo: OK
  10358. 1284.03 s [vector] +++ OK, passed 100 tests.
  10359. 1284.04 s [vector] enumFromThenTo: OK
  10360. 1284.04 s [vector] +++ OK, passed 100 tests; 1 discarded.
  10361. 1284.04 s [vector] (Int,Bool)
  10362. 1284.04 s [vector] fromList.toList == id: OK
  10363. 1284.04 s [vector] +++ OK, passed 100 tests.
  10364. 1284.04 s [vector] toList.fromList == id: OK
  10365. 1284.04 s [vector] +++ OK, passed 100 tests.
  10366. 1284.04 s [vector] unstream.stream == id: OK
  10367. 1284.04 s [vector] +++ OK, passed 100 tests.
  10368. 1284.04 s [vector] stream.unstream == id: OK
  10369. 1284.04 s [vector] +++ OK, passed 100 tests.
  10370. 1284.05 s [vector] eq: OK
  10371. 1284.05 s [vector] +++ OK, passed 100 tests.
  10372. 1284.05 s [vector] length: OK
  10373. 1284.05 s [vector] +++ OK, passed 100 tests.
  10374. 1284.05 s [vector] null: OK
  10375. 1284.05 s [vector] +++ OK, passed 100 tests.
  10376. 1284.05 s [vector] index: OK
  10377. 1284.05 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10378. 1284.05 s [vector] safeIndex: OK
  10379. 1284.05 s [vector] +++ OK, passed 100 tests.
  10380. 1284.05 s [vector] head: OK
  10381. 1284.05 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10382. 1284.05 s [vector] last: OK
  10383. 1284.05 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10384. 1284.05 s [vector] unsafeIndex: OK
  10385. 1284.05 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10386. 1284.05 s [vector] unsafeHead: OK
  10387. 1284.05 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10388. 1284.05 s [vector] unsafeLast: OK
  10389. 1284.05 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10390. 1284.06 s [vector] slice: OK
  10391. 1284.06 s [vector] +++ OK, passed 100 tests.
  10392. 1284.06 s [vector] init: OK
  10393. 1284.06 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10394. 1284.06 s [vector] tail: OK
  10395. 1284.06 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10396. 1284.06 s [vector] take: OK
  10397. 1284.06 s [vector] +++ OK, passed 100 tests.
  10398. 1284.06 s [vector] drop: OK
  10399. 1284.06 s [vector] +++ OK, passed 100 tests.
  10400. 1284.06 s [vector] splitAt: OK
  10401. 1284.06 s [vector] +++ OK, passed 100 tests.
  10402. 1284.06 s [vector] empty: OK
  10403. 1284.06 s [vector] +++ OK, passed 100 tests.
  10404. 1284.06 s [vector] singleton: OK
  10405. 1284.06 s [vector] +++ OK, passed 100 tests.
  10406. 1284.06 s [vector] replicate: OK
  10407. 1284.07 s [vector] +++ OK, passed 100 tests.
  10408. 1284.07 s [vector] generate: OK
  10409. 1284.07 s [vector] +++ OK, passed 100 tests.
  10410. 1284.07 s [vector] iterateN: OK
  10411. 1284.07 s [vector] +++ OK, passed 100 tests.
  10412. 1284.12 s [vector] iterateNM: OK (0.05s)
  10413. 1284.12 s [vector] +++ OK, passed 100 tests.
  10414. 1284.14 s [vector] generateM: OK
  10415. 1284.14 s [vector] +++ OK, passed 100 tests.
  10416. 1284.17 s [vector] replicateM: OK
  10417. 1284.17 s [vector] +++ OK, passed 100 tests.
  10418. 1284.18 s [vector] create: OK
  10419. 1284.18 s [vector] +++ OK, passed 100 tests.
  10420. 1284.18 s [vector] createT: OK
  10421. 1284.18 s [vector] +++ OK, passed 100 tests.
  10422. 1284.18 s [vector] unfoldr: OK
  10423. 1284.18 s [vector] +++ OK, passed 100 tests.
  10424. 1284.18 s [vector] unfoldrN: OK
  10425. 1284.18 s [vector] +++ OK, passed 100 tests.
  10426. 1284.18 s [vector] unfoldrExactN: OK
  10427. 1284.18 s [vector] +++ OK, passed 100 tests.
  10428. 1284.19 s [vector] unfoldrM: OK
  10429. 1284.19 s [vector] +++ OK, passed 100 tests.
  10430. 1284.19 s [vector] unfoldrNM: OK
  10431. 1284.19 s [vector] +++ OK, passed 100 tests.
  10432. 1284.21 s [vector] unfoldrExactNM: OK (0.02s)
  10433. 1284.21 s [vector] +++ OK, passed 100 tests.
  10434. 1284.22 s [vector] constructN: OK
  10435. 1284.22 s [vector] +++ OK, passed 100 tests.
  10436. 1284.23 s [vector] constructrN: OK
  10437. 1284.23 s [vector] +++ OK, passed 100 tests.
  10438. 1284.23 s [vector] cons: OK
  10439. 1284.23 s [vector] +++ OK, passed 100 tests.
  10440. 1284.23 s [vector] snoc: OK
  10441. 1284.23 s [vector] +++ OK, passed 100 tests.
  10442. 1284.23 s [vector] append: OK
  10443. 1284.23 s [vector] +++ OK, passed 100 tests.
  10444. 1284.27 s [vector] concat: OK (0.04s)
  10445. 1284.27 s [vector] +++ OK, passed 100 tests.
  10446. 1284.27 s [vector] force: OK
  10447. 1284.27 s [vector] +++ OK, passed 100 tests.
  10448. 1284.28 s [vector] upd: OK
  10449. 1284.28 s [vector] +++ OK, passed 100 tests.
  10450. 1284.29 s [vector] accum: OK
  10451. 1284.29 s [vector] +++ OK, passed 100 tests.
  10452. 1284.29 s [vector] reverse: OK
  10453. 1284.29 s [vector] +++ OK, passed 100 tests.
  10454. 1284.29 s [vector] backpermute: OK
  10455. 1284.29 s [vector] +++ OK, passed 100 tests.
  10456. 1284.29 s [vector] map: OK
  10457. 1284.30 s [vector] +++ OK, passed 100 tests.
  10458. 1284.30 s [vector] imap: OK
  10459. 1284.30 s [vector] +++ OK, passed 100 tests.
  10460. 1284.31 s [vector] concatMap: OK
  10461. 1284.31 s [vector] +++ OK, passed 100 tests.
  10462. 1284.31 s [vector] mapM: OK
  10463. 1284.31 s [vector] +++ OK, passed 100 tests.
  10464. 1284.35 s [vector] mapM_: OK (0.03s)
  10465. 1284.35 s [vector] +++ OK, passed 100 tests.
  10466. 1284.35 s [vector] forM: OK
  10467. 1284.35 s [vector] +++ OK, passed 100 tests.
  10468. 1284.38 s [vector] forM_: OK (0.03s)
  10469. 1284.38 s [vector] +++ OK, passed 100 tests.
  10470. 1284.39 s [vector] imapM: OK
  10471. 1284.39 s [vector] +++ OK, passed 100 tests.
  10472. 1284.44 s [vector] imapM_: OK (0.05s)
  10473. 1284.44 s [vector] +++ OK, passed 100 tests.
  10474. 1284.45 s [vector] zipWith: OK
  10475. 1284.45 s [vector] +++ OK, passed 100 tests.
  10476. 1284.46 s [vector] zipWith3: OK
  10477. 1284.46 s [vector] +++ OK, passed 100 tests.
  10478. 1284.46 s [vector] izipWith: OK
  10479. 1284.47 s [vector] +++ OK, passed 100 tests.
  10480. 1284.47 s [vector] izipWith3: OK
  10481. 1284.47 s [vector] +++ OK, passed 100 tests.
  10482. 1284.48 s [vector] izipWithM: OK
  10483. 1284.48 s [vector] +++ OK, passed 100 tests.
  10484. 1284.50 s [vector] izipWithM_: OK (0.02s)
  10485. 1284.51 s [vector] +++ OK, passed 100 tests.
  10486. 1284.52 s [vector] zipWithM: OK
  10487. 1284.52 s [vector] +++ OK, passed 100 tests.
  10488. 1284.55 s [vector] zipWithM_: OK (0.03s)
  10489. 1284.55 s [vector] +++ OK, passed 100 tests.
  10490. 1284.55 s [vector] filter: OK (0.02s)
  10491. 1284.55 s [vector] +++ OK, passed 100 tests.
  10492. 1284.58 s [vector] ifilter: OK
  10493. 1284.58 s [vector] +++ OK, passed 100 tests.
  10494. 1284.61 s [vector] filterM: OK (0.06s)
  10495. 1284.61 s [vector] +++ OK, passed 100 tests.
  10496. 1284.62 s [vector] uniq: OK
  10497. 1284.62 s [vector] +++ OK, passed 100 tests.
  10498. 1284.62 s [vector] mapMaybe: OK
  10499. 1284.63 s [vector] +++ OK, passed 100 tests.
  10500. 1284.63 s [vector] imapMaybe: OK
  10501. 1284.63 s [vector] +++ OK, passed 100 tests.
  10502. 1284.64 s [vector] takeWhile: OK
  10503. 1284.65 s [vector] +++ OK, passed 100 tests.
  10504. 1284.65 s [vector] dropWhile: OK
  10505. 1284.65 s [vector] +++ OK, passed 100 tests.
  10506. 1284.66 s [vector] partition: OK
  10507. 1284.66 s [vector] +++ OK, passed 100 tests.
  10508. 1284.66 s [vector] partitionWith: OK
  10509. 1284.66 s [vector] +++ OK, passed 100 tests.
  10510. 1284.66 s [vector] span: OK
  10511. 1284.66 s [vector] +++ OK, passed 100 tests.
  10512. 1284.66 s [vector] break: OK
  10513. 1284.66 s [vector] +++ OK, passed 100 tests.
  10514. 1284.67 s [vector] spanR: OK
  10515. 1284.67 s [vector] +++ OK, passed 100 tests.
  10516. 1284.67 s [vector] breakR: OK
  10517. 1284.67 s [vector] +++ OK, passed 100 tests.
  10518. 1284.67 s [vector] groupBy: OK
  10519. 1284.67 s [vector] +++ OK, passed 100 tests.
  10520. 1284.67 s [vector] elem: OK
  10521. 1284.67 s [vector] +++ OK, passed 100 tests.
  10522. 1284.68 s [vector] notElem: OK
  10523. 1284.68 s [vector] +++ OK, passed 100 tests.
  10524. 1284.68 s [vector] find: OK
  10525. 1284.68 s [vector] +++ OK, passed 100 tests.
  10526. 1284.68 s [vector] findIndex: OK
  10527. 1284.68 s [vector] +++ OK, passed 100 tests.
  10528. 1284.68 s [vector] findIndexR: OK
  10529. 1284.68 s [vector] +++ OK, passed 100 tests.
  10530. 1284.68 s [vector] findIndices: OK
  10531. 1284.68 s [vector] +++ OK, passed 100 tests.
  10532. 1284.68 s [vector] elemIndex: OK
  10533. 1284.68 s [vector] +++ OK, passed 100 tests.
  10534. 1284.69 s [vector] elemIndices: OK
  10535. 1284.70 s [vector] +++ OK, passed 100 tests.
  10536. 1284.70 s [vector] foldl: OK
  10537. 1284.70 s [vector] +++ OK, passed 100 tests.
  10538. 1284.71 s [vector] foldl1: OK (0.01s)
  10539. 1284.72 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10540. 1284.72 s [vector] foldl': OK (0.01s)
  10541. 1284.72 s [vector] +++ OK, passed 100 tests.
  10542. 1284.73 s [vector] foldl1': OK
  10543. 1284.73 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10544. 1284.73 s [vector] foldr: OK
  10545. 1284.73 s [vector] +++ OK, passed 100 tests.
  10546. 1284.75 s [vector] foldr1: OK
  10547. 1284.75 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10548. 1284.75 s [vector] foldr': OK
  10549. 1284.75 s [vector] +++ OK, passed 100 tests.
  10550. 1284.76 s [vector] foldr1': OK
  10551. 1284.76 s [vector] +++ OK, passed 100 tests; 11 discarded.
  10552. 1284.76 s [vector] ifoldl: OK (0.01s)
  10553. 1284.76 s [vector] +++ OK, passed 100 tests.
  10554. 1284.77 s [vector] ifoldl': OK
  10555. 1284.78 s [vector] +++ OK, passed 100 tests.
  10556. 1284.78 s [vector] ifoldr: OK (0.01s)
  10557. 1284.78 s [vector] +++ OK, passed 100 tests.
  10558. 1284.79 s [vector] ifoldr': OK
  10559. 1284.80 s [vector] +++ OK, passed 100 tests.
  10560. 1284.80 s [vector] ifoldM: OK
  10561. 1284.80 s [vector] +++ OK, passed 100 tests.
  10562. 1284.80 s [vector] ifoldM': OK
  10563. 1284.81 s [vector] +++ OK, passed 100 tests.
  10564. 1284.85 s [vector] ifoldM_: OK (0.04s)
  10565. 1284.85 s [vector] +++ OK, passed 100 tests.
  10566. 1284.89 s [vector] ifoldM'_: OK (0.04s)
  10567. 1284.89 s [vector] +++ OK, passed 100 tests.
  10568. 1284.89 s [vector] all: OK
  10569. 1284.89 s [vector] +++ OK, passed 100 tests.
  10570. 1284.90 s [vector] any: OK
  10571. 1284.90 s [vector] +++ OK, passed 100 tests.
  10572. 1284.91 s [vector] prescanl: OK
  10573. 1284.91 s [vector] +++ OK, passed 100 tests.
  10574. 1284.91 s [vector] prescanl': OK
  10575. 1284.91 s [vector] +++ OK, passed 100 tests.
  10576. 1284.91 s [vector] postscanl: OK
  10577. 1284.91 s [vector] +++ OK, passed 100 tests.
  10578. 1284.92 s [vector] postscanl': OK
  10579. 1284.92 s [vector] +++ OK, passed 100 tests.
  10580. 1284.93 s [vector] scanl: OK
  10581. 1284.93 s [vector] +++ OK, passed 100 tests.
  10582. 1284.93 s [vector] scanl': OK
  10583. 1284.93 s [vector] +++ OK, passed 100 tests.
  10584. 1284.95 s [vector] scanl1: OK
  10585. 1284.95 s [vector] +++ OK, passed 100 tests.
  10586. 1284.96 s [vector] scanl1': OK
  10587. 1284.96 s [vector] +++ OK, passed 100 tests.
  10588. 1284.96 s [vector] iscanl: OK (0.01s)
  10589. 1284.96 s [vector] +++ OK, passed 100 tests.
  10590. 1284.97 s [vector] iscanl': OK
  10591. 1284.97 s [vector] +++ OK, passed 100 tests.
  10592. 1284.97 s [vector] prescanr: OK
  10593. 1284.97 s [vector] +++ OK, passed 100 tests.
  10594. 1284.98 s [vector] prescanr': OK
  10595. 1284.98 s [vector] +++ OK, passed 100 tests.
  10596. 1284.99 s [vector] postscanr: OK
  10597. 1284.99 s [vector] +++ OK, passed 100 tests.
  10598. 1284.99 s [vector] postscanr': OK
  10599. 1284.99 s [vector] +++ OK, passed 100 tests.
  10600. 1285.00 s [vector] scanr: OK
  10601. 1285.00 s [vector] +++ OK, passed 100 tests.
  10602. 1285.01 s [vector] scanr': OK
  10603. 1285.01 s [vector] +++ OK, passed 100 tests.
  10604. 1285.01 s [vector] scanr1: OK
  10605. 1285.01 s [vector] +++ OK, passed 100 tests.
  10606. 1285.03 s [vector] scanr1': OK
  10607. 1285.03 s [vector] +++ OK, passed 100 tests.
  10608. 1285.03 s [vector] iscanr: OK
  10609. 1285.04 s [vector] +++ OK, passed 100 tests.
  10610. 1285.04 s [vector] iscanr': OK
  10611. 1285.04 s [vector] +++ OK, passed 100 tests.
  10612. 1285.04 s [vector] mut_read: OK
  10613. 1285.04 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10614. 1285.04 s [vector] mut_write: OK
  10615. 1285.04 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10616. 1285.04 s [vector] mut_modify: OK
  10617. 1285.04 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10618. 1285.05 s [vector] mut_generate: OK
  10619. 1285.05 s [vector] +++ OK, passed 100 tests.
  10620. 1285.06 s [vector] mut_generateM: OK (0.02s)
  10621. 1285.06 s [vector] +++ OK, passed 100 tests.
  10622. 1285.11 s [vector] mut_mapM_: OK (0.03s)
  10623. 1285.12 s [vector] +++ OK, passed 100 tests.
  10624. 1285.15 s [vector] mut_imapM_: OK (0.03s)
  10625. 1285.16 s [vector] +++ OK, passed 100 tests.
  10626. 1285.19 s [vector] mut_forM_: OK (0.05s)
  10627. 1285.19 s [vector] +++ OK, passed 100 tests.
  10628. 1285.23 s [vector] mut_iforM_: OK (0.04s)
  10629. 1285.24 s [vector] +++ OK, passed 100 tests.
  10630. 1285.24 s [vector] mut_foldr: OK
  10631. 1285.24 s [vector] +++ OK, passed 100 tests.
  10632. 1285.24 s [vector] mut_foldr': OK
  10633. 1285.24 s [vector] +++ OK, passed 100 tests.
  10634. 1285.25 s [vector] mut_foldl: OK
  10635. 1285.25 s [vector] +++ OK, passed 100 tests.
  10636. 1285.26 s [vector] mut_foldl': OK
  10637. 1285.27 s [vector] +++ OK, passed 100 tests.
  10638. 1285.27 s [vector] mut_ifoldr: OK
  10639. 1285.27 s [vector] +++ OK, passed 100 tests.
  10640. 1285.27 s [vector] mut_ifoldr': OK
  10641. 1285.27 s [vector] +++ OK, passed 100 tests.
  10642. 1285.27 s [vector] mut_ifoldl: OK
  10643. 1285.27 s [vector] +++ OK, passed 100 tests.
  10644. 1285.29 s [vector] mut_ifoldl': OK
  10645. 1285.29 s [vector] +++ OK, passed 100 tests.
  10646. 1285.30 s [vector] mut_foldM: OK
  10647. 1285.30 s [vector] +++ OK, passed 100 tests.
  10648. 1285.30 s [vector] mut_foldM': OK
  10649. 1285.30 s [vector] +++ OK, passed 100 tests.
  10650. 1285.31 s [vector] mut_foldrM: OK
  10651. 1285.31 s [vector] +++ OK, passed 100 tests.
  10652. 1285.31 s [vector] mut_foldrM': OK
  10653. 1285.31 s [vector] +++ OK, passed 100 tests.
  10654. 1285.31 s [vector] mut_ifoldM: OK
  10655. 1285.32 s [vector] +++ OK, passed 100 tests.
  10656. 1285.32 s [vector] mut_ifoldM': OK
  10657. 1285.32 s [vector] +++ OK, passed 100 tests.
  10658. 1285.33 s [vector] mut_ifoldrM: OK
  10659. 1285.34 s [vector] +++ OK, passed 100 tests.
  10660. 1285.34 s [vector] mut_ifoldrM': OK (0.01s)
  10661. 1285.34 s [vector] +++ OK, passed 100 tests.
  10662. 1285.34 s [vector] compare: OK
  10663. 1285.34 s [vector] +++ OK, passed 100 tests.
  10664. 1285.35 s [vector] maximum: OK
  10665. 1285.35 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10666. 1285.35 s [vector] minimum: OK
  10667. 1285.35 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10668. 1285.35 s [vector] minIndex: OK
  10669. 1285.35 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10670. 1285.35 s [vector] maxIndex: OK
  10671. 1285.35 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10672. 1285.35 s [vector] maximumBy: OK
  10673. 1285.35 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10674. 1285.35 s [vector] minimumBy: OK
  10675. 1285.35 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10676. 1285.36 s [vector] maximumOn: OK
  10677. 1285.36 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10678. 1285.36 s [vector] minimumOn: OK
  10679. 1285.36 s [vector] +++ OK, passed 100 tests; 22 discarded.
  10680. 1285.36 s [vector] maxIndexBy: OK
  10681. 1285.36 s [vector] +++ OK, passed 100 tests; 20 discarded.
  10682. 1285.36 s [vector] minIndexBy: OK
  10683. 1285.36 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10684. 1285.36 s [vector] ListFirstMaxIndexWins: OK
  10685. 1285.36 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10686. 1285.36 s [vector] FalseListFirstMaxIndexWins: OK
  10687. 1285.36 s [vector] +++ OK, failed as expected. (after 1 test):
  10688. 1285.37 s [vector] Exception:
  10689. 1285.37 s [vector] Prelude.foldr1: empty list
  10690. 1285.37 s [vector] CallStack (from HasCallStack):
  10691. 1285.37 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  10692. 1285.37 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  10693. 1285.37 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  10694. 1285.37 s [vector] []
  10695. 1285.37 s [vector] zip: OK
  10696. 1285.37 s [vector] +++ OK, passed 100 tests.
  10697. 1285.37 s [vector] zip3: OK
  10698. 1285.38 s [vector] +++ OK, passed 100 tests.
  10699. 1285.38 s [vector] unzip: OK
  10700. 1285.38 s [vector] +++ OK, passed 100 tests.
  10701. 1285.38 s [vector] unzip3: OK
  10702. 1285.38 s [vector] +++ OK, passed 100 tests.
  10703. 1285.39 s [vector] indexed: OK
  10704. 1285.39 s [vector] +++ OK, passed 100 tests.
  10705. 1285.39 s [vector] update: OK
  10706. 1285.39 s [vector] +++ OK, passed 100 tests.
  10707. 1285.39 s [vector] mempty: OK
  10708. 1285.39 s [vector] +++ OK, passed 100 tests.
  10709. 1285.42 s [vector] mappend: OK
  10710. 1285.42 s [vector] +++ OK, passed 100 tests.
  10711. 1285.44 s [vector] mconcat: OK (0.05s)
  10712. 1285.44 s [vector] +++ OK, passed 100 tests.
  10713. 1285.45 s [vector] glength: OK
  10714. 1285.45 s [vector] +++ OK, passed 100 tests.
  10715. 1285.45 s [vector] (Int,Bool,Int)
  10716. 1285.45 s [vector] fromList.toList == id: OK
  10717. 1285.45 s [vector] +++ OK, passed 100 tests.
  10718. 1285.45 s [vector] toList.fromList == id: OK
  10719. 1285.45 s [vector] +++ OK, passed 100 tests.
  10720. 1285.45 s [vector] unstream.stream == id: OK
  10721. 1285.45 s [vector] +++ OK, passed 100 tests.
  10722. 1285.45 s [vector] stream.unstream == id: OK
  10723. 1285.45 s [vector] +++ OK, passed 100 tests.
  10724. 1285.46 s [vector] eq: OK
  10725. 1285.46 s [vector] +++ OK, passed 100 tests.
  10726. 1285.46 s [vector] length: OK
  10727. 1285.46 s [vector] +++ OK, passed 100 tests.
  10728. 1285.46 s [vector] null: OK
  10729. 1285.46 s [vector] +++ OK, passed 100 tests.
  10730. 1285.46 s [vector] index: OK
  10731. 1285.46 s [vector] +++ OK, passed 100 tests; 20 discarded.
  10732. 1285.46 s [vector] safeIndex: OK
  10733. 1285.46 s [vector] +++ OK, passed 100 tests.
  10734. 1285.46 s [vector] head: OK
  10735. 1285.46 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10736. 1285.46 s [vector] last: OK
  10737. 1285.46 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10738. 1285.47 s [vector] unsafeIndex: OK
  10739. 1285.47 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10740. 1285.47 s [vector] unsafeHead: OK
  10741. 1285.47 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10742. 1285.47 s [vector] unsafeLast: OK
  10743. 1285.47 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10744. 1285.47 s [vector] slice: OK
  10745. 1285.47 s [vector] +++ OK, passed 100 tests.
  10746. 1285.47 s [vector] init: OK
  10747. 1285.47 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10748. 1285.47 s [vector] tail: OK
  10749. 1285.47 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10750. 1285.48 s [vector] take: OK
  10751. 1285.48 s [vector] +++ OK, passed 100 tests.
  10752. 1285.48 s [vector] drop: OK
  10753. 1285.48 s [vector] +++ OK, passed 100 tests.
  10754. 1285.48 s [vector] splitAt: OK
  10755. 1285.48 s [vector] +++ OK, passed 100 tests.
  10756. 1285.48 s [vector] empty: OK
  10757. 1285.48 s [vector] +++ OK, passed 100 tests.
  10758. 1285.48 s [vector] singleton: OK
  10759. 1285.48 s [vector] +++ OK, passed 100 tests.
  10760. 1285.49 s [vector] replicate: OK
  10761. 1285.49 s [vector] +++ OK, passed 100 tests.
  10762. 1285.49 s [vector] generate: OK
  10763. 1285.49 s [vector] +++ OK, passed 100 tests.
  10764. 1285.49 s [vector] iterateN: OK
  10765. 1285.49 s [vector] +++ OK, passed 100 tests.
  10766. 1285.55 s [vector] iterateNM: OK (0.05s)
  10767. 1285.55 s [vector] +++ OK, passed 100 tests.
  10768. 1285.61 s [vector] generateM: OK (0.04s)
  10769. 1285.61 s [vector] +++ OK, passed 100 tests.
  10770. 1285.61 s [vector] replicateM: OK (0.01s)
  10771. 1285.61 s [vector] +++ OK, passed 100 tests.
  10772. 1285.61 s [vector] create: OK
  10773. 1285.61 s [vector] +++ OK, passed 100 tests.
  10774. 1285.62 s [vector] createT: OK
  10775. 1285.62 s [vector] +++ OK, passed 100 tests.
  10776. 1285.62 s [vector] unfoldr: OK
  10777. 1285.62 s [vector] +++ OK, passed 100 tests.
  10778. 1285.62 s [vector] unfoldrN: OK
  10779. 1285.62 s [vector] +++ OK, passed 100 tests.
  10780. 1285.62 s [vector] unfoldrExactN: OK
  10781. 1285.62 s [vector] +++ OK, passed 100 tests.
  10782. 1285.63 s [vector] unfoldrM: OK
  10783. 1285.63 s [vector] +++ OK, passed 100 tests.
  10784. 1285.64 s [vector] unfoldrNM: OK
  10785. 1285.64 s [vector] +++ OK, passed 100 tests.
  10786. 1285.69 s [vector] unfoldrExactNM: OK (0.06s)
  10787. 1285.70 s [vector] +++ OK, passed 100 tests.
  10788. 1285.70 s [vector] constructN: OK (0.01s)
  10789. 1285.70 s [vector] +++ OK, passed 100 tests.
  10790. 1285.71 s [vector] constructrN: OK
  10791. 1285.71 s [vector] +++ OK, passed 100 tests.
  10792. 1285.71 s [vector] cons: OK
  10793. 1285.73 s [vector] +++ OK, passed 100 tests.
  10794. 1285.74 s [vector] snoc: OK
  10795. 1285.74 s [vector] +++ OK, passed 100 tests.
  10796. 1285.74 s [vector] append: OK
  10797. 1285.74 s [vector] +++ OK, passed 100 tests.
  10798. 1285.77 s [vector] concat: OK (0.05s)
  10799. 1285.77 s [vector] +++ OK, passed 100 tests.
  10800. 1285.77 s [vector] force: OK
  10801. 1285.77 s [vector] +++ OK, passed 100 tests.
  10802. 1285.78 s [vector] upd: OK
  10803. 1285.78 s [vector] +++ OK, passed 100 tests.
  10804. 1285.79 s [vector] accum: OK
  10805. 1285.79 s [vector] +++ OK, passed 100 tests.
  10806. 1285.79 s [vector] reverse: OK
  10807. 1285.79 s [vector] +++ OK, passed 100 tests.
  10808. 1285.79 s [vector] backpermute: OK
  10809. 1285.79 s [vector] +++ OK, passed 100 tests.
  10810. 1285.80 s [vector] map: OK
  10811. 1285.80 s [vector] +++ OK, passed 100 tests.
  10812. 1285.81 s [vector] imap: OK
  10813. 1285.82 s [vector] +++ OK, passed 100 tests.
  10814. 1285.83 s [vector] concatMap: OK (0.01s)
  10815. 1285.83 s [vector] +++ OK, passed 100 tests.
  10816. 1285.84 s [vector] mapM: OK
  10817. 1285.84 s [vector] +++ OK, passed 100 tests.
  10818. 1285.92 s [vector] mapM_: OK (0.08s)
  10819. 1285.92 s [vector] +++ OK, passed 100 tests.
  10820. 1285.94 s [vector] forM: OK (0.02s)
  10821. 1285.94 s [vector] +++ OK, passed 100 tests.
  10822. 1285.99 s [vector] forM_: OK (0.06s)
  10823. 1285.99 s [vector] +++ OK, passed 100 tests.
  10824. 1286.01 s [vector] imapM: OK
  10825. 1286.01 s [vector] +++ OK, passed 100 tests.
  10826. 1286.05 s [vector] imapM_: OK (0.05s)
  10827. 1286.05 s [vector] +++ OK, passed 100 tests.
  10828. 1286.07 s [vector] zipWith: OK
  10829. 1286.07 s [vector] +++ OK, passed 100 tests.
  10830. 1286.08 s [vector] zipWith3: OK
  10831. 1286.08 s [vector] +++ OK, passed 100 tests.
  10832. 1286.08 s [vector] izipWith: OK
  10833. 1286.08 s [vector] +++ OK, passed 100 tests.
  10834. 1286.08 s [vector] izipWith3: OK
  10835. 1286.08 s [vector] +++ OK, passed 100 tests.
  10836. 1286.09 s [vector] izipWithM: OK
  10837. 1286.10 s [vector] +++ OK, passed 100 tests.
  10838. 1286.13 s [vector] izipWithM_: OK (0.04s)
  10839. 1286.13 s [vector] +++ OK, passed 100 tests.
  10840. 1286.15 s [vector] zipWithM: OK
  10841. 1286.15 s [vector] +++ OK, passed 100 tests.
  10842. 1286.18 s [vector] zipWithM_: OK (0.04s)
  10843. 1286.18 s [vector] +++ OK, passed 100 tests.
  10844. 1286.18 s [vector] filter: OK
  10845. 1286.18 s [vector] +++ OK, passed 100 tests.
  10846. 1286.19 s [vector] ifilter: OK
  10847. 1286.19 s [vector] +++ OK, passed 100 tests.
  10848. 1286.26 s [vector] filterM: OK (0.07s)
  10849. 1286.38 s [vector] +++ OK, passed 100 tests.
  10850. 1286.38 s [vector] uniq: OK
  10851. 1286.38 s [vector] +++ OK, passed 100 tests.
  10852. 1286.38 s [vector] mapMaybe: OK
  10853. 1286.38 s [vector] +++ OK, passed 100 tests.
  10854. 1286.38 s [vector] imapMaybe: OK
  10855. 1286.38 s [vector] +++ OK, passed 100 tests.
  10856. 1286.38 s [vector] takeWhile: OK
  10857. 1286.38 s [vector] +++ OK, passed 100 tests.
  10858. 1286.38 s [vector] dropWhile: OK
  10859. 1286.38 s [vector] +++ OK, passed 100 tests.
  10860. 1286.38 s [vector] partition: OK
  10861. 1286.38 s [vector] +++ OK, passed 100 tests.
  10862. 1286.38 s [vector] partitionWith: OK
  10863. 1286.38 s [vector] +++ OK, passed 100 tests.
  10864. 1286.38 s [vector] span: OK
  10865. 1286.38 s [vector] +++ OK, passed 100 tests.
  10866. 1286.38 s [vector] break: OK
  10867. 1286.38 s [vector] +++ OK, passed 100 tests.
  10868. 1286.38 s [vector] spanR: OK
  10869. 1286.38 s [vector] +++ OK, passed 100 tests.
  10870. 1286.38 s [vector] breakR: OK
  10871. 1286.38 s [vector] +++ OK, passed 100 tests.
  10872. 1286.38 s [vector] groupBy: OK
  10873. 1286.38 s [vector] +++ OK, passed 100 tests.
  10874. 1286.38 s [vector] elem: OK
  10875. 1286.38 s [vector] +++ OK, passed 100 tests.
  10876. 1286.38 s [vector] notElem: OK
  10877. 1286.38 s [vector] +++ OK, passed 100 tests.
  10878. 1286.38 s [vector] find: OK
  10879. 1286.38 s [vector] +++ OK, passed 100 tests.
  10880. 1286.38 s [vector] findIndex: OK
  10881. 1286.39 s [vector] +++ OK, passed 100 tests.
  10882. 1286.39 s [vector] findIndexR: OK
  10883. 1286.39 s [vector] +++ OK, passed 100 tests.
  10884. 1286.39 s [vector] findIndices: OK
  10885. 1286.39 s [vector] +++ OK, passed 100 tests.
  10886. 1286.39 s [vector] elemIndex: OK
  10887. 1286.39 s [vector] +++ OK, passed 100 tests.
  10888. 1286.39 s [vector] elemIndices: OK
  10889. 1286.39 s [vector] +++ OK, passed 100 tests.
  10890. 1286.39 s [vector] foldl: OK (0.01s)
  10891. 1286.39 s [vector] +++ OK, passed 100 tests.
  10892. 1286.39 s [vector] foldl1: OK (0.02s)
  10893. 1286.39 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10894. 1286.39 s [vector] foldl': OK
  10895. 1286.39 s [vector] +++ OK, passed 100 tests.
  10896. 1286.39 s [vector] foldl1': OK
  10897. 1286.39 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10898. 1286.39 s [vector] foldr: OK
  10899. 1286.39 s [vector] +++ OK, passed 100 tests.
  10900. 1286.39 s [vector] foldr1: OK
  10901. 1286.39 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10902. 1286.40 s [vector] foldr': OK
  10903. 1286.40 s [vector] +++ OK, passed 100 tests.
  10904. 1286.41 s [vector] foldr1': OK
  10905. 1286.41 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10906. 1286.42 s [vector] ifoldl: OK
  10907. 1286.43 s [vector] +++ OK, passed 100 tests.
  10908. 1286.43 s [vector] ifoldl': OK
  10909. 1286.43 s [vector] +++ OK, passed 100 tests.
  10910. 1286.43 s [vector] ifoldr: OK
  10911. 1286.43 s [vector] +++ OK, passed 100 tests.
  10912. 1286.44 s [vector] ifoldr': OK
  10913. 1286.44 s [vector] +++ OK, passed 100 tests.
  10914. 1286.45 s [vector] ifoldM: OK (0.01s)
  10915. 1286.46 s [vector] +++ OK, passed 100 tests.
  10916. 1286.46 s [vector] ifoldM': OK (0.01s)
  10917. 1286.46 s [vector] +++ OK, passed 100 tests.
  10918. 1286.51 s [vector] ifoldM_: OK (0.04s)
  10919. 1286.51 s [vector] +++ OK, passed 100 tests.
  10920. 1286.57 s [vector] ifoldM'_: OK (0.06s)
  10921. 1286.57 s [vector] +++ OK, passed 100 tests.
  10922. 1286.57 s [vector] all: OK
  10923. 1286.57 s [vector] +++ OK, passed 100 tests.
  10924. 1286.57 s [vector] any: OK
  10925. 1286.57 s [vector] +++ OK, passed 100 tests.
  10926. 1286.58 s [vector] prescanl: OK
  10927. 1286.59 s [vector] +++ OK, passed 100 tests.
  10928. 1286.60 s [vector] prescanl': OK
  10929. 1286.60 s [vector] +++ OK, passed 100 tests.
  10930. 1286.60 s [vector] postscanl: OK
  10931. 1286.60 s [vector] +++ OK, passed 100 tests.
  10932. 1286.61 s [vector] postscanl': OK
  10933. 1286.61 s [vector] +++ OK, passed 100 tests.
  10934. 1286.63 s [vector] scanl: OK
  10935. 1286.63 s [vector] +++ OK, passed 100 tests.
  10936. 1286.63 s [vector] scanl': OK
  10937. 1286.63 s [vector] +++ OK, passed 100 tests.
  10938. 1286.64 s [vector] scanl1: OK
  10939. 1286.64 s [vector] +++ OK, passed 100 tests.
  10940. 1286.64 s [vector] scanl1': OK
  10941. 1286.64 s [vector] +++ OK, passed 100 tests.
  10942. 1286.65 s [vector] iscanl: OK
  10943. 1286.65 s [vector] +++ OK, passed 100 tests.
  10944. 1286.67 s [vector] iscanl': OK
  10945. 1286.67 s [vector] +++ OK, passed 100 tests.
  10946. 1286.68 s [vector] prescanr: OK
  10947. 1286.68 s [vector] +++ OK, passed 100 tests.
  10948. 1286.69 s [vector] prescanr': OK (0.01s)
  10949. 1286.69 s [vector] +++ OK, passed 100 tests.
  10950. 1286.70 s [vector] postscanr: OK
  10951. 1286.70 s [vector] +++ OK, passed 100 tests.
  10952. 1286.70 s [vector] postscanr': OK
  10953. 1286.70 s [vector] +++ OK, passed 100 tests.
  10954. 1286.71 s [vector] scanr: OK
  10955. 1286.71 s [vector] +++ OK, passed 100 tests.
  10956. 1286.72 s [vector] scanr': OK
  10957. 1286.72 s [vector] +++ OK, passed 100 tests.
  10958. 1286.73 s [vector] scanr1: OK
  10959. 1286.73 s [vector] +++ OK, passed 100 tests.
  10960. 1286.74 s [vector] scanr1': OK
  10961. 1286.75 s [vector] +++ OK, passed 100 tests.
  10962. 1286.75 s [vector] iscanr: OK
  10963. 1286.75 s [vector] +++ OK, passed 100 tests.
  10964. 1286.76 s [vector] iscanr': OK
  10965. 1286.76 s [vector] +++ OK, passed 100 tests.
  10966. 1286.76 s [vector] mut_read: OK
  10967. 1286.76 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10968. 1286.76 s [vector] mut_write: OK
  10969. 1286.76 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10970. 1286.76 s [vector] mut_modify: OK
  10971. 1286.76 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10972. 1286.77 s [vector] mut_generate: OK
  10973. 1286.77 s [vector] +++ OK, passed 100 tests.
  10974. 1286.80 s [vector] mut_generateM: OK (0.03s)
  10975. 1286.80 s [vector] +++ OK, passed 100 tests.
  10976. 1286.87 s [vector] mut_mapM_: OK (0.07s)
  10977. 1286.87 s [vector] +++ OK, passed 100 tests.
  10978. 1286.91 s [vector] mut_imapM_: OK (0.05s)
  10979. 1286.91 s [vector] +++ OK, passed 100 tests.
  10980. 1286.98 s [vector] mut_forM_: OK (0.04s)
  10981. 1286.98 s [vector] +++ OK, passed 100 tests.
  10982. 1287.01 s [vector] mut_iforM_: OK (0.05s)
  10983. 1287.01 s [vector] +++ OK, passed 100 tests.
  10984. 1287.03 s [vector] mut_foldr: OK
  10985. 1287.03 s [vector] +++ OK, passed 100 tests.
  10986. 1287.04 s [vector] mut_foldr': OK
  10987. 1287.04 s [vector] +++ OK, passed 100 tests.
  10988. 1287.04 s [vector] mut_foldl: OK
  10989. 1287.04 s [vector] +++ OK, passed 100 tests.
  10990. 1287.04 s [vector] mut_foldl': OK
  10991. 1287.04 s [vector] +++ OK, passed 100 tests.
  10992. 1287.05 s [vector] mut_ifoldr: OK
  10993. 1287.05 s [vector] +++ OK, passed 100 tests.
  10994. 1287.07 s [vector] mut_ifoldr': OK
  10995. 1287.07 s [vector] +++ OK, passed 100 tests.
  10996. 1287.07 s [vector] mut_ifoldl: OK
  10997. 1287.07 s [vector] +++ OK, passed 100 tests.
  10998. 1287.08 s [vector] mut_ifoldl': OK
  10999. 1287.08 s [vector] +++ OK, passed 100 tests.
  11000. 1287.08 s [vector] mut_foldM: OK
  11001. 1287.08 s [vector] +++ OK, passed 100 tests.
  11002. 1287.09 s [vector] mut_foldM': OK
  11003. 1287.09 s [vector] +++ OK, passed 100 tests.
  11004. 1287.11 s [vector] mut_foldrM: OK
  11005. 1287.11 s [vector] +++ OK, passed 100 tests.
  11006. 1287.12 s [vector] mut_foldrM': OK
  11007. 1287.12 s [vector] +++ OK, passed 100 tests.
  11008. 1287.13 s [vector] mut_ifoldM: OK
  11009. 1287.13 s [vector] +++ OK, passed 100 tests.
  11010. 1287.14 s [vector] mut_ifoldM': OK
  11011. 1287.14 s [vector] +++ OK, passed 100 tests.
  11012. 1287.15 s [vector] mut_ifoldrM: OK (0.01s)
  11013. 1287.15 s [vector] +++ OK, passed 100 tests.
  11014. 1287.15 s [vector] mut_ifoldrM': OK
  11015. 1287.15 s [vector] +++ OK, passed 100 tests.
  11016. 1287.16 s [vector] compare: OK
  11017. 1287.16 s [vector] +++ OK, passed 100 tests.
  11018. 1287.16 s [vector] maximum: OK
  11019. 1287.16 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11020. 1287.16 s [vector] minimum: OK
  11021. 1287.16 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11022. 1287.16 s [vector] minIndex: OK
  11023. 1287.16 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11024. 1287.16 s [vector] maxIndex: OK
  11025. 1287.16 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11026. 1287.16 s [vector] maximumBy: OK
  11027. 1287.16 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11028. 1287.16 s [vector] minimumBy: OK
  11029. 1287.16 s [vector] +++ OK, passed 100 tests; 20 discarded.
  11030. 1287.16 s [vector] maximumOn: OK
  11031. 1287.16 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11032. 1287.17 s [vector] minimumOn: OK
  11033. 1287.17 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11034. 1287.17 s [vector] maxIndexBy: OK
  11035. 1287.17 s [vector] +++ OK, passed 100 tests; 27 discarded.
  11036. 1287.17 s [vector] minIndexBy: OK
  11037. 1287.17 s [vector] +++ OK, passed 100 tests; 21 discarded.
  11038. 1287.17 s [vector] ListFirstMaxIndexWins: OK
  11039. 1287.17 s [vector] +++ OK, passed 100 tests; 21 discarded.
  11040. 1287.17 s [vector] FalseListFirstMaxIndexWins: OK
  11041. 1287.17 s [vector] +++ OK, failed as expected. (after 1 test):
  11042. 1287.17 s [vector] Exception:
  11043. 1287.17 s [vector] Prelude.foldr1: empty list
  11044. 1287.17 s [vector] CallStack (from HasCallStack):
  11045. 1287.17 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  11046. 1287.17 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  11047. 1287.17 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  11048. 1287.17 s [vector] []
  11049. 1287.17 s [vector] zip: OK
  11050. 1287.17 s [vector] +++ OK, passed 100 tests.
  11051. 1287.18 s [vector] zip3: OK
  11052. 1287.18 s [vector] +++ OK, passed 100 tests.
  11053. 1287.19 s [vector] unzip: OK
  11054. 1287.19 s [vector] +++ OK, passed 100 tests.
  11055. 1287.20 s [vector] unzip3: OK (0.01s)
  11056. 1287.21 s [vector] +++ OK, passed 100 tests.
  11057. 1287.21 s [vector] indexed: OK
  11058. 1287.21 s [vector] +++ OK, passed 100 tests.
  11059. 1287.21 s [vector] update: OK
  11060. 1287.21 s [vector] +++ OK, passed 100 tests.
  11061. 1287.21 s [vector] mempty: OK
  11062. 1287.21 s [vector] +++ OK, passed 100 tests.
  11063. 1287.21 s [vector] mappend: OK
  11064. 1287.21 s [vector] +++ OK, passed 100 tests.
  11065. 1287.29 s [vector] mconcat: OK (0.08s)
  11066. 1287.29 s [vector] +++ OK, passed 100 tests.
  11067. 1287.30 s [vector] glength: OK
  11068. 1287.30 s [vector] +++ OK, passed 100 tests.
  11069. 1287.30 s [vector] unstream
  11070. 1287.30 s [vector] unstream == vunstream (exact): OK
  11071. 1287.30 s [vector] +++ OK, passed 100 tests.
  11072. 1287.30 s [vector] unstream == vunstream (unknown): OK
  11073. 1287.30 s [vector] +++ OK, passed 100 tests.
  11074. 1287.30 s [vector] unstreamR ~= vunstream (exact): OK
  11075. 1287.30 s [vector] +++ OK, passed 100 tests.
  11076. 1287.30 s [vector] unstreamR ~= vunstream (unknown): OK
  11077. 1287.30 s [vector] +++ OK, passed 100 tests.
  11078. 1287.30 s [vector] Data.Vector.Storable.Vector Alignment
  11079. 1287.30 s [vector] Aligned Double: OK
  11080. 1287.30 s [vector] Aligned Int: OK
  11081. 1287.30 s [vector] Regression tests
  11082. 1287.30 s [vector] enumFromTo crash #188
  11083. 1287.30 s [vector] Word8: OK
  11084. 1287.30 s [vector] Word16: OK
  11085. 1287.30 s [vector] Word32: OK
  11086. 1287.30 s [vector] Word64: OK
  11087. 1287.30 s [vector] Word: OK
  11088. 1287.30 s [vector] Int8: OK
  11089. 1287.30 s [vector] Int16: OK
  11090. 1287.30 s [vector] Int32: OK
  11091. 1287.30 s [vector] Int64: OK
  11092. 1287.30 s [vector] Int: OK
  11093. 1287.30 s [vector] Char: OK
  11094. 1287.30 s [vector] Negative tests
  11095. 1287.30 s [vector] slice out of bounds #257
  11096. 1287.30 s [vector] Boxed
  11097. 1287.30 s [vector] Negative ix: OK
  11098. 1287.30 s [vector] Negative size: OK
  11099. 1287.30 s [vector] Negative ix and size: OK
  11100. 1287.30 s [vector] Too large ix: OK
  11101. 1287.30 s [vector] Too large size: OK
  11102. 1287.30 s [vector] Too large ix and size: OK
  11103. 1287.30 s [vector] Overflow: OK
  11104. 1287.30 s [vector] OutOfMemory: OK
  11105. 1287.30 s [vector] Primitive
  11106. 1287.30 s [vector] Negative ix: OK
  11107. 1287.30 s [vector] Negative size: OK
  11108. 1287.30 s [vector] Negative ix and size: OK
  11109. 1287.30 s [vector] Too large ix: OK
  11110. 1287.30 s [vector] Too large size: OK
  11111. 1287.30 s [vector] Too large ix and size: OK
  11112. 1287.30 s [vector] Overflow: OK
  11113. 1287.30 s [vector] OutOfMemory: OK
  11114. 1287.30 s [vector] Storable
  11115. 1287.30 s [vector] Negative ix: OK
  11116. 1287.30 s [vector] Negative size: OK
  11117. 1287.30 s [vector] Negative ix and size: OK
  11118. 1287.30 s [vector] Too large ix: OK
  11119. 1287.30 s [vector] Too large size: OK
  11120. 1287.30 s [vector] Too large ix and size: OK
  11121. 1287.30 s [vector] Overflow: OK
  11122. 1287.30 s [vector] OutOfMemory: OK
  11123. 1287.30 s [vector] Unboxed
  11124. 1287.30 s [vector] Negative ix: OK
  11125. 1287.30 s [vector] Negative size: OK
  11126. 1287.30 s [vector] Negative ix and size: OK
  11127. 1287.30 s [vector] Too large ix: OK
  11128. 1287.30 s [vector] Too large size: OK
  11129. 1287.30 s [vector] Too large ix and size: OK
  11130. 1287.30 s [vector] Overflow: OK
  11131. 1287.30 s [vector] OutOfMemory: OK
  11132. 1287.30 s [vector] take #282
  11133. 1287.30 s [vector] Boxed: OK
  11134. 1287.30 s [vector] Primitive: OK
  11135. 1287.30 s [vector] Storable: OK
  11136. 1287.30 s [vector] Unboxed: OK
  11137. 1287.30 s [vector] Data.Vector
  11138. 1287.30 s [vector] MonadFix: OK
  11139. 1287.30 s [vector] toFromArray: OK
  11140. 1287.30 s [vector] toFromArraySlice: OK
  11141. 1287.30 s [vector] toFromArraySliceUnsafe: OK
  11142. 1287.30 s [vector] toFromMutableArray: OK
  11143. 1287.31 s [vector] Data.Vector.Mutable (Move): OK
  11144. 1287.31 s [vector] +++ OK, passed 100 tests; 21 discarded.
  11145. 1287.31 s [vector] Data.Vector.Primitive.Mutable (Move): OK
  11146. 1287.31 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11147. 1287.31 s [vector] Data.Vector.Unboxed.Mutable (Move): OK
  11148. 1287.31 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11149. 1287.31 s [vector] Data.Vector.Storable.Mutable (Move): OK
  11150. 1287.31 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11151. 1287.36 s [vector] Data.Vector.Generic.Mutable (nextPermutation): OK (0.03s)
  11152. 1287.36 s [vector] +++ OK, passed 100 tests.
  11153. 1287.36 s [vector] Data.Vector.Generic.Mutable (prevPermutation): OK (0.02s)
  11154. 1287.36 s [vector] +++ OK, passed 100 tests.
  11155. 1287.36 s [vector] Data.Vector.Generic.Mutable (nextPermutation then prevPermutation = id): OK
  11156. 1287.36 s [vector] +++ OK, passed 100 tests.
  11157. 1287.37 s [vector] Data.Vector.Generic.Mutable (prevPermutation then nextPermutation = id): OK
  11158. 1287.37 s [vector] +++ OK, passed 100 tests.
  11159. 1287.37 s [vector]
  11160. 1287.37 s [vector] All 2808 tests passed (19.11s)
  11161. 1287.38 s [vector] Test suite vector-tests-O0: PASS
  11162. 1287.38 s [vector] Test suite logged to: dist/test/vector-0.13.2.0-vector-tests-O0.log
  11163. 1287.38 s [vector] Test suite vector-tests-O2: RUNNING...
  11164. 1287.49 s [vector] toplevel
  11165. 1287.49 s [vector] Data.Vector.Fusion.Bundle
  11166. 1287.49 s [vector] fromList.toList == id: OK
  11167. 1287.49 s [vector] +++ OK, passed 100 tests.
  11168. 1287.49 s [vector] toList.fromList == id: OK
  11169. 1287.49 s [vector] +++ OK, passed 100 tests.
  11170. 1287.49 s [vector] eq: OK
  11171. 1287.49 s [vector] +++ OK, passed 100 tests.
  11172. 1287.49 s [vector] length: OK
  11173. 1287.49 s [vector] +++ OK, passed 100 tests.
  11174. 1287.49 s [vector] null: OK
  11175. 1287.49 s [vector] +++ OK, passed 100 tests.
  11176. 1287.50 s [vector] empty: OK
  11177. 1287.52 s [vector] +++ OK, passed 100 tests.
  11178. 1287.52 s [vector] singleton: OK
  11179. 1287.52 s [vector] +++ OK, passed 100 tests.
  11180. 1287.52 s [vector] replicate: OK
  11181. 1287.52 s [vector] +++ OK, passed 100 tests.
  11182. 1287.52 s [vector] cons: OK
  11183. 1287.52 s [vector] +++ OK, passed 100 tests.
  11184. 1287.52 s [vector] snoc: OK
  11185. 1287.52 s [vector] +++ OK, passed 100 tests.
  11186. 1287.53 s [vector] append: OK
  11187. 1287.53 s [vector] +++ OK, passed 100 tests.
  11188. 1287.53 s [vector] head: OK
  11189. 1287.53 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11190. 1287.53 s [vector] last: OK
  11191. 1287.53 s [vector] +++ OK, passed 100 tests; 12 discarded.
  11192. 1287.53 s [vector] index: OK
  11193. 1287.53 s [vector] +++ OK, passed 100 tests; 11 discarded.
  11194. 1287.53 s [vector] extract: OK
  11195. 1287.53 s [vector] +++ OK, passed 100 tests.
  11196. 1287.53 s [vector] init: OK
  11197. 1287.53 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11198. 1287.53 s [vector] tail: OK
  11199. 1287.53 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11200. 1287.53 s [vector] take: OK
  11201. 1287.53 s [vector] +++ OK, passed 100 tests.
  11202. 1287.53 s [vector] drop: OK
  11203. 1287.53 s [vector] +++ OK, passed 100 tests.
  11204. 1287.53 s [vector] map: OK
  11205. 1287.53 s [vector] +++ OK, passed 100 tests.
  11206. 1287.53 s [vector] zipWith: OK
  11207. 1287.53 s [vector] +++ OK, passed 100 tests.
  11208. 1287.53 s [vector] zipWith3: OK
  11209. 1287.53 s [vector] +++ OK, passed 100 tests.
  11210. 1287.53 s [vector] filter: OK
  11211. 1287.53 s [vector] +++ OK, passed 100 tests.
  11212. 1287.53 s [vector] takeWhile: OK
  11213. 1287.53 s [vector] +++ OK, passed 100 tests.
  11214. 1287.53 s [vector] dropWhile: OK
  11215. 1287.53 s [vector] +++ OK, passed 100 tests.
  11216. 1287.53 s [vector] elem: OK
  11217. 1287.53 s [vector] +++ OK, passed 100 tests.
  11218. 1287.53 s [vector] notElem: OK
  11219. 1287.53 s [vector] +++ OK, passed 100 tests.
  11220. 1287.53 s [vector] find: OK
  11221. 1287.53 s [vector] +++ OK, passed 100 tests.
  11222. 1287.53 s [vector] findIndex: OK
  11223. 1287.53 s [vector] +++ OK, passed 100 tests.
  11224. 1287.53 s [vector] foldl: OK
  11225. 1287.53 s [vector] +++ OK, passed 100 tests.
  11226. 1287.53 s [vector] foldl1: OK
  11227. 1287.54 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11228. 1287.54 s [vector] foldl': OK
  11229. 1287.54 s [vector] +++ OK, passed 100 tests.
  11230. 1287.54 s [vector] foldl1': OK
  11231. 1287.54 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11232. 1287.54 s [vector] foldr: OK
  11233. 1287.54 s [vector] +++ OK, passed 100 tests.
  11234. 1287.54 s [vector] foldr1: OK
  11235. 1287.54 s [vector] +++ OK, passed 100 tests; 20 discarded.
  11236. 1287.54 s [vector] prescanl: OK
  11237. 1287.54 s [vector] +++ OK, passed 100 tests.
  11238. 1287.54 s [vector] prescanl': OK
  11239. 1287.54 s [vector] +++ OK, passed 100 tests.
  11240. 1287.54 s [vector] postscanl: OK
  11241. 1287.54 s [vector] +++ OK, passed 100 tests.
  11242. 1287.54 s [vector] postscanl': OK
  11243. 1287.54 s [vector] +++ OK, passed 100 tests.
  11244. 1287.54 s [vector] scanl: OK
  11245. 1287.54 s [vector] +++ OK, passed 100 tests.
  11246. 1287.54 s [vector] scanl': OK
  11247. 1287.54 s [vector] +++ OK, passed 100 tests.
  11248. 1287.54 s [vector] scanl1: OK
  11249. 1287.54 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11250. 1287.54 s [vector] scanl1': OK
  11251. 1287.54 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11252. 1287.54 s [vector] concatMap: OK
  11253. 1287.54 s [vector] +++ OK, passed 100 tests.
  11254. 1287.54 s [vector] unfoldr: OK
  11255. 1287.54 s [vector] +++ OK, passed 100 tests.
  11256. 1287.54 s [vector] and: OK
  11257. 1287.54 s [vector] +++ OK, passed 100 tests.
  11258. 1287.54 s [vector] or: OK
  11259. 1287.54 s [vector] +++ OK, passed 100 tests.
  11260. 1287.54 s [vector] Tests.Vector.Boxed
  11261. 1287.54 s [vector] Bool
  11262. 1287.54 s [vector] fromList.toList == id: OK
  11263. 1287.54 s [vector] +++ OK, passed 100 tests.
  11264. 1287.54 s [vector] toList.fromList == id: OK
  11265. 1287.54 s [vector] +++ OK, passed 100 tests.
  11266. 1287.54 s [vector] unstream.stream == id: OK
  11267. 1287.54 s [vector] +++ OK, passed 100 tests.
  11268. 1287.54 s [vector] stream.unstream == id: OK
  11269. 1287.54 s [vector] +++ OK, passed 100 tests.
  11270. 1287.54 s [vector] eq: OK
  11271. 1287.54 s [vector] +++ OK, passed 100 tests.
  11272. 1287.54 s [vector] length: OK
  11273. 1287.54 s [vector] +++ OK, passed 100 tests.
  11274. 1287.54 s [vector] null: OK
  11275. 1287.54 s [vector] +++ OK, passed 100 tests.
  11276. 1287.54 s [vector] index: OK
  11277. 1287.54 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11278. 1287.54 s [vector] safeIndex: OK
  11279. 1287.54 s [vector] +++ OK, passed 100 tests.
  11280. 1287.54 s [vector] head: OK
  11281. 1287.54 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11282. 1287.54 s [vector] last: OK
  11283. 1287.54 s [vector] +++ OK, passed 100 tests; 11 discarded.
  11284. 1287.54 s [vector] unsafeIndex: OK
  11285. 1287.54 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11286. 1287.54 s [vector] unsafeHead: OK
  11287. 1287.54 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11288. 1287.54 s [vector] unsafeLast: OK
  11289. 1287.54 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11290. 1287.54 s [vector] slice: OK
  11291. 1287.54 s [vector] +++ OK, passed 100 tests.
  11292. 1287.54 s [vector] init: OK
  11293. 1287.54 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11294. 1287.54 s [vector] tail: OK
  11295. 1287.54 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11296. 1287.54 s [vector] take: OK
  11297. 1287.54 s [vector] +++ OK, passed 100 tests.
  11298. 1287.54 s [vector] drop: OK
  11299. 1287.54 s [vector] +++ OK, passed 100 tests.
  11300. 1287.54 s [vector] splitAt: OK
  11301. 1287.55 s [vector] +++ OK, passed 100 tests.
  11302. 1287.55 s [vector] empty: OK
  11303. 1287.55 s [vector] +++ OK, passed 100 tests.
  11304. 1287.55 s [vector] singleton: OK
  11305. 1287.55 s [vector] +++ OK, passed 100 tests.
  11306. 1287.55 s [vector] replicate: OK
  11307. 1287.55 s [vector] +++ OK, passed 100 tests.
  11308. 1287.55 s [vector] generate: OK
  11309. 1287.55 s [vector] +++ OK, passed 100 tests.
  11310. 1287.55 s [vector] iterateN: OK
  11311. 1287.55 s [vector] +++ OK, passed 100 tests.
  11312. 1287.56 s [vector] iterateNM: OK (0.02s)
  11313. 1287.56 s [vector] +++ OK, passed 100 tests.
  11314. 1287.58 s [vector] generateM: OK (0.02s)
  11315. 1287.58 s [vector] +++ OK, passed 100 tests.
  11316. 1287.58 s [vector] replicateM: OK (0.02s)
  11317. 1287.58 s [vector] +++ OK, passed 100 tests.
  11318. 1287.58 s [vector] create: OK
  11319. 1287.58 s [vector] +++ OK, passed 100 tests.
  11320. 1287.58 s [vector] createT: OK
  11321. 1287.58 s [vector] +++ OK, passed 100 tests.
  11322. 1287.58 s [vector] unfoldr: OK
  11323. 1287.58 s [vector] +++ OK, passed 100 tests.
  11324. 1287.58 s [vector] unfoldrN: OK
  11325. 1287.58 s [vector] +++ OK, passed 100 tests.
  11326. 1287.58 s [vector] unfoldrExactN: OK
  11327. 1287.58 s [vector] +++ OK, passed 100 tests.
  11328. 1287.58 s [vector] unfoldrM: OK
  11329. 1287.60 s [vector] +++ OK, passed 100 tests.
  11330. 1287.60 s [vector] unfoldrNM: OK
  11331. 1287.60 s [vector] +++ OK, passed 100 tests.
  11332. 1287.63 s [vector] unfoldrExactNM: OK (0.04s)
  11333. 1287.63 s [vector] +++ OK, passed 100 tests.
  11334. 1287.63 s [vector] constructN: OK
  11335. 1287.63 s [vector] +++ OK, passed 100 tests.
  11336. 1287.63 s [vector] constructrN: OK
  11337. 1287.63 s [vector] +++ OK, passed 100 tests.
  11338. 1287.63 s [vector] cons: OK
  11339. 1287.63 s [vector] +++ OK, passed 100 tests.
  11340. 1287.63 s [vector] snoc: OK
  11341. 1287.63 s [vector] +++ OK, passed 100 tests.
  11342. 1287.63 s [vector] append: OK
  11343. 1287.63 s [vector] +++ OK, passed 100 tests.
  11344. 1287.64 s [vector] concat: OK
  11345. 1287.64 s [vector] +++ OK, passed 100 tests.
  11346. 1287.64 s [vector] force: OK
  11347. 1287.64 s [vector] +++ OK, passed 100 tests.
  11348. 1287.64 s [vector] upd: OK
  11349. 1287.64 s [vector] +++ OK, passed 100 tests.
  11350. 1287.65 s [vector] accum: OK
  11351. 1287.65 s [vector] +++ OK, passed 100 tests.
  11352. 1287.65 s [vector] reverse: OK
  11353. 1287.65 s [vector] +++ OK, passed 100 tests.
  11354. 1287.65 s [vector] backpermute: OK
  11355. 1287.65 s [vector] +++ OK, passed 100 tests.
  11356. 1287.65 s [vector] map: OK
  11357. 1287.65 s [vector] +++ OK, passed 100 tests.
  11358. 1287.65 s [vector] imap: OK
  11359. 1287.65 s [vector] +++ OK, passed 100 tests.
  11360. 1287.65 s [vector] concatMap: OK
  11361. 1287.65 s [vector] +++ OK, passed 100 tests.
  11362. 1287.66 s [vector] mapM: OK
  11363. 1287.66 s [vector] +++ OK, passed 100 tests.
  11364. 1287.66 s [vector] mapM_: OK (0.01s)
  11365. 1287.66 s [vector] +++ OK, passed 100 tests.
  11366. 1287.68 s [vector] forM: OK
  11367. 1287.68 s [vector] +++ OK, passed 100 tests.
  11368. 1287.68 s [vector] forM_: OK (0.01s)
  11369. 1287.68 s [vector] +++ OK, passed 100 tests.
  11370. 1287.68 s [vector] imapM: OK
  11371. 1287.69 s [vector] +++ OK, passed 100 tests.
  11372. 1287.69 s [vector] imapM_: OK (0.01s)
  11373. 1287.69 s [vector] +++ OK, passed 100 tests.
  11374. 1287.70 s [vector] zipWith: OK
  11375. 1287.70 s [vector] +++ OK, passed 100 tests.
  11376. 1287.70 s [vector] zipWith3: OK
  11377. 1287.70 s [vector] +++ OK, passed 100 tests.
  11378. 1287.70 s [vector] izipWith: OK
  11379. 1287.70 s [vector] +++ OK, passed 100 tests.
  11380. 1287.70 s [vector] izipWith3: OK
  11381. 1287.70 s [vector] +++ OK, passed 100 tests.
  11382. 1287.72 s [vector] izipWithM: OK
  11383. 1287.72 s [vector] +++ OK, passed 100 tests.
  11384. 1287.73 s [vector] izipWithM_: OK (0.02s)
  11385. 1287.73 s [vector] +++ OK, passed 100 tests.
  11386. 1287.73 s [vector] zipWithM: OK
  11387. 1287.73 s [vector] +++ OK, passed 100 tests.
  11388. 1287.73 s [vector] zipWithM_: OK
  11389. 1287.73 s [vector] +++ OK, passed 100 tests.
  11390. 1287.73 s [vector] filter: OK
  11391. 1287.73 s [vector] +++ OK, passed 100 tests.
  11392. 1287.73 s [vector] ifilter: OK
  11393. 1287.73 s [vector] +++ OK, passed 100 tests.
  11394. 1287.75 s [vector] filterM: OK (0.01s)
  11395. 1287.75 s [vector] +++ OK, passed 100 tests.
  11396. 1287.75 s [vector] uniq: OK
  11397. 1287.75 s [vector] +++ OK, passed 100 tests.
  11398. 1287.75 s [vector] mapMaybe: OK
  11399. 1287.76 s [vector] +++ OK, passed 100 tests.
  11400. 1287.76 s [vector] imapMaybe: OK
  11401. 1287.76 s [vector] +++ OK, passed 100 tests.
  11402. 1287.76 s [vector] takeWhile: OK
  11403. 1287.76 s [vector] +++ OK, passed 100 tests.
  11404. 1287.76 s [vector] dropWhile: OK
  11405. 1287.76 s [vector] +++ OK, passed 100 tests.
  11406. 1287.76 s [vector] partition: OK
  11407. 1287.76 s [vector] +++ OK, passed 100 tests.
  11408. 1287.76 s [vector] partitionWith: OK
  11409. 1287.76 s [vector] +++ OK, passed 100 tests.
  11410. 1287.76 s [vector] span: OK
  11411. 1287.76 s [vector] +++ OK, passed 100 tests.
  11412. 1287.76 s [vector] break: OK
  11413. 1287.76 s [vector] +++ OK, passed 100 tests.
  11414. 1287.76 s [vector] spanR: OK
  11415. 1287.76 s [vector] +++ OK, passed 100 tests.
  11416. 1287.76 s [vector] breakR: OK
  11417. 1287.76 s [vector] +++ OK, passed 100 tests.
  11418. 1287.76 s [vector] groupBy: OK
  11419. 1287.76 s [vector] +++ OK, passed 100 tests.
  11420. 1287.76 s [vector] elem: OK
  11421. 1287.76 s [vector] +++ OK, passed 100 tests.
  11422. 1287.76 s [vector] notElem: OK
  11423. 1287.76 s [vector] +++ OK, passed 100 tests.
  11424. 1287.76 s [vector] find: OK
  11425. 1287.76 s [vector] +++ OK, passed 100 tests.
  11426. 1287.76 s [vector] findIndex: OK
  11427. 1287.77 s [vector] +++ OK, passed 100 tests.
  11428. 1287.77 s [vector] findIndexR: OK
  11429. 1287.77 s [vector] +++ OK, passed 100 tests.
  11430. 1287.77 s [vector] findIndices: OK
  11431. 1287.77 s [vector] +++ OK, passed 100 tests.
  11432. 1287.77 s [vector] elemIndex: OK
  11433. 1287.77 s [vector] +++ OK, passed 100 tests.
  11434. 1287.77 s [vector] elemIndices: OK
  11435. 1287.77 s [vector] +++ OK, passed 100 tests.
  11436. 1287.77 s [vector] foldl: OK
  11437. 1287.77 s [vector] +++ OK, passed 100 tests.
  11438. 1287.77 s [vector] foldl1: OK
  11439. 1287.77 s [vector] +++ OK, passed 100 tests; 21 discarded.
  11440. 1287.77 s [vector] foldl': OK
  11441. 1287.77 s [vector] +++ OK, passed 100 tests.
  11442. 1287.77 s [vector] foldl1': OK
  11443. 1287.77 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11444. 1287.77 s [vector] foldr: OK
  11445. 1287.77 s [vector] +++ OK, passed 100 tests.
  11446. 1287.77 s [vector] foldr1: OK
  11447. 1287.77 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11448. 1287.77 s [vector] foldr': OK
  11449. 1287.77 s [vector] +++ OK, passed 100 tests.
  11450. 1287.78 s [vector] foldr1': OK
  11451. 1287.78 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11452. 1287.78 s [vector] ifoldl: OK
  11453. 1287.78 s [vector] +++ OK, passed 100 tests.
  11454. 1287.78 s [vector] ifoldl': OK
  11455. 1287.78 s [vector] +++ OK, passed 100 tests.
  11456. 1287.78 s [vector] ifoldr: OK
  11457. 1287.78 s [vector] +++ OK, passed 100 tests.
  11458. 1287.78 s [vector] ifoldr': OK
  11459. 1287.79 s [vector] +++ OK, passed 100 tests.
  11460. 1287.80 s [vector] ifoldM: OK
  11461. 1287.80 s [vector] +++ OK, passed 100 tests.
  11462. 1287.80 s [vector] ifoldM': OK
  11463. 1287.80 s [vector] +++ OK, passed 100 tests.
  11464. 1287.80 s [vector] ifoldM_: OK (0.01s)
  11465. 1287.80 s [vector] +++ OK, passed 100 tests.
  11466. 1287.81 s [vector] ifoldM'_: OK (0.01s)
  11467. 1287.81 s [vector] +++ OK, passed 100 tests.
  11468. 1287.81 s [vector] all: OK
  11469. 1287.81 s [vector] +++ OK, passed 100 tests.
  11470. 1287.81 s [vector] any: OK
  11471. 1287.81 s [vector] +++ OK, passed 100 tests.
  11472. 1287.81 s [vector] prescanl: OK
  11473. 1287.81 s [vector] +++ OK, passed 100 tests.
  11474. 1287.82 s [vector] prescanl': OK
  11475. 1287.82 s [vector] +++ OK, passed 100 tests.
  11476. 1287.82 s [vector] postscanl: OK
  11477. 1287.82 s [vector] +++ OK, passed 100 tests.
  11478. 1287.82 s [vector] postscanl': OK
  11479. 1287.82 s [vector] +++ OK, passed 100 tests.
  11480. 1287.82 s [vector] scanl: OK
  11481. 1287.82 s [vector] +++ OK, passed 100 tests.
  11482. 1287.82 s [vector] scanl': OK
  11483. 1287.82 s [vector] +++ OK, passed 100 tests.
  11484. 1287.83 s [vector] scanl1: OK
  11485. 1287.83 s [vector] +++ OK, passed 100 tests.
  11486. 1287.83 s [vector] scanl1': OK
  11487. 1287.83 s [vector] +++ OK, passed 100 tests.
  11488. 1287.83 s [vector] iscanl: OK
  11489. 1287.83 s [vector] +++ OK, passed 100 tests.
  11490. 1287.83 s [vector] iscanl': OK
  11491. 1287.83 s [vector] +++ OK, passed 100 tests.
  11492. 1287.83 s [vector] prescanr: OK
  11493. 1287.83 s [vector] +++ OK, passed 100 tests.
  11494. 1287.83 s [vector] prescanr': OK
  11495. 1287.83 s [vector] +++ OK, passed 100 tests.
  11496. 1287.83 s [vector] postscanr: OK
  11497. 1287.83 s [vector] +++ OK, passed 100 tests.
  11498. 1287.83 s [vector] postscanr': OK
  11499. 1287.83 s [vector] +++ OK, passed 100 tests.
  11500. 1287.83 s [vector] scanr: OK
  11501. 1287.83 s [vector] +++ OK, passed 100 tests.
  11502. 1287.84 s [vector] scanr': OK
  11503. 1287.84 s [vector] +++ OK, passed 100 tests.
  11504. 1287.84 s [vector] scanr1: OK
  11505. 1287.84 s [vector] +++ OK, passed 100 tests.
  11506. 1287.84 s [vector] scanr1': OK
  11507. 1287.84 s [vector] +++ OK, passed 100 tests.
  11508. 1287.84 s [vector] iscanr: OK
  11509. 1287.84 s [vector] +++ OK, passed 100 tests.
  11510. 1287.84 s [vector] iscanr': OK
  11511. 1287.84 s [vector] +++ OK, passed 100 tests.
  11512. 1287.84 s [vector] mut_read: OK
  11513. 1287.84 s [vector] +++ OK, passed 100 tests; 12 discarded.
  11514. 1287.85 s [vector] mut_write: OK
  11515. 1287.85 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11516. 1287.85 s [vector] mut_modify: OK
  11517. 1287.85 s [vector] +++ OK, passed 100 tests; 21 discarded.
  11518. 1287.86 s [vector] mut_generate: OK
  11519. 1287.86 s [vector] +++ OK, passed 100 tests.
  11520. 1287.86 s [vector] mut_generateM: OK
  11521. 1287.86 s [vector] +++ OK, passed 100 tests.
  11522. 1287.87 s [vector] mut_mapM_: OK
  11523. 1287.88 s [vector] +++ OK, passed 100 tests.
  11524. 1287.88 s [vector] mut_imapM_: OK
  11525. 1287.88 s [vector] +++ OK, passed 100 tests.
  11526. 1287.88 s [vector] mut_forM_: OK
  11527. 1287.88 s [vector] +++ OK, passed 100 tests.
  11528. 1287.90 s [vector] mut_iforM_: OK (0.01s)
  11529. 1287.90 s [vector] +++ OK, passed 100 tests.
  11530. 1287.90 s [vector] mut_foldr: OK
  11531. 1287.90 s [vector] +++ OK, passed 100 tests.
  11532. 1287.90 s [vector] mut_foldr': OK
  11533. 1287.90 s [vector] +++ OK, passed 100 tests.
  11534. 1287.90 s [vector] mut_foldl: OK
  11535. 1287.90 s [vector] +++ OK, passed 100 tests.
  11536. 1287.90 s [vector] mut_foldl': OK
  11537. 1287.90 s [vector] +++ OK, passed 100 tests.
  11538. 1287.90 s [vector] mut_ifoldr: OK
  11539. 1287.90 s [vector] +++ OK, passed 100 tests.
  11540. 1287.91 s [vector] mut_ifoldr': OK
  11541. 1287.91 s [vector] +++ OK, passed 100 tests.
  11542. 1287.91 s [vector] mut_ifoldl: OK
  11543. 1287.91 s [vector] +++ OK, passed 100 tests.
  11544. 1287.91 s [vector] mut_ifoldl': OK
  11545. 1287.91 s [vector] +++ OK, passed 100 tests.
  11546. 1287.91 s [vector] mut_foldM: OK
  11547. 1287.91 s [vector] +++ OK, passed 100 tests.
  11548. 1287.91 s [vector] mut_foldM': OK
  11549. 1287.91 s [vector] +++ OK, passed 100 tests.
  11550. 1287.92 s [vector] mut_foldrM: OK
  11551. 1287.92 s [vector] +++ OK, passed 100 tests.
  11552. 1287.92 s [vector] mut_foldrM': OK
  11553. 1287.92 s [vector] +++ OK, passed 100 tests.
  11554. 1287.92 s [vector] mut_ifoldM: OK
  11555. 1287.92 s [vector] +++ OK, passed 100 tests.
  11556. 1287.92 s [vector] mut_ifoldM': OK
  11557. 1287.92 s [vector] +++ OK, passed 100 tests.
  11558. 1287.92 s [vector] mut_ifoldrM: OK
  11559. 1287.92 s [vector] +++ OK, passed 100 tests.
  11560. 1287.92 s [vector] mut_ifoldrM': OK
  11561. 1287.92 s [vector] +++ OK, passed 100 tests.
  11562. 1287.92 s [vector] compare: OK
  11563. 1287.92 s [vector] +++ OK, passed 100 tests.
  11564. 1287.92 s [vector] maximum: OK
  11565. 1287.92 s [vector] +++ OK, passed 100 tests; 23 discarded.
  11566. 1287.92 s [vector] minimum: OK
  11567. 1287.92 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11568. 1287.92 s [vector] minIndex: OK
  11569. 1287.92 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11570. 1287.92 s [vector] maxIndex: OK
  11571. 1287.92 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11572. 1287.92 s [vector] maximumBy: OK
  11573. 1287.92 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11574. 1287.92 s [vector] minimumBy: OK
  11575. 1287.92 s [vector] +++ OK, passed 100 tests; 12 discarded.
  11576. 1287.92 s [vector] maximumOn: OK
  11577. 1287.92 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11578. 1287.92 s [vector] minimumOn: OK
  11579. 1287.92 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11580. 1287.92 s [vector] maxIndexBy: OK
  11581. 1287.92 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11582. 1287.92 s [vector] minIndexBy: OK
  11583. 1287.92 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11584. 1287.92 s [vector] ListFirstMaxIndexWins: OK
  11585. 1287.92 s [vector] +++ OK, passed 100 tests; 11 discarded.
  11586. 1287.93 s [vector] FalseListFirstMaxIndexWins: OK
  11587. 1287.93 s [vector] +++ OK, failed as expected. (after 1 test):
  11588. 1287.93 s [vector] Exception:
  11589. 1287.93 s [vector] Prelude.foldr1: empty list
  11590. 1287.94 s [vector] CallStack (from HasCallStack):
  11591. 1287.94 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  11592. 1287.94 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  11593. 1287.94 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  11594. 1287.94 s [vector] []
  11595. 1287.94 s [vector] zip: OK
  11596. 1287.94 s [vector] +++ OK, passed 100 tests.
  11597. 1287.94 s [vector] zip3: OK
  11598. 1287.94 s [vector] +++ OK, passed 100 tests.
  11599. 1287.94 s [vector] unzip: OK
  11600. 1287.94 s [vector] +++ OK, passed 100 tests.
  11601. 1287.94 s [vector] unzip3: OK
  11602. 1287.94 s [vector] +++ OK, passed 100 tests.
  11603. 1287.94 s [vector] indexed: OK
  11604. 1287.94 s [vector] +++ OK, passed 100 tests.
  11605. 1287.94 s [vector] update: OK
  11606. 1287.94 s [vector] +++ OK, passed 100 tests.
  11607. 1287.94 s [vector] concat: OK
  11608. 1287.94 s [vector] +++ OK, passed 100 tests.
  11609. 1287.95 s [vector] mempty: OK
  11610. 1287.95 s [vector] +++ OK, passed 100 tests.
  11611. 1287.95 s [vector] mappend: OK
  11612. 1287.95 s [vector] +++ OK, passed 100 tests.
  11613. 1287.95 s [vector] mconcat: OK
  11614. 1287.95 s [vector] +++ OK, passed 100 tests.
  11615. 1287.95 s [vector] fmap: OK
  11616. 1287.95 s [vector] +++ OK, passed 100 tests.
  11617. 1287.96 s [vector] return: OK
  11618. 1287.96 s [vector] +++ OK, passed 100 tests.
  11619. 1287.96 s [vector] bind: OK (0.01s)
  11620. 1287.96 s [vector] +++ OK, passed 100 tests.
  11621. 1287.96 s [vector] mzip: OK
  11622. 1287.96 s [vector] +++ OK, passed 100 tests.
  11623. 1287.96 s [vector] munzip: OK
  11624. 1287.96 s [vector] +++ OK, passed 100 tests.
  11625. 1287.97 s [vector] applicative_pure: OK
  11626. 1287.97 s [vector] +++ OK, passed 100 tests.
  11627. 1287.97 s [vector] applicative_appl: OK (0.01s)
  11628. 1287.97 s [vector] +++ OK, passed 100 tests.
  11629. 1287.97 s [vector] alternative_empty: OK
  11630. 1287.98 s [vector] +++ OK, passed 100 tests.
  11631. 1287.98 s [vector] alternative_or: OK
  11632. 1287.98 s [vector] +++ OK, passed 100 tests.
  11633. 1288.02 s [vector] sequence: OK (0.04s)
  11634. 1288.02 s [vector] +++ OK, passed 100 tests.
  11635. 1288.02 s [vector] sequence_: OK
  11636. 1288.02 s [vector] +++ OK, passed 100 tests.
  11637. 1288.02 s [vector] glength: OK
  11638. 1288.02 s [vector] +++ OK, passed 100 tests.
  11639. 1288.02 s [vector] and: OK
  11640. 1288.02 s [vector] +++ OK, passed 100 tests.
  11641. 1288.02 s [vector] or: OK
  11642. 1288.02 s [vector] +++ OK, passed 100 tests.
  11643. 1288.02 s [vector] Int
  11644. 1288.02 s [vector] fromList.toList == id: OK
  11645. 1288.03 s [vector] +++ OK, passed 100 tests.
  11646. 1288.03 s [vector] toList.fromList == id: OK
  11647. 1288.03 s [vector] +++ OK, passed 100 tests.
  11648. 1288.03 s [vector] unstream.stream == id: OK
  11649. 1288.03 s [vector] +++ OK, passed 100 tests.
  11650. 1288.03 s [vector] stream.unstream == id: OK
  11651. 1288.03 s [vector] +++ OK, passed 100 tests.
  11652. 1288.03 s [vector] eq: OK
  11653. 1288.03 s [vector] +++ OK, passed 100 tests.
  11654. 1288.03 s [vector] length: OK
  11655. 1288.03 s [vector] +++ OK, passed 100 tests.
  11656. 1288.03 s [vector] null: OK
  11657. 1288.03 s [vector] +++ OK, passed 100 tests.
  11658. 1288.03 s [vector] index: OK
  11659. 1288.03 s [vector] +++ OK, passed 100 tests; 12 discarded.
  11660. 1288.03 s [vector] safeIndex: OK
  11661. 1288.03 s [vector] +++ OK, passed 100 tests.
  11662. 1288.03 s [vector] head: OK
  11663. 1288.03 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11664. 1288.03 s [vector] last: OK
  11665. 1288.03 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11666. 1288.03 s [vector] unsafeIndex: OK
  11667. 1288.03 s [vector] +++ OK, passed 100 tests; 21 discarded.
  11668. 1288.03 s [vector] unsafeHead: OK
  11669. 1288.03 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11670. 1288.03 s [vector] unsafeLast: OK
  11671. 1288.03 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11672. 1288.03 s [vector] slice: OK
  11673. 1288.03 s [vector] +++ OK, passed 100 tests.
  11674. 1288.03 s [vector] init: OK
  11675. 1288.03 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11676. 1288.03 s [vector] tail: OK
  11677. 1288.03 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11678. 1288.03 s [vector] take: OK
  11679. 1288.03 s [vector] +++ OK, passed 100 tests.
  11680. 1288.03 s [vector] drop: OK
  11681. 1288.03 s [vector] +++ OK, passed 100 tests.
  11682. 1288.03 s [vector] splitAt: OK
  11683. 1288.03 s [vector] +++ OK, passed 100 tests.
  11684. 1288.03 s [vector] empty: OK
  11685. 1288.03 s [vector] +++ OK, passed 100 tests.
  11686. 1288.03 s [vector] singleton: OK
  11687. 1288.03 s [vector] +++ OK, passed 100 tests.
  11688. 1288.03 s [vector] replicate: OK
  11689. 1288.03 s [vector] +++ OK, passed 100 tests.
  11690. 1288.03 s [vector] generate: OK
  11691. 1288.03 s [vector] +++ OK, passed 100 tests.
  11692. 1288.03 s [vector] iterateN: OK
  11693. 1288.04 s [vector] +++ OK, passed 100 tests.
  11694. 1288.10 s [vector] iterateNM: OK (0.06s)
  11695. 1288.10 s [vector] +++ OK, passed 100 tests.
  11696. 1288.12 s [vector] generateM: OK (0.02s)
  11697. 1288.12 s [vector] +++ OK, passed 100 tests.
  11698. 1288.12 s [vector] replicateM: OK
  11699. 1288.12 s [vector] +++ OK, passed 100 tests.
  11700. 1288.12 s [vector] create: OK
  11701. 1288.12 s [vector] +++ OK, passed 100 tests.
  11702. 1288.12 s [vector] createT: OK
  11703. 1288.12 s [vector] +++ OK, passed 100 tests.
  11704. 1288.12 s [vector] unfoldr: OK
  11705. 1288.12 s [vector] +++ OK, passed 100 tests.
  11706. 1288.12 s [vector] unfoldrN: OK
  11707. 1288.12 s [vector] +++ OK, passed 100 tests.
  11708. 1288.12 s [vector] unfoldrExactN: OK
  11709. 1288.12 s [vector] +++ OK, passed 100 tests.
  11710. 1288.13 s [vector] unfoldrM: OK
  11711. 1288.14 s [vector] +++ OK, passed 100 tests.
  11712. 1288.14 s [vector] unfoldrNM: OK
  11713. 1288.14 s [vector] +++ OK, passed 100 tests.
  11714. 1288.16 s [vector] unfoldrExactNM: OK (0.03s)
  11715. 1288.16 s [vector] +++ OK, passed 100 tests.
  11716. 1288.16 s [vector] constructN: OK
  11717. 1288.17 s [vector] +++ OK, passed 100 tests.
  11718. 1288.17 s [vector] constructrN: OK
  11719. 1288.17 s [vector] +++ OK, passed 100 tests.
  11720. 1288.17 s [vector] cons: OK
  11721. 1288.17 s [vector] +++ OK, passed 100 tests.
  11722. 1288.17 s [vector] snoc: OK
  11723. 1288.17 s [vector] +++ OK, passed 100 tests.
  11724. 1288.17 s [vector] append: OK
  11725. 1288.17 s [vector] +++ OK, passed 100 tests.
  11726. 1288.18 s [vector] concat: OK
  11727. 1288.18 s [vector] +++ OK, passed 100 tests.
  11728. 1288.18 s [vector] force: OK
  11729. 1288.18 s [vector] +++ OK, passed 100 tests.
  11730. 1288.18 s [vector] upd: OK
  11731. 1288.18 s [vector] +++ OK, passed 100 tests.
  11732. 1288.18 s [vector] accum: OK
  11733. 1288.18 s [vector] +++ OK, passed 100 tests.
  11734. 1288.19 s [vector] reverse: OK
  11735. 1288.19 s [vector] +++ OK, passed 100 tests.
  11736. 1288.19 s [vector] backpermute: OK
  11737. 1288.19 s [vector] +++ OK, passed 100 tests.
  11738. 1288.19 s [vector] map: OK
  11739. 1288.19 s [vector] +++ OK, passed 100 tests.
  11740. 1288.20 s [vector] imap: OK
  11741. 1288.20 s [vector] +++ OK, passed 100 tests.
  11742. 1288.20 s [vector] concatMap: OK
  11743. 1288.20 s [vector] +++ OK, passed 100 tests.
  11744. 1288.22 s [vector] mapM: OK
  11745. 1288.22 s [vector] +++ OK, passed 100 tests.
  11746. 1288.23 s [vector] mapM_: OK (0.03s)
  11747. 1288.24 s [vector] +++ OK, passed 100 tests.
  11748. 1288.24 s [vector] forM: OK
  11749. 1288.24 s [vector] +++ OK, passed 100 tests.
  11750. 1288.26 s [vector] forM_: OK (0.02s)
  11751. 1288.26 s [vector] +++ OK, passed 100 tests.
  11752. 1288.26 s [vector] imapM: OK
  11753. 1288.26 s [vector] +++ OK, passed 100 tests.
  11754. 1288.29 s [vector] imapM_: OK (0.01s)
  11755. 1288.29 s [vector] +++ OK, passed 100 tests.
  11756. 1288.29 s [vector] zipWith: OK
  11757. 1288.29 s [vector] +++ OK, passed 100 tests.
  11758. 1288.29 s [vector] zipWith3: OK
  11759. 1288.29 s [vector] +++ OK, passed 100 tests.
  11760. 1288.30 s [vector] izipWith: OK
  11761. 1288.31 s [vector] +++ OK, passed 100 tests.
  11762. 1288.32 s [vector] izipWith3: OK
  11763. 1288.32 s [vector] +++ OK, passed 100 tests.
  11764. 1288.32 s [vector] izipWithM: OK
  11765. 1288.32 s [vector] +++ OK, passed 100 tests.
  11766. 1288.32 s [vector] izipWithM_: OK (0.01s)
  11767. 1288.32 s [vector] +++ OK, passed 100 tests.
  11768. 1288.32 s [vector] zipWithM: OK
  11769. 1288.32 s [vector] +++ OK, passed 100 tests.
  11770. 1288.33 s [vector] zipWithM_: OK (0.01s)
  11771. 1288.33 s [vector] +++ OK, passed 100 tests.
  11772. 1288.33 s [vector] filter: OK
  11773. 1288.33 s [vector] +++ OK, passed 100 tests.
  11774. 1288.33 s [vector] ifilter: OK
  11775. 1288.33 s [vector] +++ OK, passed 100 tests.
  11776. 1288.36 s [vector] filterM: OK (0.03s)
  11777. 1288.36 s [vector] +++ OK, passed 100 tests.
  11778. 1288.37 s [vector] uniq: OK
  11779. 1288.37 s [vector] +++ OK, passed 100 tests.
  11780. 1288.37 s [vector] mapMaybe: OK
  11781. 1288.37 s [vector] +++ OK, passed 100 tests.
  11782. 1288.37 s [vector] imapMaybe: OK
  11783. 1288.37 s [vector] +++ OK, passed 100 tests.
  11784. 1288.37 s [vector] takeWhile: OK
  11785. 1288.37 s [vector] +++ OK, passed 100 tests.
  11786. 1288.37 s [vector] dropWhile: OK
  11787. 1288.37 s [vector] +++ OK, passed 100 tests.
  11788. 1288.37 s [vector] partition: OK
  11789. 1288.37 s [vector] +++ OK, passed 100 tests.
  11790. 1288.37 s [vector] partitionWith: OK
  11791. 1288.37 s [vector] +++ OK, passed 100 tests.
  11792. 1288.37 s [vector] span: OK
  11793. 1288.37 s [vector] +++ OK, passed 100 tests.
  11794. 1288.37 s [vector] break: OK
  11795. 1288.37 s [vector] +++ OK, passed 100 tests.
  11796. 1288.37 s [vector] spanR: OK
  11797. 1288.37 s [vector] +++ OK, passed 100 tests.
  11798. 1288.37 s [vector] breakR: OK
  11799. 1288.37 s [vector] +++ OK, passed 100 tests.
  11800. 1288.38 s [vector] groupBy: OK
  11801. 1288.38 s [vector] +++ OK, passed 100 tests.
  11802. 1288.38 s [vector] elem: OK
  11803. 1288.38 s [vector] +++ OK, passed 100 tests.
  11804. 1288.38 s [vector] notElem: OK
  11805. 1288.38 s [vector] +++ OK, passed 100 tests.
  11806. 1288.38 s [vector] find: OK
  11807. 1288.38 s [vector] +++ OK, passed 100 tests.
  11808. 1288.38 s [vector] findIndex: OK
  11809. 1288.38 s [vector] +++ OK, passed 100 tests.
  11810. 1288.38 s [vector] findIndexR: OK
  11811. 1288.38 s [vector] +++ OK, passed 100 tests.
  11812. 1288.38 s [vector] findIndices: OK
  11813. 1288.38 s [vector] +++ OK, passed 100 tests.
  11814. 1288.38 s [vector] elemIndex: OK
  11815. 1288.38 s [vector] +++ OK, passed 100 tests.
  11816. 1288.38 s [vector] elemIndices: OK
  11817. 1288.38 s [vector] +++ OK, passed 100 tests.
  11818. 1288.39 s [vector] foldl: OK
  11819. 1288.39 s [vector] +++ OK, passed 100 tests.
  11820. 1288.39 s [vector] foldl1: OK
  11821. 1288.39 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11822. 1288.39 s [vector] foldl': OK
  11823. 1288.39 s [vector] +++ OK, passed 100 tests.
  11824. 1288.39 s [vector] foldl1': OK
  11825. 1288.39 s [vector] +++ OK, passed 100 tests; 12 discarded.
  11826. 1288.39 s [vector] foldr: OK
  11827. 1288.39 s [vector] +++ OK, passed 100 tests.
  11828. 1288.39 s [vector] foldr1: OK
  11829. 1288.39 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11830. 1288.40 s [vector] foldr': OK
  11831. 1288.40 s [vector] +++ OK, passed 100 tests.
  11832. 1288.41 s [vector] foldr1': OK
  11833. 1288.41 s [vector] +++ OK, passed 100 tests; 12 discarded.
  11834. 1288.41 s [vector] ifoldl: OK
  11835. 1288.41 s [vector] +++ OK, passed 100 tests.
  11836. 1288.41 s [vector] ifoldl': OK
  11837. 1288.41 s [vector] +++ OK, passed 100 tests.
  11838. 1288.41 s [vector] ifoldr: OK
  11839. 1288.41 s [vector] +++ OK, passed 100 tests.
  11840. 1288.41 s [vector] ifoldr': OK
  11841. 1288.41 s [vector] +++ OK, passed 100 tests.
  11842. 1288.42 s [vector] ifoldM: OK
  11843. 1288.42 s [vector] +++ OK, passed 100 tests.
  11844. 1288.42 s [vector] ifoldM': OK
  11845. 1288.42 s [vector] +++ OK, passed 100 tests.
  11846. 1288.44 s [vector] ifoldM_: OK (0.02s)
  11847. 1288.44 s [vector] +++ OK, passed 100 tests.
  11848. 1288.45 s [vector] ifoldM'_: OK (0.02s)
  11849. 1288.45 s [vector] +++ OK, passed 100 tests.
  11850. 1288.45 s [vector] all: OK
  11851. 1288.45 s [vector] +++ OK, passed 100 tests.
  11852. 1288.45 s [vector] any: OK
  11853. 1288.45 s [vector] +++ OK, passed 100 tests.
  11854. 1288.45 s [vector] prescanl: OK
  11855. 1288.45 s [vector] +++ OK, passed 100 tests.
  11856. 1288.45 s [vector] prescanl': OK
  11857. 1288.45 s [vector] +++ OK, passed 100 tests.
  11858. 1288.46 s [vector] postscanl: OK
  11859. 1288.46 s [vector] +++ OK, passed 100 tests.
  11860. 1288.46 s [vector] postscanl': OK
  11861. 1288.46 s [vector] +++ OK, passed 100 tests.
  11862. 1288.46 s [vector] scanl: OK
  11863. 1288.46 s [vector] +++ OK, passed 100 tests.
  11864. 1288.47 s [vector] scanl': OK
  11865. 1288.47 s [vector] +++ OK, passed 100 tests.
  11866. 1288.47 s [vector] scanl1: OK
  11867. 1288.47 s [vector] +++ OK, passed 100 tests.
  11868. 1288.47 s [vector] scanl1': OK
  11869. 1288.47 s [vector] +++ OK, passed 100 tests.
  11870. 1288.48 s [vector] iscanl: OK
  11871. 1288.48 s [vector] +++ OK, passed 100 tests.
  11872. 1288.48 s [vector] iscanl': OK
  11873. 1288.48 s [vector] +++ OK, passed 100 tests.
  11874. 1288.48 s [vector] prescanr: OK
  11875. 1288.48 s [vector] +++ OK, passed 100 tests.
  11876. 1288.48 s [vector] prescanr': OK
  11877. 1288.48 s [vector] +++ OK, passed 100 tests.
  11878. 1288.48 s [vector] postscanr: OK
  11879. 1288.48 s [vector] +++ OK, passed 100 tests.
  11880. 1288.49 s [vector] postscanr': OK
  11881. 1288.49 s [vector] +++ OK, passed 100 tests.
  11882. 1288.49 s [vector] scanr: OK
  11883. 1288.49 s [vector] +++ OK, passed 100 tests.
  11884. 1288.49 s [vector] scanr': OK
  11885. 1288.49 s [vector] +++ OK, passed 100 tests.
  11886. 1288.50 s [vector] scanr1: OK
  11887. 1288.50 s [vector] +++ OK, passed 100 tests.
  11888. 1288.50 s [vector] scanr1': OK
  11889. 1288.50 s [vector] +++ OK, passed 100 tests.
  11890. 1288.50 s [vector] iscanr: OK
  11891. 1288.50 s [vector] +++ OK, passed 100 tests.
  11892. 1288.51 s [vector] iscanr': OK
  11893. 1288.51 s [vector] +++ OK, passed 100 tests.
  11894. 1288.51 s [vector] mut_read: OK
  11895. 1288.51 s [vector] +++ OK, passed 100 tests; 20 discarded.
  11896. 1288.51 s [vector] mut_write: OK
  11897. 1288.51 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11898. 1288.51 s [vector] mut_modify: OK
  11899. 1288.51 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11900. 1288.51 s [vector] mut_generate: OK
  11901. 1288.51 s [vector] +++ OK, passed 100 tests.
  11902. 1288.53 s [vector] mut_generateM: OK
  11903. 1288.53 s [vector] +++ OK, passed 100 tests.
  11904. 1288.53 s [vector] mut_mapM_: OK (0.01s)
  11905. 1288.53 s [vector] +++ OK, passed 100 tests.
  11906. 1288.56 s [vector] mut_imapM_: OK
  11907. 1288.56 s [vector] +++ OK, passed 100 tests.
  11908. 1288.57 s [vector] mut_forM_: OK (0.01s)
  11909. 1288.57 s [vector] +++ OK, passed 100 tests.
  11910. 1288.57 s [vector] mut_iforM_: OK (0.01s)
  11911. 1288.57 s [vector] +++ OK, passed 100 tests.
  11912. 1288.57 s [vector] mut_foldr: OK
  11913. 1288.57 s [vector] +++ OK, passed 100 tests.
  11914. 1288.58 s [vector] mut_foldr': OK
  11915. 1288.58 s [vector] +++ OK, passed 100 tests.
  11916. 1288.58 s [vector] mut_foldl: OK
  11917. 1288.58 s [vector] +++ OK, passed 100 tests.
  11918. 1288.59 s [vector] mut_foldl': OK
  11919. 1288.59 s [vector] +++ OK, passed 100 tests.
  11920. 1288.59 s [vector] mut_ifoldr: OK
  11921. 1288.59 s [vector] +++ OK, passed 100 tests.
  11922. 1288.59 s [vector] mut_ifoldr': OK
  11923. 1288.59 s [vector] +++ OK, passed 100 tests.
  11924. 1288.59 s [vector] mut_ifoldl: OK
  11925. 1288.59 s [vector] +++ OK, passed 100 tests.
  11926. 1288.60 s [vector] mut_ifoldl': OK
  11927. 1288.60 s [vector] +++ OK, passed 100 tests.
  11928. 1288.60 s [vector] mut_foldM: OK
  11929. 1288.60 s [vector] +++ OK, passed 100 tests.
  11930. 1288.60 s [vector] mut_foldM': OK
  11931. 1288.60 s [vector] +++ OK, passed 100 tests.
  11932. 1288.61 s [vector] mut_foldrM: OK
  11933. 1288.61 s [vector] +++ OK, passed 100 tests.
  11934. 1288.61 s [vector] mut_foldrM': OK
  11935. 1288.61 s [vector] +++ OK, passed 100 tests.
  11936. 1288.61 s [vector] mut_ifoldM: OK
  11937. 1288.61 s [vector] +++ OK, passed 100 tests.
  11938. 1288.61 s [vector] mut_ifoldM': OK
  11939. 1288.61 s [vector] +++ OK, passed 100 tests.
  11940. 1288.61 s [vector] mut_ifoldrM: OK
  11941. 1288.61 s [vector] +++ OK, passed 100 tests.
  11942. 1288.62 s [vector] mut_ifoldrM': OK
  11943. 1288.62 s [vector] +++ OK, passed 100 tests.
  11944. 1288.62 s [vector] compare: OK
  11945. 1288.62 s [vector] +++ OK, passed 100 tests.
  11946. 1288.62 s [vector] maximum: OK
  11947. 1288.62 s [vector] +++ OK, passed 100 tests; 22 discarded.
  11948. 1288.62 s [vector] minimum: OK
  11949. 1288.62 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11950. 1288.62 s [vector] minIndex: OK
  11951. 1288.62 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11952. 1288.62 s [vector] maxIndex: OK
  11953. 1288.62 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11954. 1288.62 s [vector] maximumBy: OK
  11955. 1288.62 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11956. 1288.62 s [vector] minimumBy: OK
  11957. 1288.62 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11958. 1288.62 s [vector] maximumOn: OK
  11959. 1288.62 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11960. 1288.62 s [vector] minimumOn: OK
  11961. 1288.62 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11962. 1288.62 s [vector] maxIndexBy: OK
  11963. 1288.62 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11964. 1288.62 s [vector] minIndexBy: OK
  11965. 1288.62 s [vector] +++ OK, passed 100 tests; 20 discarded.
  11966. 1288.62 s [vector] ListFirstMaxIndexWins: OK
  11967. 1288.62 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11968. 1288.62 s [vector] FalseListFirstMaxIndexWins: OK
  11969. 1288.63 s [vector] +++ OK, failed as expected. (after 1 test):
  11970. 1288.63 s [vector] Exception:
  11971. 1288.63 s [vector] Prelude.foldr1: empty list
  11972. 1288.63 s [vector] CallStack (from HasCallStack):
  11973. 1288.63 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  11974. 1288.63 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  11975. 1288.63 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  11976. 1288.63 s [vector] []
  11977. 1288.63 s [vector] zip: OK
  11978. 1288.63 s [vector] +++ OK, passed 100 tests.
  11979. 1288.63 s [vector] zip3: OK
  11980. 1288.64 s [vector] +++ OK, passed 100 tests.
  11981. 1288.64 s [vector] unzip: OK
  11982. 1288.64 s [vector] +++ OK, passed 100 tests.
  11983. 1288.64 s [vector] unzip3: OK
  11984. 1288.64 s [vector] +++ OK, passed 100 tests.
  11985. 1288.64 s [vector] indexed: OK
  11986. 1288.64 s [vector] +++ OK, passed 100 tests.
  11987. 1288.64 s [vector] update: OK
  11988. 1288.64 s [vector] +++ OK, passed 100 tests.
  11989. 1288.64 s [vector] concat: OK
  11990. 1288.64 s [vector] +++ OK, passed 100 tests.
  11991. 1288.64 s [vector] mempty: OK
  11992. 1288.64 s [vector] +++ OK, passed 100 tests.
  11993. 1288.64 s [vector] mappend: OK
  11994. 1288.64 s [vector] +++ OK, passed 100 tests.
  11995. 1288.64 s [vector] mconcat: OK
  11996. 1288.64 s [vector] +++ OK, passed 100 tests.
  11997. 1288.65 s [vector] fmap: OK
  11998. 1288.65 s [vector] +++ OK, passed 100 tests.
  11999. 1288.66 s [vector] return: OK
  12000. 1288.66 s [vector] +++ OK, passed 100 tests.
  12001. 1288.66 s [vector] bind: OK (0.02s)
  12002. 1288.66 s [vector] +++ OK, passed 100 tests.
  12003. 1288.66 s [vector] mzip: OK
  12004. 1288.66 s [vector] +++ OK, passed 100 tests.
  12005. 1288.68 s [vector] munzip: OK
  12006. 1288.68 s [vector] +++ OK, passed 100 tests.
  12007. 1288.68 s [vector] applicative_pure: OK
  12008. 1288.68 s [vector] +++ OK, passed 100 tests.
  12009. 1288.70 s [vector] applicative_appl: OK (0.03s)
  12010. 1288.70 s [vector] +++ OK, passed 100 tests.
  12011. 1288.70 s [vector] alternative_empty: OK
  12012. 1288.70 s [vector] +++ OK, passed 100 tests.
  12013. 1288.70 s [vector] alternative_or: OK
  12014. 1288.70 s [vector] +++ OK, passed 100 tests.
  12015. 1288.74 s [vector] sequence: OK (0.01s)
  12016. 1288.74 s [vector] +++ OK, passed 100 tests.
  12017. 1288.74 s [vector] sequence_: OK (0.01s)
  12018. 1288.74 s [vector] +++ OK, passed 100 tests.
  12019. 1288.74 s [vector] glength: OK
  12020. 1288.74 s [vector] +++ OK, passed 100 tests.
  12021. 1288.74 s [vector] sum: OK
  12022. 1288.74 s [vector] +++ OK, passed 100 tests.
  12023. 1288.74 s [vector] product: OK
  12024. 1288.74 s [vector] +++ OK, passed 100 tests.
  12025. 1288.74 s [vector] enumFromN: OK
  12026. 1288.74 s [vector] +++ OK, passed 100 tests.
  12027. 1288.74 s [vector] enumFromThenN: OK
  12028. 1288.74 s [vector] +++ OK, passed 100 tests.
  12029. 1288.74 s [vector] enumFromTo: OK
  12030. 1288.74 s [vector] +++ OK, passed 100 tests.
  12031. 1288.75 s [vector] enumFromThenTo: OK
  12032. 1288.75 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12033. 1288.75 s [vector] unstream
  12034. 1288.75 s [vector] unstream == vunstream (exact): OK
  12035. 1288.75 s [vector] +++ OK, passed 100 tests.
  12036. 1288.75 s [vector] unstream == vunstream (unknown): OK
  12037. 1288.75 s [vector] +++ OK, passed 100 tests.
  12038. 1288.75 s [vector] unstreamR ~= vunstream (exact): OK
  12039. 1288.75 s [vector] +++ OK, passed 100 tests.
  12040. 1288.75 s [vector] unstreamR ~= vunstream (unknown): OK
  12041. 1288.75 s [vector] +++ OK, passed 100 tests.
  12042. 1288.75 s [vector] Tests.Vector.Primitive
  12043. 1288.75 s [vector] Int
  12044. 1288.75 s [vector] fromList.toList == id: OK
  12045. 1288.75 s [vector] +++ OK, passed 100 tests.
  12046. 1288.75 s [vector] toList.fromList == id: OK
  12047. 1288.75 s [vector] +++ OK, passed 100 tests.
  12048. 1288.75 s [vector] unstream.stream == id: OK
  12049. 1288.75 s [vector] +++ OK, passed 100 tests.
  12050. 1288.75 s [vector] stream.unstream == id: OK
  12051. 1288.75 s [vector] +++ OK, passed 100 tests.
  12052. 1288.75 s [vector] eq: OK
  12053. 1288.75 s [vector] +++ OK, passed 100 tests.
  12054. 1288.75 s [vector] length: OK
  12055. 1288.75 s [vector] +++ OK, passed 100 tests.
  12056. 1288.75 s [vector] null: OK
  12057. 1288.75 s [vector] +++ OK, passed 100 tests.
  12058. 1288.75 s [vector] index: OK
  12059. 1288.75 s [vector] +++ OK, passed 100 tests; 12 discarded.
  12060. 1288.75 s [vector] safeIndex: OK
  12061. 1288.75 s [vector] +++ OK, passed 100 tests.
  12062. 1288.75 s [vector] head: OK
  12063. 1288.75 s [vector] +++ OK, passed 100 tests; 21 discarded.
  12064. 1288.75 s [vector] last: OK
  12065. 1288.75 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12066. 1288.75 s [vector] unsafeIndex: OK
  12067. 1288.75 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12068. 1288.75 s [vector] unsafeHead: OK
  12069. 1288.75 s [vector] +++ OK, passed 100 tests; 20 discarded.
  12070. 1288.75 s [vector] unsafeLast: OK
  12071. 1288.75 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12072. 1288.75 s [vector] slice: OK
  12073. 1288.75 s [vector] +++ OK, passed 100 tests.
  12074. 1288.75 s [vector] init: OK
  12075. 1288.75 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12076. 1288.76 s [vector] tail: OK
  12077. 1288.76 s [vector] +++ OK, passed 100 tests; 12 discarded.
  12078. 1288.76 s [vector] take: OK
  12079. 1288.76 s [vector] +++ OK, passed 100 tests.
  12080. 1288.76 s [vector] drop: OK
  12081. 1288.76 s [vector] +++ OK, passed 100 tests.
  12082. 1288.76 s [vector] splitAt: OK
  12083. 1288.76 s [vector] +++ OK, passed 100 tests.
  12084. 1288.76 s [vector] empty: OK
  12085. 1288.76 s [vector] +++ OK, passed 100 tests.
  12086. 1288.76 s [vector] singleton: OK
  12087. 1288.76 s [vector] +++ OK, passed 100 tests.
  12088. 1288.76 s [vector] replicate: OK
  12089. 1288.76 s [vector] +++ OK, passed 100 tests.
  12090. 1288.76 s [vector] generate: OK
  12091. 1288.76 s [vector] +++ OK, passed 100 tests.
  12092. 1288.76 s [vector] iterateN: OK
  12093. 1288.76 s [vector] +++ OK, passed 100 tests.
  12094. 1288.82 s [vector] iterateNM: OK (0.03s)
  12095. 1288.82 s [vector] +++ OK, passed 100 tests.
  12096. 1288.82 s [vector] generateM: OK (0.02s)
  12097. 1288.82 s [vector] +++ OK, passed 100 tests.
  12098. 1288.84 s [vector] replicateM: OK
  12099. 1288.84 s [vector] +++ OK, passed 100 tests.
  12100. 1288.84 s [vector] create: OK
  12101. 1288.84 s [vector] +++ OK, passed 100 tests.
  12102. 1288.84 s [vector] createT: OK
  12103. 1288.84 s [vector] +++ OK, passed 100 tests.
  12104. 1288.84 s [vector] unfoldr: OK
  12105. 1288.84 s [vector] +++ OK, passed 100 tests.
  12106. 1288.84 s [vector] unfoldrN: OK
  12107. 1288.84 s [vector] +++ OK, passed 100 tests.
  12108. 1288.84 s [vector] unfoldrExactN: OK
  12109. 1288.84 s [vector] +++ OK, passed 100 tests.
  12110. 1288.86 s [vector] unfoldrM: OK
  12111. 1288.86 s [vector] +++ OK, passed 100 tests.
  12112. 1288.87 s [vector] unfoldrNM: OK
  12113. 1288.87 s [vector] +++ OK, passed 100 tests.
  12114. 1288.91 s [vector] unfoldrExactNM: OK (0.07s)
  12115. 1288.92 s [vector] +++ OK, passed 100 tests.
  12116. 1288.92 s [vector] constructN: OK
  12117. 1288.92 s [vector] +++ OK, passed 100 tests.
  12118. 1288.92 s [vector] constructrN: OK
  12119. 1288.92 s [vector] +++ OK, passed 100 tests.
  12120. 1288.92 s [vector] cons: OK
  12121. 1288.92 s [vector] +++ OK, passed 100 tests.
  12122. 1288.92 s [vector] snoc: OK
  12123. 1288.92 s [vector] +++ OK, passed 100 tests.
  12124. 1288.94 s [vector] append: OK
  12125. 1288.94 s [vector] +++ OK, passed 100 tests.
  12126. 1288.94 s [vector] concat: OK (0.02s)
  12127. 1288.94 s [vector] +++ OK, passed 100 tests.
  12128. 1288.94 s [vector] force: OK
  12129. 1288.94 s [vector] +++ OK, passed 100 tests.
  12130. 1288.94 s [vector] upd: OK
  12131. 1288.94 s [vector] +++ OK, passed 100 tests.
  12132. 1288.94 s [vector] accum: OK
  12133. 1288.94 s [vector] +++ OK, passed 100 tests.
  12134. 1288.94 s [vector] reverse: OK
  12135. 1288.94 s [vector] +++ OK, passed 100 tests.
  12136. 1288.95 s [vector] backpermute: OK
  12137. 1288.95 s [vector] +++ OK, passed 100 tests.
  12138. 1288.95 s [vector] map: OK
  12139. 1288.95 s [vector] +++ OK, passed 100 tests.
  12140. 1288.95 s [vector] imap: OK
  12141. 1288.95 s [vector] +++ OK, passed 100 tests.
  12142. 1288.96 s [vector] concatMap: OK
  12143. 1288.96 s [vector] +++ OK, passed 100 tests.
  12144. 1288.96 s [vector] mapM: OK
  12145. 1288.96 s [vector] +++ OK, passed 100 tests.
  12146. 1288.97 s [vector] mapM_: OK (0.02s)
  12147. 1288.98 s [vector] +++ OK, passed 100 tests.
  12148. 1288.98 s [vector] forM: OK
  12149. 1288.98 s [vector] +++ OK, passed 100 tests.
  12150. 1288.99 s [vector] forM_: OK (0.01s)
  12151. 1289.00 s [vector] +++ OK, passed 100 tests.
  12152. 1289.00 s [vector] imapM: OK
  12153. 1289.00 s [vector] +++ OK, passed 100 tests.
  12154. 1289.01 s [vector] imapM_: OK (0.02s)
  12155. 1289.01 s [vector] +++ OK, passed 100 tests.
  12156. 1289.01 s [vector] zipWith: OK
  12157. 1289.01 s [vector] +++ OK, passed 100 tests.
  12158. 1289.01 s [vector] zipWith3: OK
  12159. 1289.01 s [vector] +++ OK, passed 100 tests.
  12160. 1289.02 s [vector] izipWith: OK
  12161. 1289.02 s [vector] +++ OK, passed 100 tests.
  12162. 1289.02 s [vector] izipWith3: OK
  12163. 1289.02 s [vector] +++ OK, passed 100 tests.
  12164. 1289.03 s [vector] izipWithM: OK
  12165. 1289.03 s [vector] +++ OK, passed 100 tests.
  12166. 1289.03 s [vector] izipWithM_: OK (0.01s)
  12167. 1289.03 s [vector] +++ OK, passed 100 tests.
  12168. 1289.03 s [vector] zipWithM: OK
  12169. 1289.03 s [vector] +++ OK, passed 100 tests.
  12170. 1289.06 s [vector] zipWithM_: OK (0.02s)
  12171. 1289.06 s [vector] +++ OK, passed 100 tests.
  12172. 1289.06 s [vector] filter: OK
  12173. 1289.06 s [vector] +++ OK, passed 100 tests.
  12174. 1289.06 s [vector] ifilter: OK
  12175. 1289.06 s [vector] +++ OK, passed 100 tests.
  12176. 1289.09 s [vector] filterM: OK (0.01s)
  12177. 1289.09 s [vector] +++ OK, passed 100 tests.
  12178. 1289.09 s [vector] uniq: OK
  12179. 1289.09 s [vector] +++ OK, passed 100 tests.
  12180. 1289.09 s [vector] mapMaybe: OK
  12181. 1289.09 s [vector] +++ OK, passed 100 tests.
  12182. 1289.09 s [vector] imapMaybe: OK
  12183. 1289.09 s [vector] +++ OK, passed 100 tests.
  12184. 1289.09 s [vector] takeWhile: OK
  12185. 1289.09 s [vector] +++ OK, passed 100 tests.
  12186. 1289.10 s [vector] dropWhile: OK
  12187. 1289.10 s [vector] +++ OK, passed 100 tests.
  12188. 1289.10 s [vector] partition: OK
  12189. 1289.10 s [vector] +++ OK, passed 100 tests.
  12190. 1289.10 s [vector] partitionWith: OK
  12191. 1289.10 s [vector] +++ OK, passed 100 tests.
  12192. 1289.10 s [vector] span: OK
  12193. 1289.10 s [vector] +++ OK, passed 100 tests.
  12194. 1289.11 s [vector] break: OK
  12195. 1289.11 s [vector] +++ OK, passed 100 tests.
  12196. 1289.11 s [vector] spanR: OK
  12197. 1289.11 s [vector] +++ OK, passed 100 tests.
  12198. 1289.11 s [vector] breakR: OK
  12199. 1289.11 s [vector] +++ OK, passed 100 tests.
  12200. 1289.11 s [vector] groupBy: OK
  12201. 1289.11 s [vector] +++ OK, passed 100 tests.
  12202. 1289.11 s [vector] elem: OK
  12203. 1289.11 s [vector] +++ OK, passed 100 tests.
  12204. 1289.11 s [vector] notElem: OK
  12205. 1289.11 s [vector] +++ OK, passed 100 tests.
  12206. 1289.11 s [vector] find: OK
  12207. 1289.11 s [vector] +++ OK, passed 100 tests.
  12208. 1289.11 s [vector] findIndex: OK
  12209. 1289.11 s [vector] +++ OK, passed 100 tests.
  12210. 1289.11 s [vector] findIndexR: OK
  12211. 1289.11 s [vector] +++ OK, passed 100 tests.
  12212. 1289.11 s [vector] findIndices: OK
  12213. 1289.11 s [vector] +++ OK, passed 100 tests.
  12214. 1289.11 s [vector] elemIndex: OK
  12215. 1289.11 s [vector] +++ OK, passed 100 tests.
  12216. 1289.11 s [vector] elemIndices: OK
  12217. 1289.11 s [vector] +++ OK, passed 100 tests.
  12218. 1289.12 s [vector] foldl: OK
  12219. 1289.12 s [vector] +++ OK, passed 100 tests.
  12220. 1289.12 s [vector] foldl1: OK
  12221. 1289.12 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12222. 1289.12 s [vector] foldl': OK
  12223. 1289.12 s [vector] +++ OK, passed 100 tests.
  12224. 1289.12 s [vector] foldl1': OK
  12225. 1289.12 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12226. 1289.13 s [vector] foldr: OK
  12227. 1289.13 s [vector] +++ OK, passed 100 tests.
  12228. 1289.13 s [vector] foldr1: OK
  12229. 1289.13 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12230. 1289.13 s [vector] foldr': OK
  12231. 1289.14 s [vector] +++ OK, passed 100 tests.
  12232. 1289.14 s [vector] foldr1': OK
  12233. 1289.14 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12234. 1289.14 s [vector] ifoldl: OK
  12235. 1289.14 s [vector] +++ OK, passed 100 tests.
  12236. 1289.15 s [vector] ifoldl': OK
  12237. 1289.15 s [vector] +++ OK, passed 100 tests.
  12238. 1289.15 s [vector] ifoldr: OK
  12239. 1289.15 s [vector] +++ OK, passed 100 tests.
  12240. 1289.15 s [vector] ifoldr': OK
  12241. 1289.15 s [vector] +++ OK, passed 100 tests.
  12242. 1289.15 s [vector] ifoldM: OK
  12243. 1289.15 s [vector] +++ OK, passed 100 tests.
  12244. 1289.16 s [vector] ifoldM': OK
  12245. 1289.16 s [vector] +++ OK, passed 100 tests.
  12246. 1289.18 s [vector] ifoldM_: OK (0.02s)
  12247. 1289.18 s [vector] +++ OK, passed 100 tests.
  12248. 1289.20 s [vector] ifoldM'_: OK (0.02s)
  12249. 1289.20 s [vector] +++ OK, passed 100 tests.
  12250. 1289.20 s [vector] all: OK
  12251. 1289.20 s [vector] +++ OK, passed 100 tests.
  12252. 1289.20 s [vector] any: OK
  12253. 1289.20 s [vector] +++ OK, passed 100 tests.
  12254. 1289.20 s [vector] prescanl: OK
  12255. 1289.20 s [vector] +++ OK, passed 100 tests.
  12256. 1289.20 s [vector] prescanl': OK
  12257. 1289.20 s [vector] +++ OK, passed 100 tests.
  12258. 1289.21 s [vector] postscanl: OK
  12259. 1289.21 s [vector] +++ OK, passed 100 tests.
  12260. 1289.21 s [vector] postscanl': OK
  12261. 1289.21 s [vector] +++ OK, passed 100 tests.
  12262. 1289.21 s [vector] scanl: OK
  12263. 1289.21 s [vector] +++ OK, passed 100 tests.
  12264. 1289.22 s [vector] scanl': OK
  12265. 1289.22 s [vector] +++ OK, passed 100 tests.
  12266. 1289.22 s [vector] scanl1: OK
  12267. 1289.22 s [vector] +++ OK, passed 100 tests.
  12268. 1289.22 s [vector] scanl1': OK
  12269. 1289.23 s [vector] +++ OK, passed 100 tests.
  12270. 1289.23 s [vector] iscanl: OK
  12271. 1289.23 s [vector] +++ OK, passed 100 tests.
  12272. 1289.24 s [vector] iscanl': OK
  12273. 1289.24 s [vector] +++ OK, passed 100 tests.
  12274. 1289.24 s [vector] prescanr: OK
  12275. 1289.24 s [vector] +++ OK, passed 100 tests.
  12276. 1289.24 s [vector] prescanr': OK
  12277. 1289.24 s [vector] +++ OK, passed 100 tests.
  12278. 1289.24 s [vector] postscanr: OK
  12279. 1289.24 s [vector] +++ OK, passed 100 tests.
  12280. 1289.25 s [vector] postscanr': OK
  12281. 1289.25 s [vector] +++ OK, passed 100 tests.
  12282. 1289.25 s [vector] scanr: OK
  12283. 1289.25 s [vector] +++ OK, passed 100 tests.
  12284. 1289.25 s [vector] scanr': OK
  12285. 1289.25 s [vector] +++ OK, passed 100 tests.
  12286. 1289.25 s [vector] scanr1: OK
  12287. 1289.26 s [vector] +++ OK, passed 100 tests.
  12288. 1289.26 s [vector] scanr1': OK
  12289. 1289.26 s [vector] +++ OK, passed 100 tests.
  12290. 1289.27 s [vector] iscanr: OK
  12291. 1289.27 s [vector] +++ OK, passed 100 tests.
  12292. 1289.27 s [vector] iscanr': OK
  12293. 1289.27 s [vector] +++ OK, passed 100 tests.
  12294. 1289.27 s [vector] mut_read: OK
  12295. 1289.27 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12296. 1289.27 s [vector] mut_write: OK
  12297. 1289.27 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12298. 1289.27 s [vector] mut_modify: OK
  12299. 1289.28 s [vector] +++ OK, passed 100 tests; 12 discarded.
  12300. 1289.28 s [vector] mut_generate: OK
  12301. 1289.29 s [vector] +++ OK, passed 100 tests.
  12302. 1289.30 s [vector] mut_generateM: OK (0.02s)
  12303. 1289.30 s [vector] +++ OK, passed 100 tests.
  12304. 1289.32 s [vector] mut_mapM_: OK (0.01s)
  12305. 1289.32 s [vector] +++ OK, passed 100 tests.
  12306. 1289.33 s [vector] mut_imapM_: OK (0.01s)
  12307. 1289.33 s [vector] +++ OK, passed 100 tests.
  12308. 1289.33 s [vector] mut_forM_: OK (0.01s)
  12309. 1289.33 s [vector] +++ OK, passed 100 tests.
  12310. 1289.35 s [vector] mut_iforM_: OK
  12311. 1289.35 s [vector] +++ OK, passed 100 tests.
  12312. 1289.35 s [vector] mut_foldr: OK
  12313. 1289.35 s [vector] +++ OK, passed 100 tests.
  12314. 1289.35 s [vector] mut_foldr': OK
  12315. 1289.35 s [vector] +++ OK, passed 100 tests.
  12316. 1289.35 s [vector] mut_foldl: OK
  12317. 1289.36 s [vector] +++ OK, passed 100 tests.
  12318. 1289.36 s [vector] mut_foldl': OK
  12319. 1289.36 s [vector] +++ OK, passed 100 tests.
  12320. 1289.36 s [vector] mut_ifoldr: OK
  12321. 1289.36 s [vector] +++ OK, passed 100 tests.
  12322. 1289.36 s [vector] mut_ifoldr': OK
  12323. 1289.36 s [vector] +++ OK, passed 100 tests.
  12324. 1289.37 s [vector] mut_ifoldl: OK
  12325. 1289.37 s [vector] +++ OK, passed 100 tests.
  12326. 1289.37 s [vector] mut_ifoldl': OK
  12327. 1289.37 s [vector] +++ OK, passed 100 tests.
  12328. 1289.37 s [vector] mut_foldM: OK
  12329. 1289.37 s [vector] +++ OK, passed 100 tests.
  12330. 1289.38 s [vector] mut_foldM': OK
  12331. 1289.38 s [vector] +++ OK, passed 100 tests.
  12332. 1289.38 s [vector] mut_foldrM: OK
  12333. 1289.39 s [vector] +++ OK, passed 100 tests.
  12334. 1289.39 s [vector] mut_foldrM': OK
  12335. 1289.39 s [vector] +++ OK, passed 100 tests.
  12336. 1289.39 s [vector] mut_ifoldM: OK
  12337. 1289.39 s [vector] +++ OK, passed 100 tests.
  12338. 1289.39 s [vector] mut_ifoldM': OK
  12339. 1289.39 s [vector] +++ OK, passed 100 tests.
  12340. 1289.39 s [vector] mut_ifoldrM: OK
  12341. 1289.39 s [vector] +++ OK, passed 100 tests.
  12342. 1289.39 s [vector] mut_ifoldrM': OK
  12343. 1289.39 s [vector] +++ OK, passed 100 tests.
  12344. 1289.39 s [vector] compare: OK
  12345. 1289.40 s [vector] +++ OK, passed 100 tests.
  12346. 1289.40 s [vector] maximum: OK
  12347. 1289.40 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12348. 1289.40 s [vector] minimum: OK
  12349. 1289.40 s [vector] +++ OK, passed 100 tests; 11 discarded.
  12350. 1289.40 s [vector] minIndex: OK
  12351. 1289.40 s [vector] +++ OK, passed 100 tests; 21 discarded.
  12352. 1289.40 s [vector] maxIndex: OK
  12353. 1289.40 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12354. 1289.40 s [vector] maximumBy: OK
  12355. 1289.40 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12356. 1289.40 s [vector] minimumBy: OK
  12357. 1289.40 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12358. 1289.40 s [vector] maximumOn: OK
  12359. 1289.40 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12360. 1289.40 s [vector] minimumOn: OK
  12361. 1289.40 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12362. 1289.40 s [vector] maxIndexBy: OK
  12363. 1289.40 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12364. 1289.40 s [vector] minIndexBy: OK
  12365. 1289.40 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12366. 1289.40 s [vector] ListFirstMaxIndexWins: OK
  12367. 1289.40 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12368. 1289.40 s [vector] FalseListFirstMaxIndexWins: OK
  12369. 1289.40 s [vector] +++ OK, failed as expected. (after 1 test):
  12370. 1289.40 s [vector] Exception:
  12371. 1289.40 s [vector] Prelude.foldr1: empty list
  12372. 1289.40 s [vector] CallStack (from HasCallStack):
  12373. 1289.40 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  12374. 1289.40 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  12375. 1289.40 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  12376. 1289.40 s [vector] []
  12377. 1289.40 s [vector] mempty: OK
  12378. 1289.40 s [vector] +++ OK, passed 100 tests.
  12379. 1289.41 s [vector] mappend: OK
  12380. 1289.41 s [vector] +++ OK, passed 100 tests.
  12381. 1289.42 s [vector] mconcat: OK (0.01s)
  12382. 1289.42 s [vector] +++ OK, passed 100 tests.
  12383. 1289.42 s [vector] glength: OK
  12384. 1289.42 s [vector] +++ OK, passed 100 tests.
  12385. 1289.42 s [vector] sum: OK
  12386. 1289.42 s [vector] +++ OK, passed 100 tests.
  12387. 1289.42 s [vector] product: OK
  12388. 1289.42 s [vector] +++ OK, passed 100 tests.
  12389. 1289.42 s [vector] enumFromN: OK
  12390. 1289.42 s [vector] +++ OK, passed 100 tests.
  12391. 1289.42 s [vector] enumFromThenN: OK
  12392. 1289.42 s [vector] +++ OK, passed 100 tests.
  12393. 1289.42 s [vector] enumFromTo: OK
  12394. 1289.42 s [vector] +++ OK, passed 100 tests.
  12395. 1289.42 s [vector] enumFromThenTo: OK
  12396. 1289.42 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12397. 1289.42 s [vector] Double
  12398. 1289.42 s [vector] fromList.toList == id: OK
  12399. 1289.42 s [vector] +++ OK, passed 100 tests.
  12400. 1289.42 s [vector] toList.fromList == id: OK
  12401. 1289.42 s [vector] +++ OK, passed 100 tests.
  12402. 1289.42 s [vector] unstream.stream == id: OK
  12403. 1289.42 s [vector] +++ OK, passed 100 tests.
  12404. 1289.42 s [vector] stream.unstream == id: OK
  12405. 1289.42 s [vector] +++ OK, passed 100 tests.
  12406. 1289.42 s [vector] eq: OK
  12407. 1289.42 s [vector] +++ OK, passed 100 tests.
  12408. 1289.42 s [vector] length: OK
  12409. 1289.42 s [vector] +++ OK, passed 100 tests.
  12410. 1289.43 s [vector] null: OK
  12411. 1289.43 s [vector] +++ OK, passed 100 tests.
  12412. 1289.43 s [vector] index: OK
  12413. 1289.43 s [vector] +++ OK, passed 100 tests; 12 discarded.
  12414. 1289.43 s [vector] safeIndex: OK
  12415. 1289.43 s [vector] +++ OK, passed 100 tests.
  12416. 1289.43 s [vector] head: OK
  12417. 1289.43 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12418. 1289.43 s [vector] last: OK
  12419. 1289.43 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12420. 1289.43 s [vector] unsafeIndex: OK
  12421. 1289.43 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12422. 1289.43 s [vector] unsafeHead: OK
  12423. 1289.43 s [vector] +++ OK, passed 100 tests; 10 discarded.
  12424. 1289.43 s [vector] unsafeLast: OK
  12425. 1289.43 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12426. 1289.43 s [vector] slice: OK
  12427. 1289.43 s [vector] +++ OK, passed 100 tests.
  12428. 1289.43 s [vector] init: OK
  12429. 1289.43 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12430. 1289.43 s [vector] tail: OK
  12431. 1289.43 s [vector] +++ OK, passed 100 tests; 12 discarded.
  12432. 1289.43 s [vector] take: OK
  12433. 1289.43 s [vector] +++ OK, passed 100 tests.
  12434. 1289.44 s [vector] drop: OK
  12435. 1289.44 s [vector] +++ OK, passed 100 tests.
  12436. 1289.44 s [vector] splitAt: OK
  12437. 1289.44 s [vector] +++ OK, passed 100 tests.
  12438. 1289.44 s [vector] empty: OK
  12439. 1289.44 s [vector] +++ OK, passed 100 tests.
  12440. 1289.44 s [vector] singleton: OK
  12441. 1289.44 s [vector] +++ OK, passed 100 tests.
  12442. 1289.44 s [vector] replicate: OK
  12443. 1289.44 s [vector] +++ OK, passed 100 tests.
  12444. 1289.44 s [vector] generate: OK
  12445. 1289.44 s [vector] +++ OK, passed 100 tests.
  12446. 1289.46 s [vector] iterateN: OK
  12447. 1289.46 s [vector] +++ OK, passed 100 tests.
  12448. 1289.52 s [vector] iterateNM: OK (0.05s)
  12449. 1289.52 s [vector] +++ OK, passed 100 tests.
  12450. 1289.54 s [vector] generateM: OK (0.04s)
  12451. 1289.54 s [vector] +++ OK, passed 100 tests.
  12452. 1289.55 s [vector] replicateM: OK
  12453. 1289.55 s [vector] +++ OK, passed 100 tests.
  12454. 1289.55 s [vector] create: OK
  12455. 1289.55 s [vector] +++ OK, passed 100 tests.
  12456. 1289.55 s [vector] createT: OK
  12457. 1289.55 s [vector] +++ OK, passed 100 tests.
  12458. 1289.56 s [vector] unfoldr: OK
  12459. 1289.56 s [vector] +++ OK, passed 100 tests.
  12460. 1289.56 s [vector] unfoldrN: OK
  12461. 1289.56 s [vector] +++ OK, passed 100 tests.
  12462. 1289.56 s [vector] unfoldrExactN: OK
  12463. 1289.56 s [vector] +++ OK, passed 100 tests.
  12464. 1289.56 s [vector] unfoldrM: OK
  12465. 1289.57 s [vector] +++ OK, passed 100 tests.
  12466. 1289.58 s [vector] unfoldrNM: OK
  12467. 1289.58 s [vector] +++ OK, passed 100 tests.
  12468. 1289.61 s [vector] unfoldrExactNM: OK (0.04s)
  12469. 1289.61 s [vector] +++ OK, passed 100 tests.
  12470. 1289.66 s [vector] constructN: OK (0.02s)
  12471. 1289.66 s [vector] +++ OK, passed 100 tests.
  12472. 1289.66 s [vector] constructrN: OK (0.02s)
  12473. 1289.66 s [vector] +++ OK, passed 100 tests.
  12474. 1289.66 s [vector] cons: OK
  12475. 1289.66 s [vector] +++ OK, passed 100 tests.
  12476. 1289.67 s [vector] snoc: OK
  12477. 1289.67 s [vector] +++ OK, passed 100 tests.
  12478. 1289.68 s [vector] append: OK
  12479. 1289.68 s [vector] +++ OK, passed 100 tests.
  12480. 1289.69 s [vector] concat: OK (0.03s)
  12481. 1289.69 s [vector] +++ OK, passed 100 tests.
  12482. 1289.70 s [vector] force: OK
  12483. 1289.70 s [vector] +++ OK, passed 100 tests.
  12484. 1289.70 s [vector] upd: OK
  12485. 1289.70 s [vector] +++ OK, passed 100 tests.
  12486. 1289.72 s [vector] accum: OK (0.02s)
  12487. 1289.72 s [vector] +++ OK, passed 100 tests.
  12488. 1289.72 s [vector] reverse: OK
  12489. 1289.72 s [vector] +++ OK, passed 100 tests.
  12490. 1289.72 s [vector] backpermute: OK
  12491. 1289.72 s [vector] +++ OK, passed 100 tests.
  12492. 1289.74 s [vector] map: OK (0.01s)
  12493. 1289.74 s [vector] +++ OK, passed 100 tests.
  12494. 1289.74 s [vector] imap: OK (0.01s)
  12495. 1289.74 s [vector] +++ OK, passed 100 tests.
  12496. 1289.76 s [vector] concatMap: OK
  12497. 1289.76 s [vector] +++ OK, passed 100 tests.
  12498. 1289.78 s [vector] mapM: OK
  12499. 1289.78 s [vector] +++ OK, passed 100 tests.
  12500. 1289.79 s [vector] mapM_: OK (0.03s)
  12501. 1289.79 s [vector] +++ OK, passed 100 tests.
  12502. 1289.80 s [vector] forM: OK
  12503. 1289.80 s [vector] +++ OK, passed 100 tests.
  12504. 1289.85 s [vector] forM_: OK (0.02s)
  12505. 1289.86 s [vector] +++ OK, passed 100 tests.
  12506. 1289.86 s [vector] imapM: OK
  12507. 1289.86 s [vector] +++ OK, passed 100 tests.
  12508. 1289.92 s [vector] imapM_: OK (0.05s)
  12509. 1289.92 s [vector] +++ OK, passed 100 tests.
  12510. 1289.94 s [vector] zipWith: OK (0.02s)
  12511. 1289.94 s [vector] +++ OK, passed 100 tests.
  12512. 1289.96 s [vector] zipWith3: OK (0.02s)
  12513. 1289.96 s [vector] +++ OK, passed 100 tests.
  12514. 1289.97 s [vector] izipWith: OK (0.02s)
  12515. 1289.97 s [vector] +++ OK, passed 100 tests.
  12516. 1289.99 s [vector] izipWith3: OK
  12517. 1290.00 s [vector] +++ OK, passed 100 tests.
  12518. 1290.00 s [vector] izipWithM: OK (0.01s)
  12519. 1290.00 s [vector] +++ OK, passed 100 tests.
  12520. 1290.04 s [vector] izipWithM_: OK (0.04s)
  12521. 1290.04 s [vector] +++ OK, passed 100 tests.
  12522. 1290.06 s [vector] zipWithM: OK (0.01s)
  12523. 1290.06 s [vector] +++ OK, passed 100 tests.
  12524. 1290.09 s [vector] zipWithM_: OK (0.03s)
  12525. 1290.09 s [vector] +++ OK, passed 100 tests.
  12526. 1290.10 s [vector] filter: OK
  12527. 1290.12 s [vector] +++ OK, passed 100 tests.
  12528. 1290.12 s [vector] ifilter: OK (0.01s)
  12529. 1290.12 s [vector] +++ OK, passed 100 tests.
  12530. 1290.16 s [vector] filterM: OK (0.06s)
  12531. 1290.16 s [vector] +++ OK, passed 100 tests.
  12532. 1290.17 s [vector] uniq: OK
  12533. 1290.17 s [vector] +++ OK, passed 100 tests.
  12534. 1290.17 s [vector] mapMaybe: OK
  12535. 1290.17 s [vector] +++ OK, passed 100 tests.
  12536. 1290.18 s [vector] imapMaybe: OK
  12537. 1290.18 s [vector] +++ OK, passed 100 tests.
  12538. 1290.18 s [vector] takeWhile: OK
  12539. 1290.18 s [vector] +++ OK, passed 100 tests.
  12540. 1290.18 s [vector] dropWhile: OK
  12541. 1290.19 s [vector] +++ OK, passed 100 tests.
  12542. 1290.20 s [vector] partition: OK
  12543. 1290.20 s [vector] +++ OK, passed 100 tests.
  12544. 1290.20 s [vector] partitionWith: OK
  12545. 1290.20 s [vector] +++ OK, passed 100 tests.
  12546. 1290.21 s [vector] span: OK
  12547. 1290.21 s [vector] +++ OK, passed 100 tests.
  12548. 1290.21 s [vector] break: OK
  12549. 1290.21 s [vector] +++ OK, passed 100 tests.
  12550. 1290.21 s [vector] spanR: OK
  12551. 1290.21 s [vector] +++ OK, passed 100 tests.
  12552. 1290.21 s [vector] breakR: OK
  12553. 1290.21 s [vector] +++ OK, passed 100 tests.
  12554. 1290.22 s [vector] groupBy: OK
  12555. 1290.22 s [vector] +++ OK, passed 100 tests.
  12556. 1290.22 s [vector] elem: OK
  12557. 1290.22 s [vector] +++ OK, passed 100 tests.
  12558. 1290.22 s [vector] notElem: OK
  12559. 1290.22 s [vector] +++ OK, passed 100 tests.
  12560. 1290.22 s [vector] find: OK
  12561. 1290.22 s [vector] +++ OK, passed 100 tests.
  12562. 1290.22 s [vector] findIndex: OK
  12563. 1290.22 s [vector] +++ OK, passed 100 tests.
  12564. 1290.22 s [vector] findIndexR: OK
  12565. 1290.22 s [vector] +++ OK, passed 100 tests.
  12566. 1290.23 s [vector] findIndices: OK
  12567. 1290.23 s [vector] +++ OK, passed 100 tests.
  12568. 1290.23 s [vector] elemIndex: OK
  12569. 1290.23 s [vector] +++ OK, passed 100 tests.
  12570. 1290.23 s [vector] elemIndices: OK
  12571. 1290.24 s [vector] +++ OK, passed 100 tests.
  12572. 1290.26 s [vector] foldl: OK (0.01s)
  12573. 1290.26 s [vector] +++ OK, passed 100 tests.
  12574. 1290.26 s [vector] foldl1: OK (0.01s)
  12575. 1290.26 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12576. 1290.28 s [vector] foldl': OK
  12577. 1290.28 s [vector] +++ OK, passed 100 tests.
  12578. 1290.30 s [vector] foldl1': OK (0.02s)
  12579. 1290.30 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12580. 1290.32 s [vector] foldr: OK (0.02s)
  12581. 1290.32 s [vector] +++ OK, passed 100 tests.
  12582. 1290.34 s [vector] foldr1: OK (0.02s)
  12583. 1290.34 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12584. 1290.38 s [vector] foldr': OK (0.03s)
  12585. 1290.38 s [vector] +++ OK, passed 100 tests.
  12586. 1290.39 s [vector] foldr1': OK (0.02s)
  12587. 1290.39 s [vector] +++ OK, passed 100 tests; 12 discarded.
  12588. 1290.39 s [vector] ifoldl: OK (0.02s)
  12589. 1290.39 s [vector] +++ OK, passed 100 tests.
  12590. 1290.42 s [vector] ifoldl': OK (0.01s)
  12591. 1290.42 s [vector] +++ OK, passed 100 tests.
  12592. 1290.42 s [vector] ifoldr: OK (0.01s)
  12593. 1290.42 s [vector] +++ OK, passed 100 tests.
  12594. 1290.44 s [vector] ifoldr': OK
  12595. 1290.44 s [vector] +++ OK, passed 100 tests.
  12596. 1290.48 s [vector] ifoldM: OK (0.03s)
  12597. 1290.48 s [vector] +++ OK, passed 100 tests.
  12598. 1290.50 s [vector] ifoldM': OK (0.02s)
  12599. 1290.50 s [vector] +++ OK, passed 100 tests.
  12600. 1290.56 s [vector] ifoldM_: OK (0.05s)
  12601. 1290.56 s [vector] +++ OK, passed 100 tests.
  12602. 1290.58 s [vector] ifoldM'_: OK (0.04s)
  12603. 1290.58 s [vector] +++ OK, passed 100 tests.
  12604. 1290.58 s [vector] all: OK
  12605. 1290.58 s [vector] +++ OK, passed 100 tests.
  12606. 1290.59 s [vector] any: OK
  12607. 1290.59 s [vector] +++ OK, passed 100 tests.
  12608. 1290.59 s [vector] prescanl: OK (0.01s)
  12609. 1290.59 s [vector] +++ OK, passed 100 tests.
  12610. 1290.61 s [vector] prescanl': OK (0.01s)
  12611. 1290.61 s [vector] +++ OK, passed 100 tests.
  12612. 1290.64 s [vector] postscanl: OK
  12613. 1290.64 s [vector] +++ OK, passed 100 tests.
  12614. 1290.65 s [vector] postscanl': OK (0.02s)
  12615. 1290.65 s [vector] +++ OK, passed 100 tests.
  12616. 1290.66 s [vector] scanl: OK (0.02s)
  12617. 1290.66 s [vector] +++ OK, passed 100 tests.
  12618. 1290.67 s [vector] scanl': OK (0.02s)
  12619. 1290.67 s [vector] +++ OK, passed 100 tests.
  12620. 1290.70 s [vector] scanl1: OK (0.01s)
  12621. 1290.70 s [vector] +++ OK, passed 100 tests.
  12622. 1290.72 s [vector] scanl1': OK (0.02s)
  12623. 1290.72 s [vector] +++ OK, passed 100 tests.
  12624. 1290.74 s [vector] iscanl: OK (0.02s)
  12625. 1290.74 s [vector] +++ OK, passed 100 tests.
  12626. 1290.76 s [vector] iscanl': OK (0.02s)
  12627. 1290.76 s [vector] +++ OK, passed 100 tests.
  12628. 1290.76 s [vector] prescanr: OK (0.02s)
  12629. 1290.76 s [vector] +++ OK, passed 100 tests.
  12630. 1290.78 s [vector] prescanr': OK (0.02s)
  12631. 1290.78 s [vector] +++ OK, passed 100 tests.
  12632. 1290.81 s [vector] postscanr: OK
  12633. 1290.82 s [vector] +++ OK, passed 100 tests.
  12634. 1290.82 s [vector] postscanr': OK (0.01s)
  12635. 1290.82 s [vector] +++ OK, passed 100 tests.
  12636. 1290.83 s [vector] scanr: OK (0.01s)
  12637. 1290.83 s [vector] +++ OK, passed 100 tests.
  12638. 1290.86 s [vector] scanr': OK
  12639. 1290.87 s [vector] +++ OK, passed 100 tests.
  12640. 1290.88 s [vector] scanr1: OK (0.03s)
  12641. 1290.88 s [vector] +++ OK, passed 100 tests.
  12642. 1290.92 s [vector] scanr1': OK (0.02s)
  12643. 1290.92 s [vector] +++ OK, passed 100 tests.
  12644. 1290.94 s [vector] iscanr: OK (0.03s)
  12645. 1290.94 s [vector] +++ OK, passed 100 tests.
  12646. 1290.95 s [vector] iscanr': OK (0.02s)
  12647. 1290.95 s [vector] +++ OK, passed 100 tests.
  12648. 1290.96 s [vector] mut_read: OK
  12649. 1290.96 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12650. 1290.96 s [vector] mut_write: OK
  12651. 1290.96 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12652. 1290.96 s [vector] mut_modify: OK
  12653. 1290.96 s [vector] +++ OK, passed 100 tests; 21 discarded.
  12654. 1290.96 s [vector] mut_generate: OK
  12655. 1290.96 s [vector] +++ OK, passed 100 tests.
  12656. 1290.98 s [vector] mut_generateM: OK (0.01s)
  12657. 1290.98 s [vector] +++ OK, passed 100 tests.
  12658. 1291.04 s [vector] mut_mapM_: OK (0.05s)
  12659. 1291.04 s [vector] +++ OK, passed 100 tests.
  12660. 1291.06 s [vector] mut_imapM_: OK (0.03s)
  12661. 1291.06 s [vector] +++ OK, passed 100 tests.
  12662. 1291.10 s [vector] mut_forM_: OK (0.03s)
  12663. 1291.10 s [vector] +++ OK, passed 100 tests.
  12664. 1291.14 s [vector] mut_iforM_: OK (0.04s)
  12665. 1291.14 s [vector] +++ OK, passed 100 tests.
  12666. 1291.14 s [vector] mut_foldr: OK (0.01s)
  12667. 1291.14 s [vector] +++ OK, passed 100 tests.
  12668. 1291.16 s [vector] mut_foldr': OK (0.01s)
  12669. 1291.16 s [vector] +++ OK, passed 100 tests.
  12670. 1291.18 s [vector] mut_foldl: OK (0.01s)
  12671. 1291.18 s [vector] +++ OK, passed 100 tests.
  12672. 1291.18 s [vector] mut_foldl': OK (0.01s)
  12673. 1291.18 s [vector] +++ OK, passed 100 tests.
  12674. 1291.20 s [vector] mut_ifoldr: OK
  12675. 1291.20 s [vector] +++ OK, passed 100 tests.
  12676. 1291.22 s [vector] mut_ifoldr': OK (0.01s)
  12677. 1291.22 s [vector] +++ OK, passed 100 tests.
  12678. 1291.24 s [vector] mut_ifoldl: OK (0.02s)
  12679. 1291.24 s [vector] +++ OK, passed 100 tests.
  12680. 1291.25 s [vector] mut_ifoldl': OK (0.01s)
  12681. 1291.26 s [vector] +++ OK, passed 100 tests.
  12682. 1291.26 s [vector] mut_foldM: OK (0.01s)
  12683. 1291.27 s [vector] +++ OK, passed 100 tests.
  12684. 1291.45 s [vector] mut_foldM': OK (0.01s)
  12685. 1291.45 s [vector] +++ OK, passed 100 tests.
  12686. 1291.46 s [vector] mut_foldrM: OK
  12687. 1291.46 s [vector] +++ OK, passed 100 tests.
  12688. 1291.46 s [vector] mut_foldrM': OK (0.02s)
  12689. 1291.46 s [vector] +++ OK, passed 100 tests.
  12690. 1291.46 s [vector] mut_ifoldM: OK (0.02s)
  12691. 1291.46 s [vector] +++ OK, passed 100 tests.
  12692. 1291.46 s [vector] mut_ifoldM': OK (0.02s)
  12693. 1291.46 s [vector] +++ OK, passed 100 tests.
  12694. 1291.47 s [vector] mut_ifoldrM: OK
  12695. 1291.47 s [vector] +++ OK, passed 100 tests.
  12696. 1291.47 s [vector] mut_ifoldrM': OK (0.02s)
  12697. 1291.47 s [vector] +++ OK, passed 100 tests.
  12698. 1291.47 s [vector] compare: OK
  12699. 1291.47 s [vector] +++ OK, passed 100 tests.
  12700. 1291.47 s [vector] maximum: OK
  12701. 1291.47 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12702. 1291.47 s [vector] minimum: OK
  12703. 1291.47 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12704. 1291.47 s [vector] minIndex: OK
  12705. 1291.47 s [vector] +++ OK, passed 100 tests; 12 discarded.
  12706. 1291.47 s [vector] maxIndex: OK
  12707. 1291.47 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12708. 1291.47 s [vector] maximumBy: OK
  12709. 1291.47 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12710. 1291.47 s [vector] minimumBy: OK
  12711. 1291.47 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12712. 1291.47 s [vector] maximumOn: OK
  12713. 1291.47 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12714. 1291.47 s [vector] minimumOn: OK
  12715. 1291.47 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12716. 1291.47 s [vector] maxIndexBy: OK
  12717. 1291.47 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12718. 1291.47 s [vector] minIndexBy: OK
  12719. 1291.47 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12720. 1291.47 s [vector] ListFirstMaxIndexWins: OK
  12721. 1291.47 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12722. 1291.47 s [vector] FalseListFirstMaxIndexWins: OK
  12723. 1291.47 s [vector] +++ OK, failed as expected. (after 1 test):
  12724. 1291.47 s [vector] Exception:
  12725. 1291.47 s [vector] Prelude.foldr1: empty list
  12726. 1291.47 s [vector] CallStack (from HasCallStack):
  12727. 1291.47 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  12728. 1291.47 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  12729. 1291.47 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  12730. 1291.47 s [vector] []
  12731. 1291.47 s [vector] mempty: OK
  12732. 1291.47 s [vector] +++ OK, passed 100 tests.
  12733. 1291.47 s [vector] mappend: OK
  12734. 1291.47 s [vector] +++ OK, passed 100 tests.
  12735. 1291.47 s [vector] mconcat: OK
  12736. 1291.47 s [vector] +++ OK, passed 100 tests.
  12737. 1291.47 s [vector] glength: OK
  12738. 1291.47 s [vector] +++ OK, passed 100 tests.
  12739. 1291.47 s [vector] sum: OK
  12740. 1291.47 s [vector] +++ OK, passed 100 tests.
  12741. 1291.47 s [vector] product: OK
  12742. 1291.47 s [vector] +++ OK, passed 100 tests.
  12743. 1291.47 s [vector] enumFromN: OK
  12744. 1291.47 s [vector] +++ OK, passed 100 tests.
  12745. 1291.47 s [vector] enumFromThenN: OK
  12746. 1291.47 s [vector] +++ OK, passed 100 tests.
  12747. 1291.47 s [vector] enumFromTo: OK
  12748. 1291.47 s [vector] +++ OK, passed 100 tests.
  12749. 1291.47 s [vector] enumFromThenTo: OK
  12750. 1291.47 s [vector] +++ OK, passed 100 tests; 3 discarded.
  12751. 1291.47 s [vector] unstream
  12752. 1291.47 s [vector] unstream == vunstream (exact): OK
  12753. 1291.47 s [vector] +++ OK, passed 100 tests.
  12754. 1291.47 s [vector] unstream == vunstream (unknown): OK
  12755. 1291.47 s [vector] +++ OK, passed 100 tests.
  12756. 1291.47 s [vector] unstreamR ~= vunstream (exact): OK
  12757. 1291.47 s [vector] +++ OK, passed 100 tests.
  12758. 1291.47 s [vector] unstreamR ~= vunstream (unknown): OK
  12759. 1291.47 s [vector] +++ OK, passed 100 tests.
  12760. 1291.47 s [vector] Tests.Vector.Storable
  12761. 1291.47 s [vector] Data.Vector.Storable.Vector (Int)
  12762. 1291.47 s [vector] fromList.toList == id: OK
  12763. 1291.47 s [vector] +++ OK, passed 100 tests.
  12764. 1291.47 s [vector] toList.fromList == id: OK
  12765. 1291.47 s [vector] +++ OK, passed 100 tests.
  12766. 1291.47 s [vector] unstream.stream == id: OK
  12767. 1291.47 s [vector] +++ OK, passed 100 tests.
  12768. 1291.47 s [vector] stream.unstream == id: OK
  12769. 1291.47 s [vector] +++ OK, passed 100 tests.
  12770. 1291.47 s [vector] eq: OK
  12771. 1291.47 s [vector] +++ OK, passed 100 tests.
  12772. 1291.47 s [vector] length: OK
  12773. 1291.47 s [vector] +++ OK, passed 100 tests.
  12774. 1291.47 s [vector] null: OK
  12775. 1291.47 s [vector] +++ OK, passed 100 tests.
  12776. 1291.47 s [vector] index: OK
  12777. 1291.47 s [vector] +++ OK, passed 100 tests; 12 discarded.
  12778. 1291.47 s [vector] safeIndex: OK
  12779. 1291.47 s [vector] +++ OK, passed 100 tests.
  12780. 1291.47 s [vector] head: OK
  12781. 1291.47 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12782. 1291.47 s [vector] last: OK
  12783. 1291.47 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12784. 1291.47 s [vector] unsafeIndex: OK
  12785. 1291.47 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12786. 1291.47 s [vector] unsafeHead: OK
  12787. 1291.47 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12788. 1291.47 s [vector] unsafeLast: OK
  12789. 1291.47 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12790. 1291.47 s [vector] slice: OK
  12791. 1291.47 s [vector] +++ OK, passed 100 tests.
  12792. 1291.47 s [vector] init: OK
  12793. 1291.47 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12794. 1291.47 s [vector] tail: OK
  12795. 1291.47 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12796. 1291.47 s [vector] take: OK
  12797. 1291.47 s [vector] +++ OK, passed 100 tests.
  12798. 1291.47 s [vector] drop: OK
  12799. 1291.47 s [vector] +++ OK, passed 100 tests.
  12800. 1291.47 s [vector] splitAt: OK
  12801. 1291.47 s [vector] +++ OK, passed 100 tests.
  12802. 1291.47 s [vector] empty: OK
  12803. 1291.47 s [vector] +++ OK, passed 100 tests.
  12804. 1291.47 s [vector] singleton: OK
  12805. 1291.47 s [vector] +++ OK, passed 100 tests.
  12806. 1291.47 s [vector] replicate: OK
  12807. 1291.47 s [vector] +++ OK, passed 100 tests.
  12808. 1291.47 s [vector] generate: OK
  12809. 1291.47 s [vector] +++ OK, passed 100 tests.
  12810. 1291.47 s [vector] iterateN: OK
  12811. 1291.47 s [vector] +++ OK, passed 100 tests.
  12812. 1291.47 s [vector] iterateNM: OK (0.03s)
  12813. 1291.47 s [vector] +++ OK, passed 100 tests.
  12814. 1291.48 s [vector] generateM: OK (0.02s)
  12815. 1291.48 s [vector] +++ OK, passed 100 tests.
  12816. 1291.50 s [vector] replicateM: OK (0.02s)
  12817. 1291.50 s [vector] +++ OK, passed 100 tests.
  12818. 1291.51 s [vector] create: OK
  12819. 1291.51 s [vector] +++ OK, passed 100 tests.
  12820. 1291.51 s [vector] createT: OK
  12821. 1291.51 s [vector] +++ OK, passed 100 tests.
  12822. 1291.52 s [vector] unfoldr: OK
  12823. 1291.52 s [vector] +++ OK, passed 100 tests.
  12824. 1291.52 s [vector] unfoldrN: OK
  12825. 1291.52 s [vector] +++ OK, passed 100 tests.
  12826. 1291.53 s [vector] unfoldrExactN: OK
  12827. 1291.53 s [vector] +++ OK, passed 100 tests.
  12828. 1291.54 s [vector] unfoldrM: OK
  12829. 1291.54 s [vector] +++ OK, passed 100 tests.
  12830. 1291.56 s [vector] unfoldrNM: OK
  12831. 1291.56 s [vector] +++ OK, passed 100 tests.
  12832. 1291.59 s [vector] unfoldrExactNM: OK (0.05s)
  12833. 1291.60 s [vector] +++ OK, passed 100 tests.
  12834. 1291.60 s [vector] constructN: OK
  12835. 1291.60 s [vector] +++ OK, passed 100 tests.
  12836. 1291.60 s [vector] constructrN: OK
  12837. 1291.60 s [vector] +++ OK, passed 100 tests.
  12838. 1291.60 s [vector] cons: OK
  12839. 1291.60 s [vector] +++ OK, passed 100 tests.
  12840. 1291.60 s [vector] snoc: OK
  12841. 1291.60 s [vector] +++ OK, passed 100 tests.
  12842. 1291.61 s [vector] append: OK
  12843. 1291.61 s [vector] +++ OK, passed 100 tests.
  12844. 1291.61 s [vector] concat: OK (0.01s)
  12845. 1291.62 s [vector] +++ OK, passed 100 tests.
  12846. 1291.62 s [vector] force: OK
  12847. 1291.62 s [vector] +++ OK, passed 100 tests.
  12848. 1291.62 s [vector] upd: OK
  12849. 1291.62 s [vector] +++ OK, passed 100 tests.
  12850. 1291.62 s [vector] accum: OK
  12851. 1291.62 s [vector] +++ OK, passed 100 tests.
  12852. 1291.62 s [vector] reverse: OK
  12853. 1291.62 s [vector] +++ OK, passed 100 tests.
  12854. 1291.62 s [vector] backpermute: OK
  12855. 1291.62 s [vector] +++ OK, passed 100 tests.
  12856. 1291.63 s [vector] map: OK
  12857. 1291.63 s [vector] +++ OK, passed 100 tests.
  12858. 1291.63 s [vector] imap: OK
  12859. 1291.63 s [vector] +++ OK, passed 100 tests.
  12860. 1291.63 s [vector] concatMap: OK
  12861. 1291.63 s [vector] +++ OK, passed 100 tests.
  12862. 1291.63 s [vector] mapM: OK
  12863. 1291.63 s [vector] +++ OK, passed 100 tests.
  12864. 1291.65 s [vector] mapM_: OK (0.01s)
  12865. 1291.65 s [vector] +++ OK, passed 100 tests.
  12866. 1291.65 s [vector] forM: OK
  12867. 1291.65 s [vector] +++ OK, passed 100 tests.
  12868. 1291.67 s [vector] forM_: OK
  12869. 1291.67 s [vector] +++ OK, passed 100 tests.
  12870. 1291.67 s [vector] imapM: OK
  12871. 1291.67 s [vector] +++ OK, passed 100 tests.
  12872. 1291.69 s [vector] imapM_: OK
  12873. 1291.69 s [vector] +++ OK, passed 100 tests.
  12874. 1291.69 s [vector] zipWith: OK
  12875. 1291.69 s [vector] +++ OK, passed 100 tests.
  12876. 1291.70 s [vector] zipWith3: OK
  12877. 1291.70 s [vector] +++ OK, passed 100 tests.
  12878. 1291.70 s [vector] izipWith: OK
  12879. 1291.70 s [vector] +++ OK, passed 100 tests.
  12880. 1291.70 s [vector] izipWith3: OK
  12881. 1291.70 s [vector] +++ OK, passed 100 tests.
  12882. 1291.70 s [vector] izipWithM: OK
  12883. 1291.70 s [vector] +++ OK, passed 100 tests.
  12884. 1291.71 s [vector] izipWithM_: OK (0.01s)
  12885. 1291.71 s [vector] +++ OK, passed 100 tests.
  12886. 1291.71 s [vector] zipWithM: OK
  12887. 1291.72 s [vector] +++ OK, passed 100 tests.
  12888. 1291.73 s [vector] zipWithM_: OK (0.01s)
  12889. 1291.73 s [vector] +++ OK, passed 100 tests.
  12890. 1291.73 s [vector] filter: OK
  12891. 1291.73 s [vector] +++ OK, passed 100 tests.
  12892. 1291.73 s [vector] ifilter: OK
  12893. 1291.74 s [vector] +++ OK, passed 100 tests.
  12894. 1291.76 s [vector] filterM: OK (0.03s)
  12895. 1291.76 s [vector] +++ OK, passed 100 tests.
  12896. 1291.76 s [vector] uniq: OK
  12897. 1291.76 s [vector] +++ OK, passed 100 tests.
  12898. 1291.76 s [vector] mapMaybe: OK
  12899. 1291.76 s [vector] +++ OK, passed 100 tests.
  12900. 1291.77 s [vector] imapMaybe: OK
  12901. 1291.77 s [vector] +++ OK, passed 100 tests.
  12902. 1291.77 s [vector] takeWhile: OK
  12903. 1291.77 s [vector] +++ OK, passed 100 tests.
  12904. 1291.77 s [vector] dropWhile: OK
  12905. 1291.77 s [vector] +++ OK, passed 100 tests.
  12906. 1291.77 s [vector] partition: OK
  12907. 1291.77 s [vector] +++ OK, passed 100 tests.
  12908. 1291.77 s [vector] partitionWith: OK
  12909. 1291.77 s [vector] +++ OK, passed 100 tests.
  12910. 1291.77 s [vector] span: OK
  12911. 1291.77 s [vector] +++ OK, passed 100 tests.
  12912. 1291.77 s [vector] break: OK
  12913. 1291.77 s [vector] +++ OK, passed 100 tests.
  12914. 1291.78 s [vector] spanR: OK
  12915. 1291.78 s [vector] +++ OK, passed 100 tests.
  12916. 1291.78 s [vector] breakR: OK
  12917. 1291.78 s [vector] +++ OK, passed 100 tests.
  12918. 1291.78 s [vector] groupBy: OK
  12919. 1291.78 s [vector] +++ OK, passed 100 tests.
  12920. 1291.78 s [vector] elem: OK
  12921. 1291.78 s [vector] +++ OK, passed 100 tests.
  12922. 1291.78 s [vector] notElem: OK
  12923. 1291.78 s [vector] +++ OK, passed 100 tests.
  12924. 1291.78 s [vector] find: OK
  12925. 1291.78 s [vector] +++ OK, passed 100 tests.
  12926. 1291.78 s [vector] findIndex: OK
  12927. 1291.78 s [vector] +++ OK, passed 100 tests.
  12928. 1291.78 s [vector] findIndexR: OK
  12929. 1291.78 s [vector] +++ OK, passed 100 tests.
  12930. 1291.78 s [vector] findIndices: OK
  12931. 1291.78 s [vector] +++ OK, passed 100 tests.
  12932. 1291.78 s [vector] elemIndex: OK
  12933. 1291.78 s [vector] +++ OK, passed 100 tests.
  12934. 1291.79 s [vector] elemIndices: OK
  12935. 1291.79 s [vector] +++ OK, passed 100 tests.
  12936. 1291.79 s [vector] foldl: OK
  12937. 1291.79 s [vector] +++ OK, passed 100 tests.
  12938. 1291.79 s [vector] foldl1: OK
  12939. 1291.80 s [vector] +++ OK, passed 100 tests; 12 discarded.
  12940. 1291.80 s [vector] foldl': OK
  12941. 1291.80 s [vector] +++ OK, passed 100 tests.
  12942. 1291.80 s [vector] foldl1': OK
  12943. 1291.80 s [vector] +++ OK, passed 100 tests; 21 discarded.
  12944. 1291.80 s [vector] foldr: OK
  12945. 1291.80 s [vector] +++ OK, passed 100 tests.
  12946. 1291.81 s [vector] foldr1: OK
  12947. 1291.81 s [vector] +++ OK, passed 100 tests; 24 discarded.
  12948. 1291.81 s [vector] foldr': OK
  12949. 1291.81 s [vector] +++ OK, passed 100 tests.
  12950. 1291.81 s [vector] foldr1': OK
  12951. 1291.81 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12952. 1291.81 s [vector] ifoldl: OK
  12953. 1291.81 s [vector] +++ OK, passed 100 tests.
  12954. 1291.81 s [vector] ifoldl': OK
  12955. 1291.82 s [vector] +++ OK, passed 100 tests.
  12956. 1291.82 s [vector] ifoldr: OK
  12957. 1291.82 s [vector] +++ OK, passed 100 tests.
  12958. 1291.82 s [vector] ifoldr': OK
  12959. 1291.82 s [vector] +++ OK, passed 100 tests.
  12960. 1291.82 s [vector] ifoldM: OK
  12961. 1291.82 s [vector] +++ OK, passed 100 tests.
  12962. 1291.82 s [vector] ifoldM': OK
  12963. 1291.84 s [vector] +++ OK, passed 100 tests.
  12964. 1291.85 s [vector] ifoldM_: OK (0.02s)
  12965. 1291.85 s [vector] +++ OK, passed 100 tests.
  12966. 1291.85 s [vector] ifoldM'_: OK (0.01s)
  12967. 1291.85 s [vector] +++ OK, passed 100 tests.
  12968. 1291.85 s [vector] all: OK
  12969. 1291.85 s [vector] +++ OK, passed 100 tests.
  12970. 1291.85 s [vector] any: OK
  12971. 1291.85 s [vector] +++ OK, passed 100 tests.
  12972. 1291.86 s [vector] prescanl: OK
  12973. 1291.86 s [vector] +++ OK, passed 100 tests.
  12974. 1291.86 s [vector] prescanl': OK
  12975. 1291.86 s [vector] +++ OK, passed 100 tests.
  12976. 1291.87 s [vector] postscanl: OK
  12977. 1291.88 s [vector] +++ OK, passed 100 tests.
  12978. 1291.88 s [vector] postscanl': OK (0.01s)
  12979. 1291.88 s [vector] +++ OK, passed 100 tests.
  12980. 1291.88 s [vector] scanl: OK
  12981. 1291.88 s [vector] +++ OK, passed 100 tests.
  12982. 1291.88 s [vector] scanl': OK
  12983. 1291.88 s [vector] +++ OK, passed 100 tests.
  12984. 1291.88 s [vector] scanl1: OK
  12985. 1291.89 s [vector] +++ OK, passed 100 tests.
  12986. 1291.89 s [vector] scanl1': OK
  12987. 1291.89 s [vector] +++ OK, passed 100 tests.
  12988. 1291.89 s [vector] iscanl: OK
  12989. 1291.89 s [vector] +++ OK, passed 100 tests.
  12990. 1291.89 s [vector] iscanl': OK
  12991. 1291.89 s [vector] +++ OK, passed 100 tests.
  12992. 1291.90 s [vector] prescanr: OK
  12993. 1291.90 s [vector] +++ OK, passed 100 tests.
  12994. 1291.90 s [vector] prescanr': OK
  12995. 1291.90 s [vector] +++ OK, passed 100 tests.
  12996. 1291.90 s [vector] postscanr: OK
  12997. 1291.90 s [vector] +++ OK, passed 100 tests.
  12998. 1291.90 s [vector] postscanr': OK
  12999. 1291.90 s [vector] +++ OK, passed 100 tests.
  13000. 1291.91 s [vector] scanr: OK
  13001. 1291.91 s [vector] +++ OK, passed 100 tests.
  13002. 1291.92 s [vector] scanr': OK
  13003. 1291.92 s [vector] +++ OK, passed 100 tests.
  13004. 1291.92 s [vector] scanr1: OK
  13005. 1291.92 s [vector] +++ OK, passed 100 tests.
  13006. 1291.92 s [vector] scanr1': OK
  13007. 1291.92 s [vector] +++ OK, passed 100 tests.
  13008. 1291.92 s [vector] iscanr: OK
  13009. 1291.92 s [vector] +++ OK, passed 100 tests.
  13010. 1291.92 s [vector] iscanr': OK
  13011. 1291.92 s [vector] +++ OK, passed 100 tests.
  13012. 1291.92 s [vector] mut_read: OK
  13013. 1291.92 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13014. 1291.92 s [vector] mut_write: OK
  13015. 1291.92 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13016. 1291.92 s [vector] mut_modify: OK
  13017. 1291.92 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13018. 1291.92 s [vector] mut_generate: OK
  13019. 1291.92 s [vector] +++ OK, passed 100 tests.
  13020. 1291.93 s [vector] mut_generateM: OK
  13021. 1291.93 s [vector] +++ OK, passed 100 tests.
  13022. 1291.94 s [vector] mut_mapM_: OK
  13023. 1291.94 s [vector] +++ OK, passed 100 tests.
  13024. 1291.95 s [vector] mut_imapM_: OK
  13025. 1291.95 s [vector] +++ OK, passed 100 tests.
  13026. 1291.97 s [vector] mut_forM_: OK (0.01s)
  13027. 1291.97 s [vector] +++ OK, passed 100 tests.
  13028. 1291.98 s [vector] mut_iforM_: OK
  13029. 1291.99 s [vector] +++ OK, passed 100 tests.
  13030. 1291.99 s [vector] mut_foldr: OK
  13031. 1291.99 s [vector] +++ OK, passed 100 tests.
  13032. 1291.99 s [vector] mut_foldr': OK
  13033. 1291.99 s [vector] +++ OK, passed 100 tests.
  13034. 1291.99 s [vector] mut_foldl: OK
  13035. 1291.99 s [vector] +++ OK, passed 100 tests.
  13036. 1291.99 s [vector] mut_foldl': OK
  13037. 1292.00 s [vector] +++ OK, passed 100 tests.
  13038. 1292.00 s [vector] mut_ifoldr: OK
  13039. 1292.00 s [vector] +++ OK, passed 100 tests.
  13040. 1292.00 s [vector] mut_ifoldr': OK
  13041. 1292.00 s [vector] +++ OK, passed 100 tests.
  13042. 1292.00 s [vector] mut_ifoldl: OK
  13043. 1292.00 s [vector] +++ OK, passed 100 tests.
  13044. 1292.00 s [vector] mut_ifoldl': OK
  13045. 1292.01 s [vector] +++ OK, passed 100 tests.
  13046. 1292.01 s [vector] mut_foldM: OK
  13047. 1292.01 s [vector] +++ OK, passed 100 tests.
  13048. 1292.01 s [vector] mut_foldM': OK
  13049. 1292.01 s [vector] +++ OK, passed 100 tests.
  13050. 1292.01 s [vector] mut_foldrM: OK
  13051. 1292.01 s [vector] +++ OK, passed 100 tests.
  13052. 1292.02 s [vector] mut_foldrM': OK
  13053. 1292.02 s [vector] +++ OK, passed 100 tests.
  13054. 1292.02 s [vector] mut_ifoldM: OK
  13055. 1292.02 s [vector] +++ OK, passed 100 tests.
  13056. 1292.02 s [vector] mut_ifoldM': OK
  13057. 1292.02 s [vector] +++ OK, passed 100 tests.
  13058. 1292.02 s [vector] mut_ifoldrM: OK
  13059. 1292.03 s [vector] +++ OK, passed 100 tests.
  13060. 1292.03 s [vector] mut_ifoldrM': OK
  13061. 1292.03 s [vector] +++ OK, passed 100 tests.
  13062. 1292.03 s [vector] compare: OK
  13063. 1292.03 s [vector] +++ OK, passed 100 tests.
  13064. 1292.03 s [vector] maximum: OK
  13065. 1292.03 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13066. 1292.03 s [vector] minimum: OK
  13067. 1292.03 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13068. 1292.03 s [vector] minIndex: OK
  13069. 1292.03 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13070. 1292.04 s [vector] maxIndex: OK
  13071. 1292.04 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13072. 1292.04 s [vector] maximumBy: OK
  13073. 1292.04 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13074. 1292.04 s [vector] minimumBy: OK
  13075. 1292.04 s [vector] +++ OK, passed 100 tests; 21 discarded.
  13076. 1292.04 s [vector] maximumOn: OK
  13077. 1292.04 s [vector] +++ OK, passed 100 tests; 12 discarded.
  13078. 1292.04 s [vector] minimumOn: OK
  13079. 1292.04 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13080. 1292.04 s [vector] maxIndexBy: OK
  13081. 1292.04 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13082. 1292.04 s [vector] minIndexBy: OK
  13083. 1292.04 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13084. 1292.04 s [vector] ListFirstMaxIndexWins: OK
  13085. 1292.04 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13086. 1292.04 s [vector] FalseListFirstMaxIndexWins: OK
  13087. 1292.04 s [vector] +++ OK, failed as expected. (after 1 test):
  13088. 1292.04 s [vector] Exception:
  13089. 1292.04 s [vector] Prelude.foldr1: empty list
  13090. 1292.04 s [vector] CallStack (from HasCallStack):
  13091. 1292.04 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  13092. 1292.04 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  13093. 1292.04 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  13094. 1292.04 s [vector] []
  13095. 1292.04 s [vector] mempty: OK
  13096. 1292.04 s [vector] +++ OK, passed 100 tests.
  13097. 1292.04 s [vector] mappend: OK
  13098. 1292.05 s [vector] +++ OK, passed 100 tests.
  13099. 1292.06 s [vector] mconcat: OK (0.01s)
  13100. 1292.06 s [vector] +++ OK, passed 100 tests.
  13101. 1292.06 s [vector] glength: OK
  13102. 1292.06 s [vector] +++ OK, passed 100 tests.
  13103. 1292.06 s [vector] sum: OK
  13104. 1292.07 s [vector] +++ OK, passed 100 tests.
  13105. 1292.07 s [vector] product: OK
  13106. 1292.07 s [vector] +++ OK, passed 100 tests.
  13107. 1292.07 s [vector] enumFromN: OK
  13108. 1292.08 s [vector] +++ OK, passed 100 tests.
  13109. 1292.08 s [vector] enumFromThenN: OK
  13110. 1292.08 s [vector] +++ OK, passed 100 tests.
  13111. 1292.08 s [vector] enumFromTo: OK
  13112. 1292.08 s [vector] +++ OK, passed 100 tests.
  13113. 1292.09 s [vector] enumFromThenTo: OK
  13114. 1292.09 s [vector] +++ OK, passed 100 tests; 11 discarded.
  13115. 1292.09 s [vector] Data.Vector.Storable.Vector (Double)
  13116. 1292.09 s [vector] fromList.toList == id: OK
  13117. 1292.09 s [vector] +++ OK, passed 100 tests.
  13118. 1292.09 s [vector] toList.fromList == id: OK
  13119. 1292.09 s [vector] +++ OK, passed 100 tests.
  13120. 1292.10 s [vector] unstream.stream == id: OK
  13121. 1292.10 s [vector] +++ OK, passed 100 tests.
  13122. 1292.10 s [vector] stream.unstream == id: OK
  13123. 1292.10 s [vector] +++ OK, passed 100 tests.
  13124. 1292.10 s [vector] eq: OK
  13125. 1292.10 s [vector] +++ OK, passed 100 tests.
  13126. 1292.10 s [vector] length: OK
  13127. 1292.10 s [vector] +++ OK, passed 100 tests.
  13128. 1292.10 s [vector] null: OK
  13129. 1292.10 s [vector] +++ OK, passed 100 tests.
  13130. 1292.10 s [vector] index: OK
  13131. 1292.10 s [vector] +++ OK, passed 100 tests; 21 discarded.
  13132. 1292.10 s [vector] safeIndex: OK
  13133. 1292.10 s [vector] +++ OK, passed 100 tests.
  13134. 1292.10 s [vector] head: OK
  13135. 1292.10 s [vector] +++ OK, passed 100 tests; 19 discarded.
  13136. 1292.10 s [vector] last: OK
  13137. 1292.10 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13138. 1292.10 s [vector] unsafeIndex: OK
  13139. 1292.10 s [vector] +++ OK, passed 100 tests; 23 discarded.
  13140. 1292.10 s [vector] unsafeHead: OK
  13141. 1292.10 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13142. 1292.11 s [vector] unsafeLast: OK
  13143. 1292.11 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13144. 1292.11 s [vector] slice: OK
  13145. 1292.11 s [vector] +++ OK, passed 100 tests.
  13146. 1292.11 s [vector] init: OK
  13147. 1292.11 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13148. 1292.11 s [vector] tail: OK
  13149. 1292.11 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13150. 1292.11 s [vector] take: OK
  13151. 1292.11 s [vector] +++ OK, passed 100 tests.
  13152. 1292.11 s [vector] drop: OK
  13153. 1292.11 s [vector] +++ OK, passed 100 tests.
  13154. 1292.11 s [vector] splitAt: OK
  13155. 1292.11 s [vector] +++ OK, passed 100 tests.
  13156. 1292.11 s [vector] empty: OK
  13157. 1292.11 s [vector] +++ OK, passed 100 tests.
  13158. 1292.11 s [vector] singleton: OK
  13159. 1292.11 s [vector] +++ OK, passed 100 tests.
  13160. 1292.11 s [vector] replicate: OK
  13161. 1292.11 s [vector] +++ OK, passed 100 tests.
  13162. 1292.12 s [vector] generate: OK
  13163. 1292.12 s [vector] +++ OK, passed 100 tests.
  13164. 1292.12 s [vector] iterateN: OK
  13165. 1292.12 s [vector] +++ OK, passed 100 tests.
  13166. 1292.18 s [vector] iterateNM: OK (0.05s)
  13167. 1292.18 s [vector] +++ OK, passed 100 tests.
  13168. 1292.20 s [vector] generateM: OK (0.02s)
  13169. 1292.20 s [vector] +++ OK, passed 100 tests.
  13170. 1292.20 s [vector] replicateM: OK
  13171. 1292.20 s [vector] +++ OK, passed 100 tests.
  13172. 1292.21 s [vector] create: OK
  13173. 1292.21 s [vector] +++ OK, passed 100 tests.
  13174. 1292.21 s [vector] createT: OK
  13175. 1292.21 s [vector] +++ OK, passed 100 tests.
  13176. 1292.21 s [vector] unfoldr: OK
  13177. 1292.21 s [vector] +++ OK, passed 100 tests.
  13178. 1292.21 s [vector] unfoldrN: OK
  13179. 1292.21 s [vector] +++ OK, passed 100 tests.
  13180. 1292.21 s [vector] unfoldrExactN: OK
  13181. 1292.21 s [vector] +++ OK, passed 100 tests.
  13182. 1292.21 s [vector] unfoldrM: OK
  13183. 1292.21 s [vector] +++ OK, passed 100 tests.
  13184. 1292.22 s [vector] unfoldrNM: OK
  13185. 1292.22 s [vector] +++ OK, passed 100 tests.
  13186. 1292.26 s [vector] unfoldrExactNM: OK (0.03s)
  13187. 1292.26 s [vector] +++ OK, passed 100 tests.
  13188. 1292.27 s [vector] constructN: OK (0.02s)
  13189. 1292.27 s [vector] +++ OK, passed 100 tests.
  13190. 1292.28 s [vector] constructrN: OK
  13191. 1292.28 s [vector] +++ OK, passed 100 tests.
  13192. 1292.28 s [vector] cons: OK
  13193. 1292.28 s [vector] +++ OK, passed 100 tests.
  13194. 1292.28 s [vector] snoc: OK
  13195. 1292.30 s [vector] +++ OK, passed 100 tests.
  13196. 1292.30 s [vector] append: OK
  13197. 1292.30 s [vector] +++ OK, passed 100 tests.
  13198. 1292.31 s [vector] concat: OK (0.02s)
  13199. 1292.31 s [vector] +++ OK, passed 100 tests.
  13200. 1292.31 s [vector] force: OK
  13201. 1292.31 s [vector] +++ OK, passed 100 tests.
  13202. 1292.31 s [vector] upd: OK
  13203. 1292.31 s [vector] +++ OK, passed 100 tests.
  13204. 1292.32 s [vector] accum: OK
  13205. 1292.32 s [vector] +++ OK, passed 100 tests.
  13206. 1292.33 s [vector] reverse: OK
  13207. 1292.34 s [vector] +++ OK, passed 100 tests.
  13208. 1292.34 s [vector] backpermute: OK
  13209. 1292.34 s [vector] +++ OK, passed 100 tests.
  13210. 1292.34 s [vector] map: OK
  13211. 1292.34 s [vector] +++ OK, passed 100 tests.
  13212. 1292.34 s [vector] imap: OK
  13213. 1292.34 s [vector] +++ OK, passed 100 tests.
  13214. 1292.35 s [vector] concatMap: OK
  13215. 1292.35 s [vector] +++ OK, passed 100 tests.
  13216. 1292.38 s [vector] mapM: OK (0.01s)
  13217. 1292.38 s [vector] +++ OK, passed 100 tests.
  13218. 1292.41 s [vector] mapM_: OK (0.04s)
  13219. 1292.42 s [vector] +++ OK, passed 100 tests.
  13220. 1292.42 s [vector] forM: OK
  13221. 1292.42 s [vector] +++ OK, passed 100 tests.
  13222. 1292.46 s [vector] forM_: OK (0.04s)
  13223. 1292.46 s [vector] +++ OK, passed 100 tests.
  13224. 1292.46 s [vector] imapM: OK
  13225. 1292.46 s [vector] +++ OK, passed 100 tests.
  13226. 1292.50 s [vector] imapM_: OK (0.02s)
  13227. 1292.50 s [vector] +++ OK, passed 100 tests.
  13228. 1292.52 s [vector] zipWith: OK (0.01s)
  13229. 1292.52 s [vector] +++ OK, passed 100 tests.
  13230. 1292.53 s [vector] zipWith3: OK (0.01s)
  13231. 1292.54 s [vector] +++ OK, passed 100 tests.
  13232. 1292.54 s [vector] izipWith: OK (0.01s)
  13233. 1292.54 s [vector] +++ OK, passed 100 tests.
  13234. 1292.56 s [vector] izipWith3: OK (0.01s)
  13235. 1292.56 s [vector] +++ OK, passed 100 tests.
  13236. 1292.56 s [vector] izipWithM: OK (0.01s)
  13237. 1292.56 s [vector] +++ OK, passed 100 tests.
  13238. 1292.59 s [vector] izipWithM_: OK (0.01s)
  13239. 1292.59 s [vector] +++ OK, passed 100 tests.
  13240. 1292.62 s [vector] zipWithM: OK (0.02s)
  13241. 1292.62 s [vector] +++ OK, passed 100 tests.
  13242. 1292.72 s [vector] zipWithM_: OK (0.09s)
  13243. 1292.72 s [vector] +++ OK, passed 100 tests.
  13244. 1292.72 s [vector] filter: OK (0.02s)
  13245. 1292.72 s [vector] +++ OK, passed 100 tests.
  13246. 1292.74 s [vector] ifilter: OK
  13247. 1292.74 s [vector] +++ OK, passed 100 tests.
  13248. 1292.80 s [vector] filterM: OK (0.06s)
  13249. 1292.80 s [vector] +++ OK, passed 100 tests.
  13250. 1292.80 s [vector] uniq: OK
  13251. 1292.80 s [vector] +++ OK, passed 100 tests.
  13252. 1292.82 s [vector] mapMaybe: OK
  13253. 1292.82 s [vector] +++ OK, passed 100 tests.
  13254. 1292.82 s [vector] imapMaybe: OK (0.01s)
  13255. 1292.82 s [vector] +++ OK, passed 100 tests.
  13256. 1292.83 s [vector] takeWhile: OK
  13257. 1292.83 s [vector] +++ OK, passed 100 tests.
  13258. 1292.83 s [vector] dropWhile: OK
  13259. 1292.84 s [vector] +++ OK, passed 100 tests.
  13260. 1292.84 s [vector] partition: OK
  13261. 1292.84 s [vector] +++ OK, passed 100 tests.
  13262. 1292.84 s [vector] partitionWith: OK
  13263. 1292.84 s [vector] +++ OK, passed 100 tests.
  13264. 1292.85 s [vector] span: OK
  13265. 1292.85 s [vector] +++ OK, passed 100 tests.
  13266. 1292.86 s [vector] break: OK
  13267. 1292.86 s [vector] +++ OK, passed 100 tests.
  13268. 1292.86 s [vector] spanR: OK
  13269. 1292.86 s [vector] +++ OK, passed 100 tests.
  13270. 1292.86 s [vector] breakR: OK
  13271. 1292.86 s [vector] +++ OK, passed 100 tests.
  13272. 1292.86 s [vector] groupBy: OK
  13273. 1292.86 s [vector] +++ OK, passed 100 tests.
  13274. 1292.86 s [vector] elem: OK
  13275. 1292.86 s [vector] +++ OK, passed 100 tests.
  13276. 1292.86 s [vector] notElem: OK
  13277. 1292.86 s [vector] +++ OK, passed 100 tests.
  13278. 1292.86 s [vector] find: OK
  13279. 1292.86 s [vector] +++ OK, passed 100 tests.
  13280. 1292.86 s [vector] findIndex: OK
  13281. 1292.86 s [vector] +++ OK, passed 100 tests.
  13282. 1292.86 s [vector] findIndexR: OK
  13283. 1292.86 s [vector] +++ OK, passed 100 tests.
  13284. 1292.88 s [vector] findIndices: OK
  13285. 1292.88 s [vector] +++ OK, passed 100 tests.
  13286. 1292.88 s [vector] elemIndex: OK
  13287. 1292.88 s [vector] +++ OK, passed 100 tests.
  13288. 1292.88 s [vector] elemIndices: OK
  13289. 1292.89 s [vector] +++ OK, passed 100 tests.
  13290. 1292.90 s [vector] foldl: OK (0.01s)
  13291. 1292.90 s [vector] +++ OK, passed 100 tests.
  13292. 1292.91 s [vector] foldl1: OK (0.01s)
  13293. 1292.91 s [vector] +++ OK, passed 100 tests; 22 discarded.
  13294. 1292.94 s [vector] foldl': OK (0.02s)
  13295. 1292.94 s [vector] +++ OK, passed 100 tests.
  13296. 1292.96 s [vector] foldl1': OK (0.01s)
  13297. 1292.96 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13298. 1292.97 s [vector] foldr: OK (0.01s)
  13299. 1292.98 s [vector] +++ OK, passed 100 tests.
  13300. 1292.98 s [vector] foldr1: OK (0.01s)
  13301. 1292.98 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13302. 1292.98 s [vector] foldr': OK (0.01s)
  13303. 1292.98 s [vector] +++ OK, passed 100 tests.
  13304. 1293.01 s [vector] foldr1': OK
  13305. 1293.02 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13306. 1293.02 s [vector] ifoldl: OK (0.02s)
  13307. 1293.02 s [vector] +++ OK, passed 100 tests.
  13308. 1293.04 s [vector] ifoldl': OK (0.02s)
  13309. 1293.04 s [vector] +++ OK, passed 100 tests.
  13310. 1293.06 s [vector] ifoldr: OK (0.02s)
  13311. 1293.06 s [vector] +++ OK, passed 100 tests.
  13312. 1293.08 s [vector] ifoldr': OK (0.01s)
  13313. 1293.08 s [vector] +++ OK, passed 100 tests.
  13314. 1293.10 s [vector] ifoldM: OK (0.02s)
  13315. 1293.10 s [vector] +++ OK, passed 100 tests.
  13316. 1293.12 s [vector] ifoldM': OK (0.02s)
  13317. 1293.12 s [vector] +++ OK, passed 100 tests.
  13318. 1293.14 s [vector] ifoldM_: OK (0.04s)
  13319. 1293.14 s [vector] +++ OK, passed 100 tests.
  13320. 1293.17 s [vector] ifoldM'_: OK (0.04s)
  13321. 1293.18 s [vector] +++ OK, passed 100 tests.
  13322. 1293.18 s [vector] all: OK
  13323. 1293.18 s [vector] +++ OK, passed 100 tests.
  13324. 1293.19 s [vector] any: OK
  13325. 1293.19 s [vector] +++ OK, passed 100 tests.
  13326. 1293.20 s [vector] prescanl: OK (0.01s)
  13327. 1293.20 s [vector] +++ OK, passed 100 tests.
  13328. 1293.22 s [vector] prescanl': OK (0.01s)
  13329. 1293.22 s [vector] +++ OK, passed 100 tests.
  13330. 1293.22 s [vector] postscanl: OK (0.01s)
  13331. 1293.22 s [vector] +++ OK, passed 100 tests.
  13332. 1293.24 s [vector] postscanl': OK
  13333. 1293.24 s [vector] +++ OK, passed 100 tests.
  13334. 1293.26 s [vector] scanl: OK (0.01s)
  13335. 1293.26 s [vector] +++ OK, passed 100 tests.
  13336. 1293.26 s [vector] scanl': OK (0.01s)
  13337. 1293.27 s [vector] +++ OK, passed 100 tests.
  13338. 1293.28 s [vector] scanl1: OK (0.01s)
  13339. 1293.28 s [vector] +++ OK, passed 100 tests.
  13340. 1293.29 s [vector] scanl1': OK (0.01s)
  13341. 1293.29 s [vector] +++ OK, passed 100 tests.
  13342. 1293.29 s [vector] iscanl: OK (0.01s)
  13343. 1293.29 s [vector] +++ OK, passed 100 tests.
  13344. 1293.32 s [vector] iscanl': OK (0.01s)
  13345. 1293.32 s [vector] +++ OK, passed 100 tests.
  13346. 1293.34 s [vector] prescanr: OK (0.02s)
  13347. 1293.34 s [vector] +++ OK, passed 100 tests.
  13348. 1293.35 s [vector] prescanr': OK (0.02s)
  13349. 1293.36 s [vector] +++ OK, passed 100 tests.
  13350. 1293.36 s [vector] postscanr: OK (0.01s)
  13351. 1293.36 s [vector] +++ OK, passed 100 tests.
  13352. 1293.37 s [vector] postscanr': OK (0.01s)
  13353. 1293.37 s [vector] +++ OK, passed 100 tests.
  13354. 1293.38 s [vector] scanr: OK
  13355. 1293.38 s [vector] +++ OK, passed 100 tests.
  13356. 1293.40 s [vector] scanr': OK
  13357. 1293.40 s [vector] +++ OK, passed 100 tests.
  13358. 1293.42 s [vector] scanr1: OK (0.01s)
  13359. 1293.42 s [vector] +++ OK, passed 100 tests.
  13360. 1293.43 s [vector] scanr1': OK (0.02s)
  13361. 1293.43 s [vector] +++ OK, passed 100 tests.
  13362. 1293.46 s [vector] iscanr: OK
  13363. 1293.46 s [vector] +++ OK, passed 100 tests.
  13364. 1293.46 s [vector] iscanr': OK (0.02s)
  13365. 1293.47 s [vector] +++ OK, passed 100 tests.
  13366. 1293.47 s [vector] mut_read: OK
  13367. 1293.47 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13368. 1293.47 s [vector] mut_write: OK
  13369. 1293.47 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13370. 1293.47 s [vector] mut_modify: OK
  13371. 1293.47 s [vector] +++ OK, passed 100 tests; 19 discarded.
  13372. 1293.48 s [vector] mut_generate: OK
  13373. 1293.48 s [vector] +++ OK, passed 100 tests.
  13374. 1293.50 s [vector] mut_generateM: OK (0.02s)
  13375. 1293.50 s [vector] +++ OK, passed 100 tests.
  13376. 1293.53 s [vector] mut_mapM_: OK (0.04s)
  13377. 1293.53 s [vector] +++ OK, passed 100 tests.
  13378. 1293.58 s [vector] mut_imapM_: OK (0.03s)
  13379. 1293.58 s [vector] +++ OK, passed 100 tests.
  13380. 1293.62 s [vector] mut_forM_: OK (0.04s)
  13381. 1293.62 s [vector] +++ OK, passed 100 tests.
  13382. 1293.65 s [vector] mut_iforM_: OK (0.04s)
  13383. 1293.66 s [vector] +++ OK, passed 100 tests.
  13384. 1293.66 s [vector] mut_foldr: OK (0.01s)
  13385. 1293.66 s [vector] +++ OK, passed 100 tests.
  13386. 1293.67 s [vector] mut_foldr': OK (0.01s)
  13387. 1293.67 s [vector] +++ OK, passed 100 tests.
  13388. 1293.68 s [vector] mut_foldl: OK
  13389. 1293.68 s [vector] +++ OK, passed 100 tests.
  13390. 1293.70 s [vector] mut_foldl': OK (0.01s)
  13391. 1293.70 s [vector] +++ OK, passed 100 tests.
  13392. 1293.72 s [vector] mut_ifoldr: OK (0.01s)
  13393. 1293.72 s [vector] +++ OK, passed 100 tests.
  13394. 1293.73 s [vector] mut_ifoldr': OK (0.01s)
  13395. 1293.73 s [vector] +++ OK, passed 100 tests.
  13396. 1293.73 s [vector] mut_ifoldl: OK (0.01s)
  13397. 1293.73 s [vector] +++ OK, passed 100 tests.
  13398. 1293.76 s [vector] mut_ifoldl': OK (0.01s)
  13399. 1293.76 s [vector] +++ OK, passed 100 tests.
  13400. 1293.78 s [vector] mut_foldM: OK (0.02s)
  13401. 1293.78 s [vector] +++ OK, passed 100 tests.
  13402. 1293.78 s [vector] mut_foldM': OK (0.01s)
  13403. 1293.78 s [vector] +++ OK, passed 100 tests.
  13404. 1293.80 s [vector] mut_foldrM: OK (0.01s)
  13405. 1293.80 s [vector] +++ OK, passed 100 tests.
  13406. 1293.80 s [vector] mut_foldrM': OK (0.01s)
  13407. 1293.80 s [vector] +++ OK, passed 100 tests.
  13408. 1293.84 s [vector] mut_ifoldM: OK
  13409. 1293.84 s [vector] +++ OK, passed 100 tests.
  13410. 1293.86 s [vector] mut_ifoldM': OK (0.02s)
  13411. 1293.86 s [vector] +++ OK, passed 100 tests.
  13412. 1293.86 s [vector] mut_ifoldrM: OK (0.02s)
  13413. 1293.87 s [vector] +++ OK, passed 100 tests.
  13414. 1293.87 s [vector] mut_ifoldrM': OK (0.02s)
  13415. 1293.87 s [vector] +++ OK, passed 100 tests.
  13416. 1293.87 s [vector] compare: OK
  13417. 1293.87 s [vector] +++ OK, passed 100 tests.
  13418. 1293.87 s [vector] maximum: OK
  13419. 1293.87 s [vector] +++ OK, passed 100 tests; 11 discarded.
  13420. 1293.87 s [vector] minimum: OK
  13421. 1293.88 s [vector] +++ OK, passed 100 tests; 20 discarded.
  13422. 1293.88 s [vector] minIndex: OK
  13423. 1293.88 s [vector] +++ OK, passed 100 tests; 12 discarded.
  13424. 1293.88 s [vector] maxIndex: OK
  13425. 1293.88 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13426. 1293.88 s [vector] maximumBy: OK
  13427. 1293.88 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13428. 1293.88 s [vector] minimumBy: OK
  13429. 1293.88 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13430. 1293.88 s [vector] maximumOn: OK
  13431. 1293.88 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13432. 1293.88 s [vector] minimumOn: OK
  13433. 1293.88 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13434. 1293.88 s [vector] maxIndexBy: OK
  13435. 1293.88 s [vector] +++ OK, passed 100 tests; 12 discarded.
  13436. 1293.88 s [vector] minIndexBy: OK
  13437. 1293.88 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13438. 1293.88 s [vector] ListFirstMaxIndexWins: OK
  13439. 1293.88 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13440. 1293.88 s [vector] FalseListFirstMaxIndexWins: OK
  13441. 1293.88 s [vector] +++ OK, failed as expected. (after 1 test):
  13442. 1293.88 s [vector] Exception:
  13443. 1293.88 s [vector] Prelude.foldr1: empty list
  13444. 1293.88 s [vector] CallStack (from HasCallStack):
  13445. 1293.88 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  13446. 1293.88 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  13447. 1293.88 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  13448. 1293.88 s [vector] []
  13449. 1293.88 s [vector] mempty: OK
  13450. 1293.88 s [vector] +++ OK, passed 100 tests.
  13451. 1293.89 s [vector] mappend: OK
  13452. 1293.89 s [vector] +++ OK, passed 100 tests.
  13453. 1293.92 s [vector] mconcat: OK (0.02s)
  13454. 1293.92 s [vector] +++ OK, passed 100 tests.
  13455. 1293.92 s [vector] glength: OK
  13456. 1293.92 s [vector] +++ OK, passed 100 tests.
  13457. 1293.92 s [vector] sum: OK
  13458. 1293.92 s [vector] +++ OK, passed 100 tests.
  13459. 1293.92 s [vector] product: OK
  13460. 1293.92 s [vector] +++ OK, passed 100 tests.
  13461. 1293.92 s [vector] enumFromN: OK
  13462. 1293.92 s [vector] +++ OK, passed 100 tests.
  13463. 1293.92 s [vector] enumFromThenN: OK
  13464. 1293.92 s [vector] +++ OK, passed 100 tests.
  13465. 1293.93 s [vector] enumFromTo: OK
  13466. 1293.93 s [vector] +++ OK, passed 100 tests.
  13467. 1293.93 s [vector] enumFromThenTo: OK
  13468. 1293.93 s [vector] +++ OK, passed 100 tests; 1 discarded.
  13469. 1293.93 s [vector] unstream
  13470. 1293.93 s [vector] unstream == vunstream (exact): OK
  13471. 1293.93 s [vector] +++ OK, passed 100 tests.
  13472. 1293.93 s [vector] unstream == vunstream (unknown): OK
  13473. 1293.93 s [vector] +++ OK, passed 100 tests.
  13474. 1293.93 s [vector] unstreamR ~= vunstream (exact): OK
  13475. 1293.93 s [vector] +++ OK, passed 100 tests.
  13476. 1293.93 s [vector] unstreamR ~= vunstream (unknown): OK
  13477. 1293.93 s [vector] +++ OK, passed 100 tests.
  13478. 1293.93 s [vector] Tests.Vector.Strict
  13479. 1293.93 s [vector] Bool
  13480. 1293.93 s [vector] fromList.toList == id: OK
  13481. 1293.93 s [vector] +++ OK, passed 100 tests.
  13482. 1293.93 s [vector] toList.fromList == id: OK
  13483. 1293.93 s [vector] +++ OK, passed 100 tests.
  13484. 1293.93 s [vector] unstream.stream == id: OK
  13485. 1293.93 s [vector] +++ OK, passed 100 tests.
  13486. 1293.93 s [vector] stream.unstream == id: OK
  13487. 1293.93 s [vector] +++ OK, passed 100 tests.
  13488. 1293.93 s [vector] eq: OK
  13489. 1293.93 s [vector] +++ OK, passed 100 tests.
  13490. 1293.93 s [vector] length: OK
  13491. 1293.93 s [vector] +++ OK, passed 100 tests.
  13492. 1293.93 s [vector] null: OK
  13493. 1293.93 s [vector] +++ OK, passed 100 tests.
  13494. 1293.93 s [vector] index: OK
  13495. 1293.93 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13496. 1293.93 s [vector] safeIndex: OK
  13497. 1293.93 s [vector] +++ OK, passed 100 tests.
  13498. 1293.94 s [vector] head: OK
  13499. 1293.94 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13500. 1293.94 s [vector] last: OK
  13501. 1293.94 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13502. 1293.94 s [vector] unsafeIndex: OK
  13503. 1293.94 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13504. 1293.94 s [vector] unsafeHead: OK
  13505. 1293.94 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13506. 1293.94 s [vector] unsafeLast: OK
  13507. 1293.94 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13508. 1293.94 s [vector] slice: OK
  13509. 1293.94 s [vector] +++ OK, passed 100 tests.
  13510. 1293.94 s [vector] init: OK
  13511. 1293.94 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13512. 1293.94 s [vector] tail: OK
  13513. 1293.94 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13514. 1293.94 s [vector] take: OK
  13515. 1293.94 s [vector] +++ OK, passed 100 tests.
  13516. 1293.94 s [vector] drop: OK
  13517. 1293.94 s [vector] +++ OK, passed 100 tests.
  13518. 1293.94 s [vector] splitAt: OK
  13519. 1293.94 s [vector] +++ OK, passed 100 tests.
  13520. 1293.94 s [vector] empty: OK
  13521. 1293.94 s [vector] +++ OK, passed 100 tests.
  13522. 1293.94 s [vector] singleton: OK
  13523. 1293.94 s [vector] +++ OK, passed 100 tests.
  13524. 1293.94 s [vector] replicate: OK
  13525. 1293.94 s [vector] +++ OK, passed 100 tests.
  13526. 1293.94 s [vector] generate: OK
  13527. 1293.94 s [vector] +++ OK, passed 100 tests.
  13528. 1293.94 s [vector] iterateN: OK
  13529. 1293.94 s [vector] +++ OK, passed 100 tests.
  13530. 1294.00 s [vector] iterateNM: OK (0.03s)
  13531. 1294.00 s [vector] +++ OK, passed 100 tests.
  13532. 1294.01 s [vector] generateM: OK (0.02s)
  13533. 1294.01 s [vector] +++ OK, passed 100 tests.
  13534. 1294.01 s [vector] replicateM: OK
  13535. 1294.01 s [vector] +++ OK, passed 100 tests.
  13536. 1294.01 s [vector] create: OK
  13537. 1294.01 s [vector] +++ OK, passed 100 tests.
  13538. 1294.01 s [vector] createT: OK
  13539. 1294.01 s [vector] +++ OK, passed 100 tests.
  13540. 1294.02 s [vector] unfoldr: OK
  13541. 1294.02 s [vector] +++ OK, passed 100 tests.
  13542. 1294.02 s [vector] unfoldrN: OK
  13543. 1294.02 s [vector] +++ OK, passed 100 tests.
  13544. 1294.02 s [vector] unfoldrExactN: OK
  13545. 1294.02 s [vector] +++ OK, passed 100 tests.
  13546. 1294.02 s [vector] unfoldrM: OK
  13547. 1294.02 s [vector] +++ OK, passed 100 tests.
  13548. 1294.02 s [vector] unfoldrNM: OK
  13549. 1294.02 s [vector] +++ OK, passed 100 tests.
  13550. 1294.06 s [vector] unfoldrExactNM: OK (0.02s)
  13551. 1294.06 s [vector] +++ OK, passed 100 tests.
  13552. 1294.06 s [vector] constructN: OK
  13553. 1294.06 s [vector] +++ OK, passed 100 tests.
  13554. 1294.06 s [vector] constructrN: OK
  13555. 1294.06 s [vector] +++ OK, passed 100 tests.
  13556. 1294.06 s [vector] cons: OK
  13557. 1294.06 s [vector] +++ OK, passed 100 tests.
  13558. 1294.06 s [vector] snoc: OK
  13559. 1294.06 s [vector] +++ OK, passed 100 tests.
  13560. 1294.07 s [vector] append: OK
  13561. 1294.07 s [vector] +++ OK, passed 100 tests.
  13562. 1294.07 s [vector] concat: OK
  13563. 1294.07 s [vector] +++ OK, passed 100 tests.
  13564. 1294.07 s [vector] force: OK
  13565. 1294.07 s [vector] +++ OK, passed 100 tests.
  13566. 1294.07 s [vector] upd: OK
  13567. 1294.07 s [vector] +++ OK, passed 100 tests.
  13568. 1294.07 s [vector] accum: OK
  13569. 1294.07 s [vector] +++ OK, passed 100 tests.
  13570. 1294.08 s [vector] reverse: OK
  13571. 1294.08 s [vector] +++ OK, passed 100 tests.
  13572. 1294.08 s [vector] backpermute: OK
  13573. 1294.08 s [vector] +++ OK, passed 100 tests.
  13574. 1294.08 s [vector] map: OK
  13575. 1294.08 s [vector] +++ OK, passed 100 tests.
  13576. 1294.08 s [vector] imap: OK
  13577. 1294.08 s [vector] +++ OK, passed 100 tests.
  13578. 1294.08 s [vector] concatMap: OK
  13579. 1294.09 s [vector] +++ OK, passed 100 tests.
  13580. 1294.09 s [vector] mapM: OK
  13581. 1294.09 s [vector] +++ OK, passed 100 tests.
  13582. 1294.09 s [vector] mapM_: OK (0.01s)
  13583. 1294.09 s [vector] +++ OK, passed 100 tests.
  13584. 1294.09 s [vector] forM: OK
  13585. 1294.09 s [vector] +++ OK, passed 100 tests.
  13586. 1294.11 s [vector] forM_: OK
  13587. 1294.12 s [vector] +++ OK, passed 100 tests.
  13588. 1294.12 s [vector] imapM: OK
  13589. 1294.12 s [vector] +++ OK, passed 100 tests.
  13590. 1294.12 s [vector] imapM_: OK (0.01s)
  13591. 1294.12 s [vector] +++ OK, passed 100 tests.
  13592. 1294.12 s [vector] zipWith: OK
  13593. 1294.12 s [vector] +++ OK, passed 100 tests.
  13594. 1294.12 s [vector] zipWith3: OK
  13595. 1294.12 s [vector] +++ OK, passed 100 tests.
  13596. 1294.12 s [vector] izipWith: OK
  13597. 1294.12 s [vector] +++ OK, passed 100 tests.
  13598. 1294.12 s [vector] izipWith3: OK
  13599. 1294.13 s [vector] +++ OK, passed 100 tests.
  13600. 1294.13 s [vector] izipWithM: OK
  13601. 1294.13 s [vector] +++ OK, passed 100 tests.
  13602. 1294.14 s [vector] izipWithM_: OK
  13603. 1294.14 s [vector] +++ OK, passed 100 tests.
  13604. 1294.14 s [vector] zipWithM: OK
  13605. 1294.14 s [vector] +++ OK, passed 100 tests.
  13606. 1294.14 s [vector] zipWithM_: OK
  13607. 1294.14 s [vector] +++ OK, passed 100 tests.
  13608. 1294.14 s [vector] filter: OK
  13609. 1294.14 s [vector] +++ OK, passed 100 tests.
  13610. 1294.15 s [vector] ifilter: OK
  13611. 1294.15 s [vector] +++ OK, passed 100 tests.
  13612. 1294.17 s [vector] filterM: OK (0.01s)
  13613. 1294.17 s [vector] +++ OK, passed 100 tests.
  13614. 1294.17 s [vector] uniq: OK
  13615. 1294.17 s [vector] +++ OK, passed 100 tests.
  13616. 1294.18 s [vector] mapMaybe: OK
  13617. 1294.18 s [vector] +++ OK, passed 100 tests.
  13618. 1294.18 s [vector] imapMaybe: OK
  13619. 1294.18 s [vector] +++ OK, passed 100 tests.
  13620. 1294.18 s [vector] takeWhile: OK
  13621. 1294.18 s [vector] +++ OK, passed 100 tests.
  13622. 1294.18 s [vector] dropWhile: OK
  13623. 1294.18 s [vector] +++ OK, passed 100 tests.
  13624. 1294.18 s [vector] partition: OK
  13625. 1294.18 s [vector] +++ OK, passed 100 tests.
  13626. 1294.18 s [vector] partitionWith: OK
  13627. 1294.18 s [vector] +++ OK, passed 100 tests.
  13628. 1294.18 s [vector] span: OK
  13629. 1294.18 s [vector] +++ OK, passed 100 tests.
  13630. 1294.19 s [vector] break: OK
  13631. 1294.19 s [vector] +++ OK, passed 100 tests.
  13632. 1294.19 s [vector] spanR: OK
  13633. 1294.19 s [vector] +++ OK, passed 100 tests.
  13634. 1294.19 s [vector] breakR: OK
  13635. 1294.19 s [vector] +++ OK, passed 100 tests.
  13636. 1294.19 s [vector] groupBy: OK
  13637. 1294.19 s [vector] +++ OK, passed 100 tests.
  13638. 1294.19 s [vector] elem: OK
  13639. 1294.19 s [vector] +++ OK, passed 100 tests.
  13640. 1294.19 s [vector] notElem: OK
  13641. 1294.19 s [vector] +++ OK, passed 100 tests.
  13642. 1294.19 s [vector] find: OK
  13643. 1294.19 s [vector] +++ OK, passed 100 tests.
  13644. 1294.19 s [vector] findIndex: OK
  13645. 1294.19 s [vector] +++ OK, passed 100 tests.
  13646. 1294.19 s [vector] findIndexR: OK
  13647. 1294.19 s [vector] +++ OK, passed 100 tests.
  13648. 1294.19 s [vector] findIndices: OK
  13649. 1294.19 s [vector] +++ OK, passed 100 tests.
  13650. 1294.20 s [vector] elemIndex: OK
  13651. 1294.20 s [vector] +++ OK, passed 100 tests.
  13652. 1294.20 s [vector] elemIndices: OK
  13653. 1294.20 s [vector] +++ OK, passed 100 tests.
  13654. 1294.20 s [vector] foldl: OK
  13655. 1294.20 s [vector] +++ OK, passed 100 tests.
  13656. 1294.20 s [vector] foldl1: OK
  13657. 1294.20 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13658. 1294.20 s [vector] foldl': OK
  13659. 1294.20 s [vector] +++ OK, passed 100 tests.
  13660. 1294.20 s [vector] foldl1': OK
  13661. 1294.20 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13662. 1294.20 s [vector] foldr: OK
  13663. 1294.20 s [vector] +++ OK, passed 100 tests.
  13664. 1294.20 s [vector] foldr1: OK
  13665. 1294.21 s [vector] +++ OK, passed 100 tests; 20 discarded.
  13666. 1294.21 s [vector] foldr': OK
  13667. 1294.21 s [vector] +++ OK, passed 100 tests.
  13668. 1294.21 s [vector] foldr1': OK
  13669. 1294.21 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13670. 1294.21 s [vector] ifoldl: OK
  13671. 1294.21 s [vector] +++ OK, passed 100 tests.
  13672. 1294.21 s [vector] ifoldl': OK
  13673. 1294.21 s [vector] +++ OK, passed 100 tests.
  13674. 1294.21 s [vector] ifoldr: OK
  13675. 1294.21 s [vector] +++ OK, passed 100 tests.
  13676. 1294.21 s [vector] ifoldr': OK
  13677. 1294.21 s [vector] +++ OK, passed 100 tests.
  13678. 1294.22 s [vector] ifoldM: OK
  13679. 1294.22 s [vector] +++ OK, passed 100 tests.
  13680. 1294.24 s [vector] ifoldM': OK
  13681. 1294.24 s [vector] +++ OK, passed 100 tests.
  13682. 1294.25 s [vector] ifoldM_: OK (0.02s)
  13683. 1294.25 s [vector] +++ OK, passed 100 tests.
  13684. 1294.25 s [vector] ifoldM'_: OK (0.01s)
  13685. 1294.25 s [vector] +++ OK, passed 100 tests.
  13686. 1294.25 s [vector] all: OK
  13687. 1294.25 s [vector] +++ OK, passed 100 tests.
  13688. 1294.26 s [vector] any: OK
  13689. 1294.26 s [vector] +++ OK, passed 100 tests.
  13690. 1294.26 s [vector] prescanl: OK
  13691. 1294.26 s [vector] +++ OK, passed 100 tests.
  13692. 1294.26 s [vector] prescanl': OK
  13693. 1294.26 s [vector] +++ OK, passed 100 tests.
  13694. 1294.26 s [vector] postscanl: OK
  13695. 1294.26 s [vector] +++ OK, passed 100 tests.
  13696. 1294.26 s [vector] postscanl': OK
  13697. 1294.26 s [vector] +++ OK, passed 100 tests.
  13698. 1294.26 s [vector] scanl: OK
  13699. 1294.26 s [vector] +++ OK, passed 100 tests.
  13700. 1294.26 s [vector] scanl': OK
  13701. 1294.27 s [vector] +++ OK, passed 100 tests.
  13702. 1294.27 s [vector] scanl1: OK
  13703. 1294.27 s [vector] +++ OK, passed 100 tests.
  13704. 1294.27 s [vector] scanl1': OK
  13705. 1294.27 s [vector] +++ OK, passed 100 tests.
  13706. 1294.27 s [vector] iscanl: OK
  13707. 1294.27 s [vector] +++ OK, passed 100 tests.
  13708. 1294.27 s [vector] iscanl': OK
  13709. 1294.27 s [vector] +++ OK, passed 100 tests.
  13710. 1294.28 s [vector] prescanr: OK
  13711. 1294.28 s [vector] +++ OK, passed 100 tests.
  13712. 1294.28 s [vector] prescanr': OK
  13713. 1294.28 s [vector] +++ OK, passed 100 tests.
  13714. 1294.28 s [vector] postscanr: OK
  13715. 1294.28 s [vector] +++ OK, passed 100 tests.
  13716. 1294.28 s [vector] postscanr': OK
  13717. 1294.28 s [vector] +++ OK, passed 100 tests.
  13718. 1294.28 s [vector] scanr: OK
  13719. 1294.28 s [vector] +++ OK, passed 100 tests.
  13720. 1294.28 s [vector] scanr': OK
  13721. 1294.28 s [vector] +++ OK, passed 100 tests.
  13722. 1294.28 s [vector] scanr1: OK
  13723. 1294.28 s [vector] +++ OK, passed 100 tests.
  13724. 1294.29 s [vector] scanr1': OK
  13725. 1294.29 s [vector] +++ OK, passed 100 tests.
  13726. 1294.29 s [vector] iscanr: OK
  13727. 1294.29 s [vector] +++ OK, passed 100 tests.
  13728. 1294.29 s [vector] iscanr': OK
  13729. 1294.29 s [vector] +++ OK, passed 100 tests.
  13730. 1294.29 s [vector] mut_read: OK
  13731. 1294.29 s [vector] +++ OK, passed 100 tests; 19 discarded.
  13732. 1294.29 s [vector] mut_write: OK
  13733. 1294.29 s [vector] +++ OK, passed 100 tests; 19 discarded.
  13734. 1294.30 s [vector] mut_modify: OK
  13735. 1294.30 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13736. 1294.30 s [vector] mut_generate: OK
  13737. 1294.30 s [vector] +++ OK, passed 100 tests.
  13738. 1294.31 s [vector] mut_generateM: OK
  13739. 1294.31 s [vector] +++ OK, passed 100 tests.
  13740. 1294.31 s [vector] mut_mapM_: OK (0.01s)
  13741. 1294.31 s [vector] +++ OK, passed 100 tests.
  13742. 1294.33 s [vector] mut_imapM_: OK (0.02s)
  13743. 1294.33 s [vector] +++ OK, passed 100 tests.
  13744. 1294.36 s [vector] mut_forM_: OK (0.01s)
  13745. 1294.36 s [vector] +++ OK, passed 100 tests.
  13746. 1294.38 s [vector] mut_iforM_: OK (0.03s)
  13747. 1294.38 s [vector] +++ OK, passed 100 tests.
  13748. 1294.38 s [vector] mut_foldr: OK
  13749. 1294.38 s [vector] +++ OK, passed 100 tests.
  13750. 1294.38 s [vector] mut_foldr': OK
  13751. 1294.38 s [vector] +++ OK, passed 100 tests.
  13752. 1294.38 s [vector] mut_foldl: OK
  13753. 1294.38 s [vector] +++ OK, passed 100 tests.
  13754. 1294.39 s [vector] mut_foldl': OK
  13755. 1294.39 s [vector] +++ OK, passed 100 tests.
  13756. 1294.39 s [vector] mut_ifoldr: OK
  13757. 1294.39 s [vector] +++ OK, passed 100 tests.
  13758. 1294.39 s [vector] mut_ifoldr': OK
  13759. 1294.39 s [vector] +++ OK, passed 100 tests.
  13760. 1294.39 s [vector] mut_ifoldl: OK
  13761. 1294.39 s [vector] +++ OK, passed 100 tests.
  13762. 1294.39 s [vector] mut_ifoldl': OK
  13763. 1294.39 s [vector] +++ OK, passed 100 tests.
  13764. 1294.39 s [vector] mut_foldM: OK
  13765. 1294.39 s [vector] +++ OK, passed 100 tests.
  13766. 1294.39 s [vector] mut_foldM': OK
  13767. 1294.39 s [vector] +++ OK, passed 100 tests.
  13768. 1294.39 s [vector] mut_foldrM: OK
  13769. 1294.39 s [vector] +++ OK, passed 100 tests.
  13770. 1294.39 s [vector] mut_foldrM': OK
  13771. 1294.40 s [vector] +++ OK, passed 100 tests.
  13772. 1294.40 s [vector] mut_ifoldM: OK
  13773. 1294.40 s [vector] +++ OK, passed 100 tests.
  13774. 1294.40 s [vector] mut_ifoldM': OK
  13775. 1294.40 s [vector] +++ OK, passed 100 tests.
  13776. 1294.40 s [vector] mut_ifoldrM: OK
  13777. 1294.40 s [vector] +++ OK, passed 100 tests.
  13778. 1294.40 s [vector] mut_ifoldrM': OK
  13779. 1294.40 s [vector] +++ OK, passed 100 tests.
  13780. 1294.40 s [vector] compare: OK
  13781. 1294.40 s [vector] +++ OK, passed 100 tests.
  13782. 1294.40 s [vector] maximum: OK
  13783. 1294.40 s [vector] +++ OK, passed 100 tests; 19 discarded.
  13784. 1294.40 s [vector] minimum: OK
  13785. 1294.40 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13786. 1294.40 s [vector] minIndex: OK
  13787. 1294.40 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13788. 1294.40 s [vector] maxIndex: OK
  13789. 1294.40 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13790. 1294.40 s [vector] maximumBy: OK
  13791. 1294.40 s [vector] +++ OK, passed 100 tests; 20 discarded.
  13792. 1294.40 s [vector] minimumBy: OK
  13793. 1294.40 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13794. 1294.40 s [vector] maximumOn: OK
  13795. 1294.40 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13796. 1294.40 s [vector] minimumOn: OK
  13797. 1294.40 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13798. 1294.40 s [vector] maxIndexBy: OK
  13799. 1294.40 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13800. 1294.40 s [vector] minIndexBy: OK
  13801. 1294.40 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13802. 1294.40 s [vector] ListFirstMaxIndexWins: OK
  13803. 1294.40 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13804. 1294.41 s [vector] FalseListFirstMaxIndexWins: OK
  13805. 1294.41 s [vector] +++ OK, failed as expected. (after 1 test):
  13806. 1294.41 s [vector] Exception:
  13807. 1294.41 s [vector] Prelude.foldr1: empty list
  13808. 1294.41 s [vector] CallStack (from HasCallStack):
  13809. 1294.41 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  13810. 1294.41 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  13811. 1294.41 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  13812. 1294.41 s [vector] []
  13813. 1294.41 s [vector] zip: OK
  13814. 1294.41 s [vector] +++ OK, passed 100 tests.
  13815. 1294.41 s [vector] zip3: OK
  13816. 1294.41 s [vector] +++ OK, passed 100 tests.
  13817. 1294.41 s [vector] unzip: OK
  13818. 1294.41 s [vector] +++ OK, passed 100 tests.
  13819. 1294.41 s [vector] unzip3: OK
  13820. 1294.41 s [vector] +++ OK, passed 100 tests.
  13821. 1294.41 s [vector] indexed: OK
  13822. 1294.41 s [vector] +++ OK, passed 100 tests.
  13823. 1294.42 s [vector] update: OK
  13824. 1294.42 s [vector] +++ OK, passed 100 tests.
  13825. 1294.42 s [vector] concat: OK
  13826. 1294.42 s [vector] +++ OK, passed 100 tests.
  13827. 1294.42 s [vector] mempty: OK
  13828. 1294.42 s [vector] +++ OK, passed 100 tests.
  13829. 1294.43 s [vector] mappend: OK
  13830. 1294.43 s [vector] +++ OK, passed 100 tests.
  13831. 1294.43 s [vector] mconcat: OK
  13832. 1294.43 s [vector] +++ OK, passed 100 tests.
  13833. 1294.43 s [vector] fmap: OK
  13834. 1294.43 s [vector] +++ OK, passed 100 tests.
  13835. 1294.43 s [vector] return: OK
  13836. 1294.43 s [vector] +++ OK, passed 100 tests.
  13837. 1294.44 s [vector] bind: OK (0.01s)
  13838. 1294.44 s [vector] +++ OK, passed 100 tests.
  13839. 1294.44 s [vector] mzip: OK
  13840. 1294.44 s [vector] +++ OK, passed 100 tests.
  13841. 1294.44 s [vector] munzip: OK
  13842. 1294.44 s [vector] +++ OK, passed 100 tests.
  13843. 1294.44 s [vector] applicative_pure: OK
  13844. 1294.44 s [vector] +++ OK, passed 100 tests.
  13845. 1294.45 s [vector] applicative_appl: OK
  13846. 1294.45 s [vector] +++ OK, passed 100 tests.
  13847. 1294.46 s [vector] alternative_empty: OK
  13848. 1294.46 s [vector] +++ OK, passed 100 tests.
  13849. 1294.46 s [vector] alternative_or: OK
  13850. 1294.46 s [vector] +++ OK, passed 100 tests.
  13851. 1294.49 s [vector] sequence: OK (0.04s)
  13852. 1294.49 s [vector] +++ OK, passed 100 tests.
  13853. 1294.50 s [vector] sequence_: OK
  13854. 1294.50 s [vector] +++ OK, passed 100 tests.
  13855. 1294.50 s [vector] glength: OK
  13856. 1294.50 s [vector] +++ OK, passed 100 tests.
  13857. 1294.50 s [vector] and: OK
  13858. 1294.50 s [vector] +++ OK, passed 100 tests.
  13859. 1294.50 s [vector] or: OK
  13860. 1294.50 s [vector] +++ OK, passed 100 tests.
  13861. 1294.50 s [vector] Int
  13862. 1294.50 s [vector] fromList.toList == id: OK
  13863. 1294.50 s [vector] +++ OK, passed 100 tests.
  13864. 1294.50 s [vector] toList.fromList == id: OK
  13865. 1294.50 s [vector] +++ OK, passed 100 tests.
  13866. 1294.50 s [vector] unstream.stream == id: OK
  13867. 1294.50 s [vector] +++ OK, passed 100 tests.
  13868. 1294.50 s [vector] stream.unstream == id: OK
  13869. 1294.50 s [vector] +++ OK, passed 100 tests.
  13870. 1294.50 s [vector] eq: OK
  13871. 1294.50 s [vector] +++ OK, passed 100 tests.
  13872. 1294.50 s [vector] length: OK
  13873. 1294.50 s [vector] +++ OK, passed 100 tests.
  13874. 1294.50 s [vector] null: OK
  13875. 1294.50 s [vector] +++ OK, passed 100 tests.
  13876. 1294.50 s [vector] index: OK
  13877. 1294.50 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13878. 1294.51 s [vector] safeIndex: OK
  13879. 1294.51 s [vector] +++ OK, passed 100 tests.
  13880. 1294.51 s [vector] head: OK
  13881. 1294.51 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13882. 1294.51 s [vector] last: OK
  13883. 1294.51 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13884. 1294.51 s [vector] unsafeIndex: OK
  13885. 1294.51 s [vector] +++ OK, passed 100 tests; 19 discarded.
  13886. 1294.51 s [vector] unsafeHead: OK
  13887. 1294.51 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13888. 1294.51 s [vector] unsafeLast: OK
  13889. 1294.51 s [vector] +++ OK, passed 100 tests; 22 discarded.
  13890. 1294.51 s [vector] slice: OK
  13891. 1294.51 s [vector] +++ OK, passed 100 tests.
  13892. 1294.51 s [vector] init: OK
  13893. 1294.51 s [vector] +++ OK, passed 100 tests; 20 discarded.
  13894. 1294.51 s [vector] tail: OK
  13895. 1294.51 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13896. 1294.51 s [vector] take: OK
  13897. 1294.51 s [vector] +++ OK, passed 100 tests.
  13898. 1294.51 s [vector] drop: OK
  13899. 1294.51 s [vector] +++ OK, passed 100 tests.
  13900. 1294.51 s [vector] splitAt: OK
  13901. 1294.51 s [vector] +++ OK, passed 100 tests.
  13902. 1294.51 s [vector] empty: OK
  13903. 1294.51 s [vector] +++ OK, passed 100 tests.
  13904. 1294.51 s [vector] singleton: OK
  13905. 1294.51 s [vector] +++ OK, passed 100 tests.
  13906. 1294.51 s [vector] replicate: OK
  13907. 1294.51 s [vector] +++ OK, passed 100 tests.
  13908. 1294.51 s [vector] generate: OK
  13909. 1294.51 s [vector] +++ OK, passed 100 tests.
  13910. 1294.52 s [vector] iterateN: OK
  13911. 1294.52 s [vector] +++ OK, passed 100 tests.
  13912. 1294.54 s [vector] iterateNM: OK (0.02s)
  13913. 1294.54 s [vector] +++ OK, passed 100 tests.
  13914. 1294.59 s [vector] generateM: OK (0.03s)
  13915. 1294.59 s [vector] +++ OK, passed 100 tests.
  13916. 1294.59 s [vector] replicateM: OK
  13917. 1294.59 s [vector] +++ OK, passed 100 tests.
  13918. 1294.59 s [vector] create: OK
  13919. 1294.59 s [vector] +++ OK, passed 100 tests.
  13920. 1294.59 s [vector] createT: OK
  13921. 1294.59 s [vector] +++ OK, passed 100 tests.
  13922. 1294.59 s [vector] unfoldr: OK
  13923. 1294.59 s [vector] +++ OK, passed 100 tests.
  13924. 1294.60 s [vector] unfoldrN: OK
  13925. 1294.60 s [vector] +++ OK, passed 100 tests.
  13926. 1294.60 s [vector] unfoldrExactN: OK
  13927. 1294.60 s [vector] +++ OK, passed 100 tests.
  13928. 1294.61 s [vector] unfoldrM: OK
  13929. 1294.61 s [vector] +++ OK, passed 100 tests.
  13930. 1294.61 s [vector] unfoldrNM: OK
  13931. 1294.62 s [vector] +++ OK, passed 100 tests.
  13932. 1294.66 s [vector] unfoldrExactNM: OK (0.05s)
  13933. 1294.66 s [vector] +++ OK, passed 100 tests.
  13934. 1294.66 s [vector] constructN: OK
  13935. 1294.66 s [vector] +++ OK, passed 100 tests.
  13936. 1294.66 s [vector] constructrN: OK
  13937. 1294.66 s [vector] +++ OK, passed 100 tests.
  13938. 1294.66 s [vector] cons: OK
  13939. 1294.66 s [vector] +++ OK, passed 100 tests.
  13940. 1294.66 s [vector] snoc: OK
  13941. 1294.67 s [vector] +++ OK, passed 100 tests.
  13942. 1294.67 s [vector] append: OK
  13943. 1294.67 s [vector] +++ OK, passed 100 tests.
  13944. 1294.67 s [vector] concat: OK (0.01s)
  13945. 1294.67 s [vector] +++ OK, passed 100 tests.
  13946. 1294.67 s [vector] force: OK
  13947. 1294.67 s [vector] +++ OK, passed 100 tests.
  13948. 1294.68 s [vector] upd: OK
  13949. 1294.68 s [vector] +++ OK, passed 100 tests.
  13950. 1294.68 s [vector] accum: OK
  13951. 1294.68 s [vector] +++ OK, passed 100 tests.
  13952. 1294.68 s [vector] reverse: OK
  13953. 1294.68 s [vector] +++ OK, passed 100 tests.
  13954. 1294.68 s [vector] backpermute: OK
  13955. 1294.68 s [vector] +++ OK, passed 100 tests.
  13956. 1294.68 s [vector] map: OK
  13957. 1294.68 s [vector] +++ OK, passed 100 tests.
  13958. 1294.69 s [vector] imap: OK
  13959. 1294.69 s [vector] +++ OK, passed 100 tests.
  13960. 1294.70 s [vector] concatMap: OK
  13961. 1294.70 s [vector] +++ OK, passed 100 tests.
  13962. 1294.70 s [vector] mapM: OK
  13963. 1294.70 s [vector] +++ OK, passed 100 tests.
  13964. 1294.72 s [vector] mapM_: OK (0.03s)
  13965. 1294.72 s [vector] +++ OK, passed 100 tests.
  13966. 1294.73 s [vector] forM: OK
  13967. 1294.74 s [vector] +++ OK, passed 100 tests.
  13968. 1294.74 s [vector] forM_: OK (0.02s)
  13969. 1294.74 s [vector] +++ OK, passed 100 tests.
  13970. 1294.75 s [vector] imapM: OK
  13971. 1294.76 s [vector] +++ OK, passed 100 tests.
  13972. 1294.76 s [vector] imapM_: OK (0.02s)
  13973. 1294.76 s [vector] +++ OK, passed 100 tests.
  13974. 1294.76 s [vector] zipWith: OK
  13975. 1294.76 s [vector] +++ OK, passed 100 tests.
  13976. 1294.76 s [vector] zipWith3: OK
  13977. 1294.76 s [vector] +++ OK, passed 100 tests.
  13978. 1294.78 s [vector] izipWith: OK
  13979. 1294.78 s [vector] +++ OK, passed 100 tests.
  13980. 1294.78 s [vector] izipWith3: OK
  13981. 1294.78 s [vector] +++ OK, passed 100 tests.
  13982. 1294.78 s [vector] izipWithM: OK
  13983. 1294.78 s [vector] +++ OK, passed 100 tests.
  13984. 1294.78 s [vector] izipWithM_: OK (0.01s)
  13985. 1294.78 s [vector] +++ OK, passed 100 tests.
  13986. 1294.78 s [vector] zipWithM: OK
  13987. 1294.78 s [vector] +++ OK, passed 100 tests.
  13988. 1294.79 s [vector] zipWithM_: OK
  13989. 1294.79 s [vector] +++ OK, passed 100 tests.
  13990. 1294.80 s [vector] filter: OK
  13991. 1294.80 s [vector] +++ OK, passed 100 tests.
  13992. 1294.82 s [vector] ifilter: OK
  13993. 1294.82 s [vector] +++ OK, passed 100 tests.
  13994. 1294.82 s [vector] filterM: OK (0.02s)
  13995. 1294.82 s [vector] +++ OK, passed 100 tests.
  13996. 1294.82 s [vector] uniq: OK
  13997. 1294.83 s [vector] +++ OK, passed 100 tests.
  13998. 1294.83 s [vector] mapMaybe: OK
  13999. 1294.83 s [vector] +++ OK, passed 100 tests.
  14000. 1294.83 s [vector] imapMaybe: OK
  14001. 1294.83 s [vector] +++ OK, passed 100 tests.
  14002. 1294.83 s [vector] takeWhile: OK
  14003. 1294.83 s [vector] +++ OK, passed 100 tests.
  14004. 1294.83 s [vector] dropWhile: OK
  14005. 1294.83 s [vector] +++ OK, passed 100 tests.
  14006. 1294.83 s [vector] partition: OK
  14007. 1294.83 s [vector] +++ OK, passed 100 tests.
  14008. 1294.83 s [vector] partitionWith: OK
  14009. 1294.83 s [vector] +++ OK, passed 100 tests.
  14010. 1294.83 s [vector] span: OK
  14011. 1294.83 s [vector] +++ OK, passed 100 tests.
  14012. 1294.83 s [vector] break: OK
  14013. 1294.83 s [vector] +++ OK, passed 100 tests.
  14014. 1294.83 s [vector] spanR: OK
  14015. 1294.84 s [vector] +++ OK, passed 100 tests.
  14016. 1294.84 s [vector] breakR: OK
  14017. 1294.84 s [vector] +++ OK, passed 100 tests.
  14018. 1294.84 s [vector] groupBy: OK
  14019. 1294.84 s [vector] +++ OK, passed 100 tests.
  14020. 1294.84 s [vector] elem: OK
  14021. 1294.84 s [vector] +++ OK, passed 100 tests.
  14022. 1294.84 s [vector] notElem: OK
  14023. 1294.84 s [vector] +++ OK, passed 100 tests.
  14024. 1294.84 s [vector] find: OK
  14025. 1294.84 s [vector] +++ OK, passed 100 tests.
  14026. 1294.84 s [vector] findIndex: OK
  14027. 1294.84 s [vector] +++ OK, passed 100 tests.
  14028. 1294.84 s [vector] findIndexR: OK
  14029. 1294.85 s [vector] +++ OK, passed 100 tests.
  14030. 1294.85 s [vector] findIndices: OK
  14031. 1294.85 s [vector] +++ OK, passed 100 tests.
  14032. 1294.85 s [vector] elemIndex: OK
  14033. 1294.85 s [vector] +++ OK, passed 100 tests.
  14034. 1294.85 s [vector] elemIndices: OK
  14035. 1294.85 s [vector] +++ OK, passed 100 tests.
  14036. 1294.85 s [vector] foldl: OK
  14037. 1294.85 s [vector] +++ OK, passed 100 tests.
  14038. 1294.86 s [vector] foldl1: OK
  14039. 1294.86 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14040. 1294.87 s [vector] foldl': OK
  14041. 1294.87 s [vector] +++ OK, passed 100 tests.
  14042. 1294.87 s [vector] foldl1': OK
  14043. 1294.87 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14044. 1294.87 s [vector] foldr: OK
  14045. 1294.87 s [vector] +++ OK, passed 100 tests.
  14046. 1294.88 s [vector] foldr1: OK
  14047. 1294.88 s [vector] +++ OK, passed 100 tests; 21 discarded.
  14048. 1294.88 s [vector] foldr': OK
  14049. 1294.88 s [vector] +++ OK, passed 100 tests.
  14050. 1294.89 s [vector] foldr1': OK
  14051. 1294.89 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14052. 1294.89 s [vector] ifoldl: OK
  14053. 1294.89 s [vector] +++ OK, passed 100 tests.
  14054. 1294.89 s [vector] ifoldl': OK
  14055. 1294.90 s [vector] +++ OK, passed 100 tests.
  14056. 1294.90 s [vector] ifoldr: OK
  14057. 1294.90 s [vector] +++ OK, passed 100 tests.
  14058. 1294.90 s [vector] ifoldr': OK
  14059. 1294.90 s [vector] +++ OK, passed 100 tests.
  14060. 1294.91 s [vector] ifoldM: OK
  14061. 1294.92 s [vector] +++ OK, passed 100 tests.
  14062. 1294.92 s [vector] ifoldM': OK
  14063. 1294.92 s [vector] +++ OK, passed 100 tests.
  14064. 1294.94 s [vector] ifoldM_: OK (0.02s)
  14065. 1294.94 s [vector] +++ OK, passed 100 tests.
  14066. 1294.94 s [vector] ifoldM'_: OK (0.02s)
  14067. 1294.94 s [vector] +++ OK, passed 100 tests.
  14068. 1294.94 s [vector] all: OK
  14069. 1294.94 s [vector] +++ OK, passed 100 tests.
  14070. 1294.94 s [vector] any: OK
  14071. 1294.94 s [vector] +++ OK, passed 100 tests.
  14072. 1294.95 s [vector] prescanl: OK
  14073. 1294.95 s [vector] +++ OK, passed 100 tests.
  14074. 1294.95 s [vector] prescanl': OK
  14075. 1294.95 s [vector] +++ OK, passed 100 tests.
  14076. 1294.95 s [vector] postscanl: OK
  14077. 1294.95 s [vector] +++ OK, passed 100 tests.
  14078. 1294.95 s [vector] postscanl': OK
  14079. 1294.95 s [vector] +++ OK, passed 100 tests.
  14080. 1294.96 s [vector] scanl: OK
  14081. 1294.96 s [vector] +++ OK, passed 100 tests.
  14082. 1294.96 s [vector] scanl': OK
  14083. 1294.96 s [vector] +++ OK, passed 100 tests.
  14084. 1294.96 s [vector] scanl1: OK
  14085. 1294.96 s [vector] +++ OK, passed 100 tests.
  14086. 1294.96 s [vector] scanl1': OK
  14087. 1294.96 s [vector] +++ OK, passed 100 tests.
  14088. 1294.97 s [vector] iscanl: OK
  14089. 1294.97 s [vector] +++ OK, passed 100 tests.
  14090. 1294.97 s [vector] iscanl': OK
  14091. 1294.98 s [vector] +++ OK, passed 100 tests.
  14092. 1294.98 s [vector] prescanr: OK
  14093. 1294.98 s [vector] +++ OK, passed 100 tests.
  14094. 1294.98 s [vector] prescanr': OK
  14095. 1294.98 s [vector] +++ OK, passed 100 tests.
  14096. 1294.98 s [vector] postscanr: OK
  14097. 1294.98 s [vector] +++ OK, passed 100 tests.
  14098. 1294.98 s [vector] postscanr': OK
  14099. 1294.98 s [vector] +++ OK, passed 100 tests.
  14100. 1294.98 s [vector] scanr: OK
  14101. 1294.98 s [vector] +++ OK, passed 100 tests.
  14102. 1294.99 s [vector] scanr': OK
  14103. 1294.99 s [vector] +++ OK, passed 100 tests.
  14104. 1294.99 s [vector] scanr1: OK
  14105. 1294.99 s [vector] +++ OK, passed 100 tests.
  14106. 1294.99 s [vector] scanr1': OK
  14107. 1294.99 s [vector] +++ OK, passed 100 tests.
  14108. 1295.00 s [vector] iscanr: OK
  14109. 1295.00 s [vector] +++ OK, passed 100 tests.
  14110. 1295.00 s [vector] iscanr': OK
  14111. 1295.00 s [vector] +++ OK, passed 100 tests.
  14112. 1295.00 s [vector] mut_read: OK
  14113. 1295.00 s [vector] +++ OK, passed 100 tests; 21 discarded.
  14114. 1295.00 s [vector] mut_write: OK
  14115. 1295.00 s [vector] +++ OK, passed 100 tests; 13 discarded.
  14116. 1295.00 s [vector] mut_modify: OK
  14117. 1295.00 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14118. 1295.01 s [vector] mut_generate: OK
  14119. 1295.02 s [vector] +++ OK, passed 100 tests.
  14120. 1295.02 s [vector] mut_generateM: OK (0.01s)
  14121. 1295.02 s [vector] +++ OK, passed 100 tests.
  14122. 1295.04 s [vector] mut_mapM_: OK (0.02s)
  14123. 1295.04 s [vector] +++ OK, passed 100 tests.
  14124. 1295.06 s [vector] mut_imapM_: OK (0.01s)
  14125. 1295.06 s [vector] +++ OK, passed 100 tests.
  14126. 1295.07 s [vector] mut_forM_: OK (0.01s)
  14127. 1295.07 s [vector] +++ OK, passed 100 tests.
  14128. 1295.08 s [vector] mut_iforM_: OK (0.02s)
  14129. 1295.08 s [vector] +++ OK, passed 100 tests.
  14130. 1295.08 s [vector] mut_foldr: OK
  14131. 1295.08 s [vector] +++ OK, passed 100 tests.
  14132. 1295.08 s [vector] mut_foldr': OK
  14133. 1295.08 s [vector] +++ OK, passed 100 tests.
  14134. 1295.08 s [vector] mut_foldl: OK
  14135. 1295.08 s [vector] +++ OK, passed 100 tests.
  14136. 1295.09 s [vector] mut_foldl': OK
  14137. 1295.09 s [vector] +++ OK, passed 100 tests.
  14138. 1295.09 s [vector] mut_ifoldr: OK
  14139. 1295.09 s [vector] +++ OK, passed 100 tests.
  14140. 1295.09 s [vector] mut_ifoldr': OK
  14141. 1295.09 s [vector] +++ OK, passed 100 tests.
  14142. 1295.10 s [vector] mut_ifoldl: OK
  14143. 1295.10 s [vector] +++ OK, passed 100 tests.
  14144. 1295.11 s [vector] mut_ifoldl': OK (0.01s)
  14145. 1295.11 s [vector] +++ OK, passed 100 tests.
  14146. 1295.11 s [vector] mut_foldM: OK
  14147. 1295.11 s [vector] +++ OK, passed 100 tests.
  14148. 1295.11 s [vector] mut_foldM': OK
  14149. 1295.11 s [vector] +++ OK, passed 100 tests.
  14150. 1295.11 s [vector] mut_foldrM: OK
  14151. 1295.11 s [vector] +++ OK, passed 100 tests.
  14152. 1295.11 s [vector] mut_foldrM': OK
  14153. 1295.11 s [vector] +++ OK, passed 100 tests.
  14154. 1295.12 s [vector] mut_ifoldM: OK
  14155. 1295.12 s [vector] +++ OK, passed 100 tests.
  14156. 1295.12 s [vector] mut_ifoldM': OK
  14157. 1295.12 s [vector] +++ OK, passed 100 tests.
  14158. 1295.12 s [vector] mut_ifoldrM: OK
  14159. 1295.13 s [vector] +++ OK, passed 100 tests.
  14160. 1295.13 s [vector] mut_ifoldrM': OK
  14161. 1295.13 s [vector] +++ OK, passed 100 tests.
  14162. 1295.13 s [vector] compare: OK
  14163. 1295.13 s [vector] +++ OK, passed 100 tests.
  14164. 1295.13 s [vector] maximum: OK
  14165. 1295.13 s [vector] +++ OK, passed 100 tests; 13 discarded.
  14166. 1295.13 s [vector] minimum: OK
  14167. 1295.13 s [vector] +++ OK, passed 100 tests; 12 discarded.
  14168. 1295.13 s [vector] minIndex: OK
  14169. 1295.13 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14170. 1295.13 s [vector] maxIndex: OK
  14171. 1295.13 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14172. 1295.13 s [vector] maximumBy: OK
  14173. 1295.13 s [vector] +++ OK, passed 100 tests; 20 discarded.
  14174. 1295.13 s [vector] minimumBy: OK
  14175. 1295.13 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14176. 1295.13 s [vector] maximumOn: OK
  14177. 1295.13 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14178. 1295.13 s [vector] minimumOn: OK
  14179. 1295.13 s [vector] +++ OK, passed 100 tests; 19 discarded.
  14180. 1295.13 s [vector] maxIndexBy: OK
  14181. 1295.13 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14182. 1295.13 s [vector] minIndexBy: OK
  14183. 1295.13 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14184. 1295.13 s [vector] ListFirstMaxIndexWins: OK
  14185. 1295.13 s [vector] +++ OK, passed 100 tests; 13 discarded.
  14186. 1295.13 s [vector] FalseListFirstMaxIndexWins: OK
  14187. 1295.13 s [vector] +++ OK, failed as expected. (after 1 test):
  14188. 1295.13 s [vector] Exception:
  14189. 1295.13 s [vector] Prelude.foldr1: empty list
  14190. 1295.14 s [vector] CallStack (from HasCallStack):
  14191. 1295.14 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  14192. 1295.14 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  14193. 1295.14 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  14194. 1295.14 s [vector] []
  14195. 1295.14 s [vector] zip: OK
  14196. 1295.14 s [vector] +++ OK, passed 100 tests.
  14197. 1295.14 s [vector] zip3: OK
  14198. 1295.14 s [vector] +++ OK, passed 100 tests.
  14199. 1295.14 s [vector] unzip: OK
  14200. 1295.14 s [vector] +++ OK, passed 100 tests.
  14201. 1295.14 s [vector] unzip3: OK
  14202. 1295.14 s [vector] +++ OK, passed 100 tests.
  14203. 1295.14 s [vector] indexed: OK
  14204. 1295.14 s [vector] +++ OK, passed 100 tests.
  14205. 1295.14 s [vector] update: OK
  14206. 1295.14 s [vector] +++ OK, passed 100 tests.
  14207. 1295.15 s [vector] concat: OK
  14208. 1295.15 s [vector] +++ OK, passed 100 tests.
  14209. 1295.15 s [vector] mempty: OK
  14210. 1295.15 s [vector] +++ OK, passed 100 tests.
  14211. 1295.15 s [vector] mappend: OK
  14212. 1295.15 s [vector] +++ OK, passed 100 tests.
  14213. 1295.16 s [vector] mconcat: OK
  14214. 1295.16 s [vector] +++ OK, passed 100 tests.
  14215. 1295.16 s [vector] fmap: OK
  14216. 1295.18 s [vector] +++ OK, passed 100 tests.
  14217. 1295.18 s [vector] return: OK
  14218. 1295.18 s [vector] +++ OK, passed 100 tests.
  14219. 1295.18 s [vector] bind: OK (0.02s)
  14220. 1295.18 s [vector] +++ OK, passed 100 tests.
  14221. 1295.18 s [vector] mzip: OK
  14222. 1295.18 s [vector] +++ OK, passed 100 tests.
  14223. 1295.18 s [vector] munzip: OK
  14224. 1295.18 s [vector] +++ OK, passed 100 tests.
  14225. 1295.20 s [vector] applicative_pure: OK
  14226. 1295.20 s [vector] +++ OK, passed 100 tests.
  14227. 1295.22 s [vector] applicative_appl: OK (0.04s)
  14228. 1295.22 s [vector] +++ OK, passed 100 tests.
  14229. 1295.22 s [vector] alternative_empty: OK
  14230. 1295.22 s [vector] +++ OK, passed 100 tests.
  14231. 1295.22 s [vector] alternative_or: OK
  14232. 1295.24 s [vector] +++ OK, passed 100 tests.
  14233. 1295.26 s [vector] sequence: OK (0.02s)
  14234. 1295.26 s [vector] +++ OK, passed 100 tests.
  14235. 1295.26 s [vector] sequence_: OK (0.02s)
  14236. 1295.26 s [vector] +++ OK, passed 100 tests.
  14237. 1295.26 s [vector] glength: OK
  14238. 1295.26 s [vector] +++ OK, passed 100 tests.
  14239. 1295.26 s [vector] sum: OK
  14240. 1295.26 s [vector] +++ OK, passed 100 tests.
  14241. 1295.26 s [vector] product: OK
  14242. 1295.26 s [vector] +++ OK, passed 100 tests.
  14243. 1295.26 s [vector] enumFromN: OK
  14244. 1295.26 s [vector] +++ OK, passed 100 tests.
  14245. 1295.26 s [vector] enumFromThenN: OK
  14246. 1295.26 s [vector] +++ OK, passed 100 tests.
  14247. 1295.26 s [vector] enumFromTo: OK
  14248. 1295.26 s [vector] +++ OK, passed 100 tests.
  14249. 1295.26 s [vector] enumFromThenTo: OK
  14250. 1295.26 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14251. 1295.26 s [vector] unstream
  14252. 1295.26 s [vector] unstream == vunstream (exact): OK
  14253. 1295.26 s [vector] +++ OK, passed 100 tests.
  14254. 1295.27 s [vector] unstream == vunstream (unknown): OK
  14255. 1295.27 s [vector] +++ OK, passed 100 tests.
  14256. 1295.27 s [vector] unstreamR ~= vunstream (exact): OK
  14257. 1295.27 s [vector] +++ OK, passed 100 tests.
  14258. 1295.27 s [vector] unstreamR ~= vunstream (unknown): OK
  14259. 1295.27 s [vector] +++ OK, passed 100 tests.
  14260. 1295.27 s [vector] Tests.Vector.Unboxed
  14261. 1295.27 s [vector] ()
  14262. 1295.27 s [vector] fromList.toList == id: OK
  14263. 1295.27 s [vector] +++ OK, passed 100 tests.
  14264. 1295.27 s [vector] toList.fromList == id: OK
  14265. 1295.27 s [vector] +++ OK, passed 100 tests.
  14266. 1295.27 s [vector] unstream.stream == id: OK
  14267. 1295.27 s [vector] +++ OK, passed 100 tests.
  14268. 1295.27 s [vector] stream.unstream == id: OK
  14269. 1295.27 s [vector] +++ OK, passed 100 tests.
  14270. 1295.27 s [vector] eq: OK
  14271. 1295.27 s [vector] +++ OK, passed 100 tests.
  14272. 1295.27 s [vector] length: OK
  14273. 1295.27 s [vector] +++ OK, passed 100 tests.
  14274. 1295.27 s [vector] null: OK
  14275. 1295.27 s [vector] +++ OK, passed 100 tests.
  14276. 1295.27 s [vector] index: OK
  14277. 1295.27 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14278. 1295.27 s [vector] safeIndex: OK
  14279. 1295.27 s [vector] +++ OK, passed 100 tests.
  14280. 1295.27 s [vector] head: OK
  14281. 1295.27 s [vector] +++ OK, passed 100 tests; 13 discarded.
  14282. 1295.27 s [vector] last: OK
  14283. 1295.27 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14284. 1295.27 s [vector] unsafeIndex: OK
  14285. 1295.27 s [vector] +++ OK, passed 100 tests; 13 discarded.
  14286. 1295.27 s [vector] unsafeHead: OK
  14287. 1295.27 s [vector] +++ OK, passed 100 tests; 13 discarded.
  14288. 1295.27 s [vector] unsafeLast: OK
  14289. 1295.27 s [vector] +++ OK, passed 100 tests; 13 discarded.
  14290. 1295.27 s [vector] slice: OK
  14291. 1295.27 s [vector] +++ OK, passed 100 tests.
  14292. 1295.27 s [vector] init: OK
  14293. 1295.27 s [vector] +++ OK, passed 100 tests; 21 discarded.
  14294. 1295.28 s [vector] tail: OK
  14295. 1295.28 s [vector] +++ OK, passed 100 tests; 13 discarded.
  14296. 1295.28 s [vector] take: OK
  14297. 1295.28 s [vector] +++ OK, passed 100 tests.
  14298. 1295.28 s [vector] drop: OK
  14299. 1295.28 s [vector] +++ OK, passed 100 tests.
  14300. 1295.28 s [vector] splitAt: OK
  14301. 1295.28 s [vector] +++ OK, passed 100 tests.
  14302. 1295.28 s [vector] empty: OK
  14303. 1295.28 s [vector] +++ OK, passed 100 tests.
  14304. 1295.28 s [vector] singleton: OK
  14305. 1295.28 s [vector] +++ OK, passed 100 tests.
  14306. 1295.28 s [vector] replicate: OK
  14307. 1295.28 s [vector] +++ OK, passed 100 tests.
  14308. 1295.28 s [vector] generate: OK
  14309. 1295.30 s [vector] +++ OK, passed 100 tests.
  14310. 1295.31 s [vector] iterateN: OK
  14311. 1295.31 s [vector] +++ OK, passed 100 tests.
  14312. 1295.32 s [vector] iterateNM: OK (0.03s)
  14313. 1295.32 s [vector] +++ OK, passed 100 tests.
  14314. 1295.34 s [vector] generateM: OK (0.02s)
  14315. 1295.34 s [vector] +++ OK, passed 100 tests.
  14316. 1295.35 s [vector] replicateM: OK (0.02s)
  14317. 1295.35 s [vector] +++ OK, passed 100 tests.
  14318. 1295.35 s [vector] create: OK
  14319. 1295.35 s [vector] +++ OK, passed 100 tests.
  14320. 1295.36 s [vector] createT: OK
  14321. 1295.36 s [vector] +++ OK, passed 100 tests.
  14322. 1295.36 s [vector] unfoldr: OK
  14323. 1295.36 s [vector] +++ OK, passed 100 tests.
  14324. 1295.36 s [vector] unfoldrN: OK
  14325. 1295.36 s [vector] +++ OK, passed 100 tests.
  14326. 1295.36 s [vector] unfoldrExactN: OK
  14327. 1295.36 s [vector] +++ OK, passed 100 tests.
  14328. 1295.36 s [vector] unfoldrM: OK
  14329. 1295.36 s [vector] +++ OK, passed 100 tests.
  14330. 1295.38 s [vector] unfoldrNM: OK
  14331. 1295.38 s [vector] +++ OK, passed 100 tests.
  14332. 1295.39 s [vector] unfoldrExactNM: OK (0.03s)
  14333. 1295.39 s [vector] +++ OK, passed 100 tests.
  14334. 1295.40 s [vector] constructN: OK
  14335. 1295.40 s [vector] +++ OK, passed 100 tests.
  14336. 1295.40 s [vector] constructrN: OK
  14337. 1295.40 s [vector] +++ OK, passed 100 tests.
  14338. 1295.40 s [vector] cons: OK
  14339. 1295.40 s [vector] +++ OK, passed 100 tests.
  14340. 1295.40 s [vector] snoc: OK
  14341. 1295.40 s [vector] +++ OK, passed 100 tests.
  14342. 1295.40 s [vector] append: OK
  14343. 1295.41 s [vector] +++ OK, passed 100 tests.
  14344. 1295.41 s [vector] concat: OK (0.01s)
  14345. 1295.41 s [vector] +++ OK, passed 100 tests.
  14346. 1295.41 s [vector] force: OK
  14347. 1295.41 s [vector] +++ OK, passed 100 tests.
  14348. 1295.42 s [vector] upd: OK
  14349. 1295.42 s [vector] +++ OK, passed 100 tests.
  14350. 1295.42 s [vector] accum: OK
  14351. 1295.42 s [vector] +++ OK, passed 100 tests.
  14352. 1295.42 s [vector] reverse: OK
  14353. 1295.42 s [vector] +++ OK, passed 100 tests.
  14354. 1295.42 s [vector] backpermute: OK
  14355. 1295.42 s [vector] +++ OK, passed 100 tests.
  14356. 1295.42 s [vector] map: OK
  14357. 1295.42 s [vector] +++ OK, passed 100 tests.
  14358. 1295.42 s [vector] imap: OK
  14359. 1295.42 s [vector] +++ OK, passed 100 tests.
  14360. 1295.42 s [vector] concatMap: OK
  14361. 1295.42 s [vector] +++ OK, passed 100 tests.
  14362. 1295.42 s [vector] mapM: OK
  14363. 1295.43 s [vector] +++ OK, passed 100 tests.
  14364. 1295.44 s [vector] mapM_: OK
  14365. 1295.45 s [vector] +++ OK, passed 100 tests.
  14366. 1295.45 s [vector] forM: OK
  14367. 1295.45 s [vector] +++ OK, passed 100 tests.
  14368. 1295.45 s [vector] forM_: OK (0.01s)
  14369. 1295.45 s [vector] +++ OK, passed 100 tests.
  14370. 1295.45 s [vector] imapM: OK
  14371. 1295.45 s [vector] +++ OK, passed 100 tests.
  14372. 1295.46 s [vector] imapM_: OK
  14373. 1295.46 s [vector] +++ OK, passed 100 tests.
  14374. 1295.46 s [vector] zipWith: OK
  14375. 1295.46 s [vector] +++ OK, passed 100 tests.
  14376. 1295.46 s [vector] zipWith3: OK
  14377. 1295.46 s [vector] +++ OK, passed 100 tests.
  14378. 1295.46 s [vector] izipWith: OK
  14379. 1295.46 s [vector] +++ OK, passed 100 tests.
  14380. 1295.47 s [vector] izipWith3: OK
  14381. 1295.47 s [vector] +++ OK, passed 100 tests.
  14382. 1295.47 s [vector] izipWithM: OK
  14383. 1295.47 s [vector] +++ OK, passed 100 tests.
  14384. 1295.48 s [vector] izipWithM_: OK
  14385. 1295.48 s [vector] +++ OK, passed 100 tests.
  14386. 1295.48 s [vector] zipWithM: OK
  14387. 1295.48 s [vector] +++ OK, passed 100 tests.
  14388. 1295.48 s [vector] zipWithM_: OK
  14389. 1295.48 s [vector] +++ OK, passed 100 tests.
  14390. 1295.48 s [vector] filter: OK
  14391. 1295.48 s [vector] +++ OK, passed 100 tests.
  14392. 1295.48 s [vector] ifilter: OK
  14393. 1295.48 s [vector] +++ OK, passed 100 tests.
  14394. 1295.51 s [vector] filterM: OK (0.02s)
  14395. 1295.51 s [vector] +++ OK, passed 100 tests.
  14396. 1295.51 s [vector] uniq: OK
  14397. 1295.51 s [vector] +++ OK, passed 100 tests.
  14398. 1295.52 s [vector] mapMaybe: OK
  14399. 1295.52 s [vector] +++ OK, passed 100 tests.
  14400. 1295.52 s [vector] imapMaybe: OK
  14401. 1295.52 s [vector] +++ OK, passed 100 tests.
  14402. 1295.52 s [vector] takeWhile: OK
  14403. 1295.52 s [vector] +++ OK, passed 100 tests.
  14404. 1295.52 s [vector] dropWhile: OK
  14405. 1295.52 s [vector] +++ OK, passed 100 tests.
  14406. 1295.52 s [vector] partition: OK
  14407. 1295.52 s [vector] +++ OK, passed 100 tests.
  14408. 1295.52 s [vector] partitionWith: OK
  14409. 1295.52 s [vector] +++ OK, passed 100 tests.
  14410. 1295.52 s [vector] span: OK
  14411. 1295.52 s [vector] +++ OK, passed 100 tests.
  14412. 1295.52 s [vector] break: OK
  14413. 1295.52 s [vector] +++ OK, passed 100 tests.
  14414. 1295.52 s [vector] spanR: OK
  14415. 1295.52 s [vector] +++ OK, passed 100 tests.
  14416. 1295.53 s [vector] breakR: OK
  14417. 1295.53 s [vector] +++ OK, passed 100 tests.
  14418. 1295.53 s [vector] groupBy: OK
  14419. 1295.53 s [vector] +++ OK, passed 100 tests.
  14420. 1295.53 s [vector] elem: OK
  14421. 1295.53 s [vector] +++ OK, passed 100 tests.
  14422. 1295.53 s [vector] notElem: OK
  14423. 1295.53 s [vector] +++ OK, passed 100 tests.
  14424. 1295.53 s [vector] find: OK
  14425. 1295.53 s [vector] +++ OK, passed 100 tests.
  14426. 1295.53 s [vector] findIndex: OK
  14427. 1295.53 s [vector] +++ OK, passed 100 tests.
  14428. 1295.53 s [vector] findIndexR: OK
  14429. 1295.53 s [vector] +++ OK, passed 100 tests.
  14430. 1295.53 s [vector] findIndices: OK
  14431. 1295.53 s [vector] +++ OK, passed 100 tests.
  14432. 1295.53 s [vector] elemIndex: OK
  14433. 1295.53 s [vector] +++ OK, passed 100 tests.
  14434. 1295.53 s [vector] elemIndices: OK
  14435. 1295.53 s [vector] +++ OK, passed 100 tests.
  14436. 1295.53 s [vector] foldl: OK
  14437. 1295.53 s [vector] +++ OK, passed 100 tests.
  14438. 1295.53 s [vector] foldl1: OK
  14439. 1295.53 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14440. 1295.53 s [vector] foldl': OK
  14441. 1295.53 s [vector] +++ OK, passed 100 tests.
  14442. 1295.53 s [vector] foldl1': OK
  14443. 1295.53 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14444. 1295.53 s [vector] foldr: OK
  14445. 1295.53 s [vector] +++ OK, passed 100 tests.
  14446. 1295.53 s [vector] foldr1: OK
  14447. 1295.53 s [vector] +++ OK, passed 100 tests; 19 discarded.
  14448. 1295.53 s [vector] foldr': OK
  14449. 1295.53 s [vector] +++ OK, passed 100 tests.
  14450. 1295.53 s [vector] foldr1': OK
  14451. 1295.53 s [vector] +++ OK, passed 100 tests; 19 discarded.
  14452. 1295.54 s [vector] ifoldl: OK
  14453. 1295.54 s [vector] +++ OK, passed 100 tests.
  14454. 1295.54 s [vector] ifoldl': OK
  14455. 1295.54 s [vector] +++ OK, passed 100 tests.
  14456. 1295.54 s [vector] ifoldr: OK
  14457. 1295.54 s [vector] +++ OK, passed 100 tests.
  14458. 1295.55 s [vector] ifoldr': OK
  14459. 1295.55 s [vector] +++ OK, passed 100 tests.
  14460. 1295.56 s [vector] ifoldM: OK
  14461. 1295.56 s [vector] +++ OK, passed 100 tests.
  14462. 1295.56 s [vector] ifoldM': OK
  14463. 1295.56 s [vector] +++ OK, passed 100 tests.
  14464. 1295.56 s [vector] ifoldM_: OK
  14465. 1295.56 s [vector] +++ OK, passed 100 tests.
  14466. 1295.56 s [vector] ifoldM'_: OK
  14467. 1295.56 s [vector] +++ OK, passed 100 tests.
  14468. 1295.56 s [vector] all: OK
  14469. 1295.56 s [vector] +++ OK, passed 100 tests.
  14470. 1295.56 s [vector] any: OK
  14471. 1295.56 s [vector] +++ OK, passed 100 tests.
  14472. 1295.56 s [vector] prescanl: OK
  14473. 1295.56 s [vector] +++ OK, passed 100 tests.
  14474. 1295.56 s [vector] prescanl': OK
  14475. 1295.56 s [vector] +++ OK, passed 100 tests.
  14476. 1295.56 s [vector] postscanl: OK
  14477. 1295.56 s [vector] +++ OK, passed 100 tests.
  14478. 1295.56 s [vector] postscanl': OK
  14479. 1295.56 s [vector] +++ OK, passed 100 tests.
  14480. 1295.56 s [vector] scanl: OK
  14481. 1295.56 s [vector] +++ OK, passed 100 tests.
  14482. 1295.56 s [vector] scanl': OK
  14483. 1295.56 s [vector] +++ OK, passed 100 tests.
  14484. 1295.56 s [vector] scanl1: OK
  14485. 1295.56 s [vector] +++ OK, passed 100 tests.
  14486. 1295.56 s [vector] scanl1': OK
  14487. 1295.56 s [vector] +++ OK, passed 100 tests.
  14488. 1295.56 s [vector] iscanl: OK
  14489. 1295.57 s [vector] +++ OK, passed 100 tests.
  14490. 1295.57 s [vector] iscanl': OK
  14491. 1295.57 s [vector] +++ OK, passed 100 tests.
  14492. 1295.57 s [vector] prescanr: OK
  14493. 1295.57 s [vector] +++ OK, passed 100 tests.
  14494. 1295.57 s [vector] prescanr': OK
  14495. 1295.57 s [vector] +++ OK, passed 100 tests.
  14496. 1295.57 s [vector] postscanr: OK
  14497. 1295.57 s [vector] +++ OK, passed 100 tests.
  14498. 1295.57 s [vector] postscanr': OK
  14499. 1295.57 s [vector] +++ OK, passed 100 tests.
  14500. 1295.57 s [vector] scanr: OK
  14501. 1295.57 s [vector] +++ OK, passed 100 tests.
  14502. 1295.57 s [vector] scanr': OK
  14503. 1295.57 s [vector] +++ OK, passed 100 tests.
  14504. 1295.57 s [vector] scanr1: OK
  14505. 1295.57 s [vector] +++ OK, passed 100 tests.
  14506. 1295.57 s [vector] scanr1': OK
  14507. 1295.57 s [vector] +++ OK, passed 100 tests.
  14508. 1295.57 s [vector] iscanr: OK
  14509. 1295.57 s [vector] +++ OK, passed 100 tests.
  14510. 1295.57 s [vector] iscanr': OK
  14511. 1295.57 s [vector] +++ OK, passed 100 tests.
  14512. 1295.57 s [vector] mut_read: OK
  14513. 1295.57 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14514. 1295.58 s [vector] mut_write: OK
  14515. 1295.58 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14516. 1295.58 s [vector] mut_modify: OK
  14517. 1295.58 s [vector] +++ OK, passed 100 tests; 11 discarded.
  14518. 1295.58 s [vector] mut_generate: OK
  14519. 1295.58 s [vector] +++ OK, passed 100 tests.
  14520. 1295.58 s [vector] mut_generateM: OK
  14521. 1295.58 s [vector] +++ OK, passed 100 tests.
  14522. 1295.59 s [vector] mut_mapM_: OK
  14523. 1295.59 s [vector] +++ OK, passed 100 tests.
  14524. 1295.60 s [vector] mut_imapM_: OK
  14525. 1295.60 s [vector] +++ OK, passed 100 tests.
  14526. 1295.62 s [vector] mut_forM_: OK (0.01s)
  14527. 1295.62 s [vector] +++ OK, passed 100 tests.
  14528. 1295.62 s [vector] mut_iforM_: OK
  14529. 1295.62 s [vector] +++ OK, passed 100 tests.
  14530. 1295.62 s [vector] mut_foldr: OK
  14531. 1295.62 s [vector] +++ OK, passed 100 tests.
  14532. 1295.62 s [vector] mut_foldr': OK
  14533. 1295.62 s [vector] +++ OK, passed 100 tests.
  14534. 1295.62 s [vector] mut_foldl: OK
  14535. 1295.62 s [vector] +++ OK, passed 100 tests.
  14536. 1295.62 s [vector] mut_foldl': OK
  14537. 1295.62 s [vector] +++ OK, passed 100 tests.
  14538. 1295.62 s [vector] mut_ifoldr: OK
  14539. 1295.62 s [vector] +++ OK, passed 100 tests.
  14540. 1295.62 s [vector] mut_ifoldr': OK
  14541. 1295.62 s [vector] +++ OK, passed 100 tests.
  14542. 1295.62 s [vector] mut_ifoldl: OK
  14543. 1295.62 s [vector] +++ OK, passed 100 tests.
  14544. 1295.62 s [vector] mut_ifoldl': OK
  14545. 1295.62 s [vector] +++ OK, passed 100 tests.
  14546. 1295.63 s [vector] mut_foldM: OK
  14547. 1295.63 s [vector] +++ OK, passed 100 tests.
  14548. 1295.63 s [vector] mut_foldM': OK
  14549. 1295.63 s [vector] +++ OK, passed 100 tests.
  14550. 1295.63 s [vector] mut_foldrM: OK
  14551. 1295.63 s [vector] +++ OK, passed 100 tests.
  14552. 1295.63 s [vector] mut_foldrM': OK
  14553. 1295.63 s [vector] +++ OK, passed 100 tests.
  14554. 1295.63 s [vector] mut_ifoldM: OK
  14555. 1295.63 s [vector] +++ OK, passed 100 tests.
  14556. 1295.63 s [vector] mut_ifoldM': OK
  14557. 1295.63 s [vector] +++ OK, passed 100 tests.
  14558. 1295.63 s [vector] mut_ifoldrM: OK
  14559. 1295.63 s [vector] +++ OK, passed 100 tests.
  14560. 1295.63 s [vector] mut_ifoldrM': OK
  14561. 1295.63 s [vector] +++ OK, passed 100 tests.
  14562. 1295.63 s [vector] compare: OK
  14563. 1295.63 s [vector] +++ OK, passed 100 tests.
  14564. 1295.63 s [vector] maximum: OK
  14565. 1295.63 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14566. 1295.63 s [vector] minimum: OK
  14567. 1295.63 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14568. 1295.63 s [vector] minIndex: OK
  14569. 1295.63 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14570. 1295.63 s [vector] maxIndex: OK
  14571. 1295.63 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14572. 1295.63 s [vector] maximumBy: OK
  14573. 1295.63 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14574. 1295.63 s [vector] minimumBy: OK
  14575. 1295.63 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14576. 1295.63 s [vector] maximumOn: OK
  14577. 1295.63 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14578. 1295.63 s [vector] minimumOn: OK
  14579. 1295.63 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14580. 1295.64 s [vector] maxIndexBy: OK
  14581. 1295.64 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14582. 1295.64 s [vector] minIndexBy: OK
  14583. 1295.64 s [vector] +++ OK, passed 100 tests; 11 discarded.
  14584. 1295.64 s [vector] ListFirstMaxIndexWins: OK
  14585. 1295.64 s [vector] +++ OK, passed 100 tests; 20 discarded.
  14586. 1295.64 s [vector] FalseListFirstMaxIndexWins: OK
  14587. 1295.64 s [vector] +++ OK, failed as expected. (after 1 test):
  14588. 1295.64 s [vector] Exception:
  14589. 1295.64 s [vector] Prelude.foldr1: empty list
  14590. 1295.64 s [vector] CallStack (from HasCallStack):
  14591. 1295.64 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  14592. 1295.64 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  14593. 1295.64 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  14594. 1295.64 s [vector] []
  14595. 1295.64 s [vector] zip: OK
  14596. 1295.64 s [vector] +++ OK, passed 100 tests.
  14597. 1295.64 s [vector] zip3: OK
  14598. 1295.64 s [vector] +++ OK, passed 100 tests.
  14599. 1295.64 s [vector] unzip: OK
  14600. 1295.64 s [vector] +++ OK, passed 100 tests.
  14601. 1295.64 s [vector] unzip3: OK
  14602. 1295.64 s [vector] +++ OK, passed 100 tests.
  14603. 1295.64 s [vector] indexed: OK
  14604. 1295.64 s [vector] +++ OK, passed 100 tests.
  14605. 1295.64 s [vector] update: OK
  14606. 1295.64 s [vector] +++ OK, passed 100 tests.
  14607. 1295.64 s [vector] mempty: OK
  14608. 1295.64 s [vector] +++ OK, passed 100 tests.
  14609. 1295.64 s [vector] mappend: OK
  14610. 1295.64 s [vector] +++ OK, passed 100 tests.
  14611. 1295.65 s [vector] mconcat: OK
  14612. 1295.65 s [vector] +++ OK, passed 100 tests.
  14613. 1295.65 s [vector] glength: OK
  14614. 1295.65 s [vector] +++ OK, passed 100 tests.
  14615. 1295.65 s [vector] (Bool)
  14616. 1295.65 s [vector] fromList.toList == id: OK
  14617. 1295.65 s [vector] +++ OK, passed 100 tests.
  14618. 1295.65 s [vector] toList.fromList == id: OK
  14619. 1295.65 s [vector] +++ OK, passed 100 tests.
  14620. 1295.65 s [vector] unstream.stream == id: OK
  14621. 1295.65 s [vector] +++ OK, passed 100 tests.
  14622. 1295.65 s [vector] stream.unstream == id: OK
  14623. 1295.65 s [vector] +++ OK, passed 100 tests.
  14624. 1295.65 s [vector] eq: OK
  14625. 1295.65 s [vector] +++ OK, passed 100 tests.
  14626. 1295.65 s [vector] length: OK
  14627. 1295.65 s [vector] +++ OK, passed 100 tests.
  14628. 1295.65 s [vector] null: OK
  14629. 1295.65 s [vector] +++ OK, passed 100 tests.
  14630. 1295.65 s [vector] index: OK
  14631. 1295.65 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14632. 1295.65 s [vector] safeIndex: OK
  14633. 1295.65 s [vector] +++ OK, passed 100 tests.
  14634. 1295.65 s [vector] head: OK
  14635. 1295.65 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14636. 1295.65 s [vector] last: OK
  14637. 1295.65 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14638. 1295.66 s [vector] unsafeIndex: OK
  14639. 1295.66 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14640. 1295.66 s [vector] unsafeHead: OK
  14641. 1295.66 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14642. 1295.66 s [vector] unsafeLast: OK
  14643. 1295.66 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14644. 1295.66 s [vector] slice: OK
  14645. 1295.66 s [vector] +++ OK, passed 100 tests.
  14646. 1295.66 s [vector] init: OK
  14647. 1295.66 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14648. 1295.66 s [vector] tail: OK
  14649. 1295.66 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14650. 1295.66 s [vector] take: OK
  14651. 1295.66 s [vector] +++ OK, passed 100 tests.
  14652. 1295.66 s [vector] drop: OK
  14653. 1295.66 s [vector] +++ OK, passed 100 tests.
  14654. 1295.66 s [vector] splitAt: OK
  14655. 1295.66 s [vector] +++ OK, passed 100 tests.
  14656. 1295.66 s [vector] empty: OK
  14657. 1295.66 s [vector] +++ OK, passed 100 tests.
  14658. 1295.66 s [vector] singleton: OK
  14659. 1295.66 s [vector] +++ OK, passed 100 tests.
  14660. 1295.66 s [vector] replicate: OK
  14661. 1295.66 s [vector] +++ OK, passed 100 tests.
  14662. 1295.66 s [vector] generate: OK
  14663. 1295.66 s [vector] +++ OK, passed 100 tests.
  14664. 1295.66 s [vector] iterateN: OK
  14665. 1295.66 s [vector] +++ OK, passed 100 tests.
  14666. 1295.69 s [vector] iterateNM: OK (0.01s)
  14667. 1295.69 s [vector] +++ OK, passed 100 tests.
  14668. 1295.72 s [vector] generateM: OK (0.02s)
  14669. 1295.72 s [vector] +++ OK, passed 100 tests.
  14670. 1295.74 s [vector] replicateM: OK (0.02s)
  14671. 1295.74 s [vector] +++ OK, passed 100 tests.
  14672. 1295.74 s [vector] create: OK
  14673. 1295.74 s [vector] +++ OK, passed 100 tests.
  14674. 1295.74 s [vector] createT: OK
  14675. 1295.74 s [vector] +++ OK, passed 100 tests.
  14676. 1295.74 s [vector] unfoldr: OK
  14677. 1295.74 s [vector] +++ OK, passed 100 tests.
  14678. 1295.74 s [vector] unfoldrN: OK
  14679. 1295.74 s [vector] +++ OK, passed 100 tests.
  14680. 1295.75 s [vector] unfoldrExactN: OK
  14681. 1295.76 s [vector] +++ OK, passed 100 tests.
  14682. 1295.76 s [vector] unfoldrM: OK
  14683. 1295.76 s [vector] +++ OK, passed 100 tests.
  14684. 1295.76 s [vector] unfoldrNM: OK
  14685. 1295.76 s [vector] +++ OK, passed 100 tests.
  14686. 1295.79 s [vector] unfoldrExactNM: OK (0.04s)
  14687. 1295.79 s [vector] +++ OK, passed 100 tests.
  14688. 1295.80 s [vector] constructN: OK
  14689. 1295.80 s [vector] +++ OK, passed 100 tests.
  14690. 1295.80 s [vector] constructrN: OK
  14691. 1295.80 s [vector] +++ OK, passed 100 tests.
  14692. 1295.81 s [vector] cons: OK
  14693. 1295.82 s [vector] +++ OK, passed 100 tests.
  14694. 1295.82 s [vector] snoc: OK
  14695. 1295.82 s [vector] +++ OK, passed 100 tests.
  14696. 1295.82 s [vector] append: OK
  14697. 1295.82 s [vector] +++ OK, passed 100 tests.
  14698. 1295.82 s [vector] concat: OK (0.01s)
  14699. 1295.82 s [vector] +++ OK, passed 100 tests.
  14700. 1295.82 s [vector] force: OK
  14701. 1295.83 s [vector] +++ OK, passed 100 tests.
  14702. 1295.83 s [vector] upd: OK
  14703. 1295.83 s [vector] +++ OK, passed 100 tests.
  14704. 1295.83 s [vector] accum: OK
  14705. 1295.83 s [vector] +++ OK, passed 100 tests.
  14706. 1295.83 s [vector] reverse: OK
  14707. 1295.83 s [vector] +++ OK, passed 100 tests.
  14708. 1295.83 s [vector] backpermute: OK
  14709. 1295.83 s [vector] +++ OK, passed 100 tests.
  14710. 1295.83 s [vector] map: OK
  14711. 1295.83 s [vector] +++ OK, passed 100 tests.
  14712. 1295.83 s [vector] imap: OK
  14713. 1295.83 s [vector] +++ OK, passed 100 tests.
  14714. 1295.83 s [vector] concatMap: OK
  14715. 1295.83 s [vector] +++ OK, passed 100 tests.
  14716. 1295.84 s [vector] mapM: OK
  14717. 1295.84 s [vector] +++ OK, passed 100 tests.
  14718. 1295.84 s [vector] mapM_: OK (0.01s)
  14719. 1295.84 s [vector] +++ OK, passed 100 tests.
  14720. 1295.84 s [vector] forM: OK
  14721. 1295.84 s [vector] +++ OK, passed 100 tests.
  14722. 1295.85 s [vector] forM_: OK (0.01s)
  14723. 1295.85 s [vector] +++ OK, passed 100 tests.
  14724. 1295.86 s [vector] imapM: OK
  14725. 1295.86 s [vector] +++ OK, passed 100 tests.
  14726. 1295.87 s [vector] imapM_: OK (0.01s)
  14727. 1295.87 s [vector] +++ OK, passed 100 tests.
  14728. 1295.87 s [vector] zipWith: OK
  14729. 1295.87 s [vector] +++ OK, passed 100 tests.
  14730. 1295.87 s [vector] zipWith3: OK
  14731. 1295.87 s [vector] +++ OK, passed 100 tests.
  14732. 1295.88 s [vector] izipWith: OK
  14733. 1295.88 s [vector] +++ OK, passed 100 tests.
  14734. 1295.88 s [vector] izipWith3: OK
  14735. 1295.88 s [vector] +++ OK, passed 100 tests.
  14736. 1295.89 s [vector] izipWithM: OK
  14737. 1295.89 s [vector] +++ OK, passed 100 tests.
  14738. 1295.89 s [vector] izipWithM_: OK
  14739. 1295.89 s [vector] +++ OK, passed 100 tests.
  14740. 1295.89 s [vector] zipWithM: OK
  14741. 1295.89 s [vector] +++ OK, passed 100 tests.
  14742. 1295.90 s [vector] zipWithM_: OK
  14743. 1295.90 s [vector] +++ OK, passed 100 tests.
  14744. 1295.90 s [vector] filter: OK
  14745. 1295.90 s [vector] +++ OK, passed 100 tests.
  14746. 1295.92 s [vector] ifilter: OK
  14747. 1295.92 s [vector] +++ OK, passed 100 tests.
  14748. 1295.92 s [vector] filterM: OK (0.02s)
  14749. 1295.92 s [vector] +++ OK, passed 100 tests.
  14750. 1295.92 s [vector] uniq: OK
  14751. 1295.92 s [vector] +++ OK, passed 100 tests.
  14752. 1295.92 s [vector] mapMaybe: OK
  14753. 1295.92 s [vector] +++ OK, passed 100 tests.
  14754. 1295.92 s [vector] imapMaybe: OK
  14755. 1295.92 s [vector] +++ OK, passed 100 tests.
  14756. 1295.93 s [vector] takeWhile: OK
  14757. 1295.93 s [vector] +++ OK, passed 100 tests.
  14758. 1295.93 s [vector] dropWhile: OK
  14759. 1295.93 s [vector] +++ OK, passed 100 tests.
  14760. 1295.93 s [vector] partition: OK
  14761. 1295.93 s [vector] +++ OK, passed 100 tests.
  14762. 1295.93 s [vector] partitionWith: OK
  14763. 1295.93 s [vector] +++ OK, passed 100 tests.
  14764. 1295.93 s [vector] span: OK
  14765. 1295.93 s [vector] +++ OK, passed 100 tests.
  14766. 1295.93 s [vector] break: OK
  14767. 1295.93 s [vector] +++ OK, passed 100 tests.
  14768. 1295.93 s [vector] spanR: OK
  14769. 1295.93 s [vector] +++ OK, passed 100 tests.
  14770. 1295.93 s [vector] breakR: OK
  14771. 1295.93 s [vector] +++ OK, passed 100 tests.
  14772. 1295.93 s [vector] groupBy: OK
  14773. 1295.93 s [vector] +++ OK, passed 100 tests.
  14774. 1295.93 s [vector] elem: OK
  14775. 1295.93 s [vector] +++ OK, passed 100 tests.
  14776. 1295.93 s [vector] notElem: OK
  14777. 1295.93 s [vector] +++ OK, passed 100 tests.
  14778. 1295.93 s [vector] find: OK
  14779. 1295.93 s [vector] +++ OK, passed 100 tests.
  14780. 1295.94 s [vector] findIndex: OK
  14781. 1295.94 s [vector] +++ OK, passed 100 tests.
  14782. 1295.94 s [vector] findIndexR: OK
  14783. 1295.94 s [vector] +++ OK, passed 100 tests.
  14784. 1295.94 s [vector] findIndices: OK
  14785. 1295.94 s [vector] +++ OK, passed 100 tests.
  14786. 1295.94 s [vector] elemIndex: OK
  14787. 1295.94 s [vector] +++ OK, passed 100 tests.
  14788. 1295.94 s [vector] elemIndices: OK
  14789. 1295.94 s [vector] +++ OK, passed 100 tests.
  14790. 1295.94 s [vector] foldl: OK
  14791. 1295.94 s [vector] +++ OK, passed 100 tests.
  14792. 1295.94 s [vector] foldl1: OK
  14793. 1295.94 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14794. 1295.94 s [vector] foldl': OK
  14795. 1295.94 s [vector] +++ OK, passed 100 tests.
  14796. 1295.94 s [vector] foldl1': OK
  14797. 1295.94 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14798. 1295.94 s [vector] foldr: OK
  14799. 1295.94 s [vector] +++ OK, passed 100 tests.
  14800. 1295.94 s [vector] foldr1: OK
  14801. 1295.94 s [vector] +++ OK, passed 100 tests; 13 discarded.
  14802. 1295.95 s [vector] foldr': OK
  14803. 1295.95 s [vector] +++ OK, passed 100 tests.
  14804. 1295.95 s [vector] foldr1': OK
  14805. 1295.95 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14806. 1295.95 s [vector] ifoldl: OK
  14807. 1295.95 s [vector] +++ OK, passed 100 tests.
  14808. 1295.95 s [vector] ifoldl': OK
  14809. 1295.95 s [vector] +++ OK, passed 100 tests.
  14810. 1295.95 s [vector] ifoldr: OK
  14811. 1295.95 s [vector] +++ OK, passed 100 tests.
  14812. 1295.95 s [vector] ifoldr': OK
  14813. 1295.96 s [vector] +++ OK, passed 100 tests.
  14814. 1295.96 s [vector] ifoldM: OK
  14815. 1295.96 s [vector] +++ OK, passed 100 tests.
  14816. 1295.97 s [vector] ifoldM': OK (0.01s)
  14817. 1295.97 s [vector] +++ OK, passed 100 tests.
  14818. 1295.99 s [vector] ifoldM_: OK
  14819. 1295.99 s [vector] +++ OK, passed 100 tests.
  14820. 1295.99 s [vector] ifoldM'_: OK (0.01s)
  14821. 1295.99 s [vector] +++ OK, passed 100 tests.
  14822. 1295.99 s [vector] all: OK
  14823. 1295.99 s [vector] +++ OK, passed 100 tests.
  14824. 1295.99 s [vector] any: OK
  14825. 1295.99 s [vector] +++ OK, passed 100 tests.
  14826. 1296.00 s [vector] prescanl: OK
  14827. 1296.00 s [vector] +++ OK, passed 100 tests.
  14828. 1296.00 s [vector] prescanl': OK
  14829. 1296.00 s [vector] +++ OK, passed 100 tests.
  14830. 1296.00 s [vector] postscanl: OK
  14831. 1296.00 s [vector] +++ OK, passed 100 tests.
  14832. 1296.00 s [vector] postscanl': OK
  14833. 1296.00 s [vector] +++ OK, passed 100 tests.
  14834. 1296.00 s [vector] scanl: OK
  14835. 1296.00 s [vector] +++ OK, passed 100 tests.
  14836. 1296.00 s [vector] scanl': OK
  14837. 1296.01 s [vector] +++ OK, passed 100 tests.
  14838. 1296.01 s [vector] scanl1: OK
  14839. 1296.01 s [vector] +++ OK, passed 100 tests.
  14840. 1296.01 s [vector] scanl1': OK
  14841. 1296.01 s [vector] +++ OK, passed 100 tests.
  14842. 1296.01 s [vector] iscanl: OK
  14843. 1296.01 s [vector] +++ OK, passed 100 tests.
  14844. 1296.01 s [vector] iscanl': OK
  14845. 1296.01 s [vector] +++ OK, passed 100 tests.
  14846. 1296.01 s [vector] prescanr: OK
  14847. 1296.02 s [vector] +++ OK, passed 100 tests.
  14848. 1296.02 s [vector] prescanr': OK
  14849. 1296.02 s [vector] +++ OK, passed 100 tests.
  14850. 1296.02 s [vector] postscanr: OK
  14851. 1296.02 s [vector] +++ OK, passed 100 tests.
  14852. 1296.02 s [vector] postscanr': OK
  14853. 1296.02 s [vector] +++ OK, passed 100 tests.
  14854. 1296.02 s [vector] scanr: OK
  14855. 1296.02 s [vector] +++ OK, passed 100 tests.
  14856. 1296.02 s [vector] scanr': OK
  14857. 1296.02 s [vector] +++ OK, passed 100 tests.
  14858. 1296.02 s [vector] scanr1: OK
  14859. 1296.02 s [vector] +++ OK, passed 100 tests.
  14860. 1296.03 s [vector] scanr1': OK
  14861. 1296.03 s [vector] +++ OK, passed 100 tests.
  14862. 1296.03 s [vector] iscanr: OK
  14863. 1296.03 s [vector] +++ OK, passed 100 tests.
  14864. 1296.03 s [vector] iscanr': OK
  14865. 1296.03 s [vector] +++ OK, passed 100 tests.
  14866. 1296.03 s [vector] mut_read: OK
  14867. 1296.03 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14868. 1296.03 s [vector] mut_write: OK
  14869. 1296.03 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14870. 1296.03 s [vector] mut_modify: OK
  14871. 1296.03 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14872. 1296.03 s [vector] mut_generate: OK
  14873. 1296.04 s [vector] +++ OK, passed 100 tests.
  14874. 1296.05 s [vector] mut_generateM: OK
  14875. 1296.06 s [vector] +++ OK, passed 100 tests.
  14876. 1296.06 s [vector] mut_mapM_: OK (0.01s)
  14877. 1296.06 s [vector] +++ OK, passed 100 tests.
  14878. 1296.07 s [vector] mut_imapM_: OK (0.01s)
  14879. 1296.08 s [vector] +++ OK, passed 100 tests.
  14880. 1296.08 s [vector] mut_forM_: OK (0.01s)
  14881. 1296.08 s [vector] +++ OK, passed 100 tests.
  14882. 1296.09 s [vector] mut_iforM_: OK (0.02s)
  14883. 1296.09 s [vector] +++ OK, passed 100 tests.
  14884. 1296.09 s [vector] mut_foldr: OK
  14885. 1296.09 s [vector] +++ OK, passed 100 tests.
  14886. 1296.09 s [vector] mut_foldr': OK
  14887. 1296.09 s [vector] +++ OK, passed 100 tests.
  14888. 1296.09 s [vector] mut_foldl: OK
  14889. 1296.10 s [vector] +++ OK, passed 100 tests.
  14890. 1296.10 s [vector] mut_foldl': OK
  14891. 1296.10 s [vector] +++ OK, passed 100 tests.
  14892. 1296.10 s [vector] mut_ifoldr: OK
  14893. 1296.10 s [vector] +++ OK, passed 100 tests.
  14894. 1296.10 s [vector] mut_ifoldr': OK
  14895. 1296.10 s [vector] +++ OK, passed 100 tests.
  14896. 1296.10 s [vector] mut_ifoldl: OK
  14897. 1296.10 s [vector] +++ OK, passed 100 tests.
  14898. 1296.10 s [vector] mut_ifoldl': OK
  14899. 1296.11 s [vector] +++ OK, passed 100 tests.
  14900. 1296.11 s [vector] mut_foldM: OK
  14901. 1296.11 s [vector] +++ OK, passed 100 tests.
  14902. 1296.11 s [vector] mut_foldM': OK
  14903. 1296.11 s [vector] +++ OK, passed 100 tests.
  14904. 1296.11 s [vector] mut_foldrM: OK
  14905. 1296.11 s [vector] +++ OK, passed 100 tests.
  14906. 1296.11 s [vector] mut_foldrM': OK
  14907. 1296.11 s [vector] +++ OK, passed 100 tests.
  14908. 1296.11 s [vector] mut_ifoldM: OK
  14909. 1296.11 s [vector] +++ OK, passed 100 tests.
  14910. 1296.12 s [vector] mut_ifoldM': OK
  14911. 1296.12 s [vector] +++ OK, passed 100 tests.
  14912. 1296.12 s [vector] mut_ifoldrM: OK
  14913. 1296.12 s [vector] +++ OK, passed 100 tests.
  14914. 1296.12 s [vector] mut_ifoldrM': OK
  14915. 1296.12 s [vector] +++ OK, passed 100 tests.
  14916. 1296.12 s [vector] compare: OK
  14917. 1296.12 s [vector] +++ OK, passed 100 tests.
  14918. 1296.12 s [vector] maximum: OK
  14919. 1296.12 s [vector] +++ OK, passed 100 tests; 19 discarded.
  14920. 1296.12 s [vector] minimum: OK
  14921. 1296.12 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14922. 1296.12 s [vector] minIndex: OK
  14923. 1296.12 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14924. 1296.12 s [vector] maxIndex: OK
  14925. 1296.12 s [vector] +++ OK, passed 100 tests; 26 discarded.
  14926. 1296.12 s [vector] maximumBy: OK
  14927. 1296.12 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14928. 1296.12 s [vector] minimumBy: OK
  14929. 1296.12 s [vector] +++ OK, passed 100 tests; 13 discarded.
  14930. 1296.12 s [vector] maximumOn: OK
  14931. 1296.12 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14932. 1296.12 s [vector] minimumOn: OK
  14933. 1296.12 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14934. 1296.12 s [vector] maxIndexBy: OK
  14935. 1296.12 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14936. 1296.12 s [vector] minIndexBy: OK
  14937. 1296.12 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14938. 1296.12 s [vector] ListFirstMaxIndexWins: OK
  14939. 1296.12 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14940. 1296.12 s [vector] FalseListFirstMaxIndexWins: OK
  14941. 1296.12 s [vector] +++ OK, failed as expected. (after 1 test):
  14942. 1296.12 s [vector] Exception:
  14943. 1296.12 s [vector] Prelude.foldr1: empty list
  14944. 1296.13 s [vector] CallStack (from HasCallStack):
  14945. 1296.13 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  14946. 1296.13 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  14947. 1296.13 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  14948. 1296.13 s [vector] []
  14949. 1296.13 s [vector] zip: OK
  14950. 1296.13 s [vector] +++ OK, passed 100 tests.
  14951. 1296.13 s [vector] zip3: OK
  14952. 1296.13 s [vector] +++ OK, passed 100 tests.
  14953. 1296.13 s [vector] unzip: OK
  14954. 1296.13 s [vector] +++ OK, passed 100 tests.
  14955. 1296.13 s [vector] unzip3: OK
  14956. 1296.13 s [vector] +++ OK, passed 100 tests.
  14957. 1296.13 s [vector] indexed: OK
  14958. 1296.13 s [vector] +++ OK, passed 100 tests.
  14959. 1296.13 s [vector] update: OK
  14960. 1296.13 s [vector] +++ OK, passed 100 tests.
  14961. 1296.13 s [vector] mempty: OK
  14962. 1296.13 s [vector] +++ OK, passed 100 tests.
  14963. 1296.13 s [vector] mappend: OK
  14964. 1296.13 s [vector] +++ OK, passed 100 tests.
  14965. 1296.14 s [vector] mconcat: OK
  14966. 1296.14 s [vector] +++ OK, passed 100 tests.
  14967. 1296.14 s [vector] glength: OK
  14968. 1296.14 s [vector] +++ OK, passed 100 tests.
  14969. 1296.14 s [vector] and: OK
  14970. 1296.14 s [vector] +++ OK, passed 100 tests.
  14971. 1296.14 s [vector] or: OK
  14972. 1296.14 s [vector] +++ OK, passed 100 tests.
  14973. 1296.14 s [vector] (Int)
  14974. 1296.14 s [vector] fromList.toList == id: OK
  14975. 1296.14 s [vector] +++ OK, passed 100 tests.
  14976. 1296.14 s [vector] toList.fromList == id: OK
  14977. 1296.14 s [vector] +++ OK, passed 100 tests.
  14978. 1296.14 s [vector] unstream.stream == id: OK
  14979. 1296.14 s [vector] +++ OK, passed 100 tests.
  14980. 1296.14 s [vector] stream.unstream == id: OK
  14981. 1296.14 s [vector] +++ OK, passed 100 tests.
  14982. 1296.14 s [vector] eq: OK
  14983. 1296.14 s [vector] +++ OK, passed 100 tests.
  14984. 1296.14 s [vector] length: OK
  14985. 1296.14 s [vector] +++ OK, passed 100 tests.
  14986. 1296.14 s [vector] null: OK
  14987. 1296.14 s [vector] +++ OK, passed 100 tests.
  14988. 1296.14 s [vector] index: OK
  14989. 1296.14 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14990. 1296.14 s [vector] safeIndex: OK
  14991. 1296.14 s [vector] +++ OK, passed 100 tests.
  14992. 1296.14 s [vector] head: OK
  14993. 1296.14 s [vector] +++ OK, passed 100 tests; 19 discarded.
  14994. 1296.14 s [vector] last: OK
  14995. 1296.15 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14996. 1296.15 s [vector] unsafeIndex: OK
  14997. 1296.15 s [vector] +++ OK, passed 100 tests; 13 discarded.
  14998. 1296.15 s [vector] unsafeHead: OK
  14999. 1296.15 s [vector] +++ OK, passed 100 tests; 18 discarded.
  15000. 1296.15 s [vector] unsafeLast: OK
  15001. 1296.15 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15002. 1296.15 s [vector] slice: OK
  15003. 1296.15 s [vector] +++ OK, passed 100 tests.
  15004. 1296.15 s [vector] init: OK
  15005. 1296.15 s [vector] +++ OK, passed 100 tests; 18 discarded.
  15006. 1296.15 s [vector] tail: OK
  15007. 1296.15 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15008. 1296.15 s [vector] take: OK
  15009. 1296.15 s [vector] +++ OK, passed 100 tests.
  15010. 1296.15 s [vector] drop: OK
  15011. 1296.15 s [vector] +++ OK, passed 100 tests.
  15012. 1296.15 s [vector] splitAt: OK
  15013. 1296.15 s [vector] +++ OK, passed 100 tests.
  15014. 1296.15 s [vector] empty: OK
  15015. 1296.15 s [vector] +++ OK, passed 100 tests.
  15016. 1296.15 s [vector] singleton: OK
  15017. 1296.15 s [vector] +++ OK, passed 100 tests.
  15018. 1296.15 s [vector] replicate: OK
  15019. 1296.15 s [vector] +++ OK, passed 100 tests.
  15020. 1296.15 s [vector] generate: OK
  15021. 1296.16 s [vector] +++ OK, passed 100 tests.
  15022. 1296.16 s [vector] iterateN: OK
  15023. 1296.16 s [vector] +++ OK, passed 100 tests.
  15024. 1296.19 s [vector] iterateNM: OK (0.03s)
  15025. 1296.19 s [vector] +++ OK, passed 100 tests.
  15026. 1296.21 s [vector] generateM: OK
  15027. 1296.21 s [vector] +++ OK, passed 100 tests.
  15028. 1296.23 s [vector] replicateM: OK (0.02s)
  15029. 1296.23 s [vector] +++ OK, passed 100 tests.
  15030. 1296.23 s [vector] create: OK
  15031. 1296.23 s [vector] +++ OK, passed 100 tests.
  15032. 1296.23 s [vector] createT: OK
  15033. 1296.23 s [vector] +++ OK, passed 100 tests.
  15034. 1296.23 s [vector] unfoldr: OK
  15035. 1296.23 s [vector] +++ OK, passed 100 tests.
  15036. 1296.23 s [vector] unfoldrN: OK
  15037. 1296.23 s [vector] +++ OK, passed 100 tests.
  15038. 1296.24 s [vector] unfoldrExactN: OK
  15039. 1296.24 s [vector] +++ OK, passed 100 tests.
  15040. 1296.25 s [vector] unfoldrM: OK
  15041. 1296.25 s [vector] +++ OK, passed 100 tests.
  15042. 1296.27 s [vector] unfoldrNM: OK (0.01s)
  15043. 1296.27 s [vector] +++ OK, passed 100 tests.
  15044. 1296.50 s [vector] unfoldrExactNM: OK (0.07s)
  15045. 1296.50 s [vector] +++ OK, passed 100 tests.
  15046. 1296.50 s [vector] constructN: OK (0.01s)
  15047. 1296.50 s [vector] +++ OK, passed 100 tests.
  15048. 1296.50 s [vector] constructrN: OK
  15049. 1296.50 s [vector] +++ OK, passed 100 tests.
  15050. 1296.50 s [vector] cons: OK
  15051. 1296.50 s [vector] +++ OK, passed 100 tests.
  15052. 1296.50 s [vector] snoc: OK
  15053. 1296.50 s [vector] +++ OK, passed 100 tests.
  15054. 1296.50 s [vector] append: OK
  15055. 1296.50 s [vector] +++ OK, passed 100 tests.
  15056. 1296.50 s [vector] concat: OK (0.02s)
  15057. 1296.50 s [vector] +++ OK, passed 100 tests.
  15058. 1296.50 s [vector] force: OK
  15059. 1296.50 s [vector] +++ OK, passed 100 tests.
  15060. 1296.50 s [vector] upd: OK
  15061. 1296.50 s [vector] +++ OK, passed 100 tests.
  15062. 1296.50 s [vector] accum: OK
  15063. 1296.50 s [vector] +++ OK, passed 100 tests.
  15064. 1296.50 s [vector] reverse: OK
  15065. 1296.50 s [vector] +++ OK, passed 100 tests.
  15066. 1296.50 s [vector] backpermute: OK
  15067. 1296.50 s [vector] +++ OK, passed 100 tests.
  15068. 1296.50 s [vector] map: OK
  15069. 1296.50 s [vector] +++ OK, passed 100 tests.
  15070. 1296.50 s [vector] imap: OK
  15071. 1296.50 s [vector] +++ OK, passed 100 tests.
  15072. 1296.50 s [vector] concatMap: OK
  15073. 1296.50 s [vector] +++ OK, passed 100 tests.
  15074. 1296.50 s [vector] mapM: OK
  15075. 1296.50 s [vector] +++ OK, passed 100 tests.
  15076. 1296.50 s [vector] mapM_: OK (0.02s)
  15077. 1296.50 s [vector] +++ OK, passed 100 tests.
  15078. 1296.50 s [vector] forM: OK
  15079. 1296.50 s [vector] +++ OK, passed 100 tests.
  15080. 1296.50 s [vector] forM_: OK (0.01s)
  15081. 1296.50 s [vector] +++ OK, passed 100 tests.
  15082. 1296.50 s [vector] imapM: OK
  15083. 1296.50 s [vector] +++ OK, passed 100 tests.
  15084. 1296.50 s [vector] imapM_: OK (0.02s)
  15085. 1296.50 s [vector] +++ OK, passed 100 tests.
  15086. 1296.50 s [vector] zipWith: OK
  15087. 1296.50 s [vector] +++ OK, passed 100 tests.
  15088. 1296.50 s [vector] zipWith3: OK
  15089. 1296.50 s [vector] +++ OK, passed 100 tests.
  15090. 1296.50 s [vector] izipWith: OK
  15091. 1296.50 s [vector] +++ OK, passed 100 tests.
  15092. 1296.50 s [vector] izipWith3: OK
  15093. 1296.50 s [vector] +++ OK, passed 100 tests.
  15094. 1296.50 s [vector] izipWithM: OK
  15095. 1296.50 s [vector] +++ OK, passed 100 tests.
  15096. 1296.50 s [vector] izipWithM_: OK
  15097. 1296.50 s [vector] +++ OK, passed 100 tests.
  15098. 1296.50 s [vector] zipWithM: OK
  15099. 1296.50 s [vector] +++ OK, passed 100 tests.
  15100. 1296.50 s [vector] zipWithM_: OK (0.01s)
  15101. 1296.50 s [vector] +++ OK, passed 100 tests.
  15102. 1296.50 s [vector] filter: OK
  15103. 1296.50 s [vector] +++ OK, passed 100 tests.
  15104. 1296.50 s [vector] ifilter: OK
  15105. 1296.50 s [vector] +++ OK, passed 100 tests.
  15106. 1296.50 s [vector] filterM: OK
  15107. 1296.50 s [vector] +++ OK, passed 100 tests.
  15108. 1296.50 s [vector] uniq: OK
  15109. 1296.50 s [vector] +++ OK, passed 100 tests.
  15110. 1296.51 s [vector] mapMaybe: OK
  15111. 1296.51 s [vector] +++ OK, passed 100 tests.
  15112. 1296.51 s [vector] imapMaybe: OK
  15113. 1296.51 s [vector] +++ OK, passed 100 tests.
  15114. 1296.51 s [vector] takeWhile: OK
  15115. 1296.51 s [vector] +++ OK, passed 100 tests.
  15116. 1296.51 s [vector] dropWhile: OK
  15117. 1296.51 s [vector] +++ OK, passed 100 tests.
  15118. 1296.51 s [vector] partition: OK
  15119. 1296.51 s [vector] +++ OK, passed 100 tests.
  15120. 1296.52 s [vector] partitionWith: OK
  15121. 1296.52 s [vector] +++ OK, passed 100 tests.
  15122. 1296.52 s [vector] span: OK
  15123. 1296.52 s [vector] +++ OK, passed 100 tests.
  15124. 1296.52 s [vector] break: OK
  15125. 1296.52 s [vector] +++ OK, passed 100 tests.
  15126. 1296.52 s [vector] spanR: OK
  15127. 1296.52 s [vector] +++ OK, passed 100 tests.
  15128. 1296.52 s [vector] breakR: OK
  15129. 1296.52 s [vector] +++ OK, passed 100 tests.
  15130. 1296.52 s [vector] groupBy: OK
  15131. 1296.52 s [vector] +++ OK, passed 100 tests.
  15132. 1296.52 s [vector] elem: OK
  15133. 1296.52 s [vector] +++ OK, passed 100 tests.
  15134. 1296.52 s [vector] notElem: OK
  15135. 1296.52 s [vector] +++ OK, passed 100 tests.
  15136. 1296.52 s [vector] find: OK
  15137. 1296.52 s [vector] +++ OK, passed 100 tests.
  15138. 1296.52 s [vector] findIndex: OK
  15139. 1296.52 s [vector] +++ OK, passed 100 tests.
  15140. 1296.52 s [vector] findIndexR: OK
  15141. 1296.52 s [vector] +++ OK, passed 100 tests.
  15142. 1296.52 s [vector] findIndices: OK
  15143. 1296.53 s [vector] +++ OK, passed 100 tests.
  15144. 1296.53 s [vector] elemIndex: OK
  15145. 1296.53 s [vector] +++ OK, passed 100 tests.
  15146. 1296.53 s [vector] elemIndices: OK
  15147. 1296.53 s [vector] +++ OK, passed 100 tests.
  15148. 1296.53 s [vector] foldl: OK
  15149. 1296.54 s [vector] +++ OK, passed 100 tests.
  15150. 1296.54 s [vector] foldl1: OK
  15151. 1296.54 s [vector] +++ OK, passed 100 tests; 19 discarded.
  15152. 1296.54 s [vector] foldl': OK
  15153. 1296.54 s [vector] +++ OK, passed 100 tests.
  15154. 1296.54 s [vector] foldl1': OK
  15155. 1296.54 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15156. 1296.55 s [vector] foldr: OK
  15157. 1296.55 s [vector] +++ OK, passed 100 tests.
  15158. 1296.55 s [vector] foldr1: OK
  15159. 1296.55 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15160. 1296.55 s [vector] foldr': OK
  15161. 1296.55 s [vector] +++ OK, passed 100 tests.
  15162. 1296.55 s [vector] foldr1': OK
  15163. 1296.55 s [vector] +++ OK, passed 100 tests; 23 discarded.
  15164. 1296.55 s [vector] ifoldl: OK
  15165. 1296.55 s [vector] +++ OK, passed 100 tests.
  15166. 1296.56 s [vector] ifoldl': OK
  15167. 1296.56 s [vector] +++ OK, passed 100 tests.
  15168. 1296.56 s [vector] ifoldr: OK
  15169. 1296.56 s [vector] +++ OK, passed 100 tests.
  15170. 1296.57 s [vector] ifoldr': OK
  15171. 1296.57 s [vector] +++ OK, passed 100 tests.
  15172. 1296.58 s [vector] ifoldM: OK
  15173. 1296.60 s [vector] +++ OK, passed 100 tests.
  15174. 1296.60 s [vector] ifoldM': OK
  15175. 1296.60 s [vector] +++ OK, passed 100 tests.
  15176. 1296.60 s [vector] ifoldM_: OK (0.02s)
  15177. 1296.60 s [vector] +++ OK, passed 100 tests.
  15178. 1296.62 s [vector] ifoldM'_: OK
  15179. 1296.62 s [vector] +++ OK, passed 100 tests.
  15180. 1296.62 s [vector] all: OK
  15181. 1296.62 s [vector] +++ OK, passed 100 tests.
  15182. 1296.62 s [vector] any: OK
  15183. 1296.62 s [vector] +++ OK, passed 100 tests.
  15184. 1296.62 s [vector] prescanl: OK
  15185. 1296.62 s [vector] +++ OK, passed 100 tests.
  15186. 1296.63 s [vector] prescanl': OK
  15187. 1296.63 s [vector] +++ OK, passed 100 tests.
  15188. 1296.63 s [vector] postscanl: OK
  15189. 1296.63 s [vector] +++ OK, passed 100 tests.
  15190. 1296.63 s [vector] postscanl': OK
  15191. 1296.63 s [vector] +++ OK, passed 100 tests.
  15192. 1296.63 s [vector] scanl: OK
  15193. 1296.63 s [vector] +++ OK, passed 100 tests.
  15194. 1296.63 s [vector] scanl': OK
  15195. 1296.64 s [vector] +++ OK, passed 100 tests.
  15196. 1296.64 s [vector] scanl1: OK
  15197. 1296.64 s [vector] +++ OK, passed 100 tests.
  15198. 1296.64 s [vector] scanl1': OK
  15199. 1296.64 s [vector] +++ OK, passed 100 tests.
  15200. 1296.64 s [vector] iscanl: OK
  15201. 1296.64 s [vector] +++ OK, passed 100 tests.
  15202. 1296.64 s [vector] iscanl': OK
  15203. 1296.64 s [vector] +++ OK, passed 100 tests.
  15204. 1296.65 s [vector] prescanr: OK
  15205. 1296.65 s [vector] +++ OK, passed 100 tests.
  15206. 1296.65 s [vector] prescanr': OK
  15207. 1296.65 s [vector] +++ OK, passed 100 tests.
  15208. 1296.65 s [vector] postscanr: OK
  15209. 1296.65 s [vector] +++ OK, passed 100 tests.
  15210. 1296.67 s [vector] postscanr': OK
  15211. 1296.67 s [vector] +++ OK, passed 100 tests.
  15212. 1296.67 s [vector] scanr: OK
  15213. 1296.67 s [vector] +++ OK, passed 100 tests.
  15214. 1296.67 s [vector] scanr': OK
  15215. 1296.68 s [vector] +++ OK, passed 100 tests.
  15216. 1296.68 s [vector] scanr1: OK
  15217. 1296.68 s [vector] +++ OK, passed 100 tests.
  15218. 1296.68 s [vector] scanr1': OK
  15219. 1296.68 s [vector] +++ OK, passed 100 tests.
  15220. 1296.68 s [vector] iscanr: OK
  15221. 1296.68 s [vector] +++ OK, passed 100 tests.
  15222. 1296.69 s [vector] iscanr': OK
  15223. 1296.69 s [vector] +++ OK, passed 100 tests.
  15224. 1296.69 s [vector] mut_read: OK
  15225. 1296.69 s [vector] +++ OK, passed 100 tests; 13 discarded.
  15226. 1296.69 s [vector] mut_write: OK
  15227. 1296.69 s [vector] +++ OK, passed 100 tests; 17 discarded.
  15228. 1296.69 s [vector] mut_modify: OK
  15229. 1296.69 s [vector] +++ OK, passed 100 tests; 18 discarded.
  15230. 1296.70 s [vector] mut_generate: OK
  15231. 1296.70 s [vector] +++ OK, passed 100 tests.
  15232. 1296.70 s [vector] mut_generateM: OK
  15233. 1296.70 s [vector] +++ OK, passed 100 tests.
  15234. 1296.74 s [vector] mut_mapM_: OK
  15235. 1296.74 s [vector] +++ OK, passed 100 tests.
  15236. 1296.76 s [vector] mut_imapM_: OK (0.02s)
  15237. 1296.76 s [vector] +++ OK, passed 100 tests.
  15238. 1296.76 s [vector] mut_forM_: OK (0.02s)
  15239. 1296.76 s [vector] +++ OK, passed 100 tests.
  15240. 1296.78 s [vector] mut_iforM_: OK
  15241. 1296.78 s [vector] +++ OK, passed 100 tests.
  15242. 1296.78 s [vector] mut_foldr: OK
  15243. 1296.78 s [vector] +++ OK, passed 100 tests.
  15244. 1296.79 s [vector] mut_foldr': OK
  15245. 1296.79 s [vector] +++ OK, passed 100 tests.
  15246. 1296.79 s [vector] mut_foldl: OK
  15247. 1296.79 s [vector] +++ OK, passed 100 tests.
  15248. 1296.79 s [vector] mut_foldl': OK
  15249. 1296.80 s [vector] +++ OK, passed 100 tests.
  15250. 1296.80 s [vector] mut_ifoldr: OK
  15251. 1296.80 s [vector] +++ OK, passed 100 tests.
  15252. 1296.80 s [vector] mut_ifoldr': OK
  15253. 1296.80 s [vector] +++ OK, passed 100 tests.
  15254. 1296.81 s [vector] mut_ifoldl: OK
  15255. 1296.81 s [vector] +++ OK, passed 100 tests.
  15256. 1296.82 s [vector] mut_ifoldl': OK
  15257. 1296.82 s [vector] +++ OK, passed 100 tests.
  15258. 1296.82 s [vector] mut_foldM: OK
  15259. 1296.82 s [vector] +++ OK, passed 100 tests.
  15260. 1296.82 s [vector] mut_foldM': OK
  15261. 1296.83 s [vector] +++ OK, passed 100 tests.
  15262. 1296.83 s [vector] mut_foldrM: OK
  15263. 1296.83 s [vector] +++ OK, passed 100 tests.
  15264. 1296.84 s [vector] mut_foldrM': OK
  15265. 1296.84 s [vector] +++ OK, passed 100 tests.
  15266. 1296.84 s [vector] mut_ifoldM: OK
  15267. 1296.84 s [vector] +++ OK, passed 100 tests.
  15268. 1296.85 s [vector] mut_ifoldM': OK
  15269. 1296.85 s [vector] +++ OK, passed 100 tests.
  15270. 1296.85 s [vector] mut_ifoldrM: OK
  15271. 1296.85 s [vector] +++ OK, passed 100 tests.
  15272. 1296.86 s [vector] mut_ifoldrM': OK
  15273. 1296.86 s [vector] +++ OK, passed 100 tests.
  15274. 1296.86 s [vector] compare: OK
  15275. 1296.86 s [vector] +++ OK, passed 100 tests.
  15276. 1296.86 s [vector] maximum: OK
  15277. 1296.86 s [vector] +++ OK, passed 100 tests; 18 discarded.
  15278. 1296.87 s [vector] minimum: OK
  15279. 1296.87 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15280. 1296.87 s [vector] minIndex: OK
  15281. 1296.87 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15282. 1296.88 s [vector] maxIndex: OK
  15283. 1296.88 s [vector] +++ OK, passed 100 tests; 13 discarded.
  15284. 1296.89 s [vector] maximumBy: OK
  15285. 1296.89 s [vector] +++ OK, passed 100 tests; 20 discarded.
  15286. 1296.90 s [vector] minimumBy: OK
  15287. 1296.90 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15288. 1296.90 s [vector] maximumOn: OK
  15289. 1296.90 s [vector] +++ OK, passed 100 tests; 17 discarded.
  15290. 1296.90 s [vector] minimumOn: OK
  15291. 1296.90 s [vector] +++ OK, passed 100 tests; 19 discarded.
  15292. 1296.91 s [vector] maxIndexBy: OK
  15293. 1296.91 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15294. 1296.91 s [vector] minIndexBy: OK
  15295. 1296.91 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15296. 1296.92 s [vector] ListFirstMaxIndexWins: OK
  15297. 1296.93 s [vector] +++ OK, passed 100 tests; 12 discarded.
  15298. 1296.93 s [vector] FalseListFirstMaxIndexWins: OK
  15299. 1296.93 s [vector] +++ OK, failed as expected. (after 1 test):
  15300. 1296.93 s [vector] Exception:
  15301. 1296.93 s [vector] Prelude.foldr1: empty list
  15302. 1296.93 s [vector] CallStack (from HasCallStack):
  15303. 1296.93 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  15304. 1296.93 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  15305. 1296.93 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  15306. 1296.93 s [vector] []
  15307. 1296.94 s [vector] zip: OK
  15308. 1296.94 s [vector] +++ OK, passed 100 tests.
  15309. 1296.94 s [vector] zip3: OK
  15310. 1296.94 s [vector] +++ OK, passed 100 tests.
  15311. 1296.95 s [vector] unzip: OK
  15312. 1296.95 s [vector] +++ OK, passed 100 tests.
  15313. 1296.96 s [vector] unzip3: OK
  15314. 1296.96 s [vector] +++ OK, passed 100 tests.
  15315. 1296.96 s [vector] indexed: OK
  15316. 1296.96 s [vector] +++ OK, passed 100 tests.
  15317. 1296.97 s [vector] update: OK (0.01s)
  15318. 1296.97 s [vector] +++ OK, passed 100 tests.
  15319. 1296.97 s [vector] mempty: OK
  15320. 1296.97 s [vector] +++ OK, passed 100 tests.
  15321. 1296.98 s [vector] mappend: OK
  15322. 1296.98 s [vector] +++ OK, passed 100 tests.
  15323. 1297.02 s [vector] mconcat: OK (0.03s)
  15324. 1297.02 s [vector] +++ OK, passed 100 tests.
  15325. 1297.02 s [vector] glength: OK
  15326. 1297.02 s [vector] +++ OK, passed 100 tests.
  15327. 1297.02 s [vector] sum: OK
  15328. 1297.02 s [vector] +++ OK, passed 100 tests.
  15329. 1297.02 s [vector] product: OK
  15330. 1297.02 s [vector] +++ OK, passed 100 tests.
  15331. 1297.02 s [vector] enumFromN: OK
  15332. 1297.02 s [vector] +++ OK, passed 100 tests.
  15333. 1297.03 s [vector] enumFromThenN: OK
  15334. 1297.03 s [vector] +++ OK, passed 100 tests.
  15335. 1297.03 s [vector] enumFromTo: OK
  15336. 1297.03 s [vector] +++ OK, passed 100 tests.
  15337. 1297.03 s [vector] enumFromThenTo: OK
  15338. 1297.03 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15339. 1297.03 s [vector] (Float)
  15340. 1297.03 s [vector] fromList.toList == id: OK
  15341. 1297.03 s [vector] +++ OK, passed 100 tests.
  15342. 1297.03 s [vector] toList.fromList == id: OK
  15343. 1297.04 s [vector] +++ OK, passed 100 tests.
  15344. 1297.04 s [vector] unstream.stream == id: OK
  15345. 1297.04 s [vector] +++ OK, passed 100 tests.
  15346. 1297.06 s [vector] stream.unstream == id: OK
  15347. 1297.06 s [vector] +++ OK, passed 100 tests.
  15348. 1297.06 s [vector] eq: OK (0.02s)
  15349. 1297.06 s [vector] +++ OK, passed 100 tests.
  15350. 1297.06 s [vector] length: OK
  15351. 1297.06 s [vector] +++ OK, passed 100 tests.
  15352. 1297.07 s [vector] null: OK
  15353. 1297.07 s [vector] +++ OK, passed 100 tests.
  15354. 1297.07 s [vector] index: OK
  15355. 1297.07 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15356. 1297.07 s [vector] safeIndex: OK
  15357. 1297.07 s [vector] +++ OK, passed 100 tests.
  15358. 1297.07 s [vector] head: OK
  15359. 1297.07 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15360. 1297.08 s [vector] last: OK
  15361. 1297.08 s [vector] +++ OK, passed 100 tests; 17 discarded.
  15362. 1297.08 s [vector] unsafeIndex: OK
  15363. 1297.08 s [vector] +++ OK, passed 100 tests; 18 discarded.
  15364. 1297.09 s [vector] unsafeHead: OK
  15365. 1297.09 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15366. 1297.10 s [vector] unsafeLast: OK
  15367. 1297.10 s [vector] +++ OK, passed 100 tests; 19 discarded.
  15368. 1297.10 s [vector] slice: OK
  15369. 1297.11 s [vector] +++ OK, passed 100 tests.
  15370. 1297.11 s [vector] init: OK
  15371. 1297.11 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15372. 1297.11 s [vector] tail: OK
  15373. 1297.11 s [vector] +++ OK, passed 100 tests; 21 discarded.
  15374. 1297.11 s [vector] take: OK
  15375. 1297.11 s [vector] +++ OK, passed 100 tests.
  15376. 1297.11 s [vector] drop: OK
  15377. 1297.11 s [vector] +++ OK, passed 100 tests.
  15378. 1297.12 s [vector] splitAt: OK
  15379. 1297.12 s [vector] +++ OK, passed 100 tests.
  15380. 1297.12 s [vector] empty: OK
  15381. 1297.12 s [vector] +++ OK, passed 100 tests.
  15382. 1297.12 s [vector] singleton: OK
  15383. 1297.12 s [vector] +++ OK, passed 100 tests.
  15384. 1297.12 s [vector] replicate: OK
  15385. 1297.12 s [vector] +++ OK, passed 100 tests.
  15386. 1297.12 s [vector] generate: OK
  15387. 1297.12 s [vector] +++ OK, passed 100 tests.
  15388. 1297.12 s [vector] iterateN: OK
  15389. 1297.12 s [vector] +++ OK, passed 100 tests.
  15390. 1297.20 s [vector] iterateNM: OK (0.04s)
  15391. 1297.20 s [vector] +++ OK, passed 100 tests.
  15392. 1297.22 s [vector] generateM: OK (0.04s)
  15393. 1297.22 s [vector] +++ OK, passed 100 tests.
  15394. 1297.24 s [vector] replicateM: OK (0.02s)
  15395. 1297.24 s [vector] +++ OK, passed 100 tests.
  15396. 1297.24 s [vector] create: OK
  15397. 1297.24 s [vector] +++ OK, passed 100 tests.
  15398. 1297.24 s [vector] createT: OK
  15399. 1297.24 s [vector] +++ OK, passed 100 tests.
  15400. 1297.24 s [vector] unfoldr: OK
  15401. 1297.24 s [vector] +++ OK, passed 100 tests.
  15402. 1297.24 s [vector] unfoldrN: OK
  15403. 1297.24 s [vector] +++ OK, passed 100 tests.
  15404. 1297.24 s [vector] unfoldrExactN: OK
  15405. 1297.24 s [vector] +++ OK, passed 100 tests.
  15406. 1297.27 s [vector] unfoldrM: OK
  15407. 1297.27 s [vector] +++ OK, passed 100 tests.
  15408. 1297.28 s [vector] unfoldrNM: OK
  15409. 1297.28 s [vector] +++ OK, passed 100 tests.
  15410. 1297.35 s [vector] unfoldrExactNM: OK (0.07s)
  15411. 1297.35 s [vector] +++ OK, passed 100 tests.
  15412. 1297.37 s [vector] constructN: OK
  15413. 1297.37 s [vector] +++ OK, passed 100 tests.
  15414. 1297.39 s [vector] constructrN: OK
  15415. 1297.39 s [vector] +++ OK, passed 100 tests.
  15416. 1297.39 s [vector] cons: OK
  15417. 1297.39 s [vector] +++ OK, passed 100 tests.
  15418. 1297.39 s [vector] snoc: OK
  15419. 1297.39 s [vector] +++ OK, passed 100 tests.
  15420. 1297.40 s [vector] append: OK
  15421. 1297.40 s [vector] +++ OK, passed 100 tests.
  15422. 1297.43 s [vector] concat: OK (0.03s)
  15423. 1297.43 s [vector] +++ OK, passed 100 tests.
  15424. 1297.43 s [vector] force: OK
  15425. 1297.43 s [vector] +++ OK, passed 100 tests.
  15426. 1297.44 s [vector] upd: OK
  15427. 1297.44 s [vector] +++ OK, passed 100 tests.
  15428. 1297.45 s [vector] accum: OK (0.01s)
  15429. 1297.45 s [vector] +++ OK, passed 100 tests.
  15430. 1297.45 s [vector] reverse: OK
  15431. 1297.45 s [vector] +++ OK, passed 100 tests.
  15432. 1297.46 s [vector] backpermute: OK
  15433. 1297.46 s [vector] +++ OK, passed 100 tests.
  15434. 1297.46 s [vector] map: OK (0.01s)
  15435. 1297.46 s [vector] +++ OK, passed 100 tests.
  15436. 1297.48 s [vector] imap: OK
  15437. 1297.48 s [vector] +++ OK, passed 100 tests.
  15438. 1297.48 s [vector] concatMap: OK
  15439. 1297.48 s [vector] +++ OK, passed 100 tests.
  15440. 1297.50 s [vector] mapM: OK
  15441. 1297.50 s [vector] +++ OK, passed 100 tests.
  15442. 1297.54 s [vector] mapM_: OK (0.04s)
  15443. 1297.54 s [vector] +++ OK, passed 100 tests.
  15444. 1297.54 s [vector] forM: OK
  15445. 1297.54 s [vector] +++ OK, passed 100 tests.
  15446. 1297.58 s [vector] forM_: OK (0.04s)
  15447. 1297.58 s [vector] +++ OK, passed 100 tests.
  15448. 1297.60 s [vector] imapM: OK
  15449. 1297.60 s [vector] +++ OK, passed 100 tests.
  15450. 1297.63 s [vector] imapM_: OK (0.04s)
  15451. 1297.63 s [vector] +++ OK, passed 100 tests.
  15452. 1297.63 s [vector] zipWith: OK
  15453. 1297.63 s [vector] +++ OK, passed 100 tests.
  15454. 1297.64 s [vector] zipWith3: OK
  15455. 1297.64 s [vector] +++ OK, passed 100 tests.
  15456. 1297.65 s [vector] izipWith: OK
  15457. 1297.65 s [vector] +++ OK, passed 100 tests.
  15458. 1297.65 s [vector] izipWith3: OK
  15459. 1297.66 s [vector] +++ OK, passed 100 tests.
  15460. 1297.66 s [vector] izipWithM: OK
  15461. 1297.66 s [vector] +++ OK, passed 100 tests.
  15462. 1297.70 s [vector] izipWithM_: OK (0.04s)
  15463. 1297.70 s [vector] +++ OK, passed 100 tests.
  15464. 1297.70 s [vector] zipWithM: OK
  15465. 1297.72 s [vector] +++ OK, passed 100 tests.
  15466. 1297.75 s [vector] zipWithM_: OK (0.04s)
  15467. 1297.75 s [vector] +++ OK, passed 100 tests.
  15468. 1297.75 s [vector] filter: OK
  15469. 1297.75 s [vector] +++ OK, passed 100 tests.
  15470. 1297.75 s [vector] ifilter: OK
  15471. 1297.76 s [vector] +++ OK, passed 100 tests.
  15472. 1297.81 s [vector] filterM: OK (0.06s)
  15473. 1297.82 s [vector] +++ OK, passed 100 tests.
  15474. 1297.82 s [vector] uniq: OK
  15475. 1297.82 s [vector] +++ OK, passed 100 tests.
  15476. 1297.82 s [vector] mapMaybe: OK
  15477. 1297.82 s [vector] +++ OK, passed 100 tests.
  15478. 1297.83 s [vector] imapMaybe: OK
  15479. 1297.83 s [vector] +++ OK, passed 100 tests.
  15480. 1297.84 s [vector] takeWhile: OK
  15481. 1297.84 s [vector] +++ OK, passed 100 tests.
  15482. 1297.84 s [vector] dropWhile: OK
  15483. 1297.84 s [vector] +++ OK, passed 100 tests.
  15484. 1297.84 s [vector] partition: OK
  15485. 1297.84 s [vector] +++ OK, passed 100 tests.
  15486. 1297.84 s [vector] partitionWith: OK
  15487. 1297.84 s [vector] +++ OK, passed 100 tests.
  15488. 1297.84 s [vector] span: OK
  15489. 1297.84 s [vector] +++ OK, passed 100 tests.
  15490. 1297.84 s [vector] break: OK
  15491. 1297.84 s [vector] +++ OK, passed 100 tests.
  15492. 1297.84 s [vector] spanR: OK
  15493. 1297.84 s [vector] +++ OK, passed 100 tests.
  15494. 1297.84 s [vector] breakR: OK
  15495. 1297.84 s [vector] +++ OK, passed 100 tests.
  15496. 1297.85 s [vector] groupBy: OK
  15497. 1297.85 s [vector] +++ OK, passed 100 tests.
  15498. 1297.85 s [vector] elem: OK
  15499. 1297.85 s [vector] +++ OK, passed 100 tests.
  15500. 1297.85 s [vector] notElem: OK
  15501. 1297.85 s [vector] +++ OK, passed 100 tests.
  15502. 1297.85 s [vector] find: OK
  15503. 1297.85 s [vector] +++ OK, passed 100 tests.
  15504. 1297.85 s [vector] findIndex: OK
  15505. 1297.85 s [vector] +++ OK, passed 100 tests.
  15506. 1297.85 s [vector] findIndexR: OK
  15507. 1297.85 s [vector] +++ OK, passed 100 tests.
  15508. 1297.86 s [vector] findIndices: OK
  15509. 1297.86 s [vector] +++ OK, passed 100 tests.
  15510. 1297.86 s [vector] elemIndex: OK
  15511. 1297.86 s [vector] +++ OK, passed 100 tests.
  15512. 1297.86 s [vector] elemIndices: OK
  15513. 1297.86 s [vector] +++ OK, passed 100 tests.
  15514. 1297.88 s [vector] foldl: OK
  15515. 1297.88 s [vector] +++ OK, passed 100 tests.
  15516. 1297.88 s [vector] foldl1: OK
  15517. 1297.88 s [vector] +++ OK, passed 100 tests; 17 discarded.
  15518. 1297.90 s [vector] foldl': OK
  15519. 1297.90 s [vector] +++ OK, passed 100 tests.
  15520. 1297.90 s [vector] foldl1': OK
  15521. 1297.90 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15522. 1297.91 s [vector] foldr: OK
  15523. 1297.92 s [vector] +++ OK, passed 100 tests.
  15524. 1297.93 s [vector] foldr1: OK
  15525. 1297.94 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15526. 1297.94 s [vector] foldr': OK
  15527. 1297.94 s [vector] +++ OK, passed 100 tests.
  15528. 1297.94 s [vector] foldr1': OK
  15529. 1297.94 s [vector] +++ OK, passed 100 tests; 19 discarded.
  15530. 1297.95 s [vector] ifoldl: OK (0.01s)
  15531. 1297.95 s [vector] +++ OK, passed 100 tests.
  15532. 1297.95 s [vector] ifoldl': OK (0.01s)
  15533. 1297.95 s [vector] +++ OK, passed 100 tests.
  15534. 1297.96 s [vector] ifoldr: OK
  15535. 1297.96 s [vector] +++ OK, passed 100 tests.
  15536. 1297.98 s [vector] ifoldr': OK
  15537. 1297.98 s [vector] +++ OK, passed 100 tests.
  15538. 1297.98 s [vector] ifoldM: OK
  15539. 1297.98 s [vector] +++ OK, passed 100 tests.
  15540. 1298.00 s [vector] ifoldM': OK
  15541. 1298.02 s [vector] +++ OK, passed 100 tests.
  15542. 1298.08 s [vector] ifoldM_: OK (0.07s)
  15543. 1298.08 s [vector] +++ OK, passed 100 tests.
  15544. 1298.13 s [vector] ifoldM'_: OK (0.06s)
  15545. 1298.13 s [vector] +++ OK, passed 100 tests.
  15546. 1298.13 s [vector] all: OK
  15547. 1298.13 s [vector] +++ OK, passed 100 tests.
  15548. 1298.14 s [vector] any: OK
  15549. 1298.14 s [vector] +++ OK, passed 100 tests.
  15550. 1298.16 s [vector] prescanl: OK (0.01s)
  15551. 1298.16 s [vector] +++ OK, passed 100 tests.
  15552. 1298.16 s [vector] prescanl': OK (0.01s)
  15553. 1298.16 s [vector] +++ OK, passed 100 tests.
  15554. 1298.18 s [vector] postscanl: OK (0.01s)
  15555. 1298.18 s [vector] +++ OK, passed 100 tests.
  15556. 1298.20 s [vector] postscanl': OK (0.01s)
  15557. 1298.20 s [vector] +++ OK, passed 100 tests.
  15558. 1298.20 s [vector] scanl: OK (0.01s)
  15559. 1298.20 s [vector] +++ OK, passed 100 tests.
  15560. 1298.22 s [vector] scanl': OK
  15561. 1298.22 s [vector] +++ OK, passed 100 tests.
  15562. 1298.24 s [vector] scanl1: OK (0.01s)
  15563. 1298.24 s [vector] +++ OK, passed 100 tests.
  15564. 1298.25 s [vector] scanl1': OK (0.01s)
  15565. 1298.25 s [vector] +++ OK, passed 100 tests.
  15566. 1298.26 s [vector] iscanl: OK (0.01s)
  15567. 1298.26 s [vector] +++ OK, passed 100 tests.
  15568. 1298.28 s [vector] iscanl': OK (0.01s)
  15569. 1298.28 s [vector] +++ OK, passed 100 tests.
  15570. 1298.29 s [vector] prescanr: OK (0.01s)
  15571. 1298.29 s [vector] +++ OK, passed 100 tests.
  15572. 1298.30 s [vector] prescanr': OK (0.01s)
  15573. 1298.30 s [vector] +++ OK, passed 100 tests.
  15574. 1298.30 s [vector] postscanr: OK
  15575. 1298.30 s [vector] +++ OK, passed 100 tests.
  15576. 1298.30 s [vector] postscanr': OK
  15577. 1298.31 s [vector] +++ OK, passed 100 tests.
  15578. 1298.32 s [vector] scanr: OK
  15579. 1298.32 s [vector] +++ OK, passed 100 tests.
  15580. 1298.33 s [vector] scanr': OK
  15581. 1298.33 s [vector] +++ OK, passed 100 tests.
  15582. 1298.33 s [vector] scanr1: OK
  15583. 1298.33 s [vector] +++ OK, passed 100 tests.
  15584. 1298.34 s [vector] scanr1': OK
  15585. 1298.34 s [vector] +++ OK, passed 100 tests.
  15586. 1298.35 s [vector] iscanr: OK
  15587. 1298.35 s [vector] +++ OK, passed 100 tests.
  15588. 1298.35 s [vector] iscanr': OK
  15589. 1298.35 s [vector] +++ OK, passed 100 tests.
  15590. 1298.35 s [vector] mut_read: OK
  15591. 1298.35 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15592. 1298.35 s [vector] mut_write: OK
  15593. 1298.35 s [vector] +++ OK, passed 100 tests; 21 discarded.
  15594. 1298.35 s [vector] mut_modify: OK
  15595. 1298.35 s [vector] +++ OK, passed 100 tests; 13 discarded.
  15596. 1298.36 s [vector] mut_generate: OK
  15597. 1298.36 s [vector] +++ OK, passed 100 tests.
  15598. 1298.38 s [vector] mut_generateM: OK (0.01s)
  15599. 1298.38 s [vector] +++ OK, passed 100 tests.
  15600. 1298.40 s [vector] mut_mapM_: OK (0.03s)
  15601. 1298.40 s [vector] +++ OK, passed 100 tests.
  15602. 1298.43 s [vector] mut_imapM_: OK (0.03s)
  15603. 1298.43 s [vector] +++ OK, passed 100 tests.
  15604. 1298.46 s [vector] mut_forM_: OK (0.02s)
  15605. 1298.46 s [vector] +++ OK, passed 100 tests.
  15606. 1298.50 s [vector] mut_iforM_: OK (0.01s)
  15607. 1298.50 s [vector] +++ OK, passed 100 tests.
  15608. 1298.50 s [vector] mut_foldr: OK
  15609. 1298.51 s [vector] +++ OK, passed 100 tests.
  15610. 1298.51 s [vector] mut_foldr': OK
  15611. 1298.51 s [vector] +++ OK, passed 100 tests.
  15612. 1298.52 s [vector] mut_foldl: OK
  15613. 1298.52 s [vector] +++ OK, passed 100 tests.
  15614. 1298.53 s [vector] mut_foldl': OK
  15615. 1298.53 s [vector] +++ OK, passed 100 tests.
  15616. 1298.54 s [vector] mut_ifoldr: OK
  15617. 1298.54 s [vector] +++ OK, passed 100 tests.
  15618. 1298.55 s [vector] mut_ifoldr': OK
  15619. 1298.55 s [vector] +++ OK, passed 100 tests.
  15620. 1298.55 s [vector] mut_ifoldl: OK
  15621. 1298.55 s [vector] +++ OK, passed 100 tests.
  15622. 1298.55 s [vector] mut_ifoldl': OK
  15623. 1298.56 s [vector] +++ OK, passed 100 tests.
  15624. 1298.57 s [vector] mut_foldM: OK
  15625. 1298.57 s [vector] +++ OK, passed 100 tests.
  15626. 1298.58 s [vector] mut_foldM': OK
  15627. 1298.58 s [vector] +++ OK, passed 100 tests.
  15628. 1298.58 s [vector] mut_foldrM: OK
  15629. 1298.58 s [vector] +++ OK, passed 100 tests.
  15630. 1298.58 s [vector] mut_foldrM': OK
  15631. 1298.58 s [vector] +++ OK, passed 100 tests.
  15632. 1298.59 s [vector] mut_ifoldM: OK
  15633. 1298.59 s [vector] +++ OK, passed 100 tests.
  15634. 1298.61 s [vector] mut_ifoldM': OK
  15635. 1298.62 s [vector] +++ OK, passed 100 tests.
  15636. 1298.62 s [vector] mut_ifoldrM: OK
  15637. 1298.62 s [vector] +++ OK, passed 100 tests.
  15638. 1298.62 s [vector] mut_ifoldrM': OK
  15639. 1298.62 s [vector] +++ OK, passed 100 tests.
  15640. 1298.62 s [vector] compare: OK
  15641. 1298.62 s [vector] +++ OK, passed 100 tests.
  15642. 1298.62 s [vector] maximum: OK
  15643. 1298.62 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15644. 1298.62 s [vector] minimum: OK
  15645. 1298.62 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15646. 1298.62 s [vector] minIndex: OK
  15647. 1298.62 s [vector] +++ OK, passed 100 tests; 11 discarded.
  15648. 1298.62 s [vector] maxIndex: OK
  15649. 1298.62 s [vector] +++ OK, passed 100 tests; 13 discarded.
  15650. 1298.62 s [vector] maximumBy: OK
  15651. 1298.62 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15652. 1298.62 s [vector] minimumBy: OK
  15653. 1298.62 s [vector] +++ OK, passed 100 tests; 18 discarded.
  15654. 1298.62 s [vector] maximumOn: OK
  15655. 1298.62 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15656. 1298.62 s [vector] minimumOn: OK
  15657. 1298.62 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15658. 1298.62 s [vector] maxIndexBy: OK
  15659. 1298.62 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15660. 1298.62 s [vector] minIndexBy: OK
  15661. 1298.63 s [vector] +++ OK, passed 100 tests; 20 discarded.
  15662. 1298.63 s [vector] ListFirstMaxIndexWins: OK
  15663. 1298.63 s [vector] +++ OK, passed 100 tests; 17 discarded.
  15664. 1298.63 s [vector] FalseListFirstMaxIndexWins: OK
  15665. 1298.63 s [vector] +++ OK, failed as expected. (after 1 test):
  15666. 1298.63 s [vector] Exception:
  15667. 1298.63 s [vector] Prelude.foldr1: empty list
  15668. 1298.63 s [vector] CallStack (from HasCallStack):
  15669. 1298.63 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  15670. 1298.63 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  15671. 1298.63 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  15672. 1298.63 s [vector] []
  15673. 1298.63 s [vector] zip: OK
  15674. 1298.63 s [vector] +++ OK, passed 100 tests.
  15675. 1298.63 s [vector] zip3: OK
  15676. 1298.63 s [vector] +++ OK, passed 100 tests.
  15677. 1298.63 s [vector] unzip: OK
  15678. 1298.63 s [vector] +++ OK, passed 100 tests.
  15679. 1298.63 s [vector] unzip3: OK
  15680. 1298.63 s [vector] +++ OK, passed 100 tests.
  15681. 1298.63 s [vector] indexed: OK
  15682. 1298.63 s [vector] +++ OK, passed 100 tests.
  15683. 1298.63 s [vector] update: OK
  15684. 1298.63 s [vector] +++ OK, passed 100 tests.
  15685. 1298.63 s [vector] mempty: OK
  15686. 1298.64 s [vector] +++ OK, passed 100 tests.
  15687. 1298.66 s [vector] mappend: OK
  15688. 1298.66 s [vector] +++ OK, passed 100 tests.
  15689. 1298.66 s [vector] mconcat: OK (0.02s)
  15690. 1298.66 s [vector] +++ OK, passed 100 tests.
  15691. 1298.66 s [vector] glength: OK
  15692. 1298.66 s [vector] +++ OK, passed 100 tests.
  15693. 1298.66 s [vector] sum: OK
  15694. 1298.66 s [vector] +++ OK, passed 100 tests.
  15695. 1298.66 s [vector] product: OK
  15696. 1298.66 s [vector] +++ OK, passed 100 tests.
  15697. 1298.66 s [vector] enumFromN: OK
  15698. 1298.66 s [vector] +++ OK, passed 100 tests.
  15699. 1298.66 s [vector] enumFromThenN: OK
  15700. 1298.66 s [vector] +++ OK, passed 100 tests.
  15701. 1298.66 s [vector] enumFromTo: OK
  15702. 1298.66 s [vector] +++ OK, passed 100 tests.
  15703. 1298.66 s [vector] enumFromThenTo: OK
  15704. 1298.67 s [vector] +++ OK, passed 100 tests; 2 discarded.
  15705. 1298.67 s [vector] (Double)
  15706. 1298.67 s [vector] fromList.toList == id: OK
  15707. 1298.67 s [vector] +++ OK, passed 100 tests.
  15708. 1298.67 s [vector] toList.fromList == id: OK
  15709. 1298.67 s [vector] +++ OK, passed 100 tests.
  15710. 1298.67 s [vector] unstream.stream == id: OK
  15711. 1298.67 s [vector] +++ OK, passed 100 tests.
  15712. 1298.67 s [vector] stream.unstream == id: OK
  15713. 1298.67 s [vector] +++ OK, passed 100 tests.
  15714. 1298.68 s [vector] eq: OK
  15715. 1298.68 s [vector] +++ OK, passed 100 tests.
  15716. 1298.68 s [vector] length: OK
  15717. 1298.68 s [vector] +++ OK, passed 100 tests.
  15718. 1298.68 s [vector] null: OK
  15719. 1298.68 s [vector] +++ OK, passed 100 tests.
  15720. 1298.68 s [vector] index: OK
  15721. 1298.68 s [vector] +++ OK, passed 100 tests; 13 discarded.
  15722. 1298.68 s [vector] safeIndex: OK
  15723. 1298.68 s [vector] +++ OK, passed 100 tests.
  15724. 1298.68 s [vector] head: OK
  15725. 1298.68 s [vector] +++ OK, passed 100 tests; 13 discarded.
  15726. 1298.68 s [vector] last: OK
  15727. 1298.68 s [vector] +++ OK, passed 100 tests; 19 discarded.
  15728. 1298.68 s [vector] unsafeIndex: OK
  15729. 1298.68 s [vector] +++ OK, passed 100 tests; 21 discarded.
  15730. 1298.68 s [vector] unsafeHead: OK
  15731. 1298.68 s [vector] +++ OK, passed 100 tests; 18 discarded.
  15732. 1298.68 s [vector] unsafeLast: OK
  15733. 1298.68 s [vector] +++ OK, passed 100 tests; 20 discarded.
  15734. 1298.68 s [vector] slice: OK
  15735. 1298.68 s [vector] +++ OK, passed 100 tests.
  15736. 1298.68 s [vector] init: OK
  15737. 1298.68 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15738. 1298.68 s [vector] tail: OK
  15739. 1298.68 s [vector] +++ OK, passed 100 tests; 17 discarded.
  15740. 1298.68 s [vector] take: OK
  15741. 1298.68 s [vector] +++ OK, passed 100 tests.
  15742. 1298.68 s [vector] drop: OK
  15743. 1298.68 s [vector] +++ OK, passed 100 tests.
  15744. 1298.68 s [vector] splitAt: OK
  15745. 1298.69 s [vector] +++ OK, passed 100 tests.
  15746. 1298.69 s [vector] empty: OK
  15747. 1298.69 s [vector] +++ OK, passed 100 tests.
  15748. 1298.69 s [vector] singleton: OK
  15749. 1298.69 s [vector] +++ OK, passed 100 tests.
  15750. 1298.69 s [vector] replicate: OK
  15751. 1298.69 s [vector] +++ OK, passed 100 tests.
  15752. 1298.69 s [vector] generate: OK
  15753. 1298.69 s [vector] +++ OK, passed 100 tests.
  15754. 1298.69 s [vector] iterateN: OK
  15755. 1298.69 s [vector] +++ OK, passed 100 tests.
  15756. 1298.76 s [vector] iterateNM: OK (0.06s)
  15757. 1298.76 s [vector] +++ OK, passed 100 tests.
  15758. 1298.80 s [vector] generateM: OK (0.03s)
  15759. 1298.80 s [vector] +++ OK, passed 100 tests.
  15760. 1298.81 s [vector] replicateM: OK (0.03s)
  15761. 1298.81 s [vector] +++ OK, passed 100 tests.
  15762. 1298.81 s [vector] create: OK
  15763. 1298.81 s [vector] +++ OK, passed 100 tests.
  15764. 1298.81 s [vector] createT: OK
  15765. 1298.81 s [vector] +++ OK, passed 100 tests.
  15766. 1298.81 s [vector] unfoldr: OK
  15767. 1298.81 s [vector] +++ OK, passed 100 tests.
  15768. 1298.81 s [vector] unfoldrN: OK
  15769. 1298.81 s [vector] +++ OK, passed 100 tests.
  15770. 1298.81 s [vector] unfoldrExactN: OK
  15771. 1298.82 s [vector] +++ OK, passed 100 tests.
  15772. 1298.84 s [vector] unfoldrM: OK
  15773. 1298.84 s [vector] +++ OK, passed 100 tests.
  15774. 1298.84 s [vector] unfoldrNM: OK (0.02s)
  15775. 1298.84 s [vector] +++ OK, passed 100 tests.
  15776. 1298.90 s [vector] unfoldrExactNM: OK (0.04s)
  15777. 1298.90 s [vector] +++ OK, passed 100 tests.
  15778. 1298.90 s [vector] constructN: OK (0.02s)
  15779. 1298.90 s [vector] +++ OK, passed 100 tests.
  15780. 1298.92 s [vector] constructrN: OK (0.02s)
  15781. 1298.92 s [vector] +++ OK, passed 100 tests.
  15782. 1298.92 s [vector] cons: OK
  15783. 1298.92 s [vector] +++ OK, passed 100 tests.
  15784. 1298.94 s [vector] snoc: OK
  15785. 1298.94 s [vector] +++ OK, passed 100 tests.
  15786. 1298.94 s [vector] append: OK
  15787. 1298.94 s [vector] +++ OK, passed 100 tests.
  15788. 1298.94 s [vector] concat: OK (0.02s)
  15789. 1298.95 s [vector] +++ OK, passed 100 tests.
  15790. 1298.95 s [vector] force: OK
  15791. 1298.95 s [vector] +++ OK, passed 100 tests.
  15792. 1298.95 s [vector] upd: OK
  15793. 1298.95 s [vector] +++ OK, passed 100 tests.
  15794. 1298.96 s [vector] accum: OK
  15795. 1298.96 s [vector] +++ OK, passed 100 tests.
  15796. 1298.96 s [vector] reverse: OK
  15797. 1298.97 s [vector] +++ OK, passed 100 tests.
  15798. 1298.97 s [vector] backpermute: OK
  15799. 1298.97 s [vector] +++ OK, passed 100 tests.
  15800. 1298.97 s [vector] map: OK
  15801. 1298.97 s [vector] +++ OK, passed 100 tests.
  15802. 1298.98 s [vector] imap: OK
  15803. 1298.98 s [vector] +++ OK, passed 100 tests.
  15804. 1299.00 s [vector] concatMap: OK
  15805. 1299.00 s [vector] +++ OK, passed 100 tests.
  15806. 1299.00 s [vector] mapM: OK
  15807. 1299.00 s [vector] +++ OK, passed 100 tests.
  15808. 1299.04 s [vector] mapM_: OK (0.02s)
  15809. 1299.06 s [vector] +++ OK, passed 100 tests.
  15810. 1299.06 s [vector] forM: OK
  15811. 1299.06 s [vector] +++ OK, passed 100 tests.
  15812. 1299.08 s [vector] forM_: OK (0.03s)
  15813. 1299.08 s [vector] +++ OK, passed 100 tests.
  15814. 1299.09 s [vector] imapM: OK
  15815. 1299.09 s [vector] +++ OK, passed 100 tests.
  15816. 1299.12 s [vector] imapM_: OK (0.04s)
  15817. 1299.12 s [vector] +++ OK, passed 100 tests.
  15818. 1299.14 s [vector] zipWith: OK
  15819. 1299.14 s [vector] +++ OK, passed 100 tests.
  15820. 1299.16 s [vector] zipWith3: OK (0.01s)
  15821. 1299.16 s [vector] +++ OK, passed 100 tests.
  15822. 1299.16 s [vector] izipWith: OK (0.01s)
  15823. 1299.16 s [vector] +++ OK, passed 100 tests.
  15824. 1299.17 s [vector] izipWith3: OK
  15825. 1299.17 s [vector] +++ OK, passed 100 tests.
  15826. 1299.20 s [vector] izipWithM: OK
  15827. 1299.20 s [vector] +++ OK, passed 100 tests.
  15828. 1299.22 s [vector] izipWithM_: OK (0.03s)
  15829. 1299.22 s [vector] +++ OK, passed 100 tests.
  15830. 1299.22 s [vector] zipWithM: OK
  15831. 1299.22 s [vector] +++ OK, passed 100 tests.
  15832. 1299.26 s [vector] zipWithM_: OK (0.02s)
  15833. 1299.26 s [vector] +++ OK, passed 100 tests.
  15834. 1299.26 s [vector] filter: OK
  15835. 1299.26 s [vector] +++ OK, passed 100 tests.
  15836. 1299.28 s [vector] ifilter: OK
  15837. 1299.28 s [vector] +++ OK, passed 100 tests.
  15838. 1299.32 s [vector] filterM: OK (0.05s)
  15839. 1299.32 s [vector] +++ OK, passed 100 tests.
  15840. 1299.34 s [vector] uniq: OK
  15841. 1299.34 s [vector] +++ OK, passed 100 tests.
  15842. 1299.36 s [vector] mapMaybe: OK (0.01s)
  15843. 1299.36 s [vector] +++ OK, passed 100 tests.
  15844. 1299.36 s [vector] imapMaybe: OK (0.01s)
  15845. 1299.36 s [vector] +++ OK, passed 100 tests.
  15846. 1299.37 s [vector] takeWhile: OK
  15847. 1299.37 s [vector] +++ OK, passed 100 tests.
  15848. 1299.38 s [vector] dropWhile: OK
  15849. 1299.38 s [vector] +++ OK, passed 100 tests.
  15850. 1299.39 s [vector] partition: OK (0.01s)
  15851. 1299.39 s [vector] +++ OK, passed 100 tests.
  15852. 1299.39 s [vector] partitionWith: OK
  15853. 1299.39 s [vector] +++ OK, passed 100 tests.
  15854. 1299.39 s [vector] span: OK
  15855. 1299.39 s [vector] +++ OK, passed 100 tests.
  15856. 1299.39 s [vector] break: OK
  15857. 1299.39 s [vector] +++ OK, passed 100 tests.
  15858. 1299.39 s [vector] spanR: OK
  15859. 1299.39 s [vector] +++ OK, passed 100 tests.
  15860. 1299.39 s [vector] breakR: OK
  15861. 1299.39 s [vector] +++ OK, passed 100 tests.
  15862. 1299.41 s [vector] groupBy: OK (0.02s)
  15863. 1299.41 s [vector] +++ OK, passed 100 tests.
  15864. 1299.41 s [vector] elem: OK
  15865. 1299.41 s [vector] +++ OK, passed 100 tests.
  15866. 1299.42 s [vector] notElem: OK
  15867. 1299.42 s [vector] +++ OK, passed 100 tests.
  15868. 1299.42 s [vector] find: OK
  15869. 1299.42 s [vector] +++ OK, passed 100 tests.
  15870. 1299.42 s [vector] findIndex: OK
  15871. 1299.42 s [vector] +++ OK, passed 100 tests.
  15872. 1299.43 s [vector] findIndexR: OK
  15873. 1299.43 s [vector] +++ OK, passed 100 tests.
  15874. 1299.43 s [vector] findIndices: OK
  15875. 1299.43 s [vector] +++ OK, passed 100 tests.
  15876. 1299.43 s [vector] elemIndex: OK
  15877. 1299.44 s [vector] +++ OK, passed 100 tests.
  15878. 1299.44 s [vector] elemIndices: OK
  15879. 1299.44 s [vector] +++ OK, passed 100 tests.
  15880. 1299.46 s [vector] foldl: OK (0.01s)
  15881. 1299.46 s [vector] +++ OK, passed 100 tests.
  15882. 1299.46 s [vector] foldl1: OK (0.01s)
  15883. 1299.46 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15884. 1299.48 s [vector] foldl': OK (0.01s)
  15885. 1299.48 s [vector] +++ OK, passed 100 tests.
  15886. 1299.52 s [vector] foldl1': OK (0.03s)
  15887. 1299.52 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15888. 1299.53 s [vector] foldr: OK (0.02s)
  15889. 1299.53 s [vector] +++ OK, passed 100 tests.
  15890. 1299.54 s [vector] foldr1: OK (0.01s)
  15891. 1299.54 s [vector] +++ OK, passed 100 tests; 18 discarded.
  15892. 1299.56 s [vector] foldr': OK (0.01s)
  15893. 1299.56 s [vector] +++ OK, passed 100 tests.
  15894. 1299.56 s [vector] foldr1': OK (0.01s)
  15895. 1299.56 s [vector] +++ OK, passed 100 tests; 19 discarded.
  15896. 1299.58 s [vector] ifoldl: OK
  15897. 1299.58 s [vector] +++ OK, passed 100 tests.
  15898. 1299.59 s [vector] ifoldl': OK (0.01s)
  15899. 1299.59 s [vector] +++ OK, passed 100 tests.
  15900. 1299.62 s [vector] ifoldr: OK
  15901. 1299.62 s [vector] +++ OK, passed 100 tests.
  15902. 1299.64 s [vector] ifoldr': OK (0.02s)
  15903. 1299.64 s [vector] +++ OK, passed 100 tests.
  15904. 1299.64 s [vector] ifoldM: OK (0.02s)
  15905. 1299.64 s [vector] +++ OK, passed 100 tests.
  15906. 1299.65 s [vector] ifoldM': OK
  15907. 1299.65 s [vector] +++ OK, passed 100 tests.
  15908. 1299.72 s [vector] ifoldM_: OK (0.04s)
  15909. 1299.72 s [vector] +++ OK, passed 100 tests.
  15910. 1299.77 s [vector] ifoldM'_: OK (0.07s)
  15911. 1299.77 s [vector] +++ OK, passed 100 tests.
  15912. 1299.77 s [vector] all: OK
  15913. 1299.77 s [vector] +++ OK, passed 100 tests.
  15914. 1299.77 s [vector] any: OK
  15915. 1299.78 s [vector] +++ OK, passed 100 tests.
  15916. 1299.80 s [vector] prescanl: OK (0.02s)
  15917. 1299.80 s [vector] +++ OK, passed 100 tests.
  15918. 1299.84 s [vector] prescanl': OK (0.02s)
  15919. 1299.84 s [vector] +++ OK, passed 100 tests.
  15920. 1299.87 s [vector] postscanl: OK (0.03s)
  15921. 1299.87 s [vector] +++ OK, passed 100 tests.
  15922. 1299.90 s [vector] postscanl': OK (0.02s)
  15923. 1299.90 s [vector] +++ OK, passed 100 tests.
  15924. 1299.96 s [vector] scanl: OK (0.02s)
  15925. 1299.96 s [vector] +++ OK, passed 100 tests.
  15926. 1299.97 s [vector] scanl': OK (0.03s)
  15927. 1299.97 s [vector] +++ OK, passed 100 tests.
  15928. 1300.00 s [vector] scanl1: OK (0.01s)
  15929. 1300.00 s [vector] +++ OK, passed 100 tests.
  15930. 1300.02 s [vector] scanl1': OK (0.02s)
  15931. 1300.02 s [vector] +++ OK, passed 100 tests.
  15932. 1300.04 s [vector] iscanl: OK (0.02s)
  15933. 1300.04 s [vector] +++ OK, passed 100 tests.
  15934. 1300.06 s [vector] iscanl': OK (0.03s)
  15935. 1300.06 s [vector] +++ OK, passed 100 tests.
  15936. 1300.10 s [vector] prescanr: OK (0.03s)
  15937. 1300.10 s [vector] +++ OK, passed 100 tests.
  15938. 1300.12 s [vector] prescanr': OK (0.03s)
  15939. 1300.12 s [vector] +++ OK, passed 100 tests.
  15940. 1300.16 s [vector] postscanr: OK (0.03s)
  15941. 1300.16 s [vector] +++ OK, passed 100 tests.
  15942. 1300.17 s [vector] postscanr': OK (0.03s)
  15943. 1300.17 s [vector] +++ OK, passed 100 tests.
  15944. 1300.22 s [vector] scanr: OK (0.02s)
  15945. 1300.22 s [vector] +++ OK, passed 100 tests.
  15946. 1300.24 s [vector] scanr': OK (0.03s)
  15947. 1300.24 s [vector] +++ OK, passed 100 tests.
  15948. 1300.28 s [vector] scanr1: OK (0.03s)
  15949. 1300.28 s [vector] +++ OK, passed 100 tests.
  15950. 1300.32 s [vector] scanr1': OK (0.03s)
  15951. 1300.32 s [vector] +++ OK, passed 100 tests.
  15952. 1300.34 s [vector] iscanr: OK (0.03s)
  15953. 1300.34 s [vector] +++ OK, passed 100 tests.
  15954. 1300.37 s [vector] iscanr': OK (0.04s)
  15955. 1300.37 s [vector] +++ OK, passed 100 tests.
  15956. 1300.38 s [vector] mut_read: OK
  15957. 1300.38 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15958. 1300.39 s [vector] mut_write: OK
  15959. 1300.39 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15960. 1300.39 s [vector] mut_modify: OK
  15961. 1300.39 s [vector] +++ OK, passed 100 tests; 20 discarded.
  15962. 1300.40 s [vector] mut_generate: OK
  15963. 1300.42 s [vector] +++ OK, passed 100 tests.
  15964. 1300.46 s [vector] mut_generateM: OK (0.03s)
  15965. 1300.46 s [vector] +++ OK, passed 100 tests.
  15966. 1300.54 s [vector] mut_mapM_: OK (0.07s)
  15967. 1300.54 s [vector] +++ OK, passed 100 tests.
  15968. 1300.60 s [vector] mut_imapM_: OK (0.07s)
  15969. 1300.60 s [vector] +++ OK, passed 100 tests.
  15970. 1300.63 s [vector] mut_forM_: OK (0.04s)
  15971. 1300.63 s [vector] +++ OK, passed 100 tests.
  15972. 1300.66 s [vector] mut_iforM_: OK (0.03s)
  15973. 1300.67 s [vector] +++ OK, passed 100 tests.
  15974. 1300.70 s [vector] mut_foldr: OK
  15975. 1300.70 s [vector] +++ OK, passed 100 tests.
  15976. 1300.70 s [vector] mut_foldr': OK (0.02s)
  15977. 1300.70 s [vector] +++ OK, passed 100 tests.
  15978. 1300.74 s [vector] mut_foldl: OK (0.04s)
  15979. 1300.74 s [vector] +++ OK, passed 100 tests.
  15980. 1300.78 s [vector] mut_foldl': OK (0.03s)
  15981. 1300.78 s [vector] +++ OK, passed 100 tests.
  15982. 1300.80 s [vector] mut_ifoldr: OK (0.03s)
  15983. 1300.80 s [vector] +++ OK, passed 100 tests.
  15984. 1300.82 s [vector] mut_ifoldr': OK (0.03s)
  15985. 1300.82 s [vector] +++ OK, passed 100 tests.
  15986. 1300.86 s [vector] mut_ifoldl: OK (0.02s)
  15987. 1300.86 s [vector] +++ OK, passed 100 tests.
  15988. 1300.90 s [vector] mut_ifoldl': OK (0.03s)
  15989. 1300.90 s [vector] +++ OK, passed 100 tests.
  15990. 1300.92 s [vector] mut_foldM: OK (0.03s)
  15991. 1300.92 s [vector] +++ OK, passed 100 tests.
  15992. 1300.96 s [vector] mut_foldM': OK (0.03s)
  15993. 1300.96 s [vector] +++ OK, passed 100 tests.
  15994. 1300.98 s [vector] mut_foldrM: OK (0.03s)
  15995. 1300.98 s [vector] +++ OK, passed 100 tests.
  15996. 1301.01 s [vector] mut_foldrM': OK (0.03s)
  15997. 1301.01 s [vector] +++ OK, passed 100 tests.
  15998. 1301.04 s [vector] mut_ifoldM: OK (0.02s)
  15999. 1301.04 s [vector] +++ OK, passed 100 tests.
  16000. 1301.08 s [vector] mut_ifoldM': OK (0.01s)
  16001. 1301.08 s [vector] +++ OK, passed 100 tests.
  16002. 1301.12 s [vector] mut_ifoldrM: OK (0.03s)
  16003. 1301.12 s [vector] +++ OK, passed 100 tests.
  16004. 1301.14 s [vector] mut_ifoldrM': OK (0.04s)
  16005. 1301.14 s [vector] +++ OK, passed 100 tests.
  16006. 1301.15 s [vector] compare: OK
  16007. 1301.15 s [vector] +++ OK, passed 100 tests.
  16008. 1301.15 s [vector] maximum: OK
  16009. 1301.15 s [vector] +++ OK, passed 100 tests; 16 discarded.
  16010. 1301.15 s [vector] minimum: OK
  16011. 1301.15 s [vector] +++ OK, passed 100 tests; 13 discarded.
  16012. 1301.15 s [vector] minIndex: OK
  16013. 1301.16 s [vector] +++ OK, passed 100 tests; 12 discarded.
  16014. 1301.16 s [vector] maxIndex: OK
  16015. 1301.16 s [vector] +++ OK, passed 100 tests; 19 discarded.
  16016. 1301.16 s [vector] maximumBy: OK
  16017. 1301.16 s [vector] +++ OK, passed 100 tests; 13 discarded.
  16018. 1301.16 s [vector] minimumBy: OK
  16019. 1301.16 s [vector] +++ OK, passed 100 tests; 14 discarded.
  16020. 1301.17 s [vector] maximumOn: OK
  16021. 1301.17 s [vector] +++ OK, passed 100 tests; 13 discarded.
  16022. 1301.17 s [vector] minimumOn: OK
  16023. 1301.17 s [vector] +++ OK, passed 100 tests; 18 discarded.
  16024. 1301.17 s [vector] maxIndexBy: OK
  16025. 1301.17 s [vector] +++ OK, passed 100 tests; 19 discarded.
  16026. 1301.17 s [vector] minIndexBy: OK
  16027. 1301.17 s [vector] +++ OK, passed 100 tests; 15 discarded.
  16028. 1301.17 s [vector] ListFirstMaxIndexWins: OK
  16029. 1301.17 s [vector] +++ OK, passed 100 tests; 20 discarded.
  16030. 1301.17 s [vector] FalseListFirstMaxIndexWins: OK
  16031. 1301.17 s [vector] +++ OK, failed as expected. (after 1 test):
  16032. 1301.17 s [vector] Exception:
  16033. 1301.17 s [vector] Prelude.foldr1: empty list
  16034. 1301.18 s [vector] CallStack (from HasCallStack):
  16035. 1301.18 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  16036. 1301.18 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  16037. 1301.18 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  16038. 1301.18 s [vector] []
  16039. 1301.18 s [vector] zip: OK
  16040. 1301.18 s [vector] +++ OK, passed 100 tests.
  16041. 1301.18 s [vector] zip3: OK
  16042. 1301.19 s [vector] +++ OK, passed 100 tests.
  16043. 1301.19 s [vector] unzip: OK
  16044. 1301.19 s [vector] +++ OK, passed 100 tests.
  16045. 1301.19 s [vector] unzip3: OK
  16046. 1301.19 s [vector] +++ OK, passed 100 tests.
  16047. 1301.19 s [vector] indexed: OK
  16048. 1301.20 s [vector] +++ OK, passed 100 tests.
  16049. 1301.20 s [vector] update: OK
  16050. 1301.20 s [vector] +++ OK, passed 100 tests.
  16051. 1301.20 s [vector] mempty: OK
  16052. 1301.20 s [vector] +++ OK, passed 100 tests.
  16053. 1301.20 s [vector] mappend: OK
  16054. 1301.22 s [vector] +++ OK, passed 100 tests.
  16055. 1301.24 s [vector] mconcat: OK (0.04s)
  16056. 1301.24 s [vector] +++ OK, passed 100 tests.
  16057. 1301.24 s [vector] glength: OK
  16058. 1301.24 s [vector] +++ OK, passed 100 tests.
  16059. 1301.25 s [vector] sum: OK
  16060. 1301.25 s [vector] +++ OK, passed 100 tests.
  16061. 1301.25 s [vector] product: OK
  16062. 1301.25 s [vector] +++ OK, passed 100 tests.
  16063. 1301.25 s [vector] enumFromN: OK
  16064. 1301.25 s [vector] +++ OK, passed 100 tests.
  16065. 1301.25 s [vector] enumFromThenN: OK
  16066. 1301.25 s [vector] +++ OK, passed 100 tests.
  16067. 1301.25 s [vector] enumFromTo: OK
  16068. 1301.25 s [vector] +++ OK, passed 100 tests.
  16069. 1301.25 s [vector] enumFromThenTo: OK
  16070. 1301.25 s [vector] +++ OK, passed 100 tests; 2 discarded.
  16071. 1301.25 s [vector] (Int,Bool)
  16072. 1301.25 s [vector] fromList.toList == id: OK
  16073. 1301.25 s [vector] +++ OK, passed 100 tests.
  16074. 1301.25 s [vector] toList.fromList == id: OK
  16075. 1301.25 s [vector] +++ OK, passed 100 tests.
  16076. 1301.25 s [vector] unstream.stream == id: OK
  16077. 1301.25 s [vector] +++ OK, passed 100 tests.
  16078. 1301.26 s [vector] stream.unstream == id: OK
  16079. 1301.26 s [vector] +++ OK, passed 100 tests.
  16080. 1301.26 s [vector] eq: OK
  16081. 1301.26 s [vector] +++ OK, passed 100 tests.
  16082. 1301.26 s [vector] length: OK
  16083. 1301.26 s [vector] +++ OK, passed 100 tests.
  16084. 1301.26 s [vector] null: OK
  16085. 1301.26 s [vector] +++ OK, passed 100 tests.
  16086. 1301.26 s [vector] index: OK
  16087. 1301.27 s [vector] +++ OK, passed 100 tests; 13 discarded.
  16088. 1301.27 s [vector] safeIndex: OK
  16089. 1301.27 s [vector] +++ OK, passed 100 tests.
  16090. 1301.27 s [vector] head: OK
  16091. 1301.27 s [vector] +++ OK, passed 100 tests; 15 discarded.
  16092. 1301.27 s [vector] last: OK
  16093. 1301.27 s [vector] +++ OK, passed 100 tests; 16 discarded.
  16094. 1301.27 s [vector] unsafeIndex: OK
  16095. 1301.41 s [vector] +++ OK, passed 100 tests; 13 discarded.
  16096. 1301.41 s [vector] unsafeHead: OK
  16097. 1301.41 s [vector] +++ OK, passed 100 tests; 16 discarded.
  16098. 1301.41 s [vector] unsafeLast: OK
  16099. 1301.41 s [vector] +++ OK, passed 100 tests; 14 discarded.
  16100. 1301.41 s [vector] slice: OK
  16101. 1301.41 s [vector] +++ OK, passed 100 tests.
  16102. 1301.41 s [vector] init: OK
  16103. 1301.41 s [vector] +++ OK, passed 100 tests; 20 discarded.
  16104. 1301.41 s [vector] tail: OK
  16105. 1301.41 s [vector] +++ OK, passed 100 tests; 15 discarded.
  16106. 1301.41 s [vector] take: OK
  16107. 1301.41 s [vector] +++ OK, passed 100 tests.
  16108. 1301.41 s [vector] drop: OK
  16109. 1301.41 s [vector] +++ OK, passed 100 tests.
  16110. 1301.41 s [vector] splitAt: OK
  16111. 1301.41 s [vector] +++ OK, passed 100 tests.
  16112. 1301.41 s [vector] empty: OK
  16113. 1301.41 s [vector] +++ OK, passed 100 tests.
  16114. 1301.41 s [vector] singleton: OK
  16115. 1301.41 s [vector] +++ OK, passed 100 tests.
  16116. 1301.41 s [vector] replicate: OK
  16117. 1301.41 s [vector] +++ OK, passed 100 tests.
  16118. 1301.41 s [vector] generate: OK
  16119. 1301.41 s [vector] +++ OK, passed 100 tests.
  16120. 1301.41 s [vector] iterateN: OK
  16121. 1301.41 s [vector] +++ OK, passed 100 tests.
  16122. 1301.55 s [vector] iterateNM: OK (0.25s)
  16123. 1301.55 s [vector] +++ OK, passed 100 tests.
  16124. 1301.64 s [vector] generateM: OK (0.08s)
  16125. 1301.64 s [vector] +++ OK, passed 100 tests.
  16126. 1301.66 s [vector] replicateM: OK (0.02s)
  16127. 1301.66 s [vector] +++ OK, passed 100 tests.
  16128. 1301.66 s [vector] create: OK
  16129. 1301.66 s [vector] +++ OK, passed 100 tests.
  16130. 1301.66 s [vector] createT: OK
  16131. 1301.66 s [vector] +++ OK, passed 100 tests.
  16132. 1301.66 s [vector] unfoldr: OK
  16133. 1301.66 s [vector] +++ OK, passed 100 tests.
  16134. 1301.66 s [vector] unfoldrN: OK
  16135. 1301.67 s [vector] +++ OK, passed 100 tests.
  16136. 1301.67 s [vector] unfoldrExactN: OK
  16137. 1301.67 s [vector] +++ OK, passed 100 tests.
  16138. 1301.67 s [vector] unfoldrM: OK
  16139. 1301.67 s [vector] +++ OK, passed 100 tests.
  16140. 1301.67 s [vector] unfoldrNM: OK
  16141. 1301.67 s [vector] +++ OK, passed 100 tests.
  16142. 1301.82 s [vector] unfoldrExactNM: OK (0.14s)
  16143. 1301.82 s [vector] +++ OK, passed 100 tests.
  16144. 1301.84 s [vector] constructN: OK (0.01s)
  16145. 1301.84 s [vector] +++ OK, passed 100 tests.
  16146. 1301.84 s [vector] constructrN: OK (0.01s)
  16147. 1301.84 s [vector] +++ OK, passed 100 tests.
  16148. 1301.85 s [vector] cons: OK
  16149. 1301.85 s [vector] +++ OK, passed 100 tests.
  16150. 1301.85 s [vector] snoc: OK
  16151. 1301.85 s [vector] +++ OK, passed 100 tests.
  16152. 1301.86 s [vector] append: OK
  16153. 1301.86 s [vector] +++ OK, passed 100 tests.
  16154. 1301.96 s [vector] concat: OK (0.10s)
  16155. 1301.96 s [vector] +++ OK, passed 100 tests.
  16156. 1301.98 s [vector] force: OK
  16157. 1301.98 s [vector] +++ OK, passed 100 tests.
  16158. 1302.01 s [vector] upd: OK (0.01s)
  16159. 1302.01 s [vector] +++ OK, passed 100 tests.
  16160. 1302.01 s [vector] accum: OK (0.02s)
  16161. 1302.01 s [vector] +++ OK, passed 100 tests.
  16162. 1302.01 s [vector] reverse: OK (0.01s)
  16163. 1302.01 s [vector] +++ OK, passed 100 tests.
  16164. 1302.03 s [vector] backpermute: OK
  16165. 1302.03 s [vector] +++ OK, passed 100 tests.
  16166. 1302.05 s [vector] map: OK
  16167. 1302.05 s [vector] +++ OK, passed 100 tests.
  16168. 1302.08 s [vector] imap: OK
  16169. 1302.08 s [vector] +++ OK, passed 100 tests.
  16170. 1302.09 s [vector] concatMap: OK (0.02s)
  16171. 1302.09 s [vector] +++ OK, passed 100 tests.
  16172. 1302.10 s [vector] mapM: OK
  16173. 1302.10 s [vector] +++ OK, passed 100 tests.
  16174. 1302.20 s [vector] mapM_: OK (0.08s)
  16175. 1302.20 s [vector] +++ OK, passed 100 tests.
  16176. 1302.22 s [vector] forM: OK (0.01s)
  16177. 1302.22 s [vector] +++ OK, passed 100 tests.
  16178. 1302.31 s [vector] forM_: OK (0.09s)
  16179. 1302.31 s [vector] +++ OK, passed 100 tests.
  16180. 1302.32 s [vector] imapM: OK (0.01s)
  16181. 1302.32 s [vector] +++ OK, passed 100 tests.
  16182. 1302.36 s [vector] imapM_: OK (0.04s)
  16183. 1302.36 s [vector] +++ OK, passed 100 tests.
  16184. 1302.38 s [vector] zipWith: OK (0.01s)
  16185. 1302.38 s [vector] +++ OK, passed 100 tests.
  16186. 1302.40 s [vector] zipWith3: OK (0.02s)
  16187. 1302.40 s [vector] +++ OK, passed 100 tests.
  16188. 1302.42 s [vector] izipWith: OK (0.02s)
  16189. 1302.42 s [vector] +++ OK, passed 100 tests.
  16190. 1302.43 s [vector] izipWith3: OK
  16191. 1302.43 s [vector] +++ OK, passed 100 tests.
  16192. 1302.44 s [vector] izipWithM: OK
  16193. 1302.44 s [vector] +++ OK, passed 100 tests.
  16194. 1302.47 s [vector] izipWithM_: OK (0.03s)
  16195. 1302.47 s [vector] +++ OK, passed 100 tests.
  16196. 1302.47 s [vector] zipWithM: OK
  16197. 1302.47 s [vector] +++ OK, passed 100 tests.
  16198. 1302.49 s [vector] zipWithM_: OK (0.01s)
  16199. 1302.49 s [vector] +++ OK, passed 100 tests.
  16200. 1302.50 s [vector] filter: OK
  16201. 1302.50 s [vector] +++ OK, passed 100 tests.
  16202. 1302.50 s [vector] ifilter: OK
  16203. 1302.50 s [vector] +++ OK, passed 100 tests.
  16204. 1302.63 s [vector] filterM: OK (0.10s)
  16205. 1302.63 s [vector] +++ OK, passed 100 tests.
  16206. 1302.64 s [vector] uniq: OK
  16207. 1302.64 s [vector] +++ OK, passed 100 tests.
  16208. 1302.66 s [vector] mapMaybe: OK
  16209. 1302.66 s [vector] +++ OK, passed 100 tests.
  16210. 1302.66 s [vector] imapMaybe: OK
  16211. 1302.66 s [vector] +++ OK, passed 100 tests.
  16212. 1302.66 s [vector] takeWhile: OK
  16213. 1302.66 s [vector] +++ OK, passed 100 tests.
  16214. 1302.66 s [vector] dropWhile: OK
  16215. 1302.67 s [vector] +++ OK, passed 100 tests.
  16216. 1302.67 s [vector] partition: OK
  16217. 1302.67 s [vector] +++ OK, passed 100 tests.
  16218. 1302.68 s [vector] partitionWith: OK
  16219. 1302.68 s [vector] +++ OK, passed 100 tests.
  16220. 1302.69 s [vector] span: OK
  16221. 1302.69 s [vector] +++ OK, passed 100 tests.
  16222. 1302.69 s [vector] break: OK
  16223. 1302.69 s [vector] +++ OK, passed 100 tests.
  16224. 1302.69 s [vector] spanR: OK
  16225. 1302.69 s [vector] +++ OK, passed 100 tests.
  16226. 1302.70 s [vector] breakR: OK
  16227. 1302.70 s [vector] +++ OK, passed 100 tests.
  16228. 1302.70 s [vector] groupBy: OK
  16229. 1302.70 s [vector] +++ OK, passed 100 tests.
  16230. 1302.70 s [vector] elem: OK
  16231. 1302.70 s [vector] +++ OK, passed 100 tests.
  16232. 1302.71 s [vector] notElem: OK
  16233. 1302.71 s [vector] +++ OK, passed 100 tests.
  16234. 1302.71 s [vector] find: OK
  16235. 1302.71 s [vector] +++ OK, passed 100 tests.
  16236. 1302.71 s [vector] findIndex: OK
  16237. 1302.71 s [vector] +++ OK, passed 100 tests.
  16238. 1302.71 s [vector] findIndexR: OK
  16239. 1302.71 s [vector] +++ OK, passed 100 tests.
  16240. 1302.71 s [vector] findIndices: OK
  16241. 1302.71 s [vector] +++ OK, passed 100 tests.
  16242. 1302.72 s [vector] elemIndex: OK
  16243. 1302.72 s [vector] +++ OK, passed 100 tests.
  16244. 1302.73 s [vector] elemIndices: OK
  16245. 1302.73 s [vector] +++ OK, passed 100 tests.
  16246. 1302.73 s [vector] foldl: OK
  16247. 1302.73 s [vector] +++ OK, passed 100 tests.
  16248. 1302.74 s [vector] foldl1: OK
  16249. 1302.74 s [vector] +++ OK, passed 100 tests; 17 discarded.
  16250. 1302.75 s [vector] foldl': OK
  16251. 1302.75 s [vector] +++ OK, passed 100 tests.
  16252. 1302.76 s [vector] foldl1': OK
  16253. 1302.76 s [vector] +++ OK, passed 100 tests; 15 discarded.
  16254. 1302.76 s [vector] foldr: OK
  16255. 1302.76 s [vector] +++ OK, passed 100 tests.
  16256. 1302.77 s [vector] foldr1: OK
  16257. 1302.77 s [vector] +++ OK, passed 100 tests; 16 discarded.
  16258. 1302.78 s [vector] foldr': OK
  16259. 1302.78 s [vector] +++ OK, passed 100 tests.
  16260. 1302.78 s [vector] foldr1': OK
  16261. 1302.79 s [vector] +++ OK, passed 100 tests; 12 discarded.
  16262. 1302.80 s [vector] ifoldl: OK
  16263. 1302.80 s [vector] +++ OK, passed 100 tests.
  16264. 1302.81 s [vector] ifoldl': OK
  16265. 1302.81 s [vector] +++ OK, passed 100 tests.
  16266. 1302.82 s [vector] ifoldr: OK
  16267. 1302.82 s [vector] +++ OK, passed 100 tests.
  16268. 1302.82 s [vector] ifoldr': OK
  16269. 1302.82 s [vector] +++ OK, passed 100 tests.
  16270. 1302.82 s [vector] ifoldM: OK
  16271. 1302.83 s [vector] +++ OK, passed 100 tests.
  16272. 1302.84 s [vector] ifoldM': OK
  16273. 1302.84 s [vector] +++ OK, passed 100 tests.
  16274. 1302.88 s [vector] ifoldM_: OK (0.04s)
  16275. 1302.88 s [vector] +++ OK, passed 100 tests.
  16276. 1302.92 s [vector] ifoldM'_: OK (0.05s)
  16277. 1302.92 s [vector] +++ OK, passed 100 tests.
  16278. 1302.92 s [vector] all: OK
  16279. 1302.92 s [vector] +++ OK, passed 100 tests.
  16280. 1302.93 s [vector] any: OK
  16281. 1302.93 s [vector] +++ OK, passed 100 tests.
  16282. 1302.94 s [vector] prescanl: OK
  16283. 1302.94 s [vector] +++ OK, passed 100 tests.
  16284. 1302.94 s [vector] prescanl': OK
  16285. 1302.94 s [vector] +++ OK, passed 100 tests.
  16286. 1302.95 s [vector] postscanl: OK
  16287. 1302.95 s [vector] +++ OK, passed 100 tests.
  16288. 1302.96 s [vector] postscanl': OK
  16289. 1302.96 s [vector] +++ OK, passed 100 tests.
  16290. 1302.96 s [vector] scanl: OK
  16291. 1302.96 s [vector] +++ OK, passed 100 tests.
  16292. 1302.97 s [vector] scanl': OK
  16293. 1302.97 s [vector] +++ OK, passed 100 tests.
  16294. 1302.97 s [vector] scanl1: OK
  16295. 1302.97 s [vector] +++ OK, passed 100 tests.
  16296. 1302.98 s [vector] scanl1': OK
  16297. 1302.99 s [vector] +++ OK, passed 100 tests.
  16298. 1303.00 s [vector] iscanl: OK
  16299. 1303.01 s [vector] +++ OK, passed 100 tests.
  16300. 1303.01 s [vector] iscanl': OK
  16301. 1303.01 s [vector] +++ OK, passed 100 tests.
  16302. 1303.01 s [vector] prescanr: OK
  16303. 1303.01 s [vector] +++ OK, passed 100 tests.
  16304. 1303.02 s [vector] prescanr': OK
  16305. 1303.02 s [vector] +++ OK, passed 100 tests.
  16306. 1303.02 s [vector] postscanr: OK
  16307. 1303.02 s [vector] +++ OK, passed 100 tests.
  16308. 1303.03 s [vector] postscanr': OK
  16309. 1303.03 s [vector] +++ OK, passed 100 tests.
  16310. 1303.04 s [vector] scanr: OK
  16311. 1303.04 s [vector] +++ OK, passed 100 tests.
  16312. 1303.06 s [vector] scanr': OK
  16313. 1303.06 s [vector] +++ OK, passed 100 tests.
  16314. 1303.06 s [vector] scanr1: OK
  16315. 1303.06 s [vector] +++ OK, passed 100 tests.
  16316. 1303.07 s [vector] scanr1': OK
  16317. 1303.07 s [vector] +++ OK, passed 100 tests.
  16318. 1303.08 s [vector] iscanr: OK
  16319. 1303.08 s [vector] +++ OK, passed 100 tests.
  16320. 1303.09 s [vector] iscanr': OK (0.01s)
  16321. 1303.09 s [vector] +++ OK, passed 100 tests.
  16322. 1303.09 s [vector] mut_read: OK
  16323. 1303.09 s [vector] +++ OK, passed 100 tests; 14 discarded.
  16324. 1303.09 s [vector] mut_write: OK
  16325. 1303.09 s [vector] +++ OK, passed 100 tests; 17 discarded.
  16326. 1303.09 s [vector] mut_modify: OK
  16327. 1303.10 s [vector] +++ OK, passed 100 tests; 19 discarded.
  16328. 1303.10 s [vector] mut_generate: OK
  16329. 1303.10 s [vector] +++ OK, passed 100 tests.
  16330. 1303.14 s [vector] mut_generateM: OK (0.03s)
  16331. 1303.14 s [vector] +++ OK, passed 100 tests.
  16332. 1303.18 s [vector] mut_mapM_: OK (0.04s)
  16333. 1303.18 s [vector] +++ OK, passed 100 tests.
  16334. 1303.22 s [vector] mut_imapM_: OK (0.05s)
  16335. 1303.22 s [vector] +++ OK, passed 100 tests.
  16336. 1303.26 s [vector] mut_forM_: OK (0.05s)
  16337. 1303.26 s [vector] +++ OK, passed 100 tests.
  16338. 1303.34 s [vector] mut_iforM_: OK (0.06s)
  16339. 1303.34 s [vector] +++ OK, passed 100 tests.
  16340. 1303.35 s [vector] mut_foldr: OK
  16341. 1303.36 s [vector] +++ OK, passed 100 tests.
  16342. 1303.36 s [vector] mut_foldr': OK
  16343. 1303.36 s [vector] +++ OK, passed 100 tests.
  16344. 1303.37 s [vector] mut_foldl: OK
  16345. 1303.38 s [vector] +++ OK, passed 100 tests.
  16346. 1303.38 s [vector] mut_foldl': OK
  16347. 1303.38 s [vector] +++ OK, passed 100 tests.
  16348. 1303.40 s [vector] mut_ifoldr: OK (0.02s)
  16349. 1303.40 s [vector] +++ OK, passed 100 tests.
  16350. 1303.42 s [vector] mut_ifoldr': OK (0.02s)
  16351. 1303.42 s [vector] +++ OK, passed 100 tests.
  16352. 1303.44 s [vector] mut_ifoldl: OK (0.02s)
  16353. 1303.44 s [vector] +++ OK, passed 100 tests.
  16354. 1303.45 s [vector] mut_ifoldl': OK (0.02s)
  16355. 1303.45 s [vector] +++ OK, passed 100 tests.
  16356. 1303.47 s [vector] mut_foldM: OK
  16357. 1303.47 s [vector] +++ OK, passed 100 tests.
  16358. 1303.47 s [vector] mut_foldM': OK
  16359. 1303.47 s [vector] +++ OK, passed 100 tests.
  16360. 1303.47 s [vector] mut_foldrM: OK
  16361. 1303.48 s [vector] +++ OK, passed 100 tests.
  16362. 1303.48 s [vector] mut_foldrM': OK
  16363. 1303.48 s [vector] +++ OK, passed 100 tests.
  16364. 1303.49 s [vector] mut_ifoldM: OK
  16365. 1303.49 s [vector] +++ OK, passed 100 tests.
  16366. 1303.49 s [vector] mut_ifoldM': OK
  16367. 1303.49 s [vector] +++ OK, passed 100 tests.
  16368. 1303.50 s [vector] mut_ifoldrM: OK
  16369. 1303.50 s [vector] +++ OK, passed 100 tests.
  16370. 1303.51 s [vector] mut_ifoldrM': OK
  16371. 1303.51 s [vector] +++ OK, passed 100 tests.
  16372. 1303.51 s [vector] compare: OK
  16373. 1303.51 s [vector] +++ OK, passed 100 tests.
  16374. 1303.51 s [vector] maximum: OK
  16375. 1303.51 s [vector] +++ OK, passed 100 tests; 18 discarded.
  16376. 1303.51 s [vector] minimum: OK
  16377. 1303.51 s [vector] +++ OK, passed 100 tests; 15 discarded.
  16378. 1303.51 s [vector] minIndex: OK
  16379. 1303.51 s [vector] +++ OK, passed 100 tests; 13 discarded.
  16380. 1303.51 s [vector] maxIndex: OK
  16381. 1303.51 s [vector] +++ OK, passed 100 tests; 15 discarded.
  16382. 1303.51 s [vector] maximumBy: OK
  16383. 1303.51 s [vector] +++ OK, passed 100 tests; 14 discarded.
  16384. 1303.51 s [vector] minimumBy: OK
  16385. 1303.51 s [vector] +++ OK, passed 100 tests; 14 discarded.
  16386. 1303.52 s [vector] maximumOn: OK
  16387. 1303.52 s [vector] +++ OK, passed 100 tests; 19 discarded.
  16388. 1303.52 s [vector] minimumOn: OK
  16389. 1303.52 s [vector] +++ OK, passed 100 tests; 14 discarded.
  16390. 1303.52 s [vector] maxIndexBy: OK
  16391. 1303.52 s [vector] +++ OK, passed 100 tests; 13 discarded.
  16392. 1303.52 s [vector] minIndexBy: OK
  16393. 1303.52 s [vector] +++ OK, passed 100 tests; 15 discarded.
  16394. 1303.53 s [vector] ListFirstMaxIndexWins: OK
  16395. 1303.53 s [vector] +++ OK, passed 100 tests; 20 discarded.
  16396. 1303.53 s [vector] FalseListFirstMaxIndexWins: OK
  16397. 1303.54 s [vector] +++ OK, failed as expected. (after 1 test):
  16398. 1303.54 s [vector] Exception:
  16399. 1303.54 s [vector] Prelude.foldr1: empty list
  16400. 1303.54 s [vector] CallStack (from HasCallStack):
  16401. 1303.54 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  16402. 1303.54 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  16403. 1303.54 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  16404. 1303.54 s [vector] []
  16405. 1303.54 s [vector] zip: OK
  16406. 1303.54 s [vector] +++ OK, passed 100 tests.
  16407. 1303.55 s [vector] zip3: OK
  16408. 1303.55 s [vector] +++ OK, passed 100 tests.
  16409. 1303.56 s [vector] unzip: OK
  16410. 1303.56 s [vector] +++ OK, passed 100 tests.
  16411. 1303.56 s [vector] unzip3: OK
  16412. 1303.56 s [vector] +++ OK, passed 100 tests.
  16413. 1303.57 s [vector] indexed: OK
  16414. 1303.57 s [vector] +++ OK, passed 100 tests.
  16415. 1303.57 s [vector] update: OK
  16416. 1303.57 s [vector] +++ OK, passed 100 tests.
  16417. 1303.57 s [vector] mempty: OK
  16418. 1303.57 s [vector] +++ OK, passed 100 tests.
  16419. 1303.58 s [vector] mappend: OK
  16420. 1303.58 s [vector] +++ OK, passed 100 tests.
  16421. 1303.61 s [vector] mconcat: OK (0.03s)
  16422. 1303.61 s [vector] +++ OK, passed 100 tests.
  16423. 1303.61 s [vector] glength: OK
  16424. 1303.61 s [vector] +++ OK, passed 100 tests.
  16425. 1303.61 s [vector] (Int,Bool,Int)
  16426. 1303.61 s [vector] fromList.toList == id: OK
  16427. 1303.61 s [vector] +++ OK, passed 100 tests.
  16428. 1303.61 s [vector] toList.fromList == id: OK
  16429. 1303.61 s [vector] +++ OK, passed 100 tests.
  16430. 1303.61 s [vector] unstream.stream == id: OK
  16431. 1303.62 s [vector] +++ OK, passed 100 tests.
  16432. 1303.62 s [vector] stream.unstream == id: OK
  16433. 1303.62 s [vector] +++ OK, passed 100 tests.
  16434. 1303.62 s [vector] eq: OK
  16435. 1303.62 s [vector] +++ OK, passed 100 tests.
  16436. 1303.62 s [vector] length: OK
  16437. 1303.62 s [vector] +++ OK, passed 100 tests.
  16438. 1303.62 s [vector] null: OK
  16439. 1303.62 s [vector] +++ OK, passed 100 tests.
  16440. 1303.62 s [vector] index: OK
  16441. 1303.62 s [vector] +++ OK, passed 100 tests; 13 discarded.
  16442. 1303.62 s [vector] safeIndex: OK
  16443. 1303.62 s [vector] +++ OK, passed 100 tests.
  16444. 1303.62 s [vector] head: OK
  16445. 1303.62 s [vector] +++ OK, passed 100 tests; 14 discarded.
  16446. 1303.63 s [vector] last: OK
  16447. 1303.63 s [vector] +++ OK, passed 100 tests; 25 discarded.
  16448. 1303.63 s [vector] unsafeIndex: OK
  16449. 1303.63 s [vector] +++ OK, passed 100 tests; 19 discarded.
  16450. 1303.63 s [vector] unsafeHead: OK
  16451. 1303.63 s [vector] +++ OK, passed 100 tests; 20 discarded.
  16452. 1303.63 s [vector] unsafeLast: OK
  16453. 1303.64 s [vector] +++ OK, passed 100 tests; 16 discarded.
  16454. 1303.64 s [vector] slice: OK
  16455. 1303.64 s [vector] +++ OK, passed 100 tests.
  16456. 1303.65 s [vector] init: OK
  16457. 1303.65 s [vector] +++ OK, passed 100 tests; 15 discarded.
  16458. 1303.65 s [vector] tail: OK
  16459. 1303.65 s [vector] +++ OK, passed 100 tests; 16 discarded.
  16460. 1303.65 s [vector] take: OK
  16461. 1303.66 s [vector] +++ OK, passed 100 tests.
  16462. 1303.66 s [vector] drop: OK
  16463. 1303.66 s [vector] +++ OK, passed 100 tests.
  16464. 1303.66 s [vector] splitAt: OK
  16465. 1303.66 s [vector] +++ OK, passed 100 tests.
  16466. 1303.66 s [vector] empty: OK
  16467. 1303.66 s [vector] +++ OK, passed 100 tests.
  16468. 1303.67 s [vector] singleton: OK
  16469. 1303.67 s [vector] +++ OK, passed 100 tests.
  16470. 1303.68 s [vector] replicate: OK
  16471. 1303.68 s [vector] +++ OK, passed 100 tests.
  16472. 1303.68 s [vector] generate: OK
  16473. 1303.68 s [vector] +++ OK, passed 100 tests.
  16474. 1303.68 s [vector] iterateN: OK
  16475. 1303.68 s [vector] +++ OK, passed 100 tests.
  16476. 1303.80 s [vector] iterateNM: OK (0.12s)
  16477. 1303.80 s [vector] +++ OK, passed 100 tests.
  16478. 1303.88 s [vector] generateM: OK (0.08s)
  16479. 1303.88 s [vector] +++ OK, passed 100 tests.
  16480. 1303.92 s [vector] replicateM: OK (0.04s)
  16481. 1303.92 s [vector] +++ OK, passed 100 tests.
  16482. 1303.92 s [vector] create: OK
  16483. 1303.92 s [vector] +++ OK, passed 100 tests.
  16484. 1303.93 s [vector] createT: OK
  16485. 1303.93 s [vector] +++ OK, passed 100 tests.
  16486. 1303.93 s [vector] unfoldr: OK
  16487. 1303.93 s [vector] +++ OK, passed 100 tests.
  16488. 1303.93 s [vector] unfoldrN: OK
  16489. 1303.93 s [vector] +++ OK, passed 100 tests.
  16490. 1303.93 s [vector] unfoldrExactN: OK
  16491. 1303.93 s [vector] +++ OK, passed 100 tests.
  16492. 1303.95 s [vector] unfoldrM: OK (0.01s)
  16493. 1303.96 s [vector] +++ OK, passed 100 tests.
  16494. 1303.96 s [vector] unfoldrNM: OK
  16495. 1303.96 s [vector] +++ OK, passed 100 tests.
  16496. 1304.04 s [vector] unfoldrExactNM: OK (0.07s)
  16497. 1304.04 s [vector] +++ OK, passed 100 tests.
  16498. 1304.05 s [vector] constructN: OK (0.02s)
  16499. 1304.05 s [vector] +++ OK, passed 100 tests.
  16500. 1304.06 s [vector] constructrN: OK (0.01s)
  16501. 1304.06 s [vector] +++ OK, passed 100 tests.
  16502. 1304.06 s [vector] cons: OK
  16503. 1304.06 s [vector] +++ OK, passed 100 tests.
  16504. 1304.07 s [vector] snoc: OK
  16505. 1304.07 s [vector] +++ OK, passed 100 tests.
  16506. 1304.07 s [vector] append: OK
  16507. 1304.07 s [vector] +++ OK, passed 100 tests.
  16508. 1304.15 s [vector] concat: OK (0.07s)
  16509. 1304.15 s [vector] +++ OK, passed 100 tests.
  16510. 1304.16 s [vector] force: OK
  16511. 1304.16 s [vector] +++ OK, passed 100 tests.
  16512. 1304.16 s [vector] upd: OK
  16513. 1304.16 s [vector] +++ OK, passed 100 tests.
  16514. 1304.17 s [vector] accum: OK
  16515. 1304.17 s [vector] +++ OK, passed 100 tests.
  16516. 1304.17 s [vector] reverse: OK
  16517. 1304.17 s [vector] +++ OK, passed 100 tests.
  16518. 1304.18 s [vector] backpermute: OK
  16519. 1304.18 s [vector] +++ OK, passed 100 tests.
  16520. 1304.19 s [vector] map: OK
  16521. 1304.20 s [vector] +++ OK, passed 100 tests.
  16522. 1304.20 s [vector] imap: OK
  16523. 1304.20 s [vector] +++ OK, passed 100 tests.
  16524. 1304.22 s [vector] concatMap: OK
  16525. 1304.22 s [vector] +++ OK, passed 100 tests.
  16526. 1304.22 s [vector] mapM: OK
  16527. 1304.22 s [vector] +++ OK, passed 100 tests.
  16528. 1304.28 s [vector] mapM_: OK (0.07s)
  16529. 1304.28 s [vector] +++ OK, passed 100 tests.
  16530. 1304.28 s [vector] forM: OK
  16531. 1304.30 s [vector] +++ OK, passed 100 tests.
  16532. 1304.35 s [vector] forM_: OK (0.07s)
  16533. 1304.35 s [vector] +++ OK, passed 100 tests.
  16534. 1304.36 s [vector] imapM: OK
  16535. 1304.36 s [vector] +++ OK, passed 100 tests.
  16536. 1304.40 s [vector] imapM_: OK (0.04s)
  16537. 1304.41 s [vector] +++ OK, passed 100 tests.
  16538. 1304.41 s [vector] zipWith: OK
  16539. 1304.41 s [vector] +++ OK, passed 100 tests.
  16540. 1304.41 s [vector] zipWith3: OK
  16541. 1304.41 s [vector] +++ OK, passed 100 tests.
  16542. 1304.43 s [vector] izipWith: OK
  16543. 1304.44 s [vector] +++ OK, passed 100 tests.
  16544. 1304.44 s [vector] izipWith3: OK
  16545. 1304.44 s [vector] +++ OK, passed 100 tests.
  16546. 1304.44 s [vector] izipWithM: OK
  16547. 1304.44 s [vector] +++ OK, passed 100 tests.
  16548. 1304.47 s [vector] izipWithM_: OK (0.03s)
  16549. 1304.48 s [vector] +++ OK, passed 100 tests.
  16550. 1304.48 s [vector] zipWithM: OK
  16551. 1304.48 s [vector] +++ OK, passed 100 tests.
  16552. 1304.51 s [vector] zipWithM_: OK (0.03s)
  16553. 1304.51 s [vector] +++ OK, passed 100 tests.
  16554. 1304.51 s [vector] filter: OK
  16555. 1304.51 s [vector] +++ OK, passed 100 tests.
  16556. 1304.51 s [vector] ifilter: OK
  16557. 1304.51 s [vector] +++ OK, passed 100 tests.
  16558. 1304.58 s [vector] filterM: OK (0.07s)
  16559. 1304.58 s [vector] +++ OK, passed 100 tests.
  16560. 1304.60 s [vector] uniq: OK
  16561. 1304.60 s [vector] +++ OK, passed 100 tests.
  16562. 1304.61 s [vector] mapMaybe: OK
  16563. 1304.61 s [vector] +++ OK, passed 100 tests.
  16564. 1304.61 s [vector] imapMaybe: OK
  16565. 1304.61 s [vector] +++ OK, passed 100 tests.
  16566. 1304.61 s [vector] takeWhile: OK
  16567. 1304.61 s [vector] +++ OK, passed 100 tests.
  16568. 1304.62 s [vector] dropWhile: OK
  16569. 1304.62 s [vector] +++ OK, passed 100 tests.
  16570. 1304.62 s [vector] partition: OK
  16571. 1304.62 s [vector] +++ OK, passed 100 tests.
  16572. 1304.63 s [vector] partitionWith: OK
  16573. 1304.63 s [vector] +++ OK, passed 100 tests.
  16574. 1304.63 s [vector] span: OK
  16575. 1304.63 s [vector] +++ OK, passed 100 tests.
  16576. 1304.63 s [vector] break: OK
  16577. 1304.63 s [vector] +++ OK, passed 100 tests.
  16578. 1304.63 s [vector] spanR: OK
  16579. 1304.64 s [vector] +++ OK, passed 100 tests.
  16580. 1304.64 s [vector] breakR: OK
  16581. 1304.64 s [vector] +++ OK, passed 100 tests.
  16582. 1304.64 s [vector] groupBy: OK
  16583. 1304.64 s [vector] +++ OK, passed 100 tests.
  16584. 1304.64 s [vector] elem: OK
  16585. 1304.65 s [vector] +++ OK, passed 100 tests.
  16586. 1304.65 s [vector] notElem: OK
  16587. 1304.65 s [vector] +++ OK, passed 100 tests.
  16588. 1304.65 s [vector] find: OK
  16589. 1304.65 s [vector] +++ OK, passed 100 tests.
  16590. 1304.65 s [vector] findIndex: OK
  16591. 1304.65 s [vector] +++ OK, passed 100 tests.
  16592. 1304.65 s [vector] findIndexR: OK
  16593. 1304.65 s [vector] +++ OK, passed 100 tests.
  16594. 1304.65 s [vector] findIndices: OK
  16595. 1304.66 s [vector] +++ OK, passed 100 tests.
  16596. 1304.66 s [vector] elemIndex: OK
  16597. 1304.66 s [vector] +++ OK, passed 100 tests.
  16598. 1304.66 s [vector] elemIndices: OK
  16599. 1304.66 s [vector] +++ OK, passed 100 tests.
  16600. 1304.67 s [vector] foldl: OK
  16601. 1304.67 s [vector] +++ OK, passed 100 tests.
  16602. 1304.67 s [vector] foldl1: OK
  16603. 1304.68 s [vector] +++ OK, passed 100 tests; 19 discarded.
  16604. 1304.68 s [vector] foldl': OK
  16605. 1304.68 s [vector] +++ OK, passed 100 tests.
  16606. 1304.69 s [vector] foldl1': OK
  16607. 1304.69 s [vector] +++ OK, passed 100 tests; 17 discarded.
  16608. 1304.69 s [vector] foldr: OK
  16609. 1304.69 s [vector] +++ OK, passed 100 tests.
  16610. 1304.70 s [vector] foldr1: OK
  16611. 1304.70 s [vector] +++ OK, passed 100 tests; 21 discarded.
  16612. 1304.71 s [vector] foldr': OK
  16613. 1304.71 s [vector] +++ OK, passed 100 tests.
  16614. 1304.72 s [vector] foldr1': OK
  16615. 1304.72 s [vector] +++ OK, passed 100 tests; 15 discarded.
  16616. 1304.72 s [vector] ifoldl: OK
  16617. 1304.72 s [vector] +++ OK, passed 100 tests.
  16618. 1304.72 s [vector] ifoldl': OK
  16619. 1304.72 s [vector] +++ OK, passed 100 tests.
  16620. 1304.74 s [vector] ifoldr: OK
  16621. 1304.74 s [vector] +++ OK, passed 100 tests.
  16622. 1304.75 s [vector] ifoldr': OK
  16623. 1304.76 s [vector] +++ OK, passed 100 tests.
  16624. 1304.76 s [vector] ifoldM: OK
  16625. 1304.76 s [vector] +++ OK, passed 100 tests.
  16626. 1304.76 s [vector] ifoldM': OK
  16627. 1304.76 s [vector] +++ OK, passed 100 tests.
  16628. 1304.80 s [vector] ifoldM_: OK (0.04s)
  16629. 1304.80 s [vector] +++ OK, passed 100 tests.
  16630. 1304.84 s [vector] ifoldM'_: OK (0.04s)
  16631. 1304.84 s [vector] +++ OK, passed 100 tests.
  16632. 1304.84 s [vector] all: OK
  16633. 1304.84 s [vector] +++ OK, passed 100 tests.
  16634. 1304.85 s [vector] any: OK
  16635. 1304.85 s [vector] +++ OK, passed 100 tests.
  16636. 1304.87 s [vector] prescanl: OK
  16637. 1304.87 s [vector] +++ OK, passed 100 tests.
  16638. 1304.87 s [vector] prescanl': OK
  16639. 1304.87 s [vector] +++ OK, passed 100 tests.
  16640. 1304.87 s [vector] postscanl: OK (0.02s)
  16641. 1304.87 s [vector] +++ OK, passed 100 tests.
  16642. 1304.88 s [vector] postscanl': OK
  16643. 1304.89 s [vector] +++ OK, passed 100 tests.
  16644. 1304.90 s [vector] scanl: OK
  16645. 1304.90 s [vector] +++ OK, passed 100 tests.
  16646. 1304.92 s [vector] scanl': OK (0.01s)
  16647. 1304.92 s [vector] +++ OK, passed 100 tests.
  16648. 1304.92 s [vector] scanl1: OK (0.01s)
  16649. 1304.92 s [vector] +++ OK, passed 100 tests.
  16650. 1304.94 s [vector] scanl1': OK (0.02s)
  16651. 1304.94 s [vector] +++ OK, passed 100 tests.
  16652. 1304.96 s [vector] iscanl: OK (0.02s)
  16653. 1304.96 s [vector] +++ OK, passed 100 tests.
  16654. 1304.98 s [vector] iscanl': OK (0.02s)
  16655. 1304.98 s [vector] +++ OK, passed 100 tests.
  16656. 1304.98 s [vector] prescanr: OK (0.01s)
  16657. 1304.98 s [vector] +++ OK, passed 100 tests.
  16658. 1305.02 s [vector] prescanr': OK
  16659. 1305.02 s [vector] +++ OK, passed 100 tests.
  16660. 1305.02 s [vector] postscanr: OK (0.01s)
  16661. 1305.02 s [vector] +++ OK, passed 100 tests.
  16662. 1305.03 s [vector] postscanr': OK (0.01s)
  16663. 1305.03 s [vector] +++ OK, passed 100 tests.
  16664. 1305.04 s [vector] scanr: OK
  16665. 1305.04 s [vector] +++ OK, passed 100 tests.
  16666. 1305.05 s [vector] scanr': OK
  16667. 1305.06 s [vector] +++ OK, passed 100 tests.
  16668. 1305.06 s [vector] scanr1: OK
  16669. 1305.06 s [vector] +++ OK, passed 100 tests.
  16670. 1305.06 s [vector] scanr1': OK
  16671. 1305.06 s [vector] +++ OK, passed 100 tests.
  16672. 1305.07 s [vector] iscanr: OK
  16673. 1305.08 s [vector] +++ OK, passed 100 tests.
  16674. 1305.08 s [vector] iscanr': OK
  16675. 1305.08 s [vector] +++ OK, passed 100 tests.
  16676. 1305.08 s [vector] mut_read: OK
  16677. 1305.08 s [vector] +++ OK, passed 100 tests; 14 discarded.
  16678. 1305.08 s [vector] mut_write: OK
  16679. 1305.08 s [vector] +++ OK, passed 100 tests; 15 discarded.
  16680. 1305.08 s [vector] mut_modify: OK
  16681. 1305.08 s [vector] +++ OK, passed 100 tests; 14 discarded.
  16682. 1305.10 s [vector] mut_generate: OK
  16683. 1305.10 s [vector] +++ OK, passed 100 tests.
  16684. 1305.12 s [vector] mut_generateM: OK (0.03s)
  16685. 1305.12 s [vector] +++ OK, passed 100 tests.
  16686. 1305.18 s [vector] mut_mapM_: OK (0.05s)
  16687. 1305.18 s [vector] +++ OK, passed 100 tests.
  16688. 1305.21 s [vector] mut_imapM_: OK (0.05s)
  16689. 1305.21 s [vector] +++ OK, passed 100 tests.
  16690. 1305.28 s [vector] mut_forM_: OK (0.05s)
  16691. 1305.28 s [vector] +++ OK, passed 100 tests.
  16692. 1305.32 s [vector] mut_iforM_: OK (0.05s)
  16693. 1305.32 s [vector] +++ OK, passed 100 tests.
  16694. 1305.33 s [vector] mut_foldr: OK (0.01s)
  16695. 1305.33 s [vector] +++ OK, passed 100 tests.
  16696. 1305.34 s [vector] mut_foldr': OK
  16697. 1305.34 s [vector] +++ OK, passed 100 tests.
  16698. 1305.35 s [vector] mut_foldl: OK (0.01s)
  16699. 1305.35 s [vector] +++ OK, passed 100 tests.
  16700. 1305.36 s [vector] mut_foldl': OK
  16701. 1305.36 s [vector] +++ OK, passed 100 tests.
  16702. 1305.36 s [vector] mut_ifoldr: OK
  16703. 1305.36 s [vector] +++ OK, passed 100 tests.
  16704. 1305.38 s [vector] mut_ifoldr': OK
  16705. 1305.38 s [vector] +++ OK, passed 100 tests.
  16706. 1305.39 s [vector] mut_ifoldl: OK
  16707. 1305.40 s [vector] +++ OK, passed 100 tests.
  16708. 1305.40 s [vector] mut_ifoldl': OK
  16709. 1305.40 s [vector] +++ OK, passed 100 tests.
  16710. 1305.40 s [vector] mut_foldM: OK
  16711. 1305.40 s [vector] +++ OK, passed 100 tests.
  16712. 1305.41 s [vector] mut_foldM': OK
  16713. 1305.41 s [vector] +++ OK, passed 100 tests.
  16714. 1305.41 s [vector] mut_foldrM: OK
  16715. 1305.41 s [vector] +++ OK, passed 100 tests.
  16716. 1305.42 s [vector] mut_foldrM': OK
  16717. 1305.42 s [vector] +++ OK, passed 100 tests.
  16718. 1305.44 s [vector] mut_ifoldM: OK
  16719. 1305.44 s [vector] +++ OK, passed 100 tests.
  16720. 1305.44 s [vector] mut_ifoldM': OK
  16721. 1305.44 s [vector] +++ OK, passed 100 tests.
  16722. 1305.44 s [vector] mut_ifoldrM: OK
  16723. 1305.44 s [vector] +++ OK, passed 100 tests.
  16724. 1305.45 s [vector] mut_ifoldrM': OK
  16725. 1305.45 s [vector] +++ OK, passed 100 tests.
  16726. 1305.45 s [vector] compare: OK
  16727. 1305.45 s [vector] +++ OK, passed 100 tests.
  16728. 1305.46 s [vector] maximum: OK
  16729. 1305.46 s [vector] +++ OK, passed 100 tests; 16 discarded.
  16730. 1305.46 s [vector] minimum: OK
  16731. 1305.46 s [vector] +++ OK, passed 100 tests; 14 discarded.
  16732. 1305.46 s [vector] minIndex: OK
  16733. 1305.46 s [vector] +++ OK, passed 100 tests; 14 discarded.
  16734. 1305.46 s [vector] maxIndex: OK
  16735. 1305.46 s [vector] +++ OK, passed 100 tests; 26 discarded.
  16736. 1305.46 s [vector] maximumBy: OK
  16737. 1305.46 s [vector] +++ OK, passed 100 tests; 17 discarded.
  16738. 1305.46 s [vector] minimumBy: OK
  16739. 1305.46 s [vector] +++ OK, passed 100 tests; 13 discarded.
  16740. 1305.46 s [vector] maximumOn: OK
  16741. 1305.46 s [vector] +++ OK, passed 100 tests; 17 discarded.
  16742. 1305.46 s [vector] minimumOn: OK
  16743. 1305.46 s [vector] +++ OK, passed 100 tests; 21 discarded.
  16744. 1305.46 s [vector] maxIndexBy: OK
  16745. 1305.46 s [vector] +++ OK, passed 100 tests; 14 discarded.
  16746. 1305.46 s [vector] minIndexBy: OK
  16747. 1305.46 s [vector] +++ OK, passed 100 tests; 12 discarded.
  16748. 1305.47 s [vector] ListFirstMaxIndexWins: OK
  16749. 1305.47 s [vector] +++ OK, passed 100 tests; 18 discarded.
  16750. 1305.47 s [vector] FalseListFirstMaxIndexWins: OK
  16751. 1305.47 s [vector] +++ OK, failed as expected. (after 1 test):
  16752. 1305.47 s [vector] Exception:
  16753. 1305.47 s [vector] Prelude.foldr1: empty list
  16754. 1305.47 s [vector] CallStack (from HasCallStack):
  16755. 1305.47 s [vector] error, called at libraries/base/GHC/List.hs:1646:3 in base:GHC.List
  16756. 1305.47 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:611:30 in base:GHC.List
  16757. 1305.47 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  16758. 1305.47 s [vector] []
  16759. 1305.48 s [vector] zip: OK
  16760. 1305.48 s [vector] +++ OK, passed 100 tests.
  16761. 1305.48 s [vector] zip3: OK
  16762. 1305.48 s [vector] +++ OK, passed 100 tests.
  16763. 1305.48 s [vector] unzip: OK
  16764. 1305.48 s [vector] +++ OK, passed 100 tests.
  16765. 1305.48 s [vector] unzip3: OK
  16766. 1305.48 s [vector] +++ OK, passed 100 tests.
  16767. 1305.48 s [vector] indexed: OK
  16768. 1305.48 s [vector] +++ OK, passed 100 tests.
  16769. 1305.48 s [vector] update: OK
  16770. 1305.48 s [vector] +++ OK, passed 100 tests.
  16771. 1305.48 s [vector] mempty: OK
  16772. 1305.48 s [vector] +++ OK, passed 100 tests.
  16773. 1305.50 s [vector] mappend: OK
  16774. 1305.50 s [vector] +++ OK, passed 100 tests.
  16775. 1305.52 s [vector] mconcat: OK (0.03s)
  16776. 1305.52 s [vector] +++ OK, passed 100 tests.
  16777. 1305.52 s [vector] glength: OK
  16778. 1305.52 s [vector] +++ OK, passed 100 tests.
  16779. 1305.52 s [vector] unstream
  16780. 1305.52 s [vector] unstream == vunstream (exact): OK
  16781. 1305.52 s [vector] +++ OK, passed 100 tests.
  16782. 1305.52 s [vector] unstream == vunstream (unknown): OK
  16783. 1305.52 s [vector] +++ OK, passed 100 tests.
  16784. 1305.52 s [vector] unstreamR ~= vunstream (exact): OK
  16785. 1305.52 s [vector] +++ OK, passed 100 tests.
  16786. 1305.52 s [vector] unstreamR ~= vunstream (unknown): OK
  16787. 1305.52 s [vector] +++ OK, passed 100 tests.
  16788. 1305.52 s [vector] Data.Vector.Storable.Vector Alignment
  16789. 1305.52 s [vector] Aligned Double: OK
  16790. 1305.52 s [vector] Aligned Int: OK
  16791. 1305.52 s [vector] Regression tests
  16792. 1305.52 s [vector] enumFromTo crash #188
  16793. 1305.52 s [vector] Word8: OK
  16794. 1305.52 s [vector] Word16: OK
  16795. 1305.52 s [vector] Word32: OK
  16796. 1305.52 s [vector] Word64: OK
  16797. 1305.52 s [vector] Word: OK
  16798. 1305.52 s [vector] Int8: OK
  16799. 1305.52 s [vector] Int16: OK
  16800. 1305.52 s [vector] Int32: OK
  16801. 1305.52 s [vector] Int64: OK
  16802. 1305.52 s [vector] Int: OK
  16803. 1305.52 s [vector] Char: OK
  16804. 1305.52 s [vector] Negative tests
  16805. 1305.52 s [vector] slice out of bounds #257
  16806. 1305.52 s [vector] Boxed
  16807. 1305.52 s [vector] Negative ix: OK
  16808. 1305.52 s [vector] Negative size: OK
  16809. 1305.52 s [vector] Negative ix and size: OK
  16810. 1305.52 s [vector] Too large ix: OK
  16811. 1305.52 s [vector] Too large size: OK
  16812. 1305.52 s [vector] Too large ix and size: OK
  16813. 1305.52 s [vector] Overflow: OK
  16814. 1305.52 s [vector] OutOfMemory: OK
  16815. 1305.52 s [vector] Primitive
  16816. 1305.52 s [vector] Negative ix: OK
  16817. 1305.52 s [vector] Negative size: OK
  16818. 1305.52 s [vector] Negative ix and size: OK
  16819. 1305.52 s [vector] Too large ix: OK
  16820. 1305.52 s [vector] Too large size: OK
  16821. 1305.52 s [vector] Too large ix and size: OK
  16822. 1305.52 s [vector] Overflow: OK
  16823. 1305.52 s [vector] OutOfMemory: OK
  16824. 1305.52 s [vector] Storable
  16825. 1305.52 s [vector] Negative ix: OK
  16826. 1305.52 s [vector] Negative size: OK
  16827. 1305.52 s [vector] Negative ix and size: OK
  16828. 1305.52 s [vector] Too large ix: OK
  16829. 1305.52 s [vector] Too large size: OK
  16830. 1305.52 s [vector] Too large ix and size: OK
  16831. 1305.52 s [vector] Overflow: OK
  16832. 1305.52 s [vector] OutOfMemory: OK
  16833. 1305.52 s [vector] Unboxed
  16834. 1305.52 s [vector] Negative ix: OK
  16835. 1305.52 s [vector] Negative size: OK
  16836. 1305.52 s [vector] Negative ix and size: OK
  16837. 1305.52 s [vector] Too large ix: OK
  16838. 1305.52 s [vector] Too large size: OK
  16839. 1305.52 s [vector] Too large ix and size: OK
  16840. 1305.52 s [vector] Overflow: OK
  16841. 1305.52 s [vector] OutOfMemory: OK
  16842. 1305.52 s [vector] take #282
  16843. 1305.52 s [vector] Boxed: OK
  16844. 1305.52 s [vector] Primitive: OK
  16845. 1305.52 s [vector] Storable: OK
  16846. 1305.52 s [vector] Unboxed: OK
  16847. 1305.52 s [vector] Data.Vector
  16848. 1305.52 s [vector] MonadFix: OK
  16849. 1305.52 s [vector] toFromArray: OK
  16850. 1305.52 s [vector] toFromArraySlice: OK
  16851. 1305.52 s [vector] toFromArraySliceUnsafe: OK
  16852. 1305.53 s [vector] toFromMutableArray: OK
  16853. 1305.53 s [vector] Data.Vector.Mutable (Move): OK
  16854. 1305.53 s [vector] +++ OK, passed 100 tests; 18 discarded.
  16855. 1305.53 s [vector] Data.Vector.Primitive.Mutable (Move): OK
  16856. 1305.53 s [vector] +++ OK, passed 100 tests; 14 discarded.
  16857. 1305.53 s [vector] Data.Vector.Unboxed.Mutable (Move): OK
  16858. 1305.53 s [vector] +++ OK, passed 100 tests; 19 discarded.
  16859. 1305.53 s [vector] Data.Vector.Storable.Mutable (Move): OK
  16860. 1305.53 s [vector] +++ OK, passed 100 tests; 15 discarded.
  16861. 1305.54 s [vector] Data.Vector.Generic.Mutable (nextPermutation): OK
  16862. 1305.54 s [vector] +++ OK, passed 100 tests.
  16863. 1305.58 s [vector] Data.Vector.Generic.Mutable (prevPermutation): OK (0.03s)
  16864. 1305.58 s [vector] +++ OK, passed 100 tests.
  16865. 1305.58 s [vector] Data.Vector.Generic.Mutable (nextPermutation then prevPermutation = id): OK
  16866. 1305.58 s [vector] +++ OK, passed 100 tests.
  16867. 1305.58 s [vector] Data.Vector.Generic.Mutable (prevPermutation then nextPermutation = id): OK
  16868. 1305.58 s [vector] +++ OK, passed 100 tests.
  16869. 1305.58 s [vector]
  16870. 1305.58 s [vector] All 2808 tests passed (18.18s)
  16871. 1305.59 s [vector] Test suite vector-tests-O2: PASS
  16872. 1305.59 s [vector] Test suite logged to: dist/test/vector-0.13.2.0-vector-tests-O2.log
  16873. 1305.59 s [vector] 2 of 2 test suites (2 of 2 test cases) passed.
  16874. 1305.61 s [vector] checkPhase completed in 37 seconds
  16875. 1305.61 s [vector] Phase: haddockPhase
  16876. 1305.62 s [vector] Phase: installPhase
  16877. 1305.70 s [vector] Installing library in /nix/store/zwx2a4ffc7zak6cbip0l9cgpmig6ncvd-vector-0.13.2.0/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf
  16878. 1306.81 s [vector] Installing internal library benchmarks-O2 in /nix/store/zwx2a4ffc7zak6cbip0l9cgpmig6ncvd-vector-0.13.2.0/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/vector-0.13.2.0-Buajc9dwOtY17MYNPDdyiX-benchmarks-O2
  16879. 1307.38 s [vector] Phase: fixupPhase
  16880. 1307.40 s [vector] shrinking RPATHs of ELF executables and libraries in /nix/store/zwx2a4ffc7zak6cbip0l9cgpmig6ncvd-vector-0.13.2.0
  16881. 1307.43 s [vector] shrinking /nix/store/zwx2a4ffc7zak6cbip0l9cgpmig6ncvd-vector-0.13.2.0/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/libHSvector-0.13.2.0-Buajc9dwOtY17MYNPDdyiX-benchmarks-O2-ghc9.4.8.so
  16882. 1307.45 s [vector] shrinking /nix/store/zwx2a4ffc7zak6cbip0l9cgpmig6ncvd-vector-0.13.2.0/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/libHSvector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf-ghc9.4.8.so
  16883. 1307.47 s [vector] checking for references to /build/ in /nix/store/zwx2a4ffc7zak6cbip0l9cgpmig6ncvd-vector-0.13.2.0...
  16884. 1307.53 s [vector] patching script interpreter paths in /nix/store/zwx2a4ffc7zak6cbip0l9cgpmig6ncvd-vector-0.13.2.0
  16885. 1307.54 s [vector] stripping (with command strip and flags -S -p) in /nix/store/zwx2a4ffc7zak6cbip0l9cgpmig6ncvd-vector-0.13.2.0/lib
  16886. 1308.64 s [vector:post-build] Uploading to cachix cache "sellout": /nix/store/zwx2a4ffc7zak6cbip0l9cgpmig6ncvd-vector-0.13.2.0
  16887. 1309.12 s [vector:post-build] Nothing to push - all store paths are already on Cachix.
  16888. 1309.18 s [vector:post-build] Uploading to the NixCI cache: /nix/store/zwx2a4ffc7zak6cbip0l9cgpmig6ncvd-vector-0.13.2.0
  16889. 1309.23 s [vector:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  16890. 1309.25 s [vector:post-build] copying 1 paths...
  16891. 1309.25 s [vector:post-build] copying path '/nix/store/zwx2a4ffc7zak6cbip0l9cgpmig6ncvd-vector-0.13.2.0' to 'https://cache.nix-ci.com'...
  16892. 1334.30 s [vector:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  16893. 1334.70 s [vector:post-build] copying 0 paths...
  16894. 1334.72 s Progress: 9 of 19 built, 161 of 161 downloaded from cache
  16895. 1334.81 s Building /nix/store/swjk3fv73r6jsz1dhp76g6r15z9862dv-nothunks-0.3.1.drv
  16896. 1334.98 s [nothunks] Phase: setupCompilerEnvironmentPhase
  16897. 1334.99 s [nothunks] Build with /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8.
  16898. 1335.26 s [nothunks] Phase: unpackPhase
  16899. 1335.26 s [nothunks] unpacking source archive /nix/store/y2bnhvmx2j2igw7ad1jf22kp1dlk8pg2-nothunks-0.3.1.tar.gz
  16900. 1335.27 s [nothunks] source root is nothunks-0.3.1
  16901. 1335.28 s [nothunks] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "nothunks-0.3.1/test/Test/NoThunks/Class.hs"
  16902. 1335.29 s [nothunks] Phase: patchPhase
  16903. 1335.29 s [nothunks] Replace Cabal file with edited version from mirror://hackage/nothunks-0.3.1/revision/1.cabal.
  16904. 1335.30 s [nothunks] Run jailbreak-cabal to lift version restrictions on build inputs.
  16905. 1335.32 s [nothunks] Phase: compileBuildDriverPhase
  16906. 1335.32 s [nothunks] setupCompileFlags: -package-db=/build/tmp.tgoGtDhEGq/setup-package.conf.d -threaded
  16907. 1335.41 s [nothunks] [1 of 2] Compiling Main ( /nix/store/4mdp8nhyfddh7bllbi7xszz7k9955n79-Setup.hs, /build/tmp.tgoGtDhEGq/Main.o )
  16908. 1335.51 s [nothunks] [2 of 2] Linking Setup
  16909. 1337.13 s [nothunks] Phase: updateAutotoolsGnuConfigScriptsPhase
  16910. 1337.14 s [nothunks] Phase: configurePhase
  16911. 1337.15 s [nothunks] configureFlags: --verbose --prefix=/nix/store/iq5l8x330b237jawfh4iplyb58lgfl9n-nothunks-0.3.1 --libdir=$prefix/lib/$compiler --libsubdir=$abi/$libname --docdir=/nix/store/9ipg8j59dwkbajkwvic9m4qd0yi2483v-nothunks-0.3.1-doc/share/doc/nothunks-0.3.1 --with-gcc=gcc --package-db=/build/tmp.tgoGtDhEGq/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/ffyzkisqs4vc4mg28bwwlyqjf8i9ph6b-ncurses-6.5/lib --extra-lib-dirs=/nix/store/n28qgdj8c1q41kf7n4y1jxa6ckp85m3c-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/hi0ar880110k6jsmmili7dh1gq3cg2a9-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/g09cflpnp4g80q56sj9dng1qzv4v4ybc-numactl-2.0.18/lib
  16912. 1337.76 s [nothunks] Using Parsec parser
  16913. 1337.76 s [nothunks] Configuring nothunks-0.3.1...
  16914. 1337.76 s [nothunks] Flags chosen: bytestring=True, text=True, vector=True
  16915. 1337.76 s [nothunks] Dependency base: using base-4.17.2.1
  16916. 1337.76 s [nothunks] Dependency bytestring >=0.10 && <0.13: using bytestring-0.11.5.3
  16917. 1337.76 s [nothunks] Dependency containers: using containers-0.6.7
  16918. 1337.76 s [nothunks] Dependency ghc-heap: using ghc-heap-9.4.8
  16919. 1337.76 s [nothunks] Dependency stm: using stm-2.5.1.0
  16920. 1337.76 s [nothunks] Dependency text >=1.2 && <1.3 || >=2 && <2.2: using text-2.0.2
  16921. 1337.76 s [nothunks] Dependency time: using time-1.12.2
  16922. 1337.76 s [nothunks] Dependency vector >=0.12 && <0.14: using vector-0.13.2.0
  16923. 1337.76 s [nothunks] Dependency wherefrom-compat >=0.1.1 && <0.3: using wherefrom-compat-0.1.1.1
  16924. 1337.76 s [nothunks] Dependency base: using base-4.17.2.1
  16925. 1337.76 s [nothunks] Dependency containers: using containers-0.6.7
  16926. 1337.76 s [nothunks] Dependency ghc-prim: using ghc-prim-0.9.1
  16927. 1337.76 s [nothunks] Dependency hedgehog: using hedgehog-1.5
  16928. 1337.76 s [nothunks] Dependency nothunks: using nothunks-0.3.1
  16929. 1337.76 s [nothunks] Dependency random: using random-1.2.1.3
  16930. 1337.76 s [nothunks] Dependency stm: using stm-2.5.1.0
  16931. 1337.76 s [nothunks] Dependency tasty: using tasty-1.5.3
  16932. 1337.76 s [nothunks] Dependency tasty-hedgehog: using tasty-hedgehog-1.4.0.2
  16933. 1338.29 s [nothunks] Source component graph:
  16934. 1338.29 s [nothunks] component lib
  16935. 1338.29 s [nothunks] component test:nothunks-test dependency lib
  16936. 1338.29 s [nothunks] Configured component graph:
  16937. 1338.29 s [nothunks] component nothunks-0.3.1-KDrurUDZg1HFEnU2vVmQPb
  16938. 1338.29 s [nothunks] include base-4.17.2.1
  16939. 1338.29 s [nothunks] include bytestring-0.11.5.3
  16940. 1338.29 s [nothunks] include containers-0.6.7
  16941. 1338.29 s [nothunks] include ghc-heap-9.4.8
  16942. 1338.29 s [nothunks] include stm-2.5.1.0
  16943. 1338.29 s [nothunks] include text-2.0.2
  16944. 1338.29 s [nothunks] include time-1.12.2
  16945. 1338.29 s [nothunks] include vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf
  16946. 1338.29 s [nothunks] include wherefrom-compat-0.1.1.1-Fap3ZmGHzdB3Wg273lxrCv
  16947. 1338.29 s [nothunks] component nothunks-0.3.1-K9S0WIJxvqMEavxCiCjJ4h-nothunks-test
  16948. 1338.29 s [nothunks] include base-4.17.2.1
  16949. 1338.29 s [nothunks] include containers-0.6.7
  16950. 1338.29 s [nothunks] include ghc-prim-0.9.1
  16951. 1338.29 s [nothunks] include hedgehog-1.5-4fqlZQKIbDIIs4YNb6VW27
  16952. 1338.29 s [nothunks] include nothunks-0.3.1-KDrurUDZg1HFEnU2vVmQPb
  16953. 1338.29 s [nothunks] include random-1.2.1.3-EBsIWSQBdMjJ1kHbvwBdg2
  16954. 1338.29 s [nothunks] include stm-2.5.1.0
  16955. 1338.29 s [nothunks] include tasty-1.5.3-JmKTCIqeCnz2cfDkXVBEQb
  16956. 1338.29 s [nothunks] include tasty-hedgehog-1.4.0.2-BgX8W8M8oIwAdbpIwgsjQ3
  16957. 1338.29 s [nothunks] Linked component graph:
  16958. 1338.29 s [nothunks] unit nothunks-0.3.1-KDrurUDZg1HFEnU2vVmQPb
  16959. 1338.29 s [nothunks] include base-4.17.2.1
  16960. 1338.29 s [nothunks] include bytestring-0.11.5.3
  16961. 1338.29 s [nothunks] include containers-0.6.7
  16962. 1338.29 s [nothunks] include ghc-heap-9.4.8
  16963. 1338.29 s [nothunks] include stm-2.5.1.0
  16964. 1338.29 s [nothunks] include text-2.0.2
  16965. 1338.29 s [nothunks] include time-1.12.2
  16966. 1338.29 s [nothunks] include vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf
  16967. 1338.29 s [nothunks] include wherefrom-compat-0.1.1.1-Fap3ZmGHzdB3Wg273lxrCv
  16968. 1338.29 s [nothunks] NoThunks.Class=nothunks-0.3.1-KDrurUDZg1HFEnU2vVmQPb:NoThunks.Class
  16969. 1338.29 s [nothunks] unit nothunks-0.3.1-K9S0WIJxvqMEavxCiCjJ4h-nothunks-test
  16970. 1338.29 s [nothunks] include base-4.17.2.1
  16971. 1338.29 s [nothunks] include containers-0.6.7
  16972. 1338.29 s [nothunks] include ghc-prim-0.9.1
  16973. 1338.29 s [nothunks] include hedgehog-1.5-4fqlZQKIbDIIs4YNb6VW27
  16974. 1338.30 s [nothunks] include nothunks-0.3.1-KDrurUDZg1HFEnU2vVmQPb
  16975. 1338.30 s [nothunks] include random-1.2.1.3-EBsIWSQBdMjJ1kHbvwBdg2
  16976. 1338.30 s [nothunks] include stm-2.5.1.0
  16977. 1338.30 s [nothunks] include tasty-1.5.3-JmKTCIqeCnz2cfDkXVBEQb
  16978. 1338.30 s [nothunks] include tasty-hedgehog-1.4.0.2-BgX8W8M8oIwAdbpIwgsjQ3
  16979. 1338.30 s [nothunks] Ready component graph:
  16980. 1338.30 s [nothunks] definite nothunks-0.3.1-KDrurUDZg1HFEnU2vVmQPb
  16981. 1338.30 s [nothunks] depends base-4.17.2.1
  16982. 1338.30 s [nothunks] depends bytestring-0.11.5.3
  16983. 1338.30 s [nothunks] depends containers-0.6.7
  16984. 1338.30 s [nothunks] depends ghc-heap-9.4.8
  16985. 1338.30 s [nothunks] depends stm-2.5.1.0
  16986. 1338.30 s [nothunks] depends text-2.0.2
  16987. 1338.30 s [nothunks] depends time-1.12.2
  16988. 1338.30 s [nothunks] depends vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf
  16989. 1338.30 s [nothunks] depends wherefrom-compat-0.1.1.1-Fap3ZmGHzdB3Wg273lxrCv
  16990. 1338.30 s [nothunks] definite nothunks-0.3.1-K9S0WIJxvqMEavxCiCjJ4h-nothunks-test
  16991. 1338.30 s [nothunks] depends base-4.17.2.1
  16992. 1338.30 s [nothunks] depends containers-0.6.7
  16993. 1338.30 s [nothunks] depends ghc-prim-0.9.1
  16994. 1338.30 s [nothunks] depends hedgehog-1.5-4fqlZQKIbDIIs4YNb6VW27
  16995. 1338.30 s [nothunks] depends nothunks-0.3.1-KDrurUDZg1HFEnU2vVmQPb
  16996. 1338.30 s [nothunks] depends random-1.2.1.3-EBsIWSQBdMjJ1kHbvwBdg2
  16997. 1338.30 s [nothunks] depends stm-2.5.1.0
  16998. 1338.30 s [nothunks] depends tasty-1.5.3-JmKTCIqeCnz2cfDkXVBEQb
  16999. 1338.30 s [nothunks] depends tasty-hedgehog-1.4.0.2-BgX8W8M8oIwAdbpIwgsjQ3
  17000. 1338.30 s [nothunks] Using Cabal-3.8.1.0 compiled by ghc-9.4
  17001. 1338.30 s [nothunks] Using compiler: ghc-9.4.8
  17002. 1338.30 s [nothunks] Using install prefix:
  17003. 1338.30 s [nothunks] /nix/store/iq5l8x330b237jawfh4iplyb58lgfl9n-nothunks-0.3.1
  17004. 1338.30 s [nothunks] Executables installed in:
  17005. 1338.30 s [nothunks] /nix/store/iq5l8x330b237jawfh4iplyb58lgfl9n-nothunks-0.3.1/bin
  17006. 1338.30 s [nothunks] Libraries installed in:
  17007. 1338.30 s [nothunks] /nix/store/iq5l8x330b237jawfh4iplyb58lgfl9n-nothunks-0.3.1/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/nothunks-0.3.1-KDrurUDZg1HFEnU2vVmQPb
  17008. 1338.30 s [nothunks] Dynamic Libraries installed in:
  17009. 1338.30 s [nothunks] /nix/store/iq5l8x330b237jawfh4iplyb58lgfl9n-nothunks-0.3.1/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8
  17010. 1338.30 s [nothunks] Private executables installed in:
  17011. 1338.30 s [nothunks] /nix/store/iq5l8x330b237jawfh4iplyb58lgfl9n-nothunks-0.3.1/libexec/x86_64-linux-ghc-9.4.8/nothunks-0.3.1
  17012. 1338.30 s [nothunks] Data files installed in:
  17013. 1338.30 s [nothunks] /nix/store/iq5l8x330b237jawfh4iplyb58lgfl9n-nothunks-0.3.1/share/x86_64-linux-ghc-9.4.8/nothunks-0.3.1
  17014. 1338.30 s [nothunks] Documentation installed in:
  17015. 1338.30 s [nothunks] /nix/store/9ipg8j59dwkbajkwvic9m4qd0yi2483v-nothunks-0.3.1-doc/share/doc/nothunks-0.3.1
  17016. 1338.30 s [nothunks] Configuration files installed in:
  17017. 1338.30 s [nothunks] /nix/store/iq5l8x330b237jawfh4iplyb58lgfl9n-nothunks-0.3.1/etc
  17018. 1338.30 s [nothunks] No alex found
  17019. 1338.30 s [nothunks] Using ar found on system at:
  17020. 1338.30 s [nothunks] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  17021. 1338.30 s [nothunks] No c2hs found
  17022. 1338.30 s [nothunks] No cpphs found
  17023. 1338.30 s [nothunks] No doctest found
  17024. 1338.30 s [nothunks] Using gcc version 14.3.0 given by user at:
  17025. 1338.30 s [nothunks] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  17026. 1338.30 s [nothunks] Using ghc version 9.4.8 found on system at:
  17027. 1338.30 s [nothunks] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/ghc
  17028. 1338.30 s [nothunks] Using ghc-pkg version 9.4.8 found on system at:
  17029. 1338.30 s [nothunks] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/ghc-pkg-9.4.8
  17030. 1338.30 s [nothunks] No ghcjs found
  17031. 1338.30 s [nothunks] No ghcjs-pkg found
  17032. 1338.30 s [nothunks] No greencard found
  17033. 1338.30 s [nothunks] Using haddock version 2.27.0 found on system at:
  17034. 1338.30 s [nothunks] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/haddock-ghc-9.4.8
  17035. 1338.30 s [nothunks] No happy found
  17036. 1338.30 s [nothunks] Using haskell-suite found on system at: haskell-suite-dummy-location
  17037. 1338.30 s [nothunks] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  17038. 1338.30 s [nothunks] No hmake found
  17039. 1338.30 s [nothunks] Using hpc version 0.68 found on system at:
  17040. 1338.30 s [nothunks] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/hpc
  17041. 1338.30 s [nothunks] Using hsc2hs version 0.68.8 found on system at:
  17042. 1338.30 s [nothunks] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/hsc2hs
  17043. 1338.30 s [nothunks] Using hscolour version 1.25 found on system at:
  17044. 1338.30 s [nothunks] /nix/store/87hdxxa93g58b2w9ylr2idn2a40i3fdc-hscolour-1.25/bin/HsColour
  17045. 1338.30 s [nothunks] No jhc found
  17046. 1338.30 s [nothunks] Using ld found on system at:
  17047. 1338.30 s [nothunks] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ld.gold
  17048. 1338.30 s [nothunks] No pkg-config found
  17049. 1338.30 s [nothunks] Using runghc version 9.4.8 found on system at:
  17050. 1338.30 s [nothunks] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/runghc-9.4.8
  17051. 1338.30 s [nothunks] Using strip version 2.44 found on system at:
  17052. 1338.30 s [nothunks] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  17053. 1338.30 s [nothunks] Using tar found on system at:
  17054. 1338.30 s [nothunks] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  17055. 1338.30 s [nothunks] No uhc found
  17056. 1338.32 s [nothunks] Phase: buildPhase
  17057. 1338.41 s [nothunks] Preprocessing library for nothunks-0.3.1..
  17058. 1338.41 s [nothunks] Building library for nothunks-0.3.1..
  17059. 1338.53 s [nothunks] [1 of 1] Compiling NoThunks.Class ( src/NoThunks/Class.hs, dist/build/NoThunks/Class.o, dist/build/NoThunks/Class.dyn_o )
  17060. 1341.86 s [nothunks] [1 of 1] Compiling NoThunks.Class ( src/NoThunks/Class.hs, dist/build/NoThunks/Class.p_o )
  17061. 1346.76 s [nothunks] Preprocessing test suite 'nothunks-test' for nothunks-0.3.1..
  17062. 1346.76 s [nothunks] Building test suite 'nothunks-test' for nothunks-0.3.1..
  17063. 1346.90 s [nothunks] [1 of 2] Compiling Test.NoThunks.Class ( test/Test/NoThunks/Class.hs, dist/build/nothunks-test/nothunks-test-tmp/Test/NoThunks/Class.o )
  17064. 1350.35 s [nothunks] [2 of 2] Compiling Main ( test/Main.hs, dist/build/nothunks-test/nothunks-test-tmp/Main.o )
  17065. 1350.89 s [nothunks] [3 of 3] Linking dist/build/nothunks-test/nothunks-test
  17066. 1352.87 s [nothunks] Phase: checkPhase
  17067. 1352.93 s [nothunks] Running 1 test suites...
  17068. 1352.93 s [nothunks] Test suite nothunks-test: RUNNING...
  17069. 1352.94 s [nothunks] Tests
  17070. 1353.53 s [nothunks] NoThunks.Class
  17071. 1353.53 s [nothunks] Sanity
  17072. 1353.53 s [nothunks] IntNotNF: OK
  17073. 1353.53 s [nothunks] ✓ <interactive> passed 1 test.
  17074. 1353.53 s [nothunks] IntIsNF: OK
  17075. 1353.53 s [nothunks] ✓ <interactive> passed 1 test.
  17076. 1353.53 s [nothunks] Pair: OK
  17077. 1353.53 s [nothunks] ✓ <interactive> passed 1 test.
  17078. 1353.53 s [nothunks] Sum: OK
  17079. 1353.53 s [nothunks] ✓ <interactive> passed 1 test.
  17080. 1353.53 s [nothunks] Fn: OK
  17081. 1353.53 s [nothunks] ✓ <interactive> passed 1 test.
  17082. 1353.53 s [nothunks] IO: OK
  17083. 1353.53 s [nothunks] ✓ <interactive> passed 1 test.
  17084. 1353.53 s [nothunks] InspectHeap
  17085. 1353.53 s [nothunks] Int: OK (0.01s)
  17086. 1353.53 s [nothunks] ✓ <interactive> passed 1000 tests.
  17087. 1353.53 s [nothunks] Just ["Int"] 50% █████████▉··········
  17088. 1353.53 s [nothunks] Nothing 50% ██████████··········
  17089. 1353.53 s [nothunks] IntInt: OK (0.02s)
  17090. 1353.53 s [nothunks] ✓ <interactive> passed 1000 tests.
  17091. 1353.53 s [nothunks] Just ["(,)"] 48% █████████▌··········
  17092. 1353.53 s [nothunks] Just ["Int","(,)"] 38% ███████▋············
  17093. 1353.53 s [nothunks] Nothing 14% ██▊·················
  17094. 1353.53 s [nothunks] SumInt: OK (0.02s)
  17095. 1353.53 s [nothunks] ✓ <interactive> passed 1000 tests.
  17096. 1353.53 s [nothunks] Just ["Either"] 34% ██████▊·············
  17097. 1353.53 s [nothunks] Just ["Int","Either"] 32% ██████▍·············
  17098. 1353.53 s [nothunks] Nothing 34% ██████▊·············
  17099. 1353.53 s [nothunks] ListInt: OK (0.02s)
  17100. 1353.53 s [nothunks] ✓ <interactive> passed 1000 tests.
  17101. 1353.53 s [nothunks] Just ["Int","[]"] 22% ████▎···············
  17102. 1353.53 s [nothunks] Just ["[]"] 44% ████████▊···········
  17103. 1353.53 s [nothunks] Nothing 34% ██████▊·············
  17104. 1353.53 s [nothunks] IntListInt: OK (0.03s)
  17105. 1353.53 s [nothunks] ✓ <interactive> passed 1000 tests.
  17106. 1353.53 s [nothunks] Just ["(,)"] 50% █████████▉··········
  17107. 1353.53 s [nothunks] Just ["Int","(,)"] 26% █████▏··············
  17108. 1353.53 s [nothunks] Just ["Int","[]","(,)"] 5% █···················
  17109. 1353.53 s [nothunks] Just ["[]","(,)"] 11% ██▏·················
  17110. 1353.53 s [nothunks] Nothing 8% █▋··················
  17111. 1353.53 s [nothunks] SeqInt: ✗ EXPECTED FAILURE failed at test/Test/NoThunks/Class.hs:179:7
  17112. 1353.53 s [nothunks] after 8 tests.
  17113. 1353.53 s [nothunks] shrink path: 8:
  17114. 1353.53 s [nothunks] Just ["Int","Seq"] 25% █████···············
  17115. 1353.53 s [nothunks] Nothing 62% ████████████▌·······
  17116. 1353.53 s [nothunks]
  17117. 1353.53 s [nothunks] ┏━━ test/Test/NoThunks/Class.hs ━━━
  17118. 1353.53 s [nothunks] 166 ┃ testWithModel :: forall a. FromModel a
  17119. 1353.53 s [nothunks] 167 ┃ => (Maybe ThunkInfo -> Maybe [String] -> Bool)
  17120. 1353.53 s [nothunks] 168 ┃ -> Proxy a
  17121. 1353.53 s [nothunks] 169 ┃ -- ^ Compare @ThunkInfo@. When we use 'noThunks' this
  17122. 1353.53 s [nothunks] 170 ┃ -- can just be @(==)@; however, when we use 'isNormalForm', the
  17123. 1353.53 s [nothunks] 171 ┃ -- context we will get from the model will be too detailed.
  17124. 1353.53 s [nothunks] 172 ┃ -> Property
  17125. 1353.53 s [nothunks] 173 ┃ testWithModel compareInfo _proxy = withTests 1000 $ property $ do
  17126. 1353.53 s [nothunks] 174 ┃ m :: Model a <- forAll genModel
  17127. 1353.53 s [nothunks] ┃ │ Wrap
  17128. 1353.53 s [nothunks] ┃ │ { unwrap =
  17129. 1353.53 s [nothunks] ┃ │ SeqEnqueue
  17130. 1353.53 s [nothunks] ┃ │ (IntValue 0)
  17131. 1353.53 s [nothunks] ┃ │ (SeqEnqueue
  17132. 1353.53 s [nothunks] ┃ │ (IntValue 0)
  17133. 1353.53 s [nothunks] ┃ │ (SeqEnqueue
  17134. 1353.53 s [nothunks] ┃ │ (IntValue 0)
  17135. 1353.53 s [nothunks] ┃ │ (SeqEnqueue
  17136. 1353.53 s [nothunks] ┃ │ (IntValue 0)
  17137. 1353.53 s [nothunks] ┃ │ (SeqEnqueue (IntValue 0) (SeqEnqueue (IntValue 0) SeqEmpty)))))
  17138. 1353.53 s [nothunks] ┃ │ }
  17139. 1353.53 s [nothunks] 175 ┃ collect $ modelUnexpected [] m
  17140. 1353.53 s [nothunks] 176 ┃ fromModel m $ \a -> do
  17141. 1353.53 s [nothunks] 177 ┃ annotate $ show $ modelIsNF [] m
  17142. 1353.53 s [nothunks] ┃ │ IsNF
  17143. 1353.53 s [nothunks] 178 ┃ isNF <- liftIO $ noThunks [] a
  17144. 1353.53 s [nothunks] 179 ┃ Hedgehog.diff isNF compareInfo (modelUnexpected [] m)
  17145. 1353.53 s [nothunks] ┃ ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  17146. 1353.53 s [nothunks] ┃ │ ━━━ Failed (- lhs) (+ rhs) ━━━
  17147. 1353.53 s [nothunks] ┃ │ - Just
  17148. 1353.53 s [nothunks] ┃ │ - ThunkInfo
  17149. 1353.53 s [nothunks] ┃ │ - { thunkContext = [ "..." , "Seq Int" ] , thunkInfo = Nothing }
  17150. 1353.53 s [nothunks] ┃ │ + Nothing
  17151. 1353.53 s [nothunks]
  17152. 1353.53 s [nothunks] This failure can be reproduced by running:
  17153. 1353.53 s [nothunks] > recheckAt (Seed 3725668816199874395 15750389860013977377) "8:" EXPECTED FAILURE
  17154. 1353.53 s [nothunks]
  17155. 1353.53 s [nothunks] OK (0.04s)
  17156. 1353.53 s [nothunks] ✓ <interactive> passed 1 test.
  17157. 1353.53 s [nothunks] Model
  17158. 1353.53 s [nothunks] Int: OK
  17159. 1353.53 s [nothunks] ✓ <interactive> passed 1000 tests.
  17160. 1353.53 s [nothunks] Just ["Int"] 50% ██████████··········
  17161. 1353.53 s [nothunks] Nothing 50% █████████▉··········
  17162. 1353.53 s [nothunks] IntInt: OK
  17163. 1353.53 s [nothunks] ✓ <interactive> passed 1000 tests.
  17164. 1353.53 s [nothunks] Just ["(,)"] 50% █████████▉··········
  17165. 1353.53 s [nothunks] Just ["Int","(,)"] 36% ███████▎············
  17166. 1353.53 s [nothunks] Nothing 14% ██▊·················
  17167. 1353.53 s [nothunks] SumInt: OK (0.02s)
  17168. 1353.53 s [nothunks] ✓ <interactive> passed 1000 tests.
  17169. 1353.53 s [nothunks] Just ["Either"] 34% ██████▊·············
  17170. 1353.53 s [nothunks] Just ["Int","Either"] 32% ██████▍·············
  17171. 1353.53 s [nothunks] Nothing 34% ██████▊·············
  17172. 1353.53 s [nothunks] ListInt: OK (0.02s)
  17173. 1353.53 s [nothunks] ✓ <interactive> passed 1000 tests.
  17174. 1353.53 s [nothunks] Just ["Int","[]"] 22% ████▎···············
  17175. 1353.53 s [nothunks] Just ["[]"] 44% ████████▋···········
  17176. 1353.53 s [nothunks] Nothing 35% ██████▉·············
  17177. 1353.53 s [nothunks] IntListInt: OK (0.03s)
  17178. 1353.53 s [nothunks] ✓ <interactive> passed 1000 tests.
  17179. 1353.53 s [nothunks] Just ["(,)"] 53% ██████████▌·········
  17180. 1353.53 s [nothunks] Just ["Int","(,)"] 24% ████▊···············
  17181. 1353.53 s [nothunks] Just ["Int","[]","(,)"] 4% ▊···················
  17182. 1353.53 s [nothunks] Just ["[]","(,)"] 10% ██··················
  17183. 1353.53 s [nothunks] Nothing 8% █▋··················
  17184. 1353.53 s [nothunks] SeqInt: OK (0.09s)
  17185. 1353.53 s [nothunks] ✓ <interactive> passed 1000 tests.
  17186. 1353.53 s [nothunks] Just ["Int","Seq"] 46% █████████▏··········
  17187. 1353.53 s [nothunks] Nothing 54% ██████████▊·········
  17188. 1353.53 s [nothunks] AllowThunksIn: OK (0.03s)
  17189. 1353.53 s [nothunks] ✓ <interactive> passed 1000 tests.
  17190. 1353.53 s [nothunks] Just ["Int","field2","Record"] 25% ████▉···············
  17191. 1353.53 s [nothunks] Just ["Record"] 48% █████████▋··········
  17192. 1353.53 s [nothunks] Nothing 27% █████▎··············
  17193. 1353.53 s [nothunks] Fn: OK (0.01s)
  17194. 1353.53 s [nothunks] ✓ <interactive> passed 1000 tests.
  17195. 1353.53 s [nothunks] Just ["->"] 26% █████▏··············
  17196. 1353.53 s [nothunks] Nothing 74% ██████████████▊·····
  17197. 1353.53 s [nothunks] IO: OK (0.01s)
  17198. 1353.53 s [nothunks] ✓ <interactive> passed 1000 tests.
  17199. 1353.53 s [nothunks] Just ["IO"] 24% ████▉···············
  17200. 1353.53 s [nothunks] Nothing 76% ███████████████·····
  17201. 1353.53 s [nothunks] ThunkFreeFn: OK
  17202. 1353.53 s [nothunks] ✓ <interactive> passed 1000 tests.
  17203. 1353.53 s [nothunks] Just ["->"] 24% ████▉···············
  17204. 1353.53 s [nothunks] Just ["...","->"] 38% ███████▋············
  17205. 1353.53 s [nothunks] Nothing 37% ███████▍············
  17206. 1353.53 s [nothunks] ThunkFreeIO: OK (0.01s)
  17207. 1353.53 s [nothunks] ✓ <interactive> passed 1000 tests.
  17208. 1353.53 s [nothunks] Just ["...","IO"] 35% ███████·············
  17209. 1353.53 s [nothunks] Just ["IO"] 25% ████▉···············
  17210. 1353.53 s [nothunks] Nothing 40% ████████············
  17211. 1353.53 s [nothunks] MutableVars
  17212. 1353.53 s [nothunks] IORef
  17213. 1353.53 s [nothunks] NotNF: OK
  17214. 1353.53 s [nothunks] ✓ <interactive> passed 1 test.
  17215. 1353.53 s [nothunks] NF: OK
  17216. 1353.53 s [nothunks] ✓ <interactive> passed 1 test.
  17217. 1353.53 s [nothunks] NotNFPure: OK
  17218. 1353.53 s [nothunks] ✓ <interactive> passed 1 test.
  17219. 1353.53 s [nothunks] NFPure: OK
  17220. 1353.53 s [nothunks] ✓ <interactive> passed 1 test.
  17221. 1353.53 s [nothunks] NotNFAtomically: OK
  17222. 1353.53 s [nothunks] ✓ <interactive> passed 1 test.
  17223. 1353.53 s [nothunks] NFAtomically: OK
  17224. 1353.53 s [nothunks] ✓ <interactive> passed 1 test.
  17225. 1353.53 s [nothunks] MVar
  17226. 1353.53 s [nothunks] NotNF: OK
  17227. 1353.53 s [nothunks] ✓ <interactive> passed 1 test.
  17228. 1353.53 s [nothunks] NF: OK
  17229. 1353.53 s [nothunks] ✓ <interactive> passed 1 test.
  17230. 1353.53 s [nothunks] NotNFPure: OK
  17231. 1353.53 s [nothunks] ✓ <interactive> passed 1 test.
  17232. 1353.53 s [nothunks] NFPure: OK
  17233. 1353.53 s [nothunks] ✓ <interactive> passed 1 test.
  17234. 1353.53 s [nothunks] NotNFAtomically: OK
  17235. 1353.53 s [nothunks] ✓ <interactive> passed 1 test.
  17236. 1353.53 s [nothunks] NFAtomically: OK
  17237. 1353.53 s [nothunks] ✓ <interactive> passed 1 test.
  17238. 1353.53 s [nothunks] TVar
  17239. 1353.53 s [nothunks] NotNF: OK
  17240. 1353.53 s [nothunks] ✓ <interactive> passed 1 test.
  17241. 1353.53 s [nothunks] NF: OK
  17242. 1353.53 s [nothunks] ✓ <interactive> passed 1 test.
  17243. 1353.53 s [nothunks] NotNFPure: OK
  17244. 1353.53 s [nothunks] ✓ <interactive> passed 1 test.
  17245. 1353.53 s [nothunks] NFPure: OK
  17246. 1353.53 s [nothunks] ✓ <interactive> passed 1 test.
  17247. 1353.53 s [nothunks] NotNFAtomically: OK
  17248. 1353.54 s [nothunks] ✓ <interactive> passed 1 test.
  17249. 1353.54 s [nothunks] NFAtomically: OK
  17250. 1353.54 s [nothunks] ✓ <interactive> passed 1 test.
  17251. 1353.54 s [nothunks]
  17252. 1353.54 s [nothunks] All 41 tests passed (0.42s)
  17253. 1353.54 s [nothunks] Test suite nothunks-test: PASS
  17254. 1353.54 s [nothunks] Test suite logged to: dist/test/nothunks-0.3.1-nothunks-test.log
  17255. 1353.54 s [nothunks] 1 of 1 test suites (1 of 1 test cases) passed.
  17256. 1353.54 s [nothunks] Phase: haddockPhase
  17257. 1353.59 s [nothunks] Preprocessing library for nothunks-0.3.1..
  17258. 1353.59 s [nothunks] Running Haddock on library for nothunks-0.3.1..
  17259. 1353.59 s [nothunks] Warning: The documentation for the following packages are not installed. No
  17260. 1353.59 s [nothunks] links will be generated to these packages: vector-0.13.2.0
  17261. 1353.68 s [nothunks] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
  17262. 1354.44 s [nothunks] Warning: 'GHC' is out of scope.
  17263. 1354.44 s [nothunks] If you qualify the identifier, haddock can try to link it anyway.
  17264. 1354.44 s [nothunks] Warning: 'a' is out of scope.
  17265. 1354.44 s [nothunks] If you qualify the identifier, haddock can try to link it anyway.
  17266. 1354.44 s [nothunks] 95% ( 20 / 21) in 'NoThunks.Class'
  17267. 1354.44 s [nothunks] Missing documentation for:
  17268. 1354.44 s [nothunks] Module header
  17269. 1355.34 s [nothunks] Warning: NoThunks.Class: could not find link destinations for:
  17270. 1355.34 s [nothunks]
  17271. 1355.34 s [nothunks] - NoThunks.Class.GShowTypeOf
  17272. 1355.35 s [nothunks] - NoThunks.Class.checkContainsThunks
  17273. 1355.35 s [nothunks] - Data.Vector.Vector
  17274. 1355.35 s [nothunks] - Data.Vector.Unboxed.Base.Vector
  17275. 1355.36 s [nothunks] - NoThunks.Class.HasFields
  17276. 1355.36 s [nothunks] - NoThunks.Class.GWRecordField
  17277. 1355.36 s [nothunks] - NoThunks.Class.Elem
  17278. 1358.58 s [nothunks] Documentation created: dist/doc/html/nothunks/index.html,
  17279. 1358.58 s [nothunks] dist/doc/html/nothunks/nothunks.txt
  17280. 1358.67 s [nothunks] Preprocessing test suite 'nothunks-test' for nothunks-0.3.1..
  17281. 1358.69 s [nothunks] Phase: installPhase
  17282. 1358.74 s [nothunks] Installing library in /nix/store/iq5l8x330b237jawfh4iplyb58lgfl9n-nothunks-0.3.1/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/nothunks-0.3.1-KDrurUDZg1HFEnU2vVmQPb
  17283. 1359.02 s [nothunks] Phase: fixupPhase
  17284. 1359.05 s [nothunks] shrinking RPATHs of ELF executables and libraries in /nix/store/iq5l8x330b237jawfh4iplyb58lgfl9n-nothunks-0.3.1
  17285. 1359.05 s [nothunks] shrinking /nix/store/iq5l8x330b237jawfh4iplyb58lgfl9n-nothunks-0.3.1/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/libHSnothunks-0.3.1-KDrurUDZg1HFEnU2vVmQPb-ghc9.4.8.so
  17286. 1359.07 s [nothunks] checking for references to /build/ in /nix/store/iq5l8x330b237jawfh4iplyb58lgfl9n-nothunks-0.3.1...
  17287. 1359.09 s [nothunks] patching script interpreter paths in /nix/store/iq5l8x330b237jawfh4iplyb58lgfl9n-nothunks-0.3.1
  17288. 1359.10 s [nothunks] stripping (with command strip and flags -S -p) in /nix/store/iq5l8x330b237jawfh4iplyb58lgfl9n-nothunks-0.3.1/lib
  17289. 1359.17 s [nothunks] shrinking RPATHs of ELF executables and libraries in /nix/store/9ipg8j59dwkbajkwvic9m4qd0yi2483v-nothunks-0.3.1-doc
  17290. 1359.17 s [nothunks] checking for references to /build/ in /nix/store/9ipg8j59dwkbajkwvic9m4qd0yi2483v-nothunks-0.3.1-doc...
  17291. 1359.20 s [nothunks] patching script interpreter paths in /nix/store/9ipg8j59dwkbajkwvic9m4qd0yi2483v-nothunks-0.3.1-doc
  17292. 1359.31 s [nothunks:post-build] Uploading to cachix cache "sellout": /nix/store/9ipg8j59dwkbajkwvic9m4qd0yi2483v-nothunks-0.3.1-doc /nix/store/iq5l8x330b237jawfh4iplyb58lgfl9n-nothunks-0.3.1
  17293. 1359.80 s [nothunks:post-build] Nothing to push - all store paths are already on Cachix.
  17294. 1359.82 s [nothunks:post-build] Uploading to the NixCI cache: /nix/store/9ipg8j59dwkbajkwvic9m4qd0yi2483v-nothunks-0.3.1-doc /nix/store/iq5l8x330b237jawfh4iplyb58lgfl9n-nothunks-0.3.1
  17295. 1359.88 s [nothunks:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  17296. 1359.93 s [nothunks:post-build] copying 1 paths...
  17297. 1359.93 s [nothunks:post-build] copying path '/nix/store/iq5l8x330b237jawfh4iplyb58lgfl9n-nothunks-0.3.1' to 'https://cache.nix-ci.com'...
  17298. 1360.67 s [nothunks:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  17299. 1360.78 s [nothunks:post-build] copying 0 paths...
  17300. 1360.82 s Progress: 10 of 19 built, 161 of 161 downloaded from cache
  17301. 1360.91 s Building /nix/store/mmzj631fgjvc2yysr8cz9r3dgsgnn5hy-unordered-containers-0.2.20.1.drv
  17302. 1361.12 s [unordered-containers] Phase: setupCompilerEnvironmentPhase
  17303. 1361.50 s [unordered-containers] Build with /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8.
  17304. 1361.77 s [unordered-containers] Phase: unpackPhase
  17305. 1361.78 s [unordered-containers] unpacking source archive /nix/store/3jhrx7bdq3fc4fyqvqr344f82lb9n9iv-unordered-containers-0.2.20.1.tar.gz
  17306. 1361.79 s [unordered-containers] source root is unordered-containers-0.2.20.1
  17307. 1361.80 s [unordered-containers] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "unordered-containers-0.2.20.1/unordered-containers.cabal"
  17308. 1361.81 s [unordered-containers] Phase: patchPhase
  17309. 1361.82 s [unordered-containers] Phase: compileBuildDriverPhase
  17310. 1361.83 s [unordered-containers] setupCompileFlags: -package-db=/build/tmp.vqV5jdHkgb/setup-package.conf.d -threaded
  17311. 1361.93 s [unordered-containers] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.vqV5jdHkgb/Main.o )
  17312. 1362.04 s [unordered-containers] [2 of 2] Linking Setup
  17313. 1363.77 s [unordered-containers] Phase: updateAutotoolsGnuConfigScriptsPhase
  17314. 1363.78 s [unordered-containers] Phase: configurePhase
  17315. 1363.78 s [unordered-containers] configureFlags: --verbose --prefix=/nix/store/rvfcf52n718bbqjvjsdnijkqpjk3fakv-unordered-containers-0.2.20.1 --libdir=$prefix/lib/$compiler --libsubdir=$abi/$libname --docdir=/nix/store/06pk2jpqzwg3grav3wg0afmhyjfs4hhh-unordered-containers-0.2.20.1-doc/share/doc/unordered-containers-0.2.20.1 --with-gcc=gcc --package-db=/build/tmp.vqV5jdHkgb/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/ffyzkisqs4vc4mg28bwwlyqjf8i9ph6b-ncurses-6.5/lib --extra-lib-dirs=/nix/store/n28qgdj8c1q41kf7n4y1jxa6ckp85m3c-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/hi0ar880110k6jsmmili7dh1gq3cg2a9-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/g09cflpnp4g80q56sj9dng1qzv4v4ybc-numactl-2.0.18/lib
  17316. 1364.39 s [unordered-containers] Using Parsec parser
  17317. 1364.39 s [unordered-containers] Configuring unordered-containers-0.2.20.1...
  17318. 1364.39 s [unordered-containers] Flags chosen: debug=False
  17319. 1364.39 s [unordered-containers] Dependency base >=4.10 && <5: using base-4.17.2.1
  17320. 1364.39 s [unordered-containers] Dependency deepseq >=1.4.3: using deepseq-1.4.8.0
  17321. 1364.39 s [unordered-containers] Dependency hashable >=1.4 && <1.6: using hashable-1.4.7.0
  17322. 1364.39 s [unordered-containers] Dependency template-haskell <2.24: using template-haskell-2.19.0.0
  17323. 1364.39 s [unordered-containers] Dependency ChasingBottoms: using ChasingBottoms-1.3.1.17
  17324. 1364.39 s [unordered-containers] Dependency HUnit: using HUnit-1.6.2.0
  17325. 1364.39 s [unordered-containers] Dependency QuickCheck >=2.4.0.1: using QuickCheck-2.15.0.1
  17326. 1364.39 s [unordered-containers] Dependency base: using base-4.17.2.1
  17327. 1364.39 s [unordered-containers] Dependency containers >=0.5.8: using containers-0.6.7
  17328. 1364.39 s [unordered-containers] Dependency hashable: using hashable-1.4.7.0
  17329. 1364.39 s [unordered-containers] Dependency nothunks >=0.1.3: using nothunks-0.3.1
  17330. 1364.39 s [unordered-containers] Dependency random: using random-1.2.1.3
  17331. 1364.39 s [unordered-containers] Dependency tasty >=1.4.0.3: using tasty-1.5.3
  17332. 1364.39 s [unordered-containers] Dependency tasty-hunit >=0.10.0.3: using tasty-hunit-0.10.2
  17333. 1364.39 s [unordered-containers] Dependency tasty-quickcheck >=0.10.1.2: using tasty-quickcheck-0.11.1
  17334. 1364.39 s [unordered-containers] Dependency unordered-containers: using unordered-containers-0.2.20.1
  17335. 1364.95 s [unordered-containers] Source component graph:
  17336. 1364.95 s [unordered-containers] component lib
  17337. 1364.95 s [unordered-containers] component test:unordered-containers-tests dependency lib
  17338. 1364.95 s [unordered-containers] Configured component graph:
  17339. 1364.95 s [unordered-containers] component unordered-containers-0.2.20.1-D1jqSq3DdSJ3xwUmDFX7JF
  17340. 1364.95 s [unordered-containers] include base-4.17.2.1
  17341. 1364.95 s [unordered-containers] include deepseq-1.4.8.0
  17342. 1364.95 s [unordered-containers] include hashable-1.4.7.0-8ZV7FpkGbGeLiC7s8Zu9SC
  17343. 1364.95 s [unordered-containers] include template-haskell-2.19.0.0
  17344. 1364.95 s [unordered-containers] component unordered-containers-0.2.20.1-67yuju4pA8f8jDWOVFHmAh-unordered-containers-tests
  17345. 1364.95 s [unordered-containers] include ChasingBottoms-1.3.1.17-EahLsxrTNYO3WMAx9yFZkq
  17346. 1364.95 s [unordered-containers] include HUnit-1.6.2.0-GZI6Kc0pBxs4XSBauXwdfA
  17347. 1364.95 s [unordered-containers] include QuickCheck-2.15.0.1-H9C4qdCN40J1jJ9nkbU8lt
  17348. 1364.95 s [unordered-containers] include base-4.17.2.1
  17349. 1364.95 s [unordered-containers] include containers-0.6.7
  17350. 1364.95 s [unordered-containers] include hashable-1.4.7.0-8ZV7FpkGbGeLiC7s8Zu9SC
  17351. 1364.95 s [unordered-containers] include nothunks-0.3.1-KDrurUDZg1HFEnU2vVmQPb
  17352. 1364.95 s [unordered-containers] include random-1.2.1.3-EBsIWSQBdMjJ1kHbvwBdg2
  17353. 1364.95 s [unordered-containers] include tasty-1.5.3-JmKTCIqeCnz2cfDkXVBEQb
  17354. 1364.95 s [unordered-containers] include tasty-hunit-0.10.2-BKEPVyyDdHQLqQfkhUYBIs
  17355. 1364.95 s [unordered-containers] include tasty-quickcheck-0.11.1-I2kaBODHeTY9Cl9vsHe7
  17356. 1364.95 s [unordered-containers] include unordered-containers-0.2.20.1-D1jqSq3DdSJ3xwUmDFX7JF
  17357. 1364.95 s [unordered-containers] Linked component graph:
  17358. 1364.95 s [unordered-containers] unit unordered-containers-0.2.20.1-D1jqSq3DdSJ3xwUmDFX7JF
  17359. 1364.95 s [unordered-containers] include base-4.17.2.1
  17360. 1364.95 s [unordered-containers] include deepseq-1.4.8.0
  17361. 1364.95 s [unordered-containers] include hashable-1.4.7.0-8ZV7FpkGbGeLiC7s8Zu9SC
  17362. 1364.95 s [unordered-containers] include template-haskell-2.19.0.0
  17363. 1364.95 s [unordered-containers] Data.HashMap.Internal=unordered-containers-0.2.20.1-D1jqSq3DdSJ3xwUmDFX7JF:Data.HashMap.Internal,Data.HashMap.Internal.Array=unordered-containers-0.2.20.1-D1jqSq3DdSJ3xwUmDFX7JF:Data.HashMap.Internal.Array,Data.HashMap.Internal.Debug=unordered-containers-0.2.20.1-D1jqSq3DdSJ3xwUmDFX7JF:Data.HashMap.Internal.Debug,Data.HashMap.Internal.List=unordered-containers-0.2.20.1-D1jqSq3DdSJ3xwUmDFX7JF:Data.HashMap.Internal.List,Data.HashMap.Internal.Strict=unordered-containers-0.2.20.1-D1jqSq3DdSJ3xwUmDFX7JF:Data.HashMap.Internal.Strict,Data.HashMap.Lazy=unordered-containers-0.2.20.1-D1jqSq3DdSJ3xwUmDFX7JF:Data.HashMap.Lazy,Data.HashMap.Strict=unordered-containers-0.2.20.1-D1jqSq3DdSJ3xwUmDFX7JF:Data.HashMap.Strict,Data.HashSet=unordered-containers-0.2.20.1-D1jqSq3DdSJ3xwUmDFX7JF:Data.HashSet,Data.HashSet.Internal=unordered-containers-0.2.20.1-D1jqSq3DdSJ3xwUmDFX7JF:Data.HashSet.Internal
  17364. 1364.95 s [unordered-containers] unit unordered-containers-0.2.20.1-67yuju4pA8f8jDWOVFHmAh-unordered-containers-tests
  17365. 1364.95 s [unordered-containers] include ChasingBottoms-1.3.1.17-EahLsxrTNYO3WMAx9yFZkq
  17366. 1364.95 s [unordered-containers] include HUnit-1.6.2.0-GZI6Kc0pBxs4XSBauXwdfA
  17367. 1364.95 s [unordered-containers] include QuickCheck-2.15.0.1-H9C4qdCN40J1jJ9nkbU8lt
  17368. 1364.95 s [unordered-containers] include base-4.17.2.1
  17369. 1364.95 s [unordered-containers] include containers-0.6.7
  17370. 1364.95 s [unordered-containers] include hashable-1.4.7.0-8ZV7FpkGbGeLiC7s8Zu9SC
  17371. 1364.95 s [unordered-containers] include nothunks-0.3.1-KDrurUDZg1HFEnU2vVmQPb
  17372. 1364.95 s [unordered-containers] include random-1.2.1.3-EBsIWSQBdMjJ1kHbvwBdg2
  17373. 1364.95 s [unordered-containers] include tasty-1.5.3-JmKTCIqeCnz2cfDkXVBEQb
  17374. 1364.95 s [unordered-containers] include tasty-hunit-0.10.2-BKEPVyyDdHQLqQfkhUYBIs
  17375. 1364.95 s [unordered-containers] include tasty-quickcheck-0.11.1-I2kaBODHeTY9Cl9vsHe7
  17376. 1364.95 s [unordered-containers] include unordered-containers-0.2.20.1-D1jqSq3DdSJ3xwUmDFX7JF
  17377. 1364.95 s [unordered-containers] Ready component graph:
  17378. 1364.95 s [unordered-containers] definite unordered-containers-0.2.20.1-D1jqSq3DdSJ3xwUmDFX7JF
  17379. 1364.95 s [unordered-containers] depends base-4.17.2.1
  17380. 1364.95 s [unordered-containers] depends deepseq-1.4.8.0
  17381. 1364.95 s [unordered-containers] depends hashable-1.4.7.0-8ZV7FpkGbGeLiC7s8Zu9SC
  17382. 1364.95 s [unordered-containers] depends template-haskell-2.19.0.0
  17383. 1364.95 s [unordered-containers] definite unordered-containers-0.2.20.1-67yuju4pA8f8jDWOVFHmAh-unordered-containers-tests
  17384. 1364.95 s [unordered-containers] depends ChasingBottoms-1.3.1.17-EahLsxrTNYO3WMAx9yFZkq
  17385. 1364.95 s [unordered-containers] depends HUnit-1.6.2.0-GZI6Kc0pBxs4XSBauXwdfA
  17386. 1364.95 s [unordered-containers] depends QuickCheck-2.15.0.1-H9C4qdCN40J1jJ9nkbU8lt
  17387. 1364.95 s [unordered-containers] depends base-4.17.2.1
  17388. 1364.95 s [unordered-containers] depends containers-0.6.7
  17389. 1364.95 s [unordered-containers] depends hashable-1.4.7.0-8ZV7FpkGbGeLiC7s8Zu9SC
  17390. 1364.95 s [unordered-containers] depends nothunks-0.3.1-KDrurUDZg1HFEnU2vVmQPb
  17391. 1364.95 s [unordered-containers] depends random-1.2.1.3-EBsIWSQBdMjJ1kHbvwBdg2
  17392. 1364.95 s [unordered-containers] depends tasty-1.5.3-JmKTCIqeCnz2cfDkXVBEQb
  17393. 1364.95 s [unordered-containers] depends tasty-hunit-0.10.2-BKEPVyyDdHQLqQfkhUYBIs
  17394. 1364.95 s [unordered-containers] depends tasty-quickcheck-0.11.1-I2kaBODHeTY9Cl9vsHe7
  17395. 1364.95 s [unordered-containers] depends unordered-containers-0.2.20.1-D1jqSq3DdSJ3xwUmDFX7JF
  17396. 1364.95 s [unordered-containers] Using Cabal-3.8.1.0 compiled by ghc-9.4
  17397. 1364.95 s [unordered-containers] Using compiler: ghc-9.4.8
  17398. 1364.95 s [unordered-containers] Using install prefix:
  17399. 1364.95 s [unordered-containers] /nix/store/rvfcf52n718bbqjvjsdnijkqpjk3fakv-unordered-containers-0.2.20.1
  17400. 1364.95 s [unordered-containers] Executables installed in:
  17401. 1364.95 s [unordered-containers] /nix/store/rvfcf52n718bbqjvjsdnijkqpjk3fakv-unordered-containers-0.2.20.1/bin
  17402. 1364.95 s [unordered-containers] Libraries installed in:
  17403. 1364.95 s [unordered-containers] /nix/store/rvfcf52n718bbqjvjsdnijkqpjk3fakv-unordered-containers-0.2.20.1/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/unordered-containers-0.2.20.1-D1jqSq3DdSJ3xwUmDFX7JF
  17404. 1364.95 s [unordered-containers] Dynamic Libraries installed in:
  17405. 1364.95 s [unordered-containers] /nix/store/rvfcf52n718bbqjvjsdnijkqpjk3fakv-unordered-containers-0.2.20.1/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8
  17406. 1364.95 s [unordered-containers] Private executables installed in:
  17407. 1364.95 s [unordered-containers] /nix/store/rvfcf52n718bbqjvjsdnijkqpjk3fakv-unordered-containers-0.2.20.1/libexec/x86_64-linux-ghc-9.4.8/unordered-containers-0.2.20.1
  17408. 1364.95 s [unordered-containers] Data files installed in:
  17409. 1364.95 s [unordered-containers] /nix/store/rvfcf52n718bbqjvjsdnijkqpjk3fakv-unordered-containers-0.2.20.1/share/x86_64-linux-ghc-9.4.8/unordered-containers-0.2.20.1
  17410. 1364.95 s [unordered-containers] Documentation installed in:
  17411. 1364.95 s [unordered-containers] /nix/store/06pk2jpqzwg3grav3wg0afmhyjfs4hhh-unordered-containers-0.2.20.1-doc/share/doc/unordered-containers-0.2.20.1
  17412. 1364.95 s [unordered-containers] Configuration files installed in:
  17413. 1364.95 s [unordered-containers] /nix/store/rvfcf52n718bbqjvjsdnijkqpjk3fakv-unordered-containers-0.2.20.1/etc
  17414. 1364.95 s [unordered-containers] No alex found
  17415. 1364.95 s [unordered-containers] Using ar found on system at:
  17416. 1364.95 s [unordered-containers] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  17417. 1364.95 s [unordered-containers] No c2hs found
  17418. 1364.95 s [unordered-containers] No cpphs found
  17419. 1364.95 s [unordered-containers] No doctest found
  17420. 1364.95 s [unordered-containers] Using gcc version 14.3.0 given by user at:
  17421. 1364.95 s [unordered-containers] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  17422. 1364.95 s [unordered-containers] Using ghc version 9.4.8 found on system at:
  17423. 1364.95 s [unordered-containers] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/ghc
  17424. 1364.95 s [unordered-containers] Using ghc-pkg version 9.4.8 found on system at:
  17425. 1364.95 s [unordered-containers] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/ghc-pkg-9.4.8
  17426. 1364.95 s [unordered-containers] No ghcjs found
  17427. 1364.95 s [unordered-containers] No ghcjs-pkg found
  17428. 1364.95 s [unordered-containers] No greencard found
  17429. 1364.95 s [unordered-containers] Using haddock version 2.27.0 found on system at:
  17430. 1364.95 s [unordered-containers] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/haddock-ghc-9.4.8
  17431. 1364.95 s [unordered-containers] No happy found
  17432. 1364.95 s [unordered-containers] Using haskell-suite found on system at: haskell-suite-dummy-location
  17433. 1364.95 s [unordered-containers] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  17434. 1364.95 s [unordered-containers] No hmake found
  17435. 1364.95 s [unordered-containers] Using hpc version 0.68 found on system at:
  17436. 1364.95 s [unordered-containers] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/hpc
  17437. 1364.95 s [unordered-containers] Using hsc2hs version 0.68.8 found on system at:
  17438. 1364.95 s [unordered-containers] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/hsc2hs
  17439. 1364.95 s [unordered-containers] Using hscolour version 1.25 found on system at:
  17440. 1364.95 s [unordered-containers] /nix/store/87hdxxa93g58b2w9ylr2idn2a40i3fdc-hscolour-1.25/bin/HsColour
  17441. 1364.95 s [unordered-containers] No jhc found
  17442. 1364.95 s [unordered-containers] Using ld found on system at:
  17443. 1364.95 s [unordered-containers] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ld.gold
  17444. 1364.95 s [unordered-containers] No pkg-config found
  17445. 1364.95 s [unordered-containers] Using runghc version 9.4.8 found on system at:
  17446. 1364.95 s [unordered-containers] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/runghc-9.4.8
  17447. 1364.95 s [unordered-containers] Using strip version 2.44 found on system at:
  17448. 1364.95 s [unordered-containers] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  17449. 1364.95 s [unordered-containers] Using tar found on system at:
  17450. 1364.95 s [unordered-containers] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  17451. 1364.95 s [unordered-containers] No uhc found
  17452. 1364.97 s [unordered-containers] Phase: buildPhase
  17453. 1365.06 s [unordered-containers] Preprocessing library for unordered-containers-0.2.20.1..
  17454. 1365.06 s [unordered-containers] Building library for unordered-containers-0.2.20.1..
  17455. 1365.41 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 )
  17456. 1366.55 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 )
  17457. 1366.55 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 )
  17458. 1377.67 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 )
  17459. 1378.08 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 )
  17460. 1380.39 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 )
  17461. 1380.39 s [unordered-containers] [7 of 9] Compiling Data.HashSet ( Data/HashSet.hs, dist/build/Data/HashSet.o, dist/build/Data/HashSet.dyn_o )
  17462. 1380.39 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 )
  17463. 1380.42 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 )
  17464. 1381.19 s [unordered-containers] [1 of 9] Compiling Data.HashMap.Internal.Array ( Data/HashMap/Internal/Array.hs, dist/build/Data/HashMap/Internal/Array.p_o )
  17465. 1382.37 s [unordered-containers] [2 of 9] Compiling Data.HashMap.Internal.List ( Data/HashMap/Internal/List.hs, dist/build/Data/HashMap/Internal/List.p_o )
  17466. 1382.37 s [unordered-containers] [3 of 9] Compiling Data.HashMap.Internal ( Data/HashMap/Internal.hs, dist/build/Data/HashMap/Internal.p_o )
  17467. 1398.71 s [unordered-containers] [4 of 9] Compiling Data.HashMap.Internal.Debug ( Data/HashMap/Internal/Debug.hs, dist/build/Data/HashMap/Internal/Debug.p_o )
  17468. 1400.06 s [unordered-containers] [5 of 9] Compiling Data.HashMap.Internal.Strict ( Data/HashMap/Internal/Strict.hs, dist/build/Data/HashMap/Internal/Strict.p_o )
  17469. 1403.98 s [unordered-containers] [6 of 9] Compiling Data.HashSet.Internal ( Data/HashSet/Internal.hs, dist/build/Data/HashSet/Internal.p_o )
  17470. 1403.98 s [unordered-containers] [7 of 9] Compiling Data.HashSet ( Data/HashSet.hs, dist/build/Data/HashSet.p_o )
  17471. 1403.99 s [unordered-containers] [8 of 9] Compiling Data.HashMap.Strict ( Data/HashMap/Strict.hs, dist/build/Data/HashMap/Strict.p_o )
  17472. 1404.76 s [unordered-containers] [9 of 9] Compiling Data.HashMap.Lazy ( Data/HashMap/Lazy.hs, dist/build/Data/HashMap/Lazy.p_o )
  17473. 1406.28 s [unordered-containers] Preprocessing test suite 'unordered-containers-tests' for unordered-containers-0.2.20.1..
  17474. 1406.28 s [unordered-containers] Building test suite 'unordered-containers-tests' for unordered-containers-0.2.20.1..
  17475. 1406.50 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 )
  17476. 1406.83 s [unordered-containers] [2 of 9] Compiling Regressions ( tests/Regressions.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Regressions.o )
  17477. 1411.04 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 )
  17478. 1411.06 s [unordered-containers] [4 of 9] Compiling Strictness ( tests/Strictness.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Strictness.o )
  17479. 1411.06 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 )
  17480. 1411.06 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 )
  17481. 1419.44 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 )
  17482. 1419.45 s [unordered-containers] [8 of 9] Compiling Properties ( tests/Properties.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Properties.o )
  17483. 1419.46 s [unordered-containers] [9 of 9] Compiling Main ( tests/Main.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Main.o )
  17484. 1420.05 s [unordered-containers] [10 of 10] Linking dist/build/unordered-containers-tests/unordered-containers-tests
  17485. 1421.63 s [unordered-containers] buildPhase completed in 57 seconds
  17486. 1421.63 s [unordered-containers] Phase: checkPhase
  17487. 1421.67 s [unordered-containers] Running 1 test suites...
  17488. 1421.67 s [unordered-containers] Test suite unordered-containers-tests: RUNNING...
  17489. 1421.68 s [unordered-containers] All
  17490. 1421.68 s [unordered-containers] Properties
  17491. 1421.68 s [unordered-containers] Data.HashMap.Lazy
  17492. 1421.68 s [unordered-containers] instances
  17493. 1421.68 s [unordered-containers] Eq
  17494. 1421.74 s [unordered-containers] ==: OK (0.05s)
  17495. 1421.74 s [unordered-containers] +++ OK, passed 100 tests.
  17496. 1421.74 s [unordered-containers] /=: OK (0.05s)
  17497. 1421.74 s [unordered-containers] +++ OK, passed 100 tests.
  17498. 1421.74 s [unordered-containers] Ord
  17499. 1421.74 s [unordered-containers] compare reflexive: OK (0.05s)
  17500. 1421.74 s [unordered-containers] +++ OK, passed 100 tests.
  17501. 1421.75 s [unordered-containers] compare transitive: OK (0.06s)
  17502. 1421.75 s [unordered-containers] +++ OK, passed 100 tests.
  17503. 1421.75 s [unordered-containers] compare antisymmetric: OK (0.04s)
  17504. 1421.75 s [unordered-containers] +++ OK, passed 100 tests.
  17505. 1421.75 s [unordered-containers] Ord => Eq: OK (0.03s)
  17506. 1421.75 s [unordered-containers] +++ OK, passed 100 tests.
  17507. 1421.82 s [unordered-containers] Read/Show: OK (0.14s)
  17508. 1421.82 s [unordered-containers] +++ OK, passed 100 tests.
  17509. 1421.82 s [unordered-containers] Functor: OK (0.05s)
  17510. 1421.82 s [unordered-containers] +++ OK, passed 100 tests.
  17511. 1421.82 s [unordered-containers] Foldable: OK
  17512. 1421.82 s [unordered-containers] +++ OK, passed 100 tests.
  17513. 1421.82 s [unordered-containers] Bifoldable
  17514. 1421.82 s [unordered-containers] bifoldMap: OK (0.05s)
  17515. 1421.82 s [unordered-containers] +++ OK, passed 100 tests.
  17516. 1421.82 s [unordered-containers] bifoldr: OK (0.07s)
  17517. 1421.82 s [unordered-containers] +++ OK, passed 100 tests.
  17518. 1421.82 s [unordered-containers] bifoldl: OK (0.04s)
  17519. 1421.82 s [unordered-containers] +++ OK, passed 100 tests.
  17520. 1421.82 s [unordered-containers] Hashable: OK (0.03s)
  17521. 1421.82 s [unordered-containers] +++ OK, passed 100 tests.
  17522. 1421.82 s [unordered-containers] empty
  17523. 1421.82 s [unordered-containers] valid: OK
  17524. 1421.82 s [unordered-containers] +++ OK, passed 1 test.
  17525. 1421.82 s [unordered-containers] singleton
  17526. 1421.82 s [unordered-containers] valid: OK
  17527. 1421.82 s [unordered-containers] +++ OK, passed 100 tests.
  17528. 1421.82 s [unordered-containers] size: OK (0.06s)
  17529. 1421.82 s [unordered-containers] +++ OK, passed 100 tests.
  17530. 1421.82 s [unordered-containers] member: OK
  17531. 1421.82 s [unordered-containers] +++ OK, passed 100 tests.
  17532. 1421.82 s [unordered-containers] lookup: OK (0.04s)
  17533. 1421.82 s [unordered-containers] +++ OK, passed 100 tests.
  17534. 1421.82 s [unordered-containers] !?: OK (0.05s)
  17535. 1421.82 s [unordered-containers] +++ OK, passed 100 tests.
  17536. 1421.82 s [unordered-containers] insert
  17537. 1421.82 s [unordered-containers] model: OK (0.05s)
  17538. 1421.82 s [unordered-containers] +++ OK, passed 100 tests.
  17539. 1421.82 s [unordered-containers] valid: OK (0.04s)
  17540. 1421.82 s [unordered-containers] +++ OK, passed 100 tests.
  17541. 1421.82 s [unordered-containers] insertWith
  17542. 1421.82 s [unordered-containers] insertWith: OK (0.05s)
  17543. 1421.82 s [unordered-containers] +++ OK, passed 100 tests.
  17544. 1421.82 s [unordered-containers] valid: OK (0.02s)
  17545. 1421.82 s [unordered-containers] +++ OK, passed 100 tests.
  17546. 1421.82 s [unordered-containers] delete
  17547. 1421.83 s [unordered-containers] model: OK (0.04s)
  17548. 1421.83 s [unordered-containers] +++ OK, passed 100 tests.
  17549. 1421.83 s [unordered-containers] valid: OK (0.03s)
  17550. 1421.83 s [unordered-containers] +++ OK, passed 100 tests.
  17551. 1421.83 s [unordered-containers] adjust
  17552. 1421.83 s [unordered-containers] model: OK (0.01s)
  17553. 1421.83 s [unordered-containers] +++ OK, passed 100 tests.
  17554. 1421.83 s [unordered-containers] valid: OK (0.02s)
  17555. 1421.83 s [unordered-containers] +++ OK, passed 100 tests.
  17556. 1421.83 s [unordered-containers] update
  17557. 1421.83 s [unordered-containers] model: OK (0.03s)
  17558. 1421.83 s [unordered-containers] +++ OK, passed 100 tests.
  17559. 1421.83 s [unordered-containers] valid: OK (0.02s)
  17560. 1421.83 s [unordered-containers] +++ OK, passed 100 tests.
  17561. 1421.83 s [unordered-containers] alter
  17562. 1421.83 s [unordered-containers] model: OK (0.04s)
  17563. 1421.83 s [unordered-containers] +++ OK, passed 100 tests.
  17564. 1421.83 s [unordered-containers] valid: OK (0.03s)
  17565. 1421.83 s [unordered-containers] +++ OK, passed 100 tests.
  17566. 1421.83 s [unordered-containers] alterF
  17567. 1421.83 s [unordered-containers] model
  17568. 1421.83 s [unordered-containers] []: OK (0.07s)
  17569. 1421.83 s [unordered-containers] +++ OK, passed 100 tests.
  17570. 1421.83 s [unordered-containers] adjust: OK (0.04s)
  17571. 1421.83 s [unordered-containers] +++ OK, passed 100 tests.
  17572. 1421.83 s [unordered-containers] insert: OK (0.04s)
  17573. 1421.83 s [unordered-containers] +++ OK, passed 100 tests.
  17574. 1421.83 s [unordered-containers] insertWith: OK (0.04s)
  17575. 1421.83 s [unordered-containers] +++ OK, passed 100 tests.
  17576. 1421.83 s [unordered-containers] delete: OK (0.04s)
  17577. 1421.83 s [unordered-containers] +++ OK, passed 100 tests.
  17578. 1421.83 s [unordered-containers] lookup: OK (0.04s)
  17579. 1421.83 s [unordered-containers] +++ OK, passed 100 tests.
  17580. 1421.83 s [unordered-containers] valid: OK (0.05s)
  17581. 1421.83 s [unordered-containers] +++ OK, passed 100 tests.
  17582. 1421.83 s [unordered-containers] isSubmapOf
  17583. 1421.83 s [unordered-containers] model: OK (0.04s)
  17584. 1421.83 s [unordered-containers] +++ OK, passed 100 tests.
  17585. 1421.83 s [unordered-containers] m ⊆ m: OK (0.03s)
  17586. 1421.83 s [unordered-containers] +++ OK, passed 100 tests.
  17587. 1421.83 s [unordered-containers] m1 ⊆ m1 ∪ m2: OK (0.04s)
  17588. 1421.83 s [unordered-containers] +++ OK, passed 100 tests.
  17589. 1421.83 s [unordered-containers] m1\m2 ⊆ m1: OK (0.04s)
  17590. 1421.83 s [unordered-containers] +++ OK, passed 100 tests.
  17591. 1421.83 s [unordered-containers] m1 ∩ m2 ≠ ∅ ⇒ m1 ⊈ m1\m2 : OK (0.05s)
  17592. 1421.83 s [unordered-containers] +++ OK, passed 100 tests; 216 discarded.
  17593. 1421.83 s [unordered-containers] delete k m ⊆ m: OK (0.02s)
  17594. 1421.83 s [unordered-containers] +++ OK, passed 100 tests; 12 discarded.
  17595. 1421.83 s [unordered-containers] m ⊈ delete k m : OK (0.03s)
  17596. 1421.83 s [unordered-containers] +++ OK, passed 100 tests; 15 discarded.
  17597. 1421.83 s [unordered-containers] k ∉ m ⇒ m ⊆ insert k v m: OK (0.02s)
  17598. 1421.83 s [unordered-containers] +++ OK, passed 100 tests; 8 discarded.
  17599. 1421.83 s [unordered-containers] k ∉ m ⇒ insert k v m ⊈ m: OK (0.02s)
  17600. 1421.83 s [unordered-containers] +++ OK, passed 100 tests; 12 discarded.
  17601. 1421.83 s [unordered-containers] union
  17602. 1421.83 s [unordered-containers] model: OK (0.02s)
  17603. 1421.83 s [unordered-containers] +++ OK, passed 100 tests.
  17604. 1421.83 s [unordered-containers] valid: OK (0.02s)
  17605. 1421.83 s [unordered-containers] +++ OK, passed 100 tests.
  17606. 1421.83 s [unordered-containers] unionWith
  17607. 1421.83 s [unordered-containers] model: OK (0.03s)
  17608. 1421.83 s [unordered-containers] +++ OK, passed 100 tests.
  17609. 1421.83 s [unordered-containers] valid: OK (0.02s)
  17610. 1421.83 s [unordered-containers] +++ OK, passed 100 tests.
  17611. 1421.83 s [unordered-containers] unionWithKey
  17612. 1421.83 s [unordered-containers] model: OK (0.04s)
  17613. 1421.83 s [unordered-containers] +++ OK, passed 100 tests.
  17614. 1421.83 s [unordered-containers] valid: OK (0.02s)
  17615. 1421.83 s [unordered-containers] +++ OK, passed 100 tests.
  17616. 1421.83 s [unordered-containers] unions
  17617. 1422.84 s [unordered-containers] model: OK (1.05s)
  17618. 1422.84 s [unordered-containers] +++ OK, passed 100 tests.
  17619. 1422.84 s [unordered-containers] valid: OK (0.70s)
  17620. 1422.85 s [unordered-containers] +++ OK, passed 100 tests.
  17621. 1422.85 s [unordered-containers] difference
  17622. 1422.85 s [unordered-containers] model: OK (0.02s)
  17623. 1422.85 s [unordered-containers] +++ OK, passed 100 tests.
  17624. 1422.85 s [unordered-containers] valid: OK (0.02s)
  17625. 1422.85 s [unordered-containers] +++ OK, passed 100 tests.
  17626. 1422.85 s [unordered-containers] differenceWith
  17627. 1422.85 s [unordered-containers] model: OK (0.03s)
  17628. 1422.85 s [unordered-containers] +++ OK, passed 100 tests.
  17629. 1422.85 s [unordered-containers] valid: OK (0.04s)
  17630. 1422.85 s [unordered-containers] +++ OK, passed 100 tests.
  17631. 1422.85 s [unordered-containers] intersection
  17632. 1422.85 s [unordered-containers] model: OK (0.03s)
  17633. 1422.85 s [unordered-containers] +++ OK, passed 100 tests.
  17634. 1422.85 s [unordered-containers] valid: OK (0.02s)
  17635. 1422.85 s [unordered-containers] +++ OK, passed 100 tests.
  17636. 1422.85 s [unordered-containers] intersectionWith
  17637. 1422.85 s [unordered-containers] model: OK (0.06s)
  17638. 1422.85 s [unordered-containers] +++ OK, passed 100 tests.
  17639. 1422.85 s [unordered-containers] valid: OK (0.02s)
  17640. 1422.85 s [unordered-containers] +++ OK, passed 100 tests.
  17641. 1422.85 s [unordered-containers] intersectionWithKey
  17642. 1422.85 s [unordered-containers] model: OK (0.12s)
  17643. 1422.85 s [unordered-containers] +++ OK, passed 100 tests.
  17644. 1422.85 s [unordered-containers] valid: OK (0.02s)
  17645. 1422.85 s [unordered-containers] +++ OK, passed 100 tests.
  17646. 1422.85 s [unordered-containers] compose
  17647. 1422.85 s [unordered-containers] valid: OK (0.06s)
  17648. 1422.85 s [unordered-containers] +++ OK, passed 100 tests.
  17649. 1422.85 s [unordered-containers] map
  17650. 1422.85 s [unordered-containers] model: OK (0.05s)
  17651. 1422.85 s [unordered-containers] +++ OK, passed 100 tests.
  17652. 1422.85 s [unordered-containers] valid: OK (0.02s)
  17653. 1422.85 s [unordered-containers] +++ OK, passed 100 tests.
  17654. 1422.85 s [unordered-containers] traverseWithKey
  17655. 1422.85 s [unordered-containers] model: OK (0.42s)
  17656. 1422.85 s [unordered-containers] +++ OK, passed 100 tests.
  17657. 1422.85 s [unordered-containers] valid: OK (0.03s)
  17658. 1422.85 s [unordered-containers] +++ OK, passed 100 tests.
  17659. 1422.85 s [unordered-containers] mapKeys
  17660. 1422.85 s [unordered-containers] model: OK (0.02s)
  17661. 1422.85 s [unordered-containers] +++ OK, passed 100 tests.
  17662. 1422.85 s [unordered-containers] valid: OK (0.57s)
  17663. 1422.85 s [unordered-containers] +++ OK, passed 100 tests.
  17664. 1422.85 s [unordered-containers] foldr: OK (0.02s)
  17665. 1422.85 s [unordered-containers] +++ OK, passed 100 tests.
  17666. 1422.85 s [unordered-containers] foldl: OK (0.01s)
  17667. 1422.85 s [unordered-containers] +++ OK, passed 100 tests.
  17668. 1422.85 s [unordered-containers] foldrWithKey: OK
  17669. 1422.85 s [unordered-containers] +++ OK, passed 100 tests.
  17670. 1422.85 s [unordered-containers] foldlWithKey: OK
  17671. 1422.85 s [unordered-containers] +++ OK, passed 100 tests.
  17672. 1422.85 s [unordered-containers] foldrWithKey': OK
  17673. 1422.85 s [unordered-containers] +++ OK, passed 100 tests.
  17674. 1422.85 s [unordered-containers] foldlWithKey': OK
  17675. 1422.85 s [unordered-containers] +++ OK, passed 100 tests.
  17676. 1422.85 s [unordered-containers] foldl': OK
  17677. 1422.85 s [unordered-containers] +++ OK, passed 100 tests.
  17678. 1422.85 s [unordered-containers] foldr': OK (0.02s)
  17679. 1422.85 s [unordered-containers] +++ OK, passed 100 tests.
  17680. 1422.85 s [unordered-containers] foldMapWithKey: OK (0.01s)
  17681. 1422.85 s [unordered-containers] +++ OK, passed 100 tests.
  17682. 1422.85 s [unordered-containers] filter
  17683. 1422.85 s [unordered-containers] model: OK (0.08s)
  17684. 1422.85 s [unordered-containers] +++ OK, passed 100 tests.
  17685. 1422.85 s [unordered-containers] valid: OK (0.03s)
  17686. 1422.85 s [unordered-containers] +++ OK, passed 100 tests.
  17687. 1422.85 s [unordered-containers] filterWithKey
  17688. 1422.95 s [unordered-containers] model: OK (1.10s)
  17689. 1422.95 s [unordered-containers] +++ OK, passed 100 tests.
  17690. 1422.95 s [unordered-containers] valid: OK (0.67s)
  17691. 1422.95 s [unordered-containers] +++ OK, passed 100 tests.
  17692. 1422.95 s [unordered-containers] mapMaybe
  17693. 1422.95 s [unordered-containers] model: OK (0.14s)
  17694. 1422.95 s [unordered-containers] +++ OK, passed 100 tests.
  17695. 1422.95 s [unordered-containers] valid: OK (0.02s)
  17696. 1422.95 s [unordered-containers] +++ OK, passed 100 tests.
  17697. 1422.95 s [unordered-containers] mapMaybeWithKey
  17698. 1422.96 s [unordered-containers] model: OK (1.10s)
  17699. 1422.96 s [unordered-containers] +++ OK, passed 100 tests.
  17700. 1422.96 s [unordered-containers] valid: OK (0.63s)
  17701. 1422.96 s [unordered-containers] +++ OK, passed 100 tests.
  17702. 1422.96 s [unordered-containers] elems: OK
  17703. 1422.96 s [unordered-containers] +++ OK, passed 100 tests.
  17704. 1422.96 s [unordered-containers] keys: OK (0.02s)
  17705. 1422.96 s [unordered-containers] +++ OK, passed 100 tests.
  17706. 1422.96 s [unordered-containers] fromList
  17707. 1422.96 s [unordered-containers] model: OK (0.02s)
  17708. 1422.96 s [unordered-containers] +++ OK, passed 100 tests.
  17709. 1422.96 s [unordered-containers] valid: OK
  17710. 1422.96 s [unordered-containers] +++ OK, passed 100 tests.
  17711. 1422.96 s [unordered-containers] fromListWith
  17712. 1422.96 s [unordered-containers] model: OK (0.02s)
  17713. 1422.96 s [unordered-containers] +++ OK, passed 100 tests.
  17714. 1422.96 s [unordered-containers] valid: OK
  17715. 1422.96 s [unordered-containers] +++ OK, passed 100 tests.
  17716. 1422.96 s [unordered-containers] fromListWithKey
  17717. 1422.96 s [unordered-containers] model: OK
  17718. 1422.96 s [unordered-containers] +++ OK, passed 100 tests.
  17719. 1422.96 s [unordered-containers] valid: OK (0.03s)
  17720. 1422.96 s [unordered-containers] +++ OK, passed 100 tests.
  17721. 1422.96 s [unordered-containers] toList: OK
  17722. 1422.96 s [unordered-containers] +++ OK, passed 100 tests.
  17723. 1422.96 s [unordered-containers] Data.HashMap.Strict
  17724. 1422.96 s [unordered-containers] instances
  17725. 1422.96 s [unordered-containers] Eq
  17726. 1422.96 s [unordered-containers] ==: OK (0.01s)
  17727. 1422.96 s [unordered-containers] +++ OK, passed 100 tests.
  17728. 1422.96 s [unordered-containers] /=: OK (0.04s)
  17729. 1422.96 s [unordered-containers] +++ OK, passed 100 tests.
  17730. 1422.96 s [unordered-containers] Ord
  17731. 1422.96 s [unordered-containers] compare reflexive: OK (0.03s)
  17732. 1422.96 s [unordered-containers] +++ OK, passed 100 tests.
  17733. 1422.96 s [unordered-containers] compare transitive: OK (0.02s)
  17734. 1422.96 s [unordered-containers] +++ OK, passed 100 tests.
  17735. 1422.96 s [unordered-containers] compare antisymmetric: OK (0.02s)
  17736. 1422.96 s [unordered-containers] +++ OK, passed 100 tests.
  17737. 1422.96 s [unordered-containers] Ord => Eq: OK (0.03s)
  17738. 1422.96 s [unordered-containers] +++ OK, passed 100 tests.
  17739. 1422.96 s [unordered-containers] Read/Show: OK (0.46s)
  17740. 1422.96 s [unordered-containers] +++ OK, passed 100 tests.
  17741. 1422.96 s [unordered-containers] Functor: OK (0.10s)
  17742. 1422.96 s [unordered-containers] +++ OK, passed 100 tests.
  17743. 1422.96 s [unordered-containers] Foldable: OK (0.05s)
  17744. 1422.96 s [unordered-containers] +++ OK, passed 100 tests.
  17745. 1422.96 s [unordered-containers] Bifoldable
  17746. 1422.96 s [unordered-containers] bifoldMap: OK (0.03s)
  17747. 1422.96 s [unordered-containers] +++ OK, passed 100 tests.
  17748. 1422.96 s [unordered-containers] bifoldr: OK (0.02s)
  17749. 1422.96 s [unordered-containers] +++ OK, passed 100 tests.
  17750. 1422.96 s [unordered-containers] bifoldl: OK (0.02s)
  17751. 1422.96 s [unordered-containers] +++ OK, passed 100 tests.
  17752. 1422.96 s [unordered-containers] Hashable: OK (0.05s)
  17753. 1422.96 s [unordered-containers] +++ OK, passed 100 tests.
  17754. 1422.96 s [unordered-containers] empty
  17755. 1422.96 s [unordered-containers] valid: OK
  17756. 1422.96 s [unordered-containers] +++ OK, passed 1 test.
  17757. 1422.96 s [unordered-containers] singleton
  17758. 1422.96 s [unordered-containers] valid: OK
  17759. 1422.96 s [unordered-containers] +++ OK, passed 100 tests.
  17760. 1422.96 s [unordered-containers] size: OK (0.03s)
  17761. 1422.96 s [unordered-containers] +++ OK, passed 100 tests.
  17762. 1422.96 s [unordered-containers] member: OK (0.01s)
  17763. 1422.96 s [unordered-containers] +++ OK, passed 100 tests.
  17764. 1422.96 s [unordered-containers] lookup: OK (0.02s)
  17765. 1422.96 s [unordered-containers] +++ OK, passed 100 tests.
  17766. 1422.96 s [unordered-containers] !?: OK (0.02s)
  17767. 1422.96 s [unordered-containers] +++ OK, passed 100 tests.
  17768. 1422.96 s [unordered-containers] insert
  17769. 1422.96 s [unordered-containers] model: OK (0.03s)
  17770. 1422.96 s [unordered-containers] +++ OK, passed 100 tests.
  17771. 1422.96 s [unordered-containers] valid: OK
  17772. 1422.96 s [unordered-containers] +++ OK, passed 100 tests.
  17773. 1422.96 s [unordered-containers] insertWith
  17774. 1422.96 s [unordered-containers] insertWith: OK (0.03s)
  17775. 1422.96 s [unordered-containers] +++ OK, passed 100 tests.
  17776. 1422.96 s [unordered-containers] valid: OK
  17777. 1422.96 s [unordered-containers] +++ OK, passed 100 tests.
  17778. 1422.96 s [unordered-containers] delete
  17779. 1422.96 s [unordered-containers] model: OK (0.03s)
  17780. 1422.96 s [unordered-containers] +++ OK, passed 100 tests.
  17781. 1422.96 s [unordered-containers] valid: OK
  17782. 1422.96 s [unordered-containers] +++ OK, passed 100 tests.
  17783. 1422.96 s [unordered-containers] adjust
  17784. 1422.96 s [unordered-containers] model: OK (0.02s)
  17785. 1422.96 s [unordered-containers] +++ OK, passed 100 tests.
  17786. 1422.96 s [unordered-containers] valid: OK (0.02s)
  17787. 1422.96 s [unordered-containers] +++ OK, passed 100 tests.
  17788. 1422.96 s [unordered-containers] update
  17789. 1422.96 s [unordered-containers] model: OK (0.02s)
  17790. 1422.96 s [unordered-containers] +++ OK, passed 100 tests.
  17791. 1422.96 s [unordered-containers] valid: OK
  17792. 1422.96 s [unordered-containers] +++ OK, passed 100 tests.
  17793. 1422.96 s [unordered-containers] alter
  17794. 1422.96 s [unordered-containers] model: OK (0.01s)
  17795. 1422.96 s [unordered-containers] +++ OK, passed 100 tests.
  17796. 1422.96 s [unordered-containers] valid: OK
  17797. 1422.96 s [unordered-containers] +++ OK, passed 100 tests.
  17798. 1422.96 s [unordered-containers] alterF
  17799. 1422.96 s [unordered-containers] model
  17800. 1422.96 s [unordered-containers] []: OK (0.23s)
  17801. 1422.96 s [unordered-containers] +++ OK, passed 100 tests.
  17802. 1422.96 s [unordered-containers] adjust: OK (0.04s)
  17803. 1422.96 s [unordered-containers] +++ OK, passed 100 tests.
  17804. 1422.96 s [unordered-containers] insert: OK (0.02s)
  17805. 1422.96 s [unordered-containers] +++ OK, passed 100 tests.
  17806. 1422.96 s [unordered-containers] insertWith: OK (0.05s)
  17807. 1422.96 s [unordered-containers] +++ OK, passed 100 tests.
  17808. 1422.96 s [unordered-containers] delete: OK (0.06s)
  17809. 1422.96 s [unordered-containers] +++ OK, passed 100 tests.
  17810. 1422.96 s [unordered-containers] lookup: OK (0.05s)
  17811. 1422.96 s [unordered-containers] +++ OK, passed 100 tests.
  17812. 1422.96 s [unordered-containers] valid: OK (0.04s)
  17813. 1422.96 s [unordered-containers] +++ OK, passed 100 tests.
  17814. 1422.96 s [unordered-containers] isSubmapOf
  17815. 1422.96 s [unordered-containers] model: OK (0.07s)
  17816. 1422.96 s [unordered-containers] +++ OK, passed 100 tests.
  17817. 1422.96 s [unordered-containers] m ⊆ m: OK
  17818. 1422.96 s [unordered-containers] +++ OK, passed 100 tests.
  17819. 1422.96 s [unordered-containers] m1 ⊆ m1 ∪ m2: OK (0.03s)
  17820. 1422.96 s [unordered-containers] +++ OK, passed 100 tests.
  17821. 1422.96 s [unordered-containers] m1\m2 ⊆ m1: OK (0.01s)
  17822. 1422.96 s [unordered-containers] +++ OK, passed 100 tests.
  17823. 1422.96 s [unordered-containers] m1 ∩ m2 ≠ ∅ ⇒ m1 ⊈ m1\m2 : OK (0.05s)
  17824. 1422.96 s [unordered-containers] +++ OK, passed 100 tests; 151 discarded.
  17825. 1422.96 s [unordered-containers] delete k m ⊆ m: OK (0.02s)
  17826. 1422.96 s [unordered-containers] +++ OK, passed 100 tests; 15 discarded.
  17827. 1422.96 s [unordered-containers] m ⊈ delete k m : OK (0.02s)
  17828. 1422.96 s [unordered-containers] +++ OK, passed 100 tests; 12 discarded.
  17829. 1422.96 s [unordered-containers] k ∉ m ⇒ m ⊆ insert k v m: OK (0.03s)
  17830. 1422.96 s [unordered-containers] +++ OK, passed 100 tests; 12 discarded.
  17831. 1422.96 s [unordered-containers] k ∉ m ⇒ insert k v m ⊈ m: OK (0.03s)
  17832. 1422.96 s [unordered-containers] +++ OK, passed 100 tests; 7 discarded.
  17833. 1422.96 s [unordered-containers] union
  17834. 1422.96 s [unordered-containers] model: OK (0.06s)
  17835. 1422.96 s [unordered-containers] +++ OK, passed 100 tests.
  17836. 1422.96 s [unordered-containers] valid: OK (0.03s)
  17837. 1422.96 s [unordered-containers] +++ OK, passed 100 tests.
  17838. 1422.96 s [unordered-containers] unionWith
  17839. 1422.97 s [unordered-containers] model: OK (0.14s)
  17840. 1422.97 s [unordered-containers] +++ OK, passed 100 tests.
  17841. 1422.97 s [unordered-containers] valid: OK (0.13s)
  17842. 1422.97 s [unordered-containers] +++ OK, passed 100 tests.
  17843. 1422.97 s [unordered-containers] unionWithKey
  17844. 1422.97 s [unordered-containers] model: OK (0.21s)
  17845. 1422.97 s [unordered-containers] +++ OK, passed 100 tests.
  17846. 1422.97 s [unordered-containers] valid: OK (0.18s)
  17847. 1422.97 s [unordered-containers] +++ OK, passed 100 tests.
  17848. 1422.97 s [unordered-containers] unions
  17849. 1422.97 s [unordered-containers] model: OK (0.76s)
  17850. 1422.97 s [unordered-containers] +++ OK, passed 100 tests.
  17851. 1422.97 s [unordered-containers] valid: OK (0.57s)
  17852. 1422.97 s [unordered-containers] +++ OK, passed 100 tests.
  17853. 1422.97 s [unordered-containers] difference
  17854. 1422.97 s [unordered-containers] model: OK (0.04s)
  17855. 1422.97 s [unordered-containers] +++ OK, passed 100 tests.
  17856. 1422.97 s [unordered-containers] valid: OK (0.03s)
  17857. 1422.97 s [unordered-containers] +++ OK, passed 100 tests.
  17858. 1422.97 s [unordered-containers] differenceWith
  17859. 1422.97 s [unordered-containers] model: OK (0.09s)
  17860. 1422.97 s [unordered-containers] +++ OK, passed 100 tests.
  17861. 1422.97 s [unordered-containers] valid: OK (0.09s)
  17862. 1422.97 s [unordered-containers] +++ OK, passed 100 tests.
  17863. 1422.97 s [unordered-containers] intersection
  17864. 1422.97 s [unordered-containers] model: OK (0.06s)
  17865. 1422.97 s [unordered-containers] +++ OK, passed 100 tests.
  17866. 1422.97 s [unordered-containers] valid: OK (0.03s)
  17867. 1422.97 s [unordered-containers] +++ OK, passed 100 tests.
  17868. 1422.97 s [unordered-containers] intersectionWith
  17869. 1422.97 s [unordered-containers] model: OK (0.06s)
  17870. 1422.97 s [unordered-containers] +++ OK, passed 100 tests.
  17871. 1422.97 s [unordered-containers] valid: OK (0.04s)
  17872. 1422.97 s [unordered-containers] +++ OK, passed 100 tests.
  17873. 1422.97 s [unordered-containers] intersectionWithKey
  17874. 1422.97 s [unordered-containers] model: OK (0.15s)
  17875. 1422.97 s [unordered-containers] +++ OK, passed 100 tests.
  17876. 1422.97 s [unordered-containers] valid: OK (0.09s)
  17877. 1422.97 s [unordered-containers] +++ OK, passed 100 tests.
  17878. 1422.97 s [unordered-containers] compose
  17879. 1422.97 s [unordered-containers] valid: OK (0.03s)
  17880. 1422.97 s [unordered-containers] +++ OK, passed 100 tests.
  17881. 1422.97 s [unordered-containers] map
  17882. 1422.97 s [unordered-containers] model: OK (0.07s)
  17883. 1422.97 s [unordered-containers] +++ OK, passed 100 tests.
  17884. 1422.97 s [unordered-containers] valid: OK (0.07s)
  17885. 1422.97 s [unordered-containers] +++ OK, passed 100 tests.
  17886. 1422.97 s [unordered-containers] traverseWithKey
  17887. 1422.97 s [unordered-containers] model: OK (0.09s)
  17888. 1422.97 s [unordered-containers] +++ OK, passed 100 tests.
  17889. 1422.97 s [unordered-containers] valid: OK (0.02s)
  17890. 1422.97 s [unordered-containers] +++ OK, passed 100 tests.
  17891. 1422.97 s [unordered-containers] mapKeys
  17892. 1422.97 s [unordered-containers] model: OK (0.01s)
  17893. 1422.97 s [unordered-containers] +++ OK, passed 100 tests.
  17894. 1422.97 s [unordered-containers] valid: OK (0.39s)
  17895. 1422.97 s [unordered-containers] +++ OK, passed 100 tests.
  17896. 1422.97 s [unordered-containers] foldr: OK (0.02s)
  17897. 1422.97 s [unordered-containers] +++ OK, passed 100 tests.
  17898. 1422.97 s [unordered-containers] foldl: OK (0.01s)
  17899. 1422.97 s [unordered-containers] +++ OK, passed 100 tests.
  17900. 1422.97 s [unordered-containers] foldrWithKey: OK (0.03s)
  17901. 1422.97 s [unordered-containers] +++ OK, passed 100 tests.
  17902. 1422.97 s [unordered-containers] foldlWithKey: OK (0.03s)
  17903. 1422.97 s [unordered-containers] +++ OK, passed 100 tests.
  17904. 1422.97 s [unordered-containers] foldrWithKey': OK (0.03s)
  17905. 1422.97 s [unordered-containers] +++ OK, passed 100 tests.
  17906. 1422.97 s [unordered-containers] foldlWithKey': OK (0.02s)
  17907. 1422.97 s [unordered-containers] +++ OK, passed 100 tests.
  17908. 1422.97 s [unordered-containers] foldl': OK (0.03s)
  17909. 1422.97 s [unordered-containers] +++ OK, passed 100 tests.
  17910. 1422.97 s [unordered-containers] foldr': OK (0.03s)
  17911. 1422.97 s [unordered-containers] +++ OK, passed 100 tests.
  17912. 1422.97 s [unordered-containers] foldMapWithKey: OK
  17913. 1422.97 s [unordered-containers] +++ OK, passed 100 tests.
  17914. 1422.97 s [unordered-containers] filter
  17915. 1422.97 s [unordered-containers] model: OK (0.07s)
  17916. 1422.97 s [unordered-containers] +++ OK, passed 100 tests.
  17917. 1422.97 s [unordered-containers] valid: OK (0.05s)
  17918. 1422.97 s [unordered-containers] +++ OK, passed 100 tests.
  17919. 1422.97 s [unordered-containers] filterWithKey
  17920. 1423.13 s [unordered-containers] model: OK (0.65s)
  17921. 1423.13 s [unordered-containers] +++ OK, passed 100 tests.
  17922. 1423.13 s [unordered-containers] valid: OK (0.43s)
  17923. 1423.13 s [unordered-containers] +++ OK, passed 100 tests.
  17924. 1423.13 s [unordered-containers] mapMaybe
  17925. 1423.13 s [unordered-containers] model: OK (0.11s)
  17926. 1423.13 s [unordered-containers] +++ OK, passed 100 tests.
  17927. 1423.13 s [unordered-containers] valid: OK (0.02s)
  17928. 1423.13 s [unordered-containers] +++ OK, passed 100 tests.
  17929. 1423.13 s [unordered-containers] mapMaybeWithKey
  17930. 1423.17 s [unordered-containers] model: OK (0.67s)
  17931. 1423.17 s [unordered-containers] +++ OK, passed 100 tests.
  17932. 1423.17 s [unordered-containers] valid: OK (0.45s)
  17933. 1423.17 s [unordered-containers] +++ OK, passed 100 tests.
  17934. 1423.17 s [unordered-containers] elems: OK
  17935. 1423.17 s [unordered-containers] +++ OK, passed 100 tests.
  17936. 1423.17 s [unordered-containers] keys: OK
  17937. 1423.17 s [unordered-containers] +++ OK, passed 100 tests.
  17938. 1423.17 s [unordered-containers] fromList
  17939. 1423.17 s [unordered-containers] model: OK (0.02s)
  17940. 1423.17 s [unordered-containers] +++ OK, passed 100 tests.
  17941. 1423.17 s [unordered-containers] valid: OK
  17942. 1423.17 s [unordered-containers] +++ OK, passed 100 tests.
  17943. 1423.17 s [unordered-containers] fromListWith
  17944. 1423.17 s [unordered-containers] model: OK (0.02s)
  17945. 1423.17 s [unordered-containers] +++ OK, passed 100 tests.
  17946. 1423.17 s [unordered-containers] valid: OK
  17947. 1423.17 s [unordered-containers] +++ OK, passed 100 tests.
  17948. 1423.17 s [unordered-containers] fromListWithKey
  17949. 1423.17 s [unordered-containers] model: OK (0.04s)
  17950. 1423.17 s [unordered-containers] +++ OK, passed 100 tests.
  17951. 1423.17 s [unordered-containers] valid: OK (0.05s)
  17952. 1423.17 s [unordered-containers] +++ OK, passed 100 tests.
  17953. 1423.17 s [unordered-containers] toList: OK (0.02s)
  17954. 1423.17 s [unordered-containers] +++ OK, passed 100 tests.
  17955. 1423.17 s [unordered-containers] Data.HashSet
  17956. 1423.17 s [unordered-containers] instances
  17957. 1423.17 s [unordered-containers] Eq
  17958. 1423.17 s [unordered-containers] ==: OK (0.02s)
  17959. 1423.17 s [unordered-containers] +++ OK, passed 100 tests.
  17960. 1423.17 s [unordered-containers] == permutations: OK (0.01s)
  17961. 1423.17 s [unordered-containers] +++ OK, passed 100 tests.
  17962. 1423.17 s [unordered-containers] /=: OK (0.03s)
  17963. 1423.17 s [unordered-containers] +++ OK, passed 100 tests.
  17964. 1423.17 s [unordered-containers] Ord
  17965. 1423.17 s [unordered-containers] compare reflexive: OK (0.01s)
  17966. 1423.17 s [unordered-containers] +++ OK, passed 100 tests.
  17967. 1423.17 s [unordered-containers] compare transitive: OK (0.03s)
  17968. 1423.17 s [unordered-containers] +++ OK, passed 100 tests.
  17969. 1423.17 s [unordered-containers] compare antisymmetric: OK (0.01s)
  17970. 1423.17 s [unordered-containers] +++ OK, passed 100 tests.
  17971. 1423.17 s [unordered-containers] Ord => Eq: OK (0.01s)
  17972. 1423.17 s [unordered-containers] +++ OK, passed 100 tests.
  17973. 1423.17 s [unordered-containers] Read/Show: OK (0.25s)
  17974. 1423.17 s [unordered-containers] +++ OK, passed 100 tests.
  17975. 1423.17 s [unordered-containers] Foldable: OK (0.02s)
  17976. 1423.17 s [unordered-containers] +++ OK, passed 100 tests.
  17977. 1423.17 s [unordered-containers] Hashable: OK (0.02s)
  17978. 1423.17 s [unordered-containers] +++ OK, passed 100 tests.
  17979. 1423.17 s [unordered-containers] size: OK (0.02s)
  17980. 1423.17 s [unordered-containers] +++ OK, passed 100 tests.
  17981. 1423.17 s [unordered-containers] member: OK (0.01s)
  17982. 1423.17 s [unordered-containers] +++ OK, passed 100 tests.
  17983. 1423.17 s [unordered-containers] insert: OK (0.02s)
  17984. 1423.17 s [unordered-containers] +++ OK, passed 100 tests.
  17985. 1423.17 s [unordered-containers] delete: OK (0.01s)
  17986. 1423.17 s [unordered-containers] +++ OK, passed 100 tests.
  17987. 1423.17 s [unordered-containers] union: OK (0.03s)
  17988. 1423.17 s [unordered-containers] +++ OK, passed 100 tests.
  17989. 1423.17 s [unordered-containers] map: OK (0.47s)
  17990. 1423.17 s [unordered-containers] +++ OK, passed 100 tests.
  17991. 1423.17 s [unordered-containers] foldr: OK (0.01s)
  17992. 1423.17 s [unordered-containers] +++ OK, passed 100 tests.
  17993. 1423.17 s [unordered-containers] foldl': OK (0.02s)
  17994. 1423.17 s [unordered-containers] +++ OK, passed 100 tests.
  17995. 1423.17 s [unordered-containers] filter: OK (0.50s)
  17996. 1423.17 s [unordered-containers] +++ OK, passed 100 tests.
  17997. 1423.17 s [unordered-containers] toList: OK (0.03s)
  17998. 1423.17 s [unordered-containers] +++ OK, passed 100 tests.
  17999. 1423.17 s [unordered-containers] Data.HashMap.Internal.List
  18000. 1423.17 s [unordered-containers] isPermutationBy: OK (0.01s)
  18001. 1423.17 s [unordered-containers] +++ OK, passed 100 tests.
  18002. 1423.17 s [unordered-containers] isPermutationBy of different length: OK
  18003. 1423.17 s [unordered-containers] +++ OK, passed 100 tests; 14 discarded.
  18004. 1423.17 s [unordered-containers] pUnorderedCompare: OK (0.04s)
  18005. 1423.17 s [unordered-containers] +++ OK, passed 100 tests.
  18006. 1423.17 s [unordered-containers] modelUnorderedCompare
  18007. 1423.17 s [unordered-containers] reflexive: OK
  18008. 1423.17 s [unordered-containers] +++ OK, passed 100 tests.
  18009. 1423.17 s [unordered-containers] anti-symmetric: OK (0.01s)
  18010. 1423.17 s [unordered-containers] +++ OK, passed 100 tests.
  18011. 1423.17 s [unordered-containers] transitive: OK (0.02s)
  18012. 1423.17 s [unordered-containers] +++ OK, passed 100 tests.
  18013. 1423.17 s [unordered-containers] Regression tests
  18014. 1423.17 s [unordered-containers] issue32: OK
  18015. 1423.17 s [unordered-containers] issue39a: OK
  18016. 1423.17 s [unordered-containers] issue39b: OK (0.03s)
  18017. 1423.17 s [unordered-containers] +++ OK, passed 100 tests.
  18018. 1423.17 s [unordered-containers] issue254 lazy: OK
  18019. 1423.17 s [unordered-containers] issue254 strict: OK
  18020. 1423.18 s [unordered-containers] issue379
  18021. 1423.18 s [unordered-containers] Lazy.unionWith: OK
  18022. 1423.18 s [unordered-containers] union: OK
  18023. 1423.18 s [unordered-containers] Strict.unionWith: OK
  18024. 1423.18 s [unordered-containers] Strict.unionWithKey: OK
  18025. 1423.18 s [unordered-containers] issue381
  18026. 1423.18 s [unordered-containers] mapMaybe: OK
  18027. 1423.18 s [unordered-containers] mapMaybeWithKey: OK
  18028. 1423.18 s [unordered-containers] issue382: OK
  18029. 1423.18 s [unordered-containers] issue383: OK
  18030. 1423.18 s [unordered-containers] issue420: OK
  18031. 1423.18 s [unordered-containers] issue491
  18032. 1423.18 s [unordered-containers] 1: OK
  18033. 1423.18 s [unordered-containers] 2: OK
  18034. 1423.18 s [unordered-containers] 3: OK
  18035. 1423.18 s [unordered-containers] Strictness
  18036. 1423.18 s [unordered-containers] HashMap.Strict
  18037. 1423.18 s [unordered-containers] singleton is key-strict: OK
  18038. 1423.18 s [unordered-containers] +++ OK, passed 100 tests.
  18039. 1423.18 s [unordered-containers] singleton is value-strict: OK
  18040. 1423.18 s [unordered-containers] +++ OK, passed 100 tests.
  18041. 1423.18 s [unordered-containers] member is key-strict: OK
  18042. 1423.18 s [unordered-containers] +++ OK, passed 100 tests.
  18043. 1423.18 s [unordered-containers] lookup is key-strict: OK
  18044. 1423.18 s [unordered-containers] +++ OK, passed 100 tests.
  18045. 1423.18 s [unordered-containers] lookupDefault is key-strict: OK
  18046. 1423.18 s [unordered-containers] +++ OK, passed 100 tests.
  18047. 1423.18 s [unordered-containers] findWithDefault is key-strict: OK
  18048. 1423.18 s [unordered-containers] +++ OK, passed 100 tests.
  18049. 1423.18 s [unordered-containers] ! is key-strict: OK
  18050. 1423.18 s [unordered-containers] +++ OK, passed 100 tests.
  18051. 1423.18 s [unordered-containers] delete is key-strict: OK
  18052. 1423.18 s [unordered-containers] +++ OK, passed 100 tests.
  18053. 1423.18 s [unordered-containers] adjust is key-strict: OK
  18054. 1423.18 s [unordered-containers] +++ OK, passed 100 tests.
  18055. 1423.18 s [unordered-containers] adjust is value-strict: OK
  18056. 1423.18 s [unordered-containers] +++ OK, passed 100 tests.
  18057. 1423.18 s [unordered-containers] insert is key-strict: OK
  18058. 1423.18 s [unordered-containers] +++ OK, passed 100 tests.
  18059. 1423.18 s [unordered-containers] insert is value-strict: OK
  18060. 1423.18 s [unordered-containers] +++ OK, passed 100 tests.
  18061. 1423.18 s [unordered-containers] insertWith is key-strict: OK
  18062. 1423.18 s [unordered-containers] +++ OK, passed 100 tests.
  18063. 1423.18 s [unordered-containers] insertWith is value-strict: OK (0.03s)
  18064. 1423.18 s [unordered-containers] +++ OK, passed 100 tests.
  18065. 1423.18 s [unordered-containers] fromList is key-strict: OK
  18066. 1423.18 s [unordered-containers] +++ OK, passed 100 tests.
  18067. 1423.18 s [unordered-containers] fromList is value-strict: OK
  18068. 1423.18 s [unordered-containers] +++ OK, passed 100 tests.
  18069. 1423.18 s [unordered-containers] fromListWith is key-strict: OK
  18070. 1423.18 s [unordered-containers] +++ OK, passed 100 tests.
  18071. 1423.18 s [unordered-containers] fromListWith is value-strict: OK
  18072. 1423.18 s [unordered-containers] +++ OK, passed 100 tests.
  18073. 1423.18 s [unordered-containers]
  18074. 1423.18 s [unordered-containers] All 257 tests passed (1.49s)
  18075. 1423.19 s [unordered-containers] Test suite unordered-containers-tests: PASS
  18076. 1423.19 s [unordered-containers] Test suite logged to:
  18077. 1423.19 s [unordered-containers] dist/test/unordered-containers-0.2.20.1-unordered-containers-tests.log
  18078. 1423.19 s [unordered-containers] 1 of 1 test suites (1 of 1 test cases) passed.
  18079. 1423.28 s [unordered-containers] Phase: haddockPhase
  18080. 1423.47 s [unordered-containers] Preprocessing library for unordered-containers-0.2.20.1..
  18081. 1423.47 s [unordered-containers] Running Haddock on library for unordered-containers-0.2.20.1..
  18082. 1423.58 s [unordered-containers] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
  18083. 1424.75 s [unordered-containers] 33% ( 16 / 48) in 'Data.HashMap.Internal.Array'
  18084. 1424.83 s [unordered-containers] Missing documentation for:
  18085. 1424.83 s [unordered-containers] Array (Data/HashMap/Internal/Array.hs:125)
  18086. 1424.83 s [unordered-containers] MArray (Data/HashMap/Internal/Array.hs:157)
  18087. 1424.83 s [unordered-containers] new_ (Data/HashMap/Internal/Array.hs:207)
  18088. 1424.83 s [unordered-containers] singleton (Data/HashMap/Internal/Array.hs:224)
  18089. 1424.83 s [unordered-containers] singletonM (Data/HashMap/Internal/Array.hs:228)
  18090. 1424.83 s [unordered-containers] snoc (Data/HashMap/Internal/Array.hs:232)
  18091. 1424.83 s [unordered-containers] pair (Data/HashMap/Internal/Array.hs:241)
  18092. 1424.83 s [unordered-containers] length (Data/HashMap/Internal/Array.hs:153)
  18093. 1424.83 s [unordered-containers] lengthM (Data/HashMap/Internal/Array.hs:161)
  18094. 1424.83 s [unordered-containers] read (Data/HashMap/Internal/Array.hs:248)
  18095. 1424.83 s [unordered-containers] write (Data/HashMap/Internal/Array.hs:254)
  18096. 1424.83 s [unordered-containers] index (Data/HashMap/Internal/Array.hs:261)
  18097. 1424.83 s [unordered-containers] indexM (Data/HashMap/Internal/Array.hs:273)
  18098. 1424.83 s [unordered-containers] index# (Data/HashMap/Internal/Array.hs:267)
  18099. 1424.83 s [unordered-containers] sameArray1 (Data/HashMap/Internal/Array.hs:139)
  18100. 1424.83 s [unordered-containers] unsafeFreeze (Data/HashMap/Internal/Array.hs:279)
  18101. 1424.83 s [unordered-containers] unsafeThaw (Data/HashMap/Internal/Array.hs:285)
  18102. 1424.83 s [unordered-containers] unsafeSameArray (Data/HashMap/Internal/Array.hs:135)
  18103. 1424.83 s [unordered-containers] run (Data/HashMap/Internal/Array.hs:291)
  18104. 1424.83 s [unordered-containers] cloneM (Data/HashMap/Internal/Array.hs:313)
  18105. 1424.83 s [unordered-containers] foldl (Data/HashMap/Internal/Array.hs:403)
  18106. 1424.83 s [unordered-containers] foldl' (Data/HashMap/Internal/Array.hs:374)
  18107. 1424.83 s [unordered-containers] foldr (Data/HashMap/Internal/Array.hs:393)
  18108. 1424.83 s [unordered-containers] foldr' (Data/HashMap/Internal/Array.hs:384)
  18109. 1424.83 s [unordered-containers] foldMap (Data/HashMap/Internal/Array.hs:416)
  18110. 1424.83 s [unordered-containers] thaw (Data/HashMap/Internal/Array.hs:435)
  18111. 1424.83 s [unordered-containers] map (Data/HashMap/Internal/Array.hs:460)
  18112. 1424.83 s [unordered-containers] traverse (Data/HashMap/Internal/Array.hs:536)
  18113. 1424.83 s [unordered-containers] traverse' (Data/HashMap/Internal/Array.hs:552)
  18114. 1424.83 s [unordered-containers] toList (Data/HashMap/Internal/Array.hs:528)
  18115. 1424.83 s [unordered-containers] fromList (Data/HashMap/Internal/Array.hs:493)
  18116. 1424.83 s [unordered-containers] fromList' (Data/HashMap/Internal/Array.hs:505)
  18117. 1425.01 s [unordered-containers] 25% ( 1 / 4) in 'Data.HashMap.Internal.List'
  18118. 1425.01 s [unordered-containers] Missing documentation for:
  18119. 1425.01 s [unordered-containers] isPermutationBy (Data/HashMap/Internal/List.hs:39)
  18120. 1425.01 s [unordered-containers] deleteBy (Data/HashMap/Internal/List.hs:82)
  18121. 1425.01 s [unordered-containers] unorderedCompare (Data/HashMap/Internal/List.hs:67)
  18122. 1425.47 s [unordered-containers] Warning: 'Leaf' is ambiguous. It is defined
  18123. 1425.47 s [unordered-containers] * at Data/HashMap/Internal.hs:227:7
  18124. 1425.47 s [unordered-containers] * at Data/HashMap/Internal.hs:187:1
  18125. 1425.47 s [unordered-containers] You may be able to disambiguate the identifier by qualifying it or
  18126. 1425.47 s [unordered-containers] by specifying the type/value namespace explicitly.
  18127. 1425.47 s [unordered-containers] Defaulting to the one defined at Data/HashMap/Internal.hs:187:1
  18128. 1425.47 s [unordered-containers] Warning: 'at' is out of scope.
  18129. 1425.47 s [unordered-containers] If you qualify the identifier, haddock can try to link it anyway.
  18130. 1425.47 s [unordered-containers] 88% ( 93 /105) in 'Data.HashMap.Internal'
  18131. 1425.47 s [unordered-containers] Missing documentation for:
  18132. 1425.47 s [unordered-containers] Leaf (Data/HashMap/Internal.hs:187)
  18133. 1425.47 s [unordered-containers] intersectionWithKey# (Data/HashMap/Internal.hs:1858)
  18134. 1425.47 s [unordered-containers] updateOrConcatWithKey (Data/HashMap/Internal.hs:2372)
  18135. 1425.47 s [unordered-containers] equalKeys (Data/HashMap/Internal.hs:512)
  18136. 1425.47 s [unordered-containers] equalKeys1 (Data/HashMap/Internal.hs:496)
  18137. 1425.47 s [unordered-containers] lookupRecordCollision (Data/HashMap/Internal.hs:679)
  18138. 1425.47 s [unordered-containers] LookupRes (Data/HashMap/Internal.hs:659)
  18139. 1425.47 s [unordered-containers] lookupResToMaybe (Data/HashMap/Internal.hs:661)
  18140. 1425.47 s [unordered-containers] insert' (Data/HashMap/Internal.hs:807)
  18141. 1425.47 s [unordered-containers] delete' (Data/HashMap/Internal.hs:1125)
  18142. 1425.47 s [unordered-containers] insertNewKey (Data/HashMap/Internal.hs:849)
  18143. 1425.47 s [unordered-containers] insertKeyExists (Data/HashMap/Internal.hs:884)
  18144. 1426.36 s [unordered-containers] 50% ( 3 / 6) in 'Data.HashMap.Internal.Debug'
  18145. 1426.36 s [unordered-containers] Missing documentation for:
  18146. 1426.36 s [unordered-containers] valid (Data/HashMap/Internal/Debug.hs:97)
  18147. 1426.36 s [unordered-containers] Validity (Data/HashMap/Internal/Debug.hs:43)
  18148. 1426.36 s [unordered-containers] SubHashPath (Data/HashMap/Internal/Debug.hs:75)
  18149. 1426.66 s [unordered-containers] Warning: 'lookup' is out of scope.
  18150. 1426.66 s [unordered-containers] If you qualify the identifier, haddock can try to link it anyway.
  18151. 1426.66 s [unordered-containers] Warning: 'at' is out of scope.
  18152. 1426.66 s [unordered-containers] If you qualify the identifier, haddock can try to link it anyway.
  18153. 1426.66 s [unordered-containers] 100% ( 67 / 67) in 'Data.HashMap.Internal.Strict'
  18154. 1427.23 s [unordered-containers] 100% ( 35 / 35) in 'Data.HashSet.Internal'
  18155. 1427.44 s [unordered-containers] 100% ( 32 / 32) in 'Data.HashSet'
  18156. 1427.45 s [unordered-containers] 100% ( 69 / 69) in 'Data.HashMap.Strict'
  18157. 1427.47 s [unordered-containers] 100% ( 69 / 69) in 'Data.HashMap.Lazy'
  18158. 1433.26 s [unordered-containers] Documentation created: dist/doc/html/unordered-containers/index.html,
  18159. 1433.26 s [unordered-containers] dist/doc/html/unordered-containers/unordered-containers.txt
  18160. 1433.39 s [unordered-containers] Preprocessing test suite 'unordered-containers-tests' for unordered-containers-0.2.20.1..
  18161. 1433.39 s [unordered-containers] Phase: installPhase
  18162. 1433.51 s [unordered-containers] Installing library in /nix/store/rvfcf52n718bbqjvjsdnijkqpjk3fakv-unordered-containers-0.2.20.1/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/unordered-containers-0.2.20.1-D1jqSq3DdSJ3xwUmDFX7JF
  18163. 1434.26 s [unordered-containers] Phase: fixupPhase
  18164. 1436.58 s [unordered-containers] shrinking RPATHs of ELF executables and libraries in /nix/store/rvfcf52n718bbqjvjsdnijkqpjk3fakv-unordered-containers-0.2.20.1
  18165. 1436.58 s [unordered-containers] shrinking /nix/store/rvfcf52n718bbqjvjsdnijkqpjk3fakv-unordered-containers-0.2.20.1/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/libHSunordered-containers-0.2.20.1-D1jqSq3DdSJ3xwUmDFX7JF-ghc9.4.8.so
  18166. 1436.60 s [unordered-containers] checking for references to /build/ in /nix/store/rvfcf52n718bbqjvjsdnijkqpjk3fakv-unordered-containers-0.2.20.1...
  18167. 1436.61 s [unordered-containers] patching script interpreter paths in /nix/store/rvfcf52n718bbqjvjsdnijkqpjk3fakv-unordered-containers-0.2.20.1
  18168. 1436.62 s [unordered-containers] stripping (with command strip and flags -S -p) in /nix/store/rvfcf52n718bbqjvjsdnijkqpjk3fakv-unordered-containers-0.2.20.1/lib
  18169. 1436.84 s [unordered-containers] shrinking RPATHs of ELF executables and libraries in /nix/store/06pk2jpqzwg3grav3wg0afmhyjfs4hhh-unordered-containers-0.2.20.1-doc
  18170. 1436.86 s [unordered-containers] checking for references to /build/ in /nix/store/06pk2jpqzwg3grav3wg0afmhyjfs4hhh-unordered-containers-0.2.20.1-doc...
  18171. 1436.89 s [unordered-containers] patching script interpreter paths in /nix/store/06pk2jpqzwg3grav3wg0afmhyjfs4hhh-unordered-containers-0.2.20.1-doc
  18172. 1437.02 s [unordered-containers:post-build] Uploading to cachix cache "sellout": /nix/store/06pk2jpqzwg3grav3wg0afmhyjfs4hhh-unordered-containers-0.2.20.1-doc /nix/store/rvfcf52n718bbqjvjsdnijkqpjk3fakv-unordered-containers-0.2.20.1
  18173. 1437.50 s [unordered-containers:post-build] Nothing to push - all store paths are already on Cachix.
  18174. 1437.53 s [unordered-containers:post-build] Uploading to the NixCI cache: /nix/store/06pk2jpqzwg3grav3wg0afmhyjfs4hhh-unordered-containers-0.2.20.1-doc /nix/store/rvfcf52n718bbqjvjsdnijkqpjk3fakv-unordered-containers-0.2.20.1
  18175. 1437.57 s [unordered-containers:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  18176. 1437.65 s [unordered-containers:post-build] copying 1 paths...
  18177. 1437.65 s [unordered-containers:post-build] copying path '/nix/store/rvfcf52n718bbqjvjsdnijkqpjk3fakv-unordered-containers-0.2.20.1' to 'https://cache.nix-ci.com'...
  18178. 1440.22 s [unordered-containers:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  18179. 1440.31 s [unordered-containers:post-build] copying 0 paths...
  18180. 1440.34 s Progress: 11 of 19 built, 161 of 161 downloaded from cache
  18181. 1440.39 s Building /nix/store/ffy7nn4y5lqn69jjccamkm4bq5p7x6b2-quickcheck-instances-0.3.33.drv
  18182. 1440.56 s [quickcheck-instances] Phase: setupCompilerEnvironmentPhase
  18183. 1440.56 s [quickcheck-instances] Build with /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8.
  18184. 1440.79 s [quickcheck-instances] Phase: unpackPhase
  18185. 1440.79 s [quickcheck-instances] unpacking source archive /nix/store/ix9xgbag8470whifn4mzlsji4yz8vrc1-quickcheck-instances-0.3.33.tar.gz
  18186. 1440.80 s [quickcheck-instances] source root is quickcheck-instances-0.3.33
  18187. 1440.81 s [quickcheck-instances] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "quickcheck-instances-0.3.33/test/Tests.hs"
  18188. 1440.81 s [quickcheck-instances] Phase: patchPhase
  18189. 1440.82 s [quickcheck-instances] Replace Cabal file with edited version from mirror://hackage/quickcheck-instances-0.3.33/revision/1.cabal.
  18190. 1440.83 s [quickcheck-instances] Phase: compileBuildDriverPhase
  18191. 1440.83 s [quickcheck-instances] setupCompileFlags: -package-db=/build/tmp.u4AJFdOPNZ/setup-package.conf.d -threaded
  18192. 1440.89 s [quickcheck-instances] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.u4AJFdOPNZ/Main.o )
  18193. 1440.94 s [quickcheck-instances] [2 of 2] Linking Setup
  18194. 1442.58 s [quickcheck-instances] Phase: updateAutotoolsGnuConfigScriptsPhase
  18195. 1442.60 s [quickcheck-instances] Phase: configurePhase
  18196. 1442.60 s [quickcheck-instances] configureFlags: --verbose --prefix=/nix/store/bckzfrcjpvdnvamw8sdmc9kappy24p3d-quickcheck-instances-0.3.33 --libdir=$prefix/lib/$compiler --libsubdir=$abi/$libname --docdir=/nix/store/ii3046ymwisy7nbvmbas42fhhnas27mf-quickcheck-instances-0.3.33-doc/share/doc/quickcheck-instances-0.3.33 --with-gcc=gcc --package-db=/build/tmp.u4AJFdOPNZ/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/ffyzkisqs4vc4mg28bwwlyqjf8i9ph6b-ncurses-6.5/lib --extra-lib-dirs=/nix/store/n28qgdj8c1q41kf7n4y1jxa6ckp85m3c-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/hi0ar880110k6jsmmili7dh1gq3cg2a9-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/g09cflpnp4g80q56sj9dng1qzv4v4ybc-numactl-2.0.18/lib
  18197. 1443.13 s [quickcheck-instances] Using Parsec parser
  18198. 1443.13 s [quickcheck-instances] Configuring quickcheck-instances-0.3.33...
  18199. 1443.13 s [quickcheck-instances] Dependency OneTuple >=0.4.2 && <0.5: using OneTuple-0.4.2
  18200. 1443.13 s [quickcheck-instances] Dependency QuickCheck >=2.14.2 && <2.16.1: using QuickCheck-2.15.0.1
  18201. 1443.13 s [quickcheck-instances] Dependency array >=0.5.3.0 && <0.6: using array-0.5.4.0
  18202. 1443.13 s [quickcheck-instances] Dependency base >=4.12.0.0 && <4.22: using base-4.17.2.1
  18203. 1443.13 s [quickcheck-instances] Dependency bytestring >=0.10.8.2 && <0.13: using bytestring-0.11.5.3
  18204. 1443.14 s [quickcheck-instances] Dependency case-insensitive >=1.2.0.11 && <1.3: using case-insensitive-1.2.1.0
  18205. 1443.14 s [quickcheck-instances] Dependency containers >=0.6.0.1 && <0.8: using containers-0.6.7
  18206. 1443.14 s [quickcheck-instances] Dependency data-fix >=0.3 && <0.4: using data-fix-0.3.4
  18207. 1443.14 s [quickcheck-instances] Dependency hashable >=1.4.4.0 && <1.6: using hashable-1.4.7.0
  18208. 1443.14 s [quickcheck-instances] Dependency integer-logarithms >=1.0.3.1 && <1.1: using
  18209. 1443.14 s [quickcheck-instances] integer-logarithms-1.0.4
  18210. 1443.14 s [quickcheck-instances] Dependency old-time >=1.1.0.0 && <1.2: using old-time-1.1.0.4
  18211. 1443.14 s [quickcheck-instances] Dependency primitive >=0.9.0.0 && <0.10: using primitive-0.9.1.0
  18212. 1443.14 s [quickcheck-instances] Dependency scientific >=0.3.8.0 && <0.4: using scientific-0.3.8.0
  18213. 1443.14 s [quickcheck-instances] Dependency splitmix >=0.1.0.5 && <0.2: using splitmix-0.1.3.1
  18214. 1443.14 s [quickcheck-instances] Dependency strict >=0.5 && <0.6: using strict-0.5.1
  18215. 1443.14 s [quickcheck-instances] Dependency tagged >=0.8.8 && <0.9: using tagged-0.8.9
  18216. 1443.14 s [quickcheck-instances] Dependency text >=1.2.3.0 && <1.3 || >=2.0 && <2.2: using text-2.0.2
  18217. 1443.14 s [quickcheck-instances] Dependency text-short >=0.1.4 && <0.2: using text-short-0.1.6
  18218. 1443.14 s [quickcheck-instances] Dependency these >=1.2.1 && <1.3: using these-1.2.1
  18219. 1443.14 s [quickcheck-instances] Dependency time-compat >=1.9.4 && <1.10: using time-compat-1.9.8
  18220. 1443.14 s [quickcheck-instances] Dependency transformers >=0.5.6.2 && <0.7: using transformers-0.5.6.2
  18221. 1443.14 s [quickcheck-instances] Dependency unordered-containers >=0.2.20 && <0.3: using
  18222. 1443.14 s [quickcheck-instances] unordered-containers-0.2.20.1
  18223. 1443.14 s [quickcheck-instances] Dependency uuid-types >=1.0.6 && <1.1: using uuid-types-1.0.6
  18224. 1443.14 s [quickcheck-instances] Dependency vector >=0.13.2.0 && <0.14: using vector-0.13.2.0
  18225. 1443.14 s [quickcheck-instances] Dependency QuickCheck: using QuickCheck-2.15.0.1
  18226. 1443.14 s [quickcheck-instances] Dependency base: using base-4.17.2.1
  18227. 1443.14 s [quickcheck-instances] Dependency containers: using containers-0.6.7
  18228. 1443.14 s [quickcheck-instances] Dependency primitive: using primitive-0.9.1.0
  18229. 1443.14 s [quickcheck-instances] Dependency quickcheck-instances: using quickcheck-instances-0.3.33
  18230. 1443.14 s [quickcheck-instances] Dependency tagged: using tagged-0.8.9
  18231. 1443.14 s [quickcheck-instances] Dependency uuid-types: using uuid-types-1.0.6
  18232. 1443.30 s [quickcheck-instances] Source component graph:
  18233. 1443.30 s [quickcheck-instances] component lib
  18234. 1443.30 s [quickcheck-instances] component test:self-test dependency lib
  18235. 1443.30 s [quickcheck-instances] Configured component graph:
  18236. 1443.30 s [quickcheck-instances] component quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv
  18237. 1443.30 s [quickcheck-instances] include OneTuple-0.4.2-1qNCJdsVRsJDqD4lsm4n6x
  18238. 1443.30 s [quickcheck-instances] include QuickCheck-2.15.0.1-H9C4qdCN40J1jJ9nkbU8lt
  18239. 1443.30 s [quickcheck-instances] include array-0.5.4.0
  18240. 1443.30 s [quickcheck-instances] include base-4.17.2.1
  18241. 1443.30 s [quickcheck-instances] include bytestring-0.11.5.3
  18242. 1443.30 s [quickcheck-instances] include case-insensitive-1.2.1.0-3POgu6RVhJnIExPH4NIHY6
  18243. 1443.30 s [quickcheck-instances] include containers-0.6.7
  18244. 1443.30 s [quickcheck-instances] include data-fix-0.3.4-EXaUt9ZWYJVKId4auerdzD
  18245. 1443.30 s [quickcheck-instances] include hashable-1.4.7.0-8ZV7FpkGbGeLiC7s8Zu9SC
  18246. 1443.30 s [quickcheck-instances] include integer-logarithms-1.0.4-2UdkECKTVE99Cdcd46YJ5h
  18247. 1443.30 s [quickcheck-instances] include old-time-1.1.0.4-JCK1cuUA8uoGpLymN8cquI
  18248. 1443.30 s [quickcheck-instances] include primitive-0.9.1.0-IzoEy6gcvXy7FAbkwCq547
  18249. 1443.30 s [quickcheck-instances] include scientific-0.3.8.0-GvGwmF7EL59B4HGbGJmnI
  18250. 1443.30 s [quickcheck-instances] include splitmix-0.1.3.1-GyE00mUD5GrGc7M9pXZzrh
  18251. 1443.30 s [quickcheck-instances] include strict-0.5.1-J2JTQGR4MtH99TeEdgQVXd
  18252. 1443.30 s [quickcheck-instances] include tagged-0.8.9-KqjBAwtle3QBc7HNfWS5N5
  18253. 1443.30 s [quickcheck-instances] include text-2.0.2
  18254. 1443.30 s [quickcheck-instances] include text-short-0.1.6-746hHyaAgVO47s9DKqHa5a
  18255. 1443.30 s [quickcheck-instances] include these-1.2.1-FSMxiwnoUcjLDvhbSYo7wq
  18256. 1443.30 s [quickcheck-instances] include time-compat-1.9.8-ABavUctu5Y0BahPH45lQWm
  18257. 1443.30 s [quickcheck-instances] include transformers-0.5.6.2
  18258. 1443.30 s [quickcheck-instances] include unordered-containers-0.2.20.1-D1jqSq3DdSJ3xwUmDFX7JF
  18259. 1443.30 s [quickcheck-instances] include uuid-types-1.0.6-CEIS69rkcRZEcsou1FmgYp
  18260. 1443.30 s [quickcheck-instances] include vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf
  18261. 1443.30 s [quickcheck-instances] component quickcheck-instances-0.3.33-AXjKe9ynNR226iwrbrlnxm-self-test
  18262. 1443.30 s [quickcheck-instances] include QuickCheck-2.15.0.1-H9C4qdCN40J1jJ9nkbU8lt
  18263. 1443.30 s [quickcheck-instances] include base-4.17.2.1
  18264. 1443.30 s [quickcheck-instances] include containers-0.6.7
  18265. 1443.30 s [quickcheck-instances] include primitive-0.9.1.0-IzoEy6gcvXy7FAbkwCq547
  18266. 1443.30 s [quickcheck-instances] include quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv
  18267. 1443.30 s [quickcheck-instances] include tagged-0.8.9-KqjBAwtle3QBc7HNfWS5N5
  18268. 1443.30 s [quickcheck-instances] include uuid-types-1.0.6-CEIS69rkcRZEcsou1FmgYp
  18269. 1443.30 s [quickcheck-instances] Linked component graph:
  18270. 1443.30 s [quickcheck-instances] unit quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv
  18271. 1443.30 s [quickcheck-instances] include OneTuple-0.4.2-1qNCJdsVRsJDqD4lsm4n6x
  18272. 1443.30 s [quickcheck-instances] include QuickCheck-2.15.0.1-H9C4qdCN40J1jJ9nkbU8lt
  18273. 1443.30 s [quickcheck-instances] include array-0.5.4.0
  18274. 1443.30 s [quickcheck-instances] include base-4.17.2.1
  18275. 1443.30 s [quickcheck-instances] include bytestring-0.11.5.3
  18276. 1443.30 s [quickcheck-instances] include case-insensitive-1.2.1.0-3POgu6RVhJnIExPH4NIHY6
  18277. 1443.30 s [quickcheck-instances] include containers-0.6.7
  18278. 1443.30 s [quickcheck-instances] include data-fix-0.3.4-EXaUt9ZWYJVKId4auerdzD
  18279. 1443.30 s [quickcheck-instances] include hashable-1.4.7.0-8ZV7FpkGbGeLiC7s8Zu9SC
  18280. 1443.30 s [quickcheck-instances] include integer-logarithms-1.0.4-2UdkECKTVE99Cdcd46YJ5h
  18281. 1443.30 s [quickcheck-instances] include old-time-1.1.0.4-JCK1cuUA8uoGpLymN8cquI
  18282. 1443.30 s [quickcheck-instances] include primitive-0.9.1.0-IzoEy6gcvXy7FAbkwCq547
  18283. 1443.30 s [quickcheck-instances] include scientific-0.3.8.0-GvGwmF7EL59B4HGbGJmnI
  18284. 1443.30 s [quickcheck-instances] include splitmix-0.1.3.1-GyE00mUD5GrGc7M9pXZzrh
  18285. 1443.30 s [quickcheck-instances] include strict-0.5.1-J2JTQGR4MtH99TeEdgQVXd
  18286. 1443.30 s [quickcheck-instances] include tagged-0.8.9-KqjBAwtle3QBc7HNfWS5N5
  18287. 1443.30 s [quickcheck-instances] include text-2.0.2
  18288. 1443.30 s [quickcheck-instances] include text-short-0.1.6-746hHyaAgVO47s9DKqHa5a
  18289. 1443.30 s [quickcheck-instances] include these-1.2.1-FSMxiwnoUcjLDvhbSYo7wq
  18290. 1443.30 s [quickcheck-instances] include time-compat-1.9.8-ABavUctu5Y0BahPH45lQWm
  18291. 1443.30 s [quickcheck-instances] include transformers-0.5.6.2
  18292. 1443.30 s [quickcheck-instances] include unordered-containers-0.2.20.1-D1jqSq3DdSJ3xwUmDFX7JF
  18293. 1443.30 s [quickcheck-instances] include uuid-types-1.0.6-CEIS69rkcRZEcsou1FmgYp
  18294. 1443.30 s [quickcheck-instances] include vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf
  18295. 1443.30 s [quickcheck-instances] Test.QuickCheck.Instances=quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv:Test.QuickCheck.Instances,Test.QuickCheck.Instances.Array=quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv:Test.QuickCheck.Instances.Array,Test.QuickCheck.Instances.Array.Byte=quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv:Test.QuickCheck.Instances.Array.Byte,Test.QuickCheck.Instances.ByteString=quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv:Test.QuickCheck.Instances.ByteString,Test.QuickCheck.Instances.CaseInsensitive=quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv:Test.QuickCheck.Instances.CaseInsensitive,Test.QuickCheck.Instances.Containers=quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv:Test.QuickCheck.Instances.Containers,Test.QuickCheck.Instances.DataFix=quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv:Test.QuickCheck.Instances.DataFix,Test.QuickCheck.Instances.Hashable=quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv:Test.QuickCheck.Instances.Hashable,Test.QuickCheck.Instances.Natural=quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv:Test.QuickCheck.Instances.Natural,Test.QuickCheck.Instances.OldTime=quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv:Test.QuickCheck.Instances.OldTime,Test.QuickCheck.Instances.Primitive=quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv:Test.QuickCheck.Instances.Primitive,Test.QuickCheck.Instances.Scientific=quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv:Test.QuickCheck.Instances.Scientific,Test.QuickCheck.Instances.Semigroup=quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv:Test.QuickCheck.Instances.Semigroup,Test.QuickCheck.Instances.Solo=quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv:Test.QuickCheck.Instances.Solo,Test.QuickCheck.Instances.Strict=quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv:Test.QuickCheck.Instances.Strict,Test.QuickCheck.Instances.Tagged=quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv:Test.QuickCheck.Instances.Tagged,Test.QuickCheck.Instances.Text=quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv:Test.QuickCheck.Instances.Text,Test.QuickCheck.Instances.Text.Short=quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv:Test.QuickCheck.Instances.Text.Short,Test.QuickCheck.Instances.These=quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv:Test.QuickCheck.Instances.These,Test.QuickCheck.Instances.Time=quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv:Test.QuickCheck.Instances.Time,Test.QuickCheck.Instances.Transformer=quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv:Test.QuickCheck.Instances.Transformer,Test.QuickCheck.Instances.UUID=quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv:Test.QuickCheck.Instances.UUID,Test.QuickCheck.Instances.UnorderedContainers=quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv:Test.QuickCheck.Instances.UnorderedContainers,Test.QuickCheck.Instances.Vector=quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv:Test.QuickCheck.Instances.Vector,Test.QuickCheck.Instances.Void=quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv:Test.QuickCheck.Instances.Void
  18296. 1443.30 s [quickcheck-instances] unit quickcheck-instances-0.3.33-AXjKe9ynNR226iwrbrlnxm-self-test
  18297. 1443.30 s [quickcheck-instances] include QuickCheck-2.15.0.1-H9C4qdCN40J1jJ9nkbU8lt
  18298. 1443.30 s [quickcheck-instances] include base-4.17.2.1
  18299. 1443.30 s [quickcheck-instances] include containers-0.6.7
  18300. 1443.30 s [quickcheck-instances] include primitive-0.9.1.0-IzoEy6gcvXy7FAbkwCq547
  18301. 1443.30 s [quickcheck-instances] include quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv
  18302. 1443.30 s [quickcheck-instances] include tagged-0.8.9-KqjBAwtle3QBc7HNfWS5N5
  18303. 1443.30 s [quickcheck-instances] include uuid-types-1.0.6-CEIS69rkcRZEcsou1FmgYp
  18304. 1443.30 s [quickcheck-instances] Ready component graph:
  18305. 1443.30 s [quickcheck-instances] definite quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv
  18306. 1443.30 s [quickcheck-instances] depends OneTuple-0.4.2-1qNCJdsVRsJDqD4lsm4n6x
  18307. 1443.30 s [quickcheck-instances] depends QuickCheck-2.15.0.1-H9C4qdCN40J1jJ9nkbU8lt
  18308. 1443.30 s [quickcheck-instances] depends array-0.5.4.0
  18309. 1443.30 s [quickcheck-instances] depends base-4.17.2.1
  18310. 1443.30 s [quickcheck-instances] depends bytestring-0.11.5.3
  18311. 1443.30 s [quickcheck-instances] depends case-insensitive-1.2.1.0-3POgu6RVhJnIExPH4NIHY6
  18312. 1443.30 s [quickcheck-instances] depends containers-0.6.7
  18313. 1443.31 s [quickcheck-instances] depends data-fix-0.3.4-EXaUt9ZWYJVKId4auerdzD
  18314. 1443.31 s [quickcheck-instances] depends hashable-1.4.7.0-8ZV7FpkGbGeLiC7s8Zu9SC
  18315. 1443.31 s [quickcheck-instances] depends integer-logarithms-1.0.4-2UdkECKTVE99Cdcd46YJ5h
  18316. 1443.31 s [quickcheck-instances] depends old-time-1.1.0.4-JCK1cuUA8uoGpLymN8cquI
  18317. 1443.31 s [quickcheck-instances] depends primitive-0.9.1.0-IzoEy6gcvXy7FAbkwCq547
  18318. 1443.31 s [quickcheck-instances] depends scientific-0.3.8.0-GvGwmF7EL59B4HGbGJmnI
  18319. 1443.31 s [quickcheck-instances] depends splitmix-0.1.3.1-GyE00mUD5GrGc7M9pXZzrh
  18320. 1443.31 s [quickcheck-instances] depends strict-0.5.1-J2JTQGR4MtH99TeEdgQVXd
  18321. 1443.31 s [quickcheck-instances] depends tagged-0.8.9-KqjBAwtle3QBc7HNfWS5N5
  18322. 1443.31 s [quickcheck-instances] depends text-2.0.2
  18323. 1443.31 s [quickcheck-instances] depends text-short-0.1.6-746hHyaAgVO47s9DKqHa5a
  18324. 1443.31 s [quickcheck-instances] depends these-1.2.1-FSMxiwnoUcjLDvhbSYo7wq
  18325. 1443.31 s [quickcheck-instances] depends time-compat-1.9.8-ABavUctu5Y0BahPH45lQWm
  18326. 1443.31 s [quickcheck-instances] depends transformers-0.5.6.2
  18327. 1443.31 s [quickcheck-instances] depends unordered-containers-0.2.20.1-D1jqSq3DdSJ3xwUmDFX7JF
  18328. 1443.31 s [quickcheck-instances] depends uuid-types-1.0.6-CEIS69rkcRZEcsou1FmgYp
  18329. 1443.31 s [quickcheck-instances] depends vector-0.13.2.0-AOpsArvB9FsCBzFOZVcWEf
  18330. 1443.31 s [quickcheck-instances] definite quickcheck-instances-0.3.33-AXjKe9ynNR226iwrbrlnxm-self-test
  18331. 1443.31 s [quickcheck-instances] depends QuickCheck-2.15.0.1-H9C4qdCN40J1jJ9nkbU8lt
  18332. 1443.31 s [quickcheck-instances] depends base-4.17.2.1
  18333. 1443.31 s [quickcheck-instances] depends containers-0.6.7
  18334. 1443.31 s [quickcheck-instances] depends primitive-0.9.1.0-IzoEy6gcvXy7FAbkwCq547
  18335. 1443.31 s [quickcheck-instances] depends quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv
  18336. 1443.50 s [quickcheck-instances] depends tagged-0.8.9-KqjBAwtle3QBc7HNfWS5N5
  18337. 1443.50 s [quickcheck-instances] depends uuid-types-1.0.6-CEIS69rkcRZEcsou1FmgYp
  18338. 1443.50 s [quickcheck-instances] Using Cabal-3.8.1.0 compiled by ghc-9.4
  18339. 1443.50 s [quickcheck-instances] Using compiler: ghc-9.4.8
  18340. 1443.50 s [quickcheck-instances] Using install prefix:
  18341. 1443.50 s [quickcheck-instances] /nix/store/bckzfrcjpvdnvamw8sdmc9kappy24p3d-quickcheck-instances-0.3.33
  18342. 1443.50 s [quickcheck-instances] Executables installed in:
  18343. 1443.50 s [quickcheck-instances] /nix/store/bckzfrcjpvdnvamw8sdmc9kappy24p3d-quickcheck-instances-0.3.33/bin
  18344. 1443.50 s [quickcheck-instances] Libraries installed in:
  18345. 1443.50 s [quickcheck-instances] /nix/store/bckzfrcjpvdnvamw8sdmc9kappy24p3d-quickcheck-instances-0.3.33/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv
  18346. 1443.50 s [quickcheck-instances] Dynamic Libraries installed in:
  18347. 1443.50 s [quickcheck-instances] /nix/store/bckzfrcjpvdnvamw8sdmc9kappy24p3d-quickcheck-instances-0.3.33/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8
  18348. 1443.50 s [quickcheck-instances] Private executables installed in:
  18349. 1443.50 s [quickcheck-instances] /nix/store/bckzfrcjpvdnvamw8sdmc9kappy24p3d-quickcheck-instances-0.3.33/libexec/x86_64-linux-ghc-9.4.8/quickcheck-instances-0.3.33
  18350. 1443.50 s [quickcheck-instances] Data files installed in:
  18351. 1443.50 s [quickcheck-instances] /nix/store/bckzfrcjpvdnvamw8sdmc9kappy24p3d-quickcheck-instances-0.3.33/share/x86_64-linux-ghc-9.4.8/quickcheck-instances-0.3.33
  18352. 1443.50 s [quickcheck-instances] Documentation installed in:
  18353. 1443.50 s [quickcheck-instances] /nix/store/ii3046ymwisy7nbvmbas42fhhnas27mf-quickcheck-instances-0.3.33-doc/share/doc/quickcheck-instances-0.3.33
  18354. 1443.50 s [quickcheck-instances] Configuration files installed in:
  18355. 1443.50 s [quickcheck-instances] /nix/store/bckzfrcjpvdnvamw8sdmc9kappy24p3d-quickcheck-instances-0.3.33/etc
  18356. 1443.50 s [quickcheck-instances] No alex found
  18357. 1443.50 s [quickcheck-instances] Using ar found on system at:
  18358. 1443.50 s [quickcheck-instances] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  18359. 1443.50 s [quickcheck-instances] No c2hs found
  18360. 1443.50 s [quickcheck-instances] No cpphs found
  18361. 1443.50 s [quickcheck-instances] No doctest found
  18362. 1443.50 s [quickcheck-instances] Using gcc version 14.3.0 given by user at:
  18363. 1443.50 s [quickcheck-instances] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  18364. 1443.50 s [quickcheck-instances] Using ghc version 9.4.8 found on system at:
  18365. 1443.50 s [quickcheck-instances] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/ghc
  18366. 1443.50 s [quickcheck-instances] Using ghc-pkg version 9.4.8 found on system at:
  18367. 1443.50 s [quickcheck-instances] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/ghc-pkg-9.4.8
  18368. 1443.50 s [quickcheck-instances] No ghcjs found
  18369. 1443.50 s [quickcheck-instances] No ghcjs-pkg found
  18370. 1443.50 s [quickcheck-instances] No greencard found
  18371. 1443.50 s [quickcheck-instances] Using haddock version 2.27.0 found on system at:
  18372. 1443.50 s [quickcheck-instances] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/haddock-ghc-9.4.8
  18373. 1443.50 s [quickcheck-instances] No happy found
  18374. 1443.50 s [quickcheck-instances] Using haskell-suite found on system at: haskell-suite-dummy-location
  18375. 1443.50 s [quickcheck-instances] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  18376. 1443.50 s [quickcheck-instances] No hmake found
  18377. 1443.50 s [quickcheck-instances] Using hpc version 0.68 found on system at:
  18378. 1443.50 s [quickcheck-instances] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/hpc
  18379. 1443.50 s [quickcheck-instances] Using hsc2hs version 0.68.8 found on system at:
  18380. 1443.50 s [quickcheck-instances] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/hsc2hs
  18381. 1443.50 s [quickcheck-instances] Using hscolour version 1.25 found on system at:
  18382. 1443.50 s [quickcheck-instances] /nix/store/87hdxxa93g58b2w9ylr2idn2a40i3fdc-hscolour-1.25/bin/HsColour
  18383. 1443.50 s [quickcheck-instances] No jhc found
  18384. 1443.50 s [quickcheck-instances] Using ld found on system at:
  18385. 1443.50 s [quickcheck-instances] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ld.gold
  18386. 1443.50 s [quickcheck-instances] No pkg-config found
  18387. 1443.50 s [quickcheck-instances] Using runghc version 9.4.8 found on system at:
  18388. 1443.50 s [quickcheck-instances] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/runghc-9.4.8
  18389. 1443.50 s [quickcheck-instances] Using strip version 2.44 found on system at:
  18390. 1443.50 s [quickcheck-instances] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  18391. 1443.50 s [quickcheck-instances] Using tar found on system at:
  18392. 1443.50 s [quickcheck-instances] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  18393. 1443.50 s [quickcheck-instances] No uhc found
  18394. 1443.51 s [quickcheck-instances] Phase: buildPhase
  18395. 1443.57 s [quickcheck-instances] Preprocessing library for quickcheck-instances-0.3.33..
  18396. 1443.58 s [quickcheck-instances] Building library for quickcheck-instances-0.3.33..
  18397. 1443.69 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 )
  18398. 1443.75 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 )
  18399. 1444.08 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 )
  18400. 1444.18 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 )
  18401. 1444.19 s [quickcheck-instances] [ 5 of 26] Compiling Test.QuickCheck.Instances.Array ( src/Test/QuickCheck/Instances/Array.hs, dist/build/Test/QuickCheck/Instances/Array.o, dist/build/Test/QuickCheck/Instances/Array.dyn_o )
  18402. 1444.66 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 )
  18403. 1444.66 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 )
  18404. 1444.66 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 )
  18405. 1444.66 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 )
  18406. 1444.66 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 )
  18407. 1444.66 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 )
  18408. 1444.69 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 )
  18409. 1444.69 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 )
  18410. 1444.69 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 )
  18411. 1444.69 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 )
  18412. 1444.82 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 )
  18413. 1444.82 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 )
  18414. 1444.82 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 )
  18415. 1444.82 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 )
  18416. 1444.82 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 )
  18417. 1445.18 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 )
  18418. 1445.18 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 )
  18419. 1445.18 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 )
  18420. 1445.18 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 )
  18421. 1445.18 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 )
  18422. 1445.18 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 )
  18423. 1445.56 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 )
  18424. 1445.73 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 )
  18425. 1446.33 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 )
  18426. 1446.70 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 )
  18427. 1446.70 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 )
  18428. 1446.81 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 )
  18429. 1446.81 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 )
  18430. 1446.81 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 )
  18431. 1446.81 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 )
  18432. 1446.81 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 )
  18433. 1446.81 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 )
  18434. 1446.81 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 )
  18435. 1446.81 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 )
  18436. 1446.81 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 )
  18437. 1446.81 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 )
  18438. 1446.81 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 )
  18439. 1446.81 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 )
  18440. 1446.81 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 )
  18441. 1446.81 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 )
  18442. 1446.81 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 )
  18443. 1447.78 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 )
  18444. 1447.78 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 )
  18445. 1447.78 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 )
  18446. 1447.78 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 )
  18447. 1447.78 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 )
  18448. 1447.78 s [quickcheck-instances] [26 of 26] Compiling Test.QuickCheck.Instances ( src/Test/QuickCheck/Instances.hs, dist/build/Test/QuickCheck/Instances.p_o )
  18449. 1449.46 s [quickcheck-instances] Preprocessing test suite 'self-test' for quickcheck-instances-0.3.33..
  18450. 1449.46 s [quickcheck-instances] Building test suite 'self-test' for quickcheck-instances-0.3.33..
  18451. 1449.54 s [quickcheck-instances] [1 of 1] Compiling Main ( test/Tests.hs, dist/build/self-test/self-test-tmp/Main.o )
  18452. 1450.05 s [quickcheck-instances] [2 of 2] Linking dist/build/self-test/self-test
  18453. 1451.24 s [quickcheck-instances] Phase: checkPhase
  18454. 1451.28 s [quickcheck-instances] Running 1 test suites...
  18455. 1451.28 s [quickcheck-instances] Test suite self-test: RUNNING...
  18456. 1451.29 s [quickcheck-instances] +++ OK, passed 100 tests.
  18457. 1451.29 s [quickcheck-instances] +++ OK, passed 100 tests.
  18458. 1451.29 s [quickcheck-instances] +++ OK, passed 100 tests.
  18459. 1451.29 s [quickcheck-instances] +++ OK, passed 100 tests.
  18460. 1451.29 s [quickcheck-instances] +++ OK, passed 100 tests.
  18461. 1451.29 s [quickcheck-instances] Test suite self-test: PASS
  18462. 1451.29 s [quickcheck-instances] Test suite logged to: dist/test/quickcheck-instances-0.3.33-self-test.log
  18463. 1451.29 s [quickcheck-instances] 1 of 1 test suites (1 of 1 test cases) passed.
  18464. 1451.30 s [quickcheck-instances] Phase: haddockPhase
  18465. 1451.45 s [quickcheck-instances] Preprocessing library for quickcheck-instances-0.3.33..
  18466. 1451.45 s [quickcheck-instances] Running Haddock on library for quickcheck-instances-0.3.33..
  18467. 1451.46 s [quickcheck-instances] Warning: The documentation for the following packages are not installed. No
  18468. 1451.46 s [quickcheck-instances] links will be generated to these packages: foldable1-classes-compat-0.1.2,
  18469. 1451.46 s [quickcheck-instances] vector-0.13.2.0
  18470. 1451.52 s [quickcheck-instances] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
  18471. 1451.76 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Containers'
  18472. 1451.76 s [quickcheck-instances] Missing documentation for:
  18473. 1451.76 s [quickcheck-instances] Module header
  18474. 1451.83 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.CaseInsensitive'
  18475. 1451.83 s [quickcheck-instances] Missing documentation for:
  18476. 1451.83 s [quickcheck-instances] Module header
  18477. 1451.90 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.ByteString'
  18478. 1451.90 s [quickcheck-instances] Missing documentation for:
  18479. 1451.90 s [quickcheck-instances] Module header
  18480. 1451.92 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Array'
  18481. 1451.92 s [quickcheck-instances] Missing documentation for:
  18482. 1451.92 s [quickcheck-instances] Module header
  18483. 1451.94 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.DataFix'
  18484. 1451.94 s [quickcheck-instances] Missing documentation for:
  18485. 1451.94 s [quickcheck-instances] Module header
  18486. 1451.94 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Hashable'
  18487. 1451.94 s [quickcheck-instances] Missing documentation for:
  18488. 1451.94 s [quickcheck-instances] Module header
  18489. 1451.95 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Natural'
  18490. 1451.95 s [quickcheck-instances] Missing documentation for:
  18491. 1451.95 s [quickcheck-instances] Module header
  18492. 1451.97 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.OldTime'
  18493. 1451.97 s [quickcheck-instances] Missing documentation for:
  18494. 1451.97 s [quickcheck-instances] Module header
  18495. 1452.03 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Primitive'
  18496. 1452.03 s [quickcheck-instances] Missing documentation for:
  18497. 1452.03 s [quickcheck-instances] Module header
  18498. 1452.04 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Array.Byte'
  18499. 1452.04 s [quickcheck-instances] Missing documentation for:
  18500. 1452.04 s [quickcheck-instances] Module header
  18501. 1452.04 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Scientific'
  18502. 1452.04 s [quickcheck-instances] Missing documentation for:
  18503. 1452.04 s [quickcheck-instances] Module header
  18504. 1452.06 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Semigroup'
  18505. 1452.06 s [quickcheck-instances] Missing documentation for:
  18506. 1452.06 s [quickcheck-instances] Module header
  18507. 1452.18 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Solo'
  18508. 1452.18 s [quickcheck-instances] Missing documentation for:
  18509. 1452.18 s [quickcheck-instances] Module header
  18510. 1452.22 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Strict'
  18511. 1452.22 s [quickcheck-instances] Missing documentation for:
  18512. 1452.22 s [quickcheck-instances] Module header
  18513. 1452.29 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Tagged'
  18514. 1452.29 s [quickcheck-instances] Missing documentation for:
  18515. 1452.29 s [quickcheck-instances] Module header
  18516. 1452.30 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Text'
  18517. 1452.30 s [quickcheck-instances] Missing documentation for:
  18518. 1452.30 s [quickcheck-instances] Module header
  18519. 1452.30 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Text.Short'
  18520. 1452.30 s [quickcheck-instances] Missing documentation for:
  18521. 1452.30 s [quickcheck-instances] Module header
  18522. 1452.32 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.These'
  18523. 1452.32 s [quickcheck-instances] Missing documentation for:
  18524. 1452.32 s [quickcheck-instances] Module header
  18525. 1452.38 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Time'
  18526. 1452.38 s [quickcheck-instances] Missing documentation for:
  18527. 1452.38 s [quickcheck-instances] Module header
  18528. 1452.43 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Transformer'
  18529. 1452.43 s [quickcheck-instances] Missing documentation for:
  18530. 1452.43 s [quickcheck-instances] Module header
  18531. 1452.45 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.UUID'
  18532. 1452.45 s [quickcheck-instances] Missing documentation for:
  18533. 1452.45 s [quickcheck-instances] Module header
  18534. 1452.47 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.UnorderedContainers'
  18535. 1452.47 s [quickcheck-instances] Missing documentation for:
  18536. 1452.47 s [quickcheck-instances] Module header
  18537. 1452.53 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Vector'
  18538. 1452.53 s [quickcheck-instances] Missing documentation for:
  18539. 1452.53 s [quickcheck-instances] Module header
  18540. 1452.71 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Void'
  18541. 1452.71 s [quickcheck-instances] Missing documentation for:
  18542. 1452.71 s [quickcheck-instances] Module header
  18543. 1452.72 s [quickcheck-instances] 100% ( 1 / 1) in 'Test.QuickCheck.Instances'
  18544. 1453.04 s [quickcheck-instances] Warning: Test.QuickCheck.Instances.Vector: could not find link destinations for:
  18545. 1453.04 s [quickcheck-instances]
  18546. 1453.04 s [quickcheck-instances] - Data.Vector.Vector
  18547. 1453.04 s [quickcheck-instances] - Data.Vector.Primitive.Vector
  18548. 1453.04 s [quickcheck-instances] - Data.Vector.Storable.Vector
  18549. 1453.04 s [quickcheck-instances] - Data.Vector.Strict.Vector
  18550. 1453.04 s [quickcheck-instances] - Data.Vector.Unboxed.Base.Vector
  18551. 1453.04 s [quickcheck-instances] - Data.Vector.Unboxed.Base.Unbox
  18552. 1456.88 s [quickcheck-instances] Documentation created: dist/doc/html/quickcheck-instances/index.html,
  18553. 1456.88 s [quickcheck-instances] dist/doc/html/quickcheck-instances/quickcheck-instances.txt
  18554. 1456.95 s [quickcheck-instances] Preprocessing test suite 'self-test' for quickcheck-instances-0.3.33..
  18555. 1456.96 s [quickcheck-instances] Phase: installPhase
  18556. 1457.03 s [quickcheck-instances] Installing library in /nix/store/bckzfrcjpvdnvamw8sdmc9kappy24p3d-quickcheck-instances-0.3.33/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv
  18557. 1457.55 s [quickcheck-instances] Phase: fixupPhase
  18558. 1457.57 s [quickcheck-instances] shrinking RPATHs of ELF executables and libraries in /nix/store/bckzfrcjpvdnvamw8sdmc9kappy24p3d-quickcheck-instances-0.3.33
  18559. 1457.59 s [quickcheck-instances] shrinking /nix/store/bckzfrcjpvdnvamw8sdmc9kappy24p3d-quickcheck-instances-0.3.33/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/libHSquickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv-ghc9.4.8.so
  18560. 1457.61 s [quickcheck-instances] checking for references to /build/ in /nix/store/bckzfrcjpvdnvamw8sdmc9kappy24p3d-quickcheck-instances-0.3.33...
  18561. 1457.67 s [quickcheck-instances] patching script interpreter paths in /nix/store/bckzfrcjpvdnvamw8sdmc9kappy24p3d-quickcheck-instances-0.3.33
  18562. 1457.67 s [quickcheck-instances] stripping (with command strip and flags -S -p) in /nix/store/bckzfrcjpvdnvamw8sdmc9kappy24p3d-quickcheck-instances-0.3.33/lib
  18563. 1457.83 s [quickcheck-instances] shrinking RPATHs of ELF executables and libraries in /nix/store/ii3046ymwisy7nbvmbas42fhhnas27mf-quickcheck-instances-0.3.33-doc
  18564. 1457.85 s [quickcheck-instances] checking for references to /build/ in /nix/store/ii3046ymwisy7nbvmbas42fhhnas27mf-quickcheck-instances-0.3.33-doc...
  18565. 1457.88 s [quickcheck-instances] patching script interpreter paths in /nix/store/ii3046ymwisy7nbvmbas42fhhnas27mf-quickcheck-instances-0.3.33-doc
  18566. 1457.99 s [quickcheck-instances:post-build] Uploading to cachix cache "sellout": /nix/store/bckzfrcjpvdnvamw8sdmc9kappy24p3d-quickcheck-instances-0.3.33 /nix/store/ii3046ymwisy7nbvmbas42fhhnas27mf-quickcheck-instances-0.3.33-doc
  18567. 1458.38 s [quickcheck-instances:post-build] Nothing to push - all store paths are already on Cachix.
  18568. 1458.40 s [quickcheck-instances:post-build] Uploading to the NixCI cache: /nix/store/bckzfrcjpvdnvamw8sdmc9kappy24p3d-quickcheck-instances-0.3.33 /nix/store/ii3046ymwisy7nbvmbas42fhhnas27mf-quickcheck-instances-0.3.33-doc
  18569. 1458.45 s [quickcheck-instances:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  18570. 1458.50 s [quickcheck-instances:post-build] copying 1 paths...
  18571. 1458.50 s [quickcheck-instances:post-build] copying path '/nix/store/bckzfrcjpvdnvamw8sdmc9kappy24p3d-quickcheck-instances-0.3.33' to 'https://cache.nix-ci.com'...
  18572. 1460.16 s [quickcheck-instances:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  18573. 1460.25 s [quickcheck-instances:post-build] copying 0 paths...
  18574. 1460.27 s Progress: 12 of 19 built, 161 of 161 downloaded from cache
  18575. 1460.33 s Building /nix/store/qn7lk4qpbww9swg7wp6jj3qbrwghkxvr-extra-1.8.1.drv
  18576. 1460.49 s [extra] Phase: setupCompilerEnvironmentPhase
  18577. 1460.50 s [extra] Build with /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8.
  18578. 1460.75 s [extra] Phase: unpackPhase
  18579. 1460.76 s [extra] unpacking source archive /nix/store/3nprda3kdyhj8zkmv2z32yi6n0gwc966-extra-1.8.1.tar.gz
  18580. 1460.77 s [extra] source root is extra-1.8.1
  18581. 1460.77 s [extra] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "extra-1.8.1/test/TestUtil.hs"
  18582. 1460.78 s [extra] Phase: patchPhase
  18583. 1460.79 s [extra] Phase: compileBuildDriverPhase
  18584. 1460.79 s [extra] setupCompileFlags: -package-db=/build/tmp.FIFjyRSDJG/setup-package.conf.d -threaded
  18585. 1460.84 s [extra] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.FIFjyRSDJG/Main.o )
  18586. 1460.90 s [extra] [2 of 2] Linking Setup
  18587. 1462.50 s [extra] Phase: updateAutotoolsGnuConfigScriptsPhase
  18588. 1462.64 s [extra] Phase: configurePhase
  18589. 1462.77 s [extra] configureFlags: --verbose --prefix=/nix/store/3k0hvm3ji4zr2w13ddkq0lqk65vnd6ah-extra-1.8.1 --libdir=$prefix/lib/$compiler --libsubdir=$abi/$libname --docdir=/nix/store/hmmlkgyklr6cqmfw2p9q5fcbzdszv1z4-extra-1.8.1-doc/share/doc/extra-1.8.1 --with-gcc=gcc --package-db=/build/tmp.FIFjyRSDJG/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/ffyzkisqs4vc4mg28bwwlyqjf8i9ph6b-ncurses-6.5/lib --extra-lib-dirs=/nix/store/n28qgdj8c1q41kf7n4y1jxa6ckp85m3c-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/hi0ar880110k6jsmmili7dh1gq3cg2a9-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/g09cflpnp4g80q56sj9dng1qzv4v4ybc-numactl-2.0.18/lib
  18590. 1463.32 s [extra] Using Parsec parser
  18591. 1463.32 s [extra] Configuring extra-1.8.1...
  18592. 1463.32 s [extra] Dependency base >=4.9 && <5: using base-4.17.2.1
  18593. 1463.32 s [extra] Dependency clock >=0.7: using clock-0.8.4
  18594. 1463.32 s [extra] Dependency directory: using directory-1.3.7.1
  18595. 1463.32 s [extra] Dependency filepath: using filepath-1.4.2.2
  18596. 1463.32 s [extra] Dependency process: using process-1.6.18.0
  18597. 1463.32 s [extra] Dependency time: using time-1.12.2
  18598. 1463.32 s [extra] Dependency unix: using unix-2.7.3
  18599. 1463.32 s [extra] Dependency QuickCheck >=2.10: using QuickCheck-2.15.0.1
  18600. 1463.32 s [extra] Dependency base >=4 && <5: using base-4.17.2.1
  18601. 1463.32 s [extra] Dependency directory: using directory-1.3.7.1
  18602. 1463.32 s [extra] Dependency extra: using extra-1.8.1
  18603. 1463.32 s [extra] Dependency filepath: using filepath-1.4.2.2
  18604. 1463.32 s [extra] Dependency quickcheck-instances >=0.3.17: using quickcheck-instances-0.3.33
  18605. 1463.32 s [extra] Dependency unix: using unix-2.7.3
  18606. 1465.55 s [extra] Source component graph:
  18607. 1465.55 s [extra] component lib
  18608. 1465.55 s [extra] component test:extra-test dependency lib
  18609. 1465.55 s [extra] Configured component graph:
  18610. 1465.55 s [extra] component extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj
  18611. 1465.55 s [extra] include base-4.17.2.1
  18612. 1465.55 s [extra] include clock-0.8.4-BfeoV556mf87NJyLkMXuRF
  18613. 1465.55 s [extra] include directory-1.3.7.1
  18614. 1465.55 s [extra] include filepath-1.4.2.2
  18615. 1465.55 s [extra] include process-1.6.18.0
  18616. 1465.55 s [extra] include time-1.12.2
  18617. 1465.55 s [extra] include unix-2.7.3
  18618. 1465.55 s [extra] component extra-1.8.1-EMlICjHujfzJ7Uu7yvyGlk-extra-test
  18619. 1465.55 s [extra] include QuickCheck-2.15.0.1-H9C4qdCN40J1jJ9nkbU8lt
  18620. 1465.55 s [extra] include base-4.17.2.1
  18621. 1465.55 s [extra] include directory-1.3.7.1
  18622. 1465.55 s [extra] include extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj
  18623. 1465.55 s [extra] include filepath-1.4.2.2
  18624. 1465.55 s [extra] include quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv
  18625. 1465.55 s [extra] include unix-2.7.3
  18626. 1465.55 s [extra] Linked component graph:
  18627. 1465.55 s [extra] unit extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj
  18628. 1465.55 s [extra] include base-4.17.2.1
  18629. 1465.55 s [extra] include clock-0.8.4-BfeoV556mf87NJyLkMXuRF
  18630. 1465.55 s [extra] include directory-1.3.7.1
  18631. 1465.55 s [extra] include filepath-1.4.2.2
  18632. 1465.55 s [extra] include process-1.6.18.0
  18633. 1465.55 s [extra] include time-1.12.2
  18634. 1465.55 s [extra] include unix-2.7.3
  18635. 1465.55 s [extra] Control.Concurrent.Extra=extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj:Control.Concurrent.Extra,Control.Exception.Extra=extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj:Control.Exception.Extra,Control.Monad.Extra=extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj:Control.Monad.Extra,Data.Either.Extra=extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj:Data.Either.Extra,Data.Foldable.Extra=extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj:Data.Foldable.Extra,Data.IORef.Extra=extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj:Data.IORef.Extra,Data.List.Extra=extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj:Data.List.Extra,Data.List.NonEmpty.Extra=extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj:Data.List.NonEmpty.Extra,Data.Monoid.Extra=extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj:Data.Monoid.Extra,Data.Tuple.Extra=extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj:Data.Tuple.Extra,Data.Typeable.Extra=extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj:Data.Typeable.Extra,Data.Version.Extra=extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj:Data.Version.Extra,Extra=extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj:Extra,Numeric.Extra=extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj:Numeric.Extra,System.Directory.Extra=extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj:System.Directory.Extra,System.Environment.Extra=extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj:System.Environment.Extra,System.IO.Extra=extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj:System.IO.Extra,System.Info.Extra=extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj:System.Info.Extra,System.Process.Extra=extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj:System.Process.Extra,System.Time.Extra=extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj:System.Time.Extra,Text.Read.Extra=extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj:Text.Read.Extra
  18636. 1465.55 s [extra] unit extra-1.8.1-EMlICjHujfzJ7Uu7yvyGlk-extra-test
  18637. 1465.55 s [extra] include QuickCheck-2.15.0.1-H9C4qdCN40J1jJ9nkbU8lt
  18638. 1465.55 s [extra] include base-4.17.2.1
  18639. 1465.55 s [extra] include directory-1.3.7.1
  18640. 1465.55 s [extra] include extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj
  18641. 1465.55 s [extra] include filepath-1.4.2.2
  18642. 1465.55 s [extra] include quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv
  18643. 1465.55 s [extra] include unix-2.7.3
  18644. 1465.55 s [extra] Ready component graph:
  18645. 1465.55 s [extra] definite extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj
  18646. 1465.55 s [extra] depends base-4.17.2.1
  18647. 1465.55 s [extra] depends clock-0.8.4-BfeoV556mf87NJyLkMXuRF
  18648. 1465.55 s [extra] depends directory-1.3.7.1
  18649. 1465.55 s [extra] depends filepath-1.4.2.2
  18650. 1465.55 s [extra] depends process-1.6.18.0
  18651. 1465.55 s [extra] depends time-1.12.2
  18652. 1465.55 s [extra] depends unix-2.7.3
  18653. 1465.55 s [extra] definite extra-1.8.1-EMlICjHujfzJ7Uu7yvyGlk-extra-test
  18654. 1465.55 s [extra] depends QuickCheck-2.15.0.1-H9C4qdCN40J1jJ9nkbU8lt
  18655. 1465.55 s [extra] depends base-4.17.2.1
  18656. 1465.55 s [extra] depends directory-1.3.7.1
  18657. 1465.55 s [extra] depends extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj
  18658. 1465.55 s [extra] depends filepath-1.4.2.2
  18659. 1465.55 s [extra] depends quickcheck-instances-0.3.33-27ICABzmtRV3CGRWQGGSYv
  18660. 1465.55 s [extra] depends unix-2.7.3
  18661. 1465.55 s [extra] Using Cabal-3.8.1.0 compiled by ghc-9.4
  18662. 1465.55 s [extra] Using compiler: ghc-9.4.8
  18663. 1465.55 s [extra] Using install prefix: /nix/store/3k0hvm3ji4zr2w13ddkq0lqk65vnd6ah-extra-1.8.1
  18664. 1465.55 s [extra] Executables installed in:
  18665. 1465.55 s [extra] /nix/store/3k0hvm3ji4zr2w13ddkq0lqk65vnd6ah-extra-1.8.1/bin
  18666. 1465.55 s [extra] Libraries installed in:
  18667. 1465.55 s [extra] /nix/store/3k0hvm3ji4zr2w13ddkq0lqk65vnd6ah-extra-1.8.1/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj
  18668. 1465.55 s [extra] Dynamic Libraries installed in:
  18669. 1465.55 s [extra] /nix/store/3k0hvm3ji4zr2w13ddkq0lqk65vnd6ah-extra-1.8.1/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8
  18670. 1465.55 s [extra] Private executables installed in:
  18671. 1465.55 s [extra] /nix/store/3k0hvm3ji4zr2w13ddkq0lqk65vnd6ah-extra-1.8.1/libexec/x86_64-linux-ghc-9.4.8/extra-1.8.1
  18672. 1465.55 s [extra] Data files installed in:
  18673. 1465.55 s [extra] /nix/store/3k0hvm3ji4zr2w13ddkq0lqk65vnd6ah-extra-1.8.1/share/x86_64-linux-ghc-9.4.8/extra-1.8.1
  18674. 1465.55 s [extra] Documentation installed in:
  18675. 1465.55 s [extra] /nix/store/hmmlkgyklr6cqmfw2p9q5fcbzdszv1z4-extra-1.8.1-doc/share/doc/extra-1.8.1
  18676. 1465.55 s [extra] Configuration files installed in:
  18677. 1465.55 s [extra] /nix/store/3k0hvm3ji4zr2w13ddkq0lqk65vnd6ah-extra-1.8.1/etc
  18678. 1465.55 s [extra] No alex found
  18679. 1465.55 s [extra] Using ar found on system at:
  18680. 1465.55 s [extra] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  18681. 1465.55 s [extra] No c2hs found
  18682. 1465.55 s [extra] No cpphs found
  18683. 1465.55 s [extra] No doctest found
  18684. 1465.55 s [extra] Using gcc version 14.3.0 given by user at:
  18685. 1465.55 s [extra] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  18686. 1465.55 s [extra] Using ghc version 9.4.8 found on system at:
  18687. 1465.55 s [extra] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/ghc
  18688. 1465.55 s [extra] Using ghc-pkg version 9.4.8 found on system at:
  18689. 1465.55 s [extra] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/ghc-pkg-9.4.8
  18690. 1465.55 s [extra] No ghcjs found
  18691. 1465.55 s [extra] No ghcjs-pkg found
  18692. 1465.55 s [extra] No greencard found
  18693. 1465.55 s [extra] Using haddock version 2.27.0 found on system at:
  18694. 1465.55 s [extra] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/haddock-ghc-9.4.8
  18695. 1465.55 s [extra] No happy found
  18696. 1465.55 s [extra] Using haskell-suite found on system at: haskell-suite-dummy-location
  18697. 1465.55 s [extra] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  18698. 1465.55 s [extra] No hmake found
  18699. 1465.55 s [extra] Using hpc version 0.68 found on system at:
  18700. 1465.55 s [extra] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/hpc
  18701. 1465.55 s [extra] Using hsc2hs version 0.68.8 found on system at:
  18702. 1465.55 s [extra] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/hsc2hs
  18703. 1465.55 s [extra] Using hscolour version 1.25 found on system at:
  18704. 1465.55 s [extra] /nix/store/87hdxxa93g58b2w9ylr2idn2a40i3fdc-hscolour-1.25/bin/HsColour
  18705. 1465.55 s [extra] No jhc found
  18706. 1465.55 s [extra] Using ld found on system at:
  18707. 1465.55 s [extra] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ld.gold
  18708. 1465.55 s [extra] No pkg-config found
  18709. 1465.55 s [extra] Using runghc version 9.4.8 found on system at:
  18710. 1465.55 s [extra] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/runghc-9.4.8
  18711. 1465.55 s [extra] Using strip version 2.44 found on system at:
  18712. 1465.55 s [extra] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  18713. 1465.55 s [extra] Using tar found on system at:
  18714. 1465.55 s [extra] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  18715. 1465.55 s [extra] No uhc found
  18716. 1465.57 s [extra] Phase: buildPhase
  18717. 1465.62 s [extra] Preprocessing library for extra-1.8.1..
  18718. 1465.63 s [extra] Building library for extra-1.8.1..
  18719. 1466.05 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 )
  18720. 1466.52 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 )
  18721. 1466.52 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 )
  18722. 1466.52 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 )
  18723. 1466.52 s [extra] [ 5 of 22] Compiling Numeric.Extra ( src/Numeric/Extra.hs, dist/build/Numeric/Extra.o, dist/build/Numeric/Extra.dyn_o )
  18724. 1466.52 s [extra] [ 6 of 22] Compiling Partial ( src/Partial.hs, dist/build/Partial.o, dist/build/Partial.dyn_o )
  18725. 1466.52 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 )
  18726. 1467.81 s [extra] [ 8 of 22] Compiling Data.Version.Extra ( src/Data/Version/Extra.hs, dist/build/Data/Version/Extra.o, dist/build/Data/Version/Extra.dyn_o )
  18727. 1467.86 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 )
  18728. 1467.94 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 )
  18729. 1467.94 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 )
  18730. 1467.94 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 )
  18731. 1468.21 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 )
  18732. 1468.32 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 )
  18733. 1468.49 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 )
  18734. 1468.49 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 )
  18735. 1468.49 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 )
  18736. 1468.71 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 )
  18737. 1468.71 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 )
  18738. 1468.76 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 )
  18739. 1468.76 s [extra] [21 of 22] Compiling Extra ( src/Extra.hs, dist/build/Extra.o, dist/build/Extra.dyn_o )
  18740. 1468.81 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 )
  18741. 1469.32 s [extra] [ 1 of 22] Compiling Data.IORef.Extra ( src/Data/IORef/Extra.hs, dist/build/Data/IORef/Extra.p_o )
  18742. 1469.60 s [extra] [ 2 of 22] Compiling Data.Monoid.Extra ( src/Data/Monoid/Extra.hs, dist/build/Data/Monoid/Extra.p_o )
  18743. 1469.60 s [extra] [ 3 of 22] Compiling Data.Tuple.Extra ( src/Data/Tuple/Extra.hs, dist/build/Data/Tuple/Extra.p_o )
  18744. 1469.63 s [extra] [ 4 of 22] Compiling Data.Typeable.Extra ( src/Data/Typeable/Extra.hs, dist/build/Data/Typeable/Extra.p_o )
  18745. 1469.63 s [extra] [ 5 of 22] Compiling Numeric.Extra ( src/Numeric/Extra.hs, dist/build/Numeric/Extra.p_o )
  18746. 1469.63 s [extra] [ 6 of 22] Compiling Partial ( src/Partial.hs, dist/build/Partial.p_o )
  18747. 1469.63 s [extra] [ 7 of 22] Compiling Data.List.Extra ( src/Data/List/Extra.hs, dist/build/Data/List/Extra.p_o )
  18748. 1471.01 s [extra] [ 8 of 22] Compiling Data.Version.Extra ( src/Data/Version/Extra.hs, dist/build/Data/Version/Extra.p_o )
  18749. 1471.18 s [extra] [ 9 of 22] Compiling Data.List.NonEmpty.Extra ( src/Data/List/NonEmpty/Extra.hs, dist/build/Data/List/NonEmpty/Extra.p_o )
  18750. 1471.26 s [extra] [10 of 22] Compiling Data.Either.Extra ( src/Data/Either/Extra.hs, dist/build/Data/Either/Extra.p_o )
  18751. 1471.26 s [extra] [11 of 22] Compiling Control.Exception.Extra ( src/Control/Exception/Extra.hs, dist/build/Control/Exception/Extra.p_o )
  18752. 1471.26 s [extra] [12 of 22] Compiling Control.Monad.Extra ( src/Control/Monad/Extra.hs, dist/build/Control/Monad/Extra.p_o )
  18753. 1471.56 s [extra] [13 of 22] Compiling Data.Foldable.Extra ( src/Data/Foldable/Extra.hs, dist/build/Data/Foldable/Extra.p_o )
  18754. 1471.74 s [extra] [14 of 22] Compiling Control.Concurrent.Extra ( src/Control/Concurrent/Extra.hs, dist/build/Control/Concurrent/Extra.p_o )
  18755. 1471.94 s [extra] [15 of 22] Compiling System.Directory.Extra ( src/System/Directory/Extra.hs, dist/build/System/Directory/Extra.p_o )
  18756. 1471.94 s [extra] [16 of 22] Compiling System.Environment.Extra ( src/System/Environment/Extra.hs, dist/build/System/Environment/Extra.p_o )
  18757. 1471.94 s [extra] [17 of 22] Compiling System.IO.Extra ( src/System/IO/Extra.hs, dist/build/System/IO/Extra.p_o )
  18758. 1472.21 s [extra] [18 of 22] Compiling System.Info.Extra ( src/System/Info/Extra.hs, dist/build/System/Info/Extra.p_o )
  18759. 1472.21 s [extra] [19 of 22] Compiling System.Process.Extra ( src/System/Process/Extra.hs, dist/build/System/Process/Extra.p_o )
  18760. 1472.37 s [extra] [20 of 22] Compiling System.Time.Extra ( src/System/Time/Extra.hs, dist/build/System/Time/Extra.p_o )
  18761. 1472.37 s [extra] [21 of 22] Compiling Extra ( src/Extra.hs, dist/build/Extra.p_o )
  18762. 1472.50 s [extra] [22 of 22] Compiling Text.Read.Extra ( src/Text/Read/Extra.hs, dist/build/Text/Read/Extra.p_o )
  18763. 1473.52 s [extra] Preprocessing test suite 'extra-test' for extra-1.8.1..
  18764. 1473.52 s [extra] Building test suite 'extra-test' for extra-1.8.1..
  18765. 1473.60 s [extra] [1 of 4] Compiling TestUtil ( test/TestUtil.hs, dist/build/extra-test/extra-test-tmp/TestUtil.o )
  18766. 1473.94 s [extra] [2 of 4] Compiling TestGen ( test/TestGen.hs, dist/build/extra-test/extra-test-tmp/TestGen.o )
  18767. 1476.19 s [extra] [3 of 4] Compiling TestCustom ( test/TestCustom.hs, dist/build/extra-test/extra-test-tmp/TestCustom.o )
  18768. 1476.19 s [extra] [4 of 4] Compiling Test ( test/Test.hs, dist/build/extra-test/extra-test-tmp/Test.o )
  18769. 1476.58 s [extra] [5 of 5] Linking dist/build/extra-test/extra-test
  18770. 1477.47 s [extra] Phase: checkPhase
  18771. 1478.02 s [extra] Running 1 test suites...
  18772. 1478.02 s [extra] Test suite extra-test: RUNNING...
  18773. 1478.03 s [extra] withTempFile
  18774. 1478.03 s [extra] +++ OK, passed 100 tests.
  18775. 1478.03 s [extra] captureOutput
  18776. 1478.03 s [extra] +++ OK, passed 100 tests.
  18777. 1478.03 s [extra] \(x :: IO Int) -> void (once x) == pure ()
  18778. 1478.06 s [extra] +++ OK, passed 100 tests.
  18779. 1478.06 s [extra] \(x :: IO Int) -> join (once x) == x
  18780. 1478.10 s [extra] +++ OK, passed 100 tests.
  18781. 1478.10 s [extra] \(x :: IO Int) -> (do y <- once x; y; y) == x
  18782. 1478.13 s [extra] +++ OK, passed 100 tests.
  18783. 1478.13 s [extra] \(x :: IO Int) -> (do y <- once x; y ||| y) == x
  18784. 1478.19 s [extra] +++ OK, passed 100 tests.
  18785. 1478.19 s [extra] \(x :: IO Int) -> join (onceFork x) == x
  18786. 1478.22 s [extra] +++ OK, passed 100 tests.
  18787. 1478.22 s [extra] \(x :: IO Int) -> (do a <- onceFork x; a; a) == x
  18788. 1478.26 s [extra] +++ OK, passed 100 tests.
  18789. 1478.26 s [extra] stringException "test" == pure "test"
  18790. 1478.26 s [extra] +++ OK, passed 100 tests.
  18791. 1478.26 s [extra] stringException ("test" ++ undefined) == pure "test<Exception>"
  18792. 1478.26 s [extra] +++ OK, passed 100 tests.
  18793. 1478.26 s [extra] stringException ("test" ++ undefined ++ "hello") == pure "test<Exception>"
  18794. 1478.26 s [extra] +++ OK, passed 100 tests.
  18795. 1478.26 s [extra] stringException ['t','e','s','t',undefined] == pure "test<Exception>"
  18796. 1478.26 s [extra] +++ OK, passed 100 tests.
  18797. 1478.26 s [extra] ignore (print 1) == print 1
  18798. 1478.26 s [extra] +++ OK, passed 100 tests.
  18799. 1478.26 s [extra] ignore (fail "die") == pure ()
  18800. 1478.26 s [extra] +++ OK, passed 100 tests.
  18801. 1478.26 s [extra] catch (errorIO "Hello") (\(ErrorCall x) -> pure x) == pure "Hello"
  18802. 1478.26 s [extra] +++ OK, passed 100 tests.
  18803. 1478.26 s [extra] seq (errorIO "foo") (print 1) == print 1
  18804. 1478.26 s [extra] +++ OK, passed 100 tests.
  18805. 1478.26 s [extra] catch (assertIO True >> pure 1) (\(x :: AssertionFailed) -> pure 2) == pure 1
  18806. 1478.26 s [extra] +++ OK, passed 100 tests.
  18807. 1478.26 s [extra] seq (assertIO False) (print 1) == print 1
  18808. 1478.26 s [extra] +++ OK, passed 100 tests.
  18809. 1478.26 s [extra] retry 1 (print "x") == print "x"
  18810. 1478.26 s [extra] +++ OK, passed 100 tests.
  18811. 1478.26 s [extra] retry 3 (fail "die") == fail "die"
  18812. 1478.26 s [extra] +++ OK, passed 100 tests.
  18813. 1478.26 s [extra] whenJust Nothing print == pure ()
  18814. 1478.27 s [extra] +++ OK, passed 100 tests.
  18815. 1478.27 s [extra] whenJust (Just 1) print == print 1
  18816. 1478.27 s [extra] +++ OK, passed 100 tests.
  18817. 1478.27 s [extra] pureIf @Maybe True 5 == Just 5
  18818. 1478.27 s [extra] +++ OK, passed 100 tests.
  18819. 1478.27 s [extra] pureIf @Maybe False 5 == Nothing
  18820. 1478.27 s [extra] +++ OK, passed 100 tests.
  18821. 1478.27 s [extra] pureIf @[] True 5 == [5]
  18822. 1478.27 s [extra] +++ OK, passed 100 tests.
  18823. 1478.27 s [extra] pureIf @[] False 5 == []
  18824. 1478.27 s [extra] +++ OK, passed 100 tests.
  18825. 1478.27 s [extra] whenMaybe True (print 1) == fmap Just (print 1)
  18826. 1478.27 s [extra] +++ OK, passed 100 tests.
  18827. 1478.27 s [extra] whenMaybe False (print 1) == pure Nothing
  18828. 1478.27 s [extra] +++ OK, passed 100 tests.
  18829. 1478.27 s [extra] \(x :: Maybe ()) -> unit x == x
  18830. 1478.27 s [extra] +++ OK, passed 100 tests.
  18831. 1478.27 s [extra] guarded even 2 == [2]
  18832. 1478.27 s [extra] +++ OK, passed 100 tests.
  18833. 1478.27 s [extra] guarded odd 2 == Nothing
  18834. 1478.27 s [extra] +++ OK, passed 100 tests.
  18835. 1478.27 s [extra] guarded (not.null) "My Name" == Just "My Name"
  18836. 1478.27 s [extra] +++ OK, passed 100 tests.
  18837. 1478.27 s [extra] guardedA (return . even) 42 == Just [42]
  18838. 1478.27 s [extra] +++ OK, passed 100 tests.
  18839. 1478.27 s [extra] guardedA (return . odd) 42 == Just []
  18840. 1478.27 s [extra] +++ OK, passed 100 tests.
  18841. 1478.27 s [extra] guardedA (const Nothing) 42 == (Nothing :: Maybe [Int])
  18842. 1478.27 s [extra] +++ OK, passed 100 tests.
  18843. 1478.27 s [extra] fold1M (\x y -> Just x) [] == undefined
  18844. 1478.27 s [extra] +++ OK, passed 100 tests.
  18845. 1478.27 s [extra] fold1M (\x y -> Just $ x + y) [1, 2, 3] == Just 6
  18846. 1478.27 s [extra] +++ OK, passed 100 tests.
  18847. 1478.27 s [extra] partitionM (Just . even) [1,2,3] == Just ([2], [1,3])
  18848. 1478.27 s [extra] +++ OK, passed 100 tests.
  18849. 1478.27 s [extra] partitionM (const Nothing) [1,2,3] == Nothing
  18850. 1478.27 s [extra] +++ OK, passed 100 tests.
  18851. 1478.27 s [extra] loop (\x -> if x < 10 then Left $ x * 2 else Right $ show x) 1 == "16"
  18852. 1478.27 s [extra] +++ OK, passed 100 tests.
  18853. 1478.27 s [extra] Just True ||^ undefined == Just True
  18854. 1478.27 s [extra] +++ OK, passed 100 tests.
  18855. 1478.27 s [extra] Just False ||^ Just True == Just True
  18856. 1478.27 s [extra] +++ OK, passed 100 tests.
  18857. 1478.27 s [extra] Just False ||^ Just False == Just False
  18858. 1478.27 s [extra] +++ OK, passed 100 tests.
  18859. 1478.27 s [extra] Just False &&^ undefined == Just False
  18860. 1478.27 s [extra] +++ OK, passed 100 tests.
  18861. 1478.27 s [extra] Just True &&^ Just True == Just True
  18862. 1478.27 s [extra] +++ OK, passed 100 tests.
  18863. 1478.27 s [extra] Just True &&^ Just False == Just False
  18864. 1478.27 s [extra] +++ OK, passed 100 tests.
  18865. 1478.27 s [extra] anyM Just [False,True ,undefined] == Just True
  18866. 1478.27 s [extra] +++ OK, passed 100 tests.
  18867. 1478.27 s [extra] anyM Just [False,False,undefined] == undefined
  18868. 1478.27 s [extra] +++ OK, passed 100 tests.
  18869. 1478.27 s [extra] \(f :: Int -> Maybe Bool) xs -> anyM f xs == orM (map f xs)
  18870. 1478.27 s [extra] +++ OK, passed 100 tests.
  18871. 1478.27 s [extra] allM Just [True,False,undefined] == Just False
  18872. 1478.27 s [extra] +++ OK, passed 100 tests.
  18873. 1478.27 s [extra] allM Just [True,True ,undefined] == undefined
  18874. 1478.27 s [extra] +++ OK, passed 100 tests.
  18875. 1478.27 s [extra] \(f :: Int -> Maybe Bool) xs -> anyM f xs == orM (map f xs)
  18876. 1478.27 s [extra] +++ OK, passed 100 tests.
  18877. 1478.27 s [extra] orM [Just False,Just True ,undefined] == Just True
  18878. 1478.27 s [extra] +++ OK, passed 100 tests.
  18879. 1478.27 s [extra] orM [Just False,Just False,undefined] == undefined
  18880. 1478.27 s [extra] +++ OK, passed 100 tests.
  18881. 1478.27 s [extra] \xs -> Just (or xs) == orM (map Just xs)
  18882. 1478.27 s [extra] +++ OK, passed 100 tests.
  18883. 1478.27 s [extra] andM [Just True,Just False,undefined] == Just False
  18884. 1478.27 s [extra] +++ OK, passed 100 tests.
  18885. 1478.27 s [extra] andM [Just True,Just True ,undefined] == undefined
  18886. 1478.27 s [extra] +++ OK, passed 100 tests.
  18887. 1478.27 s [extra] \xs -> Just (and xs) == andM (map Just xs)
  18888. 1478.27 s [extra] +++ OK, passed 100 tests.
  18889. 1478.27 s [extra] findM (Just . isUpper) "teST" == Just (Just 'S')
  18890. 1478.27 s [extra] +++ OK, passed 100 tests.
  18891. 1478.27 s [extra] findM (Just . isUpper) "test" == Just Nothing
  18892. 1478.27 s [extra] +++ OK, passed 100 tests.
  18893. 1478.27 s [extra] findM (Just . const True) ["x",undefined] == Just (Just "x")
  18894. 1478.27 s [extra] +++ OK, passed 100 tests.
  18895. 1478.27 s [extra] fromLeft 1 (Left 3) == 3
  18896. 1478.27 s [extra] +++ OK, passed 100 tests.
  18897. 1478.27 s [extra] fromLeft 1 (Right "foo") == 1
  18898. 1478.27 s [extra] +++ OK, passed 100 tests.
  18899. 1478.27 s [extra] fromRight 1 (Right 3) == 3
  18900. 1478.28 s [extra] +++ OK, passed 100 tests.
  18901. 1478.28 s [extra] fromRight 1 (Left "foo") == 1
  18902. 1478.29 s [extra] +++ OK, passed 100 tests.
  18903. 1478.29 s [extra] \x -> fromLeft' (Left x) == x
  18904. 1478.29 s [extra] +++ OK, passed 100 tests.
  18905. 1478.29 s [extra] \x -> fromLeft' (Right x) == undefined
  18906. 1478.29 s [extra] +++ OK, passed 100 tests.
  18907. 1478.29 s [extra] \x -> fromRight' (Right x) == x
  18908. 1478.29 s [extra] +++ OK, passed 100 tests.
  18909. 1478.29 s [extra] \x -> fromRight' (Left x) == undefined
  18910. 1478.29 s [extra] +++ OK, passed 100 tests.
  18911. 1478.29 s [extra] \x -> fromEither (Left x ) == x
  18912. 1478.29 s [extra] +++ OK, passed 100 tests.
  18913. 1478.29 s [extra] \x -> fromEither (Right x) == x
  18914. 1478.29 s [extra] +++ OK, passed 100 tests.
  18915. 1478.29 s [extra] \a b -> maybeToEither a (Just b) == Right b
  18916. 1478.29 s [extra] +++ OK, passed 100 tests.
  18917. 1478.29 s [extra] \a -> maybeToEither a Nothing == Left a
  18918. 1478.29 s [extra] +++ OK, passed 100 tests.
  18919. 1478.29 s [extra] \x -> eitherToMaybe (Left x) == Nothing
  18920. 1478.29 s [extra] +++ OK, passed 100 tests.
  18921. 1478.29 s [extra] \x -> eitherToMaybe (Right x) == Just x
  18922. 1478.29 s [extra] +++ OK, passed 100 tests.
  18923. 1478.29 s [extra] mapLeft show (Left 1) == Left "1"
  18924. 1478.29 s [extra] +++ OK, passed 100 tests.
  18925. 1478.29 s [extra] mapLeft show (Right True) == Right True
  18926. 1478.29 s [extra] +++ OK, passed 100 tests.
  18927. 1478.29 s [extra] mapRight show (Left 1) == Left 1
  18928. 1478.29 s [extra] +++ OK, passed 100 tests.
  18929. 1478.29 s [extra] mapRight show (Right True) == Right "True"
  18930. 1478.29 s [extra] +++ OK, passed 100 tests.
  18931. 1478.29 s [extra] \xs -> repeatedly (splitAt 3) xs == chunksOf 3 xs
  18932. 1478.29 s [extra] +++ OK, passed 100 tests.
  18933. 1478.29 s [extra] \xs -> repeatedly word1 (trim xs) == words xs
  18934. 1478.29 s [extra] +++ OK, passed 100 tests.
  18935. 1478.29 s [extra] \xs -> repeatedly line1 xs == lines xs
  18936. 1478.29 s [extra] +++ OK, passed 100 tests.
  18937. 1478.29 s [extra] disjoint [1,2,3] [4,5] == True
  18938. 1478.29 s [extra] +++ OK, passed 100 tests.
  18939. 1478.29 s [extra] disjoint [1,2,3] [4,1] == False
  18940. 1478.29 s [extra] +++ OK, passed 100 tests.
  18941. 1478.29 s [extra] disjointOrd [1,2,3] [4,5] == True
  18942. 1478.29 s [extra] +++ OK, passed 100 tests.
  18943. 1478.29 s [extra] disjointOrd [1,2,3] [4,1] == False
  18944. 1478.29 s [extra] +++ OK, passed 100 tests.
  18945. 1478.29 s [extra] disjointOrdBy (compare `on` (`mod` 7)) [1,2,3] [4,5] == True
  18946. 1478.29 s [extra] +++ OK, passed 100 tests.
  18947. 1478.29 s [extra] disjointOrdBy (compare `on` (`mod` 7)) [1,2,3] [4,8] == False
  18948. 1478.29 s [extra] +++ OK, passed 100 tests.
  18949. 1478.29 s [extra] anySame [1,1,2] == True
  18950. 1478.29 s [extra] +++ OK, passed 100 tests.
  18951. 1478.29 s [extra] anySame [1,2,3] == False
  18952. 1478.29 s [extra] +++ OK, passed 100 tests.
  18953. 1478.29 s [extra] anySame (1:2:1:undefined) == True
  18954. 1478.29 s [extra] +++ OK, passed 100 tests.
  18955. 1478.29 s [extra] anySame [] == False
  18956. 1478.29 s [extra] +++ OK, passed 100 tests.
  18957. 1478.29 s [extra] \xs -> anySame xs == (length (nub xs) < length xs)
  18958. 1478.29 s [extra] +++ OK, passed 100 tests.
  18959. 1478.29 s [extra] allSame [1,1,2] == False
  18960. 1478.29 s [extra] +++ OK, passed 100 tests.
  18961. 1478.29 s [extra] allSame [1,1,1] == True
  18962. 1478.29 s [extra] +++ OK, passed 100 tests.
  18963. 1478.29 s [extra] allSame [1] == True
  18964. 1478.29 s [extra] +++ OK, passed 100 tests.
  18965. 1478.29 s [extra] allSame [] == True
  18966. 1478.29 s [extra] +++ OK, passed 100 tests.
  18967. 1478.29 s [extra] allSame (1:1:2:undefined) == False
  18968. 1478.29 s [extra] +++ OK, passed 100 tests.
  18969. 1478.29 s [extra] \xs -> allSame xs == (length (nub xs) <= 1)
  18970. 1478.29 s [extra] +++ OK, passed 100 tests.
  18971. 1478.29 s [extra] headDef 1 [] == 1
  18972. 1478.29 s [extra] +++ OK, passed 100 tests.
  18973. 1478.29 s [extra] headDef 1 [2,3,4] == 2
  18974. 1478.29 s [extra] +++ OK, passed 100 tests.
  18975. 1478.29 s [extra] \x xs -> headDef x xs == fromMaybe x (listToMaybe xs)
  18976. 1478.30 s [extra] +++ OK, passed 100 tests.
  18977. 1478.30 s [extra] lastDef 1 [] == 1
  18978. 1478.30 s [extra] +++ OK, passed 100 tests.
  18979. 1478.30 s [extra] lastDef 1 [2,3,4] == 4
  18980. 1478.30 s [extra] +++ OK, passed 100 tests.
  18981. 1478.30 s [extra] \x xs -> lastDef x xs == last (x:xs)
  18982. 1478.30 s [extra] +++ OK, passed 100 tests.
  18983. 1478.30 s [extra] [2,3,4] !? 1 == Just 3
  18984. 1478.30 s [extra] +++ OK, passed 100 tests.
  18985. 1478.30 s [extra] [2,3,4] !? (-1) == Nothing
  18986. 1478.30 s [extra] +++ OK, passed 100 tests.
  18987. 1478.30 s [extra] [] !? 0 == Nothing
  18988. 1478.30 s [extra] +++ OK, passed 100 tests.
  18989. 1478.30 s [extra] notNull [] == False
  18990. 1478.30 s [extra] +++ OK, passed 100 tests.
  18991. 1478.30 s [extra] notNull [1] == True
  18992. 1478.30 s [extra] +++ OK, passed 100 tests.
  18993. 1478.30 s [extra] \xs -> notNull xs == not (null xs)
  18994. 1478.30 s [extra] +++ OK, passed 100 tests.
  18995. 1478.30 s [extra] list 1 (\v _ -> v - 2) [5,6,7] == 3
  18996. 1478.30 s [extra] +++ OK, passed 100 tests.
  18997. 1478.30 s [extra] list 1 (\v _ -> v - 2) [] == 1
  18998. 1478.30 s [extra] +++ OK, passed 100 tests.
  18999. 1478.30 s [extra] \nil cons xs -> maybe nil (uncurry cons) (uncons xs) == list nil cons xs
  19000. 1478.30 s [extra] +++ OK, passed 100 tests.
  19001. 1478.30 s [extra] unsnoc "test" == Just ("tes",'t')
  19002. 1478.30 s [extra] +++ OK, passed 100 tests.
  19003. 1478.30 s [extra] unsnoc "" == Nothing
  19004. 1478.30 s [extra] +++ OK, passed 100 tests.
  19005. 1478.30 s [extra] \xs -> unsnoc xs == if null xs then Nothing else Just (init xs, last xs)
  19006. 1478.30 s [extra] +++ OK, passed 100 tests.
  19007. 1478.30 s [extra] cons 't' "est" == "test"
  19008. 1478.30 s [extra] +++ OK, passed 100 tests.
  19009. 1478.30 s [extra] \x xs -> uncons (cons x xs) == Just (x,xs)
  19010. 1478.30 s [extra] +++ OK, passed 100 tests.
  19011. 1478.30 s [extra] snoc "tes" 't' == "test"
  19012. 1478.30 s [extra] +++ OK, passed 100 tests.
  19013. 1478.30 s [extra] \xs x -> unsnoc (snoc xs x) == Just (xs,x)
  19014. 1478.30 s [extra] +++ OK, passed 100 tests.
  19015. 1478.30 s [extra] enumerate == [False, True]
  19016. 1478.30 s [extra] +++ OK, passed 100 tests.
  19017. 1478.30 s [extra] takeEnd 3 "hello" == "llo"
  19018. 1478.30 s [extra] +++ OK, passed 100 tests.
  19019. 1478.30 s [extra] takeEnd 5 "bye" == "bye"
  19020. 1478.30 s [extra] +++ OK, passed 100 tests.
  19021. 1478.30 s [extra] takeEnd (-1) "bye" == ""
  19022. 1478.30 s [extra] +++ OK, passed 100 tests.
  19023. 1478.30 s [extra] \i xs -> takeEnd i xs `isSuffixOf` xs
  19024. 1478.30 s [extra] +++ OK, passed 100 tests.
  19025. 1478.30 s [extra] \i xs -> length (takeEnd i xs) == min (max 0 i) (length xs)
  19026. 1478.30 s [extra] +++ OK, passed 100 tests.
  19027. 1478.30 s [extra] dropEnd 3 "hello" == "he"
  19028. 1478.30 s [extra] +++ OK, passed 100 tests.
  19029. 1478.30 s [extra] dropEnd 5 "bye" == ""
  19030. 1478.30 s [extra] +++ OK, passed 100 tests.
  19031. 1478.30 s [extra] dropEnd (-1) "bye" == "bye"
  19032. 1478.30 s [extra] +++ OK, passed 100 tests.
  19033. 1478.30 s [extra] \i xs -> dropEnd i xs `isPrefixOf` xs
  19034. 1478.30 s [extra] +++ OK, passed 100 tests.
  19035. 1478.30 s [extra] \i xs -> length (dropEnd i xs) == max 0 (length xs - max 0 i)
  19036. 1478.30 s [extra] +++ OK, passed 100 tests.
  19037. 1478.30 s [extra] \i -> take 3 (dropEnd 5 [i..]) == take 3 [i..]
  19038. 1478.30 s [extra] +++ OK, passed 100 tests.
  19039. 1478.30 s [extra] splitAtEnd 3 "hello" == ("he","llo")
  19040. 1478.30 s [extra] +++ OK, passed 100 tests.
  19041. 1478.30 s [extra] splitAtEnd 3 "he" == ("", "he")
  19042. 1478.30 s [extra] +++ OK, passed 100 tests.
  19043. 1478.30 s [extra] \i xs -> uncurry (++) (splitAt i xs) == xs
  19044. 1478.31 s [extra] +++ OK, passed 100 tests.
  19045. 1478.31 s [extra] \i xs -> splitAtEnd i xs == (dropEnd i xs, takeEnd i xs)
  19046. 1478.31 s [extra] +++ OK, passed 100 tests.
  19047. 1478.31 s [extra] \i xs -> zip [i..] xs == zipFrom i xs
  19048. 1478.31 s [extra] +++ OK, passed 100 tests.
  19049. 1478.31 s [extra] zipFrom False [1..3] == [(False,1),(True, 2)]
  19050. 1478.31 s [extra] +++ OK, passed 100 tests.
  19051. 1478.31 s [extra] \i xs -> zipWithFrom (,) i xs == zipFrom i xs
  19052. 1478.31 s [extra] +++ OK, passed 100 tests.
  19053. 1478.31 s [extra] concatUnzip [("a","AB"),("bc","C")] == ("abc","ABC")
  19054. 1478.31 s [extra] +++ OK, passed 100 tests.
  19055. 1478.31 s [extra] concatUnzip3 [("a","AB",""),("bc","C","123")] == ("abc","ABC","123")
  19056. 1478.31 s [extra] +++ OK, passed 100 tests.
  19057. 1478.31 s [extra] takeWhileEnd even [2,3,4,6] == [4,6]
  19058. 1478.31 s [extra] +++ OK, passed 100 tests.
  19059. 1478.31 s [extra] trim " hello " == "hello"
  19060. 1478.31 s [extra] +++ OK, passed 100 tests.
  19061. 1478.31 s [extra] trimStart " hello " == "hello "
  19062. 1478.31 s [extra] +++ OK, passed 100 tests.
  19063. 1478.31 s [extra] trimEnd " hello " == " hello"
  19064. 1478.31 s [extra] +++ OK, passed 100 tests.
  19065. 1478.31 s [extra] \s -> trim s == trimEnd (trimStart s)
  19066. 1478.31 s [extra] +++ OK, passed 100 tests.
  19067. 1478.31 s [extra] lower "This is A TEST" == "this is a test"
  19068. 1478.31 s [extra] +++ OK, passed 100 tests.
  19069. 1478.31 s [extra] lower "" == ""
  19070. 1478.31 s [extra] +++ OK, passed 100 tests.
  19071. 1478.31 s [extra] upper "This is A TEST" == "THIS IS A TEST"
  19072. 1478.31 s [extra] +++ OK, passed 100 tests.
  19073. 1478.31 s [extra] upper "" == ""
  19074. 1478.31 s [extra] +++ OK, passed 100 tests.
  19075. 1478.31 s [extra] word1 "" == ("", "")
  19076. 1478.31 s [extra] +++ OK, passed 100 tests.
  19077. 1478.31 s [extra] word1 "keyword rest of string" == ("keyword","rest of string")
  19078. 1478.31 s [extra] +++ OK, passed 100 tests.
  19079. 1478.31 s [extra] word1 " keyword\n rest of string" == ("keyword","rest of string")
  19080. 1478.31 s [extra] +++ OK, passed 100 tests.
  19081. 1478.31 s [extra] \s -> fst (word1 s) == concat (take 1 $ words s)
  19082. 1478.31 s [extra] +++ OK, passed 100 tests.
  19083. 1478.31 s [extra] \s -> words (snd $ word1 s) == drop 1 (words s)
  19084. 1478.31 s [extra] +++ OK, passed 100 tests.
  19085. 1478.31 s [extra] line1 "" == ("", "")
  19086. 1478.31 s [extra] +++ OK, passed 100 tests.
  19087. 1478.31 s [extra] line1 "test" == ("test","")
  19088. 1478.31 s [extra] +++ OK, passed 100 tests.
  19089. 1478.31 s [extra] line1 "test\n" == ("test","")
  19090. 1478.31 s [extra] +++ OK, passed 100 tests.
  19091. 1478.31 s [extra] line1 "test\nrest" == ("test","rest")
  19092. 1478.31 s [extra] +++ OK, passed 100 tests.
  19093. 1478.31 s [extra] line1 "test\nrest\nmore" == ("test","rest\nmore")
  19094. 1478.31 s [extra] +++ OK, passed 100 tests.
  19095. 1478.31 s [extra] escapeHTML "this is a test" == "this is a test"
  19096. 1478.31 s [extra] +++ OK, passed 100 tests.
  19097. 1478.31 s [extra] escapeHTML "<b>\"g&t\"</n>" == "&lt;b&gt;&quot;g&amp;t&quot;&lt;/n&gt;"
  19098. 1478.31 s [extra] +++ OK, passed 100 tests.
  19099. 1478.31 s [extra] escapeHTML "t'was another test" == "t&#39;was another test"
  19100. 1478.31 s [extra] +++ OK, passed 100 tests.
  19101. 1478.31 s [extra] \xs -> unescapeHTML (escapeHTML xs) == xs
  19102. 1478.31 s [extra] +++ OK, passed 100 tests.
  19103. 1478.31 s [extra] escapeJSON "this is a test" == "this is a test"
  19104. 1478.31 s [extra] +++ OK, passed 100 tests.
  19105. 1478.31 s [extra] escapeJSON "\ttab\nnewline\\" == "\\ttab\\nnewline\\\\"
  19106. 1478.31 s [extra] +++ OK, passed 100 tests.
  19107. 1478.31 s [extra] escapeJSON "\ESC[0mHello" == "\\u001b[0mHello"
  19108. 1478.31 s [extra] +++ OK, passed 100 tests.
  19109. 1478.31 s [extra] \xs -> unescapeJSON (escapeJSON xs) == xs
  19110. 1478.31 s [extra] +++ OK, passed 100 tests.
  19111. 1478.32 s [extra] groupOn abs [1,-1,2] == [[1,-1], [2]]
  19112. 1478.32 s [extra] +++ OK, passed 100 tests.
  19113. 1478.32 s [extra] groupOnKey abs [1,-1,2] == [(1, [1,-1]), (2, [2])]
  19114. 1478.32 s [extra] +++ OK, passed 100 tests.
  19115. 1478.32 s [extra] maximumOn id [] == undefined
  19116. 1478.32 s [extra] +++ OK, passed 100 tests.
  19117. 1478.32 s [extra] maximumOn length ["test","extra","a"] == "extra"
  19118. 1478.32 s [extra] +++ OK, passed 100 tests.
  19119. 1478.32 s [extra] minimumOn id [] == undefined
  19120. 1478.32 s [extra] +++ OK, passed 100 tests.
  19121. 1478.32 s [extra] minimumOn length ["test","extra","a"] == "a"
  19122. 1478.32 s [extra] +++ OK, passed 100 tests.
  19123. 1478.32 s [extra] groupSort [(1,'t'),(3,'t'),(2,'e'),(2,'s')] == [(1,"t"),(2,"es"),(3,"t")]
  19124. 1478.32 s [extra] +++ OK, passed 100 tests.
  19125. 1478.32 s [extra] \xs -> map fst (groupSort xs) == sort (nub (map fst xs))
  19126. 1478.32 s [extra] +++ OK, passed 100 tests.
  19127. 1478.32 s [extra] \xs -> concatMap snd (groupSort xs) == map snd (sortOn fst xs)
  19128. 1478.32 s [extra] +++ OK, passed 100 tests.
  19129. 1478.32 s [extra] groupSortOn length ["test","of","sized","item"] == [["of"],["test","item"],["sized"]]
  19130. 1478.32 s [extra] +++ OK, passed 100 tests.
  19131. 1478.32 s [extra] groupSortBy (compare `on` length) ["test","of","sized","item"] == [["of"],["test","item"],["sized"]]
  19132. 1478.32 s [extra] +++ OK, passed 100 tests.
  19133. 1478.32 s [extra] sum' [1, 2, 3] == 6
  19134. 1478.32 s [extra] +++ OK, passed 100 tests.
  19135. 1478.32 s [extra] sumOn' read ["1", "2", "3"] == 6
  19136. 1478.32 s [extra] +++ OK, passed 100 tests.
  19137. 1478.32 s [extra] product' [1, 2, 4] == 8
  19138. 1478.32 s [extra] +++ OK, passed 100 tests.
  19139. 1478.32 s [extra] productOn' read ["1", "2", "4"] == 8
  19140. 1478.32 s [extra] +++ OK, passed 100 tests.
  19141. 1478.32 s [extra] merge "ace" "bd" == "abcde"
  19142. 1478.32 s [extra] +++ OK, passed 100 tests.
  19143. 1478.32 s [extra] \xs ys -> merge (sort xs) (sort ys) == sort (xs ++ ys)
  19144. 1478.32 s [extra] +++ OK, passed 100 tests.
  19145. 1478.32 s [extra] replace "el" "_" "Hello Bella" == "H_lo B_la"
  19146. 1478.32 s [extra] +++ OK, passed 100 tests.
  19147. 1478.32 s [extra] replace "el" "e" "Hello" == "Helo"
  19148. 1478.32 s [extra] +++ OK, passed 100 tests.
  19149. 1478.32 s [extra] replace "" "x" "Hello" == "xHxexlxlxox"
  19150. 1478.32 s [extra] +++ OK, passed 100 tests.
  19151. 1478.32 s [extra] replace "" "x" "" == "x"
  19152. 1478.32 s [extra] +++ OK, passed 100 tests.
  19153. 1478.32 s [extra] \xs ys -> replace xs xs ys == ys
  19154. 1478.32 s [extra] +++ OK, passed 100 tests.
  19155. 1478.32 s [extra] breakEnd isLower "youRE" == ("you","RE")
  19156. 1478.32 s [extra] +++ OK, passed 100 tests.
  19157. 1478.32 s [extra] breakEnd isLower "youre" == ("youre","")
  19158. 1478.32 s [extra] +++ OK, passed 100 tests.
  19159. 1478.32 s [extra] breakEnd isLower "YOURE" == ("","YOURE")
  19160. 1478.32 s [extra] +++ OK, passed 100 tests.
  19161. 1478.32 s [extra] \f xs -> breakEnd (not . f) xs == spanEnd f xs
  19162. 1478.33 s [extra] +++ OK, passed 100 tests.
  19163. 1478.33 s [extra] spanEnd isUpper "youRE" == ("you","RE")
  19164. 1478.33 s [extra] +++ OK, passed 100 tests.
  19165. 1478.33 s [extra] spanEnd (not . isSpace) "x y z" == ("x y ","z")
  19166. 1478.33 s [extra] +++ OK, passed 100 tests.
  19167. 1478.33 s [extra] \f xs -> uncurry (++) (spanEnd f xs) == xs
  19168. 1478.33 s [extra] +++ OK, passed 100 tests.
  19169. 1478.33 s [extra] \f xs -> spanEnd f xs == swap (both reverse (span f (reverse xs)))
  19170. 1478.33 s [extra] +++ OK, passed 100 tests.
  19171. 1478.33 s [extra] wordsBy (== ':') "::xyz:abc::123::" == ["xyz","abc","123"]
  19172. 1478.33 s [extra] +++ OK, passed 100 tests.
  19173. 1478.33 s [extra] \s -> wordsBy isSpace s == words s
  19174. 1478.33 s [extra] +++ OK, passed 100 tests.
  19175. 1478.33 s [extra] linesBy (== ':') "::xyz:abc::123::" == ["","","xyz","abc","","123",""]
  19176. 1478.33 s [extra] +++ OK, passed 100 tests.
  19177. 1478.33 s [extra] \s -> linesBy (== '\n') s == lines s
  19178. 1478.33 s [extra] +++ OK, passed 100 tests.
  19179. 1478.33 s [extra] linesBy (== ';') "my;list;here;" == ["my","list","here"]
  19180. 1478.33 s [extra] +++ OK, passed 100 tests.
  19181. 1478.33 s [extra] firstJust id [Nothing,Just 3] == Just 3
  19182. 1478.33 s [extra] +++ OK, passed 100 tests.
  19183. 1478.33 s [extra] firstJust id [Nothing,Nothing] == Nothing
  19184. 1478.33 s [extra] +++ OK, passed 100 tests.
  19185. 1478.33 s [extra] drop1 "" == ""
  19186. 1478.33 s [extra] +++ OK, passed 100 tests.
  19187. 1478.33 s [extra] drop1 "test" == "est"
  19188. 1478.33 s [extra] +++ OK, passed 100 tests.
  19189. 1478.33 s [extra] \xs -> drop 1 xs == drop1 xs
  19190. 1478.33 s [extra] +++ OK, passed 100 tests.
  19191. 1478.33 s [extra] dropEnd1 "" == ""
  19192. 1478.33 s [extra] +++ OK, passed 100 tests.
  19193. 1478.33 s [extra] dropEnd1 "test" == "tes"
  19194. 1478.33 s [extra] +++ OK, passed 100 tests.
  19195. 1478.33 s [extra] \xs -> dropEnd 1 xs == dropEnd1 xs
  19196. 1478.33 s [extra] +++ OK, passed 100 tests.
  19197. 1478.33 s [extra] mconcatMap Sum [1,2,3] == Sum 6
  19198. 1478.33 s [extra] +++ OK, passed 100 tests.
  19199. 1478.33 s [extra] \f xs -> mconcatMap f xs == concatMap f xs
  19200. 1478.34 s [extra] +++ OK, passed 100 tests.
  19201. 1478.34 s [extra] breakOn "::" "a::b::c" == ("a", "::b::c")
  19202. 1478.34 s [extra] +++ OK, passed 100 tests.
  19203. 1478.34 s [extra] breakOn "/" "foobar" == ("foobar", "")
  19204. 1478.34 s [extra] +++ OK, passed 100 tests.
  19205. 1478.34 s [extra] \needle haystack -> let (prefix,match) = breakOn needle haystack in prefix ++ match == haystack
  19206. 1478.34 s [extra] +++ OK, passed 100 tests.
  19207. 1478.34 s [extra] breakOnEnd "::" "a::b::c" == ("a::b::", "c")
  19208. 1478.34 s [extra] +++ OK, passed 100 tests.
  19209. 1478.34 s [extra] splitOn "\r\n" "a\r\nb\r\nd\r\ne" == ["a","b","d","e"]
  19210. 1478.34 s [extra] +++ OK, passed 100 tests.
  19211. 1478.34 s [extra] splitOn "aaa" "aaaXaaaXaaaXaaa" == ["","X","X","X",""]
  19212. 1478.34 s [extra] +++ OK, passed 100 tests.
  19213. 1478.34 s [extra] splitOn "x" "x" == ["",""]
  19214. 1478.34 s [extra] +++ OK, passed 100 tests.
  19215. 1478.34 s [extra] splitOn "x" "" == [""]
  19216. 1478.34 s [extra] +++ OK, passed 100 tests.
  19217. 1478.34 s [extra] \s x -> s /= "" ==> intercalate s (splitOn s x) == x
  19218. 1478.35 s [extra] +++ OK, passed 100 tests; 17 discarded.
  19219. 1478.35 s [extra] \c x -> splitOn [c] x == split (==c) x
  19220. 1478.35 s [extra] +++ OK, passed 100 tests.
  19221. 1478.35 s [extra] split (== 'a') "aabbaca" == ["","","bb","c",""]
  19222. 1478.35 s [extra] +++ OK, passed 100 tests.
  19223. 1478.35 s [extra] split (== 'a') "" == [""]
  19224. 1478.35 s [extra] +++ OK, passed 100 tests.
  19225. 1478.35 s [extra] split (== ':') "::xyz:abc::123::" == ["","","xyz","abc","","123","",""]
  19226. 1478.35 s [extra] +++ OK, passed 100 tests.
  19227. 1478.35 s [extra] split (== ',') "my,list,here" == ["my","list","here"]
  19228. 1478.35 s [extra] +++ OK, passed 100 tests.
  19229. 1478.35 s [extra] dropWhileEnd isSpace "ab cde " == "ab cde"
  19230. 1478.35 s [extra] +++ OK, passed 100 tests.
  19231. 1478.35 s [extra] dropWhileEnd' isSpace "ab cde " == "ab cde"
  19232. 1478.35 s [extra] +++ OK, passed 100 tests.
  19233. 1478.35 s [extra] last (dropWhileEnd even [undefined,3]) == undefined
  19234. 1478.35 s [extra] +++ OK, passed 100 tests.
  19235. 1478.35 s [extra] last (dropWhileEnd' even [undefined,3]) == 3
  19236. 1478.35 s [extra] +++ OK, passed 100 tests.
  19237. 1478.35 s [extra] head (dropWhileEnd even (3:undefined)) == 3
  19238. 1478.35 s [extra] +++ OK, passed 100 tests.
  19239. 1478.35 s [extra] head (dropWhileEnd' even (3:undefined)) == undefined
  19240. 1478.35 s [extra] +++ OK, passed 100 tests.
  19241. 1478.35 s [extra] dropPrefix "Mr. " "Mr. Men" == "Men"
  19242. 1478.35 s [extra] +++ OK, passed 100 tests.
  19243. 1478.35 s [extra] dropPrefix "Mr. " "Dr. Men" == "Dr. Men"
  19244. 1478.35 s [extra] +++ OK, passed 100 tests.
  19245. 1478.35 s [extra] dropSuffix "!" "Hello World!" == "Hello World"
  19246. 1478.35 s [extra] +++ OK, passed 100 tests.
  19247. 1478.35 s [extra] dropSuffix "!" "Hello World!!" == "Hello World!"
  19248. 1478.35 s [extra] +++ OK, passed 100 tests.
  19249. 1478.35 s [extra] dropSuffix "!" "Hello World." == "Hello World."
  19250. 1478.35 s [extra] +++ OK, passed 100 tests.
  19251. 1478.35 s [extra] stripSuffix "bar" "foobar" == Just "foo"
  19252. 1478.35 s [extra] +++ OK, passed 100 tests.
  19253. 1478.35 s [extra] stripSuffix "" "baz" == Just "baz"
  19254. 1478.35 s [extra] +++ OK, passed 100 tests.
  19255. 1478.35 s [extra] stripSuffix "foo" "quux" == Nothing
  19256. 1478.35 s [extra] +++ OK, passed 100 tests.
  19257. 1478.35 s [extra] stripInfix "::" "a::b::c" == Just ("a", "b::c")
  19258. 1478.35 s [extra] +++ OK, passed 100 tests.
  19259. 1478.35 s [extra] stripInfix "/" "foobar" == Nothing
  19260. 1478.35 s [extra] +++ OK, passed 100 tests.
  19261. 1478.35 s [extra] stripInfixEnd "::" "a::b::c" == Just ("a::b", "c")
  19262. 1478.35 s [extra] +++ OK, passed 100 tests.
  19263. 1478.35 s [extra] chunksOf 3 "my test" == ["my ","tes","t"]
  19264. 1478.35 s [extra] +++ OK, passed 100 tests.
  19265. 1478.35 s [extra] chunksOf 3 "mytest" == ["myt","est"]
  19266. 1478.35 s [extra] +++ OK, passed 100 tests.
  19267. 1478.35 s [extra] chunksOf 8 "" == []
  19268. 1478.35 s [extra] +++ OK, passed 100 tests.
  19269. 1478.35 s [extra] chunksOf 0 "test" == undefined
  19270. 1478.35 s [extra] +++ OK, passed 100 tests.
  19271. 1478.35 s [extra] nubSort "this is a test" == " aehist"
  19272. 1478.35 s [extra] +++ OK, passed 100 tests.
  19273. 1478.35 s [extra] \xs -> nubSort xs == nub (sort xs)
  19274. 1478.35 s [extra] +++ OK, passed 100 tests.
  19275. 1478.35 s [extra] nubSortOn length ["a","test","of","this"] == ["a","of","test"]
  19276. 1478.35 s [extra] +++ OK, passed 100 tests.
  19277. 1478.35 s [extra] nubSortBy (compare `on` length) ["a","test","of","this"] == ["a","of","test"]
  19278. 1478.35 s [extra] +++ OK, passed 100 tests.
  19279. 1478.35 s [extra] nubOrd "this is a test" == "this ae"
  19280. 1478.35 s [extra] +++ OK, passed 100 tests.
  19281. 1478.35 s [extra] nubOrd (take 4 ("this" ++ undefined)) == "this"
  19282. 1478.35 s [extra] +++ OK, passed 100 tests.
  19283. 1478.35 s [extra] \xs -> nubOrd xs == nub xs
  19284. 1478.35 s [extra] +++ OK, passed 100 tests.
  19285. 1478.35 s [extra] nubOrdOn length ["a","test","of","this"] == ["a","test","of"]
  19286. 1478.35 s [extra] +++ OK, passed 100 tests.
  19287. 1478.35 s [extra] nubOrdBy (compare `on` length) ["a","test","of","this"] == ["a","test","of"]
  19288. 1478.35 s [extra] +++ OK, passed 100 tests.
  19289. 1478.35 s [extra] zipWithLongest (,) "a" "xyz" == [(Just 'a', Just 'x'), (Nothing, Just 'y'), (Nothing, Just 'z')]
  19290. 1478.35 s [extra] +++ OK, passed 100 tests.
  19291. 1478.35 s [extra] zipWithLongest (,) "a" "x" == [(Just 'a', Just 'x')]
  19292. 1478.35 s [extra] +++ OK, passed 100 tests.
  19293. 1478.35 s [extra] zipWithLongest (,) "" "x" == [(Nothing, Just 'x')]
  19294. 1478.35 s [extra] +++ OK, passed 100 tests.
  19295. 1478.35 s [extra] comparingLength [1,2,3] [False] == GT
  19296. 1478.35 s [extra] +++ OK, passed 100 tests.
  19297. 1478.35 s [extra] comparingLength [1,2] "ab" == EQ
  19298. 1478.35 s [extra] +++ OK, passed 100 tests.
  19299. 1478.35 s [extra] \(xs :: [Int]) (ys :: [Int]) -> comparingLength xs ys == Data.Ord.comparing length xs ys
  19300. 1478.35 s [extra] +++ OK, passed 100 tests.
  19301. 1478.35 s [extra] comparingLength [1,2] (1:2:3:undefined) == LT
  19302. 1478.35 s [extra] +++ OK, passed 100 tests.
  19303. 1478.35 s [extra] comparingLength (1:2:3:undefined) [1,2] == GT
  19304. 1478.35 s [extra] +++ OK, passed 100 tests.
  19305. 1478.35 s [extra] mwhen True "test" == "test"
  19306. 1478.35 s [extra] +++ OK, passed 100 tests.
  19307. 1478.35 s [extra] mwhen False "test" == ""
  19308. 1478.35 s [extra] +++ OK, passed 100 tests.
  19309. 1478.35 s [extra] first succ (1,"test") == (2,"test")
  19310. 1478.35 s [extra] +++ OK, passed 100 tests.
  19311. 1478.35 s [extra] second reverse (1,"test") == (1,"tset")
  19312. 1478.35 s [extra] +++ OK, passed 100 tests.
  19313. 1478.35 s [extra] firstM (\x -> [x-1, x+1]) (1,"test") == [(0,"test"),(2,"test")]
  19314. 1478.35 s [extra] +++ OK, passed 100 tests.
  19315. 1478.35 s [extra] secondM (\x -> [reverse x, x]) (1,"test") == [(1,"tset"),(1,"test")]
  19316. 1478.35 s [extra] +++ OK, passed 100 tests.
  19317. 1478.35 s [extra] (succ *** reverse) (1,"test") == (2,"tset")
  19318. 1478.35 s [extra] +++ OK, passed 100 tests.
  19319. 1478.35 s [extra] (succ &&& pred) 1 == (2,0)
  19320. 1478.35 s [extra] +++ OK, passed 100 tests.
  19321. 1478.35 s [extra] dupe 12 == (12, 12)
  19322. 1478.35 s [extra] +++ OK, passed 100 tests.
  19323. 1478.35 s [extra] both succ (1,2) == (2,3)
  19324. 1478.35 s [extra] +++ OK, passed 100 tests.
  19325. 1478.35 s [extra] first3 succ (1,1,1) == (2,1,1)
  19326. 1478.35 s [extra] +++ OK, passed 100 tests.
  19327. 1478.35 s [extra] second3 succ (1,1,1) == (1,2,1)
  19328. 1478.35 s [extra] +++ OK, passed 100 tests.
  19329. 1478.35 s [extra] third3 succ (1,1,1) == (1,1,2)
  19330. 1478.35 s [extra] +++ OK, passed 100 tests.
  19331. 1478.35 s [extra] \x -> readVersion (showVersion x) == x
  19332. 1478.36 s [extra] +++ OK, passed 100 tests.
  19333. 1478.36 s [extra] readVersion "hello" == undefined
  19334. 1478.36 s [extra] +++ OK, passed 100 tests.
  19335. 1478.36 s [extra] showDP 4 pi == "3.1416"
  19336. 1478.36 s [extra] +++ OK, passed 100 tests.
  19337. 1478.36 s [extra] showDP 0 pi == "3"
  19338. 1478.36 s [extra] +++ OK, passed 100 tests.
  19339. 1478.36 s [extra] showDP 2 3 == "3.00"
  19340. 1478.36 s [extra] +++ OK, passed 100 tests.
  19341. 1478.36 s [extra] withTempDir $ \dir -> do writeFile (dir </> "foo.txt") ""; withCurrentDirectory dir $ doesFileExist "foo.txt"
  19342. 1478.36 s [extra] +++ OK, passed 100 tests.
  19343. 1478.36 s [extra] withTempDir $ \dir -> do writeFile (dir </> "test.txt") ""; (== [dir </> "test.txt"]) <$> listContents dir
  19344. 1478.36 s [extra] +++ OK, passed 100 tests.
  19345. 1478.36 s [extra] listTest listContents ["bar.txt","foo/baz.txt","zoo"] ["bar.txt","foo","zoo"]
  19346. 1478.36 s [extra] +++ OK, passed 100 tests.
  19347. 1478.36 s [extra] listTest listDirectories ["bar.txt","foo/baz.txt","zoo"] ["foo"]
  19348. 1478.36 s [extra] +++ OK, passed 100 tests.
  19349. 1478.36 s [extra] listTest listFiles ["bar.txt","foo/baz.txt","zoo"] ["bar.txt","zoo"]
  19350. 1478.36 s [extra] +++ OK, passed 100 tests.
  19351. 1478.36 s [extra] listTest listFilesRecursive ["bar.txt","zoo","foo" </> "baz.txt"] ["bar.txt","zoo","foo" </> "baz.txt"]
  19352. 1478.36 s [extra] +++ OK, passed 100 tests.
  19353. 1478.36 s [extra] listTest (listFilesInside $ pure . not . isPrefixOf "." . takeFileName) ["bar.txt","foo" </> "baz.txt",".foo" </> "baz2.txt", "zoo"] ["bar.txt","zoo","foo" </> "baz.txt"]
  19354. 1478.36 s [extra] +++ OK, passed 100 tests.
  19355. 1478.36 s [extra] listTest (listFilesInside $ const $ pure False) ["bar.txt"] []
  19356. 1478.36 s [extra] +++ OK, passed 100 tests.
  19357. 1478.36 s [extra] isWindows == (os == "mingw32")
  19358. 1478.36 s [extra] +++ OK, passed 100 tests.
  19359. 1478.36 s [extra] \(filter isHexDigit -> s) -> fmap (== s) $ withTempFile $ \file -> do writeFile file s; readFile' file
  19360. 1478.38 s [extra] +++ OK, passed 100 tests.
  19361. 1478.38 s [extra] \s -> withTempFile $ \file -> do writeFileUTF8 file s; fmap (== s) $ readFileUTF8' file
  19362. 1478.40 s [extra] +++ OK, passed 100 tests.
  19363. 1478.40 s [extra] \(ASCIIString s) -> withTempFile $ \file -> do writeFileBinary file s; fmap (== s) $ readFileBinary' file
  19364. 1478.41 s [extra] +++ OK, passed 100 tests.
  19365. 1478.41 s [extra] captureOutput (print 1) == pure ("1\n",())
  19366. 1478.41 s [extra] +++ OK, passed 100 tests.
  19367. 1478.41 s [extra] withTempFile doesFileExist == pure True
  19368. 1478.41 s [extra] +++ OK, passed 100 tests.
  19369. 1478.41 s [extra] (doesFileExist =<< withTempFile pure) == pure False
  19370. 1478.41 s [extra] +++ OK, passed 100 tests.
  19371. 1478.41 s [extra] withTempFile readFile' == pure ""
  19372. 1478.41 s [extra] +++ OK, passed 100 tests.
  19373. 1478.41 s [extra] withTempDir doesDirectoryExist == pure True
  19374. 1478.41 s [extra] +++ OK, passed 100 tests.
  19375. 1478.41 s [extra] (doesDirectoryExist =<< withTempDir pure) == pure False
  19376. 1478.42 s [extra] +++ OK, passed 100 tests.
  19377. 1478.42 s [extra] withTempDir listFiles == pure []
  19378. 1478.42 s [extra] +++ OK, passed 100 tests.
  19379. 1478.42 s [extra] fileEq "does_not_exist1" "does_not_exist2" == undefined
  19380. 1478.42 s [extra] +++ OK, passed 100 tests.
  19381. 1478.42 s [extra] fileEq "does_not_exist" "does_not_exist" == undefined
  19382. 1478.42 s [extra] +++ OK, passed 100 tests.
  19383. 1478.42 s [extra] withTempFile $ \f1 -> fileEq "does_not_exist" f1 == undefined
  19384. 1478.42 s [extra] +++ OK, passed 100 tests.
  19385. 1478.42 s [extra] withTempFile $ \f1 -> withTempFile $ \f2 -> fileEq f1 f2
  19386. 1478.42 s [extra] +++ OK, passed 100 tests.
  19387. 1478.42 s [extra] withTempFile $ \f1 -> withTempFile $ \f2 -> writeFile f1 "a" >> writeFile f2 "a" >> fileEq f1 f2
  19388. 1478.42 s [extra] +++ OK, passed 100 tests.
  19389. 1478.42 s [extra] withTempFile $ \f1 -> withTempFile $ \f2 -> writeFile f1 "a" >> writeFile f2 "b" >> notM (fileEq f1 f2)
  19390. 1478.42 s [extra] +++ OK, passed 100 tests.
  19391. 1478.42 s [extra] fmap (round . fst) (duration $ sleep 1) == pure 1
  19392. 1479.43 s [extra] +++ OK, passed 100 tests.
  19393. 1479.43 s [extra] timeout (-3) (print 1) == pure Nothing
  19394. 1479.51 s [extra] +++ OK, passed 100 tests.
  19395. 1479.51 s [extra] timeout 0.1 (print 1) == fmap Just (print 1)
  19396. 1479.51 s [extra] +++ OK, passed 100 tests.
  19397. 1479.51 s [extra] do (t, _) <- duration $ timeout 0.1 $ sleep 1000; print t; pure $ t < 1
  19398. 1479.53 s [extra] 0.10035764000000001
  19399. 1479.53 s [extra] +++ OK, passed 100 tests.
  19400. 1479.53 s [extra] timeout 0.1 (sleep 2 >> print 1) == pure Nothing
  19401. 1479.63 s [extra] +++ OK, passed 100 tests.
  19402. 1479.63 s [extra] showDuration 3.435 == "3.44s"
  19403. 1479.63 s [extra] +++ OK, passed 100 tests.
  19404. 1479.63 s [extra] showDuration 623.8 == "10m24s"
  19405. 1479.63 s [extra] +++ OK, passed 100 tests.
  19406. 1479.63 s [extra] showDuration 62003.8 == "17h13m"
  19407. 1479.63 s [extra] +++ OK, passed 100 tests.
  19408. 1479.63 s [extra] showDuration 1e8 == "27777h47m"
  19409. 1479.63 s [extra] +++ OK, passed 100 tests.
  19410. 1479.63 s [extra] do f <- offsetTime; xs <- replicateM 10 f; pure $ xs == sort xs
  19411. 1479.63 s [extra] +++ OK, passed 100 tests.
  19412. 1479.63 s [extra] do (a,_) <- duration $ sleep 1; pure $ a >= 1 && a <= 1.5
  19413. 1480.63 s [extra] +++ OK, passed 100 tests.
  19414. 1480.63 s [extra] Extra export
  19415. 1480.63 s [extra] +++ OK, passed 100 tests.
  19416. 1480.63 s [extra] withTempFile
  19417. 1480.64 s [extra] ....done
  19418. 1480.64 s [extra] withTempDir
  19419. 1480.66 s [extra] ....done
  19420. 1480.66 s [extra] retry
  19421. 1480.66 s [extra] +++ OK, passed 100 tests.
  19422. 1480.66 s [extra] barrier
  19423. 1480.66 s [extra] Success (325 tests)
  19424. 1480.68 s [extra] Test suite extra-test: PASS
  19425. 1480.68 s [extra] Test suite logged to: dist/test/extra-1.8.1-extra-test.log
  19426. 1480.68 s [extra] 1 of 1 test suites (1 of 1 test cases) passed.
  19427. 1480.92 s [extra] Phase: haddockPhase
  19428. 1481.07 s [extra] Preprocessing library for extra-1.8.1..
  19429. 1481.07 s [extra] Running Haddock on library for extra-1.8.1..
  19430. 1481.13 s [extra] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
  19431. 1481.66 s [extra] 100% ( 6 / 6) in 'Data.IORef.Extra'
  19432. 1481.70 s [extra] 100% ( 4 / 4) in 'Data.Monoid.Extra'
  19433. 1481.71 s [extra] Warning: 'Arrow' is out of scope.
  19434. 1481.71 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  19435. 1481.71 s [extra] 100% ( 22 / 22) in 'Data.Tuple.Extra'
  19436. 1481.72 s [extra] 100% ( 2 / 2) in 'Data.Typeable.Extra'
  19437. 1481.73 s [extra] 100% ( 7 / 7) in 'Numeric.Extra'
  19438. 1481.80 s [extra] Warning: '(:)' is out of scope.
  19439. 1481.80 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  19440. 1481.80 s [extra] Warning: 'firstJustM' is out of scope.
  19441. 1481.80 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  19442. 1481.80 s [extra] 100% ( 85 / 85) in 'Data.List.Extra'
  19443. 1481.96 s [extra] 100% ( 3 / 3) in 'Data.Version.Extra'
  19444. 1481.97 s [extra] Warning: 'length' is ambiguous. It is defined
  19445. 1481.97 s [extra] * in ‘Data.Foldable’
  19446. 1481.97 s [extra] * in ‘Data.List.NonEmpty’
  19447. 1481.97 s [extra] You may be able to disambiguate the identifier by qualifying it or
  19448. 1481.97 s [extra] by specifying the type/value namespace explicitly.
  19449. 1481.97 s [extra] Defaulting to the one defined in ‘Data.Foldable’
  19450. 1481.97 s [extra] 100% ( 23 / 23) in 'Data.List.NonEmpty.Extra'
  19451. 1481.99 s [extra] Warning: 'fromJust' is out of scope.
  19452. 1481.99 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  19453. 1481.99 s [extra] 100% ( 11 / 11) in 'Data.Either.Extra'
  19454. 1482.01 s [extra] 100% ( 21 / 21) in 'Control.Exception.Extra'
  19455. 1482.04 s [extra] Warning: 'partition' is out of scope.
  19456. 1482.04 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  19457. 1482.04 s [extra] Warning: 'mconcatMap' is out of scope.
  19458. 1482.04 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  19459. 1482.04 s [extra] Warning: 'find' is out of scope.
  19460. 1482.04 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  19461. 1482.04 s [extra] 100% ( 40 / 40) in 'Control.Monad.Extra'
  19462. 1482.15 s [extra] 92% ( 13 / 14) in 'Data.Foldable.Extra'
  19463. 1482.15 s [extra] Missing documentation for:
  19464. 1482.15 s [extra] Module header
  19465. 1482.19 s [extra] 100% ( 27 / 27) in 'Control.Concurrent.Extra'
  19466. 1482.23 s [extra] 100% ( 8 / 8) in 'System.Directory.Extra'
  19467. 1482.23 s [extra] 100% ( 2 / 2) in 'System.Environment.Extra'
  19468. 1482.29 s [extra] 100% ( 26 / 26) in 'System.IO.Extra'
  19469. 1482.32 s [extra] 100% ( 4 / 4) in 'System.Info.Extra'
  19470. 1482.34 s [extra] 100% ( 5 / 5) in 'System.Process.Extra'
  19471. 1482.35 s [extra] 100% ( 8 / 8) in 'System.Time.Extra'
  19472. 1482.50 s [extra] 100% (270 /270) in 'Extra'
  19473. 1482.51 s [extra] 100% ( 2 / 2) in 'Text.Read.Extra'
  19474. 1485.54 s [extra] Documentation created: dist/doc/html/extra/index.html,
  19475. 1485.54 s [extra] dist/doc/html/extra/extra.txt
  19476. 1485.60 s [extra] Preprocessing test suite 'extra-test' for extra-1.8.1..
  19477. 1485.61 s [extra] Phase: installPhase
  19478. 1485.66 s [extra] Installing library in /nix/store/3k0hvm3ji4zr2w13ddkq0lqk65vnd6ah-extra-1.8.1/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj
  19479. 1486.09 s [extra] Phase: fixupPhase
  19480. 1486.11 s [extra] shrinking RPATHs of ELF executables and libraries in /nix/store/3k0hvm3ji4zr2w13ddkq0lqk65vnd6ah-extra-1.8.1
  19481. 1486.11 s [extra] shrinking /nix/store/3k0hvm3ji4zr2w13ddkq0lqk65vnd6ah-extra-1.8.1/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/libHSextra-1.8.1-BqjEmdQfbI9KG2nXkLylMj-ghc9.4.8.so
  19482. 1486.13 s [extra] checking for references to /build/ in /nix/store/3k0hvm3ji4zr2w13ddkq0lqk65vnd6ah-extra-1.8.1...
  19483. 1486.15 s [extra] patching script interpreter paths in /nix/store/3k0hvm3ji4zr2w13ddkq0lqk65vnd6ah-extra-1.8.1
  19484. 1486.16 s [extra] stripping (with command strip and flags -S -p) in /nix/store/3k0hvm3ji4zr2w13ddkq0lqk65vnd6ah-extra-1.8.1/lib
  19485. 1486.31 s [extra] shrinking RPATHs of ELF executables and libraries in /nix/store/hmmlkgyklr6cqmfw2p9q5fcbzdszv1z4-extra-1.8.1-doc
  19486. 1486.33 s [extra] checking for references to /build/ in /nix/store/hmmlkgyklr6cqmfw2p9q5fcbzdszv1z4-extra-1.8.1-doc...
  19487. 1486.36 s [extra] patching script interpreter paths in /nix/store/hmmlkgyklr6cqmfw2p9q5fcbzdszv1z4-extra-1.8.1-doc
  19488. 1486.49 s [extra:post-build] Uploading to cachix cache "sellout": /nix/store/3k0hvm3ji4zr2w13ddkq0lqk65vnd6ah-extra-1.8.1 /nix/store/hmmlkgyklr6cqmfw2p9q5fcbzdszv1z4-extra-1.8.1-doc
  19489. 1486.86 s [extra:post-build] Nothing to push - all store paths are already on Cachix.
  19490. 1486.88 s [extra:post-build] Uploading to the NixCI cache: /nix/store/3k0hvm3ji4zr2w13ddkq0lqk65vnd6ah-extra-1.8.1 /nix/store/hmmlkgyklr6cqmfw2p9q5fcbzdszv1z4-extra-1.8.1-doc
  19491. 1486.92 s [extra:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  19492. 1486.96 s [extra:post-build] copying 1 paths...
  19493. 1486.96 s [extra:post-build] copying path '/nix/store/3k0hvm3ji4zr2w13ddkq0lqk65vnd6ah-extra-1.8.1' to 'https://cache.nix-ci.com'...
  19494. 1488.21 s [extra:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  19495. 1488.30 s [extra:post-build] copying 0 paths...
  19496. 1488.32 s Progress: 13 of 19 built, 161 of 161 downloaded from cache
  19497. 1488.36 s Building /nix/store/r3bxf573i0cz6mglqadf5v8dx13xad0g-algebraic-graphs-0.7.drv
  19498. 1488.45 s [algebraic-graphs] Phase: setupCompilerEnvironmentPhase
  19499. 1488.45 s [algebraic-graphs] Build with /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8.
  19500. 1488.60 s [algebraic-graphs] Phase: unpackPhase
  19501. 1488.60 s [algebraic-graphs] unpacking source archive /nix/store/gfjyfw1hcshbfclk91difmkphwib8nbd-algebraic-graphs-0.7.tar.gz
  19502. 1488.61 s [algebraic-graphs] source root is algebraic-graphs-0.7
  19503. 1488.62 s [algebraic-graphs] setting SOURCE_DATE_EPOCH to timestamp 1655769405 of file "algebraic-graphs-0.7/test/Data/Graph/Test/Typed.hs"
  19504. 1488.63 s [algebraic-graphs] Phase: patchPhase
  19505. 1488.63 s [algebraic-graphs] Replace Cabal file with edited version from mirror://hackage/algebraic-graphs-0.7/revision/3.cabal.
  19506. 1488.63 s [algebraic-graphs] applying patch /nix/store/fgaciccwb2z0jmfhs30a1vq03azpd9qd-algebraic-graphs-0.7-allow-inspection-testing-0.6.patch
  19507. 1488.64 s [algebraic-graphs] patching file algebraic-graphs.cabal
  19508. 1488.64 s [algebraic-graphs] Phase: compileBuildDriverPhase
  19509. 1488.64 s [algebraic-graphs] setupCompileFlags: -package-db=/build/tmp.dxZnq5SABB/setup-package.conf.d -threaded
  19510. 1488.69 s [algebraic-graphs] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.dxZnq5SABB/Main.o )
  19511. 1488.75 s [algebraic-graphs] [2 of 2] Linking Setup
  19512. 1490.29 s [algebraic-graphs] Phase: updateAutotoolsGnuConfigScriptsPhase
  19513. 1490.42 s [algebraic-graphs] Phase: configurePhase
  19514. 1490.42 s [algebraic-graphs] configureFlags: --verbose --prefix=/nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7 --libdir=$prefix/lib/$compiler --libsubdir=$abi/$libname --docdir=/nix/store/vjqap2q6zb9489lpbx22hfpxkrh9jn3f-algebraic-graphs-0.7-doc/share/doc/algebraic-graphs-0.7 --with-gcc=gcc --package-db=/build/tmp.dxZnq5SABB/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/ffyzkisqs4vc4mg28bwwlyqjf8i9ph6b-ncurses-6.5/lib --extra-lib-dirs=/nix/store/n28qgdj8c1q41kf7n4y1jxa6ckp85m3c-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/hi0ar880110k6jsmmili7dh1gq3cg2a9-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/g09cflpnp4g80q56sj9dng1qzv4v4ybc-numactl-2.0.18/lib --extra-lib-dirs=/nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/lib
  19515. 1490.90 s [algebraic-graphs] Using Parsec parser
  19516. 1490.90 s [algebraic-graphs] Configuring algebraic-graphs-0.7...
  19517. 1490.90 s [algebraic-graphs] Dependency array >=0.4 && <0.6: using array-0.5.4.0
  19518. 1490.95 s [algebraic-graphs] Dependency base >=4.11 && <5: using base-4.17.2.1
  19519. 1490.95 s [algebraic-graphs] Dependency containers >=0.5.5.1 && <0.8: using containers-0.6.7
  19520. 1490.95 s [algebraic-graphs] Dependency deepseq >=1.3.0.1 && <1.6: using deepseq-1.4.8.0
  19521. 1490.95 s [algebraic-graphs] Dependency transformers >=0.4 && <0.7: using transformers-0.5.6.2
  19522. 1490.95 s [algebraic-graphs] Dependency QuickCheck >=2.14 && <2.16: using QuickCheck-2.15.0.1
  19523. 1490.95 s [algebraic-graphs] Dependency algebraic-graphs: using algebraic-graphs-0.7
  19524. 1490.95 s [algebraic-graphs] Dependency array >=0.4 && <0.6: using array-0.5.4.0
  19525. 1490.95 s [algebraic-graphs] Dependency base >=4.11 && <5: using base-4.17.2.1
  19526. 1490.95 s [algebraic-graphs] Dependency containers >=0.5.5.1 && <0.8: using containers-0.6.7
  19527. 1490.95 s [algebraic-graphs] Dependency deepseq >=1.3.0.1 && <1.6: using deepseq-1.4.8.0
  19528. 1490.95 s [algebraic-graphs] Dependency extra >=1.4 && <2: using extra-1.8.1
  19529. 1490.95 s [algebraic-graphs] Dependency inspection-testing >=0.4.2.2 && <0.7: using
  19530. 1490.95 s [algebraic-graphs] inspection-testing-0.6.2
  19531. 1490.95 s [algebraic-graphs] Dependency transformers >=0.4 && <0.7: using transformers-0.5.6.2
  19532. 1491.31 s [algebraic-graphs] Source component graph:
  19533. 1491.31 s [algebraic-graphs] component lib
  19534. 1491.31 s [algebraic-graphs] component test:main dependency lib
  19535. 1491.31 s [algebraic-graphs] Configured component graph:
  19536. 1491.31 s [algebraic-graphs] component algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F
  19537. 1491.31 s [algebraic-graphs] include array-0.5.4.0
  19538. 1491.31 s [algebraic-graphs] include base-4.17.2.1
  19539. 1491.31 s [algebraic-graphs] include containers-0.6.7
  19540. 1491.31 s [algebraic-graphs] include deepseq-1.4.8.0
  19541. 1491.31 s [algebraic-graphs] include transformers-0.5.6.2
  19542. 1491.31 s [algebraic-graphs] component algebraic-graphs-0.7-CDF05JauRV59ivFa6tjL5p-main
  19543. 1491.31 s [algebraic-graphs] include QuickCheck-2.15.0.1-H9C4qdCN40J1jJ9nkbU8lt
  19544. 1491.31 s [algebraic-graphs] include algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F
  19545. 1491.31 s [algebraic-graphs] include array-0.5.4.0
  19546. 1491.31 s [algebraic-graphs] include base-4.17.2.1
  19547. 1491.31 s [algebraic-graphs] include containers-0.6.7
  19548. 1491.31 s [algebraic-graphs] include deepseq-1.4.8.0
  19549. 1491.31 s [algebraic-graphs] include extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj
  19550. 1491.31 s [algebraic-graphs] include inspection-testing-0.6.2-6gWzQuOn6w33uuxsSUSZFy
  19551. 1491.31 s [algebraic-graphs] include transformers-0.5.6.2
  19552. 1491.31 s [algebraic-graphs] Linked component graph:
  19553. 1491.31 s [algebraic-graphs] unit algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F
  19554. 1491.31 s [algebraic-graphs] include array-0.5.4.0
  19555. 1491.31 s [algebraic-graphs] include base-4.17.2.1
  19556. 1491.31 s [algebraic-graphs] include containers-0.6.7
  19557. 1491.31 s [algebraic-graphs] include deepseq-1.4.8.0
  19558. 1491.31 s [algebraic-graphs] include transformers-0.5.6.2
  19559. 1491.31 s [algebraic-graphs] Algebra.Graph=algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F:Algebra.Graph,Algebra.Graph.Acyclic.AdjacencyMap=algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F:Algebra.Graph.Acyclic.AdjacencyMap,Algebra.Graph.AdjacencyIntMap=algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F:Algebra.Graph.AdjacencyIntMap,Algebra.Graph.AdjacencyIntMap.Algorithm=algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F:Algebra.Graph.AdjacencyIntMap.Algorithm,Algebra.Graph.AdjacencyMap=algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F:Algebra.Graph.AdjacencyMap,Algebra.Graph.AdjacencyMap.Algorithm=algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F:Algebra.Graph.AdjacencyMap.Algorithm,Algebra.Graph.Bipartite.AdjacencyMap=algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F:Algebra.Graph.Bipartite.AdjacencyMap,Algebra.Graph.Bipartite.AdjacencyMap.Algorithm=algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F:Algebra.Graph.Bipartite.AdjacencyMap.Algorithm,Algebra.Graph.Class=algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F:Algebra.Graph.Class,Algebra.Graph.Example.Todo=algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F:Algebra.Graph.Example.Todo,Algebra.Graph.Export=algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F:Algebra.Graph.Export,Algebra.Graph.Export.Dot=algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F:Algebra.Graph.Export.Dot,Algebra.Graph.HigherKinded.Class=algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F:Algebra.Graph.HigherKinded.Class,Algebra.Graph.Internal=algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F:Algebra.Graph.Internal,Algebra.Graph.Label=algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F:Algebra.Graph.Label,Algebra.Graph.Labelled=algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F:Algebra.Graph.Labelled,Algebra.Graph.Labelled.AdjacencyMap=algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F:Algebra.Graph.Labelled.AdjacencyMap,Algebra.Graph.Labelled.Example.Automaton=algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F:Algebra.Graph.Labelled.Example.Automaton,Algebra.Graph.Labelled.Example.Network=algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F:Algebra.Graph.Labelled.Example.Network,Algebra.Graph.NonEmpty=algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F:Algebra.Graph.NonEmpty,Algebra.Graph.NonEmpty.AdjacencyMap=algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F:Algebra.Graph.NonEmpty.AdjacencyMap,Algebra.Graph.Relation=algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F:Algebra.Graph.Relation,Algebra.Graph.Relation.Preorder=algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F:Algebra.Graph.Relation.Preorder,Algebra.Graph.Relation.Reflexive=algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F:Algebra.Graph.Relation.Reflexive,Algebra.Graph.Relation.Symmetric=algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F:Algebra.Graph.Relation.Symmetric,Algebra.Graph.Relation.Transitive=algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F:Algebra.Graph.Relation.Transitive,Algebra.Graph.ToGraph=algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F:Algebra.Graph.ToGraph,Algebra.Graph.Undirected=algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F:Algebra.Graph.Undirected,Data.Graph.Typed=algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F:Data.Graph.Typed
  19560. 1491.31 s [algebraic-graphs] unit algebraic-graphs-0.7-CDF05JauRV59ivFa6tjL5p-main
  19561. 1491.31 s [algebraic-graphs] include QuickCheck-2.15.0.1-H9C4qdCN40J1jJ9nkbU8lt
  19562. 1491.31 s [algebraic-graphs] include algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F
  19563. 1491.31 s [algebraic-graphs] include array-0.5.4.0
  19564. 1491.31 s [algebraic-graphs] include base-4.17.2.1
  19565. 1491.32 s [algebraic-graphs] include containers-0.6.7
  19566. 1491.32 s [algebraic-graphs] include deepseq-1.4.8.0
  19567. 1491.32 s [algebraic-graphs] include extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj
  19568. 1491.32 s [algebraic-graphs] include inspection-testing-0.6.2-6gWzQuOn6w33uuxsSUSZFy
  19569. 1491.32 s [algebraic-graphs] include transformers-0.5.6.2
  19570. 1491.32 s [algebraic-graphs] Ready component graph:
  19571. 1491.32 s [algebraic-graphs] definite algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F
  19572. 1491.32 s [algebraic-graphs] depends array-0.5.4.0
  19573. 1491.32 s [algebraic-graphs] depends base-4.17.2.1
  19574. 1491.32 s [algebraic-graphs] depends containers-0.6.7
  19575. 1491.32 s [algebraic-graphs] depends deepseq-1.4.8.0
  19576. 1491.32 s [algebraic-graphs] depends transformers-0.5.6.2
  19577. 1491.32 s [algebraic-graphs] definite algebraic-graphs-0.7-CDF05JauRV59ivFa6tjL5p-main
  19578. 1491.32 s [algebraic-graphs] depends QuickCheck-2.15.0.1-H9C4qdCN40J1jJ9nkbU8lt
  19579. 1491.32 s [algebraic-graphs] depends algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F
  19580. 1491.32 s [algebraic-graphs] depends array-0.5.4.0
  19581. 1491.32 s [algebraic-graphs] depends base-4.17.2.1
  19582. 1491.32 s [algebraic-graphs] depends containers-0.6.7
  19583. 1491.32 s [algebraic-graphs] depends deepseq-1.4.8.0
  19584. 1491.32 s [algebraic-graphs] depends extra-1.8.1-BqjEmdQfbI9KG2nXkLylMj
  19585. 1491.32 s [algebraic-graphs] depends inspection-testing-0.6.2-6gWzQuOn6w33uuxsSUSZFy
  19586. 1491.32 s [algebraic-graphs] depends transformers-0.5.6.2
  19587. 1491.32 s [algebraic-graphs] Using Cabal-3.8.1.0 compiled by ghc-9.4
  19588. 1491.32 s [algebraic-graphs] Using compiler: ghc-9.4.8
  19589. 1491.32 s [algebraic-graphs] Using install prefix:
  19590. 1491.32 s [algebraic-graphs] /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7
  19591. 1491.32 s [algebraic-graphs] Executables installed in:
  19592. 1491.32 s [algebraic-graphs] /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7/bin
  19593. 1491.32 s [algebraic-graphs] Libraries installed in:
  19594. 1491.32 s [algebraic-graphs] /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F
  19595. 1491.32 s [algebraic-graphs] Dynamic Libraries installed in:
  19596. 1491.32 s [algebraic-graphs] /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8
  19597. 1491.32 s [algebraic-graphs] Private executables installed in:
  19598. 1491.32 s [algebraic-graphs] /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7/libexec/x86_64-linux-ghc-9.4.8/algebraic-graphs-0.7
  19599. 1491.32 s [algebraic-graphs] Data files installed in:
  19600. 1491.32 s [algebraic-graphs] /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7/share/x86_64-linux-ghc-9.4.8/algebraic-graphs-0.7
  19601. 1491.32 s [algebraic-graphs] Documentation installed in:
  19602. 1491.32 s [algebraic-graphs] /nix/store/vjqap2q6zb9489lpbx22hfpxkrh9jn3f-algebraic-graphs-0.7-doc/share/doc/algebraic-graphs-0.7
  19603. 1491.32 s [algebraic-graphs] Configuration files installed in:
  19604. 1491.32 s [algebraic-graphs] /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7/etc
  19605. 1491.32 s [algebraic-graphs] No alex found
  19606. 1491.32 s [algebraic-graphs] Using ar found on system at:
  19607. 1491.32 s [algebraic-graphs] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  19608. 1491.32 s [algebraic-graphs] No c2hs found
  19609. 1491.32 s [algebraic-graphs] No cpphs found
  19610. 1491.32 s [algebraic-graphs] No doctest found
  19611. 1491.32 s [algebraic-graphs] Using gcc version 14.3.0 given by user at:
  19612. 1491.32 s [algebraic-graphs] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  19613. 1491.32 s [algebraic-graphs] Using ghc version 9.4.8 found on system at:
  19614. 1491.32 s [algebraic-graphs] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/ghc
  19615. 1491.32 s [algebraic-graphs] Using ghc-pkg version 9.4.8 found on system at:
  19616. 1491.32 s [algebraic-graphs] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/ghc-pkg-9.4.8
  19617. 1491.32 s [algebraic-graphs] No ghcjs found
  19618. 1491.32 s [algebraic-graphs] No ghcjs-pkg found
  19619. 1491.32 s [algebraic-graphs] No greencard found
  19620. 1491.32 s [algebraic-graphs] Using haddock version 2.27.0 found on system at:
  19621. 1491.32 s [algebraic-graphs] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/haddock-ghc-9.4.8
  19622. 1491.32 s [algebraic-graphs] No happy found
  19623. 1491.32 s [algebraic-graphs] Using haskell-suite found on system at: haskell-suite-dummy-location
  19624. 1491.32 s [algebraic-graphs] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  19625. 1491.32 s [algebraic-graphs] No hmake found
  19626. 1491.32 s [algebraic-graphs] Using hpc version 0.68 found on system at:
  19627. 1491.32 s [algebraic-graphs] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/hpc
  19628. 1491.32 s [algebraic-graphs] Using hsc2hs version 0.68.8 found on system at:
  19629. 1491.32 s [algebraic-graphs] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/hsc2hs
  19630. 1491.32 s [algebraic-graphs] Using hscolour version 1.25 found on system at:
  19631. 1491.32 s [algebraic-graphs] /nix/store/87hdxxa93g58b2w9ylr2idn2a40i3fdc-hscolour-1.25/bin/HsColour
  19632. 1491.32 s [algebraic-graphs] No jhc found
  19633. 1491.32 s [algebraic-graphs] Using ld found on system at:
  19634. 1491.32 s [algebraic-graphs] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ld.gold
  19635. 1491.32 s [algebraic-graphs] No pkg-config found
  19636. 1491.32 s [algebraic-graphs] Using runghc version 9.4.8 found on system at:
  19637. 1491.32 s [algebraic-graphs] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/runghc-9.4.8
  19638. 1491.32 s [algebraic-graphs] Using strip version 2.44 found on system at:
  19639. 1491.32 s [algebraic-graphs] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  19640. 1491.32 s [algebraic-graphs] Using tar found on system at:
  19641. 1491.32 s [algebraic-graphs] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  19642. 1491.32 s [algebraic-graphs] No uhc found
  19643. 1491.32 s [algebraic-graphs] Phase: buildPhase
  19644. 1491.39 s [algebraic-graphs] Preprocessing library for algebraic-graphs-0.7..
  19645. 1491.39 s [algebraic-graphs] Building library for algebraic-graphs-0.7..
  19646. 1491.51 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 )
  19647. 1492.82 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 )
  19648. 1493.65 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 )
  19649. 1494.22 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 )
  19650. 1494.22 s [algebraic-graphs] [ 5 of 29] Compiling Algebra.Graph ( src/Algebra/Graph.hs, dist/build/Algebra/Graph.o, dist/build/Algebra/Graph.dyn_o )
  19651. 1495.66 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 )
  19652. 1496.11 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 )
  19653. 1496.93 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 )
  19654. 1497.83 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 )
  19655. 1497.83 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 )
  19656. 1497.83 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 )
  19657. 1497.83 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 )
  19658. 1497.83 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 )
  19659. 1497.83 s [algebraic-graphs]
  19660. 1497.83 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:171:32: warning: [-Wtype-equality-requires-operators]
  19661. 1497.83 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19662. 1497.83 s [algebraic-graphs] will become an error in a future GHC release.
  19663. 1497.83 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19664. 1497.83 s [algebraic-graphs] |
  19665. 1497.83 s [algebraic-graphs] 171 | vertexIntSet :: ToVertex t ~ Int => t -> IntSet
  19666. 1497.83 s [algebraic-graphs] | ^
  19667. 1497.83 s [algebraic-graphs]
  19668. 1497.83 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:197:29: warning: [-Wtype-equality-requires-operators]
  19669. 1497.83 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19670. 1497.83 s [algebraic-graphs] will become an error in a future GHC release.
  19671. 1497.83 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19672. 1497.83 s [algebraic-graphs] |
  19673. 1497.83 s [algebraic-graphs] 197 | preIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  19674. 1497.83 s [algebraic-graphs] | ^
  19675. 1497.83 s [algebraic-graphs]
  19676. 1497.83 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:215:30: warning: [-Wtype-equality-requires-operators]
  19677. 1497.83 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19678. 1497.83 s [algebraic-graphs] will become an error in a future GHC release.
  19679. 1497.83 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19680. 1497.83 s [algebraic-graphs] |
  19681. 1497.83 s [algebraic-graphs] 215 | postIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  19682. 1497.83 s [algebraic-graphs] | ^
  19683. 1497.83 s [algebraic-graphs]
  19684. 1497.83 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:303:37: warning: [-Wtype-equality-requires-operators]
  19685. 1497.83 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19686. 1497.83 s [algebraic-graphs] will become an error in a future GHC release.
  19687. 1497.83 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19688. 1497.83 s [algebraic-graphs] |
  19689. 1497.83 s [algebraic-graphs] 303 | toAdjacencyIntMap :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  19690. 1497.83 s [algebraic-graphs] | ^
  19691. 1497.83 s [algebraic-graphs]
  19692. 1497.83 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:312:46: warning: [-Wtype-equality-requires-operators]
  19693. 1497.83 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19694. 1497.83 s [algebraic-graphs] will become an error in a future GHC release.
  19695. 1497.83 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19696. 1497.83 s [algebraic-graphs] |
  19697. 1497.83 s [algebraic-graphs] 312 | toAdjacencyIntMapTranspose :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  19698. 1497.83 s [algebraic-graphs] | ^
  19699. 1497.83 s [algebraic-graphs]
  19700. 1497.83 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:452:43: warning: [-Wtype-equality-requires-operators]
  19701. 1497.83 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19702. 1497.83 s [algebraic-graphs] will become an error in a future GHC release.
  19703. 1497.83 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19704. 1497.83 s [algebraic-graphs] |
  19705. 1497.83 s [algebraic-graphs] 452 | adjacencyIntMap :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  19706. 1497.83 s [algebraic-graphs] | ^
  19707. 1497.83 s [algebraic-graphs]
  19708. 1497.83 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:471:52: warning: [-Wtype-equality-requires-operators]
  19709. 1497.83 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19710. 1497.83 s [algebraic-graphs] will become an error in a future GHC release.
  19711. 1497.83 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19712. 1497.83 s [algebraic-graphs] |
  19713. 1497.83 s [algebraic-graphs] 471 | adjacencyIntMapTranspose :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  19714. 1497.83 s [algebraic-graphs] | ^
  19715. 1497.83 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 )
  19716. 1497.97 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 )
  19717. 1498.35 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 )
  19718. 1498.44 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 )
  19719. 1498.44 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 )
  19720. 1498.44 s [algebraic-graphs]
  19721. 1498.44 s [algebraic-graphs] src/Algebra/Graph/Labelled.hs:74:10: warning: [-Wredundant-constraints]
  19722. 1498.45 s [algebraic-graphs] • Redundant constraint: Eq e
  19723. 1498.45 s [algebraic-graphs] • In the instance declaration for ‘Ord (Graph e a)’
  19724. 1498.45 s [algebraic-graphs] |
  19725. 1498.45 s [algebraic-graphs] 74 | instance (Eq e, Monoid e, Ord a, Ord e) => Ord (Graph e a) where
  19726. 1498.45 s [algebraic-graphs] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  19727. 1499.10 s [algebraic-graphs] [19 of 29] Compiling Algebra.Graph.Labelled.Example.Network ( src/Algebra/Graph/Labelled/Example/Network.hs, dist/build/Algebra/Graph/Labelled/Example/Network.o, dist/build/Algebra/Graph/Labelled/Example/Network.dyn_o )
  19728. 1499.37 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 )
  19729. 1499.70 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 )
  19730. 1499.70 s [algebraic-graphs]
  19731. 1499.70 s [algebraic-graphs] src/Algebra/Graph/Export.hs:185:41: warning: [-Wtype-equality-requires-operators]
  19732. 1499.70 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19733. 1499.70 s [algebraic-graphs] will become an error in a future GHC release.
  19734. 1499.70 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19735. 1499.70 s [algebraic-graphs] |
  19736. 1499.70 s [algebraic-graphs] 185 | export :: (Ord a, ToGraph g, ToVertex g ~ a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
  19737. 1499.70 s [algebraic-graphs] | ^
  19738. 1499.70 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 )
  19739. 1499.70 s [algebraic-graphs]
  19740. 1499.70 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:121:63: warning: [-Wtype-equality-requires-operators]
  19741. 1499.70 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19742. 1499.70 s [algebraic-graphs] will become an error in a future GHC release.
  19743. 1499.70 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19744. 1499.70 s [algebraic-graphs] |
  19745. 1499.70 s [algebraic-graphs] 121 | export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g ~ a) => Style a s -> g -> s
  19746. 1499.70 s [algebraic-graphs] | ^
  19747. 1499.70 s [algebraic-graphs]
  19748. 1499.70 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:165:78: warning: [-Wtype-equality-requires-operators]
  19749. 1499.70 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19750. 1499.70 s [algebraic-graphs] will become an error in a future GHC release.
  19751. 1499.70 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19752. 1499.70 s [algebraic-graphs] |
  19753. 1499.70 s [algebraic-graphs] 165 | exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g ~ s) => g -> s
  19754. 1499.70 s [algebraic-graphs] | ^
  19755. 1499.70 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 )
  19756. 1499.70 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 )
  19757. 1499.70 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 )
  19758. 1499.70 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 )
  19759. 1499.70 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 )
  19760. 1499.70 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 )
  19761. 1499.70 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 )
  19762. 1500.11 s [algebraic-graphs] [ 1 of 29] Compiling Algebra.Graph.AdjacencyMap ( src/Algebra/Graph/AdjacencyMap.hs, dist/build/Algebra/Graph/AdjacencyMap.p_o )
  19763. 1501.57 s [algebraic-graphs] [ 2 of 29] Compiling Algebra.Graph.AdjacencyIntMap ( src/Algebra/Graph/AdjacencyIntMap.hs, dist/build/Algebra/Graph/AdjacencyIntMap.p_o )
  19764. 1502.50 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 )
  19765. 1503.34 s [algebraic-graphs] [ 4 of 29] Compiling Algebra.Graph.Internal ( src/Algebra/Graph/Internal.hs, dist/build/Algebra/Graph/Internal.p_o )
  19766. 1503.34 s [algebraic-graphs] [ 5 of 29] Compiling Algebra.Graph ( src/Algebra/Graph.hs, dist/build/Algebra/Graph.p_o )
  19767. 1504.89 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 )
  19768. 1505.48 s [algebraic-graphs] [ 7 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap ( src/Algebra/Graph/Bipartite/AdjacencyMap.hs, dist/build/Algebra/Graph/Bipartite/AdjacencyMap.p_o )
  19769. 1506.06 s [algebraic-graphs] [ 8 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap.Algorithm ( src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs, dist/build/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.p_o )
  19770. 1507.22 s [algebraic-graphs] [ 9 of 29] Compiling Algebra.Graph.Label ( src/Algebra/Graph/Label.hs, dist/build/Algebra/Graph/Label.p_o )
  19771. 1507.22 s [algebraic-graphs] [10 of 29] Compiling Algebra.Graph.NonEmpty.AdjacencyMap ( src/Algebra/Graph/NonEmpty/AdjacencyMap.hs, dist/build/Algebra/Graph/NonEmpty/AdjacencyMap.p_o )
  19772. 1507.23 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 )
  19773. 1507.23 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 )
  19774. 1507.23 s [algebraic-graphs] [13 of 29] Compiling Algebra.Graph.ToGraph ( src/Algebra/Graph/ToGraph.hs, dist/build/Algebra/Graph/ToGraph.p_o )
  19775. 1507.23 s [algebraic-graphs]
  19776. 1507.23 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:171:32: warning: [-Wtype-equality-requires-operators]
  19777. 1507.23 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19778. 1507.23 s [algebraic-graphs] will become an error in a future GHC release.
  19779. 1507.23 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19780. 1507.23 s [algebraic-graphs] |
  19781. 1507.23 s [algebraic-graphs] 171 | vertexIntSet :: ToVertex t ~ Int => t -> IntSet
  19782. 1507.23 s [algebraic-graphs] | ^
  19783. 1507.23 s [algebraic-graphs]
  19784. 1507.23 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:197:29: warning: [-Wtype-equality-requires-operators]
  19785. 1507.23 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19786. 1507.23 s [algebraic-graphs] will become an error in a future GHC release.
  19787. 1507.23 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19788. 1507.23 s [algebraic-graphs] |
  19789. 1507.23 s [algebraic-graphs] 197 | preIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  19790. 1507.23 s [algebraic-graphs] | ^
  19791. 1507.23 s [algebraic-graphs]
  19792. 1507.23 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:215:30: warning: [-Wtype-equality-requires-operators]
  19793. 1507.24 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19794. 1507.24 s [algebraic-graphs] will become an error in a future GHC release.
  19795. 1507.24 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19796. 1507.24 s [algebraic-graphs] |
  19797. 1507.24 s [algebraic-graphs] 215 | postIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  19798. 1507.24 s [algebraic-graphs] | ^
  19799. 1507.24 s [algebraic-graphs]
  19800. 1507.24 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:303:37: warning: [-Wtype-equality-requires-operators]
  19801. 1507.24 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19802. 1507.24 s [algebraic-graphs] will become an error in a future GHC release.
  19803. 1507.24 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19804. 1507.24 s [algebraic-graphs] |
  19805. 1507.24 s [algebraic-graphs] 303 | toAdjacencyIntMap :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  19806. 1507.24 s [algebraic-graphs] | ^
  19807. 1507.24 s [algebraic-graphs]
  19808. 1507.24 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:312:46: warning: [-Wtype-equality-requires-operators]
  19809. 1507.24 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19810. 1507.24 s [algebraic-graphs] will become an error in a future GHC release.
  19811. 1507.24 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19812. 1507.24 s [algebraic-graphs] |
  19813. 1507.24 s [algebraic-graphs] 312 | toAdjacencyIntMapTranspose :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  19814. 1507.24 s [algebraic-graphs] | ^
  19815. 1507.24 s [algebraic-graphs]
  19816. 1507.24 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:452:43: warning: [-Wtype-equality-requires-operators]
  19817. 1507.24 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19818. 1507.24 s [algebraic-graphs] will become an error in a future GHC release.
  19819. 1507.24 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19820. 1507.24 s [algebraic-graphs] |
  19821. 1507.24 s [algebraic-graphs] 452 | adjacencyIntMap :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  19822. 1507.24 s [algebraic-graphs] | ^
  19823. 1507.24 s [algebraic-graphs]
  19824. 1507.24 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:471:52: warning: [-Wtype-equality-requires-operators]
  19825. 1507.24 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19826. 1507.24 s [algebraic-graphs] will become an error in a future GHC release.
  19827. 1507.24 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19828. 1507.24 s [algebraic-graphs] |
  19829. 1507.24 s [algebraic-graphs] 471 | adjacencyIntMapTranspose :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  19830. 1507.24 s [algebraic-graphs] | ^
  19831. 1507.24 s [algebraic-graphs] [14 of 29] Compiling Algebra.Graph.Relation ( src/Algebra/Graph/Relation.hs, dist/build/Algebra/Graph/Relation.p_o )
  19832. 1507.41 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 )
  19833. 1508.05 s [algebraic-graphs] [16 of 29] Compiling Algebra.Graph.NonEmpty ( src/Algebra/Graph/NonEmpty.hs, dist/build/Algebra/Graph/NonEmpty.p_o )
  19834. 1508.05 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 )
  19835. 1508.05 s [algebraic-graphs] [18 of 29] Compiling Algebra.Graph.Labelled ( src/Algebra/Graph/Labelled.hs, dist/build/Algebra/Graph/Labelled.p_o )
  19836. 1508.05 s [algebraic-graphs]
  19837. 1508.05 s [algebraic-graphs] src/Algebra/Graph/Labelled.hs:74:10: warning: [-Wredundant-constraints]
  19838. 1508.05 s [algebraic-graphs] • Redundant constraint: Eq e
  19839. 1508.05 s [algebraic-graphs] • In the instance declaration for ‘Ord (Graph e a)’
  19840. 1508.05 s [algebraic-graphs] |
  19841. 1508.05 s [algebraic-graphs] 74 | instance (Eq e, Monoid e, Ord a, Ord e) => Ord (Graph e a) where
  19842. 1508.05 s [algebraic-graphs] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  19843. 1508.90 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 )
  19844. 1509.20 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 )
  19845. 1509.45 s [algebraic-graphs] [21 of 29] Compiling Algebra.Graph.Export ( src/Algebra/Graph/Export.hs, dist/build/Algebra/Graph/Export.p_o )
  19846. 1509.45 s [algebraic-graphs]
  19847. 1509.45 s [algebraic-graphs] src/Algebra/Graph/Export.hs:185:41: warning: [-Wtype-equality-requires-operators]
  19848. 1509.45 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19849. 1509.45 s [algebraic-graphs] will become an error in a future GHC release.
  19850. 1509.45 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19851. 1509.45 s [algebraic-graphs] |
  19852. 1509.45 s [algebraic-graphs] 185 | export :: (Ord a, ToGraph g, ToVertex g ~ a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
  19853. 1509.45 s [algebraic-graphs] | ^
  19854. 1509.45 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 )
  19855. 1509.45 s [algebraic-graphs]
  19856. 1509.45 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:121:63: warning: [-Wtype-equality-requires-operators]
  19857. 1509.45 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19858. 1509.45 s [algebraic-graphs] will become an error in a future GHC release.
  19859. 1509.45 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19860. 1509.45 s [algebraic-graphs] |
  19861. 1509.45 s [algebraic-graphs] 121 | export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g ~ a) => Style a s -> g -> s
  19862. 1509.46 s [algebraic-graphs] | ^
  19863. 1509.46 s [algebraic-graphs]
  19864. 1509.46 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:165:78: warning: [-Wtype-equality-requires-operators]
  19865. 1509.46 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19866. 1509.46 s [algebraic-graphs] will become an error in a future GHC release.
  19867. 1509.46 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19868. 1509.46 s [algebraic-graphs] |
  19869. 1509.46 s [algebraic-graphs] 165 | exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g ~ s) => g -> s
  19870. 1509.46 s [algebraic-graphs] | ^
  19871. 1509.46 s [algebraic-graphs] [23 of 29] Compiling Algebra.Graph.Undirected ( src/Algebra/Graph/Undirected.hs, dist/build/Algebra/Graph/Undirected.p_o )
  19872. 1509.46 s [algebraic-graphs] [24 of 29] Compiling Algebra.Graph.Class ( src/Algebra/Graph/Class.hs, dist/build/Algebra/Graph/Class.p_o )
  19873. 1509.46 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 )
  19874. 1509.67 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 )
  19875. 1509.68 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 )
  19876. 1509.68 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 )
  19877. 1509.72 s [algebraic-graphs] [29 of 29] Compiling Data.Graph.Typed ( src/Data/Graph/Typed.hs, dist/build/Data/Graph/Typed.p_o )
  19878. 1511.52 s [algebraic-graphs] Preprocessing test suite 'main' for algebraic-graphs-0.7..
  19879. 1511.53 s [algebraic-graphs] Building test suite 'main' for algebraic-graphs-0.7..
  19880. 1511.75 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 )
  19881. 1513.39 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 )
  19882. 1517.97 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 )
  19883. 1517.97 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 )
  19884. 1517.97 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 )
  19885. 1523.40 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 )
  19886. 1523.40 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 )
  19887. 1523.40 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 )
  19888. 1527.93 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 )
  19889. 1528.13 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 )
  19890. 1528.13 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 )
  19891. 1529.56 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 )
  19892. 1529.57 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 )
  19893. 1529.57 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 )
  19894. 1531.21 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 )
  19895. 1531.21 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 )
  19896. 1531.21 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 )
  19897. 1531.21 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 )
  19898. 1531.21 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 )
  19899. 1531.21 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 )
  19900. 1531.21 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:43:1: emptyI === emptyIR passed.
  19901. 1531.21 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:49:1: vertexI === vertexIR passed.
  19902. 1531.21 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:56:1: overlayI === overlayIR passed.
  19903. 1531.21 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:63:1: connectI === connectIR passed.
  19904. 1531.21 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:69:1: overlaysC `hasNoType` GHC.Types.[] passed.
  19905. 1531.21 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:76:1: overlaysP === overlaysPR passed.
  19906. 1531.21 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:82:1: verticesCP `hasNoType` GHC.Types.[] passed.
  19907. 1531.21 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:83:1: verticesCP `hasNoType` Algebra.Graph.Graph passed.
  19908. 1531.21 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:89:1: connectsC `hasNoType` GHC.Types.[] passed.
  19909. 1531.21 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:96:1: connectsP === connectsPR passed.
  19910. 1531.21 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:102:1: isSubgraphOfC `hasNoType` Algebra.Graph.Graph passed.
  19911. 1531.21 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:108:1: cliqueCP `hasNoType` GHC.Types.[] passed.
  19912. 1531.21 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:109:1: cliqueCP `hasNoType` Algebra.Graph.Graph passed.
  19913. 1531.21 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:115:1: edgesCP `hasNoType` GHC.Types.[] passed.
  19914. 1531.21 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:116:1: edgesCP `hasNoType` Algebra.Graph.Graph passed.
  19915. 1531.21 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:122:1: starCP `hasNoType` GHC.Types.[] passed.
  19916. 1531.21 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:123:1: starCP `hasNoType` Algebra.Graph.Graph passed.
  19917. 1531.21 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:130:1: fmapCP `hasNoType` Algebra.Graph.Graph passed.
  19918. 1531.21 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:137:1: bindC === bindCR passed.
  19919. 1531.21 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:144:1: bindP === bindPR passed.
  19920. 1531.21 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:151:1: apC === apCR passed.
  19921. 1531.21 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:159:1: apP === apPR passed.
  19922. 1531.21 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:165:1: eqC `hasNoType` Algebra.Graph.Graph passed.
  19923. 1531.22 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:170:1: eqT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
  19924. 1531.22 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:176:1: ordC `hasNoType` Algebra.Graph.Graph passed.
  19925. 1531.22 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:181:1: ordT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
  19926. 1531.22 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:187:1: isEmptyC `hasNoType` Algebra.Graph.Graph passed.
  19927. 1531.22 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:193:1: sizeC `hasNoType` Algebra.Graph.Graph passed.
  19928. 1531.22 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:199:1: vertexSetC `hasNoType` Algebra.Graph.Graph passed.
  19929. 1531.22 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:205:1: vertexSetC `hasNoType` Algebra.Graph.Graph passed.
  19930. 1531.22 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:210:1: vertexCountT `hasNoType` Data.Set.Internal.Set passed.
  19931. 1531.22 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:216:1: edgeCountC `hasNoType` Algebra.Graph.Graph passed.
  19932. 1531.22 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:221:1: edgeCountT `hasNoType` Data.Set.Internal.Set passed.
  19933. 1531.22 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:227:1: vertexListCP `hasNoType` Algebra.Graph.Graph passed.
  19934. 1531.22 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:228:1: vertexListCP `hasNoType` GHC.Types.[] passed.
  19935. 1531.22 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:233:1: vertexListT `hasNoType` Data.Set.Internal.Set passed.
  19936. 1531.22 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:239:1: edgeSetC `hasNoType` Algebra.Graph.Graph passed.
  19937. 1531.22 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:244:1: vertexListT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
  19938. 1531.22 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:250:1: edgeListCP `hasNoType` Algebra.Graph.Graph passed.
  19939. 1531.22 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:251:1: edgeListCP `hasNoType` GHC.Types.[] passed.
  19940. 1531.22 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:256:1: edgeListT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
  19941. 1531.22 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:262:1: hasVertexC `hasNoType` Algebra.Graph.Graph passed.
  19942. 1531.22 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:268:1: hasEdgeC `hasNoType` Algebra.Graph.Graph passed.
  19943. 1531.22 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:274:1: adjacencyListC `hasNoType` Algebra.Graph.Graph passed.
  19944. 1531.22 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:280:1: pathP `hasNoType` Algebra.Graph.Graph passed.
  19945. 1531.22 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:286:1: circuitP `hasNoType` Algebra.Graph.Graph passed.
  19946. 1531.22 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:292:1: bicliqueCP `hasNoType` GHC.Types.[] passed.
  19947. 1531.22 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:293:1: bicliqueCP `hasNoType` Algebra.Graph.Graph passed.
  19948. 1531.22 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:301:1: replaceVertexCP `hasNoType` Algebra.Graph.Graph passed.
  19949. 1531.22 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:309:1: mergeVerticesCP `hasNoType` Algebra.Graph.Graph passed.
  19950. 1531.22 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:316:1: splitVertexCP `hasNoType` GHC.Types.[] passed.
  19951. 1531.22 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:317:1: splitVertexCP `hasNoType` Algebra.Graph.Graph passed.
  19952. 1531.23 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:324:1: transposeCP `hasNoType` Algebra.Graph.Graph passed.
  19953. 1531.23 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:339:1: simplifyC === simplifyCR passed.
  19954. 1531.23 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:345:1: composeCP `hasNoType` Algebra.Graph.Graph passed.
  19955. 1531.23 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:352:1: induceCP `hasNoType` Algebra.Graph.Graph passed.
  19956. 1531.23 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:359:1: induceJustCP `hasNoType` Algebra.Graph.Graph passed.
  19957. 1531.23 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:365:1: contextC `hasNoType` Algebra.Graph.Graph passed.
  19958. 1531.23 s [algebraic-graphs] inspection testing successful
  19959. 1531.23 s [algebraic-graphs] expected successes: 58
  19960. 1531.23 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 )
  19961. 1531.23 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 )
  19962. 1531.23 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 )
  19963. 1532.26 s [algebraic-graphs] [24 of 24] Linking dist/build/main/main
  19964. 1533.61 s [algebraic-graphs] buildPhase completed in 42 seconds
  19965. 1533.61 s [algebraic-graphs] Phase: checkPhase
  19966. 1533.65 s [algebraic-graphs] Running 1 test suites...
  19967. 1533.65 s [algebraic-graphs] Test suite main: RUNNING...
  19968. 1544.82 s [algebraic-graphs]
  19969. 1544.82 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.Show ============
  19970. 1544.83 s [algebraic-graphs] OK: show empty == "empty"
  19971. 1544.83 s [algebraic-graphs] OK: show (shrink 1) == "vertex 1"
  19972. 1544.83 s [algebraic-graphs] OK: show (shrink $ 1 + 2) == "vertices [1,2]"
  19973. 1544.83 s [algebraic-graphs] OK: show (shrink $ 1 * 2) == "(fromJust . toAcyclic) (edge 1 2)"
  19974. 1544.83 s [algebraic-graphs] OK: show (shrink $ 1 * 2 * 3) == "(fromJust . toAcyclic) (edges [(1,2),(1,3),(2,3)])"
  19975. 1544.83 s [algebraic-graphs] OK: show (shrink $ 1 * 2 + 3) == "(fromJust . toAcyclic) (overlay (vertex 3) (edge 1 2))"
  19976. 1544.83 s [algebraic-graphs]
  19977. 1544.83 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.fromAcyclic ============
  19978. 1544.83 s [algebraic-graphs] OK: fromAcyclic empty == empty
  19979. 1544.83 s [algebraic-graphs] OK: fromAcyclic . vertex == vertex
  19980. 1544.83 s [algebraic-graphs] OK: fromAcyclic (shrink $ 1 * 3 * 2) == star 1 [2,3]
  19981. 1544.83 s [algebraic-graphs] OK: vertexCount . fromAcyclic == vertexCount
  19982. 1544.83 s [algebraic-graphs] OK: edgeCount . fromAcyclic == edgeCount
  19983. 1544.83 s [algebraic-graphs] OK: isAcyclic . fromAcyclic == const True
  19984. 1544.83 s [algebraic-graphs]
  19985. 1544.83 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.empty ============
  19986. 1544.83 s [algebraic-graphs] OK: isEmpty empty == True
  19987. 1544.83 s [algebraic-graphs] OK: hasVertex x empty == False
  19988. 1544.83 s [algebraic-graphs] OK: vertexCount empty == 0
  19989. 1544.83 s [algebraic-graphs] OK: edgeCount empty == 0
  19990. 1544.83 s [algebraic-graphs]
  19991. 1544.83 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertex ============
  19992. 1544.83 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  19993. 1544.83 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  19994. 1544.83 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  19995. 1544.83 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  19996. 1544.83 s [algebraic-graphs]
  19997. 1544.83 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertices ============
  19998. 1544.83 s [algebraic-graphs] OK: vertices [] == empty
  19999. 1544.83 s [algebraic-graphs] OK: vertices [x] == vertex x
  20000. 1544.83 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  20001. 1544.83 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  20002. 1544.83 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  20003. 1544.83 s [algebraic-graphs]
  20004. 1544.83 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.union ============
  20005. 1544.83 s [algebraic-graphs] OK: vertexSet (union x y) == <correct result>
  20006. 1544.83 s [algebraic-graphs] OK: edgeSet (union x y) == <correct result>
  20007. 1544.83 s [algebraic-graphs]
  20008. 1544.83 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.join ============
  20009. 1544.83 s [algebraic-graphs] OK: vertexSet (join x y) == <correct result>
  20010. 1544.83 s [algebraic-graphs] OK: edgeSet (join x y) == <correct result>
  20011. 1544.83 s [algebraic-graphs]
  20012. 1544.83 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.isSubgraphOf ============
  20013. 1544.83 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  20014. 1544.83 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  20015. 1544.83 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  20016. 1544.83 s [algebraic-graphs] OK: isSubgraphOf x (transitiveClosure x) == True
  20017. 1544.83 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  20018. 1544.83 s [algebraic-graphs]
  20019. 1544.83 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.isEmpty ============
  20020. 1544.83 s [algebraic-graphs] OK: isEmpty empty == True
  20021. 1544.83 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  20022. 1544.83 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  20023. 1544.84 s [algebraic-graphs] OK: isEmpty (removeEdge 1 2 $ shrink $ 1 * 2) == False
  20024. 1544.84 s [algebraic-graphs]
  20025. 1544.84 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.hasVertex ============
  20026. 1544.84 s [algebraic-graphs] OK: hasVertex x empty == False
  20027. 1544.84 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20028. 1544.84 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  20029. 1544.84 s [algebraic-graphs]
  20030. 1544.84 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.hasEdge ============
  20031. 1544.84 s [algebraic-graphs] OK: hasEdge x y empty == False
  20032. 1544.84 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  20033. 1544.84 s [algebraic-graphs] OK: hasEdge 1 2 (shrink $ 1 * 2) == True
  20034. 1544.84 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  20035. 1544.84 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  20036. 1544.84 s [algebraic-graphs]
  20037. 1544.84 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertexCount ============
  20038. 1544.84 s [algebraic-graphs] OK: vertexCount empty == 0
  20039. 1544.84 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20040. 1544.84 s [algebraic-graphs] OK: vertexCount == length . vertexList
  20041. 1544.84 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  20042. 1544.84 s [algebraic-graphs]
  20043. 1544.84 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.edgeCount ============
  20044. 1544.84 s [algebraic-graphs] OK: edgeCount empty == 0
  20045. 1544.84 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20046. 1544.84 s [algebraic-graphs] OK: edgeCount (shrink $ 1 * 2) == 1
  20047. 1544.84 s [algebraic-graphs] OK: edgeCount == length . edgeList
  20048. 1544.84 s [algebraic-graphs]
  20049. 1544.84 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertexList ============
  20050. 1544.84 s [algebraic-graphs] OK: vertexList empty == []
  20051. 1544.84 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  20052. 1544.84 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  20053. 1544.84 s [algebraic-graphs]
  20054. 1544.84 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.edgeList ============
  20055. 1544.84 s [algebraic-graphs] OK: edgeList empty == []
  20056. 1544.84 s [algebraic-graphs] OK: edgeList (vertex x) == []
  20057. 1544.84 s [algebraic-graphs] OK: edgeList (shrink $ 2 * 1) == [(2,1)]
  20058. 1544.84 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  20059. 1544.84 s [algebraic-graphs]
  20060. 1544.84 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.adjacencyList ============
  20061. 1544.84 s [algebraic-graphs] OK: adjacencyList empty == []
  20062. 1544.84 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  20063. 1544.84 s [algebraic-graphs] OK: adjacencyList (shrink $ 1 * 2) == [(1, [2]), (2, [])]
  20064. 1544.84 s [algebraic-graphs]
  20065. 1544.84 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertexSet ============
  20066. 1544.84 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  20067. 1544.84 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  20068. 1544.84 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  20069. 1544.84 s [algebraic-graphs]
  20070. 1544.84 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.edgeSet ============
  20071. 1544.84 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  20072. 1544.84 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  20073. 1544.84 s [algebraic-graphs] OK: edgeSet (shrink $ 1 * 2) == Set.singleton (1,2)
  20074. 1544.84 s [algebraic-graphs]
  20075. 1544.84 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.preSet ============
  20076. 1544.84 s [algebraic-graphs] OK: preSet x empty == Set.empty
  20077. 1544.84 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  20078. 1544.84 s [algebraic-graphs] OK: preSet 1 (shrink $ 1 * 2) == Set.empty
  20079. 1544.84 s [algebraic-graphs] OK: preSet 2 (shrink $ 1 * 2) == Set.fromList [1]
  20080. 1544.84 s [algebraic-graphs] OK: Set.member x . preSet x == const False
  20081. 1544.84 s [algebraic-graphs]
  20082. 1544.84 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.postSet ============
  20083. 1544.84 s [algebraic-graphs] OK: postSet x empty == Set.empty
  20084. 1544.84 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  20085. 1544.84 s [algebraic-graphs] OK: postSet 1 (shrink $ 1 * 2) == Set.fromList [2]
  20086. 1544.84 s [algebraic-graphs] OK: postSet 2 (shrink $ 1 * 2) == Set.empty
  20087. 1544.84 s [algebraic-graphs] OK: Set.member x . postSet x == const False
  20088. 1544.84 s [algebraic-graphs]
  20089. 1544.84 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.removeVertex ============
  20090. 1544.84 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  20091. 1544.84 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  20092. 1544.84 s [algebraic-graphs] OK: removeVertex 1 (shrink $ 1 * 2) == vertex 2
  20093. 1544.84 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  20094. 1544.84 s [algebraic-graphs]
  20095. 1544.84 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.removeEdge ============
  20096. 1544.84 s [algebraic-graphs] OK: removeEdge 1 2 (shrink $ 1 * 2) == vertices [1,2]
  20097. 1544.84 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  20098. 1544.84 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  20099. 1544.84 s [algebraic-graphs] OK: removeEdge 1 2 (shrink $ 1 * 2 * 3) == shrink ((1 + 2) * 3)
  20100. 1544.84 s [algebraic-graphs]
  20101. 1544.84 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.transpose ============
  20102. 1544.84 s [algebraic-graphs] OK: transpose empty == empty
  20103. 1544.84 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  20104. 1544.84 s [algebraic-graphs] OK: transpose . transpose == id
  20105. 1544.84 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  20106. 1544.84 s [algebraic-graphs]
  20107. 1544.84 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.induce ============
  20108. 1544.84 s [algebraic-graphs] OK: induce (const True ) x == x
  20109. 1544.84 s [algebraic-graphs] OK: induce (const False) x == empty
  20110. 1544.84 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  20111. 1544.84 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  20112. 1544.84 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  20113. 1544.84 s [algebraic-graphs]
  20114. 1544.84 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.induceJust ============
  20115. 1544.84 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  20116. 1544.84 s [algebraic-graphs] OK: induceJust . vertex . Just == vertex
  20117. 1544.84 s [algebraic-graphs]
  20118. 1544.84 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.box ============
  20119. 1544.84 s [algebraic-graphs] OK: edgeList (box (shrink $ 1 * 2) (shrink $ 10 * 20)) == <correct result>
  20120. 1544.84 s [algebraic-graphs]
  20121. 1544.84 s [algebraic-graphs] OK: box x y ~~ box y x
  20122. 1544.84 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  20123. 1544.84 s [algebraic-graphs] OK: box x empty ~~ empty
  20124. 1544.84 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  20125. 1544.84 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  20126. 1544.84 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  20127. 1544.84 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  20128. 1544.84 s [algebraic-graphs]
  20129. 1544.84 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.transitiveClosure ============
  20130. 1544.84 s [algebraic-graphs] OK: transitiveClosure empty == empty
  20131. 1544.84 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  20132. 1544.84 s [algebraic-graphs] OK: transitiveClosure (shrink $ 1 * 2 + 2 * 3) == shrink (1 * 2 + 1 * 3 + 2 * 3)
  20133. 1544.84 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  20134. 1544.84 s [algebraic-graphs]
  20135. 1544.84 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.topSort ============
  20136. 1544.84 s [algebraic-graphs] OK: topSort empty == []
  20137. 1544.84 s [algebraic-graphs] OK: topSort (vertex x) == [x]
  20138. 1544.84 s [algebraic-graphs] OK: topSort (shrink $ 1 * (2 + 4) + 3 * 4) == [1, 2, 3, 4]
  20139. 1544.84 s [algebraic-graphs] OK: topSort (join x y) == fmap Left (topSort x) ++ fmap Right (topSort y)
  20140. 1544.84 s [algebraic-graphs] OK: Right . topSort == AM.topSort . fromAcyclic
  20141. 1544.84 s [algebraic-graphs]
  20142. 1544.84 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.scc ============
  20143. 1544.84 s [algebraic-graphs] OK: scc empty == empty
  20144. 1544.84 s [algebraic-graphs] OK: scc (vertex x) == vertex (NonEmpty.vertex x)
  20145. 1544.84 s [algebraic-graphs] OK: scc (edge 1 1) == vertex (NonEmpty.edge 1 1)
  20146. 1544.84 s [algebraic-graphs] OK: edgeList $ scc (edge 1 2) == [ (NonEmpty.vertex 1, NonEmpty.vertex 2) ]
  20147. 1544.84 s [algebraic-graphs] OK: edgeList $ scc (3 * 1 * 4 * 1 * 5) == <correct result>
  20148. 1544.84 s [algebraic-graphs]
  20149. 1544.84 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.toAcyclic ============
  20150. 1544.84 s [algebraic-graphs] OK: toAcyclic (path [1,2,3]) == Just (shrink $ 1 * 2 + 2 * 3)
  20151. 1544.84 s [algebraic-graphs] OK: toAcyclic (clique [3,2,1]) == Just (transpose (shrink $ 1 * 2 * 3))
  20152. 1544.84 s [algebraic-graphs] OK: toAcyclic (circuit [1,2,3]) == Nothing
  20153. 1544.84 s [algebraic-graphs] OK: toAcyclic . fromAcyclic == Just
  20154. 1544.84 s [algebraic-graphs]
  20155. 1544.84 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.toAcyclicOrd ============
  20156. 1544.84 s [algebraic-graphs] OK: toAcyclicOrd empty == empty
  20157. 1544.84 s [algebraic-graphs] OK: toAcyclicOrd . vertex == vertex
  20158. 1544.84 s [algebraic-graphs] OK: toAcyclicOrd (1 + 2) == shrink (1 + 2)
  20159. 1544.84 s [algebraic-graphs] OK: toAcyclicOrd (1 * 2) == shrink (1 * 2)
  20160. 1544.84 s [algebraic-graphs] OK: toAcyclicOrd (2 * 1) == shrink (1 + 2)
  20161. 1544.84 s [algebraic-graphs] OK: toAcyclicOrd (1 * 2 * 1) == shrink (1 * 2)
  20162. 1549.06 s [algebraic-graphs] OK: toAcyclicOrd (1 * 2 * 3) == shrink (1 * 2 * 3)
  20163. 1549.06 s [algebraic-graphs]
  20164. 1549.06 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.shrink ============
  20165. 1549.06 s [algebraic-graphs] OK: shrink . AM.vertex == vertex
  20166. 1549.06 s [algebraic-graphs] OK: shrink . AM.vertices == vertices
  20167. 1549.06 s [algebraic-graphs] OK: shrink . fromAcyclic == id
  20168. 1549.06 s [algebraic-graphs]
  20169. 1549.06 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.consistent ============
  20170. 1549.06 s [algebraic-graphs] OK: Arbitrary
  20171. 1549.06 s [algebraic-graphs] OK: empty
  20172. 1549.06 s [algebraic-graphs] OK: vertex
  20173. 1549.06 s [algebraic-graphs] OK: vertices
  20174. 1549.06 s [algebraic-graphs] OK: union
  20175. 1549.06 s [algebraic-graphs] OK: join
  20176. 1549.07 s [algebraic-graphs] OK: transpose
  20177. 1549.07 s [algebraic-graphs] OK: box
  20178. 1549.07 s [algebraic-graphs] OK: transitiveClosure
  20179. 1549.07 s [algebraic-graphs] OK: scc
  20180. 1549.07 s [algebraic-graphs] OK: toAcyclic
  20181. 1549.07 s [algebraic-graphs] OK: toAcyclicOrd
  20182. 1549.07 s [algebraic-graphs]
  20183. 1549.07 s [algebraic-graphs] ============ AdjacencyIntMap ============
  20184. 1549.07 s [algebraic-graphs] OK: Axioms of graphs
  20185. 1549.07 s [algebraic-graphs]
  20186. 1549.07 s [algebraic-graphs] ============ AdjacencyIntMap.fromAdjacencyMap ============
  20187. 1549.07 s [algebraic-graphs] OK: fromAdjacencyMap == stars . AdjacencyMap.adjacencyList
  20188. 1549.07 s [algebraic-graphs]
  20189. 1549.07 s [algebraic-graphs] ============ AdjacencyIntMap.consistent ============
  20190. 1549.07 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  20191. 1549.07 s [algebraic-graphs]
  20192. 1549.07 s [algebraic-graphs] OK: consistent empty == True
  20193. 1549.07 s [algebraic-graphs] OK: consistent (vertex x) == True
  20194. 1549.07 s [algebraic-graphs] OK: consistent (overlay x y) == True
  20195. 1549.07 s [algebraic-graphs] OK: consistent (connect x y) == True
  20196. 1549.07 s [algebraic-graphs] OK: consistent (edge x y) == True
  20197. 1549.07 s [algebraic-graphs] OK: consistent (edges xs) == True
  20198. 1549.07 s [algebraic-graphs] OK: consistent (stars xs) == True
  20199. 1549.07 s [algebraic-graphs]
  20200. 1549.07 s [algebraic-graphs] ============ AdjacencyIntMap.Show ============
  20201. 1549.07 s [algebraic-graphs] OK: show (empty ) == "empty"
  20202. 1549.07 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  20203. 1549.07 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  20204. 1549.07 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  20205. 1549.07 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  20206. 1549.07 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  20207. 1549.07 s [algebraic-graphs]
  20208. 1549.07 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  20209. 1549.07 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  20210. 1549.07 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  20211. 1549.07 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  20212. 1549.07 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  20213. 1549.07 s [algebraic-graphs]
  20214. 1549.07 s [algebraic-graphs] ============ AdjacencyIntMap.Ord ============
  20215. 1549.07 s [algebraic-graphs] OK: vertex 1 < vertex 2
  20216. 1549.07 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  20217. 1549.07 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  20218. 1549.07 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  20219. 1549.07 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  20220. 1549.07 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  20221. 1549.07 s [algebraic-graphs] OK: x <= x + y
  20222. 1549.07 s [algebraic-graphs] OK: x + y <= x * y
  20223. 1549.07 s [algebraic-graphs]
  20224. 1549.07 s [algebraic-graphs] ============ AdjacencyIntMap.empty ============
  20225. 1549.07 s [algebraic-graphs] OK: isEmpty empty == True
  20226. 1549.07 s [algebraic-graphs] OK: hasVertex x empty == False
  20227. 1549.07 s [algebraic-graphs] OK: vertexCount empty == 0
  20228. 1549.07 s [algebraic-graphs] OK: edgeCount empty == 0
  20229. 1549.07 s [algebraic-graphs]
  20230. 1549.07 s [algebraic-graphs] ============ AdjacencyIntMap.vertex ============
  20231. 1549.07 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  20232. 1549.07 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20233. 1549.07 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20234. 1549.07 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20235. 1549.07 s [algebraic-graphs]
  20236. 1549.07 s [algebraic-graphs] ============ AdjacencyIntMap.edge ============
  20237. 1549.07 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  20238. 1549.07 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  20239. 1549.07 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  20240. 1549.07 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  20241. 1549.07 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  20242. 1549.07 s [algebraic-graphs]
  20243. 1549.07 s [algebraic-graphs] ============ AdjacencyIntMap.overlay ============
  20244. 1549.07 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  20245. 1549.07 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  20246. 1549.07 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  20247. 1549.07 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  20248. 1549.07 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  20249. 1549.07 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  20250. 1549.07 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  20251. 1549.07 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  20252. 1549.07 s [algebraic-graphs]
  20253. 1549.07 s [algebraic-graphs] ============ AdjacencyIntMap.connect ============
  20254. 1549.07 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  20255. 1549.07 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  20256. 1549.07 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  20257. 1549.07 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  20258. 1549.07 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  20259. 1549.07 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  20260. 1549.07 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  20261. 1549.07 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  20262. 1549.07 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  20263. 1549.07 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  20264. 1549.07 s [algebraic-graphs]
  20265. 1549.07 s [algebraic-graphs] ============ AdjacencyIntMap.vertices ============
  20266. 1549.07 s [algebraic-graphs] OK: vertices [] == empty
  20267. 1549.07 s [algebraic-graphs] OK: vertices [x] == vertex x
  20268. 1549.07 s [algebraic-graphs] OK: vertices == overlays . map vertex
  20269. 1549.07 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  20270. 1549.07 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  20271. 1549.07 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  20272. 1549.07 s [algebraic-graphs]
  20273. 1549.07 s [algebraic-graphs] ============ AdjacencyIntMap.edges ============
  20274. 1549.07 s [algebraic-graphs] OK: edges [] == empty
  20275. 1549.07 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  20276. 1549.07 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  20277. 1549.07 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  20278. 1549.07 s [algebraic-graphs]
  20279. 1549.07 s [algebraic-graphs] ============ AdjacencyIntMap.overlays ============
  20280. 1549.07 s [algebraic-graphs] OK: overlays [] == empty
  20281. 1549.07 s [algebraic-graphs] OK: overlays [x] == x
  20282. 1549.07 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  20283. 1549.07 s [algebraic-graphs] OK: overlays == foldr overlay empty
  20284. 1549.08 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  20285. 1549.08 s [algebraic-graphs]
  20286. 1549.08 s [algebraic-graphs] ============ AdjacencyIntMap.connects ============
  20287. 1549.08 s [algebraic-graphs] OK: connects [] == empty
  20288. 1549.08 s [algebraic-graphs] OK: connects [x] == x
  20289. 1549.08 s [algebraic-graphs] OK: connects [x,y] == connect x y
  20290. 1549.08 s [algebraic-graphs] OK: connects == foldr connect empty
  20291. 1549.08 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  20292. 1549.08 s [algebraic-graphs]
  20293. 1549.08 s [algebraic-graphs] ============ AdjacencyIntMap.fromAdjacencyIntSets ============
  20294. 1549.08 s [algebraic-graphs] OK: fromAdjacencyIntSets [] == empty
  20295. 1549.08 s [algebraic-graphs] OK: fromAdjacencyIntSets [(x, IntSet.empty)] == vertex x
  20296. 1549.08 s [algebraic-graphs] OK: fromAdjacencyIntSets [(x, IntSet.singleton y)] == edge x y
  20297. 1549.08 s [algebraic-graphs] OK: fromAdjacencyIntSets . map (fmap IntSet.fromList) == stars
  20298. 1549.08 s [algebraic-graphs] OK: overlay (fromAdjacencyIntSets xs) (fromAdjacencyIntSets ys) == fromAdjacencyIntSets (xs ++ ys)
  20299. 1549.08 s [algebraic-graphs]
  20300. 1549.08 s [algebraic-graphs] ============ AdjacencyIntMap.isSubgraphOf ============
  20301. 1549.08 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  20302. 1549.08 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  20303. 1549.08 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  20304. 1549.08 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  20305. 1549.08 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  20306. 1549.08 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  20307. 1549.08 s [algebraic-graphs]
  20308. 1549.08 s [algebraic-graphs] ============ AdjacencyIntMap.toGraph et al. ============
  20309. 1549.08 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  20310. 1549.08 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  20311. 1549.08 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  20312. 1549.08 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  20313. 1549.08 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  20314. 1549.08 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  20315. 1549.08 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  20316. 1549.08 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  20317. 1549.08 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  20318. 1549.08 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  20319. 1549.08 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  20320. 1549.08 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  20321. 1549.08 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  20322. 1549.08 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  20323. 1549.08 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  20324. 1549.08 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  20325. 1549.08 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  20326. 1549.08 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  20327. 1549.08 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  20328. 1549.08 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  20329. 1549.08 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  20330. 1549.08 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  20331. 1549.08 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  20332. 1549.08 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  20333. 1549.08 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  20334. 1549.08 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  20335. 1549.08 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  20336. 1549.08 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  20337. 1549.08 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  20338. 1549.08 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  20339. 1549.08 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  20340. 1549.08 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  20341. 1549.08 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  20342. 1549.08 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  20343. 1550.06 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  20344. 1550.06 s [algebraic-graphs]
  20345. 1550.06 s [algebraic-graphs] ============ AdjacencyIntMap.foldg ============
  20346. 1550.11 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  20347. 1550.11 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  20348. 1550.11 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  20349. 1550.11 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  20350. 1550.11 s [algebraic-graphs]
  20351. 1550.11 s [algebraic-graphs] ============ AdjacencyIntMap.isEmpty ============
  20352. 1550.11 s [algebraic-graphs] OK: isEmpty empty == True
  20353. 1550.11 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  20354. 1550.11 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  20355. 1550.11 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  20356. 1550.11 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  20357. 1550.11 s [algebraic-graphs]
  20358. 1550.11 s [algebraic-graphs] ============ AdjacencyIntMap.hasVertex ============
  20359. 1550.11 s [algebraic-graphs] OK: hasVertex x empty == False
  20360. 1550.11 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20361. 1550.11 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  20362. 1550.11 s [algebraic-graphs]
  20363. 1550.11 s [algebraic-graphs] ============ AdjacencyIntMap.hasEdge ============
  20364. 1550.11 s [algebraic-graphs] OK: hasEdge x y empty == False
  20365. 1550.11 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  20366. 1550.11 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  20367. 1550.11 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  20368. 1550.11 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  20369. 1550.11 s [algebraic-graphs]
  20370. 1550.11 s [algebraic-graphs] ============ AdjacencyIntMap.vertexCount ============
  20371. 1550.11 s [algebraic-graphs] OK: vertexCount empty == 0
  20372. 1550.11 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20373. 1550.11 s [algebraic-graphs] OK: vertexCount == length . vertexList
  20374. 1550.11 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  20375. 1550.11 s [algebraic-graphs]
  20376. 1550.11 s [algebraic-graphs] ============ AdjacencyIntMap.edgeCount ============
  20377. 1550.11 s [algebraic-graphs] OK: edgeCount empty == 0
  20378. 1550.11 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20379. 1550.11 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  20380. 1550.11 s [algebraic-graphs] OK: edgeCount == length . edgeList
  20381. 1550.11 s [algebraic-graphs]
  20382. 1550.11 s [algebraic-graphs] ============ AdjacencyIntMap.vertexList ============
  20383. 1550.11 s [algebraic-graphs] OK: vertexList empty == []
  20384. 1550.11 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  20385. 1550.11 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  20386. 1550.11 s [algebraic-graphs]
  20387. 1550.11 s [algebraic-graphs] ============ AdjacencyIntMap.vertexSet ============
  20388. 1550.11 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  20389. 1550.11 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  20390. 1550.11 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  20391. 1550.11 s [algebraic-graphs]
  20392. 1550.11 s [algebraic-graphs] ============ AdjacencyIntMap.vertexIntSet ============
  20393. 1550.11 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  20394. 1550.11 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  20395. 1550.11 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  20396. 1550.11 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  20397. 1550.11 s [algebraic-graphs]
  20398. 1550.11 s [algebraic-graphs] ============ AdjacencyIntMap.edgeList ============
  20399. 1550.11 s [algebraic-graphs] OK: edgeList empty == []
  20400. 1550.11 s [algebraic-graphs] OK: edgeList (vertex x) == []
  20401. 1550.11 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  20402. 1550.11 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  20403. 1550.11 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  20404. 1550.11 s [algebraic-graphs]
  20405. 1550.11 s [algebraic-graphs] ============ AdjacencyIntMap.edgeSet ============
  20406. 1550.11 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  20407. 1550.11 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  20408. 1550.11 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  20409. 1550.11 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  20410. 1550.11 s [algebraic-graphs]
  20411. 1550.11 s [algebraic-graphs] ============ AdjacencyIntMap.adjacencyList ============
  20412. 1550.11 s [algebraic-graphs] OK: adjacencyList empty == []
  20413. 1550.11 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  20414. 1550.11 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  20415. 1550.12 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  20416. 1550.12 s [algebraic-graphs]
  20417. 1550.12 s [algebraic-graphs] ============ AdjacencyIntMap.preSet ============
  20418. 1550.12 s [algebraic-graphs] OK: preSet x empty == Set.empty
  20419. 1550.12 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  20420. 1550.12 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  20421. 1550.12 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  20422. 1550.12 s [algebraic-graphs]
  20423. 1550.12 s [algebraic-graphs] ============ AdjacencyIntMap.preIntSet ============
  20424. 1550.12 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  20425. 1550.12 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  20426. 1550.12 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  20427. 1550.12 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  20428. 1550.12 s [algebraic-graphs]
  20429. 1550.12 s [algebraic-graphs] ============ AdjacencyIntMap.postSet ============
  20430. 1550.12 s [algebraic-graphs] OK: postSet x empty == Set.empty
  20431. 1550.12 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  20432. 1550.12 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  20433. 1550.12 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  20434. 1550.12 s [algebraic-graphs]
  20435. 1550.12 s [algebraic-graphs] ============ AdjacencyIntMap.postIntSet ============
  20436. 1550.12 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  20437. 1550.12 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  20438. 1550.12 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  20439. 1550.12 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  20440. 1550.12 s [algebraic-graphs]
  20441. 1550.12 s [algebraic-graphs] ============ AdjacencyIntMap.path ============
  20442. 1550.12 s [algebraic-graphs] OK: path [] == empty
  20443. 1550.12 s [algebraic-graphs] OK: path [x] == vertex x
  20444. 1550.12 s [algebraic-graphs] OK: path [x,y] == edge x y
  20445. 1550.12 s [algebraic-graphs]
  20446. 1550.12 s [algebraic-graphs] ============ AdjacencyIntMap.circuit ============
  20447. 1550.12 s [algebraic-graphs] OK: circuit [] == empty
  20448. 1550.12 s [algebraic-graphs] OK: circuit [x] == edge x x
  20449. 1550.12 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  20450. 1550.12 s [algebraic-graphs]
  20451. 1550.12 s [algebraic-graphs] ============ AdjacencyIntMap.clique ============
  20452. 1550.12 s [algebraic-graphs] OK: clique [] == empty
  20453. 1550.12 s [algebraic-graphs] OK: clique [x] == vertex x
  20454. 1550.12 s [algebraic-graphs] OK: clique [x,y] == edge x y
  20455. 1550.12 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  20456. 1550.12 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  20457. 1550.12 s [algebraic-graphs]
  20458. 1550.12 s [algebraic-graphs] ============ AdjacencyIntMap.biclique ============
  20459. 1550.12 s [algebraic-graphs] OK: biclique [] [] == empty
  20460. 1550.12 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  20461. 1550.12 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  20462. 1550.12 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  20463. 1550.12 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  20464. 1550.12 s [algebraic-graphs]
  20465. 1550.12 s [algebraic-graphs] ============ AdjacencyIntMap.star ============
  20466. 1550.12 s [algebraic-graphs] OK: star x [] == vertex x
  20467. 1550.12 s [algebraic-graphs] OK: star x [y] == edge x y
  20468. 1550.12 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  20469. 1550.12 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  20470. 1550.12 s [algebraic-graphs]
  20471. 1550.12 s [algebraic-graphs] ============ AdjacencyIntMap.stars ============
  20472. 1550.12 s [algebraic-graphs] OK: stars [] == empty
  20473. 1550.12 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  20474. 1550.12 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  20475. 1550.12 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  20476. 1550.12 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  20477. 1550.12 s [algebraic-graphs] OK: stars . adjacencyList == id
  20478. 1550.12 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  20479. 1550.12 s [algebraic-graphs]
  20480. 1550.12 s [algebraic-graphs] ============ AdjacencyIntMap.tree ============
  20481. 1550.12 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  20482. 1550.12 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  20483. 1550.12 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  20484. 1550.12 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  20485. 1550.12 s [algebraic-graphs]
  20486. 1550.12 s [algebraic-graphs] ============ AdjacencyIntMap.forest ============
  20487. 1550.12 s [algebraic-graphs] OK: forest [] == empty
  20488. 1550.12 s [algebraic-graphs] OK: forest [x] == tree x
  20489. 1550.12 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  20490. 1550.12 s [algebraic-graphs] OK: forest == overlays . map tree
  20491. 1550.12 s [algebraic-graphs]
  20492. 1550.12 s [algebraic-graphs] ============ AdjacencyIntMap.removeVertex ============
  20493. 1550.12 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  20494. 1550.12 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  20495. 1550.12 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  20496. 1550.12 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  20497. 1550.12 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  20498. 1550.12 s [algebraic-graphs]
  20499. 1550.12 s [algebraic-graphs] ============ AdjacencyIntMap.removeEdge ============
  20500. 1550.12 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  20501. 1550.12 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  20502. 1550.12 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  20503. 1550.12 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  20504. 1550.12 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  20505. 1550.12 s [algebraic-graphs]
  20506. 1550.12 s [algebraic-graphs] ============ AdjacencyIntMap.replaceVertex ============
  20507. 1550.12 s [algebraic-graphs] OK: replaceVertex x x == id
  20508. 1550.12 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  20509. 1550.12 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  20510. 1550.12 s [algebraic-graphs]
  20511. 1550.12 s [algebraic-graphs] ============ AdjacencyIntMap.mergeVertices ============
  20512. 1550.12 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  20513. 1550.12 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  20514. 1550.12 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  20515. 1550.12 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  20516. 1550.12 s [algebraic-graphs]
  20517. 1550.12 s [algebraic-graphs] ============ AdjacencyIntMap.transpose ============
  20518. 1550.12 s [algebraic-graphs] OK: transpose empty == empty
  20519. 1550.12 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  20520. 1550.12 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  20521. 1550.12 s [algebraic-graphs] OK: transpose . transpose == id
  20522. 1550.12 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  20523. 1550.12 s [algebraic-graphs]
  20524. 1550.12 s [algebraic-graphs] ============ AdjacencyIntMap.gmap ============
  20525. 1550.12 s [algebraic-graphs] OK: gmap f empty == empty
  20526. 1550.12 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  20527. 1550.12 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  20528. 1550.12 s [algebraic-graphs] OK: gmap id == id
  20529. 1550.12 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  20530. 1550.12 s [algebraic-graphs]
  20531. 1550.12 s [algebraic-graphs] ============ AdjacencyIntMap.induce ============
  20532. 1550.12 s [algebraic-graphs] OK: induce (const True ) x == x
  20533. 1550.12 s [algebraic-graphs] OK: induce (const False) x == empty
  20534. 1550.12 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  20535. 1550.12 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  20536. 1550.12 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  20537. 1550.12 s [algebraic-graphs]
  20538. 1550.12 s [algebraic-graphs] ============ AdjacencyIntMap.compose ============
  20539. 1550.12 s [algebraic-graphs] OK: compose empty x == empty
  20540. 1550.12 s [algebraic-graphs] OK: compose x empty == empty
  20541. 1550.12 s [algebraic-graphs] OK: compose (vertex x) y == empty
  20542. 1550.12 s [algebraic-graphs] OK: compose x (vertex y) == empty
  20543. 1550.12 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  20544. 1550.12 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  20545. 1550.30 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  20546. 1550.30 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  20547. 1550.30 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  20548. 1550.30 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  20549. 1550.30 s [algebraic-graphs]
  20550. 1550.30 s [algebraic-graphs] ============ AdjacencyIntMap.closure ============
  20551. 1550.30 s [algebraic-graphs] OK: closure empty == empty
  20552. 1550.30 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  20553. 1550.30 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  20554. 1550.30 s [algebraic-graphs] OK: closure (edge x y) == edges [(x,x), (x,y), (y,y)]
  20555. 1550.30 s [algebraic-graphs] OK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
  20556. 1550.30 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  20557. 1550.30 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  20558. 1550.30 s [algebraic-graphs] OK: closure . closure == closure
  20559. 1550.30 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  20560. 1550.30 s [algebraic-graphs]
  20561. 1550.30 s [algebraic-graphs] ============ AdjacencyIntMap.reflexiveClosure ============
  20562. 1550.30 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  20563. 1550.30 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  20564. 1550.30 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  20565. 1550.30 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges [(x,x), (x,y), (y,y)]
  20566. 1550.30 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  20567. 1550.30 s [algebraic-graphs]
  20568. 1550.30 s [algebraic-graphs] ============ AdjacencyIntMap.symmetricClosure ============
  20569. 1550.30 s [algebraic-graphs] OK: symmetricClosure empty == empty
  20570. 1550.30 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  20571. 1550.30 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges [(x,y), (y,x)]
  20572. 1550.30 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  20573. 1550.30 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  20574. 1550.30 s [algebraic-graphs]
  20575. 1550.30 s [algebraic-graphs] ============ AdjacencyIntMap.transitiveClosure ============
  20576. 1550.30 s [algebraic-graphs] OK: transitiveClosure empty == empty
  20577. 1550.30 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  20578. 1550.30 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  20579. 1550.30 s [algebraic-graphs] OK: transitiveClosure (path $ nub xs) == clique (nub $ xs)
  20580. 1550.30 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  20581. 1550.30 s [algebraic-graphs]
  20582. 1550.30 s [algebraic-graphs] ============ AdjacencyIntMap.bfsForest ============
  20583. 1550.30 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0] == empty
  20584. 1550.30 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [1] == edge 1 2
  20585. 1550.30 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2] == vertex 2
  20586. 1550.30 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0,1,2] == vertices [1,2]
  20587. 1550.30 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2,1,0] == vertices [1,2]
  20588. 1550.30 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 1) [1] == vertex 1
  20589. 1550.30 s [algebraic-graphs] OK: isSubgraphOf (forest $ bfsForest x vs) x == True
  20590. 1550.30 s [algebraic-graphs] OK: bfsForest x (vertexList x) == map ( -> Node v []) (nub $ vertexList x)
  20591. 1550.30 s [algebraic-graphs] OK: bfsForest x [] == []
  20592. 1550.30 s [algebraic-graphs] OK: bfsForest empty vs == []
  20593. 1550.30 s [algebraic-graphs] OK: bfsForest (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
  20594. 1550.30 s [algebraic-graphs] OK: forest $ bfsForest (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1] + path [3,4,5]
  20595. 1550.30 s [algebraic-graphs]
  20596. 1550.30 s [algebraic-graphs] ============ AdjacencyIntMap.bfs ============
  20597. 1550.31 s [algebraic-graphs] OK: bfs (edge 1 2) [0] == []
  20598. 1550.31 s [algebraic-graphs] OK: bfs (edge 1 2) [1] == [[1], [2]]
  20599. 1550.31 s [algebraic-graphs] OK: bfs (edge 1 2) [2] == [[2]]
  20600. 1550.31 s [algebraic-graphs] OK: bfs (edge 1 2) [1,2] == [[1,2]]
  20601. 1550.31 s [algebraic-graphs] OK: bfs (edge 1 2) [2,1] == [[2,1]]
  20602. 1550.31 s [algebraic-graphs] OK: bfs (edge 1 1) [1] == [[1]]
  20603. 1550.31 s [algebraic-graphs] OK: bfs empty vs == []
  20604. 1550.31 s [algebraic-graphs] OK: bfs x [] == []
  20605. 1550.31 s [algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,2] == [[1,2]]
  20606. 1550.31 s [algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,3] == [[1,3], [2,4]]
  20607. 1550.31 s [algebraic-graphs] OK: bfs (3 * (1 + 4) * (1 + 5)) [3] == [[3], [1,4,5]]
  20608. 1550.31 s [algebraic-graphs] OK: bfs (circuit [1..5] + circuit [5,4..1]) [2] == [[2], [1,3], [5,4]]
  20609. 1550.31 s [algebraic-graphs] OK: concat $ bfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,4,1,5]
  20610. 1550.31 s [algebraic-graphs] OK: map concat . transpose . map levels . bfsForest x == bfs x
  20611. 1550.31 s [algebraic-graphs]
  20612. 1550.31 s [algebraic-graphs] ============ AdjacencyIntMap.dfsForest ============
  20613. 1550.31 s [algebraic-graphs] OK: forest $ dfsForest empty == empty
  20614. 1550.31 s [algebraic-graphs] OK: forest $ dfsForest (edge 1 1) == vertex 1
  20615. 1550.31 s [algebraic-graphs] OK: forest $ dfsForest (edge 1 2) == edge 1 2
  20616. 1550.31 s [algebraic-graphs] OK: forest $ dfsForest (edge 2 1) == vertices [1,2]
  20617. 1550.31 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForest x) x == True
  20618. 1550.31 s [algebraic-graphs] OK: isDfsForestOf (dfsForest x) x == True
  20619. 1550.31 s [algebraic-graphs] OK: dfsForest . forest . dfsForest == dfsForest
  20620. 1550.31 s [algebraic-graphs] OK: dfsForest (vertices vs) == map (\v -> Node v []) (nub $ sort vs)
  20621. 1550.31 s [algebraic-graphs] OK: dfsForest $ 3 * (1 + 4) * (1 + 5) == <correct result>
  20622. 1550.31 s [algebraic-graphs] OK: forest (dfsForest $ circuit [1..5] + circuit [5,4..1]) == path [1,2,3,4,5]
  20623. 1550.31 s [algebraic-graphs]
  20624. 1550.31 s [algebraic-graphs] ============ AdjacencyIntMap.dfsForestFrom ============
  20625. 1550.31 s [algebraic-graphs] OK: forest $ dfsForestFrom empty vs == empty
  20626. 1550.31 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 1) [1] == vertex 1
  20627. 1550.31 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [0] == empty
  20628. 1550.31 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1] == edge 1 2
  20629. 1550.31 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2] == vertex 2
  20630. 1550.31 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1,2] == edge 1 2
  20631. 1550.31 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2,1] == vertices [1,2]
  20632. 1550.31 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForestFrom x vs) x == True
  20633. 1550.31 s [algebraic-graphs] OK: isDfsForestOf (dfsForestFrom x (vertexList x)) x == True
  20634. 1550.31 s [algebraic-graphs] OK: dfsForestFrom x (vertexList x) == dfsForest x
  20635. 1550.31 s [algebraic-graphs] OK: dfsForestFrom x [] == []
  20636. 1550.31 s [algebraic-graphs] OK: dfsForestFrom (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
  20637. 1550.31 s [algebraic-graphs] OK: forest $ dfsForestFrom (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1,5,4]
  20638. 1550.31 s [algebraic-graphs]
  20639. 1550.31 s [algebraic-graphs] ============ AdjacencyIntMap.dfs ============
  20640. 1550.31 s [algebraic-graphs] OK: dfs empty vs == []
  20641. 1550.31 s [algebraic-graphs] OK: dfs (edge 1 1) [1] == [1]
  20642. 1550.31 s [algebraic-graphs] OK: dfs (edge 1 2) [0] == []
  20643. 1550.31 s [algebraic-graphs] OK: dfs (edge 1 2) [1] == [1,2]
  20644. 1550.31 s [algebraic-graphs] OK: dfs (edge 1 2) [2] == [2]
  20645. 1550.31 s [algebraic-graphs] OK: dfs (edge 1 2) [1,2] == [1,2]
  20646. 1550.31 s [algebraic-graphs] OK: dfs (edge 1 2) [2,1] == [2,1]
  20647. 1550.31 s [algebraic-graphs] OK: dfs x [] == []
  20648. 1550.31 s [algebraic-graphs]
  20649. 1550.31 s [algebraic-graphs] OK: and [ hasVertex v x | v <- dfs x vs ] == True
  20650. 1550.31 s [algebraic-graphs] OK: dfs (3 * (1 + 4) * (1 + 5)) [1,4] == [1,5,4]
  20651. 1550.31 s [algebraic-graphs] OK: dfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,1,5,4]
  20652. 1550.31 s [algebraic-graphs]
  20653. 1550.31 s [algebraic-graphs] ============ AdjacencyIntMap.dfs ============
  20654. 1550.31 s [algebraic-graphs] OK: reachable empty x == []
  20655. 1550.31 s [algebraic-graphs] OK: reachable (vertex 1) 1 == [1]
  20656. 1550.31 s [algebraic-graphs] OK: reachable (edge 1 1) 1 == [1]
  20657. 1550.31 s [algebraic-graphs] OK: reachable (edge 1 2) 0 == []
  20658. 1550.31 s [algebraic-graphs] OK: reachable (edge 1 2) 1 == [1,2]
  20659. 1550.31 s [algebraic-graphs] OK: reachable (edge 1 2) 2 == [2]
  20660. 1550.31 s [algebraic-graphs] OK: reachable (path [1..8] ) 4 == [4..8]
  20661. 1550.31 s [algebraic-graphs] OK: reachable (circuit [1..8] ) 4 == [4..8] ++ [1..3]
  20662. 1550.31 s [algebraic-graphs] OK: reachable (clique [8,7..1]) 8 == [8] ++ [1..7]
  20663. 1550.31 s [algebraic-graphs]
  20664. 1550.31 s [algebraic-graphs] OK: and [ hasVertex v x | v <- reachable x y ] == True
  20665. 1550.31 s [algebraic-graphs]
  20666. 1550.31 s [algebraic-graphs] ============ AdjacencyIntMap.topSort ============
  20667. 1550.31 s [algebraic-graphs] OK: topSort (1 * 2 + 3 * 1) == Right [3,1,2]
  20668. 1550.31 s [algebraic-graphs] OK: topSort (path [1..5]) == Right [1..5]
  20669. 1550.31 s [algebraic-graphs] OK: topSort (3 * (1 * 4 + 2 * 5)) == Right [3,1,2,4,5]
  20670. 1550.31 s [algebraic-graphs] OK: topSort (1 * 2 + 2 * 1) == Left (2 :| [1])
  20671. 1550.31 s [algebraic-graphs] OK: topSort (path [5,4..1] + edge 2 4) == Left (4 :| [3,2])
  20672. 1550.31 s [algebraic-graphs] OK: topSort (circuit [1..5]) == Left (3 :| [1,2])
  20673. 1550.31 s [algebraic-graphs] OK: topSort (circuit [1..3] + circuit [3,2,1]) == Left (3 :| [2])
  20674. 1550.31 s [algebraic-graphs] OK: topSort (1 * 2 + (5 + 2) * 1 + 3 * 4 * 3) == Left (1 :| [2])
  20675. 1550.31 s [algebraic-graphs] OK: fmap (flip isTopSortOf x) (topSort x) /= Right False
  20676. 1550.31 s [algebraic-graphs] OK: topSort . vertices == Right . nub . sort
  20677. 1550.31 s [algebraic-graphs]
  20678. 1550.31 s [algebraic-graphs] ============ AdjacencyIntMap.testIsAcyclic ============
  20679. 1550.31 s [algebraic-graphs] OK: isAcyclic (1 * 2 + 3 * 1) == True
  20680. 1550.31 s [algebraic-graphs] OK: isAcyclic (1 * 2 + 2 * 1) == False
  20681. 1550.31 s [algebraic-graphs] OK: isAcyclic . circuit == null
  20682. 1550.31 s [algebraic-graphs] OK: isAcyclic == isRight . topSort
  20683. 1550.31 s [algebraic-graphs]
  20684. 1550.31 s [algebraic-graphs] ============ AdjacencyIntMap.isDfsForestOf ============
  20685. 1550.31 s [algebraic-graphs] OK: isDfsForestOf [] empty == True
  20686. 1550.31 s [algebraic-graphs] OK: isDfsForestOf [] (vertex 1) == False
  20687. 1550.31 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 1) == True
  20688. 1550.31 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 2) == False
  20689. 1550.31 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 1 []] (vertex 1) == False
  20690. 1550.31 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 1) == True
  20691. 1550.31 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 2) == False
  20692. 1550.31 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (edge 1 2) == False
  20693. 1550.31 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (edge 1 2) == True
  20694. 1550.31 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (edge 1 2) == True
  20695. 1550.31 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (vertices [1,2]) == True
  20696. 1550.31 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (vertices [1,2]) == True
  20697. 1550.31 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (vertices [1,2]) == False
  20698. 1557.98 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 [Node 3 []]]] (path [1,2,3]) == True
  20699. 1557.98 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 3 [Node 2 []]]] (path [1,2,3]) == False
  20700. 1557.99 s [algebraic-graphs] OK: isDfsForestOf [Node 3 [], Node 1 [Node 2 []]] (path [1,2,3]) == True
  20701. 1557.99 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [Node 3 []], Node 1 []] (path [1,2,3]) == True
  20702. 1557.99 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 [Node 3 []]] (path [1,2,3]) == False
  20703. 1557.99 s [algebraic-graphs]
  20704. 1557.99 s [algebraic-graphs] ============ AdjacencyIntMap.isTopSortOf ============
  20705. 1557.99 s [algebraic-graphs] OK: isTopSortOf [3,1,2] (1 * 2 + 3 * 1) == True
  20706. 1557.99 s [algebraic-graphs] OK: isTopSortOf [1,2,3] (1 * 2 + 3 * 1) == False
  20707. 1557.99 s [algebraic-graphs] OK: isTopSortOf [] (1 * 2 + 3 * 1) == False
  20708. 1557.99 s [algebraic-graphs] OK: isTopSortOf [] empty == True
  20709. 1557.99 s [algebraic-graphs] OK: isTopSortOf [x] (vertex x) == True
  20710. 1557.99 s [algebraic-graphs] OK: isTopSortOf [x] (edge x x) == False
  20711. 1557.99 s [algebraic-graphs]
  20712. 1557.99 s [algebraic-graphs] ============ AdjacencyMap ============
  20713. 1557.99 s [algebraic-graphs] OK: Axioms of graphs
  20714. 1557.99 s [algebraic-graphs]
  20715. 1557.99 s [algebraic-graphs] ============ AdjacencyMap.consistent ============
  20716. 1557.99 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  20717. 1557.99 s [algebraic-graphs]
  20718. 1557.99 s [algebraic-graphs] OK: consistent empty == True
  20719. 1558.00 s [algebraic-graphs] OK: consistent (vertex x) == True
  20720. 1558.00 s [algebraic-graphs] OK: consistent (overlay x y) == True
  20721. 1558.00 s [algebraic-graphs] OK: consistent (connect x y) == True
  20722. 1558.00 s [algebraic-graphs] OK: consistent (edge x y) == True
  20723. 1558.00 s [algebraic-graphs] OK: consistent (edges xs) == True
  20724. 1558.00 s [algebraic-graphs] OK: consistent (stars xs) == True
  20725. 1558.00 s [algebraic-graphs]
  20726. 1558.00 s [algebraic-graphs] ============ AdjacencyMap.Show ============
  20727. 1558.00 s [algebraic-graphs] OK: show (empty ) == "empty"
  20728. 1558.00 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  20729. 1558.00 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  20730. 1558.00 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  20731. 1558.00 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  20732. 1558.00 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  20733. 1558.00 s [algebraic-graphs]
  20734. 1558.00 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  20735. 1558.00 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  20736. 1558.00 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  20737. 1558.00 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  20738. 1558.00 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  20739. 1558.00 s [algebraic-graphs]
  20740. 1558.00 s [algebraic-graphs] ============ AdjacencyMap.Ord ============
  20741. 1558.00 s [algebraic-graphs] OK: vertex 1 < vertex 2
  20742. 1558.00 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  20743. 1558.00 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  20744. 1558.00 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  20745. 1558.00 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  20746. 1558.00 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  20747. 1558.00 s [algebraic-graphs] OK: x <= x + y
  20748. 1558.00 s [algebraic-graphs] OK: x + y <= x * y
  20749. 1558.00 s [algebraic-graphs]
  20750. 1558.00 s [algebraic-graphs] ============ AdjacencyMap.empty ============
  20751. 1558.00 s [algebraic-graphs] OK: isEmpty empty == True
  20752. 1558.00 s [algebraic-graphs] OK: hasVertex x empty == False
  20753. 1558.00 s [algebraic-graphs] OK: vertexCount empty == 0
  20754. 1558.00 s [algebraic-graphs] OK: edgeCount empty == 0
  20755. 1558.00 s [algebraic-graphs]
  20756. 1558.00 s [algebraic-graphs] ============ AdjacencyMap.vertex ============
  20757. 1558.00 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  20758. 1558.00 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20759. 1558.00 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20760. 1558.00 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20761. 1558.00 s [algebraic-graphs]
  20762. 1558.00 s [algebraic-graphs] ============ AdjacencyMap.edge ============
  20763. 1558.00 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  20764. 1558.00 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  20765. 1558.00 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  20766. 1558.00 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  20767. 1558.00 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  20768. 1558.00 s [algebraic-graphs]
  20769. 1558.00 s [algebraic-graphs] ============ AdjacencyMap.overlay ============
  20770. 1558.00 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  20771. 1558.00 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  20772. 1558.00 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  20773. 1558.00 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  20774. 1558.00 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  20775. 1558.00 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  20776. 1558.00 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  20777. 1558.00 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  20778. 1558.00 s [algebraic-graphs]
  20779. 1558.00 s [algebraic-graphs] ============ AdjacencyMap.connect ============
  20780. 1558.00 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  20781. 1558.00 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  20782. 1558.00 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  20783. 1558.00 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  20784. 1558.00 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  20785. 1558.00 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  20786. 1558.00 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  20787. 1558.00 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  20788. 1558.00 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  20789. 1558.00 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  20790. 1558.00 s [algebraic-graphs]
  20791. 1558.00 s [algebraic-graphs] ============ AdjacencyMap.vertices ============
  20792. 1558.00 s [algebraic-graphs] OK: vertices [] == empty
  20793. 1558.00 s [algebraic-graphs] OK: vertices [x] == vertex x
  20794. 1558.00 s [algebraic-graphs] OK: vertices == overlays . map vertex
  20795. 1558.00 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  20796. 1558.00 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  20797. 1558.00 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  20798. 1558.00 s [algebraic-graphs]
  20799. 1558.00 s [algebraic-graphs] ============ AdjacencyMap.edges ============
  20800. 1558.00 s [algebraic-graphs] OK: edges [] == empty
  20801. 1558.00 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  20802. 1558.00 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  20803. 1558.00 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  20804. 1558.00 s [algebraic-graphs]
  20805. 1558.00 s [algebraic-graphs] ============ AdjacencyMap.overlays ============
  20806. 1558.00 s [algebraic-graphs] OK: overlays [] == empty
  20807. 1558.00 s [algebraic-graphs] OK: overlays [x] == x
  20808. 1558.00 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  20809. 1558.00 s [algebraic-graphs] OK: overlays == foldr overlay empty
  20810. 1558.00 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  20811. 1558.00 s [algebraic-graphs]
  20812. 1558.00 s [algebraic-graphs] ============ AdjacencyMap.connects ============
  20813. 1558.00 s [algebraic-graphs] OK: connects [] == empty
  20814. 1558.00 s [algebraic-graphs] OK: connects [x] == x
  20815. 1558.00 s [algebraic-graphs] OK: connects [x,y] == connect x y
  20816. 1558.00 s [algebraic-graphs] OK: connects == foldr connect empty
  20817. 1558.00 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  20818. 1558.00 s [algebraic-graphs]
  20819. 1558.00 s [algebraic-graphs] ============ AdjacencyMap.fromAdjacencySets ============
  20820. 1558.00 s [algebraic-graphs] OK: fromAdjacencySets [] == empty
  20821. 1558.00 s [algebraic-graphs] OK: fromAdjacencySets [(x, Set.empty)] == vertex x
  20822. 1558.00 s [algebraic-graphs] OK: fromAdjacencySets [(x, Set.singleton y)] == edge x y
  20823. 1558.00 s [algebraic-graphs] OK: fromAdjacencySets . map (fmap Set.fromList) == stars
  20824. 1558.00 s [algebraic-graphs] OK: overlay (fromAdjacencySets xs) (fromAdjacencySets ys) == fromAdjacencySets (xs ++ ys)
  20825. 1558.00 s [algebraic-graphs]
  20826. 1558.00 s [algebraic-graphs] ============ AdjacencyMap.isSubgraphOf ============
  20827. 1558.00 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  20828. 1558.00 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  20829. 1558.00 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  20830. 1558.00 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  20831. 1558.00 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  20832. 1558.00 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  20833. 1558.00 s [algebraic-graphs]
  20834. 1558.00 s [algebraic-graphs] ============ AdjacencyMap.toGraph et al. ============
  20835. 1558.00 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  20836. 1558.00 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  20837. 1558.00 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  20838. 1558.00 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  20839. 1558.00 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  20840. 1558.00 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  20841. 1558.00 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  20842. 1558.00 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  20843. 1558.00 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  20844. 1558.00 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  20845. 1558.00 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  20846. 1558.00 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  20847. 1558.00 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  20848. 1558.00 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  20849. 1558.00 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  20850. 1558.00 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  20851. 1558.00 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  20852. 1558.00 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  20853. 1558.00 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  20854. 1558.00 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  20855. 1558.00 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  20856. 1558.00 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  20857. 1558.00 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  20858. 1558.00 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  20859. 1558.00 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  20860. 1558.00 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  20861. 1558.00 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  20862. 1558.00 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  20863. 1558.00 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  20864. 1558.00 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  20865. 1558.00 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  20866. 1558.00 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  20867. 1558.00 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  20868. 1560.23 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  20869. 1560.23 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  20870. 1560.23 s [algebraic-graphs]
  20871. 1560.23 s [algebraic-graphs] ============ AdjacencyMap.foldg ============
  20872. 1560.23 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  20873. 1560.23 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  20874. 1560.23 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  20875. 1560.23 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  20876. 1560.23 s [algebraic-graphs]
  20877. 1560.23 s [algebraic-graphs] ============ AdjacencyMap.isEmpty ============
  20878. 1560.23 s [algebraic-graphs] OK: isEmpty empty == True
  20879. 1560.23 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  20880. 1560.23 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  20881. 1560.23 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  20882. 1560.23 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  20883. 1560.23 s [algebraic-graphs]
  20884. 1560.23 s [algebraic-graphs] ============ AdjacencyMap.hasVertex ============
  20885. 1560.23 s [algebraic-graphs] OK: hasVertex x empty == False
  20886. 1560.23 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20887. 1560.23 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  20888. 1560.23 s [algebraic-graphs]
  20889. 1560.23 s [algebraic-graphs] ============ AdjacencyMap.hasEdge ============
  20890. 1560.23 s [algebraic-graphs] OK: hasEdge x y empty == False
  20891. 1560.23 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  20892. 1560.23 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  20893. 1560.23 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  20894. 1560.23 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  20895. 1560.24 s [algebraic-graphs]
  20896. 1560.24 s [algebraic-graphs] ============ AdjacencyMap.vertexCount ============
  20897. 1560.24 s [algebraic-graphs] OK: vertexCount empty == 0
  20898. 1560.24 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20899. 1560.24 s [algebraic-graphs] OK: vertexCount == length . vertexList
  20900. 1560.24 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  20901. 1560.24 s [algebraic-graphs]
  20902. 1560.24 s [algebraic-graphs] ============ AdjacencyMap.edgeCount ============
  20903. 1560.24 s [algebraic-graphs] OK: edgeCount empty == 0
  20904. 1560.24 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20905. 1560.24 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  20906. 1560.24 s [algebraic-graphs] OK: edgeCount == length . edgeList
  20907. 1560.24 s [algebraic-graphs]
  20908. 1560.24 s [algebraic-graphs] ============ AdjacencyMap.vertexList ============
  20909. 1560.24 s [algebraic-graphs] OK: vertexList empty == []
  20910. 1560.24 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  20911. 1560.24 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  20912. 1560.24 s [algebraic-graphs]
  20913. 1560.24 s [algebraic-graphs] ============ AdjacencyMap.vertexSet ============
  20914. 1560.24 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  20915. 1560.24 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  20916. 1560.24 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  20917. 1560.24 s [algebraic-graphs]
  20918. 1560.24 s [algebraic-graphs] ============ AdjacencyMap.vertexIntSet ============
  20919. 1560.24 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  20920. 1560.24 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  20921. 1560.24 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  20922. 1560.24 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  20923. 1560.24 s [algebraic-graphs]
  20924. 1560.24 s [algebraic-graphs] ============ AdjacencyMap.edgeList ============
  20925. 1560.24 s [algebraic-graphs] OK: edgeList empty == []
  20926. 1560.24 s [algebraic-graphs] OK: edgeList (vertex x) == []
  20927. 1560.24 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  20928. 1560.24 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  20929. 1560.24 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  20930. 1560.24 s [algebraic-graphs]
  20931. 1560.24 s [algebraic-graphs] ============ AdjacencyMap.edgeSet ============
  20932. 1560.24 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  20933. 1560.24 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  20934. 1560.24 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  20935. 1560.24 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  20936. 1560.24 s [algebraic-graphs]
  20937. 1560.24 s [algebraic-graphs] ============ AdjacencyMap.adjacencyList ============
  20938. 1560.24 s [algebraic-graphs] OK: adjacencyList empty == []
  20939. 1560.24 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  20940. 1560.24 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  20941. 1560.24 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  20942. 1560.24 s [algebraic-graphs]
  20943. 1560.24 s [algebraic-graphs] ============ AdjacencyMap.preSet ============
  20944. 1560.24 s [algebraic-graphs] OK: preSet x empty == Set.empty
  20945. 1560.24 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  20946. 1560.24 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  20947. 1560.24 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  20948. 1560.24 s [algebraic-graphs]
  20949. 1560.24 s [algebraic-graphs] ============ AdjacencyMap.preIntSet ============
  20950. 1560.24 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  20951. 1560.24 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  20952. 1560.24 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  20953. 1560.24 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  20954. 1560.24 s [algebraic-graphs]
  20955. 1560.24 s [algebraic-graphs] ============ AdjacencyMap.postSet ============
  20956. 1560.24 s [algebraic-graphs] OK: postSet x empty == Set.empty
  20957. 1560.24 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  20958. 1560.24 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  20959. 1560.24 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  20960. 1560.24 s [algebraic-graphs]
  20961. 1560.24 s [algebraic-graphs] ============ AdjacencyMap.postIntSet ============
  20962. 1560.24 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  20963. 1560.24 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  20964. 1560.24 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  20965. 1560.24 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  20966. 1560.24 s [algebraic-graphs]
  20967. 1560.24 s [algebraic-graphs] ============ AdjacencyMap.path ============
  20968. 1560.24 s [algebraic-graphs] OK: path [] == empty
  20969. 1560.24 s [algebraic-graphs] OK: path [x] == vertex x
  20970. 1560.24 s [algebraic-graphs] OK: path [x,y] == edge x y
  20971. 1560.24 s [algebraic-graphs]
  20972. 1560.24 s [algebraic-graphs] ============ AdjacencyMap.circuit ============
  20973. 1560.24 s [algebraic-graphs] OK: circuit [] == empty
  20974. 1560.24 s [algebraic-graphs] OK: circuit [x] == edge x x
  20975. 1560.24 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  20976. 1560.24 s [algebraic-graphs]
  20977. 1560.24 s [algebraic-graphs] ============ AdjacencyMap.clique ============
  20978. 1560.24 s [algebraic-graphs] OK: clique [] == empty
  20979. 1560.24 s [algebraic-graphs] OK: clique [x] == vertex x
  20980. 1560.24 s [algebraic-graphs] OK: clique [x,y] == edge x y
  20981. 1560.24 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  20982. 1560.24 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  20983. 1560.24 s [algebraic-graphs]
  20984. 1560.24 s [algebraic-graphs] ============ AdjacencyMap.biclique ============
  20985. 1560.24 s [algebraic-graphs] OK: biclique [] [] == empty
  20986. 1560.24 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  20987. 1560.24 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  20988. 1560.24 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  20989. 1560.24 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  20990. 1560.24 s [algebraic-graphs]
  20991. 1560.24 s [algebraic-graphs] ============ AdjacencyMap.star ============
  20992. 1560.24 s [algebraic-graphs] OK: star x [] == vertex x
  20993. 1560.24 s [algebraic-graphs] OK: star x [y] == edge x y
  20994. 1560.24 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  20995. 1560.24 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  20996. 1560.24 s [algebraic-graphs]
  20997. 1560.24 s [algebraic-graphs] ============ AdjacencyMap.stars ============
  20998. 1560.24 s [algebraic-graphs] OK: stars [] == empty
  20999. 1560.24 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  21000. 1560.24 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  21001. 1560.24 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  21002. 1560.24 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  21003. 1560.24 s [algebraic-graphs] OK: stars . adjacencyList == id
  21004. 1560.24 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  21005. 1560.24 s [algebraic-graphs]
  21006. 1560.24 s [algebraic-graphs] ============ AdjacencyMap.tree ============
  21007. 1560.24 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  21008. 1560.24 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  21009. 1560.24 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  21010. 1560.24 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  21011. 1560.24 s [algebraic-graphs]
  21012. 1560.24 s [algebraic-graphs] ============ AdjacencyMap.forest ============
  21013. 1560.24 s [algebraic-graphs] OK: forest [] == empty
  21014. 1560.24 s [algebraic-graphs] OK: forest [x] == tree x
  21015. 1560.24 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  21016. 1560.24 s [algebraic-graphs] OK: forest == overlays . map tree
  21017. 1560.24 s [algebraic-graphs]
  21018. 1560.24 s [algebraic-graphs] ============ AdjacencyMap.removeVertex ============
  21019. 1560.24 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  21020. 1560.24 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  21021. 1560.24 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  21022. 1560.24 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  21023. 1560.24 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  21024. 1560.24 s [algebraic-graphs]
  21025. 1560.24 s [algebraic-graphs] ============ AdjacencyMap.removeEdge ============
  21026. 1560.24 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  21027. 1560.24 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  21028. 1560.24 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  21029. 1560.24 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  21030. 1560.24 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  21031. 1560.24 s [algebraic-graphs]
  21032. 1560.24 s [algebraic-graphs] ============ AdjacencyMap.replaceVertex ============
  21033. 1560.24 s [algebraic-graphs] OK: replaceVertex x x == id
  21034. 1560.24 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  21035. 1560.24 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  21036. 1560.24 s [algebraic-graphs]
  21037. 1560.24 s [algebraic-graphs] ============ AdjacencyMap.mergeVertices ============
  21038. 1560.24 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  21039. 1560.24 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  21040. 1560.24 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  21041. 1560.24 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  21042. 1560.24 s [algebraic-graphs]
  21043. 1560.24 s [algebraic-graphs] ============ AdjacencyMap.transpose ============
  21044. 1560.24 s [algebraic-graphs] OK: transpose empty == empty
  21045. 1560.24 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  21046. 1560.24 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  21047. 1560.24 s [algebraic-graphs] OK: transpose . transpose == id
  21048. 1560.24 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  21049. 1560.24 s [algebraic-graphs]
  21050. 1560.24 s [algebraic-graphs] ============ AdjacencyMap.gmap ============
  21051. 1560.24 s [algebraic-graphs] OK: gmap f empty == empty
  21052. 1560.24 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  21053. 1560.24 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  21054. 1560.24 s [algebraic-graphs] OK: gmap id == id
  21055. 1560.24 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  21056. 1560.24 s [algebraic-graphs]
  21057. 1560.24 s [algebraic-graphs] ============ AdjacencyMap.induce ============
  21058. 1560.24 s [algebraic-graphs] OK: induce (const True ) x == x
  21059. 1560.24 s [algebraic-graphs] OK: induce (const False) x == empty
  21060. 1560.24 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  21061. 1560.24 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  21062. 1560.24 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  21063. 1560.24 s [algebraic-graphs]
  21064. 1560.24 s [algebraic-graphs] ============ AdjacencyMap.compose ============
  21065. 1560.24 s [algebraic-graphs] OK: compose empty x == empty
  21066. 1560.24 s [algebraic-graphs] OK: compose x empty == empty
  21067. 1560.24 s [algebraic-graphs] OK: compose (vertex x) y == empty
  21068. 1560.24 s [algebraic-graphs] OK: compose x (vertex y) == empty
  21069. 1560.24 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  21070. 1560.24 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  21071. 1564.35 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  21072. 1564.35 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  21073. 1564.44 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  21074. 1564.44 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  21075. 1564.44 s [algebraic-graphs]
  21076. 1564.44 s [algebraic-graphs] ============ AdjacencyMap.closure ============
  21077. 1564.44 s [algebraic-graphs] OK: closure empty == empty
  21078. 1564.44 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  21079. 1564.44 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  21080. 1564.44 s [algebraic-graphs] OK: closure (edge x y) == edges [(x,x), (x,y), (y,y)]
  21081. 1564.44 s [algebraic-graphs] OK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
  21082. 1564.44 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  21083. 1564.44 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  21084. 1564.44 s [algebraic-graphs] OK: closure . closure == closure
  21085. 1564.44 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  21086. 1564.44 s [algebraic-graphs]
  21087. 1564.44 s [algebraic-graphs] ============ AdjacencyMap.reflexiveClosure ============
  21088. 1564.44 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  21089. 1564.44 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  21090. 1564.44 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  21091. 1564.44 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges [(x,x), (x,y), (y,y)]
  21092. 1564.44 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  21093. 1564.44 s [algebraic-graphs]
  21094. 1564.44 s [algebraic-graphs] ============ AdjacencyMap.symmetricClosure ============
  21095. 1564.44 s [algebraic-graphs] OK: symmetricClosure empty == empty
  21096. 1564.44 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  21097. 1564.44 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges [(x,y), (y,x)]
  21098. 1564.44 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  21099. 1564.45 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  21100. 1564.45 s [algebraic-graphs]
  21101. 1564.45 s [algebraic-graphs] ============ AdjacencyMap.transitiveClosure ============
  21102. 1564.45 s [algebraic-graphs] OK: transitiveClosure empty == empty
  21103. 1564.45 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  21104. 1564.45 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  21105. 1564.45 s [algebraic-graphs] OK: transitiveClosure (path $ nub xs) == clique (nub $ xs)
  21106. 1564.45 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  21107. 1564.45 s [algebraic-graphs]
  21108. 1564.45 s [algebraic-graphs] ============ AdjacencyMap.box ============
  21109. 1564.45 s [algebraic-graphs] OK: box x y ~~ box y x
  21110. 1564.45 s [algebraic-graphs] OK: box x (overlay y z) == overlay (box x y) (box x z)
  21111. 1564.45 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  21112. 1564.45 s [algebraic-graphs] OK: box x empty ~~ empty
  21113. 1564.45 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  21114. 1564.45 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  21115. 1564.45 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  21116. 1564.45 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  21117. 1564.45 s [algebraic-graphs]
  21118. 1564.45 s [algebraic-graphs] ============ AdjacencyMap.bfsForest ============
  21119. 1564.45 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0] == empty
  21120. 1564.45 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [1] == edge 1 2
  21121. 1564.45 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2] == vertex 2
  21122. 1564.45 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0,1,2] == vertices [1,2]
  21123. 1564.45 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2,1,0] == vertices [1,2]
  21124. 1564.45 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 1) [1] == vertex 1
  21125. 1564.45 s [algebraic-graphs] OK: isSubgraphOf (forest $ bfsForest x vs) x == True
  21126. 1564.45 s [algebraic-graphs] OK: bfsForest x (vertexList x) == map ( -> Node v []) (nub $ vertexList x)
  21127. 1564.45 s [algebraic-graphs] OK: bfsForest x [] == []
  21128. 1564.45 s [algebraic-graphs] OK: bfsForest empty vs == []
  21129. 1564.45 s [algebraic-graphs] OK: bfsForest (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
  21130. 1564.45 s [algebraic-graphs] OK: forest $ bfsForest (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1] + path [3,4,5]
  21131. 1564.45 s [algebraic-graphs]
  21132. 1564.45 s [algebraic-graphs] ============ AdjacencyMap.bfs ============
  21133. 1564.45 s [algebraic-graphs] OK: bfs (edge 1 2) [0] == []
  21134. 1564.45 s [algebraic-graphs] OK: bfs (edge 1 2) [1] == [[1], [2]]
  21135. 1564.45 s [algebraic-graphs] OK: bfs (edge 1 2) [2] == [[2]]
  21136. 1564.45 s [algebraic-graphs] OK: bfs (edge 1 2) [1,2] == [[1,2]]
  21137. 1564.45 s [algebraic-graphs] OK: bfs (edge 1 2) [2,1] == [[2,1]]
  21138. 1564.45 s [algebraic-graphs] OK: bfs (edge 1 1) [1] == [[1]]
  21139. 1564.45 s [algebraic-graphs] OK: bfs empty vs == []
  21140. 1564.45 s [algebraic-graphs] OK: bfs x [] == []
  21141. 1564.45 s [algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,2] == [[1,2]]
  21142. 1564.45 s [algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,3] == [[1,3], [2,4]]
  21143. 1564.45 s [algebraic-graphs] OK: bfs (3 * (1 + 4) * (1 + 5)) [3] == [[3], [1,4,5]]
  21144. 1564.45 s [algebraic-graphs] OK: bfs (circuit [1..5] + circuit [5,4..1]) [2] == [[2], [1,3], [5,4]]
  21145. 1564.45 s [algebraic-graphs] OK: concat $ bfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,4,1,5]
  21146. 1564.45 s [algebraic-graphs] OK: map concat . transpose . map levels . bfsForest x == bfs x
  21147. 1564.45 s [algebraic-graphs]
  21148. 1564.45 s [algebraic-graphs] ============ AdjacencyMap.dfsForest ============
  21149. 1564.45 s [algebraic-graphs] OK: forest $ dfsForest empty == empty
  21150. 1564.45 s [algebraic-graphs] OK: forest $ dfsForest (edge 1 1) == vertex 1
  21151. 1564.45 s [algebraic-graphs] OK: forest $ dfsForest (edge 1 2) == edge 1 2
  21152. 1564.45 s [algebraic-graphs] OK: forest $ dfsForest (edge 2 1) == vertices [1,2]
  21153. 1564.45 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForest x) x == True
  21154. 1564.46 s [algebraic-graphs] OK: isDfsForestOf (dfsForest x) x == True
  21155. 1564.46 s [algebraic-graphs] OK: dfsForest . forest . dfsForest == dfsForest
  21156. 1564.46 s [algebraic-graphs] OK: dfsForest (vertices vs) == map (\v -> Node v []) (nub $ sort vs)
  21157. 1564.46 s [algebraic-graphs] OK: dfsForest $ 3 * (1 + 4) * (1 + 5) == <correct result>
  21158. 1564.46 s [algebraic-graphs] OK: forest (dfsForest $ circuit [1..5] + circuit [5,4..1]) == path [1,2,3,4,5]
  21159. 1564.46 s [algebraic-graphs]
  21160. 1564.46 s [algebraic-graphs] ============ AdjacencyMap.dfsForestFrom ============
  21161. 1564.46 s [algebraic-graphs] OK: forest $ dfsForestFrom empty vs == empty
  21162. 1564.46 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 1) [1] == vertex 1
  21163. 1564.46 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [0] == empty
  21164. 1564.46 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1] == edge 1 2
  21165. 1564.46 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2] == vertex 2
  21166. 1564.46 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1,2] == edge 1 2
  21167. 1564.46 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2,1] == vertices [1,2]
  21168. 1564.46 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForestFrom x vs) x == True
  21169. 1564.46 s [algebraic-graphs] OK: isDfsForestOf (dfsForestFrom x (vertexList x)) x == True
  21170. 1564.46 s [algebraic-graphs] OK: dfsForestFrom x (vertexList x) == dfsForest x
  21171. 1564.46 s [algebraic-graphs] OK: dfsForestFrom x [] == []
  21172. 1564.46 s [algebraic-graphs] OK: dfsForestFrom (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
  21173. 1564.46 s [algebraic-graphs] OK: forest $ dfsForestFrom (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1,5,4]
  21174. 1564.46 s [algebraic-graphs]
  21175. 1564.46 s [algebraic-graphs] ============ AdjacencyMap.dfs ============
  21176. 1564.46 s [algebraic-graphs] OK: dfs empty vs == []
  21177. 1564.46 s [algebraic-graphs] OK: dfs (edge 1 1) [1] == [1]
  21178. 1564.46 s [algebraic-graphs] OK: dfs (edge 1 2) [0] == []
  21179. 1564.46 s [algebraic-graphs] OK: dfs (edge 1 2) [1] == [1,2]
  21180. 1564.46 s [algebraic-graphs] OK: dfs (edge 1 2) [2] == [2]
  21181. 1564.46 s [algebraic-graphs] OK: dfs (edge 1 2) [1,2] == [1,2]
  21182. 1564.46 s [algebraic-graphs] OK: dfs (edge 1 2) [2,1] == [2,1]
  21183. 1564.46 s [algebraic-graphs] OK: dfs x [] == []
  21184. 1564.46 s [algebraic-graphs]
  21185. 1564.46 s [algebraic-graphs] OK: and [ hasVertex v x | v <- dfs x vs ] == True
  21186. 1564.46 s [algebraic-graphs] OK: dfs (3 * (1 + 4) * (1 + 5)) [1,4] == [1,5,4]
  21187. 1564.46 s [algebraic-graphs] OK: dfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,1,5,4]
  21188. 1564.46 s [algebraic-graphs]
  21189. 1564.46 s [algebraic-graphs] ============ AdjacencyMap.dfs ============
  21190. 1564.46 s [algebraic-graphs] OK: reachable empty x == []
  21191. 1564.46 s [algebraic-graphs] OK: reachable (vertex 1) 1 == [1]
  21192. 1564.46 s [algebraic-graphs] OK: reachable (edge 1 1) 1 == [1]
  21193. 1564.46 s [algebraic-graphs] OK: reachable (edge 1 2) 0 == []
  21194. 1564.46 s [algebraic-graphs] OK: reachable (edge 1 2) 1 == [1,2]
  21195. 1564.46 s [algebraic-graphs] OK: reachable (edge 1 2) 2 == [2]
  21196. 1564.46 s [algebraic-graphs] OK: reachable (path [1..8] ) 4 == [4..8]
  21197. 1564.46 s [algebraic-graphs] OK: reachable (circuit [1..8] ) 4 == [4..8] ++ [1..3]
  21198. 1564.46 s [algebraic-graphs] OK: reachable (clique [8,7..1]) 8 == [8] ++ [1..7]
  21199. 1564.46 s [algebraic-graphs]
  21200. 1564.46 s [algebraic-graphs] OK: and [ hasVertex v x | v <- reachable x y ] == True
  21201. 1564.46 s [algebraic-graphs]
  21202. 1564.46 s [algebraic-graphs] ============ AdjacencyMap.topSort ============
  21203. 1564.46 s [algebraic-graphs] OK: topSort (1 * 2 + 3 * 1) == Right [3,1,2]
  21204. 1564.46 s [algebraic-graphs] OK: topSort (path [1..5]) == Right [1..5]
  21205. 1564.46 s [algebraic-graphs] OK: topSort (3 * (1 * 4 + 2 * 5)) == Right [3,1,2,4,5]
  21206. 1564.46 s [algebraic-graphs] OK: topSort (1 * 2 + 2 * 1) == Left (2 :| [1])
  21207. 1564.46 s [algebraic-graphs] OK: topSort (path [5,4..1] + edge 2 4) == Left (4 :| [3,2])
  21208. 1564.46 s [algebraic-graphs] OK: topSort (circuit [1..5]) == Left (3 :| [1,2])
  21209. 1564.46 s [algebraic-graphs] OK: topSort (circuit [1..3] + circuit [3,2,1]) == Left (3 :| [2])
  21210. 1564.46 s [algebraic-graphs] OK: topSort (1 * 2 + (5 + 2) * 1 + 3 * 4 * 3) == Left (1 :| [2])
  21211. 1564.46 s [algebraic-graphs] OK: fmap (flip isTopSortOf x) (topSort x) /= Right False
  21212. 1564.46 s [algebraic-graphs] OK: topSort . vertices == Right . nub . sort
  21213. 1564.46 s [algebraic-graphs]
  21214. 1564.46 s [algebraic-graphs] ============ AdjacencyMap.testIsAcyclic ============
  21215. 1564.46 s [algebraic-graphs] OK: isAcyclic (1 * 2 + 3 * 1) == True
  21216. 1564.46 s [algebraic-graphs] OK: isAcyclic (1 * 2 + 2 * 1) == False
  21217. 1564.46 s [algebraic-graphs] OK: isAcyclic . circuit == null
  21218. 1564.46 s [algebraic-graphs] OK: isAcyclic == isRight . topSort
  21219. 1564.46 s [algebraic-graphs]
  21220. 1564.46 s [algebraic-graphs] ============ AdjacencyMap.isDfsForestOf ============
  21221. 1564.46 s [algebraic-graphs] OK: isDfsForestOf [] empty == True
  21222. 1564.46 s [algebraic-graphs] OK: isDfsForestOf [] (vertex 1) == False
  21223. 1564.46 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 1) == True
  21224. 1564.46 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 2) == False
  21225. 1564.46 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 1 []] (vertex 1) == False
  21226. 1564.46 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 1) == True
  21227. 1564.46 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 2) == False
  21228. 1573.97 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (edge 1 2) == False
  21229. 1573.97 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (edge 1 2) == True
  21230. 1573.98 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (edge 1 2) == True
  21231. 1573.98 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (vertices [1,2]) == True
  21232. 1573.98 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (vertices [1,2]) == True
  21233. 1573.98 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (vertices [1,2]) == False
  21234. 1573.98 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 [Node 3 []]]] (path [1,2,3]) == True
  21235. 1573.98 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 3 [Node 2 []]]] (path [1,2,3]) == False
  21236. 1573.99 s [algebraic-graphs] OK: isDfsForestOf [Node 3 [], Node 1 [Node 2 []]] (path [1,2,3]) == True
  21237. 1573.99 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [Node 3 []], Node 1 []] (path [1,2,3]) == True
  21238. 1573.99 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 [Node 3 []]] (path [1,2,3]) == False
  21239. 1573.99 s [algebraic-graphs]
  21240. 1573.99 s [algebraic-graphs] ============ AdjacencyMap.isTopSortOf ============
  21241. 1573.99 s [algebraic-graphs] OK: isTopSortOf [3,1,2] (1 * 2 + 3 * 1) == True
  21242. 1573.99 s [algebraic-graphs] OK: isTopSortOf [1,2,3] (1 * 2 + 3 * 1) == False
  21243. 1573.99 s [algebraic-graphs] OK: isTopSortOf [] (1 * 2 + 3 * 1) == False
  21244. 1573.99 s [algebraic-graphs] OK: isTopSortOf [] empty == True
  21245. 1573.99 s [algebraic-graphs] OK: isTopSortOf [x] (vertex x) == True
  21246. 1573.99 s [algebraic-graphs] OK: isTopSortOf [x] (edge x x) == False
  21247. 1573.99 s [algebraic-graphs]
  21248. 1573.99 s [algebraic-graphs] ============ AdjacencyMap.induceJust ============
  21249. 1573.99 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  21250. 1573.99 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  21251. 1573.99 s [algebraic-graphs] OK: induceJust . gmap Just == id
  21252. 1573.99 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  21253. 1573.99 s [algebraic-graphs]
  21254. 1573.99 s [algebraic-graphs] ============ AdjacencyMap.scc ============
  21255. 1573.99 s [algebraic-graphs] OK: scc empty == empty
  21256. 1573.99 s [algebraic-graphs] OK: scc (vertex x) == vertex (NonEmpty.vertex x)
  21257. 1573.99 s [algebraic-graphs] OK: scc (vertices xs) == vertices (map NonEmpty.vertex xs)
  21258. 1573.99 s [algebraic-graphs] OK: scc (edge 1 1) == vertex (NonEmpty.edge 1 1)
  21259. 1573.99 s [algebraic-graphs] OK: scc (edge 1 2) == edge (NonEmpty.vertex 1) (NonEmpty.vertex 2)
  21260. 1573.99 s [algebraic-graphs] OK: scc (circuit (1:xs)) == vertex (NonEmpty.circuit1 (1 :| xs))
  21261. 1573.99 s [algebraic-graphs] OK: scc (3 * 1 * 4 * 1 * 5) == <correct result>
  21262. 1573.99 s [algebraic-graphs] OK: isAcyclic . scc == const True
  21263. 1573.99 s [algebraic-graphs] OK: isAcyclic x == (scc x == gmap NonEmpty.vertex x)
  21264. 1573.99 s [algebraic-graphs] OK: scc g == KL.scc g
  21265. 1573.99 s [algebraic-graphs]
  21266. 1573.99 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Num ============
  21267. 1573.99 s [algebraic-graphs] OK: 0 == rightVertex 0
  21268. 1573.99 s [algebraic-graphs] OK: swap 1 == leftVertex 1
  21269. 1573.99 s [algebraic-graphs] OK: swap 1 + 2 == vertices [1] [2]
  21270. 1573.99 s [algebraic-graphs] OK: swap 1 * 2 == edge 1 2
  21271. 1573.99 s [algebraic-graphs] OK: swap 1 + 2 * swap 3 == overlay (leftVertex 1) (edge 3 2)
  21272. 1573.99 s [algebraic-graphs] OK: swap 1 * (2 + swap 3) == connect (leftVertex 1) (vertices [3] [2])
  21273. 1573.99 s [algebraic-graphs]
  21274. 1573.99 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Show ============
  21275. 1573.99 s [algebraic-graphs] OK: show empty == "empty"
  21276. 1573.99 s [algebraic-graphs] OK: show 1 == "rightVertex 1"
  21277. 1573.99 s [algebraic-graphs] OK: show (swap 2) == "leftVertex 2"
  21278. 1573.99 s [algebraic-graphs] OK: show 1 + 2 == "vertices [] [1,2]"
  21279. 1573.99 s [algebraic-graphs] OK: show (swap (1 + 2)) == "vertices [1,2] []"
  21280. 1573.99 s [algebraic-graphs] OK: show (swap 1 * 2) == "edge 1 2"
  21281. 1573.99 s [algebraic-graphs] OK: show (swap 1 * 2 * swap 3) == "edges [(1,2),(3,2)]"
  21282. 1573.99 s [algebraic-graphs] OK: show (swap 1 * 2 + swap 3) == "overlay (leftVertex 3) (edge 1 2)"
  21283. 1573.99 s [algebraic-graphs]
  21284. 1573.99 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Eq ============
  21285. 1573.99 s [algebraic-graphs] OK: (x == y) == (leftAdjacencyMap x == leftAdjacencyMap y && rightAdjacencyMap x == rightAdjacencyMap y)
  21286. 1573.99 s [algebraic-graphs]
  21287. 1573.99 s [algebraic-graphs] OK: x + y == y + x
  21288. 1573.99 s [algebraic-graphs] OK: x + (y + z) == (x + y) + z
  21289. 1573.99 s [algebraic-graphs] OK: x * empty == x
  21290. 1573.99 s [algebraic-graphs] OK: empty * x == x
  21291. 1573.99 s [algebraic-graphs] OK: x * y == y * x
  21292. 1573.99 s [algebraic-graphs] OK: x * (y * z) == (x * y) * z
  21293. 1573.99 s [algebraic-graphs] OK: x * (y + z) == x * y + x * z
  21294. 1573.99 s [algebraic-graphs] OK: (x + y) * z == x * z + y * z
  21295. 1573.99 s [algebraic-graphs] OK: x * y * z == x * y + x * z + y * z
  21296. 1574.00 s [algebraic-graphs] OK: x + empty == x
  21297. 1574.00 s [algebraic-graphs] OK: empty + x == x
  21298. 1574.00 s [algebraic-graphs] OK: x + x == x
  21299. 1574.00 s [algebraic-graphs] OK: x * y + x + y == x * y
  21300. 1574.00 s [algebraic-graphs] OK: x * x * x == x * x
  21301. 1574.00 s [algebraic-graphs]
  21302. 1574.00 s [algebraic-graphs] OK: leftVertex x * leftVertex y == leftVertex x + leftVertex y
  21303. 1574.00 s [algebraic-graphs] OK: rightVertex x * rightVertex y == rightVertex x + rightVertex y
  21304. 1574.00 s [algebraic-graphs]
  21305. 1574.00 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftAdjacencyMap ============
  21306. 1574.00 s [algebraic-graphs] OK: leftAdjacencyMap empty == Map.empty
  21307. 1574.00 s [algebraic-graphs] OK: leftAdjacencyMap (leftVertex x) == Map.singleton x Set.empty
  21308. 1574.00 s [algebraic-graphs] OK: leftAdjacencyMap (rightVertex x) == Map.empty
  21309. 1574.00 s [algebraic-graphs] OK: leftAdjacencyMap (edge x y) == Map.singleton x (Set.singleton y)
  21310. 1574.00 s [algebraic-graphs]
  21311. 1574.00 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightAdjacencyMap ============
  21312. 1574.00 s [algebraic-graphs] OK: rightAdjacencyMap empty == Map.empty
  21313. 1574.00 s [algebraic-graphs] OK: rightAdjacencyMap (leftVertex x) == Map.empty
  21314. 1574.00 s [algebraic-graphs] OK: rightAdjacencyMap (rightVertex x) == Map.singleton x Set.empty
  21315. 1574.00 s [algebraic-graphs] OK: rightAdjacencyMap (edge x y) == Map.singleton y (Set.singleton x)
  21316. 1574.00 s [algebraic-graphs]
  21317. 1574.00 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.empty ============
  21318. 1574.00 s [algebraic-graphs] OK: isEmpty empty == True
  21319. 1574.00 s [algebraic-graphs] OK: leftAdjacencyMap empty == Map.empty
  21320. 1574.00 s [algebraic-graphs] OK: rightAdjacencyMap empty == Map.empty
  21321. 1574.00 s [algebraic-graphs] OK: hasVertex x empty == False
  21322. 1574.00 s [algebraic-graphs]
  21323. 1574.00 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertex ============
  21324. 1574.00 s [algebraic-graphs] OK: leftAdjacencyMap (leftVertex x) == Map.singleton x Set.empty
  21325. 1574.00 s [algebraic-graphs] OK: rightAdjacencyMap (leftVertex x) == Map.empty
  21326. 1574.00 s [algebraic-graphs] OK: hasLeftVertex x (leftVertex y) == (x == y)
  21327. 1574.00 s [algebraic-graphs] OK: hasRightVertex x (leftVertex y) == False
  21328. 1574.00 s [algebraic-graphs] OK: hasEdge x y (leftVertex z) == False
  21329. 1574.00 s [algebraic-graphs]
  21330. 1574.00 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertex ============
  21331. 1574.00 s [algebraic-graphs] OK: leftAdjacencyMap (rightVertex x) == Map.empty
  21332. 1574.00 s [algebraic-graphs] OK: rightAdjacencyMap (rightVertex x) == Map.singleton x Set.empty
  21333. 1574.00 s [algebraic-graphs] OK: hasLeftVertex x (rightVertex y) == False
  21334. 1574.00 s [algebraic-graphs] OK: hasRightVertex x (rightVertex y) == (x == y)
  21335. 1574.00 s [algebraic-graphs] OK: hasEdge x y (rightVertex z) == False
  21336. 1574.00 s [algebraic-graphs]
  21337. 1574.00 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertex ============
  21338. 1574.00 s [algebraic-graphs] OK: vertex . Left == leftVertex
  21339. 1574.00 s [algebraic-graphs] OK: vertex . Right == rightVertex
  21340. 1574.00 s [algebraic-graphs]
  21341. 1574.00 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edge ============
  21342. 1574.00 s [algebraic-graphs] OK: edge x y == connect (leftVertex x) (rightVertex y)
  21343. 1574.00 s [algebraic-graphs] OK: leftAdjacencyMap (edge x y) == Map.singleton x (Set.singleton y)
  21344. 1574.00 s [algebraic-graphs] OK: rightAdjacencyMap (edge x y) == Map.singleton y (Set.singleton x)
  21345. 1574.00 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  21346. 1574.00 s [algebraic-graphs] OK: hasEdge 1 2 (edge 2 1) == False
  21347. 1574.00 s [algebraic-graphs]
  21348. 1574.00 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.overlay ============
  21349. 1574.00 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  21350. 1574.00 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  21351. 1574.00 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  21352. 1574.00 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  21353. 1574.00 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  21354. 1574.00 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  21355. 1574.00 s [algebraic-graphs]
  21356. 1574.00 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.connect ============
  21357. 1574.00 s [algebraic-graphs] OK: connect (leftVertex x) (leftVertex y) == vertices [x,y] []
  21358. 1574.00 s [algebraic-graphs] OK: connect (leftVertex x) (rightVertex y) == edge x y
  21359. 1574.00 s [algebraic-graphs] OK: connect (rightVertex x) (leftVertex y) == edge y x
  21360. 1574.00 s [algebraic-graphs] OK: connect (rightVertex x) (rightVertex y) == vertices [] [x,y]
  21361. 1574.00 s [algebraic-graphs] OK: connect (vertices xs1 ys1) (vertices xs2 ys2) == overlay (biclique xs1 ys2) (biclique xs2 ys1)
  21362. 1574.00 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  21363. 1574.00 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  21364. 1574.00 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  21365. 1574.00 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  21366. 1574.00 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  21367. 1574.00 s [algebraic-graphs] OK: edgeCount (connect x y) >= leftVertexCount x * rightVertexCount y
  21368. 1574.00 s [algebraic-graphs] OK: edgeCount (connect x y) <= leftVertexCount x * rightVertexCount y + rightVertexCount x * leftVertexCount y + edgeCount x + edgeCount y
  21369. 1574.00 s [algebraic-graphs]
  21370. 1574.00 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertices ============
  21371. 1574.00 s [algebraic-graphs] OK: vertices [] [] == empty
  21372. 1574.00 s [algebraic-graphs] OK: vertices [x] [] == leftVertex x
  21373. 1574.00 s [algebraic-graphs] OK: vertices [] [x] == rightVertex x
  21374. 1574.00 s [algebraic-graphs] OK: vertices xs ys == overlays (map leftVertex xs ++ map rightVertex ys)
  21375. 1574.00 s [algebraic-graphs] OK: hasLeftVertex x (vertices xs ys) == elem x xs
  21376. 1574.00 s [algebraic-graphs] OK: hasRightVertex y (vertices xs ys) == elem y ys
  21377. 1574.00 s [algebraic-graphs]
  21378. 1574.00 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edges ============
  21379. 1574.00 s [algebraic-graphs] OK: edges [] == empty
  21380. 1574.00 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  21381. 1574.00 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  21382. 1574.00 s [algebraic-graphs] OK: hasEdge x y . edges == elem (x,y)
  21383. 1574.00 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  21384. 1574.00 s [algebraic-graphs]
  21385. 1574.00 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.overlays ============
  21386. 1574.00 s [algebraic-graphs] OK: overlays [] == empty
  21387. 1574.00 s [algebraic-graphs] OK: overlays [x] == x
  21388. 1574.00 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  21389. 1574.00 s [algebraic-graphs] OK: overlays == foldr overlay empty
  21390. 1574.00 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  21391. 1574.00 s [algebraic-graphs]
  21392. 1574.00 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.connects ============
  21393. 1574.00 s [algebraic-graphs] OK: connects [] == empty
  21394. 1574.00 s [algebraic-graphs] OK: connects [x] == x
  21395. 1574.00 s [algebraic-graphs] OK: connects [x,y] == connect x y
  21396. 1574.00 s [algebraic-graphs] OK: connects == foldr connect empty
  21397. 1574.00 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  21398. 1574.00 s [algebraic-graphs]
  21399. 1574.00 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.swap ============
  21400. 1576.12 s [algebraic-graphs] OK: swap empty == empty
  21401. 1576.12 s [algebraic-graphs] OK: swap . leftVertex == rightVertex
  21402. 1576.12 s [algebraic-graphs] OK: swap (vertices xs ys) == vertices ys xs
  21403. 1576.12 s [algebraic-graphs] OK: swap (edge x y) == edge y x
  21404. 1576.12 s [algebraic-graphs] OK: swap . edges == edges . map Data.Tuple.swap
  21405. 1576.12 s [algebraic-graphs] OK: swap . swap == id
  21406. 1576.12 s [algebraic-graphs]
  21407. 1576.12 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.toBipartite ============
  21408. 1576.12 s [algebraic-graphs] OK: toBipartite empty == empty
  21409. 1576.12 s [algebraic-graphs] OK: toBipartite (vertex (Left x)) == leftVertex x
  21410. 1576.12 s [algebraic-graphs] OK: toBipartite (vertex (Right x)) == rightVertex x
  21411. 1576.12 s [algebraic-graphs] OK: toBipartite (edge (Left x) (Left y)) == vertices [x,y] []
  21412. 1576.12 s [algebraic-graphs] OK: toBipartite (edge (Left x) (Right y)) == edge x y
  21413. 1576.12 s [algebraic-graphs] OK: toBipartite (edge (Right x) (Left y)) == edge y x
  21414. 1576.12 s [algebraic-graphs] OK: toBipartite (edge (Right x) (Right y)) == vertices [] [x,y]
  21415. 1576.12 s [algebraic-graphs] OK: toBipartite . clique == uncurry biclique . partitionEithers
  21416. 1576.12 s [algebraic-graphs] OK: toBipartite . fromBipartite == id
  21417. 1576.12 s [algebraic-graphs]
  21418. 1576.12 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.toBipartiteWith ============
  21419. 1576.12 s [algebraic-graphs] OK: toBipartiteWith f empty == empty
  21420. 1576.12 s [algebraic-graphs] OK: toBipartiteWith Left x == vertices (vertexList x) []
  21421. 1576.12 s [algebraic-graphs] OK: toBipartiteWith Right x == vertices [] (vertexList x)
  21422. 1576.12 s [algebraic-graphs] OK: toBipartiteWith f == toBipartite . gmap f
  21423. 1576.12 s [algebraic-graphs] OK: toBipartiteWith id == toBipartite
  21424. 1576.12 s [algebraic-graphs]
  21425. 1576.12 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.fromBipartite ============
  21426. 1576.13 s [algebraic-graphs] OK: fromBipartite empty == empty
  21427. 1576.13 s [algebraic-graphs] OK: fromBipartite (leftVertex x) == vertex (Left x)
  21428. 1576.13 s [algebraic-graphs] OK: fromBipartite (edge x y) == edges [(Left x, Right y), (Right y, Left x)]
  21429. 1576.13 s [algebraic-graphs]
  21430. 1576.13 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.fromBipartiteWith ============
  21431. 1576.13 s [algebraic-graphs] OK: fromBipartiteWith Left Right == fromBipartite
  21432. 1576.13 s [algebraic-graphs] OK: fromBipartiteWith id id (vertices xs ys) == vertices (xs ++ ys)
  21433. 1576.13 s [algebraic-graphs] OK: fromBipartiteWith id id . edges == symmetricClosure . edges
  21434. 1576.13 s [algebraic-graphs]
  21435. 1576.13 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.isEmpty ============
  21436. 1576.13 s [algebraic-graphs] OK: isEmpty empty == True
  21437. 1576.13 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  21438. 1576.13 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  21439. 1576.13 s [algebraic-graphs] OK: isEmpty == (==) empty
  21440. 1576.13 s [algebraic-graphs]
  21441. 1576.13 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.hasLeftVertex ============
  21442. 1576.13 s [algebraic-graphs] OK: hasLeftVertex x empty == False
  21443. 1576.13 s [algebraic-graphs] OK: hasLeftVertex x (leftVertex y) == (x == y)
  21444. 1576.13 s [algebraic-graphs] OK: hasLeftVertex x (rightVertex y) == False
  21445. 1576.13 s [algebraic-graphs]
  21446. 1576.13 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.hasRightVertex ============
  21447. 1576.13 s [algebraic-graphs] OK: hasRightVertex x empty == False
  21448. 1576.13 s [algebraic-graphs] OK: hasRightVertex x (leftVertex y) == False
  21449. 1576.13 s [algebraic-graphs] OK: hasRightVertex x (rightVertex y) == (x == y)
  21450. 1576.13 s [algebraic-graphs]
  21451. 1576.13 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.hasVertex ============
  21452. 1576.13 s [algebraic-graphs] OK: hasVertex . Left == hasLeftVertex
  21453. 1576.13 s [algebraic-graphs] OK: hasVertex . Right == hasRightVertex
  21454. 1576.13 s [algebraic-graphs]
  21455. 1576.13 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.hasEdge ============
  21456. 1576.13 s [algebraic-graphs] OK: hasEdge x y empty == False
  21457. 1576.13 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  21458. 1576.13 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  21459. 1576.13 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  21460. 1576.13 s [algebraic-graphs]
  21461. 1576.13 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertexCount ============
  21462. 1576.13 s [algebraic-graphs] OK: leftVertexCount empty == 0
  21463. 1576.13 s [algebraic-graphs] OK: leftVertexCount (leftVertex x) == 1
  21464. 1576.13 s [algebraic-graphs] OK: leftVertexCount (rightVertex x) == 0
  21465. 1576.13 s [algebraic-graphs] OK: leftVertexCount (edge x y) == 1
  21466. 1576.13 s [algebraic-graphs] OK: leftVertexCount . edges == length . nub . map fst
  21467. 1576.13 s [algebraic-graphs]
  21468. 1576.13 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertexCount ============
  21469. 1576.13 s [algebraic-graphs] OK: rightVertexCount empty == 0
  21470. 1576.13 s [algebraic-graphs] OK: rightVertexCount (leftVertex x) == 0
  21471. 1576.13 s [algebraic-graphs] OK: rightVertexCount (rightVertex x) == 1
  21472. 1576.13 s [algebraic-graphs] OK: rightVertexCount (edge x y) == 1
  21473. 1576.13 s [algebraic-graphs] OK: rightVertexCount . edges == length . nub . map snd
  21474. 1576.13 s [algebraic-graphs]
  21475. 1576.13 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertexCount ============
  21476. 1576.13 s [algebraic-graphs] OK: vertexCount empty == 0
  21477. 1576.13 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  21478. 1576.13 s [algebraic-graphs] OK: vertexCount (edge x y) == 2
  21479. 1576.13 s [algebraic-graphs] OK: vertexCount x == leftVertexCount x + rightVertexCount x
  21480. 1576.13 s [algebraic-graphs]
  21481. 1576.13 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edgeCount ============
  21482. 1576.13 s [algebraic-graphs] OK: edgeCount empty == 0
  21483. 1576.13 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  21484. 1576.13 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  21485. 1576.13 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  21486. 1576.13 s [algebraic-graphs]
  21487. 1576.13 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertexList ============
  21488. 1576.13 s [algebraic-graphs] OK: leftVertexList empty == []
  21489. 1576.13 s [algebraic-graphs] OK: leftVertexList (leftVertex x) == [x]
  21490. 1576.13 s [algebraic-graphs] OK: leftVertexList (rightVertex x) == []
  21491. 1576.13 s [algebraic-graphs] OK: leftVertexList . flip vertices [] == nub . sort
  21492. 1576.13 s [algebraic-graphs]
  21493. 1576.13 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertexList ============
  21494. 1576.13 s [algebraic-graphs] OK: rightVertexList empty == []
  21495. 1576.13 s [algebraic-graphs] OK: rightVertexList (leftVertex x) == []
  21496. 1576.13 s [algebraic-graphs] OK: rightVertexList (rightVertex x) == [x]
  21497. 1576.13 s [algebraic-graphs] OK: rightVertexList . vertices [] == nub . sort
  21498. 1576.13 s [algebraic-graphs]
  21499. 1576.13 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertexList ============
  21500. 1576.13 s [algebraic-graphs] OK: vertexList empty == []
  21501. 1576.13 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  21502. 1576.13 s [algebraic-graphs] OK: vertexList (edge x y) == [Left x, Right y]
  21503. 1576.13 s [algebraic-graphs] OK: vertexList (vertices (lefts xs) (rights xs)) == nub (sort xs)
  21504. 1576.13 s [algebraic-graphs]
  21505. 1576.13 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edgeList ============
  21506. 1576.13 s [algebraic-graphs] OK: edgeList empty == []
  21507. 1576.13 s [algebraic-graphs] OK: edgeList (vertex x) == []
  21508. 1576.13 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  21509. 1576.13 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  21510. 1576.13 s [algebraic-graphs]
  21511. 1576.13 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertexSet ============
  21512. 1576.13 s [algebraic-graphs] OK: leftVertexSet empty == Set.empty
  21513. 1576.13 s [algebraic-graphs] OK: leftVertexSet . leftVertex == Set.singleton
  21514. 1576.13 s [algebraic-graphs] OK: leftVertexSet . rightVertex == const Set.empty
  21515. 1576.13 s [algebraic-graphs] OK: leftVertexSet . flip vertices [] == Set.fromList
  21516. 1576.13 s [algebraic-graphs]
  21517. 1576.13 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertexSet ============
  21518. 1576.13 s [algebraic-graphs] OK: rightVertexSet empty == Set.empty
  21519. 1576.13 s [algebraic-graphs] OK: rightVertexSet . leftVertex == const Set.empty
  21520. 1576.13 s [algebraic-graphs] OK: rightVertexSet . rightVertex == Set.singleton
  21521. 1576.13 s [algebraic-graphs] OK: rightVertexSet . vertices [] == Set.fromList
  21522. 1576.13 s [algebraic-graphs]
  21523. 1576.13 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertexSet ============
  21524. 1576.13 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  21525. 1576.13 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  21526. 1576.13 s [algebraic-graphs] OK: vertexSet (edge x y) == Set.fromList [Left x, Right y]
  21527. 1576.13 s [algebraic-graphs] OK: vertexSet (vertices (lefts xs) (rights xs)) == Set.fromList xs
  21528. 1576.13 s [algebraic-graphs]
  21529. 1576.13 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edgeSet ============
  21530. 1576.13 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  21531. 1576.13 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  21532. 1576.13 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  21533. 1576.13 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  21534. 1576.13 s [algebraic-graphs]
  21535. 1576.13 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftAdjacencyList ============
  21536. 1576.13 s [algebraic-graphs] OK: leftAdjacencyList empty == []
  21537. 1576.13 s [algebraic-graphs] OK: leftAdjacencyList (vertices [] xs) == []
  21538. 1576.13 s [algebraic-graphs] OK: leftAdjacencyList (vertices xs []) == []
  21539. 1576.13 s [algebraic-graphs] OK: leftAdjacencyList (edge x y) == [(x, [y])]
  21540. 1576.13 s [algebraic-graphs] OK: leftAdjacencyList (star x ys) == [(x, nub (sort ys))]
  21541. 1576.13 s [algebraic-graphs]
  21542. 1576.13 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightAdjacencyList ============
  21543. 1576.13 s [algebraic-graphs] OK: rightAdjacencyList empty == []
  21544. 1576.13 s [algebraic-graphs] OK: rightAdjacencyList (vertices [] xs) == [(x, []) | x <- nub (sort xs)]
  21545. 1576.13 s [algebraic-graphs] OK: rightAdjacencyList (vertices xs []) == []
  21546. 1576.13 s [algebraic-graphs] OK: rightAdjacencyList (edge x y) == [(y, [x])]
  21547. 1576.13 s [algebraic-graphs] OK: rightAdjacencyList (star x ys) == [(y, [x]) | y <- nub (sort ys)]
  21548. 1576.13 s [algebraic-graphs]
  21549. 1576.13 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.evenList ============
  21550. 1576.13 s [algebraic-graphs] OK: evenList [] == Nil
  21551. 1576.13 s [algebraic-graphs] OK: evenList [(1,2), (3,4)] == [1, 2, 3, 4] :: List Int Int
  21552. 1576.13 s [algebraic-graphs] OK: evenList [(1,'a'), (2,'b')] == Cons 1 (Cons 'a' (Cons 2 (Cons 'b' Nil)))
  21553. 1576.13 s [algebraic-graphs]
  21554. 1576.13 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.oddList ============
  21555. 1576.13 s [algebraic-graphs] OK: oddList 1 [] == Cons 1 Nil
  21556. 1576.13 s [algebraic-graphs] OK: oddList 1 [(2,3), (4,5)] == [1, 2, 3, 4, 5] :: List Int Int
  21557. 1576.13 s [algebraic-graphs] OK: oddList 1 [('a',2), ('b',3)] == Cons 1 (Cons 'a' (Cons 2 (Cons 'b' (Cons 3 Nil))))
  21558. 1576.13 s [algebraic-graphs]
  21559. 1576.13 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.path ============
  21560. 1576.13 s [algebraic-graphs] OK: path Nil == empty
  21561. 1576.13 s [algebraic-graphs] OK: path (Cons x Nil) == leftVertex x
  21562. 1576.13 s [algebraic-graphs] OK: path (Cons x (Cons y Nil)) == edge x y
  21563. 1576.13 s [algebraic-graphs] OK: path [1, 2, 3, 4, 5] == edges [(1,2), (3,2), (3,4), (5,4)]
  21564. 1576.13 s [algebraic-graphs]
  21565. 1576.13 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.circuit ============
  21566. 1576.13 s [algebraic-graphs] OK: circuit [] == empty
  21567. 1576.13 s [algebraic-graphs] OK: circuit [(x,y)] == edge x y
  21568. 1576.13 s [algebraic-graphs] OK: circuit [(1,2), (3,4), (5,6)] == edges [(1,2), (3,2), (3,4), (5,4), (5,6), (1,6)]
  21569. 1576.13 s [algebraic-graphs] OK: circuit . reverse == swap . circuit . map Data.Tuple.swap
  21570. 1576.13 s [algebraic-graphs]
  21571. 1576.13 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.biclique ============
  21572. 1576.13 s [algebraic-graphs] OK: biclique [] [] == empty
  21573. 1576.13 s [algebraic-graphs] OK: biclique xs [] == vertices xs []
  21574. 1576.13 s [algebraic-graphs] OK: biclique [] ys == vertices [] ys
  21575. 1576.13 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs []) (vertices [] ys)
  21576. 1576.13 s [algebraic-graphs]
  21577. 1576.13 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.star ============
  21578. 1576.13 s [algebraic-graphs] OK: star x [] == leftVertex x
  21579. 1576.13 s [algebraic-graphs] OK: star x [y] == edge x y
  21580. 1576.13 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  21581. 1576.13 s [algebraic-graphs] OK: star x ys == connect (leftVertex x) (vertices [] ys)
  21582. 1576.13 s [algebraic-graphs]
  21583. 1576.13 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.stars ============
  21584. 1576.13 s [algebraic-graphs] OK: stars [] == empty
  21585. 1576.13 s [algebraic-graphs] OK: stars [(x, [])] == leftVertex x
  21586. 1576.13 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  21587. 1576.13 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  21588. 1598.85 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  21589. 1598.86 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  21590. 1598.86 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  21591. 1598.86 s [algebraic-graphs]
  21592. 1598.86 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.mesh ============
  21593. 1598.86 s [algebraic-graphs] OK: mesh xs [] == empty
  21594. 1598.86 s [algebraic-graphs] OK: mesh [] ys == empty
  21595. 1598.86 s [algebraic-graphs] OK: mesh [x] [y] == leftVertex (x,y)
  21596. 1598.86 s [algebraic-graphs] OK: mesh [1,1] ['a','b'] == biclique [(1,'a'), (1,'b')] [(1,'a'), (1,'b')]
  21597. 1598.86 s [algebraic-graphs] OK: mesh [1,2] ['a','b'] == biclique [(1,'a'), (2,'b')] [(1,'b'), (2,'a')]
  21598. 1598.86 s [algebraic-graphs]
  21599. 1598.86 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.removeLeftVertex ============
  21600. 1598.87 s [algebraic-graphs] OK: removeLeftVertex x (leftVertex x) == empty
  21601. 1598.87 s [algebraic-graphs] OK: removeLeftVertex 1 (leftVertex 2) == leftVertex 2
  21602. 1598.87 s [algebraic-graphs] OK: removeLeftVertex x (rightVertex y) == rightVertex y
  21603. 1598.87 s [algebraic-graphs] OK: removeLeftVertex x (edge x y) == rightVertex y
  21604. 1598.87 s [algebraic-graphs] OK: removeLeftVertex x . removeLeftVertex x == removeLeftVertex x
  21605. 1598.87 s [algebraic-graphs]
  21606. 1598.87 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.removeRightVertex ============
  21607. 1598.87 s [algebraic-graphs] OK: removeRightVertex x (rightVertex x) == empty
  21608. 1598.87 s [algebraic-graphs] OK: removeRightVertex 1 (rightVertex 2) == rightVertex 2
  21609. 1598.87 s [algebraic-graphs] OK: removeRightVertex x (leftVertex y) == leftVertex y
  21610. 1598.87 s [algebraic-graphs] OK: removeRightVertex y (edge x y) == leftVertex x
  21611. 1598.87 s [algebraic-graphs] OK: removeRightVertex x . removeRightVertex x == removeRightVertex x
  21612. 1598.87 s [algebraic-graphs]
  21613. 1598.87 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.removeEdge ============
  21614. 1598.87 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x] [y]
  21615. 1598.87 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  21616. 1598.87 s [algebraic-graphs] OK: removeEdge x y . removeLeftVertex x == removeLeftVertex x
  21617. 1598.87 s [algebraic-graphs] OK: removeEdge x y . removeRightVertex y == removeRightVertex y
  21618. 1598.87 s [algebraic-graphs]
  21619. 1598.87 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.bimap ============
  21620. 1598.87 s [algebraic-graphs] OK: bimap f g empty == empty
  21621. 1598.87 s [algebraic-graphs] OK: bimap f g . vertex == vertex . Data.Bifunctor.bimap f g
  21622. 1598.87 s [algebraic-graphs] OK: bimap f g (edge x y) == edge (f x) (g y)
  21623. 1598.87 s [algebraic-graphs] OK: bimap id id == id
  21624. 1598.87 s [algebraic-graphs] OK: bimap f1 g1 . bimap f2 g2 == bimap (f1 . f2) (g1 . g2)
  21625. 1598.87 s [algebraic-graphs]
  21626. 1598.87 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.box ============
  21627. 1598.87 s [algebraic-graphs] OK: box (path [0,1]) (path ['a','b']) == <correct result>
  21628. 1598.87 s [algebraic-graphs]
  21629. 1598.87 s [algebraic-graphs] OK: box x y ~~ box y x
  21630. 1598.87 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  21631. 1598.87 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  21632. 1598.87 s [algebraic-graphs] OK: box x (leftVertex ()) ~~ x
  21633. 1598.87 s [algebraic-graphs] OK: box x (rightVertex ()) ~~ swap x
  21634. 1598.87 s [algebraic-graphs] OK: box x empty ~~ empty
  21635. 1598.87 s [algebraic-graphs] OK: vertexCount (box x y) <= vertexCount x * vertexCount y
  21636. 1598.87 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  21637. 1598.87 s [algebraic-graphs]
  21638. 1598.87 s [algebraic-graphs] OK: box == boxWith (,) (,) (,) (,)
  21639. 1598.87 s [algebraic-graphs]
  21640. 1598.87 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.consistent ============
  21641. 1598.87 s [algebraic-graphs] OK: consistent empty == True
  21642. 1598.87 s [algebraic-graphs] OK: consistent (vertex x) == True
  21643. 1598.87 s [algebraic-graphs] OK: consistent (edge x y) == True
  21644. 1598.87 s [algebraic-graphs] OK: consistent (edges x) == True
  21645. 1598.87 s [algebraic-graphs] OK: consistent (toBipartite x) == True
  21646. 1598.87 s [algebraic-graphs] OK: consistent (swap x) == True
  21647. 1598.87 s [algebraic-graphs] OK: consistent (circuit xs) == True
  21648. 1598.87 s [algebraic-graphs] OK: consistent (biclique xs ys) == True
  21649. 1598.87 s [algebraic-graphs]
  21650. 1598.87 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.detectParts ============
  21651. 1598.87 s [algebraic-graphs] OK: detectParts empty == Right empty
  21652. 1598.87 s [algebraic-graphs] OK: detectParts (vertex 1) == Right (leftVertex 1)
  21653. 1598.87 s [algebraic-graphs] OK: detectParts (edge 1 1) == Left [1]
  21654. 1598.87 s [algebraic-graphs] OK: detectParts (edge 1 2) == Right (edge 1 2)
  21655. 1598.87 s [algebraic-graphs] OK: detectParts (edge 0 (-1)) == Right (edge (-1) 0)
  21656. 1598.87 s [algebraic-graphs] OK: detectParts (1 * (2 + 3)) == Right (edges [(1, 2), (1, 3)])
  21657. 1598.87 s [algebraic-graphs] OK: detectParts ((1 + 3) * (2 + 4) + 6 * 5) == Right (swap (1 + 3) * (2 + 4) + swap 5 * 6
  21658. 1598.87 s [algebraic-graphs] OK: detectParts ((1 + 2) * (3 + 4) * (5 + 6)) == Left [1, 3, 2, 4, 5]
  21659. 1598.87 s [algebraic-graphs] OK: detectParts ((1 + 2) * (3 + 4) + (3 + 4) * 5) == Right (swap (1 + 2) * (3 + 4) + swap 5 * (3 + 4))
  21660. 1598.87 s [algebraic-graphs] OK: detectParts (1 * 2 * 3) == Left [2, 3, 1]
  21661. 1598.87 s [algebraic-graphs] OK: detectParts ((1 * 3 * 4) + 2 * (1 + 2)) == Left [2]
  21662. 1598.87 s [algebraic-graphs] OK: detectParts (clique [1..10]) == Left [1, 2, 3]
  21663. 1598.87 s [algebraic-graphs] OK: detectParts (circuit [1..11]) == Left [1..11]
  21664. 1598.87 s [algebraic-graphs] OK: detectParts (circuit [1..10]) == Right (circuit [(2 * x - 1, 2 * x) | x <- [1..5]])
  21665. 1598.87 s [algebraic-graphs] OK: detectParts (biclique [] xs) == Right (vertices xs [])
  21666. 1598.87 s [algebraic-graphs] OK: detectParts (biclique (map Left (x:xs)) (map Right ys)) == Right (biclique (map Left (x:xs)) (map Right ys))
  21667. 1598.87 s [algebraic-graphs] OK: isRight (detectParts (star x ys)) == not (elem x ys)
  21668. 1598.87 s [algebraic-graphs] OK: isRight (detectParts (fromBipartite (toBipartite x))) == True
  21669. 1598.87 s [algebraic-graphs]
  21670. 1598.87 s [algebraic-graphs] OK: ((all ((flip Set.member) $ edgeSet $ symmetricClosure x) . edgeSet) <$> detectParts x) /= Right False
  21671. 1598.87 s [algebraic-graphs] OK: (Set.map $ fromEither) <$> (vertexSet <$> (detectParts (fromBipartite (toBipartite x)))) == Right (vertexSet x)
  21672. 1598.87 s [algebraic-graphs] OK: fromEither (Bifunctor.bimap ((flip Set.isSubsetOf) (vertexSet x) . Set.fromList) (const True) (detectParts x)) == True
  21673. 1598.87 s [algebraic-graphs] OK: fromEither (Bifunctor.bimap ((flip Set.isSubsetOf) (edgeSet (symmetricClosure x)) . AM.edgeSet . circuit) (const True) (detectParts x)) == True
  21674. 1598.87 s [algebraic-graphs] OK: fromEither (Bifunctor.bimap (((==) 1) . ((flip mod) 2) . length) (const True) (detectParts x)) == True
  21675. 1598.87 s [algebraic-graphs]
  21676. 1598.87 s [algebraic-graphs] ============ Show (Bipartite.AdjacencyMap.Algorithm.Matching a b) ============
  21677. 1598.87 s [algebraic-graphs] OK: show (matching []) == "matching []"
  21678. 1598.87 s [algebraic-graphs] OK: show (matching [(2,'a'),(1,'b')]) == "matching [(1,'b'),(2,'a')]"
  21679. 1598.87 s [algebraic-graphs]
  21680. 1598.87 s [algebraic-graphs] ============ Eq (Bipartite.AdjacencyMap.Algorithm.Matching a b) ============
  21681. 1598.87 s [algebraic-graphs] OK: (x == y) == ((pairOfLeft x == pairOfLeft y) && (pairOfRight x == pairOfRight y))
  21682. 1598.87 s [algebraic-graphs]
  21683. 1598.87 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.pairOfLeft ============
  21684. 1598.87 s [algebraic-graphs] OK: pairOfLeft (matching []) == Map.empty
  21685. 1598.87 s [algebraic-graphs] OK: pairOfLeft (matching [(2,'a'), (1,'b')]) == Map.fromList [(2,'a'), (1,'b')]
  21686. 1598.87 s [algebraic-graphs] OK: Map.size . pairOfLeft == Map.size . pairOfRight
  21687. 1598.87 s [algebraic-graphs]
  21688. 1598.87 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.pairOfRight ============
  21689. 1598.87 s [algebraic-graphs] OK: pairOfRight (matching []) == Map.empty
  21690. 1598.87 s [algebraic-graphs] OK: pairOfRight (matching [(2,'a'), (1,'b')]) == Map.fromList [('a',2), ('b',1)]
  21691. 1598.87 s [algebraic-graphs] OK: Map.size . pairOfRight == Map.size . pairOfLeft
  21692. 1598.87 s [algebraic-graphs]
  21693. 1598.87 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.matching ============
  21694. 1598.87 s [algebraic-graphs] OK: matching [(1,'a'), (1,'b')] == matching [(1,'b')]
  21695. 1598.87 s [algebraic-graphs] OK: matching [(1,'a'), (1,'b'), (2,'b'), (2,'a')] == matching [(2,'a')]
  21696. 1598.87 s [algebraic-graphs]
  21697. 1598.87 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.isMatchingOf ============
  21698. 1598.87 s [algebraic-graphs] OK: isMatchingOf (matching []) x == True
  21699. 1598.87 s [algebraic-graphs] OK: isMatchingOf (matching xs) empty == null xs
  21700. 1598.87 s [algebraic-graphs] OK: isMatchingOf (matching [(x,y)]) (edge x y) == True
  21701. 1598.87 s [algebraic-graphs] OK: isMatchingOf (matching [(1,2)]) (edge 2 1) == False
  21702. 1598.87 s [algebraic-graphs]
  21703. 1598.87 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.matchingSize ============
  21704. 1598.87 s [algebraic-graphs] OK: matchingSize (matching []) == 0
  21705. 1598.87 s [algebraic-graphs] OK: matchingSize (matching [(2,'a'), (1,'b')]) == 2
  21706. 1598.87 s [algebraic-graphs] OK: matchingSize (matching [(1,'a'), (1,'b')]) == 1
  21707. 1598.87 s [algebraic-graphs] OK: matchingSize (matching xs) <= length xs
  21708. 1598.87 s [algebraic-graphs] OK: matchingSize x == Map.size . pairOfLeft
  21709. 1598.87 s [algebraic-graphs]
  21710. 1598.87 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.maxMatching ============
  21711. 1598.87 s [algebraic-graphs] OK: maxMatching empty == matching []
  21712. 1598.87 s [algebraic-graphs] OK: maxMatching (vertices xs ys) == matching []
  21713. 1598.87 s [algebraic-graphs] OK: maxMatching (path [1,2,3,4]) == matching [(1,2), (3,4)]
  21714. 1598.87 s [algebraic-graphs] OK: matchingSize (maxMatching (circuit [(1,2), (3,4), (5,6)])) == 3
  21715. 1598.87 s [algebraic-graphs] OK: matchingSize (maxMatching (star x (y:ys))) == 1
  21716. 1598.87 s [algebraic-graphs] OK: matchingSize (maxMatching (biclique xs ys)) == min (length (nub xs)) (length (nub ys))
  21717. 1598.87 s [algebraic-graphs] OK: isMatchingOf (maxMatching x) x == True
  21718. 1598.87 s [algebraic-graphs]
  21719. 1598.87 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.isVertexCoverOf ============
  21720. 1598.87 s [algebraic-graphs] OK: isVertexCoverOf (xs , ys ) empty == Set.null xs && Set.null ys
  21721. 1598.87 s [algebraic-graphs] OK: isVertexCoverOf (xs , ys ) (leftVertex x) == Set.isSubsetOf xs (Set.singleton x) && Set.null ys
  21722. 1598.87 s [algebraic-graphs] OK: isVertexCoverOf (Set.empty , Set.empty ) (edge x y) == False
  21723. 1598.87 s [algebraic-graphs] OK: isVertexCoverOf (Set.singleton x, ys ) (edge x y) == Set.isSubsetOf ys (Set.singleton y)
  21724. 1598.87 s [algebraic-graphs] OK: isVertexCoverOf (xs , Set.singleton y) (edge x y) == Set.isSubsetOf xs (Set.singleton x)
  21725. 1598.87 s [algebraic-graphs]
  21726. 1598.87 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.minVertexCover ============
  21727. 1598.87 s [algebraic-graphs] OK: minVertexCover empty == (Set.empty, Set.empty)
  21728. 1601.40 s [algebraic-graphs] OK: minVertexCover (vertices xs ys) == (Set.empty, Set.empty)
  21729. 1601.40 s [algebraic-graphs] OK: minVertexCover (path [1,2,3]) == (Set.empty, Set.singleton 2)
  21730. 1601.40 s [algebraic-graphs] OK: minVertexCover (star x (1:2:ys)) == (Set.singleton x, Set.empty)
  21731. 1601.40 s [algebraic-graphs] OK: vertexCoverSize (minVertexCover (biclique xs ys)) == min (length (nub xs)) (length (nub ys))
  21732. 1601.40 s [algebraic-graphs] OK: vertexCoverSize . minVertexCover == matchingSize . maxMatching
  21733. 1601.40 s [algebraic-graphs] OK: isVertexCoverOf (minVertexCover x) x == True
  21734. 1601.40 s [algebraic-graphs]
  21735. 1601.40 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.isIndependentSetOf ============
  21736. 1601.40 s [algebraic-graphs] OK: isIndependentSetOf (xs , ys ) empty == Set.null xs && Set.null ys
  21737. 1601.40 s [algebraic-graphs] OK: isIndependentSetOf (xs , ys ) (leftVertex x) == Set.isSubsetOf xs (Set.singleton x) && Set.null ys
  21738. 1601.40 s [algebraic-graphs] OK: isIndependentSetOf (Set.empty , Set.empty ) (edge x y) == True
  21739. 1601.40 s [algebraic-graphs] OK: isIndependentSetOf (Set.singleton x, ys ) (edge x y) == Set.null ys
  21740. 1601.40 s [algebraic-graphs] OK: isIndependentSetOf (xs , Set.singleton y) (edge x y) == Set.null xs
  21741. 1601.40 s [algebraic-graphs]
  21742. 1601.40 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.maxIndependentSet ============
  21743. 1601.40 s [algebraic-graphs] OK: maxIndependentSet empty == (Set.empty, Set.empty)
  21744. 1601.40 s [algebraic-graphs] OK: maxIndependentSet (vertices xs ys) == (Set.fromList xs, Set.fromList ys)
  21745. 1601.40 s [algebraic-graphs] OK: maxIndependentSet (path [1,2,3]) == (Set.fromList [1,3], Set.empty)
  21746. 1601.40 s [algebraic-graphs] OK: maxIndependentSet (star x (1:2:ys)) == (Set.empty, Set.fromList (1:2:ys))
  21747. 1601.40 s [algebraic-graphs] OK: independentSetSize (maxIndependentSet (biclique xs ys)) == max (length (nub xs)) (length (nub ys))
  21748. 1601.40 s [algebraic-graphs] OK: independentSetSize (maxIndependentSet x) == vertexCount x - vertexCoverSize (minVertexCover x)
  21749. 1601.40 s [algebraic-graphs] OK: isIndependentSetOf (maxIndependentSet x) x == True
  21750. 1601.40 s [algebraic-graphs]
  21751. 1601.40 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.augmentingPath ============
  21752. 1601.40 s [algebraic-graphs] OK: augmentingPath (matching []) empty == Left (Set.empty, Set.empty)
  21753. 1601.40 s [algebraic-graphs] OK: augmentingPath (matching []) (edge 1 2) == Right [1,2]
  21754. 1601.40 s [algebraic-graphs] OK: augmentingPath (matching [(1,2)]) (path [1,2,3]) == Left (Set.empty, Set.singleton 2)
  21755. 1601.40 s [algebraic-graphs] OK: augmentingPath (matching [(3,2)]) (path [1,2,3,4]) == Right [1,2,3,4]
  21756. 1601.40 s [algebraic-graphs] OK: isLeft (augmentingPath (maxMatching x) x) == True
  21757. 1601.40 s [algebraic-graphs]
  21758. 1601.40 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.consistentMatching ============
  21759. 1601.40 s [algebraic-graphs] OK: consistentMatching (matching xs) == True
  21760. 1601.40 s [algebraic-graphs] OK: consistentMatching (maxMatching x) == True
  21761. 1601.40 s [algebraic-graphs]
  21762. 1601.40 s [algebraic-graphs] ============ Export.Eq ============
  21763. 1601.40 s [algebraic-graphs] OK: mempty /= literal ""
  21764. 1601.40 s [algebraic-graphs]
  21765. 1601.40 s [algebraic-graphs] ============ Export.Ord ============
  21766. 1601.40 s [algebraic-graphs] OK: mempty < literal ""
  21767. 1601.40 s [algebraic-graphs]
  21768. 1601.40 s [algebraic-graphs] ============ Export.isEmpty ============
  21769. 1601.40 s [algebraic-graphs] OK: isEmpty mempty == True
  21770. 1601.40 s [algebraic-graphs] OK: isEmpty (literal "") == False
  21771. 1601.40 s [algebraic-graphs] OK: isEmpty x == (x == mempty)
  21772. 1601.40 s [algebraic-graphs]
  21773. 1601.40 s [algebraic-graphs] ============ Export.literal ============
  21774. 1601.40 s [algebraic-graphs] OK: literal "Hello, " <> literal "World!" == literal "Hello, World!"
  21775. 1601.40 s [algebraic-graphs] OK: literal "I am just a string literal" == "I am just a string literal"
  21776. 1601.40 s [algebraic-graphs] OK: render . literal == id
  21777. 1601.40 s [algebraic-graphs]
  21778. 1601.40 s [algebraic-graphs] ============ Export.render ============
  21779. 1601.40 s [algebraic-graphs] OK: render (literal "al" <> literal "ga") == "alga"
  21780. 1601.40 s [algebraic-graphs] OK: render mempty == mempty
  21781. 1601.41 s [algebraic-graphs]
  21782. 1601.41 s [algebraic-graphs] ============ Export.<+> ============
  21783. 1601.41 s [algebraic-graphs] OK: x <+> mempty == x
  21784. 1601.41 s [algebraic-graphs] OK: mempty <+> x == x
  21785. 1601.41 s [algebraic-graphs] OK: x <+> (y <+> z) == (x <+> y) <+> z
  21786. 1601.41 s [algebraic-graphs] OK: "name" <+> "surname" == "name surname"
  21787. 1601.41 s [algebraic-graphs]
  21788. 1601.41 s [algebraic-graphs] ============ Export.brackets ============
  21789. 1601.41 s [algebraic-graphs] OK: brackets "i" == "[i]"
  21790. 1601.41 s [algebraic-graphs] OK: brackets mempty == "[]"
  21791. 1601.41 s [algebraic-graphs]
  21792. 1601.41 s [algebraic-graphs] ============ Export.doubleQuotes ============
  21793. 1601.41 s [algebraic-graphs] OK: doubleQuotes "/path/with spaces" == "\"/path/with spaces\""
  21794. 1601.41 s [algebraic-graphs] OK: doubleQuotes (doubleQuotes mempty) == "\"\"\"\""
  21795. 1601.41 s [algebraic-graphs]
  21796. 1601.41 s [algebraic-graphs] ============ Export.indent ============
  21797. 1601.41 s [algebraic-graphs] OK: indent 0 == id
  21798. 1601.41 s [algebraic-graphs] OK: indent 1 mempty == " "
  21799. 1601.41 s [algebraic-graphs]
  21800. 1601.41 s [algebraic-graphs] ============ Export.unlines ============
  21801. 1601.41 s [algebraic-graphs] OK: unlines [] == mempty
  21802. 1601.41 s [algebraic-graphs] OK: unlines [mempty] == "\n"
  21803. 1601.41 s [algebraic-graphs] OK: unlines ["title", "subtitle"] == "title\nsubtitle\n"
  21804. 1601.41 s [algebraic-graphs]
  21805. 1601.41 s [algebraic-graphs] ============ Export.export ============
  21806. 1601.41 s [algebraic-graphs] OK: render $ export vDoc eDoc (1 + 2 * (3 + 4) :: Graph Int)
  21807. 1601.41 s [algebraic-graphs]
  21808. 1601.41 s [algebraic-graphs] ============ Export.Dot.export ============
  21809. 1601.41 s [algebraic-graphs] OK: export style (1 * 2 + 3 * 4 * 5 :: Graph Int)
  21810. 1601.41 s [algebraic-graphs]
  21811. 1601.41 s [algebraic-graphs] =========== Export.Dot.attributeQuoting ============
  21812. 1601.41 s [algebraic-graphs] OK: export style' (1 * 2 + 3 * 4 * 5 :: Graph Int)
  21813. 1601.41 s [algebraic-graphs]
  21814. 1601.41 s [algebraic-graphs] ============ Export.Dot.exportAsIs ============
  21815. 1601.41 s [algebraic-graphs] OK: exportAsIs (circuit ["a", "b", "c"] :: Graph String)
  21816. 1601.41 s [algebraic-graphs]
  21817. 1601.41 s [algebraic-graphs] ============ Export.Dot.exportViaShow ============
  21818. 1601.41 s [algebraic-graphs] OK: exportViaShow (1 + 2 * (3 + 4) :: Graph Int)
  21819. 1601.41 s [algebraic-graphs]
  21820. 1601.41 s [algebraic-graphs] ============ Graph ============
  21821. 1601.41 s [algebraic-graphs] OK: Axioms of graphs
  21822. 1601.41 s [algebraic-graphs] OK: Theorems of graphs
  21823. 1601.41 s [algebraic-graphs]
  21824. 1601.41 s [algebraic-graphs] ============ Graph.Ord ============
  21825. 1601.41 s [algebraic-graphs] OK: vertex 1 < vertex 2
  21826. 1601.41 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  21827. 1601.41 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  21828. 1601.41 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  21829. 1601.41 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  21830. 1601.41 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  21831. 1601.41 s [algebraic-graphs] OK: x <= x + y
  21832. 1601.41 s [algebraic-graphs] OK: x + y <= x * y
  21833. 1601.41 s [algebraic-graphs]
  21834. 1601.41 s [algebraic-graphs] ============ Graph.empty ============
  21835. 1601.41 s [algebraic-graphs] OK: isEmpty empty == True
  21836. 1601.41 s [algebraic-graphs] OK: hasVertex x empty == False
  21837. 1601.41 s [algebraic-graphs] OK: vertexCount empty == 0
  21838. 1601.41 s [algebraic-graphs] OK: edgeCount empty == 0
  21839. 1601.41 s [algebraic-graphs]
  21840. 1601.41 s [algebraic-graphs] ============ Graph.vertex ============
  21841. 1601.41 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  21842. 1601.41 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  21843. 1601.41 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  21844. 1601.41 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  21845. 1601.41 s [algebraic-graphs]
  21846. 1601.41 s [algebraic-graphs] ============ Graph.edge ============
  21847. 1601.41 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  21848. 1601.41 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  21849. 1601.41 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  21850. 1601.41 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  21851. 1601.41 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  21852. 1601.41 s [algebraic-graphs]
  21853. 1601.41 s [algebraic-graphs] ============ Graph.overlay ============
  21854. 1601.41 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  21855. 1601.41 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  21856. 1601.41 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  21857. 1601.41 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  21858. 1601.41 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  21859. 1601.41 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  21860. 1601.41 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  21861. 1601.41 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  21862. 1601.41 s [algebraic-graphs]
  21863. 1601.41 s [algebraic-graphs] ============ Graph.connect ============
  21864. 1601.41 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  21865. 1601.41 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  21866. 1601.41 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  21867. 1601.41 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  21868. 1601.41 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  21869. 1601.41 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  21870. 1601.41 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  21871. 1601.41 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  21872. 1601.41 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  21873. 1601.41 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  21874. 1601.41 s [algebraic-graphs]
  21875. 1601.41 s [algebraic-graphs] ============ Graph.vertices ============
  21876. 1601.41 s [algebraic-graphs] OK: vertices [] == empty
  21877. 1601.41 s [algebraic-graphs] OK: vertices [x] == vertex x
  21878. 1601.41 s [algebraic-graphs] OK: vertices == overlays . map vertex
  21879. 1601.41 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  21880. 1601.41 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  21881. 1601.41 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  21882. 1601.41 s [algebraic-graphs]
  21883. 1601.41 s [algebraic-graphs] ============ Graph.edges ============
  21884. 1601.41 s [algebraic-graphs] OK: edges [] == empty
  21885. 1601.41 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  21886. 1601.41 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  21887. 1601.41 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  21888. 1601.41 s [algebraic-graphs]
  21889. 1601.41 s [algebraic-graphs] ============ Graph.overlays ============
  21890. 1601.41 s [algebraic-graphs] OK: overlays [] == empty
  21891. 1601.41 s [algebraic-graphs] OK: overlays [x] == x
  21892. 1601.41 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  21893. 1601.41 s [algebraic-graphs] OK: overlays == foldr overlay empty
  21894. 1601.41 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  21895. 1601.41 s [algebraic-graphs]
  21896. 1601.41 s [algebraic-graphs] ============ Graph.connects ============
  21897. 1601.41 s [algebraic-graphs] OK: connects [] == empty
  21898. 1601.41 s [algebraic-graphs] OK: connects [x] == x
  21899. 1601.41 s [algebraic-graphs] OK: connects [x,y] == connect x y
  21900. 1601.41 s [algebraic-graphs] OK: connects == foldr connect empty
  21901. 1601.41 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  21902. 1601.41 s [algebraic-graphs]
  21903. 1601.41 s [algebraic-graphs] ============ Graph.isSubgraphOf ============
  21904. 1601.41 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  21905. 1601.41 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  21906. 1601.41 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  21907. 1601.41 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  21908. 1601.41 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  21909. 1601.41 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  21910. 1601.41 s [algebraic-graphs]
  21911. 1601.41 s [algebraic-graphs] ============ Graph.toGraph et al. ============
  21912. 1601.41 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  21913. 1601.41 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  21914. 1601.41 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  21915. 1601.41 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  21916. 1601.41 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  21917. 1601.41 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  21918. 1601.41 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  21919. 1601.41 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  21920. 1601.41 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  21921. 1602.25 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  21922. 1602.25 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  21923. 1602.25 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  21924. 1602.25 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  21925. 1602.25 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  21926. 1602.25 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  21927. 1602.25 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  21928. 1602.25 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  21929. 1602.25 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  21930. 1602.25 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  21931. 1602.25 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  21932. 1602.25 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  21933. 1602.25 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  21934. 1602.25 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  21935. 1602.25 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  21936. 1602.25 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  21937. 1602.25 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  21938. 1602.25 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  21939. 1602.25 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  21940. 1602.25 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  21941. 1602.25 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  21942. 1602.25 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  21943. 1602.25 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  21944. 1602.25 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  21945. 1602.25 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  21946. 1602.25 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  21947. 1602.25 s [algebraic-graphs]
  21948. 1602.25 s [algebraic-graphs] ============ Graph.foldg ============
  21949. 1602.25 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  21950. 1602.25 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  21951. 1602.25 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  21952. 1602.25 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  21953. 1602.26 s [algebraic-graphs]
  21954. 1602.26 s [algebraic-graphs] ============ Graph.isEmpty ============
  21955. 1602.26 s [algebraic-graphs] OK: isEmpty empty == True
  21956. 1602.26 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  21957. 1602.26 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  21958. 1602.26 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  21959. 1602.26 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  21960. 1602.26 s [algebraic-graphs]
  21961. 1602.26 s [algebraic-graphs] ============ Graph.hasVertex ============
  21962. 1602.26 s [algebraic-graphs] OK: hasVertex x empty == False
  21963. 1602.26 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  21964. 1602.26 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  21965. 1602.26 s [algebraic-graphs]
  21966. 1602.26 s [algebraic-graphs] ============ Graph.hasEdge ============
  21967. 1602.26 s [algebraic-graphs] OK: hasEdge x y empty == False
  21968. 1602.26 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  21969. 1602.26 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  21970. 1602.26 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  21971. 1602.26 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  21972. 1602.26 s [algebraic-graphs]
  21973. 1602.26 s [algebraic-graphs] ============ Graph.vertexCount ============
  21974. 1602.26 s [algebraic-graphs] OK: vertexCount empty == 0
  21975. 1602.26 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  21976. 1602.26 s [algebraic-graphs] OK: vertexCount == length . vertexList
  21977. 1602.26 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  21978. 1602.26 s [algebraic-graphs]
  21979. 1602.26 s [algebraic-graphs] ============ Graph.edgeCount ============
  21980. 1602.26 s [algebraic-graphs] OK: edgeCount empty == 0
  21981. 1602.26 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  21982. 1602.26 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  21983. 1602.26 s [algebraic-graphs] OK: edgeCount == length . edgeList
  21984. 1602.26 s [algebraic-graphs]
  21985. 1602.26 s [algebraic-graphs] ============ Graph.vertexList ============
  21986. 1602.26 s [algebraic-graphs] OK: vertexList empty == []
  21987. 1602.26 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  21988. 1602.26 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  21989. 1602.26 s [algebraic-graphs]
  21990. 1602.26 s [algebraic-graphs] ============ Graph.vertexSet ============
  21991. 1602.26 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  21992. 1602.26 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  21993. 1602.26 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  21994. 1602.26 s [algebraic-graphs]
  21995. 1602.26 s [algebraic-graphs] ============ Graph.vertexIntSet ============
  21996. 1602.26 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  21997. 1602.26 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  21998. 1602.26 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  21999. 1602.26 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  22000. 1602.26 s [algebraic-graphs]
  22001. 1602.26 s [algebraic-graphs] ============ Graph.edgeList ============
  22002. 1602.26 s [algebraic-graphs] OK: edgeList empty == []
  22003. 1602.26 s [algebraic-graphs] OK: edgeList (vertex x) == []
  22004. 1602.26 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  22005. 1602.26 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  22006. 1602.26 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  22007. 1602.26 s [algebraic-graphs]
  22008. 1602.26 s [algebraic-graphs] ============ Graph.edgeSet ============
  22009. 1602.26 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  22010. 1602.26 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  22011. 1602.26 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  22012. 1602.26 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  22013. 1602.26 s [algebraic-graphs]
  22014. 1602.26 s [algebraic-graphs] ============ Graph.adjacencyList ============
  22015. 1602.26 s [algebraic-graphs] OK: adjacencyList empty == []
  22016. 1602.26 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  22017. 1602.26 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  22018. 1602.26 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  22019. 1602.26 s [algebraic-graphs]
  22020. 1602.26 s [algebraic-graphs] ============ Graph.preSet ============
  22021. 1602.26 s [algebraic-graphs] OK: preSet x empty == Set.empty
  22022. 1602.26 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  22023. 1602.26 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  22024. 1602.26 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  22025. 1602.26 s [algebraic-graphs]
  22026. 1602.26 s [algebraic-graphs] ============ Graph.preIntSet ============
  22027. 1602.26 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  22028. 1602.26 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  22029. 1602.26 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  22030. 1602.26 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  22031. 1602.26 s [algebraic-graphs]
  22032. 1602.26 s [algebraic-graphs] ============ Graph.postSet ============
  22033. 1602.26 s [algebraic-graphs] OK: postSet x empty == Set.empty
  22034. 1602.26 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  22035. 1602.26 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  22036. 1602.26 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  22037. 1602.26 s [algebraic-graphs]
  22038. 1602.26 s [algebraic-graphs] ============ Graph.postIntSet ============
  22039. 1602.26 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  22040. 1602.26 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  22041. 1602.26 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  22042. 1602.26 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  22043. 1602.26 s [algebraic-graphs]
  22044. 1602.26 s [algebraic-graphs] ============ Graph.size ============
  22045. 1602.26 s [algebraic-graphs] OK: size empty == 1
  22046. 1602.26 s [algebraic-graphs] OK: size (vertex x) == 1
  22047. 1602.26 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  22048. 1602.26 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  22049. 1602.26 s [algebraic-graphs] OK: size x >= 1
  22050. 1602.26 s [algebraic-graphs] OK: size x >= vertexCount x
  22051. 1602.26 s [algebraic-graphs]
  22052. 1602.26 s [algebraic-graphs] ============ Graph.path ============
  22053. 1602.26 s [algebraic-graphs] OK: path [] == empty
  22054. 1602.26 s [algebraic-graphs] OK: path [x] == vertex x
  22055. 1602.26 s [algebraic-graphs] OK: path [x,y] == edge x y
  22056. 1602.26 s [algebraic-graphs]
  22057. 1602.26 s [algebraic-graphs] ============ Graph.circuit ============
  22058. 1602.26 s [algebraic-graphs] OK: circuit [] == empty
  22059. 1602.26 s [algebraic-graphs] OK: circuit [x] == edge x x
  22060. 1602.26 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  22061. 1602.26 s [algebraic-graphs]
  22062. 1602.26 s [algebraic-graphs] ============ Graph.clique ============
  22063. 1602.26 s [algebraic-graphs] OK: clique [] == empty
  22064. 1602.26 s [algebraic-graphs] OK: clique [x] == vertex x
  22065. 1602.26 s [algebraic-graphs] OK: clique [x,y] == edge x y
  22066. 1602.26 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  22067. 1602.26 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  22068. 1602.26 s [algebraic-graphs]
  22069. 1602.26 s [algebraic-graphs] ============ Graph.biclique ============
  22070. 1602.26 s [algebraic-graphs] OK: biclique [] [] == empty
  22071. 1602.26 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  22072. 1602.26 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  22073. 1602.26 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  22074. 1602.26 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  22075. 1602.26 s [algebraic-graphs]
  22076. 1602.26 s [algebraic-graphs] ============ Graph.star ============
  22077. 1602.26 s [algebraic-graphs] OK: star x [] == vertex x
  22078. 1602.26 s [algebraic-graphs] OK: star x [y] == edge x y
  22079. 1602.26 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  22080. 1602.26 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  22081. 1602.26 s [algebraic-graphs]
  22082. 1602.26 s [algebraic-graphs] ============ Graph.stars ============
  22083. 1602.26 s [algebraic-graphs] OK: stars [] == empty
  22084. 1602.26 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  22085. 1602.26 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  22086. 1602.26 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  22087. 1602.26 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  22088. 1602.26 s [algebraic-graphs] OK: stars . adjacencyList == id
  22089. 1602.26 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  22090. 1602.26 s [algebraic-graphs]
  22091. 1602.26 s [algebraic-graphs] ============ Graph.tree ============
  22092. 1602.26 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  22093. 1602.26 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  22094. 1602.26 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  22095. 1602.26 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  22096. 1602.26 s [algebraic-graphs]
  22097. 1602.26 s [algebraic-graphs] ============ Graph.forest ============
  22098. 1602.26 s [algebraic-graphs] OK: forest [] == empty
  22099. 1602.26 s [algebraic-graphs] OK: forest [x] == tree x
  22100. 1602.26 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  22101. 1602.26 s [algebraic-graphs] OK: forest == overlays . map tree
  22102. 1602.26 s [algebraic-graphs]
  22103. 1602.26 s [algebraic-graphs] ============ Graph.removeVertex ============
  22104. 1606.98 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  22105. 1606.98 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  22106. 1606.98 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  22107. 1607.02 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  22108. 1607.02 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  22109. 1607.02 s [algebraic-graphs]
  22110. 1607.02 s [algebraic-graphs] ============ Graph.removeEdge ============
  22111. 1607.02 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  22112. 1607.02 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  22113. 1607.02 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  22114. 1607.02 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  22115. 1607.02 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  22116. 1607.02 s [algebraic-graphs] OK: size (removeEdge x y z) <= 3 * size z
  22117. 1607.02 s [algebraic-graphs]
  22118. 1607.02 s [algebraic-graphs] ============ Graph.replaceVertex ============
  22119. 1607.02 s [algebraic-graphs] OK: replaceVertex x x == id
  22120. 1607.02 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  22121. 1607.02 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  22122. 1607.03 s [algebraic-graphs]
  22123. 1607.03 s [algebraic-graphs] ============ Graph.mergeVertices ============
  22124. 1607.03 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  22125. 1607.03 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  22126. 1607.03 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  22127. 1607.03 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  22128. 1607.03 s [algebraic-graphs]
  22129. 1607.03 s [algebraic-graphs] ============ Graph.transpose ============
  22130. 1607.03 s [algebraic-graphs] OK: transpose empty == empty
  22131. 1607.03 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  22132. 1607.03 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  22133. 1607.03 s [algebraic-graphs] OK: transpose . transpose == id
  22134. 1607.03 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  22135. 1607.03 s [algebraic-graphs]
  22136. 1607.03 s [algebraic-graphs] ============ Graph.gmap ============
  22137. 1607.03 s [algebraic-graphs] OK: gmap f empty == empty
  22138. 1607.03 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  22139. 1607.03 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  22140. 1607.03 s [algebraic-graphs] OK: gmap id == id
  22141. 1607.03 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  22142. 1607.03 s [algebraic-graphs]
  22143. 1607.03 s [algebraic-graphs] ============ Graph.induce ============
  22144. 1607.03 s [algebraic-graphs] OK: induce (const True ) x == x
  22145. 1607.03 s [algebraic-graphs] OK: induce (const False) x == empty
  22146. 1607.03 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  22147. 1607.03 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  22148. 1607.03 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  22149. 1607.03 s [algebraic-graphs]
  22150. 1607.03 s [algebraic-graphs] ============ Graph.induceJust ============
  22151. 1607.03 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  22152. 1607.03 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  22153. 1607.03 s [algebraic-graphs] OK: induceJust . gmap Just == id
  22154. 1607.03 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  22155. 1607.03 s [algebraic-graphs]
  22156. 1607.03 s [algebraic-graphs] ============ Graph.compose ============
  22157. 1607.03 s [algebraic-graphs] OK: compose empty x == empty
  22158. 1607.03 s [algebraic-graphs] OK: compose x empty == empty
  22159. 1607.03 s [algebraic-graphs] OK: compose (vertex x) y == empty
  22160. 1607.03 s [algebraic-graphs] OK: compose x (vertex y) == empty
  22161. 1607.03 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  22162. 1607.03 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  22163. 1607.03 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  22164. 1607.03 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  22165. 1607.03 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  22166. 1607.03 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  22167. 1607.03 s [algebraic-graphs] OK: size (compose x y) <= edgeCount x + edgeCount y + 1
  22168. 1607.03 s [algebraic-graphs]
  22169. 1607.03 s [algebraic-graphs] ============ Graph.(===) ============
  22170. 1607.03 s [algebraic-graphs] OK: x === x == True
  22171. 1607.03 s [algebraic-graphs] OK: x === x + empty == False
  22172. 1607.03 s [algebraic-graphs] OK: x + y === x + y == True
  22173. 1607.03 s [algebraic-graphs] OK: 1 + 2 === 2 + 1 == False
  22174. 1607.03 s [algebraic-graphs] OK: x + y === x * y == False
  22175. 1607.03 s [algebraic-graphs]
  22176. 1607.03 s [algebraic-graphs] ============ Graph.mesh ============
  22177. 1607.03 s [algebraic-graphs] OK: mesh xs [] == empty
  22178. 1607.03 s [algebraic-graphs] OK: mesh [] ys == empty
  22179. 1607.03 s [algebraic-graphs] OK: mesh [x] [y] == vertex (x, y)
  22180. 1607.03 s [algebraic-graphs] OK: mesh xs ys == box (path xs) (path ys)
  22181. 1607.03 s [algebraic-graphs] OK: mesh [1..3] "ab" == <correct result>
  22182. 1607.03 s [algebraic-graphs] OK: size (mesh xs ys) == max 1 (3 * length xs * length ys - length xs - length ys -1)
  22183. 1607.03 s [algebraic-graphs]
  22184. 1607.03 s [algebraic-graphs] ============ Graph.torus ============
  22185. 1607.03 s [algebraic-graphs] OK: torus xs [] == empty
  22186. 1607.03 s [algebraic-graphs] OK: torus [] ys == empty
  22187. 1607.03 s [algebraic-graphs] OK: torus [x] [y] == edge (x,y) (x,y)
  22188. 1607.03 s [algebraic-graphs] OK: torus xs ys == box (circuit xs) (circuit ys)
  22189. 1607.03 s [algebraic-graphs] OK: torus [1,2] "ab" == <correct result>
  22190. 1607.03 s [algebraic-graphs] OK: size (torus xs ys) == max 1 (3 * length xs * length ys)
  22191. 1607.03 s [algebraic-graphs]
  22192. 1607.03 s [algebraic-graphs] ============ Graph.deBruijn ============
  22193. 1607.03 s [algebraic-graphs] OK: deBruijn 0 xs == edge [] []
  22194. 1607.03 s [algebraic-graphs] OK: n > 0 ==> deBruijn n [] == empty
  22195. 1607.03 s [algebraic-graphs] OK: deBruijn 1 [0,1] == edges [ ([0],[0]), ([0],[1]), ([1],[0]), ([1],[1]) ]
  22196. 1607.03 s [algebraic-graphs] OK: deBruijn 2 "0" == edge "00" "00"
  22197. 1607.03 s [algebraic-graphs] OK: deBruijn 2 "01" == <correct result>
  22198. 1607.03 s [algebraic-graphs] OK: transpose (deBruijn n xs) == gmap reverse $ deBruijn n xs
  22199. 1607.03 s [algebraic-graphs] OK: vertexCount (deBruijn n xs) == (length $ nub xs)^n
  22200. 1607.03 s [algebraic-graphs] OK: n > 0 ==> edgeCount (deBruijn n xs) == (length $ nub xs)^(n + 1)
  22201. 1607.03 s [algebraic-graphs]
  22202. 1607.03 s [algebraic-graphs] ============ Graph.splitVertex ============
  22203. 1607.03 s [algebraic-graphs] OK: splitVertex x [] == removeVertex x
  22204. 1607.03 s [algebraic-graphs] OK: splitVertex x [x] == id
  22205. 1607.03 s [algebraic-graphs] OK: splitVertex x [y] == replaceVertex x y
  22206. 1607.03 s [algebraic-graphs] OK: splitVertex 1 [0, 1] $ 1 * (2 + 3) == (0 + 1) * (2 + 3)
  22207. 1607.03 s [algebraic-graphs]
  22208. 1607.03 s [algebraic-graphs] ============ Graph.bind ============
  22209. 1607.03 s [algebraic-graphs] OK: bind empty f == empty
  22210. 1607.03 s [algebraic-graphs] OK: bind (vertex x) f == f x
  22211. 1607.03 s [algebraic-graphs] OK: bind (edge x y) f == connect (f x) (f y)
  22212. 1607.03 s [algebraic-graphs] OK: bind (vertices xs) f == overlays (map f xs)
  22213. 1607.03 s [algebraic-graphs] OK: bind x (const empty) == empty
  22214. 1607.03 s [algebraic-graphs] OK: bind x vertex == x
  22215. 1607.03 s [algebraic-graphs] OK: bind (bind x f) g == bind x (\y -> bind (f y) g)
  22216. 1607.03 s [algebraic-graphs]
  22217. 1607.03 s [algebraic-graphs] ============ Graph.simplify ============
  22218. 1607.03 s [algebraic-graphs] OK: simplify == id
  22219. 1607.03 s [algebraic-graphs] OK: size (simplify x) <= size x
  22220. 1607.03 s [algebraic-graphs]
  22221. 1607.03 s [algebraic-graphs] ============ Graph.box ============
  22222. 1607.03 s [algebraic-graphs] OK: box x y ~~ box y x
  22223. 1607.03 s [algebraic-graphs] OK: box x (overlay y z) == overlay (box x y) (box x z)
  22224. 1607.03 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  22225. 1607.03 s [algebraic-graphs] OK: box x empty ~~ empty
  22226. 1607.03 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  22227. 1607.03 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  22228. 1607.03 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  22229. 1607.03 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  22230. 1607.03 s [algebraic-graphs]
  22231. 1607.03 s [algebraic-graphs] ============ Graph.sparsify ============
  22232. 1607.03 s [algebraic-graphs] OK: sort . reachable x == sort . rights . reachable (sparsify x) . Right
  22233. 1607.03 s [algebraic-graphs] OK: vertexCount (sparsify x) <= vertexCount x + size x + 1
  22234. 1607.03 s [algebraic-graphs] OK: edgeCount (sparsify x) <= 3 * size x
  22235. 1607.03 s [algebraic-graphs] OK: size (sparsify x) <= 3 * size x
  22236. 1607.03 s [algebraic-graphs]
  22237. 1607.03 s [algebraic-graphs] ============ Graph.sparsifyKL ============
  22238. 1607.03 s [algebraic-graphs] OK: sort . reachable x == sort . filter (<= n) . reachable (sparsifyKL n x)
  22239. 1607.03 s [algebraic-graphs] OK: length (vertices $ sparsifyKL n x) <= vertexCount x + size x + 1
  22240. 1607.03 s [algebraic-graphs] OK: length (edges $ sparsifyKL n x) <= 3 * size x
  22241. 1607.03 s [algebraic-graphs]
  22242. 1607.03 s [algebraic-graphs] ============ Graph.context ============
  22243. 1607.03 s [algebraic-graphs] OK: context (const False) x == Nothing
  22244. 1607.03 s [algebraic-graphs] OK: context (== 1) (edge 1 2) == Just (Context [ ] [2 ])
  22245. 1607.03 s [algebraic-graphs] OK: context (== 2) (edge 1 2) == Just (Context [1 ] [ ])
  22246. 1607.03 s [algebraic-graphs] OK: context (const True ) (edge 1 2) == Just (Context [1 ] [2 ])
  22247. 1607.03 s [algebraic-graphs] OK: context (== 4) (3 * 1 * 4 * 1 * 5) == Just (Context [3,1] [1,5])
  22248. 1607.03 s [algebraic-graphs]
  22249. 1607.03 s [algebraic-graphs] ============ Graph.buildg ============
  22250. 1607.03 s [algebraic-graphs] OK: buildg (\e _ _ _ -> e) == empty
  22251. 1607.03 s [algebraic-graphs] OK: buildg (\_ v _ _ -> v x) == vertex x
  22252. 1607.03 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
  22253. 1607.03 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
  22254. 1607.03 s [algebraic-graphs] OK: buildg (\e v o _ -> foldr o e (map v xs)) == vertices xs
  22255. 1607.03 s [algebraic-graphs] OK: buildg (\e v o c -> foldg e v o (flip c) g) == transpose g
  22256. 1607.03 s [algebraic-graphs]
  22257. 1607.03 s [algebraic-graphs] ============ Internal.List ============
  22258. 1607.03 s [algebraic-graphs] OK: pure 1 <> pure 4 == [1, 4]
  22259. 1607.03 s [algebraic-graphs]
  22260. 1607.03 s [algebraic-graphs] ============ Graph.Label ============
  22261. 1607.03 s [algebraic-graphs]
  22262. 1607.03 s [algebraic-graphs] ============ Any: instances ============
  22263. 1607.03 s [algebraic-graphs] OK: Semiring
  22264. 1607.03 s [algebraic-graphs] OK: StarSemiring
  22265. 1607.03 s [algebraic-graphs] OK: Dioid
  22266. 1607.03 s [algebraic-graphs]
  22267. 1607.03 s [algebraic-graphs] ============ Distance Int: instances ============
  22268. 1607.03 s [algebraic-graphs] OK: Semiring
  22269. 1607.03 s [algebraic-graphs] OK: StarSemiring
  22270. 1607.03 s [algebraic-graphs] OK: Dioid
  22271. 1607.03 s [algebraic-graphs]
  22272. 1607.03 s [algebraic-graphs] ============ Capacity Int: instances ============
  22273. 1607.03 s [algebraic-graphs] OK: Semiring
  22274. 1607.03 s [algebraic-graphs] OK: StarSemiring
  22275. 1607.03 s [algebraic-graphs] OK: Dioid
  22276. 1607.03 s [algebraic-graphs]
  22277. 1607.03 s [algebraic-graphs] ============ Minimum (Path Int): instances ============
  22278. 1607.03 s [algebraic-graphs] OK: LeftNearRing
  22279. 1607.03 s [algebraic-graphs]
  22280. 1607.03 s [algebraic-graphs] ============ PowerSet (Path Int): instances ============
  22281. 1607.03 s [algebraic-graphs] OK: Semiring
  22282. 1607.03 s [algebraic-graphs] OK: Dioid
  22283. 1607.03 s [algebraic-graphs]
  22284. 1607.03 s [algebraic-graphs] ============ Count Int: instances ============
  22285. 1607.03 s [algebraic-graphs] OK: Semiring
  22286. 1607.03 s [algebraic-graphs] OK: StarSemiring
  22287. 1607.03 s [algebraic-graphs]
  22288. 1607.03 s [algebraic-graphs] ============ Labelled.AdjacencyMap.consistent ============
  22289. 1607.03 s [algebraic-graphs] OK: arbitraryLabelledAdjacencyMap
  22290. 1607.03 s [algebraic-graphs] OK: empty
  22291. 1607.03 s [algebraic-graphs] OK: vertex
  22292. 1607.03 s [algebraic-graphs] OK: edge
  22293. 1607.03 s [algebraic-graphs] OK: overlay
  22294. 1607.03 s [algebraic-graphs] OK: connect
  22295. 1607.03 s [algebraic-graphs] OK: vertices
  22296. 1607.03 s [algebraic-graphs] OK: edges
  22297. 1607.03 s [algebraic-graphs] OK: overlays
  22298. 1607.03 s [algebraic-graphs] OK: fromAdjacencyMaps
  22299. 1607.03 s [algebraic-graphs] OK: removeVertex
  22300. 1607.03 s [algebraic-graphs] OK: removeEdge
  22301. 1607.03 s [algebraic-graphs] OK: replaceVertex
  22302. 1607.03 s [algebraic-graphs] OK: replaceEdge
  22303. 1607.03 s [algebraic-graphs] OK: transpose
  22304. 1607.03 s [algebraic-graphs] OK: gmap
  22305. 1607.03 s [algebraic-graphs] OK: emap
  22306. 1607.03 s [algebraic-graphs] OK: induce
  22307. 1607.03 s [algebraic-graphs] OK: closure
  22308. 1607.03 s [algebraic-graphs] OK: reflexiveClosure
  22309. 1607.03 s [algebraic-graphs] OK: symmetricClosure
  22310. 1607.03 s [algebraic-graphs] OK: transitiveClosure
  22311. 1607.03 s [algebraic-graphs]
  22312. 1607.03 s [algebraic-graphs] ============ Labelled.AdjacencyMap.empty ============
  22313. 1607.03 s [algebraic-graphs] OK: isEmpty empty == True
  22314. 1607.03 s [algebraic-graphs] OK: hasVertex x empty == False
  22315. 1607.03 s [algebraic-graphs] OK: vertexCount empty == 0
  22316. 1607.03 s [algebraic-graphs] OK: edgeCount empty == 0
  22317. 1607.03 s [algebraic-graphs]
  22318. 1607.03 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertex ============
  22319. 1607.03 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  22320. 1607.03 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  22321. 1607.03 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  22322. 1607.03 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  22323. 1607.03 s [algebraic-graphs]
  22324. 1609.74 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edge ============
  22325. 1609.74 s [algebraic-graphs] OK: edge e x y == connect e (vertex x) (vertex y)
  22326. 1609.74 s [algebraic-graphs] OK: edge zero x y == vertices [x,y]
  22327. 1609.74 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= mempty)
  22328. 1609.74 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  22329. 1609.74 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == mempty then 0 else 1
  22330. 1609.74 s [algebraic-graphs] OK: vertexCount (edge e 1 1) == 1
  22331. 1609.74 s [algebraic-graphs] OK: vertexCount (edge e 1 2) == 2
  22332. 1609.74 s [algebraic-graphs] OK: x -<e>- y == edge e x y
  22333. 1609.74 s [algebraic-graphs]
  22334. 1609.74 s [algebraic-graphs] ============ Labelled.AdjacencyMap.overlay ============
  22335. 1609.74 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  22336. 1609.74 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  22337. 1609.74 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  22338. 1609.74 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  22339. 1609.74 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  22340. 1609.74 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  22341. 1609.74 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  22342. 1609.74 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  22343. 1609.74 s [algebraic-graphs]
  22344. 1609.74 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge zero x y) == e
  22345. 1609.74 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge f x y) == e <+> f
  22346. 1609.74 s [algebraic-graphs]
  22347. 1609.74 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge one 2 3)) == e
  22348. 1609.74 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge f 2 3)) == e <.> f
  22349. 1609.74 s [algebraic-graphs]
  22350. 1609.74 s [algebraic-graphs] ============ Labelled.AdjacencyMap.connect ============
  22351. 1609.74 s [algebraic-graphs] OK: isEmpty (connect e x y) == isEmpty x && isEmpty y
  22352. 1609.74 s [algebraic-graphs] OK: hasVertex z (connect e x y) == hasVertex z x || hasVertex z y
  22353. 1609.74 s [algebraic-graphs] OK: vertexCount (connect e x y) >= vertexCount x
  22354. 1609.74 s [algebraic-graphs] OK: vertexCount (connect e x y) <= vertexCount x + vertexCount y
  22355. 1609.74 s [algebraic-graphs] OK: edgeCount (connect e x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  22356. 1609.74 s [algebraic-graphs] OK: vertexCount (connect e 1 2) == 2
  22357. 1609.74 s [algebraic-graphs] OK: edgeCount (connect e 1 2) == if e == zero then 0 else 1
  22358. 1609.74 s [algebraic-graphs]
  22359. 1609.74 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertices ============
  22360. 1609.74 s [algebraic-graphs] OK: vertices [] == empty
  22361. 1609.74 s [algebraic-graphs] OK: vertices [x] == vertex x
  22362. 1609.74 s [algebraic-graphs] OK: vertices == overlays . map vertex
  22363. 1609.74 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  22364. 1609.74 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  22365. 1609.74 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  22366. 1609.74 s [algebraic-graphs]
  22367. 1609.74 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edges ============
  22368. 1609.74 s [algebraic-graphs] OK: edges [] == empty
  22369. 1609.74 s [algebraic-graphs] OK: edges [(e,x,y)] == edge e x y
  22370. 1609.74 s [algebraic-graphs] OK: edges == overlays . map (\(e, x, y) -> edge e x y)
  22371. 1609.74 s [algebraic-graphs]
  22372. 1609.74 s [algebraic-graphs] ============ Labelled.AdjacencyMap.overlays ============
  22373. 1609.74 s [algebraic-graphs] OK: overlays [] == empty
  22374. 1609.74 s [algebraic-graphs] OK: overlays [x] == x
  22375. 1609.74 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  22376. 1609.74 s [algebraic-graphs] OK: overlays == foldr overlay empty
  22377. 1609.74 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  22378. 1609.74 s [algebraic-graphs]
  22379. 1609.74 s [algebraic-graphs] ============ Labelled.AdjacencyMap.fromAdjacencyMaps ============
  22380. 1609.74 s [algebraic-graphs] OK: fromAdjacencyMaps [] == empty
  22381. 1609.74 s [algebraic-graphs] OK: fromAdjacencyMaps [(x, Map.empty)] == vertex x
  22382. 1609.74 s [algebraic-graphs] OK: fromAdjacencyMaps [(x, Map.singleton y e)] == if e == zero then vertices [x,y] else edge e x y
  22383. 1609.74 s [algebraic-graphs] OK: overlay (fromAdjacencyMaps xs) (fromAdjacencyMaps ys) == fromAdjacencyMaps (xs ++ ys)
  22384. 1609.74 s [algebraic-graphs]
  22385. 1609.74 s [algebraic-graphs] ============ Labelled.AdjacencyMap.isSubgraphOf ============
  22386. 1609.74 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  22387. 1609.74 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  22388. 1609.74 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  22389. 1609.74 s [algebraic-graphs]
  22390. 1609.74 s [algebraic-graphs] ============ Labelled.AdjacencyMap.isEmpty ============
  22391. 1609.74 s [algebraic-graphs] OK: isEmpty empty == True
  22392. 1609.74 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  22393. 1609.74 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  22394. 1609.75 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  22395. 1609.75 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge e x y) == False
  22396. 1609.75 s [algebraic-graphs]
  22397. 1609.75 s [algebraic-graphs] ============ Labelled.AdjacencyMap.hasVertex ============
  22398. 1609.75 s [algebraic-graphs] OK: hasVertex x empty == False
  22399. 1609.75 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  22400. 1609.75 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  22401. 1609.75 s [algebraic-graphs]
  22402. 1609.75 s [algebraic-graphs] ============ Labelled.AdjacencyMap.hasEdge ============
  22403. 1609.75 s [algebraic-graphs] OK: hasEdge x y empty == False
  22404. 1609.75 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  22405. 1609.75 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= zero)
  22406. 1609.75 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  22407. 1609.75 s [algebraic-graphs] OK: hasEdge x y == not . null . filter (\(_,ex,ey) -> ex == x && ey == y) . edgeList
  22408. 1609.75 s [algebraic-graphs]
  22409. 1609.75 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edgeLabel ============
  22410. 1609.75 s [algebraic-graphs] OK: edgeLabel x y empty == zero
  22411. 1609.75 s [algebraic-graphs] OK: edgeLabel x y (vertex z) == zero
  22412. 1609.75 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  22413. 1609.75 s [algebraic-graphs] OK: edgeLabel s t (overlay x y) == edgeLabel s t x + edgeLabel s t y
  22414. 1609.75 s [algebraic-graphs]
  22415. 1609.75 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertexCount ============
  22416. 1609.75 s [algebraic-graphs] OK: vertexCount empty == 0
  22417. 1609.75 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  22418. 1609.75 s [algebraic-graphs] OK: vertexCount == length . vertexList
  22419. 1609.75 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  22420. 1609.75 s [algebraic-graphs]
  22421. 1609.75 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edgeCount ============
  22422. 1609.75 s [algebraic-graphs] OK: edgeCount empty == 0
  22423. 1609.75 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  22424. 1609.75 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == zero then 0 else 1
  22425. 1609.75 s [algebraic-graphs] OK: edgeCount == length . edgeList
  22426. 1609.75 s [algebraic-graphs]
  22427. 1609.75 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertexList ============
  22428. 1609.75 s [algebraic-graphs] OK: vertexList empty == []
  22429. 1609.75 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  22430. 1609.75 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  22431. 1609.75 s [algebraic-graphs]
  22432. 1609.75 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edgeList ============
  22433. 1609.75 s [algebraic-graphs] OK: edgeList empty == []
  22434. 1609.75 s [algebraic-graphs] OK: edgeList (vertex x) == []
  22435. 1609.75 s [algebraic-graphs] OK: edgeList (edge e x y) == if e == zero then [] else [(e,x,y)]
  22436. 1609.75 s [algebraic-graphs]
  22437. 1609.75 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertexSet ============
  22438. 1609.75 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  22439. 1609.75 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  22440. 1609.75 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  22441. 1609.75 s [algebraic-graphs]
  22442. 1609.75 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edgeSet ============
  22443. 1609.75 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  22444. 1609.75 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  22445. 1609.75 s [algebraic-graphs] OK: edgeSet (edge e x y) == if e == zero then Set.empty else Set.singleton (e,x,y)
  22446. 1609.75 s [algebraic-graphs]
  22447. 1609.75 s [algebraic-graphs] ============ Labelled.AdjacencyMap.preSet ============
  22448. 1609.75 s [algebraic-graphs] OK: preSet x empty == Set.empty
  22449. 1609.75 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  22450. 1609.75 s [algebraic-graphs] OK: preSet 1 (edge e 1 2) == Set.empty
  22451. 1609.75 s [algebraic-graphs] OK: preSet y (edge e x y) == if e == zero then Set.empty else Set.fromList [x]
  22452. 1609.75 s [algebraic-graphs]
  22453. 1609.75 s [algebraic-graphs] ============ Labelled.AdjacencyMap.postSet ============
  22454. 1609.75 s [algebraic-graphs] OK: postSet x empty == Set.empty
  22455. 1609.75 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  22456. 1609.75 s [algebraic-graphs] OK: postSet x (edge e x y) == if e == zero then Set.empty else Set.fromList [y]
  22457. 1609.75 s [algebraic-graphs] OK: postSet 2 (edge e 1 2) == Set.empty
  22458. 1609.75 s [algebraic-graphs]
  22459. 1609.75 s [algebraic-graphs] ============ Labelled.AdjacencyMap.skeleton ============
  22460. 1609.75 s [algebraic-graphs] OK: hasEdge x y == hasEdge x y . skeleton
  22461. 1609.75 s [algebraic-graphs]
  22462. 1609.75 s [algebraic-graphs] ============ Labelled.AdjacencyMap.removeVertex ============
  22463. 1609.75 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  22464. 1609.75 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  22465. 1609.75 s [algebraic-graphs] OK: removeVertex x (edge e x x) == empty
  22466. 1609.75 s [algebraic-graphs] OK: removeVertex 1 (edge e 1 2) == vertex 2
  22467. 1609.75 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  22468. 1609.75 s [algebraic-graphs]
  22469. 1609.75 s [algebraic-graphs] ============ Labelled.AdjacencyMap.removeEdge ============
  22470. 1609.75 s [algebraic-graphs] OK: removeEdge x y (edge e x y) == vertices [x,y]
  22471. 1609.75 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  22472. 1609.75 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  22473. 1609.75 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  22474. 1609.75 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  22475. 1609.75 s [algebraic-graphs]
  22476. 1609.75 s [algebraic-graphs] ============ Labelled.AdjacencyMap.replaceVertex ============
  22477. 1609.75 s [algebraic-graphs] OK: replaceVertex x x == id
  22478. 1609.75 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  22479. 1609.75 s [algebraic-graphs] OK: replaceVertex x y == gmap (\v -> if v == x then y else v)
  22480. 1609.75 s [algebraic-graphs]
  22481. 1609.75 s [algebraic-graphs] ============ Labelled.AdjacencyMap.replaceEdge ============
  22482. 1609.75 s [algebraic-graphs] OK: replaceEdge e x y z == overlay (removeEdge x y z) (edge e x y)
  22483. 1609.75 s [algebraic-graphs] OK: replaceEdge e x y (edge f x y) == edge e x y
  22484. 1609.75 s [algebraic-graphs] OK: edgeLabel x y (replaceEdge e x y z) == e
  22485. 1609.75 s [algebraic-graphs]
  22486. 1609.75 s [algebraic-graphs] ============ Labelled.AdjacencyMap.transpose ============
  22487. 1609.75 s [algebraic-graphs] OK: transpose empty == empty
  22488. 1609.75 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  22489. 1609.75 s [algebraic-graphs] OK: transpose (edge e x y) == edge e y x
  22490. 1609.75 s [algebraic-graphs] OK: transpose . transpose == id
  22491. 1609.75 s [algebraic-graphs]
  22492. 1609.75 s [algebraic-graphs] ============ Labelled.AdjacencyMap.gmap ============
  22493. 1609.75 s [algebraic-graphs] OK: gmap f empty == empty
  22494. 1609.75 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  22495. 1609.75 s [algebraic-graphs] OK: gmap f (edge e x y) == edge e (f x) (f y)
  22496. 1609.75 s [algebraic-graphs] OK: gmap id == id
  22497. 1609.75 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  22498. 1609.75 s [algebraic-graphs]
  22499. 1609.75 s [algebraic-graphs] ============ Labelled.AdjacencyMap.emap ============
  22500. 1609.75 s [algebraic-graphs] OK: emap h empty == empty
  22501. 1609.75 s [algebraic-graphs] OK: emap h (vertex x) == vertex x
  22502. 1609.75 s [algebraic-graphs] OK: emap h (edge e x y) == edge (h e) x y
  22503. 1609.75 s [algebraic-graphs] OK: emap h (overlay x y) == overlay (emap h x) (emap h y)
  22504. 1609.75 s [algebraic-graphs] OK: emap h (connect e x y) == connect (h e) (emap h x) (emap h y)
  22505. 1609.75 s [algebraic-graphs] OK: emap id == id
  22506. 1609.75 s [algebraic-graphs] OK: emap g . emap h == emap (g . h)
  22507. 1609.75 s [algebraic-graphs]
  22508. 1609.75 s [algebraic-graphs] ============ Labelled.AdjacencyMap.induce ============
  22509. 1609.75 s [algebraic-graphs] OK: induce (const True ) x == x
  22510. 1609.75 s [algebraic-graphs] OK: induce (const False) x == empty
  22511. 1609.75 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  22512. 1609.75 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  22513. 1609.75 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  22514. 1609.75 s [algebraic-graphs]
  22515. 1609.75 s [algebraic-graphs] ============ Labelled.AdjacencyMap.induceJust ============
  22516. 1611.04 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  22517. 1611.04 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  22518. 1611.04 s [algebraic-graphs] OK: induceJust . gmap Just == id
  22519. 1611.04 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  22520. 1611.04 s [algebraic-graphs]
  22521. 1611.04 s [algebraic-graphs] ============ Labelled.AdjacencyMap.closure ============
  22522. 1611.04 s [algebraic-graphs] OK: closure empty == empty
  22523. 1611.04 s [algebraic-graphs] OK: closure (vertex x) == edge one x x
  22524. 1611.04 s [algebraic-graphs] OK: closure (edge e x x) == edge one x x
  22525. 1611.04 s [algebraic-graphs] OK: closure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  22526. 1611.04 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  22527. 1611.04 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  22528. 1611.04 s [algebraic-graphs] OK: closure . closure == closure
  22529. 1611.04 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  22530. 1611.04 s [algebraic-graphs]
  22531. 1611.04 s [algebraic-graphs] ============ Labelled.AdjacencyMap.reflexiveClosure ============
  22532. 1611.04 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  22533. 1611.04 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge one x x
  22534. 1611.04 s [algebraic-graphs] OK: reflexiveClosure (edge e x x) == edge one x x
  22535. 1611.04 s [algebraic-graphs] OK: reflexiveClosure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  22536. 1611.04 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  22537. 1611.04 s [algebraic-graphs]
  22538. 1611.04 s [algebraic-graphs] ============ Labelled.AdjacencyMap.symmetricClosure ============
  22539. 1611.04 s [algebraic-graphs] OK: symmetricClosure empty == empty
  22540. 1611.04 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  22541. 1611.04 s [algebraic-graphs] OK: symmetricClosure (edge e x y) == edges [(e,x,y), (e,y,x)]
  22542. 1611.04 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  22543. 1611.04 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  22544. 1611.04 s [algebraic-graphs]
  22545. 1611.04 s [algebraic-graphs] ============ Labelled.AdjacencyMap.transitiveClosure ============
  22546. 1611.04 s [algebraic-graphs] OK: transitiveClosure empty == empty
  22547. 1611.04 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  22548. 1611.04 s [algebraic-graphs] OK: transitiveClosure (edge e x y) == edge e x y
  22549. 1611.04 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  22550. 1611.04 s [algebraic-graphs]
  22551. 1611.04 s [algebraic-graphs] ============ Labelled.Graph.empty ============
  22552. 1611.04 s [algebraic-graphs] OK: isEmpty empty == True
  22553. 1611.04 s [algebraic-graphs] OK: hasVertex x empty == False
  22554. 1611.04 s [algebraic-graphs] OK: vertexCount empty == 0
  22555. 1611.04 s [algebraic-graphs] OK: edgeCount empty == 0
  22556. 1611.04 s [algebraic-graphs]
  22557. 1611.04 s [algebraic-graphs] ============ Labelled.Graph.vertex ============
  22558. 1611.04 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  22559. 1611.04 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  22560. 1611.04 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  22561. 1611.04 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  22562. 1611.04 s [algebraic-graphs]
  22563. 1611.04 s [algebraic-graphs] ============ Labelled.Graph.edge ============
  22564. 1611.04 s [algebraic-graphs] OK: edge e x y == connect e (vertex x) (vertex y)
  22565. 1611.04 s [algebraic-graphs] OK: edge zero x y == vertices [x,y]
  22566. 1611.04 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= mempty)
  22567. 1611.04 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  22568. 1611.04 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == mempty then 0 else 1
  22569. 1611.04 s [algebraic-graphs] OK: vertexCount (edge e 1 1) == 1
  22570. 1611.04 s [algebraic-graphs] OK: vertexCount (edge e 1 2) == 2
  22571. 1611.04 s [algebraic-graphs] OK: x -<e>- y == edge e x y
  22572. 1611.04 s [algebraic-graphs]
  22573. 1611.04 s [algebraic-graphs] ============ Labelled.Graph.overlay ============
  22574. 1611.04 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  22575. 1611.04 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  22576. 1611.04 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  22577. 1611.04 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  22578. 1611.04 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  22579. 1611.04 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  22580. 1611.04 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  22581. 1611.04 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  22582. 1611.04 s [algebraic-graphs]
  22583. 1611.04 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge zero x y) == e
  22584. 1611.04 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge f x y) == e <+> f
  22585. 1611.04 s [algebraic-graphs]
  22586. 1611.04 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge one 2 3)) == e
  22587. 1611.04 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge f 2 3)) == e <.> f
  22588. 1611.04 s [algebraic-graphs]
  22589. 1611.04 s [algebraic-graphs] ============ Labelled.Graph.connect ============
  22590. 1611.04 s [algebraic-graphs] OK: isEmpty (connect e x y) == isEmpty x && isEmpty y
  22591. 1611.04 s [algebraic-graphs] OK: hasVertex z (connect e x y) == hasVertex z x || hasVertex z y
  22592. 1611.04 s [algebraic-graphs] OK: vertexCount (connect e x y) >= vertexCount x
  22593. 1611.04 s [algebraic-graphs] OK: vertexCount (connect e x y) <= vertexCount x + vertexCount y
  22594. 1611.04 s [algebraic-graphs] OK: edgeCount (connect e x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  22595. 1611.04 s [algebraic-graphs] OK: vertexCount (connect e 1 2) == 2
  22596. 1611.04 s [algebraic-graphs] OK: edgeCount (connect e 1 2) == if e == zero then 0 else 1
  22597. 1611.04 s [algebraic-graphs]
  22598. 1611.04 s [algebraic-graphs] ============ Labelled.Graph.vertices ============
  22599. 1611.04 s [algebraic-graphs] OK: vertices [] == empty
  22600. 1611.04 s [algebraic-graphs] OK: vertices [x] == vertex x
  22601. 1611.04 s [algebraic-graphs] OK: vertices == overlays . map vertex
  22602. 1611.04 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  22603. 1611.04 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  22604. 1611.04 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  22605. 1611.04 s [algebraic-graphs]
  22606. 1611.04 s [algebraic-graphs] ============ Labelled.Graph.edges ============
  22607. 1611.04 s [algebraic-graphs] OK: edges [] == empty
  22608. 1611.04 s [algebraic-graphs] OK: edges [(e,x,y)] == edge e x y
  22609. 1611.04 s [algebraic-graphs] OK: edges == overlays . map (\(e, x, y) -> edge e x y)
  22610. 1611.04 s [algebraic-graphs]
  22611. 1611.04 s [algebraic-graphs] ============ Labelled.Graph.overlays ============
  22612. 1611.04 s [algebraic-graphs] OK: overlays [] == empty
  22613. 1611.04 s [algebraic-graphs] OK: overlays [x] == x
  22614. 1611.04 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  22615. 1611.04 s [algebraic-graphs] OK: overlays == foldr overlay empty
  22616. 1611.04 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  22617. 1611.04 s [algebraic-graphs]
  22618. 1611.04 s [algebraic-graphs] ============ Labelled.Graph.foldg ============
  22619. 1611.04 s [algebraic-graphs] OK: foldg empty vertex connect == id
  22620. 1611.04 s [algebraic-graphs] OK: foldg empty vertex (fmap flip connect) == transpose
  22621. 1611.04 s [algebraic-graphs] OK: foldg 1 (const 1) (const (+)) == size
  22622. 1611.04 s [algebraic-graphs] OK: foldg True (const False) (const (&&)) == isEmpty
  22623. 1611.04 s [algebraic-graphs] OK: foldg False (== x) (const (||)) == hasVertex x
  22624. 1611.04 s [algebraic-graphs] OK: foldg Set.empty Set.singleton (const Set.union) == vertexSet
  22625. 1611.04 s [algebraic-graphs]
  22626. 1611.04 s [algebraic-graphs] ============ Labelled.Graph.buildg ============
  22627. 1611.04 s [algebraic-graphs] OK: buildg (\e _ _ -> e) == empty
  22628. 1611.04 s [algebraic-graphs] OK: buildg (\_ v _ -> v x) == vertex x
  22629. 1611.04 s [algebraic-graphs] OK: buildg (\e v c -> c l (foldg e v c x) (foldg e v c y)) == connect l x y
  22630. 1611.04 s [algebraic-graphs] OK: buildg (\e v c -> foldr (c zero) e (map v xs)) == vertices xs
  22631. 1611.04 s [algebraic-graphs] OK: buildg (\e v c -> foldg e v (flip c) g) == transpose g
  22632. 1611.04 s [algebraic-graphs]
  22633. 1611.04 s [algebraic-graphs] ============ Labelled.Graph.isSubgraphOf ============
  22634. 1611.04 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  22635. 1611.04 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  22636. 1611.04 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  22637. 1611.04 s [algebraic-graphs]
  22638. 1611.04 s [algebraic-graphs] ============ Labelled.Graph.isEmpty ============
  22639. 1611.04 s [algebraic-graphs] OK: isEmpty empty == True
  22640. 1611.04 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  22641. 1611.04 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  22642. 1611.04 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  22643. 1611.04 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge e x y) == False
  22644. 1611.04 s [algebraic-graphs]
  22645. 1611.04 s [algebraic-graphs] ============ Labelled.Graph.size ============
  22646. 1611.04 s [algebraic-graphs] OK: size empty == 1
  22647. 1611.04 s [algebraic-graphs] OK: size (vertex x) == 1
  22648. 1611.04 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  22649. 1611.04 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  22650. 1611.04 s [algebraic-graphs] OK: size x >= 1
  22651. 1611.04 s [algebraic-graphs] OK: size x >= vertexCount x
  22652. 1611.04 s [algebraic-graphs]
  22653. 1611.04 s [algebraic-graphs] ============ Labelled.Graph.hasVertex ============
  22654. 1611.04 s [algebraic-graphs] OK: hasVertex x empty == False
  22655. 1611.04 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  22656. 1611.04 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  22657. 1611.04 s [algebraic-graphs]
  22658. 1611.04 s [algebraic-graphs] ============ Labelled.Graph.hasEdge ============
  22659. 1611.04 s [algebraic-graphs] OK: hasEdge x y empty == False
  22660. 1611.04 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  22661. 1611.04 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= zero)
  22662. 1611.04 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  22663. 1611.04 s [algebraic-graphs] OK: hasEdge x y == not . null . filter (\(_,ex,ey) -> ex == x && ey == y) . edgeList
  22664. 1611.04 s [algebraic-graphs]
  22665. 1611.04 s [algebraic-graphs] ============ Labelled.Graph.edgeLabel ============
  22666. 1611.04 s [algebraic-graphs] OK: edgeLabel x y empty == zero
  22667. 1611.04 s [algebraic-graphs] OK: edgeLabel x y (vertex z) == zero
  22668. 1611.04 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  22669. 1611.04 s [algebraic-graphs] OK: edgeLabel s t (overlay x y) == edgeLabel s t x + edgeLabel s t y
  22670. 1611.04 s [algebraic-graphs]
  22671. 1611.04 s [algebraic-graphs] ============ Labelled.Graph.vertexCount ============
  22672. 1611.04 s [algebraic-graphs] OK: vertexCount empty == 0
  22673. 1611.04 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  22674. 1611.04 s [algebraic-graphs] OK: vertexCount == length . vertexList
  22675. 1611.04 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  22676. 1611.04 s [algebraic-graphs]
  22677. 1611.04 s [algebraic-graphs] ============ Labelled.Graph.edgeCount ============
  22678. 1611.04 s [algebraic-graphs] OK: edgeCount empty == 0
  22679. 1611.04 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  22680. 1611.04 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == zero then 0 else 1
  22681. 1611.04 s [algebraic-graphs] OK: edgeCount == length . edgeList
  22682. 1611.04 s [algebraic-graphs]
  22683. 1611.04 s [algebraic-graphs] ============ Labelled.Graph.vertexList ============
  22684. 1611.04 s [algebraic-graphs] OK: vertexList empty == []
  22685. 1611.04 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  22686. 1611.04 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  22687. 1611.04 s [algebraic-graphs]
  22688. 1611.04 s [algebraic-graphs] ============ Labelled.Graph.edgeList ============
  22689. 1611.04 s [algebraic-graphs] OK: edgeList empty == []
  22690. 1611.04 s [algebraic-graphs] OK: edgeList (vertex x) == []
  22691. 1611.04 s [algebraic-graphs] OK: edgeList (edge e x y) == if e == zero then [] else [(e,x,y)]
  22692. 1611.04 s [algebraic-graphs]
  22693. 1611.04 s [algebraic-graphs] ============ Labelled.Graph.vertexSet ============
  22694. 1611.04 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  22695. 1611.04 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  22696. 1611.04 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  22697. 1611.04 s [algebraic-graphs]
  22698. 1611.04 s [algebraic-graphs] ============ Labelled.Graph.edgeSet ============
  22699. 1611.04 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  22700. 1611.04 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  22701. 1611.04 s [algebraic-graphs] OK: edgeSet (edge e x y) == if e == zero then Set.empty else Set.singleton (e,x,y)
  22702. 1611.04 s [algebraic-graphs]
  22703. 1611.04 s [algebraic-graphs] ============ Labelled.Graph.preSet ============
  22704. 1611.04 s [algebraic-graphs] OK: preSet x empty == Set.empty
  22705. 1611.04 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  22706. 1614.31 s [algebraic-graphs] OK: preSet 1 (edge e 1 2) == Set.empty
  22707. 1614.37 s [algebraic-graphs] OK: preSet y (edge e x y) == if e == zero then Set.empty else Set.fromList [x]
  22708. 1614.37 s [algebraic-graphs]
  22709. 1614.37 s [algebraic-graphs] ============ Labelled.Graph.postSet ============
  22710. 1614.37 s [algebraic-graphs] OK: postSet x empty == Set.empty
  22711. 1614.37 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  22712. 1614.37 s [algebraic-graphs] OK: postSet x (edge e x y) == if e == zero then Set.empty else Set.fromList [y]
  22713. 1614.37 s [algebraic-graphs] OK: postSet 2 (edge e 1 2) == Set.empty
  22714. 1614.37 s [algebraic-graphs]
  22715. 1614.37 s [algebraic-graphs] ============ Labelled.Graph.removeVertex ============
  22716. 1614.37 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  22717. 1614.37 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  22718. 1614.37 s [algebraic-graphs] OK: removeVertex x (edge e x x) == empty
  22719. 1614.37 s [algebraic-graphs] OK: removeVertex 1 (edge e 1 2) == vertex 2
  22720. 1614.37 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  22721. 1614.37 s [algebraic-graphs]
  22722. 1614.37 s [algebraic-graphs] ============ Labelled.Graph.removeEdge ============
  22723. 1614.37 s [algebraic-graphs] OK: removeEdge x y (edge e x y) == vertices [x,y]
  22724. 1614.37 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  22725. 1614.37 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  22726. 1614.37 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  22727. 1614.37 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  22728. 1614.37 s [algebraic-graphs]
  22729. 1614.37 s [algebraic-graphs] ============ Labelled.Graph.replaceVertex ============
  22730. 1614.37 s [algebraic-graphs] OK: replaceVertex x x == id
  22731. 1614.37 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  22732. 1614.37 s [algebraic-graphs] OK: replaceVertex x y == fmap (\v -> if v == x then y else v)
  22733. 1614.37 s [algebraic-graphs]
  22734. 1614.37 s [algebraic-graphs] ============ Labelled.Graph.replaceEdge ============
  22735. 1614.37 s [algebraic-graphs] OK: replaceEdge e x y z == overlay (removeEdge x y z) (edge e x y)
  22736. 1614.37 s [algebraic-graphs] OK: replaceEdge e x y (edge f x y) == edge e x y
  22737. 1614.37 s [algebraic-graphs] OK: edgeLabel x y (replaceEdge e x y z) == e
  22738. 1614.37 s [algebraic-graphs]
  22739. 1614.37 s [algebraic-graphs] ============ Labelled.Graph.transpose ============
  22740. 1614.37 s [algebraic-graphs] OK: transpose empty == empty
  22741. 1614.37 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  22742. 1614.37 s [algebraic-graphs] OK: transpose (edge e x y) == edge e y x
  22743. 1614.37 s [algebraic-graphs] OK: transpose . transpose == id
  22744. 1614.37 s [algebraic-graphs]
  22745. 1614.37 s [algebraic-graphs] ============ Labelled.Graph.fmap ============
  22746. 1614.37 s [algebraic-graphs] OK: fmap f empty == empty
  22747. 1614.37 s [algebraic-graphs] OK: fmap f (vertex x) == vertex (f x)
  22748. 1614.37 s [algebraic-graphs] OK: fmap f (edge e x y) == edge e (f x) (f y)
  22749. 1614.37 s [algebraic-graphs] OK: fmap id == id
  22750. 1614.37 s [algebraic-graphs] OK: fmap f . fmap g == fmap (f . g)
  22751. 1614.37 s [algebraic-graphs]
  22752. 1614.37 s [algebraic-graphs] ============ Labelled.Graph.emap ============
  22753. 1614.37 s [algebraic-graphs] OK: emap h empty == empty
  22754. 1614.37 s [algebraic-graphs] OK: emap h (vertex x) == vertex x
  22755. 1614.37 s [algebraic-graphs] OK: emap h (edge e x y) == edge (h e) x y
  22756. 1614.37 s [algebraic-graphs] OK: emap h (overlay x y) == overlay (emap h x) (emap h y)
  22757. 1614.37 s [algebraic-graphs] OK: emap h (connect e x y) == connect (h e) (emap h x) (emap h y)
  22758. 1614.37 s [algebraic-graphs] OK: emap id == id
  22759. 1614.37 s [algebraic-graphs] OK: emap g . emap h == emap (g . h)
  22760. 1614.37 s [algebraic-graphs]
  22761. 1614.37 s [algebraic-graphs] ============ Labelled.Graph.induce ============
  22762. 1614.37 s [algebraic-graphs] OK: induce (const True ) x == x
  22763. 1614.37 s [algebraic-graphs] OK: induce (const False) x == empty
  22764. 1614.37 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  22765. 1614.37 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  22766. 1614.37 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  22767. 1614.37 s [algebraic-graphs]
  22768. 1614.37 s [algebraic-graphs] ============ Labelled.Graph.induceJust ============
  22769. 1614.37 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  22770. 1614.37 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  22771. 1614.37 s [algebraic-graphs] OK: induceJust . gmap Just == id
  22772. 1614.37 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  22773. 1614.37 s [algebraic-graphs]
  22774. 1614.37 s [algebraic-graphs] ============ Labelled.Graph.closure ============
  22775. 1614.37 s [algebraic-graphs] OK: closure empty == empty
  22776. 1614.37 s [algebraic-graphs] OK: closure (vertex x) == edge one x x
  22777. 1614.37 s [algebraic-graphs] OK: closure (edge e x x) == edge one x x
  22778. 1614.37 s [algebraic-graphs] OK: closure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  22779. 1614.37 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  22780. 1614.37 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  22781. 1614.37 s [algebraic-graphs] OK: closure . closure == closure
  22782. 1614.37 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  22783. 1614.37 s [algebraic-graphs]
  22784. 1614.37 s [algebraic-graphs] ============ Labelled.Graph.reflexiveClosure ============
  22785. 1614.37 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  22786. 1614.37 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge one x x
  22787. 1614.37 s [algebraic-graphs] OK: reflexiveClosure (edge e x x) == edge one x x
  22788. 1614.37 s [algebraic-graphs] OK: reflexiveClosure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  22789. 1614.37 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  22790. 1614.37 s [algebraic-graphs]
  22791. 1614.37 s [algebraic-graphs] ============ Labelled.Graph.symmetricClosure ============
  22792. 1614.37 s [algebraic-graphs] OK: symmetricClosure empty == empty
  22793. 1614.37 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  22794. 1614.37 s [algebraic-graphs] OK: symmetricClosure (edge e x y) == edges [(e,x,y), (e,y,x)]
  22795. 1614.37 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  22796. 1614.37 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  22797. 1614.37 s [algebraic-graphs]
  22798. 1614.38 s [algebraic-graphs] ============ Labelled.Graph.transitiveClosure ============
  22799. 1614.38 s [algebraic-graphs] OK: transitiveClosure empty == empty
  22800. 1614.38 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  22801. 1614.38 s [algebraic-graphs] OK: transitiveClosure (edge e x y) == edge e x y
  22802. 1614.38 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  22803. 1614.38 s [algebraic-graphs]
  22804. 1614.38 s [algebraic-graphs] ============ Labelled.Graph.context ============
  22805. 1614.38 s [algebraic-graphs] OK: context (const False) x == Nothing
  22806. 1614.38 s [algebraic-graphs] OK: context (== 1) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [] [(e,2)])
  22807. 1614.38 s [algebraic-graphs] OK: context (== 2) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [(e,1)] [] )
  22808. 1614.38 s [algebraic-graphs] OK: context (const True ) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [(e,1)] [(e,2)])
  22809. 1614.38 s [algebraic-graphs] OK: context (== 4) (3 * 1 * 4 * 1 * 5) == Just (Context [(one,3), (one,1)] [(one,1), (one,5)])
  22810. 1614.38 s [algebraic-graphs]
  22811. 1614.38 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap ============
  22812. 1614.38 s [algebraic-graphs] OK: Axioms of non-empty graphs
  22813. 1614.38 s [algebraic-graphs] OK: Theorems of non-empty graphs
  22814. 1614.38 s [algebraic-graphs]
  22815. 1614.38 s [algebraic-graphs] ============ Ord (NonEmpty.AdjacencyMap a) ============
  22816. 1614.38 s [algebraic-graphs] OK: vertex 1 < vertex 2
  22817. 1614.38 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  22818. 1614.38 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  22819. 1614.38 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  22820. 1614.38 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  22821. 1614.38 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  22822. 1614.38 s [algebraic-graphs] OK: x <= x + y
  22823. 1614.38 s [algebraic-graphs] OK: x + y <= x * y
  22824. 1614.38 s [algebraic-graphs]
  22825. 1614.38 s [algebraic-graphs] ============ Show (NonEmpty.AdjacencyMap a) ============
  22826. 1614.38 s [algebraic-graphs] OK: show (1 :: AdjacencyMap Int) == "vertex 1"
  22827. 1614.38 s [algebraic-graphs] OK: show (1 + 2 :: AdjacencyMap Int) == "vertices1 [1,2]"
  22828. 1614.38 s [algebraic-graphs] OK: show (1 * 2 :: AdjacencyMap Int) == "edge 1 2"
  22829. 1614.38 s [algebraic-graphs] OK: show (1 * 2 * 3 :: AdjacencyMap Int) == "edges1 [(1,2),(1,3),(2,3)]"
  22830. 1614.38 s [algebraic-graphs] OK: show (1 * 2 + 3 :: AdjacencyMap Int) == "overlay (vertex 3) (edge 1 2)"
  22831. 1614.38 s [algebraic-graphs] OK: show (vertex (-1) :: AdjacencyMap Int) == "vertex (-1)"
  22832. 1614.38 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) :: AdjacencyMap Int) == "vertices1 [-2,-1]"
  22833. 1614.38 s [algebraic-graphs] OK: show (vertex (-1) * vertex (-2) :: AdjacencyMap Int) == "edge (-1) (-2)"
  22834. 1614.38 s [algebraic-graphs] OK: show (vertex (-1) * vertex (-2) * vertex (-3) :: AdjacencyMap Int) == "edges1 [(-2,-3),(-1,-3),(-1,-2)]"
  22835. 1614.38 s [algebraic-graphs] OK: show (vertex (-1) * vertex (-2) + vertex (-3) :: AdjacencyMap Int) == "overlay (vertex (-3)) (edge (-1) (-2))"
  22836. 1614.38 s [algebraic-graphs]
  22837. 1614.38 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.toNonEmpty ============
  22838. 1614.38 s [algebraic-graphs] OK: toNonEmpty empty == Nothing
  22839. 1614.38 s [algebraic-graphs] OK: toNonEmpty . fromNonEmpty == Just
  22840. 1614.38 s [algebraic-graphs]
  22841. 1614.38 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.fromNonEmpty ============
  22842. 1614.38 s [algebraic-graphs] OK: isEmpty . fromNonEmpty == const False
  22843. 1614.38 s [algebraic-graphs]
  22844. 1614.38 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertex ============
  22845. 1614.38 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  22846. 1614.38 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  22847. 1614.38 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  22848. 1614.38 s [algebraic-graphs]
  22849. 1614.38 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edge ============
  22850. 1614.38 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  22851. 1614.38 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  22852. 1614.38 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  22853. 1614.38 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  22854. 1614.38 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  22855. 1614.38 s [algebraic-graphs]
  22856. 1614.38 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.overlay ============
  22857. 1614.38 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  22858. 1614.38 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  22859. 1614.38 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  22860. 1614.38 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  22861. 1614.38 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  22862. 1614.38 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  22863. 1614.38 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  22864. 1614.38 s [algebraic-graphs]
  22865. 1614.38 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.connect ============
  22866. 1614.38 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  22867. 1614.38 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  22868. 1614.38 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  22869. 1614.38 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  22870. 1614.38 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  22871. 1614.38 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  22872. 1614.38 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  22873. 1614.38 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  22874. 1614.38 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  22875. 1614.38 s [algebraic-graphs]
  22876. 1614.38 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertices1 ============
  22877. 1614.38 s [algebraic-graphs] OK: vertices1 [x] == vertex x
  22878. 1614.38 s [algebraic-graphs] OK: hasVertex x . vertices1 == elem x
  22879. 1614.38 s [algebraic-graphs] OK: vertexCount . vertices1 == length . nub
  22880. 1614.38 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  22881. 1614.38 s [algebraic-graphs]
  22882. 1614.38 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edges1 ============
  22883. 1614.38 s [algebraic-graphs] OK: edges1 [(x,y)] == edge x y
  22884. 1614.38 s [algebraic-graphs] OK: edges1 == overlays1 . fmap (uncurry edge)
  22885. 1614.38 s [algebraic-graphs] OK: edgeCount . edges1 == length . nub
  22886. 1614.38 s [algebraic-graphs]
  22887. 1617.76 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.overlays1 ============
  22888. 1617.76 s [algebraic-graphs] OK: overlays1 [x] == x
  22889. 1617.76 s [algebraic-graphs] OK: overlays1 [x,y] == overlay x y
  22890. 1617.76 s [algebraic-graphs]
  22891. 1617.76 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.connects1 ============
  22892. 1617.76 s [algebraic-graphs] OK: connects1 [x] == x
  22893. 1617.76 s [algebraic-graphs] OK: connects1 [x,y] == connect x y
  22894. 1617.76 s [algebraic-graphs]
  22895. 1617.76 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.isSubgraphOf ============
  22896. 1617.76 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  22897. 1617.76 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  22898. 1617.76 s [algebraic-graphs] OK: isSubgraphOf (path1 xs) (circuit1 xs) == True
  22899. 1617.76 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  22900. 1617.76 s [algebraic-graphs]
  22901. 1617.76 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.hasVertex ============
  22902. 1617.76 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  22903. 1617.77 s [algebraic-graphs]
  22904. 1617.77 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.hasEdge ============
  22905. 1617.77 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  22906. 1617.77 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  22907. 1617.77 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  22908. 1617.77 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  22909. 1617.77 s [algebraic-graphs]
  22910. 1617.77 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexCount ============
  22911. 1617.77 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  22912. 1617.77 s [algebraic-graphs] OK: vertexCount x >= 1
  22913. 1617.77 s [algebraic-graphs] OK: vertexCount == length . vertexList1
  22914. 1617.77 s [algebraic-graphs]
  22915. 1617.77 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeCount ============
  22916. 1617.77 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  22917. 1617.77 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  22918. 1617.77 s [algebraic-graphs] OK: edgeCount == length . edgeList
  22919. 1617.77 s [algebraic-graphs]
  22920. 1617.77 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexList1 ============
  22921. 1617.77 s [algebraic-graphs] OK: vertexList1 (vertex x) == [x]
  22922. 1617.77 s [algebraic-graphs] OK: vertexList1 . vertices1 == nub . sort
  22923. 1617.77 s [algebraic-graphs]
  22924. 1617.77 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeList ============
  22925. 1617.77 s [algebraic-graphs] OK: edgeList (vertex x) == []
  22926. 1617.77 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  22927. 1617.77 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  22928. 1617.77 s [algebraic-graphs] OK: edgeList . edges1 == nub . sort . toList
  22929. 1617.77 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  22930. 1617.77 s [algebraic-graphs]
  22931. 1617.77 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexSet ============
  22932. 1617.77 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  22933. 1617.77 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  22934. 1617.77 s [algebraic-graphs] OK: vertexSet . clique1 == Set.fromList . toList
  22935. 1617.77 s [algebraic-graphs]
  22936. 1617.77 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeSet ============
  22937. 1617.77 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  22938. 1617.77 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  22939. 1617.77 s [algebraic-graphs] OK: edgeSet . edges1 == Set.fromList . toList
  22940. 1617.77 s [algebraic-graphs]
  22941. 1617.77 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.preSet ============
  22942. 1617.77 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  22943. 1617.77 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  22944. 1617.77 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  22945. 1617.77 s [algebraic-graphs]
  22946. 1617.77 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.postSet ============
  22947. 1617.77 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  22948. 1617.77 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  22949. 1617.77 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  22950. 1617.77 s [algebraic-graphs]
  22951. 1617.77 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.path1 ============
  22952. 1617.77 s [algebraic-graphs] OK: path1 [x] == vertex x
  22953. 1617.77 s [algebraic-graphs] OK: path1 [x,y] == edge x y
  22954. 1617.77 s [algebraic-graphs] OK: path1 . reverse == transpose . path1
  22955. 1617.77 s [algebraic-graphs]
  22956. 1617.77 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.circuit1 ============
  22957. 1617.77 s [algebraic-graphs] OK: circuit1 [x] == edge x x
  22958. 1617.77 s [algebraic-graphs] OK: circuit1 [x,y] == edges1 [(x,y), (y,x)]
  22959. 1617.77 s [algebraic-graphs] OK: circuit1 . reverse == transpose . circuit1
  22960. 1617.77 s [algebraic-graphs]
  22961. 1617.77 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.clique1 ============
  22962. 1617.77 s [algebraic-graphs] OK: clique1 [x] == vertex x
  22963. 1617.77 s [algebraic-graphs] OK: clique1 [x,y] == edge x y
  22964. 1617.77 s [algebraic-graphs] OK: clique1 [x,y,z] == edges1 [(x,y), (x,z), (y,z)]
  22965. 1617.77 s [algebraic-graphs] OK: clique1 (xs <> ys) == connect (clique1 xs) (clique1 ys)
  22966. 1617.77 s [algebraic-graphs] OK: clique1 . reverse == transpose . clique1
  22967. 1617.77 s [algebraic-graphs]
  22968. 1617.77 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.biclique1 ============
  22969. 1617.77 s [algebraic-graphs] OK: biclique1 [x1,x2] [y1,y2] == edges1 [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  22970. 1617.77 s [algebraic-graphs] OK: biclique1 xs ys == connect (vertices1 xs) (vertices1 ys)
  22971. 1617.77 s [algebraic-graphs]
  22972. 1617.77 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.star ============
  22973. 1617.77 s [algebraic-graphs] OK: star x [] == vertex x
  22974. 1617.77 s [algebraic-graphs] OK: star x [y] == edge x y
  22975. 1617.77 s [algebraic-graphs] OK: star x [y,z] == edges1 [(x,y), (x,z)]
  22976. 1617.77 s [algebraic-graphs]
  22977. 1617.77 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.stars1 ============
  22978. 1617.77 s [algebraic-graphs] OK: stars1 [(x, [] )] == vertex x
  22979. 1617.77 s [algebraic-graphs] OK: stars1 [(x, [y])] == edge x y
  22980. 1617.77 s [algebraic-graphs] OK: stars1 [(x, ys )] == star x ys
  22981. 1617.77 s [algebraic-graphs] OK: stars1 == overlays1 . fmap (uncurry star)
  22982. 1617.77 s [algebraic-graphs] OK: overlay (stars1 xs) (stars1 ys) == stars1 (xs <> ys)
  22983. 1617.77 s [algebraic-graphs]
  22984. 1617.77 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.tree ============
  22985. 1617.77 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  22986. 1617.77 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path1 [x,y,z]
  22987. 1617.77 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  22988. 1617.77 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges1 [(1,2), (1,3), (3,4), (3,5)]
  22989. 1617.77 s [algebraic-graphs]
  22990. 1617.77 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.removeVertex1 ============
  22991. 1617.77 s [algebraic-graphs] OK: removeVertex1 x (vertex x) == Nothing
  22992. 1617.77 s [algebraic-graphs] OK: removeVertex1 1 (vertex 2) == Just (vertex 2)
  22993. 1617.77 s [algebraic-graphs] OK: removeVertex1 x (edge x x) == Nothing
  22994. 1617.77 s [algebraic-graphs] OK: removeVertex1 1 (edge 1 2) == Just (vertex 2)
  22995. 1617.77 s [algebraic-graphs] OK: removeVertex1 x >=> removeVertex1 x == removeVertex1 x
  22996. 1617.77 s [algebraic-graphs]
  22997. 1617.77 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.removeEdge ============
  22998. 1617.77 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices1 [x,y]
  22999. 1617.77 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  23000. 1617.77 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  23001. 1617.77 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  23002. 1617.77 s [algebraic-graphs]
  23003. 1617.77 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.replaceVertex ============
  23004. 1617.77 s [algebraic-graphs] OK: replaceVertex x x == id
  23005. 1617.77 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  23006. 1617.77 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  23007. 1617.77 s [algebraic-graphs]
  23008. 1617.77 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.mergeVertices ============
  23009. 1617.77 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  23010. 1617.77 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  23011. 1617.77 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  23012. 1617.77 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  23013. 1617.77 s [algebraic-graphs]
  23014. 1617.77 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.transpose ============
  23015. 1617.77 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  23016. 1617.77 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  23017. 1617.77 s [algebraic-graphs] OK: transpose . transpose == id
  23018. 1617.77 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  23019. 1617.77 s [algebraic-graphs]
  23020. 1617.77 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.gmap ============
  23021. 1617.77 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  23022. 1617.77 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  23023. 1617.77 s [algebraic-graphs] OK: gmap id == id
  23024. 1617.78 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  23025. 1617.78 s [algebraic-graphs]
  23026. 1617.78 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.induce1 ============
  23027. 1617.78 s [algebraic-graphs] OK: induce1 (const True ) x == Just x
  23028. 1617.78 s [algebraic-graphs] OK: induce1 (const False) x == Nothing
  23029. 1617.78 s [algebraic-graphs] OK: induce1 (/= x) == removeVertex1 x
  23030. 1617.78 s [algebraic-graphs] OK: induce1 p >=> induce1 q == induce1 (\x -> p x && q x)
  23031. 1617.78 s [algebraic-graphs]
  23032. 1617.78 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.induceJust1 ============
  23033. 1617.78 s [algebraic-graphs] OK: induceJust1 (vertex Nothing) == Nothing
  23034. 1617.78 s [algebraic-graphs] OK: induceJust1 (edge (Just x) Nothing) == Just (vertex x)
  23035. 1617.78 s [algebraic-graphs] OK: induceJust1 . gmap Just == Just
  23036. 1617.78 s [algebraic-graphs] OK: induceJust1 . gmap (\x -> if p x then Just x else Nothing) == induce1 p
  23037. 1617.78 s [algebraic-graphs]
  23038. 1617.78 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.closure ============
  23039. 1617.78 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  23040. 1617.78 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  23041. 1617.78 s [algebraic-graphs] OK: closure (edge x y) == edges1 [(x,x), (x,y), (y,y)]
  23042. 1617.78 s [algebraic-graphs] OK: closure (path1 $ nub xs) == reflexiveClosure (clique1 $ nub xs)
  23043. 1617.78 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  23044. 1617.78 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  23045. 1617.78 s [algebraic-graphs] OK: closure . closure == closure
  23046. 1617.78 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  23047. 1617.78 s [algebraic-graphs]
  23048. 1617.78 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.reflexiveClosure ============
  23049. 1617.78 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  23050. 1617.78 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  23051. 1617.78 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges1 [(x,x), (x,y), (y,y)]
  23052. 1617.78 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  23053. 1617.78 s [algebraic-graphs]
  23054. 1617.78 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.symmetricClosure ============
  23055. 1617.78 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  23056. 1617.78 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges1 [(x,y), (y,x)]
  23057. 1617.78 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  23058. 1617.78 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  23059. 1617.78 s [algebraic-graphs]
  23060. 1617.78 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.transitiveClosure ============
  23061. 1617.78 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  23062. 1617.78 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  23063. 1617.78 s [algebraic-graphs] OK: transitiveClosure (path1 $ nub xs) == clique1 (nub $ xs)
  23064. 1617.78 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  23065. 1617.78 s [algebraic-graphs]
  23066. 1617.78 s [algebraic-graphs] ============ NonEmpty.Graph.============
  23067. 1617.78 s [algebraic-graphs] OK: Axioms of non-empty graphs
  23068. 1617.78 s [algebraic-graphs] OK: Theorems of non-empty graphs
  23069. 1617.78 s [algebraic-graphs]
  23070. 1617.78 s [algebraic-graphs] ============ Ord (NonEmpty.Graph a) ============
  23071. 1617.78 s [algebraic-graphs] OK: vertex 1 < vertex 2
  23072. 1617.78 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  23073. 1617.78 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  23074. 1617.78 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  23075. 1617.78 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  23076. 1617.78 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  23077. 1617.78 s [algebraic-graphs] OK: x <= x + y
  23078. 1617.78 s [algebraic-graphs] OK: x + y <= x * y
  23079. 1617.78 s [algebraic-graphs]
  23080. 1617.78 s [algebraic-graphs] ============ Functor (NonEmpty.Graph a) ============
  23081. 1617.78 s [algebraic-graphs] OK: fmap f (vertex x) == vertex (f x)
  23082. 1617.78 s [algebraic-graphs] OK: fmap f (edge x y) == edge (f x) (f y)
  23083. 1617.78 s [algebraic-graphs] OK: fmap id == id
  23084. 1617.78 s [algebraic-graphs] OK: fmap f . fmap g == fmap (f . g)
  23085. 1617.78 s [algebraic-graphs]
  23086. 1617.78 s [algebraic-graphs] ============ Monad (NonEmpty.Graph a) ============
  23087. 1617.78 s [algebraic-graphs] OK: (vertex x >>= f) == f x
  23088. 1619.69 s [algebraic-graphs] OK: (edge x y >>= f) == connect (f x) (f y)
  23089. 1619.69 s [algebraic-graphs] OK: (vertices1 xs >>= f) == overlays1 (fmap f xs)
  23090. 1619.74 s [algebraic-graphs] OK: (x >>= vertex) == x
  23091. 1619.74 s [algebraic-graphs] OK: ((x >>= f) >>= g) == (x >>= (\y -> (f y) >>= g))
  23092. 1619.74 s [algebraic-graphs]
  23093. 1619.74 s [algebraic-graphs] ============ NonEmpty.Graph.toNonEmpty ============
  23094. 1619.74 s [algebraic-graphs] OK: toNonEmpty empty == Nothing
  23095. 1619.74 s [algebraic-graphs] OK: toNonEmpty (toGraph x) == Just (x :: NonEmpty.Graph a)
  23096. 1619.74 s [algebraic-graphs]
  23097. 1619.74 s [algebraic-graphs] ============ NonEmpty.Graph.vertex ============
  23098. 1619.74 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  23099. 1619.74 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  23100. 1619.74 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  23101. 1619.74 s [algebraic-graphs] OK: size (vertex x) == 1
  23102. 1619.74 s [algebraic-graphs]
  23103. 1619.74 s [algebraic-graphs] ============ NonEmpty.Graph.edge ============
  23104. 1619.74 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  23105. 1619.74 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  23106. 1619.74 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  23107. 1619.74 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  23108. 1619.74 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  23109. 1619.74 s [algebraic-graphs]
  23110. 1619.74 s [algebraic-graphs] ============ NonEmpty.Graph.overlay ============
  23111. 1619.74 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  23112. 1619.74 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  23113. 1619.74 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  23114. 1619.74 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  23115. 1619.74 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  23116. 1619.74 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  23117. 1619.74 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  23118. 1619.74 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  23119. 1619.74 s [algebraic-graphs]
  23120. 1619.74 s [algebraic-graphs] ============ NonEmpty.Graph.overlay1 ============
  23121. 1619.74 s [algebraic-graphs] OK: overlay1 empty x == x
  23122. 1619.74 s [algebraic-graphs] OK: x /= empty ==> overlay1 x y == overlay (fromJust $ toNonEmpty x) y
  23123. 1619.74 s [algebraic-graphs]
  23124. 1619.74 s [algebraic-graphs] ============ NonEmpty.Graph.connect ============
  23125. 1619.74 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  23126. 1619.74 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  23127. 1619.74 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  23128. 1619.74 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  23129. 1619.74 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  23130. 1619.74 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  23131. 1619.74 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  23132. 1619.74 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  23133. 1619.74 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  23134. 1619.74 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  23135. 1619.74 s [algebraic-graphs]
  23136. 1619.74 s [algebraic-graphs] ============ NonEmpty.Graph.vertices1 ============
  23137. 1619.74 s [algebraic-graphs] OK: vertices1 [x] == vertex x
  23138. 1619.74 s [algebraic-graphs] OK: hasVertex x . vertices1 == elem x
  23139. 1619.75 s [algebraic-graphs] OK: vertexCount . vertices1 == length . nub
  23140. 1619.75 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  23141. 1619.75 s [algebraic-graphs]
  23142. 1619.75 s [algebraic-graphs] ============ NonEmpty.Graph.edges1 ============
  23143. 1619.75 s [algebraic-graphs] OK: edges1 [(x,y)] == edge x y
  23144. 1619.75 s [algebraic-graphs] OK: edges1 == overlays1 . fmap (uncurry edge)
  23145. 1619.75 s [algebraic-graphs] OK: edgeCount . edges1 == length . nub
  23146. 1619.75 s [algebraic-graphs]
  23147. 1619.75 s [algebraic-graphs] ============ NonEmpty.Graph.overlays1 ============
  23148. 1619.75 s [algebraic-graphs] OK: overlays1 [x] == x
  23149. 1619.75 s [algebraic-graphs] OK: overlays1 [x,y] == overlay x y
  23150. 1619.75 s [algebraic-graphs]
  23151. 1619.75 s [algebraic-graphs] ============ NonEmpty.Graph.connects1 ============
  23152. 1619.75 s [algebraic-graphs] OK: connects1 [x] == x
  23153. 1619.75 s [algebraic-graphs] OK: connects1 [x,y] == connect x y
  23154. 1619.75 s [algebraic-graphs]
  23155. 1619.75 s [algebraic-graphs] ============ NonEmpty.Graph.foldg1 ============
  23156. 1619.75 s [algebraic-graphs] OK: foldg1 vertex overlay connect == id
  23157. 1619.75 s [algebraic-graphs] OK: foldg1 vertex overlay (flip connect) == transpose
  23158. 1619.75 s [algebraic-graphs] OK: foldg1 (const 1) (+) (+) == size
  23159. 1619.75 s [algebraic-graphs] OK: foldg1 (== x) (||) (||) == hasVertex x
  23160. 1619.75 s [algebraic-graphs]
  23161. 1619.75 s [algebraic-graphs] ============ NonEmpty.Graph.isSubgraphOf ============
  23162. 1619.75 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  23163. 1619.75 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  23164. 1619.75 s [algebraic-graphs] OK: isSubgraphOf (path1 xs) (circuit1 xs) == True
  23165. 1619.75 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  23166. 1619.75 s [algebraic-graphs]
  23167. 1619.75 s [algebraic-graphs] ============ NonEmpty.Graph.(===) ============
  23168. 1619.75 s [algebraic-graphs] OK: x === x == True
  23169. 1619.75 s [algebraic-graphs] OK: x + y === x + y == True
  23170. 1619.75 s [algebraic-graphs] OK: 1 + 2 === 2 + 1 == False
  23171. 1619.75 s [algebraic-graphs] OK: x + y === x * y == False
  23172. 1619.75 s [algebraic-graphs]
  23173. 1619.75 s [algebraic-graphs] ============ NonEmpty.Graph.size ============
  23174. 1619.75 s [algebraic-graphs] OK: size (vertex x) == 1
  23175. 1619.75 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  23176. 1619.75 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  23177. 1619.75 s [algebraic-graphs] OK: size x >= 1
  23178. 1619.75 s [algebraic-graphs] OK: size x >= vertexCount x
  23179. 1619.75 s [algebraic-graphs]
  23180. 1619.75 s [algebraic-graphs] ============ NonEmpty.Graph.hasVertex ============
  23181. 1619.75 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  23182. 1619.75 s [algebraic-graphs]
  23183. 1619.75 s [algebraic-graphs] ============ NonEmpty.Graph.hasEdge ============
  23184. 1619.75 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  23185. 1619.75 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  23186. 1619.75 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  23187. 1619.75 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  23188. 1619.75 s [algebraic-graphs]
  23189. 1619.75 s [algebraic-graphs] ============ NonEmpty.Graph.vertexCount ============
  23190. 1619.75 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  23191. 1619.75 s [algebraic-graphs] OK: vertexCount x >= 1
  23192. 1619.75 s [algebraic-graphs] OK: vertexCount == length . vertexList1
  23193. 1619.75 s [algebraic-graphs]
  23194. 1619.75 s [algebraic-graphs] ============ NonEmpty.Graph.edgeCount ============
  23195. 1619.75 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  23196. 1619.75 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  23197. 1619.75 s [algebraic-graphs] OK: edgeCount == length . edgeList
  23198. 1619.75 s [algebraic-graphs]
  23199. 1619.75 s [algebraic-graphs] ============ NonEmpty.Graph.vertexList1 ============
  23200. 1619.75 s [algebraic-graphs] OK: vertexList1 (vertex x) == [x]
  23201. 1619.75 s [algebraic-graphs] OK: vertexList1 . vertices1 == nub . sort
  23202. 1619.75 s [algebraic-graphs]
  23203. 1619.75 s [algebraic-graphs] ============ NonEmpty.Graph.edgeList ============
  23204. 1619.75 s [algebraic-graphs] OK: edgeList (vertex x) == []
  23205. 1619.75 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  23206. 1619.75 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  23207. 1619.75 s [algebraic-graphs] OK: edgeList . edges1 == nub . sort . toList
  23208. 1619.75 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  23209. 1619.75 s [algebraic-graphs]
  23210. 1619.75 s [algebraic-graphs] ============ NonEmpty.Graph.vertexSet ============
  23211. 1619.75 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  23212. 1619.75 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  23213. 1619.75 s [algebraic-graphs] OK: vertexSet . clique1 == Set.fromList . toList
  23214. 1619.75 s [algebraic-graphs]
  23215. 1619.75 s [algebraic-graphs] ============ NonEmpty.Graph.edgeSet ============
  23216. 1619.75 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  23217. 1619.75 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  23218. 1619.75 s [algebraic-graphs] OK: edgeSet . edges1 == Set.fromList . toList
  23219. 1619.75 s [algebraic-graphs]
  23220. 1619.75 s [algebraic-graphs] ============ NonEmpty.Graph.path1 ============
  23221. 1619.75 s [algebraic-graphs] OK: path1 [x] == vertex x
  23222. 1619.75 s [algebraic-graphs] OK: path1 [x,y] == edge x y
  23223. 1619.75 s [algebraic-graphs] OK: path1 . reverse == transpose . path1
  23224. 1619.75 s [algebraic-graphs]
  23225. 1619.75 s [algebraic-graphs] ============ NonEmpty.Graph.circuit1 ============
  23226. 1619.75 s [algebraic-graphs] OK: circuit1 [x] == edge x x
  23227. 1619.75 s [algebraic-graphs] OK: circuit1 [x,y] == edges1 [(x,y), (y,x)]
  23228. 1619.75 s [algebraic-graphs] OK: circuit1 . reverse == transpose . circuit1
  23229. 1619.75 s [algebraic-graphs]
  23230. 1619.75 s [algebraic-graphs] ============ NonEmpty.Graph.clique1 ============
  23231. 1619.75 s [algebraic-graphs] OK: clique1 [x] == vertex x
  23232. 1619.75 s [algebraic-graphs] OK: clique1 [x,y] == edge x y
  23233. 1619.75 s [algebraic-graphs] OK: clique1 [x,y,z] == edges1 [(x,y), (x,z), (y,z)]
  23234. 1619.75 s [algebraic-graphs] OK: clique1 (xs <> ys) == connect (clique1 xs) (clique1 ys)
  23235. 1619.75 s [algebraic-graphs] OK: clique1 . reverse == transpose . clique1
  23236. 1619.75 s [algebraic-graphs]
  23237. 1619.75 s [algebraic-graphs] ============ NonEmpty.Graph.biclique1 ============
  23238. 1619.75 s [algebraic-graphs] OK: biclique1 [x1,x2] [y1,y2] == edges1 [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  23239. 1619.75 s [algebraic-graphs] OK: biclique1 xs ys == connect (vertices1 xs) (vertices1 ys)
  23240. 1619.75 s [algebraic-graphs]
  23241. 1619.75 s [algebraic-graphs] ============ NonEmpty.Graph.star ============
  23242. 1619.75 s [algebraic-graphs] OK: star x [] == vertex x
  23243. 1619.75 s [algebraic-graphs] OK: star x [y] == edge x y
  23244. 1619.75 s [algebraic-graphs] OK: star x [y,z] == edges1 [(x,y), (x,z)]
  23245. 1619.75 s [algebraic-graphs]
  23246. 1619.75 s [algebraic-graphs] ============ NonEmpty.Graph.stars1 ============
  23247. 1619.75 s [algebraic-graphs] OK: stars1 [(x, [] )] == vertex x
  23248. 1619.75 s [algebraic-graphs] OK: stars1 [(x, [y])] == edge x y
  23249. 1619.75 s [algebraic-graphs] OK: stars1 [(x, ys )] == star x ys
  23250. 1619.75 s [algebraic-graphs] OK: stars1 == overlays1 . fmap (uncurry star)
  23251. 1619.75 s [algebraic-graphs] OK: overlay (stars1 xs) (stars1 ys) == stars1 (xs <> ys)
  23252. 1619.75 s [algebraic-graphs]
  23253. 1619.75 s [algebraic-graphs] ============ NonEmpty.Graph.tree ============
  23254. 1619.75 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  23255. 1619.75 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path1 [x,y,z]
  23256. 1619.75 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  23257. 1619.75 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges1 [(1,2), (1,3), (3,4), (3,5)]
  23258. 1619.75 s [algebraic-graphs]
  23259. 1619.75 s [algebraic-graphs] ============ NonEmpty.Graph.mesh1 ============
  23260. 1619.75 s [algebraic-graphs] OK: mesh1 [x] [y] == vertex (x, y)
  23261. 1619.75 s [algebraic-graphs] OK: mesh1 xs ys == box (path1 xs) (path1 ys)
  23262. 1619.75 s [algebraic-graphs] OK: mesh1 [1,2,3] ['a', 'b'] == <correct result>
  23263. 1619.75 s [algebraic-graphs] OK: size (mesh xs ys) == max 1 (3 * length xs * length ys - length xs - length ys -1)
  23264. 1619.75 s [algebraic-graphs]
  23265. 1619.75 s [algebraic-graphs] ============ NonEmpty.Graph.torus1 ============
  23266. 1619.75 s [algebraic-graphs] OK: torus1 [x] [y] == edge (x,y) (x,y)
  23267. 1619.75 s [algebraic-graphs] OK: torus1 xs ys == box (circuit1 xs) (circuit1 ys)
  23268. 1619.75 s [algebraic-graphs] OK: torus1 [1,2] ['a', 'b'] == <correct result>
  23269. 1619.75 s [algebraic-graphs] OK: size (torus1 xs ys) == max 1 (3 * length xs * length ys)
  23270. 1619.75 s [algebraic-graphs]
  23271. 1619.75 s [algebraic-graphs] ============ NonEmpty.Graph.removeVertex1 ============
  23272. 1619.75 s [algebraic-graphs] OK: removeVertex1 x (vertex x) == Nothing
  23273. 1619.75 s [algebraic-graphs] OK: removeVertex1 1 (vertex 2) == Just (vertex 2)
  23274. 1619.75 s [algebraic-graphs] OK: removeVertex1 x (edge x x) == Nothing
  23275. 1619.75 s [algebraic-graphs] OK: removeVertex1 1 (edge 1 2) == Just (vertex 2)
  23276. 1619.75 s [algebraic-graphs] OK: removeVertex1 x >=> removeVertex1 x == removeVertex1 x
  23277. 1619.75 s [algebraic-graphs]
  23278. 1619.75 s [algebraic-graphs] ============ NonEmpty.Graph.removeEdge ============
  23279. 1619.75 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices1 [x,y]
  23280. 1619.75 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  23281. 1619.75 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  23282. 1619.75 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  23283. 1619.75 s [algebraic-graphs] OK: size (removeEdge x y z) <= 3 * size z
  23284. 1619.75 s [algebraic-graphs]
  23285. 1619.75 s [algebraic-graphs] ============ NonEmpty.Graph.replaceVertex ============
  23286. 1619.75 s [algebraic-graphs] OK: replaceVertex x x == id
  23287. 1619.75 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  23288. 1619.75 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  23289. 1619.75 s [algebraic-graphs]
  23290. 1619.75 s [algebraic-graphs] ============ NonEmpty.Graph.mergeVertices ============
  23291. 1619.75 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  23292. 1627.37 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  23293. 1627.37 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  23294. 1627.39 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  23295. 1627.39 s [algebraic-graphs]
  23296. 1627.39 s [algebraic-graphs] ============ NonEmpty.Graph.splitVertex1 ============
  23297. 1627.39 s [algebraic-graphs] OK: splitVertex1 x [x] == id
  23298. 1627.39 s [algebraic-graphs] OK: splitVertex1 x [y] == replaceVertex x y
  23299. 1627.39 s [algebraic-graphs] OK: splitVertex1 1 [0,1] $ 1 * (2 + 3) == (0 + 1) * (2 + 3)
  23300. 1627.39 s [algebraic-graphs]
  23301. 1627.39 s [algebraic-graphs] ============ NonEmpty.Graph.transpose ============
  23302. 1627.39 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  23303. 1627.39 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  23304. 1627.39 s [algebraic-graphs] OK: transpose . transpose == id
  23305. 1627.39 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  23306. 1627.39 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  23307. 1627.39 s [algebraic-graphs]
  23308. 1627.39 s [algebraic-graphs] ============ NonEmpty.Graph.induce1 ============
  23309. 1627.39 s [algebraic-graphs] OK: induce1 (const True ) x == Just x
  23310. 1627.39 s [algebraic-graphs] OK: induce1 (const False) x == Nothing
  23311. 1627.39 s [algebraic-graphs] OK: induce1 (/= x) == removeVertex1 x
  23312. 1627.39 s [algebraic-graphs] OK: induce1 p >=> induce1 q == induce1 (\x -> p x && q x)
  23313. 1627.39 s [algebraic-graphs]
  23314. 1627.39 s [algebraic-graphs] ============ NonEmpty.Graph.induceJust1 ============
  23315. 1627.39 s [algebraic-graphs] OK: induceJust1 (vertex Nothing) == Nothing
  23316. 1627.39 s [algebraic-graphs] OK: induceJust1 (edge (Just x) Nothing) == Just (vertex x)
  23317. 1627.39 s [algebraic-graphs] OK: induceJust1 . fmap Just == Just
  23318. 1627.39 s [algebraic-graphs] OK: induceJust1 . fmap (\x -> if p x then Just x else Nothing) == induce1 p
  23319. 1627.39 s [algebraic-graphs]
  23320. 1627.39 s [algebraic-graphs] ============ NonEmpty.Graph.simplify ============
  23321. 1627.39 s [algebraic-graphs] OK: simplify == id
  23322. 1627.39 s [algebraic-graphs] OK: size (simplify x) <= size x
  23323. 1627.39 s [algebraic-graphs] OK: simplify 1 === 1
  23324. 1627.39 s [algebraic-graphs] OK: simplify (1 + 1) === 1
  23325. 1627.39 s [algebraic-graphs] OK: simplify (1 + 2 + 1) === 1 + 2
  23326. 1627.39 s [algebraic-graphs] OK: simplify (1 * 1 * 1) === 1 * 1
  23327. 1627.39 s [algebraic-graphs]
  23328. 1627.39 s [algebraic-graphs] ============ NonEmpty.Graph.sparsify ============
  23329. 1627.39 s [algebraic-graphs] OK: sort . reachable x == sort . rights . reachable (sparsify x) . Right
  23330. 1627.39 s [algebraic-graphs] OK: vertexCount (sparsify x) <= vertexCount x + size x + 1
  23331. 1627.39 s [algebraic-graphs] OK: edgeCount (sparsify x) <= 3 * size x
  23332. 1627.39 s [algebraic-graphs] OK: size (sparsify x) <= 3 * size x
  23333. 1627.39 s [algebraic-graphs]
  23334. 1627.39 s [algebraic-graphs] ============ NonEmpty.Graph.sparsifyKL ============
  23335. 1627.39 s [algebraic-graphs] OK: sort . reachable x == sort . filter (<= n) . reachable (sparsifyKL n x)
  23336. 1627.39 s [algebraic-graphs] OK: length (vertices $ sparsifyKL n x) <= vertexCount x + size x + 1
  23337. 1627.39 s [algebraic-graphs] OK: length (edges $ sparsifyKL n x) <= 3 * size x
  23338. 1627.39 s [algebraic-graphs]
  23339. 1627.39 s [algebraic-graphs] ============ NonEmpty.Graph.box ============
  23340. 1627.39 s [algebraic-graphs] OK: box (path1 [0,1]) (path1 ['a','b']) == <correct result>
  23341. 1627.39 s [algebraic-graphs] OK: box x y ~~ box y x
  23342. 1627.39 s [algebraic-graphs] OK: box x (overlay y z) == overlay (box x y) (box x z)
  23343. 1627.39 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  23344. 1627.39 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  23345. 1627.39 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  23346. 1627.39 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  23347. 1627.39 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  23348. 1627.39 s [algebraic-graphs]
  23349. 1627.39 s [algebraic-graphs] ============ Relation ============
  23350. 1627.39 s [algebraic-graphs] OK: Axioms of graphs
  23351. 1627.39 s [algebraic-graphs]
  23352. 1627.39 s [algebraic-graphs] ============ Relation.consistent ============
  23353. 1627.39 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  23354. 1627.39 s [algebraic-graphs]
  23355. 1627.39 s [algebraic-graphs] OK: consistent empty == True
  23356. 1627.39 s [algebraic-graphs] OK: consistent (vertex x) == True
  23357. 1627.39 s [algebraic-graphs] OK: consistent (overlay x y) == True
  23358. 1627.39 s [algebraic-graphs] OK: consistent (connect x y) == True
  23359. 1627.39 s [algebraic-graphs] OK: consistent (edge x y) == True
  23360. 1627.39 s [algebraic-graphs] OK: consistent (edges xs) == True
  23361. 1627.39 s [algebraic-graphs] OK: consistent (stars xs) == True
  23362. 1627.39 s [algebraic-graphs]
  23363. 1627.39 s [algebraic-graphs] ============ Relation.Show ============
  23364. 1627.39 s [algebraic-graphs] OK: show (empty ) == "empty"
  23365. 1627.39 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  23366. 1627.39 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  23367. 1627.39 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  23368. 1627.39 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  23369. 1627.39 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  23370. 1627.39 s [algebraic-graphs]
  23371. 1627.39 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  23372. 1627.39 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  23373. 1627.39 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  23374. 1627.39 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  23375. 1627.39 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  23376. 1627.39 s [algebraic-graphs]
  23377. 1627.39 s [algebraic-graphs] ============ Relation.Ord ============
  23378. 1627.39 s [algebraic-graphs] OK: vertex 1 < vertex 2
  23379. 1627.39 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  23380. 1627.39 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  23381. 1627.39 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  23382. 1627.39 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  23383. 1627.39 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  23384. 1627.39 s [algebraic-graphs] OK: x <= x + y
  23385. 1627.39 s [algebraic-graphs] OK: x + y <= x * y
  23386. 1627.39 s [algebraic-graphs]
  23387. 1627.39 s [algebraic-graphs] ============ Relation.empty ============
  23388. 1627.39 s [algebraic-graphs] OK: isEmpty empty == True
  23389. 1627.39 s [algebraic-graphs] OK: hasVertex x empty == False
  23390. 1627.39 s [algebraic-graphs] OK: vertexCount empty == 0
  23391. 1627.39 s [algebraic-graphs] OK: edgeCount empty == 0
  23392. 1627.39 s [algebraic-graphs]
  23393. 1627.39 s [algebraic-graphs] ============ Relation.vertex ============
  23394. 1627.39 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  23395. 1627.39 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  23396. 1627.39 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  23397. 1627.39 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  23398. 1627.39 s [algebraic-graphs]
  23399. 1627.39 s [algebraic-graphs] ============ Relation.edge ============
  23400. 1627.39 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  23401. 1627.39 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  23402. 1627.39 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  23403. 1627.39 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  23404. 1627.39 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  23405. 1627.39 s [algebraic-graphs]
  23406. 1627.39 s [algebraic-graphs] ============ Relation.overlay ============
  23407. 1627.39 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  23408. 1627.39 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  23409. 1627.39 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  23410. 1627.39 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  23411. 1627.39 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  23412. 1627.39 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  23413. 1627.39 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  23414. 1627.39 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  23415. 1627.39 s [algebraic-graphs]
  23416. 1627.39 s [algebraic-graphs] ============ Relation.connect ============
  23417. 1627.39 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  23418. 1627.39 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  23419. 1627.39 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  23420. 1627.39 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  23421. 1627.39 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  23422. 1627.39 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  23423. 1627.39 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  23424. 1627.39 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  23425. 1627.39 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  23426. 1627.39 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  23427. 1627.39 s [algebraic-graphs]
  23428. 1627.39 s [algebraic-graphs] ============ Relation.vertices ============
  23429. 1627.39 s [algebraic-graphs] OK: vertices [] == empty
  23430. 1627.39 s [algebraic-graphs] OK: vertices [x] == vertex x
  23431. 1627.39 s [algebraic-graphs] OK: vertices == overlays . map vertex
  23432. 1627.39 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  23433. 1627.39 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  23434. 1627.39 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  23435. 1627.39 s [algebraic-graphs]
  23436. 1627.39 s [algebraic-graphs] ============ Relation.edges ============
  23437. 1627.39 s [algebraic-graphs] OK: edges [] == empty
  23438. 1627.39 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  23439. 1627.39 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  23440. 1627.39 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  23441. 1627.39 s [algebraic-graphs]
  23442. 1627.39 s [algebraic-graphs] ============ Relation.overlays ============
  23443. 1627.39 s [algebraic-graphs] OK: overlays [] == empty
  23444. 1627.39 s [algebraic-graphs] OK: overlays [x] == x
  23445. 1627.39 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  23446. 1627.39 s [algebraic-graphs] OK: overlays == foldr overlay empty
  23447. 1627.39 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  23448. 1627.39 s [algebraic-graphs]
  23449. 1627.39 s [algebraic-graphs] ============ Relation.connects ============
  23450. 1627.39 s [algebraic-graphs] OK: connects [] == empty
  23451. 1627.39 s [algebraic-graphs] OK: connects [x] == x
  23452. 1627.39 s [algebraic-graphs] OK: connects [x,y] == connect x y
  23453. 1627.39 s [algebraic-graphs] OK: connects == foldr connect empty
  23454. 1627.39 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  23455. 1627.39 s [algebraic-graphs]
  23456. 1627.39 s [algebraic-graphs] ============ Relation.isSubgraphOf ============
  23457. 1627.39 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  23458. 1627.39 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  23459. 1627.39 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  23460. 1627.39 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  23461. 1627.39 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  23462. 1627.39 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  23463. 1627.39 s [algebraic-graphs]
  23464. 1627.39 s [algebraic-graphs] ============ Relation.toGraph et al. ============
  23465. 1627.39 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  23466. 1627.39 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  23467. 1627.39 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  23468. 1627.39 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  23469. 1627.39 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  23470. 1627.39 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  23471. 1627.39 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  23472. 1627.39 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  23473. 1627.39 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  23474. 1627.39 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  23475. 1627.39 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  23476. 1627.39 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  23477. 1627.39 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  23478. 1627.39 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  23479. 1627.39 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  23480. 1627.39 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  23481. 1627.39 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  23482. 1631.34 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  23483. 1631.34 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  23484. 1631.34 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  23485. 1631.34 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  23486. 1631.35 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  23487. 1631.35 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  23488. 1631.35 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  23489. 1631.35 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  23490. 1631.35 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  23491. 1631.35 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  23492. 1631.35 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  23493. 1631.35 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  23494. 1631.35 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  23495. 1631.35 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  23496. 1631.35 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  23497. 1631.35 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  23498. 1631.35 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  23499. 1631.35 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  23500. 1631.35 s [algebraic-graphs]
  23501. 1631.35 s [algebraic-graphs] ============ Relation.foldg ============
  23502. 1631.35 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  23503. 1631.35 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  23504. 1631.35 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  23505. 1631.35 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  23506. 1631.35 s [algebraic-graphs]
  23507. 1631.35 s [algebraic-graphs] ============ Relation.isEmpty ============
  23508. 1631.35 s [algebraic-graphs] OK: isEmpty empty == True
  23509. 1631.35 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  23510. 1631.35 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  23511. 1631.35 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  23512. 1631.35 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  23513. 1631.35 s [algebraic-graphs]
  23514. 1631.35 s [algebraic-graphs] ============ Relation.hasVertex ============
  23515. 1631.35 s [algebraic-graphs] OK: hasVertex x empty == False
  23516. 1631.35 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  23517. 1631.35 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  23518. 1631.35 s [algebraic-graphs]
  23519. 1631.35 s [algebraic-graphs] ============ Relation.hasEdge ============
  23520. 1631.35 s [algebraic-graphs] OK: hasEdge x y empty == False
  23521. 1631.35 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  23522. 1631.35 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  23523. 1631.35 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  23524. 1631.35 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  23525. 1631.35 s [algebraic-graphs]
  23526. 1631.35 s [algebraic-graphs] ============ Relation.vertexCount ============
  23527. 1631.35 s [algebraic-graphs] OK: vertexCount empty == 0
  23528. 1631.35 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  23529. 1631.35 s [algebraic-graphs] OK: vertexCount == length . vertexList
  23530. 1631.35 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  23531. 1631.35 s [algebraic-graphs]
  23532. 1631.35 s [algebraic-graphs] ============ Relation.edgeCount ============
  23533. 1631.35 s [algebraic-graphs] OK: edgeCount empty == 0
  23534. 1631.35 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  23535. 1631.35 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  23536. 1631.35 s [algebraic-graphs] OK: edgeCount == length . edgeList
  23537. 1631.35 s [algebraic-graphs]
  23538. 1631.35 s [algebraic-graphs] ============ Relation.vertexList ============
  23539. 1631.35 s [algebraic-graphs] OK: vertexList empty == []
  23540. 1631.35 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  23541. 1631.35 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  23542. 1631.35 s [algebraic-graphs]
  23543. 1631.35 s [algebraic-graphs] ============ Relation.vertexSet ============
  23544. 1631.35 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  23545. 1631.35 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  23546. 1631.35 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  23547. 1631.35 s [algebraic-graphs]
  23548. 1631.35 s [algebraic-graphs] ============ Relation.vertexIntSet ============
  23549. 1631.35 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  23550. 1631.35 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  23551. 1631.35 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  23552. 1631.35 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  23553. 1631.35 s [algebraic-graphs]
  23554. 1631.35 s [algebraic-graphs] ============ Relation.edgeList ============
  23555. 1631.35 s [algebraic-graphs] OK: edgeList empty == []
  23556. 1631.35 s [algebraic-graphs] OK: edgeList (vertex x) == []
  23557. 1631.35 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  23558. 1631.35 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  23559. 1631.35 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  23560. 1631.35 s [algebraic-graphs]
  23561. 1631.35 s [algebraic-graphs] ============ Relation.edgeSet ============
  23562. 1631.35 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  23563. 1631.35 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  23564. 1631.35 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  23565. 1631.35 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  23566. 1631.35 s [algebraic-graphs]
  23567. 1631.35 s [algebraic-graphs] ============ Relation.adjacencyList ============
  23568. 1631.35 s [algebraic-graphs] OK: adjacencyList empty == []
  23569. 1631.35 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  23570. 1631.35 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  23571. 1631.35 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  23572. 1631.35 s [algebraic-graphs]
  23573. 1631.35 s [algebraic-graphs] ============ Relation.preSet ============
  23574. 1631.35 s [algebraic-graphs] OK: preSet x empty == Set.empty
  23575. 1631.35 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  23576. 1631.35 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  23577. 1631.35 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  23578. 1631.35 s [algebraic-graphs]
  23579. 1631.35 s [algebraic-graphs] ============ Relation.preIntSet ============
  23580. 1631.35 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  23581. 1631.35 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  23582. 1631.35 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  23583. 1631.35 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  23584. 1631.35 s [algebraic-graphs]
  23585. 1631.35 s [algebraic-graphs] ============ Relation.postSet ============
  23586. 1631.35 s [algebraic-graphs] OK: postSet x empty == Set.empty
  23587. 1631.35 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  23588. 1631.35 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  23589. 1631.35 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  23590. 1631.35 s [algebraic-graphs]
  23591. 1631.35 s [algebraic-graphs] ============ Relation.postIntSet ============
  23592. 1631.35 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  23593. 1631.35 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  23594. 1631.35 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  23595. 1631.35 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  23596. 1631.35 s [algebraic-graphs]
  23597. 1631.35 s [algebraic-graphs] ============ Relation.path ============
  23598. 1631.35 s [algebraic-graphs] OK: path [] == empty
  23599. 1631.35 s [algebraic-graphs] OK: path [x] == vertex x
  23600. 1631.35 s [algebraic-graphs] OK: path [x,y] == edge x y
  23601. 1631.35 s [algebraic-graphs]
  23602. 1631.35 s [algebraic-graphs] ============ Relation.circuit ============
  23603. 1631.35 s [algebraic-graphs] OK: circuit [] == empty
  23604. 1631.35 s [algebraic-graphs] OK: circuit [x] == edge x x
  23605. 1631.35 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  23606. 1631.35 s [algebraic-graphs]
  23607. 1631.35 s [algebraic-graphs] ============ Relation.clique ============
  23608. 1631.35 s [algebraic-graphs] OK: clique [] == empty
  23609. 1631.35 s [algebraic-graphs] OK: clique [x] == vertex x
  23610. 1631.35 s [algebraic-graphs] OK: clique [x,y] == edge x y
  23611. 1631.35 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  23612. 1631.35 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  23613. 1631.35 s [algebraic-graphs]
  23614. 1631.35 s [algebraic-graphs] ============ Relation.biclique ============
  23615. 1631.35 s [algebraic-graphs] OK: biclique [] [] == empty
  23616. 1631.35 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  23617. 1631.35 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  23618. 1631.35 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  23619. 1631.35 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  23620. 1631.35 s [algebraic-graphs]
  23621. 1631.35 s [algebraic-graphs] ============ Relation.star ============
  23622. 1631.35 s [algebraic-graphs] OK: star x [] == vertex x
  23623. 1631.35 s [algebraic-graphs] OK: star x [y] == edge x y
  23624. 1631.35 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  23625. 1631.35 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  23626. 1631.35 s [algebraic-graphs]
  23627. 1631.35 s [algebraic-graphs] ============ Relation.stars ============
  23628. 1631.35 s [algebraic-graphs] OK: stars [] == empty
  23629. 1631.35 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  23630. 1631.35 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  23631. 1631.35 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  23632. 1631.35 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  23633. 1631.35 s [algebraic-graphs] OK: stars . adjacencyList == id
  23634. 1631.35 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  23635. 1631.35 s [algebraic-graphs]
  23636. 1631.35 s [algebraic-graphs] ============ Relation.tree ============
  23637. 1631.35 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  23638. 1631.35 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  23639. 1631.35 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  23640. 1631.35 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  23641. 1631.35 s [algebraic-graphs]
  23642. 1631.35 s [algebraic-graphs] ============ Relation.forest ============
  23643. 1631.35 s [algebraic-graphs] OK: forest [] == empty
  23644. 1631.35 s [algebraic-graphs] OK: forest [x] == tree x
  23645. 1631.35 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  23646. 1631.35 s [algebraic-graphs] OK: forest == overlays . map tree
  23647. 1631.35 s [algebraic-graphs]
  23648. 1631.35 s [algebraic-graphs] ============ Relation.removeVertex ============
  23649. 1631.35 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  23650. 1631.35 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  23651. 1631.35 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  23652. 1631.35 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  23653. 1631.35 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  23654. 1631.35 s [algebraic-graphs]
  23655. 1631.35 s [algebraic-graphs] ============ Relation.removeEdge ============
  23656. 1631.35 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  23657. 1631.35 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  23658. 1631.35 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  23659. 1631.35 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  23660. 1631.35 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  23661. 1631.35 s [algebraic-graphs]
  23662. 1631.35 s [algebraic-graphs] ============ Relation.replaceVertex ============
  23663. 1631.35 s [algebraic-graphs] OK: replaceVertex x x == id
  23664. 1631.35 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  23665. 1631.35 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  23666. 1631.35 s [algebraic-graphs]
  23667. 1631.35 s [algebraic-graphs] ============ Relation.mergeVertices ============
  23668. 1631.35 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  23669. 1659.38 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  23670. 1659.38 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  23671. 1659.39 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  23672. 1659.39 s [algebraic-graphs]
  23673. 1659.39 s [algebraic-graphs] ============ Relation.transpose ============
  23674. 1659.39 s [algebraic-graphs] OK: transpose empty == empty
  23675. 1659.39 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  23676. 1659.39 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  23677. 1659.39 s [algebraic-graphs] OK: transpose . transpose == id
  23678. 1659.39 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  23679. 1659.39 s [algebraic-graphs]
  23680. 1659.39 s [algebraic-graphs] ============ Relation.gmap ============
  23681. 1659.39 s [algebraic-graphs] OK: gmap f empty == empty
  23682. 1659.39 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  23683. 1659.39 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  23684. 1659.39 s [algebraic-graphs] OK: gmap id == id
  23685. 1659.39 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  23686. 1659.39 s [algebraic-graphs]
  23687. 1659.39 s [algebraic-graphs] ============ Relation.induce ============
  23688. 1659.39 s [algebraic-graphs] OK: induce (const True ) x == x
  23689. 1659.39 s [algebraic-graphs] OK: induce (const False) x == empty
  23690. 1659.39 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  23691. 1659.39 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  23692. 1659.39 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  23693. 1659.39 s [algebraic-graphs]
  23694. 1659.39 s [algebraic-graphs] ============ Relation.compose ============
  23695. 1659.39 s [algebraic-graphs] OK: compose empty x == empty
  23696. 1659.39 s [algebraic-graphs] OK: compose x empty == empty
  23697. 1659.39 s [algebraic-graphs] OK: compose (vertex x) y == empty
  23698. 1659.39 s [algebraic-graphs] OK: compose x (vertex y) == empty
  23699. 1659.39 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  23700. 1659.39 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  23701. 1659.39 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  23702. 1659.39 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  23703. 1659.39 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  23704. 1659.39 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  23705. 1659.39 s [algebraic-graphs]
  23706. 1659.39 s [algebraic-graphs] ============ Relation.closure ============
  23707. 1659.39 s [algebraic-graphs] OK: closure empty == empty
  23708. 1659.39 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  23709. 1659.39 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  23710. 1659.39 s [algebraic-graphs] OK: closure (edge x y) == edges [(x,x), (x,y), (y,y)]
  23711. 1659.39 s [algebraic-graphs] OK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
  23712. 1659.39 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  23713. 1659.39 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  23714. 1659.39 s [algebraic-graphs] OK: closure . closure == closure
  23715. 1659.39 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  23716. 1659.39 s [algebraic-graphs]
  23717. 1659.39 s [algebraic-graphs] ============ Relation.reflexiveClosure ============
  23718. 1659.39 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  23719. 1659.39 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  23720. 1659.39 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  23721. 1659.39 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges [(x,x), (x,y), (y,y)]
  23722. 1659.39 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  23723. 1659.39 s [algebraic-graphs]
  23724. 1659.39 s [algebraic-graphs] ============ Relation.symmetricClosure ============
  23725. 1659.39 s [algebraic-graphs] OK: symmetricClosure empty == empty
  23726. 1659.39 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  23727. 1659.39 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges [(x,y), (y,x)]
  23728. 1659.39 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  23729. 1659.39 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  23730. 1659.39 s [algebraic-graphs]
  23731. 1659.39 s [algebraic-graphs] ============ Relation.transitiveClosure ============
  23732. 1659.39 s [algebraic-graphs] OK: transitiveClosure empty == empty
  23733. 1659.39 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  23734. 1659.39 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  23735. 1659.39 s [algebraic-graphs] OK: transitiveClosure (path $ nub xs) == clique (nub $ xs)
  23736. 1659.39 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  23737. 1659.39 s [algebraic-graphs]
  23738. 1659.39 s [algebraic-graphs] ============ Relation.induceJust ============
  23739. 1659.39 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  23740. 1659.39 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  23741. 1659.40 s [algebraic-graphs] OK: induceJust . gmap Just == id
  23742. 1659.40 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  23743. 1659.40 s [algebraic-graphs]
  23744. 1659.40 s [algebraic-graphs] ============ ReflexiveRelation ============
  23745. 1659.40 s [algebraic-graphs] OK: Axioms of reflexive graphs
  23746. 1659.40 s [algebraic-graphs]
  23747. 1659.40 s [algebraic-graphs] ============ TransitiveRelation ============
  23748. 1659.40 s [algebraic-graphs] OK: Axioms of transitive graphs
  23749. 1659.40 s [algebraic-graphs] OK: path xs == (clique xs :: TransitiveRelation Int)
  23750. 1659.40 s [algebraic-graphs]
  23751. 1659.40 s [algebraic-graphs] ============ PreorderRelation ============
  23752. 1659.40 s [algebraic-graphs] OK: Axioms of preorder graphs
  23753. 1659.40 s [algebraic-graphs] OK: path xs == (clique xs :: PreorderRelation Int)
  23754. 1659.40 s [algebraic-graphs]
  23755. 1659.40 s [algebraic-graphs] ============ Symmetric.Relation ============
  23756. 1659.40 s [algebraic-graphs] OK: Axioms of undirected graphs
  23757. 1659.40 s [algebraic-graphs]
  23758. 1659.40 s [algebraic-graphs] ============ Symmetric.Relation.consistent ============
  23759. 1659.40 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  23760. 1659.40 s [algebraic-graphs]
  23761. 1659.40 s [algebraic-graphs] OK: consistent empty == True
  23762. 1659.40 s [algebraic-graphs] OK: consistent (vertex x) == True
  23763. 1659.40 s [algebraic-graphs] OK: consistent (overlay x y) == True
  23764. 1659.40 s [algebraic-graphs] OK: consistent (connect x y) == True
  23765. 1659.40 s [algebraic-graphs] OK: consistent (edge x y) == True
  23766. 1659.40 s [algebraic-graphs] OK: consistent (edges xs) == True
  23767. 1659.40 s [algebraic-graphs] OK: consistent (stars xs) == True
  23768. 1659.40 s [algebraic-graphs]
  23769. 1659.40 s [algebraic-graphs] ============ Symmetric.Relation.Show ============
  23770. 1659.40 s [algebraic-graphs] OK: show (empty ) == "empty"
  23771. 1659.40 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  23772. 1659.40 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  23773. 1659.40 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  23774. 1659.40 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  23775. 1659.40 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  23776. 1659.40 s [algebraic-graphs]
  23777. 1659.40 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  23778. 1659.40 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  23779. 1659.40 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  23780. 1659.40 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  23781. 1659.40 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  23782. 1659.40 s [algebraic-graphs]
  23783. 1659.40 s [algebraic-graphs] OK: show (2 * 1 ) == "edge 1 2"
  23784. 1659.40 s [algebraic-graphs] OK: show (1 * 2 * 1) == "edges [(1,1),(1,2)]"
  23785. 1659.40 s [algebraic-graphs] OK: show (3 * 2 * 1) == "edges [(1,2),(1,3),(2,3)]"
  23786. 1659.40 s [algebraic-graphs]
  23787. 1659.40 s [algebraic-graphs] ============ Symmetric.Relation.toSymmetric ============
  23788. 1659.40 s [algebraic-graphs] OK: toSymmetric (edge 1 2) == edge 1 2
  23789. 1659.40 s [algebraic-graphs] OK: toSymmetric . fromSymmetric == id
  23790. 1659.40 s [algebraic-graphs] OK: fromSymmetric . toSymmetric == symmetricClosure
  23791. 1659.40 s [algebraic-graphs] OK: vertexCount . toSymmetric == vertexCount
  23792. 1659.40 s [algebraic-graphs] OK: (*2) . edgeCount . toSymmetric >= edgeCount
  23793. 1659.40 s [algebraic-graphs]
  23794. 1659.40 s [algebraic-graphs] ============ Symmetric.Relation.fromSymmetric ============
  23795. 1659.40 s [algebraic-graphs] OK: fromSymmetric (edge 1 2) == edges [(1,2), (2,1)]
  23796. 1659.40 s [algebraic-graphs] OK: vertexCount . fromSymmetric == vertexCount
  23797. 1659.40 s [algebraic-graphs] OK: edgeCount . fromSymmetric <= (*2) . edgeCount
  23798. 1659.40 s [algebraic-graphs]
  23799. 1659.40 s [algebraic-graphs] ============ Symmetric.Relation.Ord ============
  23800. 1659.40 s [algebraic-graphs] OK: vertex 1 < vertex 2
  23801. 1659.40 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  23802. 1659.40 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  23803. 1659.40 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  23804. 1659.40 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  23805. 1659.40 s [algebraic-graphs] OK: edge 2 1 < edge 1 3
  23806. 1659.40 s [algebraic-graphs] OK: edge 1 2 == edge 2 1
  23807. 1659.40 s [algebraic-graphs] OK: x <= x + y
  23808. 1659.40 s [algebraic-graphs] OK: x + y <= x * y
  23809. 1659.40 s [algebraic-graphs]
  23810. 1659.40 s [algebraic-graphs] ============ Symmetric.Relation.empty ============
  23811. 1659.40 s [algebraic-graphs] OK: isEmpty empty == True
  23812. 1659.40 s [algebraic-graphs] OK: hasVertex x empty == False
  23813. 1659.40 s [algebraic-graphs] OK: vertexCount empty == 0
  23814. 1659.40 s [algebraic-graphs] OK: edgeCount empty == 0
  23815. 1659.40 s [algebraic-graphs]
  23816. 1659.40 s [algebraic-graphs] ============ Symmetric.Relation.vertex ============
  23817. 1659.40 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  23818. 1659.40 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  23819. 1659.40 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  23820. 1659.40 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  23821. 1659.40 s [algebraic-graphs]
  23822. 1659.40 s [algebraic-graphs] ============ Symmetric.Relation.edge ============
  23823. 1659.40 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  23824. 1659.40 s [algebraic-graphs] OK: edge x y == edge y x
  23825. 1659.40 s [algebraic-graphs] OK: edge x y == edges [(x,y), (y,x)]
  23826. 1659.40 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  23827. 1659.40 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  23828. 1659.40 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  23829. 1659.40 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  23830. 1659.40 s [algebraic-graphs]
  23831. 1659.40 s [algebraic-graphs] ============ Symmetric.Relation.overlay ============
  23832. 1659.40 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  23833. 1659.40 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  23834. 1659.40 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  23835. 1659.40 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  23836. 1659.40 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  23837. 1659.40 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  23838. 1659.40 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  23839. 1659.40 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  23840. 1659.40 s [algebraic-graphs]
  23841. 1659.40 s [algebraic-graphs] ============ Symmetric.Relation.connect ============
  23842. 1659.40 s [algebraic-graphs] OK: connect x y == connect y x
  23843. 1659.40 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  23844. 1659.40 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  23845. 1659.40 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  23846. 1659.40 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  23847. 1659.40 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  23848. 1659.40 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  23849. 1659.40 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y `div` 2
  23850. 1659.40 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  23851. 1659.40 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  23852. 1659.40 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  23853. 1659.40 s [algebraic-graphs]
  23854. 1659.40 s [algebraic-graphs] ============ Symmetric.Relation.vertices ============
  23855. 1659.40 s [algebraic-graphs] OK: vertices [] == empty
  23856. 1659.40 s [algebraic-graphs] OK: vertices [x] == vertex x
  23857. 1659.40 s [algebraic-graphs] OK: vertices == overlays . map vertex
  23858. 1659.40 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  23859. 1659.40 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  23860. 1659.40 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  23861. 1659.40 s [algebraic-graphs]
  23862. 1659.40 s [algebraic-graphs] ============ Symmetric.Relation.edges ============
  23863. 1659.40 s [algebraic-graphs] OK: edges [] == empty
  23864. 1659.40 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  23865. 1659.40 s [algebraic-graphs] OK: edges [(x,y), (y,x)] == edge x y
  23866. 1659.40 s [algebraic-graphs]
  23867. 1659.40 s [algebraic-graphs] ============ Symmetric.Relation.overlays ============
  23868. 1659.40 s [algebraic-graphs] OK: overlays [] == empty
  23869. 1673.84 s [algebraic-graphs] OK: overlays [x] == x
  23870. 1673.85 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  23871. 1673.85 s [algebraic-graphs] OK: overlays == foldr overlay empty
  23872. 1673.85 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  23873. 1673.85 s [algebraic-graphs]
  23874. 1673.85 s [algebraic-graphs] ============ Symmetric.Relation.connects ============
  23875. 1673.85 s [algebraic-graphs] OK: connects [] == empty
  23876. 1673.85 s [algebraic-graphs] OK: connects [x] == x
  23877. 1673.85 s [algebraic-graphs] OK: connects [x,y] == connect x y
  23878. 1673.85 s [algebraic-graphs] OK: connects == foldr connect empty
  23879. 1673.85 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  23880. 1673.85 s [algebraic-graphs] OK: connects == connects . reverse
  23881. 1673.85 s [algebraic-graphs]
  23882. 1673.85 s [algebraic-graphs] ============ Symmetric.Relation.isSubgraphOf ============
  23883. 1673.85 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  23884. 1673.85 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  23885. 1673.85 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  23886. 1673.85 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  23887. 1673.85 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  23888. 1673.85 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  23889. 1673.85 s [algebraic-graphs] OK: isSubgraphOf (edge x y) (edge y x) == True
  23890. 1673.85 s [algebraic-graphs]
  23891. 1673.85 s [algebraic-graphs] ============ Symmetric.Relation.toGraph et al. ============
  23892. 1673.85 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  23893. 1673.85 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  23894. 1673.85 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  23895. 1673.85 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  23896. 1673.85 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  23897. 1673.85 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  23898. 1673.85 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  23899. 1673.85 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  23900. 1673.85 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  23901. 1673.85 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  23902. 1673.85 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  23903. 1673.86 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  23904. 1673.86 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  23905. 1673.86 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  23906. 1673.86 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  23907. 1673.86 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  23908. 1673.86 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  23909. 1673.86 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  23910. 1673.86 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  23911. 1673.86 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  23912. 1673.86 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  23913. 1673.86 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  23914. 1673.86 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  23915. 1673.86 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  23916. 1673.86 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  23917. 1673.86 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  23918. 1673.86 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  23919. 1673.86 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  23920. 1673.86 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  23921. 1673.86 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  23922. 1673.86 s [algebraic-graphs]
  23923. 1673.86 s [algebraic-graphs] ============ Symmetric.Relation.isEmpty ============
  23924. 1673.86 s [algebraic-graphs] OK: isEmpty empty == True
  23925. 1673.86 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  23926. 1673.86 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  23927. 1673.86 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  23928. 1673.86 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  23929. 1673.86 s [algebraic-graphs]
  23930. 1673.86 s [algebraic-graphs] ============ Symmetric.Relation.hasVertex ============
  23931. 1673.86 s [algebraic-graphs] OK: hasVertex x empty == False
  23932. 1673.86 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  23933. 1673.86 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  23934. 1673.86 s [algebraic-graphs]
  23935. 1673.86 s [algebraic-graphs] ============ Symmetric.Relation.hasEdge ============
  23936. 1673.86 s [algebraic-graphs] OK: hasEdge x y empty == False
  23937. 1673.86 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  23938. 1673.86 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  23939. 1673.86 s [algebraic-graphs] OK: hasEdge x y (edge y x) == True
  23940. 1673.86 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  23941. 1673.86 s [algebraic-graphs] OK: hasEdge x y == elem (min x y, max x y) . edgeList
  23942. 1673.86 s [algebraic-graphs]
  23943. 1673.86 s [algebraic-graphs] ============ Symmetric.Relation.vertexCount ============
  23944. 1673.86 s [algebraic-graphs] OK: vertexCount empty == 0
  23945. 1673.86 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  23946. 1673.86 s [algebraic-graphs] OK: vertexCount == length . vertexList
  23947. 1673.86 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  23948. 1673.86 s [algebraic-graphs]
  23949. 1673.86 s [algebraic-graphs] ============ Symmetric.Relation.edgeCount ============
  23950. 1673.86 s [algebraic-graphs] OK: edgeCount empty == 0
  23951. 1673.86 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  23952. 1673.86 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  23953. 1673.86 s [algebraic-graphs] OK: edgeCount == length . edgeList
  23954. 1673.86 s [algebraic-graphs]
  23955. 1673.86 s [algebraic-graphs] ============ Symmetric.Relation.vertexList ============
  23956. 1673.86 s [algebraic-graphs] OK: vertexList empty == []
  23957. 1673.86 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  23958. 1673.86 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  23959. 1673.86 s [algebraic-graphs]
  23960. 1673.86 s [algebraic-graphs] ============ Symmetric.Relation.vertexSet ============
  23961. 1673.86 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  23962. 1673.86 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  23963. 1673.86 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  23964. 1673.86 s [algebraic-graphs]
  23965. 1673.86 s [algebraic-graphs] ============ Symmetric.Relation.vertexIntSet ============
  23966. 1673.86 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  23967. 1673.86 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  23968. 1673.86 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  23969. 1673.86 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  23970. 1673.86 s [algebraic-graphs]
  23971. 1673.86 s [algebraic-graphs] ============ Symmetric.Relation.edgeList ============
  23972. 1673.86 s [algebraic-graphs] OK: edgeList empty == []
  23973. 1673.86 s [algebraic-graphs] OK: edgeList (vertex x) == []
  23974. 1673.86 s [algebraic-graphs] OK: edgeList (edge x y) == [(min x y, max y x)]
  23975. 1673.86 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(1,2), (2,3)]
  23976. 1673.86 s [algebraic-graphs]
  23977. 1673.86 s [algebraic-graphs] ============ Symmetric.Relation.edgeSet ============
  23978. 1673.86 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  23979. 1673.86 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  23980. 1673.86 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (min x y, max x y)
  23981. 1673.86 s [algebraic-graphs]
  23982. 1673.86 s [algebraic-graphs] ============ Symmetric.Relation.adjacencyList ============
  23983. 1673.86 s [algebraic-graphs] OK: adjacencyList empty == []
  23984. 1673.86 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  23985. 1673.86 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [1])]
  23986. 1673.86 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, [2]), (2, [1,3]), (3, [2])]
  23987. 1673.86 s [algebraic-graphs]
  23988. 1673.86 s [algebraic-graphs] ============ Symmetric.Relation.neighbours ============
  23989. 1673.86 s [algebraic-graphs] OK: neighbours x empty == Set.empty
  23990. 1673.86 s [algebraic-graphs] OK: neighbours x (vertex x) == Set.empty
  23991. 1673.86 s [algebraic-graphs] OK: neighbours x (edge x y) == Set.fromList [y]
  23992. 1673.86 s [algebraic-graphs] OK: neighbours y (edge x y) == Set.fromList [x]
  23993. 1673.86 s [algebraic-graphs]
  23994. 1673.86 s [algebraic-graphs] ============ Symmetric.Relation.path ============
  23995. 1673.86 s [algebraic-graphs] OK: path [] == empty
  23996. 1673.86 s [algebraic-graphs] OK: path [x] == vertex x
  23997. 1673.86 s [algebraic-graphs] OK: path [x,y] == edge x y
  23998. 1673.86 s [algebraic-graphs] OK: path == path . reverse
  23999. 1673.86 s [algebraic-graphs]
  24000. 1673.86 s [algebraic-graphs] ============ Symmetric.Relation.circuit ============
  24001. 1673.86 s [algebraic-graphs] OK: circuit [] == empty
  24002. 1673.86 s [algebraic-graphs] OK: circuit [x] == edge x x
  24003. 1673.86 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  24004. 1673.86 s [algebraic-graphs] OK: circuit == circuit . reverse
  24005. 1673.86 s [algebraic-graphs]
  24006. 1673.86 s [algebraic-graphs] ============ Symmetric.Relation.clique ============
  24007. 1673.86 s [algebraic-graphs] OK: clique [] == empty
  24008. 1673.86 s [algebraic-graphs] OK: clique [x] == vertex x
  24009. 1673.86 s [algebraic-graphs] OK: clique [x,y] == edge x y
  24010. 1673.86 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  24011. 1673.86 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  24012. 1673.86 s [algebraic-graphs] OK: clique == clique . reverse
  24013. 1673.86 s [algebraic-graphs]
  24014. 1673.86 s [algebraic-graphs] ============ Symmetric.Relation.biclique ============
  24015. 1673.86 s [algebraic-graphs] OK: biclique [] [] == empty
  24016. 1673.86 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  24017. 1673.86 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  24018. 1673.86 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  24019. 1673.86 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  24020. 1673.86 s [algebraic-graphs]
  24021. 1673.86 s [algebraic-graphs] ============ Symmetric.Relation.star ============
  24022. 1673.86 s [algebraic-graphs] OK: star x [] == vertex x
  24023. 1673.86 s [algebraic-graphs] OK: star x [y] == edge x y
  24024. 1673.86 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  24025. 1673.86 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  24026. 1673.86 s [algebraic-graphs]
  24027. 1673.86 s [algebraic-graphs] ============ Symmetric.Relation.stars ============
  24028. 1673.86 s [algebraic-graphs] OK: stars [] == empty
  24029. 1673.86 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  24030. 1673.86 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  24031. 1673.86 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  24032. 1673.86 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  24033. 1673.86 s [algebraic-graphs] OK: stars . adjacencyList == id
  24034. 1673.86 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  24035. 1673.86 s [algebraic-graphs]
  24036. 1673.86 s [algebraic-graphs] ============ Symmetric.Relation.tree ============
  24037. 1673.86 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  24038. 1673.86 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  24039. 1673.86 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  24040. 1673.86 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  24041. 1673.86 s [algebraic-graphs]
  24042. 1673.86 s [algebraic-graphs] ============ Symmetric.Relation.forest ============
  24043. 1673.86 s [algebraic-graphs] OK: forest [] == empty
  24044. 1681.37 s [algebraic-graphs] OK: forest [x] == tree x
  24045. 1681.37 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  24046. 1681.38 s [algebraic-graphs] OK: forest == overlays . map tree
  24047. 1681.38 s [algebraic-graphs]
  24048. 1681.38 s [algebraic-graphs] ============ Symmetric.Relation.removeVertex ============
  24049. 1681.38 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  24050. 1681.38 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  24051. 1681.38 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  24052. 1681.38 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  24053. 1681.38 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  24054. 1681.38 s [algebraic-graphs]
  24055. 1681.38 s [algebraic-graphs] ============ Symmetric.Relation.removeEdge ============
  24056. 1681.38 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  24057. 1681.38 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  24058. 1681.38 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  24059. 1681.38 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  24060. 1681.38 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  24061. 1681.38 s [algebraic-graphs] OK: removeEdge x y == removeEdge y x
  24062. 1681.38 s [algebraic-graphs]
  24063. 1681.38 s [algebraic-graphs] ============ Symmetric.Relation.replaceVertex ============
  24064. 1681.38 s [algebraic-graphs] OK: replaceVertex x x == id
  24065. 1681.38 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  24066. 1681.38 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  24067. 1681.38 s [algebraic-graphs]
  24068. 1681.38 s [algebraic-graphs] ============ Symmetric.Relation.mergeVertices ============
  24069. 1681.38 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  24070. 1681.38 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  24071. 1681.38 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  24072. 1681.38 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  24073. 1681.38 s [algebraic-graphs]
  24074. 1681.38 s [algebraic-graphs] ============ Symmetric.Relation.gmap ============
  24075. 1681.38 s [algebraic-graphs] OK: gmap f empty == empty
  24076. 1681.38 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  24077. 1681.38 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  24078. 1681.38 s [algebraic-graphs] OK: gmap id == id
  24079. 1681.38 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  24080. 1681.38 s [algebraic-graphs]
  24081. 1681.38 s [algebraic-graphs] ============ Symmetric.Relation.induce ============
  24082. 1681.38 s [algebraic-graphs] OK: induce (const True ) x == x
  24083. 1681.38 s [algebraic-graphs] OK: induce (const False) x == empty
  24084. 1681.38 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  24085. 1681.38 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  24086. 1681.38 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  24087. 1681.38 s [algebraic-graphs]
  24088. 1681.38 s [algebraic-graphs] ============ Symmetric.Relation.induceJust ============
  24089. 1681.38 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  24090. 1681.38 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  24091. 1681.38 s [algebraic-graphs] OK: induceJust . gmap Just == id
  24092. 1681.38 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  24093. 1681.38 s [algebraic-graphs]
  24094. 1681.38 s [algebraic-graphs] ============ Example.Todo (Holiday) ============
  24095. 1681.38 s [algebraic-graphs] OK: A todo list is semantically Maybe [a]
  24096. 1681.38 s [algebraic-graphs] OK: The overlay operator (+) adds non-dependent items to the todo list
  24097. 1681.38 s [algebraic-graphs] OK: The connect operator (*) adds dependency between items
  24098. 1681.38 s [algebraic-graphs] OK: Contradictory constraints make the todo list impossible to schedule
  24099. 1681.38 s [algebraic-graphs] OK: Introduce item priority to schedule the todo list
  24100. 1681.38 s [algebraic-graphs] OK: Custom connect operators pull/repel arguments during scheduling
  24101. 1681.38 s [algebraic-graphs]
  24102. 1681.38 s [algebraic-graphs] ============ Example.Todo (Commandline) ============
  24103. 1681.38 s [algebraic-graphs] OK: The pull connect operator maintains command line semantics
  24104. 1681.39 s [algebraic-graphs] OK: Swapping flags are allowed by the commutative overlay opeartor
  24105. 1681.39 s [algebraic-graphs] OK: The usual connect operator breaks semantics
  24106. 1681.39 s [algebraic-graphs] OK: Transform command lines by adding optimisation flag
  24107. 1681.39 s [algebraic-graphs]
  24108. 1681.39 s [algebraic-graphs] ============ Typed ============
  24109. 1681.39 s [algebraic-graphs]
  24110. 1681.39 s [algebraic-graphs] ============ Typed.fromAdjacencyMap ============
  24111. 1681.39 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyMap (1 * 2 + 3 * 1)) == array (0,2) [(0,[1]), (1,[]), (2,[0])]
  24112. 1681.39 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyMap (1 * 2 + 2 * 1)) == array (0,1) [(0,[1]), (1,[0])]
  24113. 1681.39 s [algebraic-graphs] OK: map (fromVertexKL h) (vertices $ toGraphKL h) == vertexList g
  24114. 1681.39 s [algebraic-graphs] OK: map (\(x, y) -> (fromVertexKL h x, fromVertexKL h y)) (edges $ toGraphKL h) == edgeList g
  24115. 1681.39 s [algebraic-graphs]
  24116. 1681.39 s [algebraic-graphs] ============ Typed.fromAdjacencyIntMap ============
  24117. 1681.39 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyIntMap (1 * 2 + 3 * 1)) == array (0,2) [(0,[1]), (1,[]), (2,[0])]
  24118. 1681.39 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyIntMap (1 * 2 + 2 * 1)) == array (0,1) [(0,[1]), (1,[0])]
  24119. 1681.39 s [algebraic-graphs] OK: map (fromVertexKL h) (vertices $ toGraphKL h) == IntSet.toAscList (vertexIntSet g)
  24120. 1681.39 s [algebraic-graphs] OK: map (\(x, y) -> (fromVertexKL h x, fromVertexKL h y)) (edges $ toGraphKL h) == edgeList g
  24121. 1681.39 s [algebraic-graphs]
  24122. 1681.39 s [algebraic-graphs] ============ Typed.dfsForest ============
  24123. 1681.39 s [algebraic-graphs] OK: forest (dfsForest % edge 1 1) == vertex 1
  24124. 1681.39 s [algebraic-graphs] OK: forest (dfsForest % edge 1 2) == edge 1 2
  24125. 1681.39 s [algebraic-graphs] OK: forest (dfsForest % edge 2 1) == vertices [1, 2]
  24126. 1681.39 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForest % x) x == True
  24127. 1681.39 s [algebraic-graphs] OK: dfsForest % forest (dfsForest % x) == dfsForest % x
  24128. 1681.39 s [algebraic-graphs] OK: dfsForest % vertices vs == map (\v -> Node v []) (nub $ sort vs)
  24129. 1681.39 s [algebraic-graphs] OK: dfsForest % (3 * (1 + 4) * (1 + 5)) == <correct result>
  24130. 1681.39 s [algebraic-graphs]
  24131. 1681.39 s [algebraic-graphs] ============ Typed.dfsForestFrom ============
  24132. 1681.39 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 1) [1] == vertex 1
  24133. 1681.39 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [0] == empty
  24134. 1681.39 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [1] == edge 1 2
  24135. 1681.39 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [2] == vertex 2
  24136. 1681.39 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [2,1] == vertices [1,2]
  24137. 1681.39 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForestFrom % x $ vs) x == True
  24138. 1681.39 s [algebraic-graphs] OK: dfsForestFrom % x $ vertexList x == dfsForest % x
  24139. 1681.39 s [algebraic-graphs] OK: dfsForestFrom % vertices vs $ vs == map (\v -> Node v []) (nub vs)
  24140. 1681.39 s [algebraic-graphs] OK: dfsForestFrom % x $ [] == []
  24141. 1681.39 s [algebraic-graphs] OK: dfsForestFrom % (3 * (1 + 4) * (1 + 5)) $ [1,4] == <correct result>
  24142. 1681.39 s [algebraic-graphs]
  24143. 1681.39 s [algebraic-graphs] ============ Typed.dfs ============
  24144. 1681.39 s [algebraic-graphs] OK: dfs % edge 1 1 $ [1] == [1]
  24145. 1681.39 s [algebraic-graphs] OK: dfs % edge 1 2 $ [0] == []
  24146. 1681.39 s [algebraic-graphs] OK: dfs % edge 1 2 $ [1] == [1,2]
  24147. 1681.39 s [algebraic-graphs] OK: dfs % edge 1 2 $ [2] == [2]
  24148. 1681.39 s [algebraic-graphs] OK: dfs % edge 1 2 $ [1,2] == [1,2]
  24149. 1681.39 s [algebraic-graphs] OK: dfs % edge 1 2 $ [2,1] == [2,1]
  24150. 1681.39 s [algebraic-graphs] OK: dfs % x $ [] == []
  24151. 1681.39 s [algebraic-graphs]
  24152. 1681.39 s [algebraic-graphs] OK: dfs % (3 * (1 + 4) * (1 + 5)) $ [1,4] == [1,5,4]
  24153. 1681.39 s [algebraic-graphs] OK: and [ hasVertex v x | v <- dfs % x $ vs ] == True
  24154. 1681.39 s [algebraic-graphs]
  24155. 1681.39 s [algebraic-graphs] ============ Typed.topSort ============
  24156. 1681.39 s [algebraic-graphs] OK: topSort % (1 * 2 + 3 * 1) == [3,1,2]
  24157. 1681.39 s [algebraic-graphs] OK: topSort % (1 * 2 + 2 * 1) == [1,2]
  24158. 1681.39 s [algebraic-graphs]
  24159. 1681.39 s [algebraic-graphs] ============ Graph.Undirected ============
  24160. 1681.39 s [algebraic-graphs] OK: Axioms of undirected graphs
  24161. 1681.39 s [algebraic-graphs]
  24162. 1681.39 s [algebraic-graphs] ============ Graph.Undirected.Show ============
  24163. 1681.39 s [algebraic-graphs] OK: show (empty ) == "empty"
  24164. 1681.39 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  24165. 1681.39 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  24166. 1681.39 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  24167. 1681.39 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  24168. 1681.39 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  24169. 1681.39 s [algebraic-graphs]
  24170. 1681.39 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  24171. 1681.39 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  24172. 1681.39 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  24173. 1681.39 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  24174. 1681.39 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  24175. 1681.39 s [algebraic-graphs]
  24176. 1681.39 s [algebraic-graphs] OK: show (2 * 1 ) == "edge 1 2"
  24177. 1681.39 s [algebraic-graphs] OK: show (1 * 2 * 1) == "edges [(1,1),(1,2)]"
  24178. 1681.39 s [algebraic-graphs] OK: show (3 * 2 * 1) == "edges [(1,2),(1,3),(2,3)]"
  24179. 1681.39 s [algebraic-graphs]
  24180. 1681.39 s [algebraic-graphs] ============ Graph.Undirected.toUndirected ============
  24181. 1681.39 s [algebraic-graphs] OK: toUndirected (edge 1 2) == edge 1 2
  24182. 1681.39 s [algebraic-graphs] OK: toUndirected . fromUndirected == id
  24183. 1681.39 s [algebraic-graphs] OK: vertexCount . toUndirected == vertexCount
  24184. 1681.39 s [algebraic-graphs] OK: (*2) . edgeCount . toUndirected >= edgeCount
  24185. 1681.39 s [algebraic-graphs]
  24186. 1681.39 s [algebraic-graphs] ============ Graph.Undirected.fromUndirected ============
  24187. 1681.39 s [algebraic-graphs] OK: fromUndirected (edge 1 2) == edges [(1,2),(2,1)]
  24188. 1681.39 s [algebraic-graphs] OK: toUndirected . fromUndirected == id
  24189. 1681.39 s [algebraic-graphs] OK: vertexCount . fromUndirected == vertexCount
  24190. 1681.39 s [algebraic-graphs] OK: edgeCount . fromUndirected <= (*2) . edgeCount
  24191. 1681.39 s [algebraic-graphs]
  24192. 1681.39 s [algebraic-graphs] ============ Graph.Undirected.complement ================
  24193. 1681.39 s [algebraic-graphs] OK: complement empty == empty
  24194. 1681.39 s [algebraic-graphs] OK: complement (vertex x) == vertex x
  24195. 1681.39 s [algebraic-graphs] OK: complement (edge 1 1) == edge 1 1
  24196. 1681.39 s [algebraic-graphs] OK: complement (edge 1 2) == vertices [1, 2]
  24197. 1681.39 s [algebraic-graphs] OK: complement (star 1 [2, 3]) == overlay (vertex 1) (edge 2 3)
  24198. 1681.39 s [algebraic-graphs] OK: complement . complement == id
  24199. 1681.39 s [algebraic-graphs]
  24200. 1681.39 s [algebraic-graphs] ============ Graph.Undirected.Ord ============
  24201. 1681.39 s [algebraic-graphs] OK: vertex 1 < vertex 2
  24202. 1681.39 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  24203. 1681.39 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  24204. 1681.39 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  24205. 1681.39 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  24206. 1681.39 s [algebraic-graphs] OK: edge 2 1 < edge 1 3
  24207. 1681.39 s [algebraic-graphs] OK: edge 1 2 == edge 2 1
  24208. 1681.39 s [algebraic-graphs] OK: x <= x + y
  24209. 1681.39 s [algebraic-graphs] OK: x + y <= x * y
  24210. 1681.39 s [algebraic-graphs]
  24211. 1681.39 s [algebraic-graphs] ============ Graph.Undirected.empty ============
  24212. 1681.39 s [algebraic-graphs] OK: isEmpty empty == True
  24213. 1681.39 s [algebraic-graphs] OK: hasVertex x empty == False
  24214. 1681.39 s [algebraic-graphs] OK: vertexCount empty == 0
  24215. 1681.39 s [algebraic-graphs] OK: edgeCount empty == 0
  24216. 1681.39 s [algebraic-graphs]
  24217. 1681.39 s [algebraic-graphs] ============ Graph.Undirected.vertex ============
  24218. 1681.39 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  24219. 1681.39 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  24220. 1681.39 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  24221. 1681.39 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  24222. 1681.39 s [algebraic-graphs]
  24223. 1681.39 s [algebraic-graphs] ============ Graph.Undirected.edge ============
  24224. 1681.39 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  24225. 1681.39 s [algebraic-graphs] OK: edge x y == edge y x
  24226. 1692.04 s [algebraic-graphs] OK: edge x y == edges [(x,y), (y,x)]
  24227. 1692.04 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  24228. 1692.04 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  24229. 1692.05 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  24230. 1692.05 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  24231. 1692.05 s [algebraic-graphs]
  24232. 1692.05 s [algebraic-graphs] ============ Graph.Undirected.overlay ============
  24233. 1692.05 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  24234. 1692.05 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  24235. 1692.05 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  24236. 1692.05 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  24237. 1692.05 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  24238. 1692.05 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  24239. 1692.05 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  24240. 1692.05 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  24241. 1692.05 s [algebraic-graphs]
  24242. 1692.05 s [algebraic-graphs] ============ Graph.Undirected.connect ============
  24243. 1692.05 s [algebraic-graphs] OK: connect x y == connect y x
  24244. 1692.05 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  24245. 1692.05 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  24246. 1692.05 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  24247. 1692.05 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  24248. 1692.05 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  24249. 1692.05 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  24250. 1692.05 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y `div` 2
  24251. 1692.05 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  24252. 1692.05 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  24253. 1692.05 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  24254. 1692.05 s [algebraic-graphs]
  24255. 1692.05 s [algebraic-graphs] ============ Graph.Undirected.vertices ============
  24256. 1692.05 s [algebraic-graphs] OK: vertices [] == empty
  24257. 1692.05 s [algebraic-graphs] OK: vertices [x] == vertex x
  24258. 1692.05 s [algebraic-graphs] OK: vertices == overlays . map vertex
  24259. 1692.05 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  24260. 1692.05 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  24261. 1692.05 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  24262. 1692.05 s [algebraic-graphs]
  24263. 1692.05 s [algebraic-graphs] ============ Graph.Undirected.edges ============
  24264. 1692.05 s [algebraic-graphs] OK: edges [] == empty
  24265. 1692.05 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  24266. 1692.05 s [algebraic-graphs] OK: edges [(x,y), (y,x)] == edge x y
  24267. 1692.05 s [algebraic-graphs]
  24268. 1692.05 s [algebraic-graphs] ============ Graph.Undirected.overlays ============
  24269. 1692.05 s [algebraic-graphs] OK: overlays [] == empty
  24270. 1692.05 s [algebraic-graphs] OK: overlays [x] == x
  24271. 1692.05 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  24272. 1692.05 s [algebraic-graphs] OK: overlays == foldr overlay empty
  24273. 1692.05 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  24274. 1692.05 s [algebraic-graphs]
  24275. 1692.05 s [algebraic-graphs] ============ Graph.Undirected.connects ============
  24276. 1692.05 s [algebraic-graphs] OK: connects [] == empty
  24277. 1692.05 s [algebraic-graphs] OK: connects [x] == x
  24278. 1692.05 s [algebraic-graphs] OK: connects [x,y] == connect x y
  24279. 1692.06 s [algebraic-graphs] OK: connects == foldr connect empty
  24280. 1692.06 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  24281. 1692.06 s [algebraic-graphs] OK: connects == connects . reverse
  24282. 1692.06 s [algebraic-graphs]
  24283. 1692.06 s [algebraic-graphs] ============ Graph.Undirected.isSubgraphOf ============
  24284. 1692.06 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  24285. 1692.06 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  24286. 1692.06 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  24287. 1692.06 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  24288. 1692.06 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  24289. 1692.06 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  24290. 1692.06 s [algebraic-graphs] OK: isSubgraphOf (edge x y) (edge y x) == True
  24291. 1692.06 s [algebraic-graphs]
  24292. 1692.06 s [algebraic-graphs] ============ Graph.Undirected.path ============
  24293. 1692.06 s [algebraic-graphs] OK: path [] == empty
  24294. 1692.06 s [algebraic-graphs] OK: path [x] == vertex x
  24295. 1692.06 s [algebraic-graphs] OK: path [x,y] == edge x y
  24296. 1692.06 s [algebraic-graphs] OK: path == path . reverse
  24297. 1692.06 s [algebraic-graphs]
  24298. 1692.06 s [algebraic-graphs] ============ Graph.Undirected.circuit ============
  24299. 1692.06 s [algebraic-graphs] OK: circuit [] == empty
  24300. 1692.06 s [algebraic-graphs] OK: circuit [x] == edge x x
  24301. 1692.06 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  24302. 1692.06 s [algebraic-graphs] OK: circuit == circuit . reverse
  24303. 1692.06 s [algebraic-graphs]
  24304. 1692.06 s [algebraic-graphs] ============ Graph.Undirected.clique ============
  24305. 1692.06 s [algebraic-graphs] OK: clique [] == empty
  24306. 1692.06 s [algebraic-graphs] OK: clique [x] == vertex x
  24307. 1692.06 s [algebraic-graphs] OK: clique [x,y] == edge x y
  24308. 1692.06 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  24309. 1692.06 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  24310. 1692.06 s [algebraic-graphs] OK: clique == clique . reverse
  24311. 1692.06 s [algebraic-graphs]
  24312. 1692.06 s [algebraic-graphs] ============ Graph.Undirected.biclique ============
  24313. 1692.06 s [algebraic-graphs] OK: biclique [] [] == empty
  24314. 1692.06 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  24315. 1692.06 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  24316. 1692.06 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  24317. 1692.06 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  24318. 1692.06 s [algebraic-graphs]
  24319. 1692.06 s [algebraic-graphs] ============ Graph.Undirected.star ============
  24320. 1692.06 s [algebraic-graphs] OK: star x [] == vertex x
  24321. 1692.06 s [algebraic-graphs] OK: star x [y] == edge x y
  24322. 1692.06 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  24323. 1692.06 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  24324. 1692.06 s [algebraic-graphs]
  24325. 1692.06 s [algebraic-graphs] ============ Graph.Undirected.stars ============
  24326. 1692.06 s [algebraic-graphs] OK: stars [] == empty
  24327. 1692.06 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  24328. 1692.06 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  24329. 1692.06 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  24330. 1692.06 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  24331. 1692.06 s [algebraic-graphs] OK: stars . adjacencyList == id
  24332. 1692.06 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  24333. 1692.06 s [algebraic-graphs]
  24334. 1692.06 s [algebraic-graphs] ============ Graph.Undirected.tree ============
  24335. 1692.06 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  24336. 1692.06 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  24337. 1692.06 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  24338. 1692.06 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  24339. 1692.06 s [algebraic-graphs]
  24340. 1692.06 s [algebraic-graphs] ============ Graph.Undirected.forest ============
  24341. 1692.06 s [algebraic-graphs] OK: forest [] == empty
  24342. 1692.06 s [algebraic-graphs] OK: forest [x] == tree x
  24343. 1692.06 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  24344. 1692.06 s [algebraic-graphs] OK: forest == overlays . map tree
  24345. 1692.06 s [algebraic-graphs]
  24346. 1692.06 s [algebraic-graphs] ============ Graph.Undirected.removeVertex ============
  24347. 1692.06 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  24348. 1692.06 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  24349. 1692.06 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  24350. 1692.06 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  24351. 1692.06 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  24352. 1692.06 s [algebraic-graphs]
  24353. 1692.06 s [algebraic-graphs] ============ Graph.Undirected.removeEdge ============
  24354. 1692.06 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  24355. 1692.06 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  24356. 1692.06 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  24357. 1692.06 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  24358. 1692.06 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  24359. 1692.06 s [algebraic-graphs] OK: removeEdge x y == removeEdge y x
  24360. 1692.06 s [algebraic-graphs]
  24361. 1692.06 s [algebraic-graphs] ============ Graph.Undirected.replaceVertex ============
  24362. 1692.06 s [algebraic-graphs] OK: replaceVertex x x == id
  24363. 1692.06 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  24364. 1692.06 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  24365. 1692.06 s [algebraic-graphs]
  24366. 1692.06 s [algebraic-graphs] ============ Graph.Undirected.mergeVertices ============
  24367. 1692.06 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  24368. 1692.06 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  24369. 1692.06 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  24370. 1692.06 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  24371. 1692.06 s [algebraic-graphs]
  24372. 1692.06 s [algebraic-graphs] ============ Graph.Undirected.gmap ============
  24373. 1692.06 s [algebraic-graphs] OK: gmap f empty == empty
  24374. 1692.06 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  24375. 1692.06 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  24376. 1692.06 s [algebraic-graphs] OK: gmap id == id
  24377. 1692.06 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  24378. 1692.06 s [algebraic-graphs]
  24379. 1692.06 s [algebraic-graphs] ============ Graph.Undirected.induce ============
  24380. 1692.06 s [algebraic-graphs] OK: induce (const True ) x == x
  24381. 1692.06 s [algebraic-graphs] OK: induce (const False) x == empty
  24382. 1692.06 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  24383. 1692.06 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  24384. 1692.06 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  24385. 1692.06 s [algebraic-graphs]
  24386. 1692.06 s [algebraic-graphs] ============ Graph.Undirected.induceJust ============
  24387. 1692.06 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  24388. 1692.06 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  24389. 1692.06 s [algebraic-graphs] OK: induceJust . gmap Just == id
  24390. 1692.06 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  24391. 1692.06 s [algebraic-graphs] Test suite main: PASS
  24392. 1692.06 s [algebraic-graphs] Test suite logged to: dist/test/algebraic-graphs-0.7-main.log
  24393. 1692.06 s [algebraic-graphs] 1 of 1 test suites (1 of 1 test cases) passed.
  24394. 1692.07 s [algebraic-graphs] checkPhase completed in 2 minutes 39 seconds
  24395. 1692.07 s [algebraic-graphs] Phase: haddockPhase
  24396. 1692.32 s [algebraic-graphs] Preprocessing library for algebraic-graphs-0.7..
  24397. 1692.33 s [algebraic-graphs] Running Haddock on library for algebraic-graphs-0.7..
  24398. 1692.41 s [algebraic-graphs] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
  24399. 1692.93 s [algebraic-graphs] 100% ( 58 / 58) in 'Algebra.Graph.AdjacencyMap'
  24400. 1693.05 s [algebraic-graphs] 100% ( 56 / 56) in 'Algebra.Graph.AdjacencyIntMap'
  24401. 1693.13 s [algebraic-graphs] Warning: 'nub' is out of scope.
  24402. 1693.13 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24403. 1693.13 s [algebraic-graphs] Warning: 'sort' is out of scope.
  24404. 1693.13 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24405. 1693.13 s [algebraic-graphs] 93% ( 14 / 15) in 'Algebra.Graph.AdjacencyIntMap.Algorithm'
  24406. 1693.13 s [algebraic-graphs] Missing documentation for:
  24407. 1693.13 s [algebraic-graphs] Cycle (src/Algebra/Graph/AdjacencyIntMap/Algorithm.hs:227)
  24408. 1693.25 s [algebraic-graphs] Warning: 'IsList' is out of scope.
  24409. 1693.25 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24410. 1693.25 s [algebraic-graphs] 100% ( 19 / 19) in 'Algebra.Graph.Internal'
  24411. 1693.37 s [algebraic-graphs] 100% ( 61 / 61) in 'Algebra.Graph'
  24412. 1693.52 s [algebraic-graphs] Warning: 'mplus' is out of scope.
  24413. 1693.52 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24414. 1693.52 s [algebraic-graphs] Warning: 'vertexCount' is out of scope.
  24415. 1693.52 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24416. 1693.52 s [algebraic-graphs] Warning: 'hasVertex' is out of scope.
  24417. 1693.52 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24418. 1693.52 s [algebraic-graphs] Warning: 'vertexSet' is out of scope.
  24419. 1693.52 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24420. 1693.52 s [algebraic-graphs] Warning: 'isEmpty' is out of scope.
  24421. 1693.52 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24422. 1693.52 s [algebraic-graphs] Warning: 'edgeList' is out of scope.
  24423. 1693.52 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24424. 1693.52 s [algebraic-graphs] Warning: 'adjacencyList' is out of scope.
  24425. 1693.52 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24426. 1693.52 s [algebraic-graphs] Warning: 'box' is out of scope.
  24427. 1693.52 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24428. 1693.52 s [algebraic-graphs] Warning: 'edgeCount' is out of scope.
  24429. 1693.52 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24430. 1693.52 s [algebraic-graphs] 100% ( 42 / 42) in 'Algebra.Graph.HigherKinded.Class'
  24431. 1693.70 s [algebraic-graphs] Warning: 'nub' is out of scope.
  24432. 1693.70 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24433. 1693.70 s [algebraic-graphs] 100% ( 63 / 63) in 'Algebra.Graph.Bipartite.AdjacencyMap'
  24434. 1693.83 s [algebraic-graphs] Warning: 'isRight' is out of scope.
  24435. 1693.83 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24436. 1693.83 s [algebraic-graphs] 100% ( 25 / 25) in 'Algebra.Graph.Bipartite.AdjacencyMap.Algorithm'
  24437. 1693.97 s [algebraic-graphs] 100% ( 37 / 37) in 'Algebra.Graph.Label'
  24438. 1694.25 s [algebraic-graphs] Warning: 'isEmpty' is out of scope.
  24439. 1694.25 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24440. 1694.25 s [algebraic-graphs] Warning: 'empty' is out of scope.
  24441. 1694.25 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24442. 1694.25 s [algebraic-graphs] Warning: 'vertexList' is out of scope.
  24443. 1694.25 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24444. 1694.25 s [algebraic-graphs] Warning: 'edges' is out of scope.
  24445. 1694.25 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24446. 1694.25 s [algebraic-graphs] Warning: 'adjacencyList' is out of scope.
  24447. 1694.25 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24448. 1694.25 s [algebraic-graphs] Warning: 'stars' is out of scope.
  24449. 1694.25 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24450. 1694.26 s [algebraic-graphs] 100% ( 51 / 51) in 'Algebra.Graph.NonEmpty.AdjacencyMap'
  24451. 1694.34 s [algebraic-graphs] Warning: 'nub' is out of scope.
  24452. 1694.34 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24453. 1694.34 s [algebraic-graphs] Warning: 'sort' is out of scope.
  24454. 1694.34 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24455. 1694.34 s [algebraic-graphs] 93% ( 15 / 16) in 'Algebra.Graph.AdjacencyMap.Algorithm'
  24456. 1694.34 s [algebraic-graphs] Missing documentation for:
  24457. 1694.34 s [algebraic-graphs] Cycle (src/Algebra/Graph/AdjacencyMap/Algorithm.hs:228)
  24458. 1694.43 s [algebraic-graphs] 100% ( 44 / 44) in 'Algebra.Graph.Acyclic.AdjacencyMap'
  24459. 1694.49 s [algebraic-graphs] 100% ( 8 / 8) in 'Algebra.Graph.ToGraph'
  24460. 1694.53 s [algebraic-graphs]
  24461. 1694.53 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:171:32: warning: [-Wtype-equality-requires-operators]
  24462. 1694.53 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24463. 1694.53 s [algebraic-graphs] will become an error in a future GHC release.
  24464. 1694.53 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24465. 1694.53 s [algebraic-graphs] |
  24466. 1694.53 s [algebraic-graphs] 171 | vertexIntSet :: ToVertex t ~ Int => t -> IntSet
  24467. 1694.53 s [algebraic-graphs] | ^
  24468. 1694.53 s [algebraic-graphs]
  24469. 1694.53 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:197:29: warning: [-Wtype-equality-requires-operators]
  24470. 1694.53 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24471. 1694.53 s [algebraic-graphs] will become an error in a future GHC release.
  24472. 1694.53 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24473. 1694.53 s [algebraic-graphs] |
  24474. 1694.54 s [algebraic-graphs] 197 | preIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  24475. 1694.54 s [algebraic-graphs] | ^
  24476. 1694.54 s [algebraic-graphs]
  24477. 1694.54 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:215:30: warning: [-Wtype-equality-requires-operators]
  24478. 1694.54 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24479. 1694.54 s [algebraic-graphs] will become an error in a future GHC release.
  24480. 1694.54 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24481. 1694.54 s [algebraic-graphs] |
  24482. 1694.54 s [algebraic-graphs] 215 | postIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  24483. 1694.54 s [algebraic-graphs] | ^
  24484. 1694.54 s [algebraic-graphs]
  24485. 1694.54 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:303:37: warning: [-Wtype-equality-requires-operators]
  24486. 1694.54 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24487. 1694.54 s [algebraic-graphs] will become an error in a future GHC release.
  24488. 1694.54 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24489. 1694.54 s [algebraic-graphs] |
  24490. 1694.54 s [algebraic-graphs] 303 | toAdjacencyIntMap :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  24491. 1694.54 s [algebraic-graphs] | ^
  24492. 1694.54 s [algebraic-graphs]
  24493. 1694.54 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:312:46: warning: [-Wtype-equality-requires-operators]
  24494. 1694.54 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24495. 1694.54 s [algebraic-graphs] will become an error in a future GHC release.
  24496. 1694.54 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24497. 1694.54 s [algebraic-graphs] |
  24498. 1694.54 s [algebraic-graphs] 312 | toAdjacencyIntMapTranspose :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  24499. 1694.54 s [algebraic-graphs] | ^
  24500. 1694.54 s [algebraic-graphs]
  24501. 1694.54 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:452:43: warning: [-Wtype-equality-requires-operators]
  24502. 1694.54 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24503. 1694.54 s [algebraic-graphs] will become an error in a future GHC release.
  24504. 1694.54 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24505. 1694.54 s [algebraic-graphs] |
  24506. 1694.54 s [algebraic-graphs] 452 | adjacencyIntMap :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  24507. 1694.55 s [algebraic-graphs] | ^
  24508. 1694.55 s [algebraic-graphs]
  24509. 1694.55 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:471:52: warning: [-Wtype-equality-requires-operators]
  24510. 1694.55 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24511. 1694.55 s [algebraic-graphs] will become an error in a future GHC release.
  24512. 1694.55 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24513. 1694.55 s [algebraic-graphs] |
  24514. 1694.55 s [algebraic-graphs] 471 | adjacencyIntMapTranspose :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  24515. 1694.55 s [algebraic-graphs] | ^
  24516. 1694.70 s [algebraic-graphs] Warning: 'AdjacencyMap' is out of scope.
  24517. 1694.70 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24518. 1694.70 s [algebraic-graphs] 100% ( 56 / 56) in 'Algebra.Graph.Relation'
  24519. 1694.81 s [algebraic-graphs] 100% ( 48 / 48) in 'Algebra.Graph.Relation.Symmetric'
  24520. 1694.91 s [algebraic-graphs] Warning: 'vertexList' is out of scope.
  24521. 1694.91 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24522. 1694.91 s [algebraic-graphs] 100% ( 53 / 53) in 'Algebra.Graph.NonEmpty'
  24523. 1695.07 s [algebraic-graphs] 100% ( 49 / 49) in 'Algebra.Graph.Labelled.AdjacencyMap'
  24524. 1695.30 s [algebraic-graphs] 100% ( 49 / 49) in 'Algebra.Graph.Labelled'
  24525. 1695.35 s [algebraic-graphs]
  24526. 1695.35 s [algebraic-graphs] src/Algebra/Graph/Labelled.hs:74:10: warning: [-Wredundant-constraints]
  24527. 1695.35 s [algebraic-graphs] • Redundant constraint: Eq e
  24528. 1695.35 s [algebraic-graphs] • In the instance declaration for ‘Ord (Graph e a)’
  24529. 1695.35 s [algebraic-graphs] |
  24530. 1695.36 s [algebraic-graphs] 74 | instance (Eq e, Monoid e, Ord a, Ord e) => Ord (Graph e a) where
  24531. 1695.36 s [algebraic-graphs] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  24532. 1695.37 s [algebraic-graphs] 100% ( 6 / 6) in 'Algebra.Graph.Labelled.Example.Network'
  24533. 1695.38 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Labelled.Example.Automaton'
  24534. 1695.41 s [algebraic-graphs] 100% ( 14 / 14) in 'Algebra.Graph.Export'
  24535. 1695.41 s [algebraic-graphs]
  24536. 1695.42 s [algebraic-graphs] src/Algebra/Graph/Export.hs:185:41: warning: [-Wtype-equality-requires-operators]
  24537. 1695.42 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24538. 1695.42 s [algebraic-graphs] will become an error in a future GHC release.
  24539. 1695.42 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24540. 1695.42 s [algebraic-graphs] |
  24541. 1695.42 s [algebraic-graphs] 185 | export :: (Ord a, ToGraph g, ToVertex g ~ a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
  24542. 1695.42 s [algebraic-graphs] | ^
  24543. 1695.44 s [algebraic-graphs] Warning: 'Graph' is out of scope.
  24544. 1695.44 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24545. 1695.44 s [algebraic-graphs] 100% ( 11 / 11) in 'Algebra.Graph.Export.Dot'
  24546. 1695.47 s [algebraic-graphs]
  24547. 1695.47 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:121:63: warning: [-Wtype-equality-requires-operators]
  24548. 1695.47 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24549. 1695.47 s [algebraic-graphs] will become an error in a future GHC release.
  24550. 1695.47 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24551. 1695.47 s [algebraic-graphs] |
  24552. 1695.47 s [algebraic-graphs] 121 | export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g ~ a) => Style a s -> g -> s
  24553. 1695.47 s [algebraic-graphs] | ^
  24554. 1695.47 s [algebraic-graphs]
  24555. 1695.47 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:165:78: warning: [-Wtype-equality-requires-operators]
  24556. 1695.47 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24557. 1695.47 s [algebraic-graphs] will become an error in a future GHC release.
  24558. 1695.47 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24559. 1695.48 s [algebraic-graphs] |
  24560. 1695.48 s [algebraic-graphs] 165 | exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g ~ s) => g -> s
  24561. 1695.48 s [algebraic-graphs] | ^
  24562. 1695.55 s [algebraic-graphs] 100% ( 50 / 50) in 'Algebra.Graph.Undirected'
  24563. 1695.61 s [algebraic-graphs] 100% ( 27 / 27) in 'Algebra.Graph.Class'
  24564. 1695.66 s [algebraic-graphs] Warning: 'Transitive' is out of scope.
  24565. 1695.66 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24566. 1695.66 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Transitive'
  24567. 1695.68 s [algebraic-graphs] Warning: 'Reflexive' is out of scope.
  24568. 1695.68 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24569. 1695.68 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Reflexive'
  24570. 1695.69 s [algebraic-graphs] Warning: 'Preorder' is out of scope.
  24571. 1695.69 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24572. 1695.69 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Preorder'
  24573. 1695.71 s [algebraic-graphs] 0% ( 0 / 8) in 'Algebra.Graph.Example.Todo'
  24574. 1695.71 s [algebraic-graphs] Missing documentation for:
  24575. 1695.71 s [algebraic-graphs] Module header
  24576. 1695.71 s [algebraic-graphs] Todo (src/Algebra/Graph/Example/Todo.hs:13)
  24577. 1695.71 s [algebraic-graphs] todo (src/Algebra/Graph/Example/Todo.hs:41)
  24578. 1695.71 s [algebraic-graphs] low (src/Algebra/Graph/Example/Todo.hs:22)
  24579. 1695.71 s [algebraic-graphs] high (src/Algebra/Graph/Example/Todo.hs:26)
  24580. 1695.71 s [algebraic-graphs] ~*~ (src/Algebra/Graph/Example/Todo.hs:34)
  24581. 1695.71 s [algebraic-graphs] >*< (src/Algebra/Graph/Example/Todo.hs:38)
  24582. 1695.71 s [algebraic-graphs] priority (src/Algebra/Graph/Example/Todo.hs:30)
  24583. 1695.74 s [algebraic-graphs] Warning: 'array' is out of scope.
  24584. 1695.74 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24585. 1695.74 s [algebraic-graphs] 90% ( 10 / 11) in 'Data.Graph.Typed'
  24586. 1695.74 s [algebraic-graphs] Missing documentation for:
  24587. 1695.74 s [algebraic-graphs] scc (src/Data/Graph/Typed.hs:191)
  24588. 1696.06 s [algebraic-graphs] Warning: Algebra.Graph.Labelled: could not find link destinations for:
  24589. 1696.06 s [algebraic-graphs]
  24590. 1696.06 s [algebraic-graphs] - Algebra.Graph.Labelled.Focus
  24591. 1700.63 s [algebraic-graphs] Documentation created: dist/doc/html/algebraic-graphs/index.html,
  24592. 1700.63 s [algebraic-graphs] dist/doc/html/algebraic-graphs/algebraic-graphs.txt
  24593. 1700.69 s [algebraic-graphs] Preprocessing test suite 'main' for algebraic-graphs-0.7..
  24594. 1700.70 s [algebraic-graphs] Phase: installPhase
  24595. 1700.76 s [algebraic-graphs] Installing library in /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F
  24596. 1701.53 s [algebraic-graphs] Phase: fixupPhase
  24597. 1701.55 s [algebraic-graphs] shrinking RPATHs of ELF executables and libraries in /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7
  24598. 1701.55 s [algebraic-graphs] shrinking /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/libHSalgebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F-ghc9.4.8.so
  24599. 1701.58 s [algebraic-graphs] checking for references to /build/ in /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7...
  24600. 1701.62 s [algebraic-graphs] patching script interpreter paths in /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7
  24601. 1701.62 s [algebraic-graphs] stripping (with command strip and flags -S -p) in /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7/lib
  24602. 1701.92 s [algebraic-graphs] shrinking RPATHs of ELF executables and libraries in /nix/store/vjqap2q6zb9489lpbx22hfpxkrh9jn3f-algebraic-graphs-0.7-doc
  24603. 1701.95 s [algebraic-graphs] checking for references to /build/ in /nix/store/vjqap2q6zb9489lpbx22hfpxkrh9jn3f-algebraic-graphs-0.7-doc...
  24604. 1701.98 s [algebraic-graphs] patching script interpreter paths in /nix/store/vjqap2q6zb9489lpbx22hfpxkrh9jn3f-algebraic-graphs-0.7-doc
  24605. 1702.14 s [algebraic-graphs:post-build] Uploading to cachix cache "sellout": /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7 /nix/store/vjqap2q6zb9489lpbx22hfpxkrh9jn3f-algebraic-graphs-0.7-doc
  24606. 1702.57 s [algebraic-graphs:post-build] Nothing to push - all store paths are already on Cachix.
  24607. 1702.59 s [algebraic-graphs:post-build] Uploading to the NixCI cache: /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7 /nix/store/vjqap2q6zb9489lpbx22hfpxkrh9jn3f-algebraic-graphs-0.7-doc
  24608. 1702.63 s [algebraic-graphs:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24609. 1702.71 s [algebraic-graphs:post-build] copying 1 paths...
  24610. 1702.71 s [algebraic-graphs:post-build] copying path '/nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7' to 'https://cache.nix-ci.com'...
  24611. 1710.69 s [algebraic-graphs:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24612. 1710.77 s [algebraic-graphs:post-build] copying 0 paths...
  24613. 1710.81 s Progress: 14 of 19 built, 161 of 161 downloaded from cache
  24614. 1710.85 s Building /nix/store/yq11w1cv46amflsdfd70y3j1y67s43qz-algebraic-graph-duoids-0.0.1.0.drv
  24615. 1711.04 s [algebraic-graph-duoids] Phase: setupCompilerEnvironmentPhase
  24616. 1711.05 s [algebraic-graph-duoids] Build with /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8.
  24617. 1711.30 s [algebraic-graph-duoids] Phase: unpackPhase
  24618. 1711.30 s [algebraic-graph-duoids] unpacking source archive /nix/store/j3nhvvhbp8d5l29mqdaf8f513lxyga6r-z8smrhvl4j2a1x1vb5nv502a87a6wsx7-source/./algebraic-graphs
  24619. 1711.31 s [algebraic-graph-duoids] source root is algebraic-graphs
  24620. 1711.32 s [algebraic-graph-duoids] Phase: patchPhase
  24621. 1711.33 s [algebraic-graph-duoids] Phase: compileBuildDriverPhase
  24622. 1711.34 s [algebraic-graph-duoids] setupCompileFlags: -package-db=/build/tmp.zUuTJ0NXVO/setup-package.conf.d -threaded
  24623. 1711.39 s [algebraic-graph-duoids] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.zUuTJ0NXVO/Main.o )
  24624. 1711.46 s [algebraic-graph-duoids] [2 of 2] Linking Setup
  24625. 1712.79 s [algebraic-graph-duoids] Phase: updateAutotoolsGnuConfigScriptsPhase
  24626. 1712.80 s [algebraic-graph-duoids] Phase: configurePhase
  24627. 1712.81 s [algebraic-graph-duoids] configureFlags: --verbose --prefix=/nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0 --libdir=$prefix/lib/$compiler --libsubdir=$abi/$libname --docdir=/nix/store/rs4r5jwpgf5sb192ni86zcr12gnwxkba-algebraic-graph-duoids-0.0.1.0-doc/share/doc/algebraic-graph-duoids-0.0.1.0 --with-gcc=gcc --package-db=/build/tmp.zUuTJ0NXVO/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --ghc-options=-Werror --extra-lib-dirs=/nix/store/ffyzkisqs4vc4mg28bwwlyqjf8i9ph6b-ncurses-6.5/lib --extra-lib-dirs=/nix/store/n28qgdj8c1q41kf7n4y1jxa6ckp85m3c-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/hi0ar880110k6jsmmili7dh1gq3cg2a9-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/g09cflpnp4g80q56sj9dng1qzv4v4ybc-numactl-2.0.18/lib --extra-lib-dirs=/nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/lib
  24628. 1712.82 s [algebraic-graph-duoids] Using Parsec parser
  24629. 1712.82 s [algebraic-graph-duoids] Configuring algebraic-graph-duoids-0.0.1.0...
  24630. 1713.19 s [algebraic-graph-duoids] Flags chosen: lint=False, noisy-deprecations=True
  24631. 1713.55 s [algebraic-graph-duoids] Dependency algebraic-graphs >=0.5 && <0.6 || >=0.6.1 && <0.9: using
  24632. 1713.55 s [algebraic-graph-duoids] algebraic-graphs-0.7
  24633. 1713.55 s [algebraic-graph-duoids] Dependency base >=4.16.0 && <4.17 || >=4.17.0 && <4.18 || >=4.18.0 && <4.19 ||
  24634. 1713.55 s [algebraic-graph-duoids] >=4.19.0 && <4.20 || >=4.20.0 && <4.21 || >=4.21.0 && <4.22 || >=4.22.0 &&
  24635. 1713.55 s [algebraic-graph-duoids] <4.23: using base-4.17.2.1
  24636. 1713.55 s [algebraic-graph-duoids] Dependency duoids >=0.0.1 && <0.1: using duoids-0.0.1.0
  24637. 1713.55 s [algebraic-graph-duoids] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  24638. 1713.55 s [algebraic-graph-duoids] Dependency algebraic-graph-duoids: using algebraic-graph-duoids-0.0.1.0
  24639. 1713.55 s [algebraic-graph-duoids] Dependency algebraic-graphs >=0.5 && <0.6 || >=0.6.1 && <0.9: using
  24640. 1713.55 s [algebraic-graph-duoids] algebraic-graphs-0.7
  24641. 1713.55 s [algebraic-graph-duoids] Dependency base >=4.16.0 && <4.17 || >=4.17.0 && <4.18 || >=4.18.0 && <4.19 ||
  24642. 1713.55 s [algebraic-graph-duoids] >=4.19.0 && <4.20 || >=4.20.0 && <4.21 || >=4.21.0 && <4.22 || >=4.22.0 &&
  24643. 1713.55 s [algebraic-graph-duoids] <4.23: using base-4.17.2.1
  24644. 1713.55 s [algebraic-graph-duoids] Dependency duoids-hedgehog >=0.0.1 && <0.1: using duoids-hedgehog-0.0.1.0
  24645. 1713.55 s [algebraic-graph-duoids] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  24646. 1713.55 s [algebraic-graph-duoids] Dependency hedgehog >=1.1 && <1.3 || >=1.4 && <1.6 || >=1.7 && <1.8: using
  24647. 1713.55 s [algebraic-graph-duoids] hedgehog-1.5
  24648. 1713.55 s [algebraic-graph-duoids] Dependency algebraic-graph-duoids: using algebraic-graph-duoids-0.0.1.0
  24649. 1713.55 s [algebraic-graph-duoids] Dependency base >=4.16.0 && <4.17 || >=4.17.0 && <4.18 || >=4.18.0 && <4.19 ||
  24650. 1713.55 s [algebraic-graph-duoids] >=4.19.0 && <4.20 || >=4.20.0 && <4.21 || >=4.21.0 && <4.22 || >=4.22.0 &&
  24651. 1713.55 s [algebraic-graph-duoids] <4.23: using base-4.17.2.1
  24652. 1713.55 s [algebraic-graph-duoids] Dependency doctest >=0.18.2 && <0.19 || >=0.20.1 && <0.21 || >=0.21.1 && <0.22
  24653. 1713.55 s [algebraic-graph-duoids] || >=0.22.6 && <0.23 || >=0.24.0 && <0.25 || >=0.25.0 && <0.26: using
  24654. 1713.55 s [algebraic-graph-duoids] doctest-0.24.2
  24655. 1713.55 s [algebraic-graph-duoids] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  24656. 1713.55 s [algebraic-graph-duoids] Source component graph:
  24657. 1713.55 s [algebraic-graph-duoids] component lib
  24658. 1713.55 s [algebraic-graph-duoids] component test:doctests dependency lib
  24659. 1713.55 s [algebraic-graph-duoids] component test:laws dependency lib
  24660. 1713.55 s [algebraic-graph-duoids] Configured component graph:
  24661. 1713.55 s [algebraic-graph-duoids] component algebraic-graph-duoids-0.0.1.0-8CFnQkK5QE5JCwucsj3ZV6
  24662. 1713.55 s [algebraic-graph-duoids] include algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F
  24663. 1713.55 s [algebraic-graph-duoids] include base-4.17.2.1
  24664. 1713.55 s [algebraic-graph-duoids] include duoids-0.0.1.0-7Tv3jMouVtXFOM5hnlF6gw
  24665. 1713.55 s [algebraic-graph-duoids] include ghc-compat-plugin-0.1.0.1-EF6fkbvBW8o6hs1RRExbcG
  24666. 1713.55 s [algebraic-graph-duoids] component algebraic-graph-duoids-0.0.1.0-JqxAzThiaDAEz9yEmrIIb6-doctests
  24667. 1713.55 s [algebraic-graph-duoids] include algebraic-graph-duoids-0.0.1.0-8CFnQkK5QE5JCwucsj3ZV6
  24668. 1713.55 s [algebraic-graph-duoids] include base-4.17.2.1
  24669. 1713.55 s [algebraic-graph-duoids] include doctest-0.24.2-I8Dj1Qj4flA6uA6Qf1gy88
  24670. 1713.55 s [algebraic-graph-duoids] include ghc-compat-plugin-0.1.0.1-EF6fkbvBW8o6hs1RRExbcG
  24671. 1713.55 s [algebraic-graph-duoids] component algebraic-graph-duoids-0.0.1.0-JAUo7xOyin5FXRhEQ08TZd-laws
  24672. 1713.55 s [algebraic-graph-duoids] include algebraic-graph-duoids-0.0.1.0-8CFnQkK5QE5JCwucsj3ZV6
  24673. 1713.55 s [algebraic-graph-duoids] include algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F
  24674. 1713.55 s [algebraic-graph-duoids] include base-4.17.2.1
  24675. 1713.55 s [algebraic-graph-duoids] include duoids-hedgehog-0.0.1.0-86kvglxhXlf4EPSPhK634D
  24676. 1713.55 s [algebraic-graph-duoids] include ghc-compat-plugin-0.1.0.1-EF6fkbvBW8o6hs1RRExbcG
  24677. 1713.55 s [algebraic-graph-duoids] include hedgehog-1.5-4fqlZQKIbDIIs4YNb6VW27
  24678. 1713.55 s [algebraic-graph-duoids] Linked component graph:
  24679. 1713.55 s [algebraic-graph-duoids] unit algebraic-graph-duoids-0.0.1.0-8CFnQkK5QE5JCwucsj3ZV6
  24680. 1713.55 s [algebraic-graph-duoids] include algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F
  24681. 1713.55 s [algebraic-graph-duoids] include base-4.17.2.1
  24682. 1713.55 s [algebraic-graph-duoids] include duoids-0.0.1.0-7Tv3jMouVtXFOM5hnlF6gw
  24683. 1713.55 s [algebraic-graph-duoids] include ghc-compat-plugin-0.1.0.1-EF6fkbvBW8o6hs1RRExbcG
  24684. 1713.55 s [algebraic-graph-duoids] Algebra.Graph.Duoid=algebraic-graph-duoids-0.0.1.0-8CFnQkK5QE5JCwucsj3ZV6:Algebra.Graph.Duoid,Algebra.Graph.Duoid.Orphans=algebraic-graph-duoids-0.0.1.0-8CFnQkK5QE5JCwucsj3ZV6:Algebra.Graph.Duoid.Orphans
  24685. 1713.55 s [algebraic-graph-duoids] unit algebraic-graph-duoids-0.0.1.0-JqxAzThiaDAEz9yEmrIIb6-doctests
  24686. 1713.55 s [algebraic-graph-duoids] include algebraic-graph-duoids-0.0.1.0-8CFnQkK5QE5JCwucsj3ZV6
  24687. 1713.55 s [algebraic-graph-duoids] include base-4.17.2.1
  24688. 1713.55 s [algebraic-graph-duoids] include doctest-0.24.2-I8Dj1Qj4flA6uA6Qf1gy88
  24689. 1713.55 s [algebraic-graph-duoids] include ghc-compat-plugin-0.1.0.1-EF6fkbvBW8o6hs1RRExbcG
  24690. 1713.55 s [algebraic-graph-duoids] unit algebraic-graph-duoids-0.0.1.0-JAUo7xOyin5FXRhEQ08TZd-laws
  24691. 1713.55 s [algebraic-graph-duoids] include algebraic-graph-duoids-0.0.1.0-8CFnQkK5QE5JCwucsj3ZV6
  24692. 1713.55 s [algebraic-graph-duoids] include algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F
  24693. 1713.55 s [algebraic-graph-duoids] include base-4.17.2.1
  24694. 1713.55 s [algebraic-graph-duoids] include duoids-hedgehog-0.0.1.0-86kvglxhXlf4EPSPhK634D
  24695. 1713.55 s [algebraic-graph-duoids] include ghc-compat-plugin-0.1.0.1-EF6fkbvBW8o6hs1RRExbcG
  24696. 1713.55 s [algebraic-graph-duoids] include hedgehog-1.5-4fqlZQKIbDIIs4YNb6VW27
  24697. 1713.55 s [algebraic-graph-duoids] Ready component graph:
  24698. 1713.55 s [algebraic-graph-duoids] definite algebraic-graph-duoids-0.0.1.0-8CFnQkK5QE5JCwucsj3ZV6
  24699. 1713.55 s [algebraic-graph-duoids] depends algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F
  24700. 1713.55 s [algebraic-graph-duoids] depends base-4.17.2.1
  24701. 1713.55 s [algebraic-graph-duoids] depends duoids-0.0.1.0-7Tv3jMouVtXFOM5hnlF6gw
  24702. 1713.55 s [algebraic-graph-duoids] depends ghc-compat-plugin-0.1.0.1-EF6fkbvBW8o6hs1RRExbcG
  24703. 1713.55 s [algebraic-graph-duoids] definite algebraic-graph-duoids-0.0.1.0-JAUo7xOyin5FXRhEQ08TZd-laws
  24704. 1713.55 s [algebraic-graph-duoids] depends algebraic-graph-duoids-0.0.1.0-8CFnQkK5QE5JCwucsj3ZV6
  24705. 1713.55 s [algebraic-graph-duoids] depends algebraic-graphs-0.7-HAx3uQBsFBrCFjzVNVlr0F
  24706. 1713.55 s [algebraic-graph-duoids] depends base-4.17.2.1
  24707. 1713.55 s [algebraic-graph-duoids] depends duoids-hedgehog-0.0.1.0-86kvglxhXlf4EPSPhK634D
  24708. 1713.55 s [algebraic-graph-duoids] depends ghc-compat-plugin-0.1.0.1-EF6fkbvBW8o6hs1RRExbcG
  24709. 1713.55 s [algebraic-graph-duoids] depends hedgehog-1.5-4fqlZQKIbDIIs4YNb6VW27
  24710. 1713.55 s [algebraic-graph-duoids] definite algebraic-graph-duoids-0.0.1.0-JqxAzThiaDAEz9yEmrIIb6-doctests
  24711. 1713.55 s [algebraic-graph-duoids] depends algebraic-graph-duoids-0.0.1.0-8CFnQkK5QE5JCwucsj3ZV6
  24712. 1713.55 s [algebraic-graph-duoids] depends base-4.17.2.1
  24713. 1713.55 s [algebraic-graph-duoids] depends doctest-0.24.2-I8Dj1Qj4flA6uA6Qf1gy88
  24714. 1713.55 s [algebraic-graph-duoids] depends ghc-compat-plugin-0.1.0.1-EF6fkbvBW8o6hs1RRExbcG
  24715. 1713.55 s [algebraic-graph-duoids] Using Cabal-3.12.1.0 compiled by ghc-9.4
  24716. 1713.55 s [algebraic-graph-duoids] Using compiler: ghc-9.4.8
  24717. 1713.55 s [algebraic-graph-duoids] Using install prefix:
  24718. 1713.55 s [algebraic-graph-duoids] /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0
  24719. 1713.55 s [algebraic-graph-duoids] Executables installed in:
  24720. 1713.55 s [algebraic-graph-duoids] /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/bin
  24721. 1713.55 s [algebraic-graph-duoids] Libraries installed in:
  24722. 1713.55 s [algebraic-graph-duoids] /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/algebraic-graph-duoids-0.0.1.0-8CFnQkK5QE5JCwucsj3ZV6
  24723. 1713.55 s [algebraic-graph-duoids] Dynamic Libraries installed in:
  24724. 1713.55 s [algebraic-graph-duoids] /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8
  24725. 1713.55 s [algebraic-graph-duoids] Private executables installed in:
  24726. 1713.55 s [algebraic-graph-duoids] /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/libexec/x86_64-linux-ghc-9.4.8/algebraic-graph-duoids-0.0.1.0
  24727. 1713.55 s [algebraic-graph-duoids] Data files installed in:
  24728. 1713.55 s [algebraic-graph-duoids] /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/share/x86_64-linux-ghc-9.4.8/algebraic-graph-duoids-0.0.1.0
  24729. 1713.55 s [algebraic-graph-duoids] Documentation installed in:
  24730. 1713.55 s [algebraic-graph-duoids] /nix/store/rs4r5jwpgf5sb192ni86zcr12gnwxkba-algebraic-graph-duoids-0.0.1.0-doc/share/doc/algebraic-graph-duoids-0.0.1.0
  24731. 1713.55 s [algebraic-graph-duoids] Configuration files installed in:
  24732. 1713.55 s [algebraic-graph-duoids] /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/etc
  24733. 1713.55 s [algebraic-graph-duoids] No alex found
  24734. 1713.55 s [algebraic-graph-duoids] Using ar found on system at:
  24735. 1713.55 s [algebraic-graph-duoids] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  24736. 1713.55 s [algebraic-graph-duoids] No c2hs found
  24737. 1713.55 s [algebraic-graph-duoids] No cpphs found
  24738. 1713.55 s [algebraic-graph-duoids] Using doctest version 0.24.2 found on system at:
  24739. 1713.55 s [algebraic-graph-duoids] /nix/store/jbbd7dp036y9l3jv36q5ffbsn5s78wcn-doctest-0.24.2/bin/doctest
  24740. 1713.55 s [algebraic-graph-duoids] Using gcc version 14.3.0 given by user at:
  24741. 1713.55 s [algebraic-graph-duoids] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  24742. 1713.55 s [algebraic-graph-duoids] Using ghc version 9.4.8 found on system at:
  24743. 1713.55 s [algebraic-graph-duoids] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/ghc
  24744. 1713.55 s [algebraic-graph-duoids] Using ghc-pkg version 9.4.8 found on system at:
  24745. 1713.55 s [algebraic-graph-duoids] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/ghc-pkg-9.4.8
  24746. 1713.55 s [algebraic-graph-duoids] No ghcjs found
  24747. 1713.55 s [algebraic-graph-duoids] No ghcjs-pkg found
  24748. 1713.55 s [algebraic-graph-duoids] No greencard found
  24749. 1713.55 s [algebraic-graph-duoids] Using haddock version 2.27.0 found on system at:
  24750. 1713.55 s [algebraic-graph-duoids] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/haddock-ghc-9.4.8
  24751. 1713.55 s [algebraic-graph-duoids] No happy found
  24752. 1713.55 s [algebraic-graph-duoids] Using haskell-suite found on system at: haskell-suite-dummy-location
  24753. 1713.55 s [algebraic-graph-duoids] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  24754. 1713.55 s [algebraic-graph-duoids] No hmake found
  24755. 1713.55 s [algebraic-graph-duoids] Using hpc version 0.68 found on system at:
  24756. 1713.55 s [algebraic-graph-duoids] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/hpc
  24757. 1713.55 s [algebraic-graph-duoids] Using hsc2hs version 0.68.8 found on system at:
  24758. 1713.55 s [algebraic-graph-duoids] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/hsc2hs
  24759. 1713.55 s [algebraic-graph-duoids] Using hscolour version 1.25 found on system at:
  24760. 1713.55 s [algebraic-graph-duoids] /nix/store/87hdxxa93g58b2w9ylr2idn2a40i3fdc-hscolour-1.25/bin/HsColour
  24761. 1713.55 s [algebraic-graph-duoids] No jhc found
  24762. 1713.56 s [algebraic-graph-duoids] Using ld found on system at:
  24763. 1713.56 s [algebraic-graph-duoids] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ld.gold
  24764. 1713.56 s [algebraic-graph-duoids] No pkg-config found
  24765. 1713.56 s [algebraic-graph-duoids] Using runghc version 9.4.8 found on system at:
  24766. 1713.56 s [algebraic-graph-duoids] /nix/store/nmsz5dsqz3bkamwrz6jdp94kiq49y30p-ghc-9.4.8/bin/runghc-9.4.8
  24767. 1713.56 s [algebraic-graph-duoids] Using strip version 2.44 found on system at:
  24768. 1713.56 s [algebraic-graph-duoids] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  24769. 1713.56 s [algebraic-graph-duoids] Using tar found on system at:
  24770. 1713.56 s [algebraic-graph-duoids] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  24771. 1713.56 s [algebraic-graph-duoids] No uhc found
  24772. 1713.80 s [algebraic-graph-duoids] Phase: buildPhase
  24773. 1713.88 s [algebraic-graph-duoids] Preprocessing library for algebraic-graph-duoids-0.0.1.0...
  24774. 1713.88 s [algebraic-graph-duoids] Building library for algebraic-graph-duoids-0.0.1.0...
  24775. 1714.00 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 )
  24776. 1714.45 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 )
  24777. 1715.51 s [algebraic-graph-duoids] [1 of 2] Compiling Algebra.Graph.Duoid ( src/Algebra/Graph/Duoid.hs, dist/build/Algebra/Graph/Duoid.p_o )
  24778. 1716.03 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 )
  24779. 1719.05 s [algebraic-graph-duoids] Preprocessing test suite 'laws' for algebraic-graph-duoids-0.0.1.0...
  24780. 1719.05 s [algebraic-graph-duoids] Building test suite 'laws' for algebraic-graph-duoids-0.0.1.0...
  24781. 1719.17 s [algebraic-graph-duoids] [1 of 1] Compiling Main ( tests/laws.hs, dist/build/laws/laws-tmp/Main.o )
  24782. 1720.16 s [algebraic-graph-duoids] [2 of 2] Linking dist/build/laws/laws
  24783. 1721.27 s [algebraic-graph-duoids] Preprocessing test suite 'doctests' for algebraic-graph-duoids-0.0.1.0...
  24784. 1721.27 s [algebraic-graph-duoids] Building test suite 'doctests' for algebraic-graph-duoids-0.0.1.0...
  24785. 1721.38 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 )
  24786. 1721.93 s [algebraic-graph-duoids] [2 of 2] Compiling Main ( tests/doctests.hs, dist/build/doctests/doctests-tmp/Main.o )
  24787. 1722.63 s [algebraic-graph-duoids] [3 of 3] Linking dist/build/doctests/doctests
  24788. 1724.49 s [algebraic-graph-duoids] Phase: checkPhase
  24789. 1724.77 s [algebraic-graph-duoids] Running 2 test suites...
  24790. 1724.77 s [algebraic-graph-duoids] Test suite laws: RUNNING...
  24791. 1724.77 s [algebraic-graph-duoids] ━━━ Duoid.Normal (Graph Word8) ━━━
  24792. 1724.78 s [algebraic-graph-duoids] ✓ unswapUnit passed 100 tests.
  24793. 1724.79 s [algebraic-graph-duoids] ✓ interchange passed 100 tests.
  24794. 1724.79 s [algebraic-graph-duoids] ✓ splitUnit passed 100 tests.
  24795. 1724.79 s [algebraic-graph-duoids] ✓ joinUnit passed 100 tests.
  24796. 1724.79 s [algebraic-graph-duoids] ✓ swapUnit passed 100 tests.
  24797. 1724.79 s [algebraic-graph-duoids] ✓ 5 succeeded.
  24798. 1724.79 s [algebraic-graph-duoids] Test suite laws: PASS
  24799. 1724.79 s [algebraic-graph-duoids] Test suite logged to: dist/test/algebraic-graph-duoids-0.0.1.0-laws.log
  24800. 1724.79 s [algebraic-graph-duoids] Test suite doctests: RUNNING...
  24801. 1725.52 s [algebraic-graph-duoids] Examples: 0 Tried: 0 Errors: 0 Failures: 0
  24802. 1725.57 s [algebraic-graph-duoids] NameLib Nothing
  24803. 1725.57 s [algebraic-graph-duoids] ----------------------------------------
  24804. 1725.60 s [algebraic-graph-duoids] Test suite doctests: PASS
  24805. 1725.60 s [algebraic-graph-duoids] Test suite logged to: dist/test/algebraic-graph-duoids-0.0.1.0-doctests.log
  24806. 1725.60 s [algebraic-graph-duoids] 2 of 2 test suites (2 of 2 test cases) passed.
  24807. 1725.61 s [algebraic-graph-duoids] Phase: haddockPhase
  24808. 1725.79 s [algebraic-graph-duoids] Preprocessing library for algebraic-graph-duoids-0.0.1.0...
  24809. 1725.79 s [algebraic-graph-duoids] Running Haddock on library for algebraic-graph-duoids-0.0.1.0...
  24810. 1726.36 s [algebraic-graph-duoids] 100% ( 5 / 5) in 'Algebra.Graph.Duoid'
  24811. 1726.83 s [algebraic-graph-duoids] 100% ( 1 / 1) in 'Algebra.Graph.Duoid.Orphans'
  24812. 1733.20 s [algebraic-graph-duoids] Documentation created: dist/doc/html/algebraic-graph-duoids/,
  24813. 1733.21 s [algebraic-graph-duoids] dist/doc/html/algebraic-graph-duoids/algebraic-graph-duoids.txt
  24814. 1733.29 s [algebraic-graph-duoids] Preprocessing test suite 'laws' for algebraic-graph-duoids-0.0.1.0...
  24815. 1733.29 s [algebraic-graph-duoids] Preprocessing test suite 'doctests' for algebraic-graph-duoids-0.0.1.0...
  24816. 1733.30 s [algebraic-graph-duoids] Phase: installPhase
  24817. 1733.38 s [algebraic-graph-duoids] Installing library in /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/algebraic-graph-duoids-0.0.1.0-8CFnQkK5QE5JCwucsj3ZV6
  24818. 1733.65 s [algebraic-graph-duoids] Phase: fixupPhase
  24819. 1733.67 s [algebraic-graph-duoids] shrinking RPATHs of ELF executables and libraries in /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0
  24820. 1733.67 s [algebraic-graph-duoids] shrinking /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/lib/ghc-9.4.8/x86_64-linux-ghc-9.4.8/libHSalgebraic-graph-duoids-0.0.1.0-8CFnQkK5QE5JCwucsj3ZV6-ghc9.4.8.so
  24821. 1733.68 s [algebraic-graph-duoids] checking for references to /build/ in /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0...
  24822. 1733.70 s [algebraic-graph-duoids] patching script interpreter paths in /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0
  24823. 1733.71 s [algebraic-graph-duoids] stripping (with command strip and flags -S -p) in /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/lib
  24824. 1733.75 s [algebraic-graph-duoids] shrinking RPATHs of ELF executables and libraries in /nix/store/rs4r5jwpgf5sb192ni86zcr12gnwxkba-algebraic-graph-duoids-0.0.1.0-doc
  24825. 1733.76 s [algebraic-graph-duoids] checking for references to /build/ in /nix/store/rs4r5jwpgf5sb192ni86zcr12gnwxkba-algebraic-graph-duoids-0.0.1.0-doc...
  24826. 1733.78 s [algebraic-graph-duoids] patching script interpreter paths in /nix/store/rs4r5jwpgf5sb192ni86zcr12gnwxkba-algebraic-graph-duoids-0.0.1.0-doc
  24827. 1733.93 s [algebraic-graph-duoids:post-build] Uploading to cachix cache "sellout": /nix/store/rs4r5jwpgf5sb192ni86zcr12gnwxkba-algebraic-graph-duoids-0.0.1.0-doc /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0
  24828. 1734.33 s [algebraic-graph-duoids:post-build] Pushing 2 paths (43 are already present) using zstd to cache sellout ⏳
  24829. 1734.33 s [algebraic-graph-duoids:post-build]
  24830. 1734.68 s [algebraic-graph-duoids:post-build] Pushing /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0 (1.24 MiB)
  24831. 1734.79 s [algebraic-graph-duoids:post-build] Pushing /nix/store/rs4r5jwpgf5sb192ni86zcr12gnwxkba-algebraic-graph-duoids-0.0.1.0-doc (585.84 KiB)
  24832. 1735.78 s [algebraic-graph-duoids:post-build]
  24833. 1735.78 s [algebraic-graph-duoids:post-build] All done.
  24834. 1735.81 s [algebraic-graph-duoids:post-build] Uploading to the NixCI cache: /nix/store/rs4r5jwpgf5sb192ni86zcr12gnwxkba-algebraic-graph-duoids-0.0.1.0-doc /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0
  24835. 1735.87 s [algebraic-graph-duoids:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24836. 1735.89 s [algebraic-graph-duoids:post-build] copying 2 paths...
  24837. 1735.89 s [algebraic-graph-duoids:post-build] copying path '/nix/store/rs4r5jwpgf5sb192ni86zcr12gnwxkba-algebraic-graph-duoids-0.0.1.0-doc' to 'https://cache.nix-ci.com'...
  24838. 1736.12 s [algebraic-graph-duoids:post-build] copying path '/nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0' to 'https://cache.nix-ci.com'...
  24839. 1736.55 s [algebraic-graph-duoids:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24840. 1736.76 s [algebraic-graph-duoids:post-build] copying 1 paths...
  24841. 1736.76 s [algebraic-graph-duoids:post-build] copying path '/nix/store/yq11w1cv46amflsdfd70y3j1y67s43qz-algebraic-graph-duoids-0.0.1.0.drv' to 'https://cache.nix-ci.com'...
  24842. 1736.92 s Progress: 15 of 19 built, 161 of 161 downloaded from cache
  24843. 1736.97 s Building /nix/store/856b25hav7xgwkdjgjcnw8k3fmshc3kj-ghc-9.4.8-with-packages.drv
  24844. 1737.04 s [ghc-9.4.8-with-packages] /nix/store/jvs2x0lbr3np33x2nb3k7r7qdirwmrd6-duoidal-transformers-0.0.1.0/nix-support:
  24845. 1737.04 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24846. 1737.04 s [ghc-9.4.8-with-packages] /nix/store/sbjyg7prrvz721rvkkyhsrjmwwr13jap-duoids-0.0.1.0/nix-support:
  24847. 1737.04 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24848. 1737.04 s [ghc-9.4.8-with-packages] /nix/store/wwl2nv34m1jxv0i13ilwqhcxnkr7rzrw-duoids-hedgehog-0.0.1.0/nix-support:
  24849. 1737.04 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24850. 1737.05 s [ghc-9.4.8-with-packages] /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7/nix-support:
  24851. 1737.05 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24852. 1737.06 s [ghc-9.4.8-with-packages] /nix/store/p6m6nww29qgcdfbk8wsrl6aw6lscn3qi-algebraic-graphs-0.7/nix-support:
  24853. 1737.06 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24854. 1737.06 s [ghc-9.4.8-with-packages] /nix/store/xhxf8fh0kdv3jyvi7barm5q9ihmwzbna-ghc-compat-plugin-0.1.0.1/nix-support:
  24855. 1737.06 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24856. 1737.06 s [ghc-9.4.8-with-packages] /nix/store/xhxf8fh0kdv3jyvi7barm5q9ihmwzbna-ghc-compat-plugin-0.1.0.1/nix-support:
  24857. 1737.06 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24858. 1737.07 s [ghc-9.4.8-with-packages] /nix/store/nkwi1bfw3z5c4n1fnrlakrslkcgwbk8v-hedgehog-1.5/nix-support:
  24859. 1737.07 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24860. 1737.07 s [ghc-9.4.8-with-packages] /nix/store/nkwi1bfw3z5c4n1fnrlakrslkcgwbk8v-hedgehog-1.5/nix-support:
  24861. 1737.07 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24862. 1737.08 s [ghc-9.4.8-with-packages] /nix/store/5xxjc2n7b0wb1pivm6f897512r965zh1-ansi-terminal-1.1.3/nix-support:
  24863. 1737.08 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24864. 1737.08 s [ghc-9.4.8-with-packages] /nix/store/5xxjc2n7b0wb1pivm6f897512r965zh1-ansi-terminal-1.1.3/nix-support:
  24865. 1737.08 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24866. 1737.08 s [ghc-9.4.8-with-packages] /nix/store/v6mn5q2pffwalmdqam9hshx6lnmab5av-async-2.2.5/nix-support:
  24867. 1737.08 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24868. 1737.08 s [ghc-9.4.8-with-packages] /nix/store/v6mn5q2pffwalmdqam9hshx6lnmab5av-async-2.2.5/nix-support:
  24869. 1737.08 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24870. 1737.09 s [ghc-9.4.8-with-packages] /nix/store/c60sg81w1z2925kyw9drag0v1khnr9fp-barbies-2.1.1.0/nix-support:
  24871. 1737.09 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24872. 1737.09 s [ghc-9.4.8-with-packages] /nix/store/c60sg81w1z2925kyw9drag0v1khnr9fp-barbies-2.1.1.0/nix-support:
  24873. 1737.09 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24874. 1737.10 s [ghc-9.4.8-with-packages] /nix/store/462yg7zm4bgfkzfsrxiryirhjx1s0cab-concurrent-output-1.10.21/nix-support:
  24875. 1737.10 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24876. 1737.10 s [ghc-9.4.8-with-packages] /nix/store/462yg7zm4bgfkzfsrxiryirhjx1s0cab-concurrent-output-1.10.21/nix-support:
  24877. 1737.10 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24878. 1737.10 s [ghc-9.4.8-with-packages] /nix/store/3y7qlb5nyiqq18v1mv2936ks9fnw43hp-lifted-async-0.10.2.7/nix-support:
  24879. 1737.10 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24880. 1737.10 s [ghc-9.4.8-with-packages] /nix/store/3y7qlb5nyiqq18v1mv2936ks9fnw43hp-lifted-async-0.10.2.7/nix-support:
  24881. 1737.10 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24882. 1737.11 s [ghc-9.4.8-with-packages] /nix/store/2f9yr728820hr5hknnbpj6pcndghrvrv-mmorph-1.2.1/nix-support:
  24883. 1737.11 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24884. 1737.11 s [ghc-9.4.8-with-packages] /nix/store/2f9yr728820hr5hknnbpj6pcndghrvrv-mmorph-1.2.1/nix-support:
  24885. 1737.11 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24886. 1737.11 s [ghc-9.4.8-with-packages] /nix/store/cxmidfcc1pfg15jhwcskjp0sak71m4vz-monad-control-1.0.3.1/nix-support:
  24887. 1737.11 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24888. 1737.11 s [ghc-9.4.8-with-packages] /nix/store/cxmidfcc1pfg15jhwcskjp0sak71m4vz-monad-control-1.0.3.1/nix-support:
  24889. 1737.11 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24890. 1737.12 s [ghc-9.4.8-with-packages] /nix/store/233bl99xi6ilwyb0n0z8lqcq8wghjbw3-pretty-show-1.10/nix-support:
  24891. 1737.12 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24892. 1737.12 s [ghc-9.4.8-with-packages] /nix/store/233bl99xi6ilwyb0n0z8lqcq8wghjbw3-pretty-show-1.10/nix-support:
  24893. 1737.12 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24894. 1737.12 s [ghc-9.4.8-with-packages] /nix/store/cyijhm1wvqdhm9b4b41ap0v8a8ar8pr2-primitive-0.9.1.0/nix-support:
  24895. 1737.12 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24896. 1737.13 s [ghc-9.4.8-with-packages] /nix/store/cyijhm1wvqdhm9b4b41ap0v8a8ar8pr2-primitive-0.9.1.0/nix-support:
  24897. 1737.13 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24898. 1737.13 s [ghc-9.4.8-with-packages] /nix/store/sys9r5vn8pmzbrffdps9mrd0j9c3v21w-random-1.2.1.3/nix-support:
  24899. 1737.13 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24900. 1737.13 s [ghc-9.4.8-with-packages] /nix/store/sys9r5vn8pmzbrffdps9mrd0j9c3v21w-random-1.2.1.3/nix-support:
  24901. 1737.13 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24902. 1737.13 s [ghc-9.4.8-with-packages] /nix/store/7qjvf35fl0pkv9wj8n3cx182j24zwm7l-resourcet-1.3.0/nix-support:
  24903. 1737.13 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24904. 1737.14 s [ghc-9.4.8-with-packages] /nix/store/7qjvf35fl0pkv9wj8n3cx182j24zwm7l-resourcet-1.3.0/nix-support:
  24905. 1737.14 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24906. 1737.14 s [ghc-9.4.8-with-packages] /nix/store/r3x9zl5gmlbbclkxs9x9xv5plbqghp68-safe-exceptions-0.1.7.4/nix-support:
  24907. 1737.14 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24908. 1737.14 s [ghc-9.4.8-with-packages] /nix/store/r3x9zl5gmlbbclkxs9x9xv5plbqghp68-safe-exceptions-0.1.7.4/nix-support:
  24909. 1737.14 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24910. 1737.14 s [ghc-9.4.8-with-packages] /nix/store/0hy1fhipcn6f0ygjb20116nb5dvgsaj5-transformers-base-0.4.6/nix-support:
  24911. 1737.14 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24912. 1737.14 s [ghc-9.4.8-with-packages] /nix/store/0hy1fhipcn6f0ygjb20116nb5dvgsaj5-transformers-base-0.4.6/nix-support:
  24913. 1737.14 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24914. 1737.15 s [ghc-9.4.8-with-packages] /nix/store/4ls456xhh8ms32l43agldrhi4m3wl838-wl-pprint-annotated-0.1.0.1/nix-support:
  24915. 1737.15 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24916. 1737.15 s [ghc-9.4.8-with-packages] /nix/store/4ls456xhh8ms32l43agldrhi4m3wl838-wl-pprint-annotated-0.1.0.1/nix-support:
  24917. 1737.15 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24918. 1737.15 s [ghc-9.4.8-with-packages] /nix/store/ncm10l6pk5zmkb3sapfqv4hkg45n16cr-ansi-terminal-types-1.1.3/nix-support:
  24919. 1737.15 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24920. 1737.15 s [ghc-9.4.8-with-packages] /nix/store/ncm10l6pk5zmkb3sapfqv4hkg45n16cr-ansi-terminal-types-1.1.3/nix-support:
  24921. 1737.15 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24922. 1737.16 s [ghc-9.4.8-with-packages] /nix/store/jspa0h3jp93qrkbc5g5a4fzx6pgrf890-hashable-1.4.7.0/nix-support:
  24923. 1737.16 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24924. 1737.16 s [ghc-9.4.8-with-packages] /nix/store/jspa0h3jp93qrkbc5g5a4fzx6pgrf890-hashable-1.4.7.0/nix-support:
  24925. 1737.16 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24926. 1737.16 s [ghc-9.4.8-with-packages] /nix/store/pl48aarrvj4a78524196ynrp0kfa0rlz-distributive-0.6.2.1/nix-support:
  24927. 1737.16 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24928. 1737.17 s [ghc-9.4.8-with-packages] /nix/store/pl48aarrvj4a78524196ynrp0kfa0rlz-distributive-0.6.2.1/nix-support:
  24929. 1737.17 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24930. 1737.17 s [ghc-9.4.8-with-packages] /nix/store/1r4jmk61ibj9l32555cqwkzcizkr9msd-constraints-0.14.2/nix-support:
  24931. 1737.17 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24932. 1737.18 s [ghc-9.4.8-with-packages] /nix/store/1r4jmk61ibj9l32555cqwkzcizkr9msd-constraints-0.14.2/nix-support:
  24933. 1737.18 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24934. 1737.18 s [ghc-9.4.8-with-packages] /nix/store/jcn2fbz35mdbic6gbp9r5vqgh4h265a7-lifted-base-0.2.3.12/nix-support:
  24935. 1737.18 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24936. 1737.18 s [ghc-9.4.8-with-packages] /nix/store/jcn2fbz35mdbic6gbp9r5vqgh4h265a7-lifted-base-0.2.3.12/nix-support:
  24937. 1737.18 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24938. 1737.19 s [ghc-9.4.8-with-packages] /nix/store/9i2ipcbxnddqba4h5kqlz8skd6c4yb9f-transformers-compat-0.7.2/nix-support:
  24939. 1737.19 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24940. 1737.19 s [ghc-9.4.8-with-packages] /nix/store/9i2ipcbxnddqba4h5kqlz8skd6c4yb9f-transformers-compat-0.7.2/nix-support:
  24941. 1737.19 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24942. 1737.19 s [ghc-9.4.8-with-packages] /nix/store/wjr31kxrg5xzjyfjwgfdh31m908893an-splitmix-0.1.3.1/nix-support:
  24943. 1737.19 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24944. 1737.20 s [ghc-9.4.8-with-packages] /nix/store/wjr31kxrg5xzjyfjwgfdh31m908893an-splitmix-0.1.3.1/nix-support:
  24945. 1737.20 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24946. 1737.20 s [ghc-9.4.8-with-packages] /nix/store/w2wfk6ad9zqz33q8cjrm1rnq4rzrkc2f-unliftio-core-0.2.1.0/nix-support:
  24947. 1737.20 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24948. 1737.20 s [ghc-9.4.8-with-packages] /nix/store/w2wfk6ad9zqz33q8cjrm1rnq4rzrkc2f-unliftio-core-0.2.1.0/nix-support:
  24949. 1737.20 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24950. 1737.20 s [ghc-9.4.8-with-packages] /nix/store/lnflkc76zbjzj6nz862nr3d0hgn8y5g5-base-orphans-0.9.3/nix-support:
  24951. 1737.20 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24952. 1737.20 s [ghc-9.4.8-with-packages] /nix/store/lnflkc76zbjzj6nz862nr3d0hgn8y5g5-base-orphans-0.9.3/nix-support:
  24953. 1737.20 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24954. 1737.21 s [ghc-9.4.8-with-packages] /nix/store/rvw80ra5wr1an100njnn6i9gp1wdcipr-os-string-2.0.8/nix-support:
  24955. 1737.21 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24956. 1737.21 s [ghc-9.4.8-with-packages] /nix/store/rvw80ra5wr1an100njnn6i9gp1wdcipr-os-string-2.0.8/nix-support:
  24957. 1737.21 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24958. 1737.21 s [ghc-9.4.8-with-packages] /nix/store/nqfx6vm4r7yzwzfxas9klvp0myx0ijvd-tagged-0.8.9/nix-support:
  24959. 1737.21 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24960. 1737.21 s [ghc-9.4.8-with-packages] /nix/store/nqfx6vm4r7yzwzfxas9klvp0myx0ijvd-tagged-0.8.9/nix-support:
  24961. 1737.21 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24962. 1737.22 s [ghc-9.4.8-with-packages] /nix/store/yrlcjwmlwwmk9x9a3cy8vvn4mlww8kn1-boring-0.2.2/nix-support:
  24963. 1737.22 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24964. 1737.22 s [ghc-9.4.8-with-packages] /nix/store/yrlcjwmlwwmk9x9a3cy8vvn4mlww8kn1-boring-0.2.2/nix-support:
  24965. 1737.22 s [ghc-9.4.8-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/v3q5chlz3g39bvpk3kg7lvqzwma14vjg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24966. 1738.02 s [ghc-9.4.8-with-packages] Warning: haddock-interfaces: /nix/store/nkwi1bfw3z5c4n1fnrlakrslkcgwbk8v-hedgehog-1.5/share/doc/x86_64-linux-ghc-9.4.8/hedgehog-1.5/html/hedgehog.haddock doesn't exist or isn't a file
  24967. 1738.02 s [ghc-9.4.8-with-packages] Warning: haddock-html: /nix/store/nkwi1bfw3z5c4n1fnrlakrslkcgwbk8v-hedgehog-1.5/share/doc/x86_64-linux-ghc-9.4.8/hedgehog-1.5/html doesn't exist or isn't a directory
  24968. 1739.07 s [ghc-9.4.8-with-packages:post-build] Uploading to cachix cache "sellout": /nix/store/xbv0s6q7xssfwa3cmc0n9ajw70hwxw3v-ghc-9.4.8-with-packages
  24969. 1739.49 s [ghc-9.4.8-with-packages:post-build] Pushing 1 paths (112 are already present) using zstd to cache sellout ⏳
  24970. 1739.49 s [ghc-9.4.8-with-packages:post-build]
  24971. 1739.83 s [ghc-9.4.8-with-packages:post-build] Pushing /nix/store/xbv0s6q7xssfwa3cmc0n9ajw70hwxw3v-ghc-9.4.8-with-packages (4.30 MiB)
  24972. 1741.32 s [ghc-9.4.8-with-packages:post-build]
  24973. 1741.32 s [ghc-9.4.8-with-packages:post-build] All done.
  24974. 1741.34 s [ghc-9.4.8-with-packages:post-build] Uploading to the NixCI cache: /nix/store/xbv0s6q7xssfwa3cmc0n9ajw70hwxw3v-ghc-9.4.8-with-packages
  24975. 1741.39 s [ghc-9.4.8-with-packages:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24976. 1741.54 s [ghc-9.4.8-with-packages:post-build] copying 1 paths...
  24977. 1741.54 s [ghc-9.4.8-with-packages:post-build] copying path '/nix/store/xbv0s6q7xssfwa3cmc0n9ajw70hwxw3v-ghc-9.4.8-with-packages' to 'https://cache.nix-ci.com'...
  24978. 1742.52 s [ghc-9.4.8-with-packages:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24979. 1742.70 s [ghc-9.4.8-with-packages:post-build] copying 1 paths...
  24980. 1742.70 s [ghc-9.4.8-with-packages:post-build] copying path '/nix/store/856b25hav7xgwkdjgjcnw8k3fmshc3kj-ghc-9.4.8-with-packages.drv' to 'https://cache.nix-ci.com'...
  24981. 1742.86 s Progress: 16 of 18 built, 161 of 161 downloaded from cache
  24982. 1742.90 s Building /nix/store/zk2i2j3rk91fzi9hpw2sn8qw37s27i00-all-packages.drv
  24983. 1742.96 s [all-packages] created 3 symlinks in user environment
  24984. 1743.00 s [all-packages:post-build] Uploading to cachix cache "sellout": /nix/store/78brphiac0906kqv1llxhigbyi8f3qf6-all-packages
  24985. 1743.40 s [all-packages:post-build] Pushing 1 paths (113 are already present) using zstd to cache sellout ⏳
  24986. 1743.40 s [all-packages:post-build]
  24987. 1743.73 s [all-packages:post-build] Pushing /nix/store/78brphiac0906kqv1llxhigbyi8f3qf6-all-packages (872.00 B)
  24988. 1744.83 s [all-packages:post-build]
  24989. 1744.83 s [all-packages:post-build] All done.
  24990. 1744.85 s [all-packages:post-build] Uploading to the NixCI cache: /nix/store/78brphiac0906kqv1llxhigbyi8f3qf6-all-packages
  24991. 1744.91 s [all-packages:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24992. 1745.07 s [all-packages:post-build] copying 1 paths...
  24993. 1745.07 s [all-packages:post-build] copying path '/nix/store/78brphiac0906kqv1llxhigbyi8f3qf6-all-packages' to 'https://cache.nix-ci.com'...
  24994. 1745.25 s [all-packages:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24995. 1745.46 s [all-packages:post-build] copying 1 paths...
  24996. 1745.46 s [all-packages:post-build] copying path '/nix/store/zk2i2j3rk91fzi9hpw2sn8qw37s27i00-all-packages.drv' to 'https://cache.nix-ci.com'...
  24997. 1745.63 s Progress: 17 of 18 built, 161 of 161 downloaded from cache
  24998. 1745.63 s Progress: 18 of 18 built, 161 of 161 downloaded from cache
  24999. 1745.63 s /nix/store/78brphiac0906kqv1llxhigbyi8f3qf6-all-packages
  25000. 1745.69 s Build succeeded.
Tail Raw Logs